Migration of DCE applications into CORBA and SOAP environments

Legacy applications based on the Distributed Computing Environment (DCE) are subject to several significant limitations. As the development and support of DCE wanes, object‐oriented development becomes more desirable, and transmission over HTTP is established as the preferred protocol over the Internet, DCE application managers and developers are pressed to find extensions and alternatives to DCE. This paper briefly discusses several alternative targets for migration of DCE systems, then proceeds to detail, compare, and contrast two preferred candidates: CORBA and SOAP. Although we have found that developing a general migration solution for legacy DCE applications to CORBA or SOAP to be a non‐trivial, long‐term project, developing specific solutions that are based on a general architecture is feasible. Given a short list of reasonable premises, many DCE applications may be ported to technologies such as CORBA and SOAP. Copyright © 2002 John Wiley & Sons, Ltd.     

On the threshold pinning force in type II superconducting films

The maximum pinning force of a two-dimensional vortex lattice in a random potential is calculated. A connection is established between this threshold pinning force and the potential energy discontinuities due to elastic and plastic instabilities of the vortex lattice. Inspired by recent computer simulations, we assume that the fluctuations in the commensurability between the random potential and the vortex potential breaks the vortex system up into a set of flowing channels in between trapped regions. Two instability mechanisms and their contribution to the threshold force are discussed within this channel-flow picture. We find that three different regimes exist depending on, w, the width of the channels;w=,a ₀w=a ₀ , wherea ₀ is the vortex lattice spacing. Weak pinning superconductors can pass through all three regimes as the reduced magnetic field is varied from 0 to 1, whereas strong pinning compounds can remain in the saturated region (w=a ₀ ) for all values of the field. We compare the expression for the threshold force with experimental results for both strong and weak pinning samples. A satisfactory qualitative agreement is obtained between theory and experiment.     

Wide frequency range sine wave VCO with a tunable inductor andcapacitor

A voltage-controlled oscillator (VCO) with sine wave output has been built using a tunable inductor along with a tunable capacitor to operate at frequencies ranging from 100 kHz to over 20 MHz. The method of tuning the inductor by changing the permeability of its ferrite core and the ability to extend the frequency response of the core are discussed. Dynamic characteristics of the VCO are explained with examples of a parallel and series tank implementation     

Improved Subspace-Based Single-Channel Speech Enhancement Using Generalized Super-Gaussian Priors

Traditional single-channel subspace-based schemes for speech enhancement rely mostly on linear minimum mean-square error estimators, which are globally optimal only if the Karhunen-Loeacuteve transform (KLT) coefficients of the noise and speech processes are Gaussian distributed. We derive in this paper subspace-based nonlinear estimators assuming that the speech KLT coefficients are distributed according to a generalized super-Gaussian distribution which has as special cases the Laplacian and the two-sided Gamma distribution. As with the traditional linear estimators, the derived estimators are functions of the a priori signal-to-noise ratio (SNR) in the subspaces spanned by the KLT transform vectors. We propose a scheme for estimating these a priori SNRs, which is in fact a generalization of the "decision-directed" approach which is well-known from short-time Fourier transform (STFT)-based enhancement schemes. We show that the proposed a priori SNR estimation scheme leads to a significant reduction of the residual noise level, a conclusion which is confirmed in extensive objective speech quality evaluations as well as subjective tests. We also show that the derived estimators based on the super-Gaussian KLT coefficient distribution lead to improvements for different noise sources and levels as compared to when a Gaussian assumption is imposed     

Efficiently adapting graphical models for selectivity estimation

Query optimizers rely on statistical models that succinctly describe the underlying data. Models are used to derive cardinality estimates for intermediate relations, which in turn guide the optimizer to choose the best query execution plan. The quality of the resulting plan is highly dependent on the accuracy of the statistical model that represents the data. It is well known that small errors in the model estimates propagate exponentially through joins, and may result in the choice of a highly sub-optimal query execution plan. Most commercial query optimizers make the attribute value independence assumption: all attributes are assumed to be statistically independent. This reduces the statistical model of the data to a collection of one-dimensional synopses (typically in the form of histograms), and it permits the optimizer to estimate the selectivity of a predicate conjunction as the product of the selectivities of the constituent predicates. However, this independence assumption is more often than not wrong, and is considered to be the most common cause of sub-optimal query execution plans chosen by modern query optimizers. We take a step towards a principled and practical approach to performing cardinality estimation without making the independence assumption. By carefully using concepts from the field of graphical models, we are able to factor the joint probability distribution over all the attributes in the database into small, usually two-dimensional distributions, without a significant loss in estimation accuracy. We show how to efficiently construct such a graphical model from the database using only two-way join queries, and we show how to perform selectivity estimation in a highly efficient manner. We integrate our algorithms into the PostgreSQL DBMS. Experimental results indicate that estimation errors can be greatly reduced, leading to orders of magnitude more efficient query execution plans in many cases. Optimization time is kept in the range of tens of milliseconds, making this a practical approach for industrial-strength query optimizers.     

