Femtosecond third-harmonic generation in a glass ceramic containing sodium niobate nanocrystals

The third-harmonic optical susceptibility, chi((3))(3 omega; omega, omega, omega) of a silicate glass ceramic containing sodium niobate nanocrystals was measured for incident broadband light with central frequency omega corresponding to 1900nm. Absolute values of |chi((3))| and the dispersion of the refractive index from 600 to 1900nm were measured using the spectrally resolved femtosecond Maker fringes technique. The experiments show that |chi((3))| is 1 order of magnitude larger than silica, and it grows by similar to 50% when the volume fraction occupied by the nanocrystals increases up to 40%. (C) 2011 Optical Society of America

A study of disorder effects in random (Al(x)Ga(1-x)As)(n)(Al(y)Ga(1-y)As)(m) superlattices embedded in a wide parabolic potential

A photoluminescence (PL) study of the individual electron states localized in a random potential is performed in artificially disordered superlattices embedded in a wide parabolic well. The valence band bowing of the parabolic potential provides a variation of the emission energies which splits the optical transitions corresponding to different wells within the random potential. The blueshift of the PL lines emitted by individual random wells, observed with increasing disorder strength, is demonstrated. The variation of temperature and magnetic field allowed for the behavior of the electrons localized in individual wells of the random potential to be distinguished.

Delocalization-localization transition of plasmons in random (GaAs)(m)(Al(0.3)Ga(0.7)As)(6) superlattices

The transition of plasmons from propagating to localized state was studied in disordered systems formed in GaAs/AlGaAs superlattices by impurities and by artificial random potential. Both the localization length and the linewidth of plasmons were measured by Raman scattering. The vanishing dependence of the plasmon linewidth on the disorder strength was shown to be a manifestation of the strong plasmon localization. The theoretical approach based on representation of the plasmon wave function in a Gaussian form well accounted for by the obtained experimental data.

Directed Abelian algebras and their application to stochastic models

With each directed acyclic graph (this includes some D-dimensional lattices) one can associate some Abelian algebras that we call directed Abelian algebras (DAAs). On each site of the graph one attaches a generator of the algebra. These algebras depend on several parameters and are semisimple. Using any DAA, one can define a family of Hamiltonians which give the continuous time evolution of a stochastic process. The calculation of the spectra and ground-state wave functions (stationary state probability distributions) is an easy algebraic exercise. If one considers D-dimensional lattices and chooses Hamiltonians linear in the generators, in finite-size scaling the Hamiltonian spectrum is gapless with a critical dynamic exponent z=D. One possible application of the DAA is to sandpile models. In the paper we present this application, considering one- and two-dimensional lattices. In the one-dimensional case, when the DAA conserves the number of particles, the avalanches belong to the random walker universality class (critical exponent sigma(tau)=3/2). We study the local density of particles inside large avalanches, showing a depletion of particles at the source of the avalanche and an enrichment at its end. In two dimensions we did extensive Monte-Carlo simulations and found sigma(tau)=1.780 +/- 0.005.

Inference of gene regulatory networks from time series by Tsallis entropy

Background: The inference of gene regulatory networks (GRNs) from large-scale expression profiles is one of the most challenging problems of Systems Biology nowadays. Many techniques and models have been proposed for this task. However, it is not generally possible to recover the original topology with great accuracy, mainly due to the short time series data in face of the high complexity of the networks and the intrinsic noise of the expression measurements. In order to improve the accuracy of GRNs inference methods based on entropy (mutual information), a new criterion function is here proposed. Results: In this paper we introduce the use of generalized entropy proposed by Tsallis, for the inference of GRNs from time series expression profiles. The inference process is based on a feature selection approach and the conditional entropy is applied as criterion function. In order to assess the proposed methodology, the algorithm is applied to recover the network topology from temporal expressions generated by an artificial gene network (AGN) model as well as from the DREAM challenge. The adopted AGN is based on theoretical models of complex networks and its gene transference function is obtained from random drawing on the set of possible Boolean functions, thus creating its dynamics. On the other hand, DREAM time series data presents variation of network size and its topologies are based on real networks. The dynamics are generated by continuous differential equations with noise and perturbation. By adopting both data sources, it is possible to estimate the average quality of the inference with respect to different network topologies, transfer functions and network sizes. Conclusions: A remarkable improvement of accuracy was observed in the experimental results by reducing the number of false connections in the inferred topology by the non-Shannon entropy. The obtained best free parameter of the Tsallis entropy was on average in the range 2.5 <= q <= 3.5 (hence, subextensive entropy), which opens new perspectives for GRNs inference methods based on information theory and for investigation of the nonextensivity of such networks. The inference algorithm and criterion function proposed here were implemented and included in the DimReduction software, which is freely available at http://sourceforge.net/projects/dimreduction and http://code.google.com/p/dimreduction/.

