Dual Characterizations of Set Containments with Strict Convex Inequalities

Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key roles in solving large scale knowledge-based data classification problems where they are used to describe the containments as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments.     

On teletraffic applications to OBS

We provide teletraffic models for loss probability evaluation of optical burst switching (OBS). We show that the popular Engset formula is not exact for OBS modeling and demonstrate that in certain cases it is not appropriate. A new exact model is provided. The various models are compared using numerical results for various OBS alternatives with and without burst segmentation.     

Diffraction by a wedge at skew incidence: integral representations of Cauchy-Carleman for the electromagnetic fields

An electromagnetic diffraction problem in a wedge shaped region is reduced to a system of coupled functional difference equations by means of Sommerfeld integrals and Malyuzhinets theorem. By introducing an integral operator it is shown that the solutions of this system of functional equations can be defined in terms of integral representations whose kernels are solutions of a singular integral equation of Cauchy-Carleman type for which an explicit solution is given.     

Les enjeux économiques de ľinterconnexion des réseaux

The network interconnection and its regulation consist in solving the following dilemma: increase competition and preserve the universal service through access charges, which symbolizes today institutional organization within the telecommunication industry. This paper presents some of the economic and social factors that drive the interconnection policies namely ona (open network architecture) in the United States, or onp (open network provision) in Europe. In the first section, we list some social and economical issues related to open network policies. In the second section, we study the different answers brought up by the regulator through alternative interconnection price formulas. In conclusion, we discuss the stakes and risks of interconnection, while the technological evolution of network introduces intelligent software in switching équipement and implements the tremendous abilities of the digital broadband networks.     

Adaptive space-time reduced-length MMSE receiver for interferencesuppression in DS/CDMA

The authors present an adaptive space-time reduced-length minimum mean-squared error (MMSE) receiver to suppress co-channel interference in the near-far environment for an asynchronous direct-sequence code-division multiple-access (DS/CDMA) system. Simulation results show that better bit-error rate and faster and more stable convergence are achieved over the existing full- and reduced-length MMSE receivers     

Chemical isolation of element 106 from aqueous solutions according to model experiments with short-lived tungsten isotopes

The short-lived isotopes of W and their descendants have been isolated from the products of the bombardment of¹⁴⁴Sm with²⁴Mg by a fast continuous ion-exchange method, using HF solution media. The feasibility of this method for isolation of element 106 is discussed.     

Analysis of plane and axisymmetric flows of incompressible fluids with the stream tube method: Numerical simulation by trust-region optimization algorithm

New concepts for the study of incompressible plane or axisymmetric flows are analysed by the stream tube method. Flows without eddies and pure vortex flows are considered in a transformed domain where the mapped streamlines are rectilinear or circular. The transformation between the physical domain and the computational domain is an unknown of the problem. In order to solve the non-linear set of relevant equations, we present a new algorithm based on a trust region technique which is effective for non-convex optimization problems. Experimental results show that the new algorithm is more robust compared to the Newton-Raphson method.     

Covering codes with improved density

We prove a general recursive inequality concerning /spl mu//sup */(R), the asymptotic (least) density of the best binary covering codes of radius R. In particular, this inequality implies that /spl mu//sup */(R)/spl les/e/spl middot/(RlogR+logR+loglogR+2), which significantly improves the best known density 2/sup R/R/sup R/(R+1)/R!. Our inequality also holds for covering codes over arbitrary alphabets.