Intelligent process analytics for CRM

Many organisations use decision models in their processes such as tables or trees to provide decision support to their operational divisions. For example, in fault management, customer contact centre operators usually use a decision model in the form of prescribed interviews. Based on the answers given by customers, the operator navigates through the decision model to reach an assessment of the problem. In order to achieve customer satisfaction and operational excellence, it is very important to constantly monitor the performance of a decision model not only on an overall level, but also on the level of individual decisions. In this paper we present a configurable business process analytics tool, known as the intelligent Universal Service Management System, that constantly monitors decision data and is capable of optimising the decisions based on high-level business objectives. We explain the various features of the software and show how it can be used to optimise decision processes. We also show how we can easily provide a customised version to monitor the performance of provision processes.     

Profile-Driven Component Placement for Cluster-Based Online Services

The growth of the Internet and of various intranets has spawned a wealth of online services, most of which are implemented on local-area clusters using remote invocation (for example, remote procedure call/remote method invocation) among manually placed application components. Component placement can be a significant challenge for large-scale services, particularly when application resource needs are workload dependent. Automatic component placement has the potential to maximize overall system throughput. The key idea is to construct (offline) a mapping between input workload and individual-component resource consumption. Such mappings, called component profiles, then support high-performance placement. Preliminary results on an online auction benchmark based on J2EE (Java 2 Platform, Enterprise Edition) suggest that profile-driven tools can identify placements that achieve near-optimal overall throughput.     

Minimax estimation of deterministic parameters in linear models with a random model matrix

We consider the problem of estimating an unknown deterministic parameter vector in a linear model with a random model matrix, with known second-order statistics. We first seek the linear estimator that minimizes the worst-case mean-squared error (MSE) across all parameter vectors whose (possibly weighted) norm is bounded above. We show that the minimax MSE estimator can be found by solving a semidefinite programming problem and develop necessary and sufficient optimality conditions on the minimax MSE estimator. Using these conditions, we derive closed-form expressions for the minimax MSE estimator in some special cases. We then demonstrate, through examples, that the minimax MSE estimator can improve the performance over both a Baysian approach and a least-squares method. We then consider the case in which the norm of the parameter vector is also bounded below. Since the minimax MSE approach cannot account for a nonzero lower bound, we consider, in this case, a minimax regret method in which we seek the estimator that minimizes the worst-case difference between the MSE attainable using a linear estimator that does not know the parameter vector, and the optimal MSE attained using a linear estimator that knows the parameter vector. For analytical tractability, we restrict our attention to the scalar case and develop a closed-form expression for the minimax regret estimator.     

X-ray or UV adjustment of MOS threshold voltage: Analytical and numerical modeling

A model is formulated that describes how radiation-induced charge accumulates in the gate oxide of a MOS structure and how it decays through tunneling and thermal emission. The model is used in a numerical analysis of the x-ray or UV adjustment of threshold voltage in MOS-circuit manufacture. The limits of this process technique are evaluated.     

Nondegenerate Phase-Locking of a Semiconductor Laser by Sideband Injection

A semiconductor laser rate equation theory is presented that describes sideband injection locking under both weak optical injection and current modulation. By simultaneous optical injection and current modulation, control of both the phase and the frequency of a semiconductor laser is demonstrated. The phase-locked semiconductor laser operates at a different frequency to the optical injection source, with a frequency-difference given by the current modulation frequency. This method can be used to produce broadband sources, such as those producing ultrashort pulses and those required for coherent control, or to create high-frequency electronic oscillator sources with phase control by interference beating     

1/f noise in large-area Hg<Subscript>1−x</Subscript>Cd<Subscript>x</Subscript>Te photodiodes