Oscillation limits for weighted residual methods applied to convective diffusion equations

Convection–diffusion equations are difficult to solve when the convection term dominates because most solution methods give solutions which oscillate in space. Previous criteria based on the one-dimensional convection–diffusion equation have shown that finite difference and Galerkin (linear or quadratic basis functions) will not give oscillatory solutions provided the Peclet number times the mesh size (Pe Δx) is below a critical value. These criteria are based on the solution at the nodes, and ensure that the nodal values are monotone. Similar criteria are developed here for other methods: quadratic Galerkin with upwind weighting, cubic Galerkin, orthogonal collocation on finite elements with quadratic, cubic or quartic polynomials using Lagrangian interpolation, cubic or quartic polynominals using Hermite interpolation, and the method of moments. The nodal values do not oscillate for collocation or moments methods with Hermite cubic polynomials regardless of the value of Pe Δx. A new criterion is developed for all methods based on the monotonicity of the solutions throughout the domain. This criterion is more restrictive than one based only on the nodal values. All methods that are second order (Δx²) or better in truncation error give oscillatory solutions (based on the entire domain) unless Pe Δx is below a critical value. This value ranges from 2 for finite difference methods to 4·6 for Hermite, quartic, collocation methods.     

Fear Appeals,Message Processing Cues,and Credibility in the Websites of Violent,Ideological, and Nonideological Groups

Ideological groups use the Internet to deliver their messages unhindered by the constraints of traditional media. We examined how ideological groups promote their worldview through their websites. Using the elaboration likelihood model (ELM), this research used trained coders to examine the websites of nonideological groups (n = 37), nonviolent ideological groups (n = 36), and violent ideological groups (n = 32) for credibility, persuasion processing cues, and interactivity factors. Results of this study found that the websites of violent ideological groups use more fear appeals, were less interactive, and were the least credible of the 3 groups. All 3 groups used more central cues than peripheral suggesting they focused on evidence for their arguments rather than emotion.     

Miniaturization and integration of photoacoustic detection with amicrofabricated chemical reactor system

Photoacoustic spectroscopy is a useful technique for monitoring chemical composition in mesoscale analysis systems because the detection limit scales favorably with miniaturization. The key element of a photoacoustic spectrometry system is the detector. This work focuses on the miniaturization of photoacoustic detection. In particular, we are using 3.4 μm light to detect propane in a carbon dioxide background-a system that is useful for monitoring combustion reactions. Two systems have been developed. In the first, a miniature photoacoustic cell has been machined into the mounting block of a microfabricated chemical reactor, demonstrating the integration of a photoacoustic detector with a microsystem. The cell used a hearing aid microphone and an infrared diode that was modulated at the first acoustic resonance of the cell. As the gas composition of the cell changed from carbon dioxide to propane the resonance peak was observed to shift and increase, as was expected from theory. This work also presents the first demonstration of a microfabricated photoacoustic detection cell. The cell used an optical microphone and laser excitation brought into the cell via an optical fiber. The light was modulated at a frequency far below the first acoustic resonance, and a signal of 0.05 Pa was observed in the presence of propane     

Structural optimal design of systems with imprecise properties: a possibilistic approach

The optimization problem of structural systems with imprecise properties on the basis of a possibilistic approach is considered. System imprecisions are defined by fuzzy numbers and characterized by membership functions. A methodology for the efficient solution of the optimization process is presented. A two-step method is used to include the imprecision within the optimization, where high quality approximations are used for the evaluation of structural responses. The approximations are constructed using concepts of intermediate response quantities and intermediate variables. The approach is basically an algebraic process which can be implemented very efficiently for the optimal design of general structural systems with imprecise parameters. The method provides more information to the designer than is available using conventional design tools. The effectiveness of the methodology and the interpretation of the results are illustrated by the solution of two example problems.     

Temporal specialization and generalization

A standard relation has two dimensions: attributes and tuples. A temporal relation contains two additional orthogonal time dimensions: valid time records when facts are true in the modeled reality, and transaction time records when facts are stored in the temporal relation. Although there are no restrictions between the valid time and transaction time associated with each fact, in many practical applications the valid and transaction times exhibit restricted interrelationships that define several types of specialized temporal relations. This paper examines areas where different specialized temporal relations are present. In application systems with multiple, interconnected temporal relations, multiple time dimensions may be associated with facts as they flow from one temporal relation to another. The paper investigates several aspects of the resulting generalized temporal relations, including the ability to query a predecessor relation from a successor relation. The presented framework for generalization and specialization allows one to precisely characterize and compare temporal relations and the application systems in which they are embedded. The framework's comprehensiveness and its use in understanding temporal relations are demonstrated by placing previously proposed temporal data models within the framework. The practical relevance of the defined specializations and generalizations is illustrated by sample realistic applications in which they occur. The additional semantics of specialized relations are especially useful for improving the performance of query processing