On the resilience of long cycles in random graphs

In this paper we determine the local and global resilience of random graphs G(n,p) (p >> n(-1)) with respect to the property of containing a cycle of length at least (1 - alpha)n. Roughly speaking, given alpha > 0, we determine the smallest r(g) (G, alpha) with the property that almost surely every subgraph of G = G(n,p) having more than r(g) (G, alpha)vertical bar E(G)vertical bar edges contains a cycle of length at least (1 - alpha)n (global resilience). We also obtain, for alpha < 1/2, the smallest r(l) (G, alpha) such that any H subset of G having deg(H) (v) larger than r(l) (G, alpha) deg(G) (v) for all v is an element of V(G) contains a cycle of length at least (1 - alpha)n (local resilience). The results above are in fact proved in the more general setting of pseudorandom graphs.

TESTING STATISTICAL HYPOTHESIS ON RANDOM TREES AND APPLICATIONS TO THE PROTEIN CLASSIFICATION PROBLEM

Efficient automatic protein classification is of central importance in genomic annotation. As an independent way to check the reliability of the classification, we propose a statistical approach to test if two sets of protein domain sequences coming from two families of the Pfam database are significantly different. We model protein sequences as realizations of Variable Length Markov Chains (VLMC) and we use the context trees as a signature of each protein family. Our approach is based on a Kolmogorov-Smirnov-type goodness-of-fit test proposed by Balding et at. [Limit theorems for sequences of random trees (2008), DOI: 10.1007/s11749-008-0092-z]. The test statistic is a supremum over the space of trees of a function of the two samples; its computation grows, in principle, exponentially fast with the maximal number of nodes of the potential trees. We show how to transform this problem into a max-flow over a related graph which can be solved using a Ford-Fulkerson algorithm in polynomial time on that number. We apply the test to 10 randomly chosen protein domain families from the seed of Pfam-A database (high quality, manually curated families). The test shows that the distributions of context trees coming from different families are significantly different. We emphasize that this is a novel mathematical approach to validate the automatic clustering of sequences in any context. We also study the performance of the test via simulations on Galton-Watson related processes.

Survival time of random walk in random environment among soft obstacles

We consider a Random Walk in Random Environment (RWRE) moving in an i.i.d. random field of obstacles. When the particle hits an obstacle, it disappears with a positive probability. We obtain quenched and annealed bounds on the tails of the survival time in the general d-dimensional case. We then consider a simplified one-dimensional model (where transition probabilities and obstacles are independent and the RWRE only moves to neighbour sites), and obtain finer results for the tail of the survival time. In addition, we study also the ""mixed"" probability measures (quenched with respect to the obstacles and annealed with respect to the transition probabilities and vice-versa) and give results for tails of the survival time with respect to these probability measures. Further, we apply the same methods to obtain bounds for the tails of hitting times of Branching Random Walks in Random Environment (BRWRE).

A PHASE TRANSITION FOR COMPETITION INTERFACES

We study the competition interface between two growing clusters in a growth model associated to last-passage percolation. When the initial unoccupied set is approximately a cone, we show that this interface has an asymptotic direction with probability 1. The behavior of this direction depends on the angle theta of the cone: for theta >= 180 degrees, the direction is deterministic, while for theta < 180 degrees, it is random, and its distribution can be given explicitly in certain cases. We also obtain partial results on the fluctuations of the interface around its asymptotic direction. The evolution of the competition interface in the growth model can be mapped onto the path of a second-class particle in the totally asymmetric simple exclusion process; from the existence of the limiting direction for the interface, we obtain a new and rather natural proof of the strong law of large numbers (with perhaps a random limit) for the position of the second-class particle at large times.

Multiclass Hammersley-Aldous-Diaconis process and multiclass-customer queues

