Strangeness saturation: Dependence on system-size, centrality and energy

The dependence of the strangeness saturation factor on the system size, centrality and energy is studied in relativistic heavy-ion collisions.     

Hollow latex particles as submicrometer reactors for polymerization in confined geometries

A method was developed for free‐radical polymerization in the confines of a hollow latex particle. Hollow particles were prepared via the dynamic swelling method from polystyrene seed and divinylbenzene and had hollows of 500–1000 nm. So that these hollow poly(divinylbenzene) particles could function as submicrometer reactors, the particles were filled with a monomer (N‐isopropylacrylamide) via the dispersion of the dried particles in the molten monomer. The monomer that was not contained in the hollows was removed by washing and gentle abrasion. Free‐radical polymerization was then initiated by γ radiolysis in the solid state. Transmission electron microscopy showed that poly(N‐isopropylacrylamide) formed in the hollow interior of the particles, which functioned as submicrometer reactors. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 5706–5713, 2004     

Global expression analysis of CESA and CSL genes in Arabidopsis

We have used Affymetrix gene chips to measure the expression of 10 CESA and 29 CSL genes of Arabidopsis in different developmental stages or organs. These measurements reveal that many of the genes exhibit different levels of expression in the various organs. While several CESA genes are highly expressed in all the tissues examined, very few CSL genes approach such high levels of expression. This suggests that the CSL genes either encode enzymes for the synthesis of minor components of cell walls or are expressed only in specific cell types. The expression data also highlights the potential importance of the CESA genes for primary and secondary cell wall formation during different developmental stages and in the different organs examined.     

Resolvability theory for the multiple-access channel

We study the randomness needed for approximating the output distribution of a multiple-access channel, where the original input processes are independent of each other. The approximation is achieved by simulating (possibly alternative) input processes at each of the entries, where the sources of randomness available for the simulators are independent of each other, and the simulators do not cooperate. The resolvability region of a multiple-access channel is defined as the set of all random-bit rate pairs at which accurate output approximation is possible, where the simulation accuracy is measured by the variational distance between finite-dimensional output distributions. Inner and outer bounds on the resolvability region are derived, and close relations between the concepts of resolvability region and capacity region are demonstrated     

The representation dimension of domestic weakly symmetric algebras

Auslander’s representation dimension measures how far a finite dimensional algebra is away from being of finite representation type. In [1], M. Auslander proved that a finite dimensional algebra A is of finite representation type if and only if the representation dimension of A is at most 2. Recently, R. Rouquier proved that there are finite dimensional algebras of an arbitrarily large finite representation dimension. One of the exciting open problems is to show that all finite dimensional algebras of tame representation type have representation dimension at most 3. We prove that this is true for all domestic weakly symmetric algebras over algebraically closed fields having simply connected Galois coverings.     

Sequential amplitude estimation in multiuser communications

Considers the problem of multiuser amplitude estimation, i.e., the problem of estimating the amplitudes of several digital communications signals superimposed in the same channel. This problem is of importance in communications environments such as spread-spectrum radio networks, in which nonorthogonal multiplexing is used. Multiuser amplitude estimation is a critical prerequisite to the optimum demodulation of such signals using, for example, Verdu's algorithm. In the present paper, a sequential detection-estimation approach is applied to this problem, and several estimation paradigms, including the method of moments and likelihood-based estimators, are considered. The consistency, asymptotic variance, and complexity of these estimators are examined. A new method of constructing a recursive consistent and asymptotically efficient estimation algorithm out of a consistent estimator sequence is also suggested and is applied to the current setup. It is seen that detector-estimators that use these estimators in Verdu's algorithm result, asymptotically, in (known-amplitude) optimum error probabilities with little relative increase in complexity per demodulated bit