The 1/f noise in photovoltaic (PV) molecular-beam epitaxy (MBE)-grown Hg_1−xCd_xTe double-layer planar heterostructure (DLPH) large-area detectors is a critical noise component with the potential to limit sensitivity of the cross-track infrared sounder (CrIS) instrument. Therefore, an understanding of the origins and mechanisms of noise currents in these PV detectors is of great importance. Excess low-frequency noise has been measured on a number of 1000-μm-diameter active-area detectors of varying “quality” (i.e., having a wide range of I-V characteristics at 78 K). The 1/f noise was measured as a function of cut-off wavelength under illuminated conditions. For short-wave infrared (SWIR) detectors at 98 K, minimal 1/f noise was measured when the total current was dominated by diffusion with white noise spectral density in the mid-10⁻¹⁵A/Hz^1/2 range. For SWIR detectors dominated by other than diffusion current, the ratio, α, of the noise current in unit bandwidth i_n(f = 1 Hz, V_d = −60 mV, and Δf = 1 Hz) to dark current I_d(V_d = −60 mV) was α_SW-d = i_n/I_d ∼ 1 × 10⁻³. The SWIR detectors measured at 0 mV under illuminated conditions had median α_SW-P = i_n/I_ph ∼ 7 × 10⁻⁶. For mid-wave infrared (MWIR) detectors, α_MW-d = i_n/I_d ∼ 2 × 10⁻⁴, due to tunneling current contributions to the 1/f noise. Measurements on forty-nine 1000-μm-diameter MWIR detectors under illuminated conditions at 98 K and −60 mV bias resulted in α_MW-P = i_n/I_ph = 4.16 ± 1.69 × 10⁻⁶. A significant point to note is that the photo-induced noise spectra are nearly identical at 0 mV and 100 mV reverse bias, with a noise-current-to-photocurrent ratio, α_MW-P, in the mid 10⁻⁶ range. For long-wave infrared (LWIR) detectors measured at 78 K, the ratio, α_LW-d = i_n/I_d ∼ 6 × 10⁻⁶, for the best performers. The majority of the LWIR detectors exhibited α_LW-d on the order of 2 × 10⁻⁵. The photo-induced 1/f noise had α_LW-P = i_n/I_ph ∼ 5 × 10⁻⁶. The value of the noise-current-to-dark-current ratio, α appears to increase with increasing bandgap. It is not clear if this is due to different current mechanisms impacting 1/f noise performance. Measurements on detectors of different bandgaps are needed at temperatures where diffusion current is the dominant current. Excess low-frequency noise measurements made as a function of detector reverse bias indicate 1/f noise may result primarily from the dominant current mechanism at each particular bias. The 1/f noise was not a direct function of the applied bias.     

Effect of Sb implantation on copper silicides formation and morphology after annealing of Cu/Si structures

In this work, the solid state reaction between a thin film of copper and silicon has been studied using Rutherford backscattering spectroscopy, X-ray diffraction, scanning electron microscopy and microprobe analysis. Cu films of 400 and 900 Å thicknesses are thermally evaporated on Si(1 1 1) substrates, part of them had previously been implanted with antimony ions of 5×10¹⁴ or 5×10¹⁵ at. cm⁻² doses. The samples are heat-treated in vacuum at temperatures in the range 200–700 °C for various times. The results show the growth and formation of Cu₃Si and Cu₄Si silicides under crystallites shape dispatched on the sample surface, independently of the implantation dose. On the other hand, it is established that the copper layer is less and less consumed as the antimony dose increases, resulting in the accumulation of Sb⁺ ions at silicide/Si interface and in the silicide layer close to surface. The exposure of samples to air at room temperature shows the stability of Cu₄Si phase whereas the Cu₃Si silicide disappears to the benefit of the silicon dioxide formation. The observed phenomena are discussed.     

A VQ-based blind image restoration algorithm

Learning-based algorithms for image restoration and blind image restoration are proposed. Such algorithms deviate from the traditional approaches in this area, by utilizing priors that are learned from similar images. Original images and their degraded versions by the known degradation operator (restoration problem) are utilized for designing the VQ codebooks. The codevectors are designed using the blurred images. For each such vector, the high frequency information obtained from the original images is also available. During restoration, the high frequency information of a given degraded image is estimated from its low frequency information based on the codebooks. For the blind restoration problem, a number of codebooks are designed corresponding to various versions of the blurring function. Given a noisy and blurred image, one of the codebooks is chosen based on a similarity measure, therefore providing the identification of the blur. To make the restoration process computationally efficient, the principal component analysis (PCA) and VQ-nearest neighbor approaches are utilized. Simulation results are presented to demonstrate the effectiveness of the proposed algorithms.     

QR factoring to compute the GCD of univariate approximate polynomials

We present a stable and practical algorithm that uses QR factors of the Sylvester matrix to compute the greatest common divisor (GCD) of univariate approximate polynomials over /spl Ropf/[x] or /spl Copf/[x]. An approximate polynomial is a polynomial with coefficients that are not known with certainty. The algorithm of this paper improves over previously published algorithms by handling the case when common roots are near to or outside the unit circle, by splitting and reversal if necessary. The algorithm has been tested on thousands of examples, including pairs of polynomials of up to degree 1000, and is now distributed as the program QRGCD in the SNAP package of Maple 9.