In the Hammersley-Aldous-Diaconis process, infinitely many particles sit in R and at most one particle is allowed at each position. A particle at x, whose nearest neighbor to the right is at y, jumps at rate y - x to a position uniformly distributed in the interval (x, y). The basic coupling between trajectories with different initial configuration induces a process with different classes of particles. We show that the invariant measures for the two-class process can be obtained as follows. First, a stationary M/M/1 queue is constructed as a function of two homogeneous Poisson processes, the arrivals with rate, and the (attempted) services with rate rho > lambda Then put first class particles at the instants of departures (effective services) and second class particles at the instants of unused services. The procedure is generalized for the n-class case by using n - 1 queues in tandem with n - 1 priority types of customers. A multi-line process is introduced; it consists of a coupling (different from Liggett's basic coupling), having as invariant measure the product of Poisson processes. The definition of the multi-line process involves the dual points of the space-time Poisson process used in the graphical construction of the reversed process. The coupled process is a transformation of the multi-line process and its invariant measure is the transformation described above of the product measure.

Random perturbations of stochastic processes with unbounded variable length memory

We consider binary infinite order stochastic chains perturbed by a random noise. This means that at each time step, the value assumed by the chain can be randomly and independently flipped with a small fixed probability. We show that the transition probabilities of the perturbed chain are uniformly close to the corresponding transition probabilities of the original chain. As a consequence, in the case of stochastic chains with unbounded but otherwise finite variable length memory, we show that it is possible to recover the context tree of the original chain, using a suitable version of the algorithm Context, provided that the noise is small enough.

An oracle approach for interaction neighborhood estimation in random fields

We consider the problem of interaction neighborhood estimation from the partial observation of a finite number of realizations of a random field. We introduce a model selection rule to choose estimators of conditional probabilities among natural candidates. Our main result is an oracle inequality satisfied by the resulting estimator. We use then this selection rule in a two-step procedure to evaluate the interacting neighborhoods. The selection rule selects a small prior set of possible interacting points and a cutting step remove from this prior set the irrelevant points. We also prove that the Ising models satisfy the assumptions of the main theorems, without restrictions on the temperature, on the structure of the interacting graph or on the range of the interactions. It provides therefore a large class of applications for our results. We give a computationally efficient procedure in these models. We finally show the practical efficiency of our approach in a simulation study.

Structural control of gold nanoparticles self-assemblies by layer-by-layer process

This work presents a novel way to introduce gold nanoparticles (Au NPs) in a multilayer polymer produced by the layer-by-layer (LbL) assembling technique. The technique chosen shows that, depending on the pH used, different morphological structures can be obtained from monolayer or bilayer Au NPs. The MEIS and RBS techniques allowed for the modelling of the interface polymer-NPs, as well as the understanding of the interaction of LbL system, when adjusting the pH in weak polyelectrolytes. The process reveals that the optical properties of multilayer systems could be fine-tuned by controlling the addition of metallic nanoparticles, which could also modify specific polarization responses.

Quality of sugarcane in productive process of ethanol evaluated by INAA

Soil as an impurity in sugarcane is a serious problem for the ethanol industry, increasing production and maintenance costs and reducing the productivity. Fe, Hf, Sc and Th determined by INAA were used as tracers to assess the amount of soil in sugarcane from truckloads as well as in the juice extraction process. Quality control tools were applied to results identifying the need for stratification according to soil type and moisture. Soil levels of truckloads had high variability indicating potential for improving cut and loading operations. Samples from the juice extraction process allowed tracking the soil in the mill tandem.

MODIFICATIONS ON LEAF ANATOMY OF BANANA DURING THE MICROPROPAGATION PROCESS

The study and understanding of alterations taking place during the micropropagation process can provide valuable information about this technology. The objective of this work was to evaluate the anatomical modifications in leaves of micropropagated banana (Musa spp.) plants during their adaptation to ex vitro conditions. Aseptic axillary shoots of `Preciosa` cultivar (AAAB) were rooted for 24 days in MS medium containing NAA (1mg.l(-1)) and agar (6g.l(-1)), and acclimatized for 120 days. The treatments consisted of leaves at different stages of development: T1 - leaves from plants at the end of in vitro rooting phase, T2 persistent leaves from plants after 30 days of acclimatization, T3 - new leaves from plants after 30 days of acclimatization (transition leaves). T4 - transition leaves from plants after 60 days, T5 - new leaves from plants after 60 days of acclimatization, and T6 - new leaves from plants after 120 days of acclimatization. A higher degree of differentiation and, thereby, better adaptation took place in leaves from leaf primordial differentiated in ex vitro conditions. The acclimatization phase is crucial for a greater thickness and differentiation of spongy and palisade parenchyma, and to correct the modifications of plants developed in vitro. The study of leaf anatomy provides a better understanding of alterations occurring in micropropagated banana plants.