Contrasting LH-HH subband splitting of strained quantum wells grown along [001] and [113] directions

Contrasting responses for the temperature tuning of the electronic structure in semiconductor quantum wells are discussed for heterolayered structures grown along (001) and (113) directions. The temperature affects the strain modulation of the deformation potentials and the effective optical gap is tuned along with the intersub-band splitting in the valence band. A multiband theoretical model accounts for the characterization of the electronic structure, highlighting the main qualitative and quantitative differences between the two systems under study. The microscopic source of strain fields and the detailed mapping of their distribution are provided by a simulation using classical molecular-dynamics technics.

Thermo-optical characteristics and concentration quenching effects in Nd(3+)doped yttrium calcium borate glasses

In this work we present a comprehensive study of the spectroscopic and thermo-optical properties of a set of samples with composition xNd(2)O(3)-(5-x)Y(2)O(3-)40CaO-55B(2)O(3) (0 <= x <= 1.0 mol%). Their fluorescence quantum efficiency (eta) values were determined using the thermal lens technique and the dependence on the ionic concentration was analyzed in terms of energy transfer processes, based on the Forster-Dexter model of multipolar ion-ion interactions. A maximum eta = 0.54 was found to be substantially higher than for yttrium aluminoborate crystals and glasses with comparable Nd(3+) content. As for the thermo-optical properties of yttrium calcium borate, they are comparable to other well-known laser glasses. The obtained energy transfer microparameters and the weak dependence of. on the Nd(3+) concentration with a high optimum Nd(3+) concentration put this system as a strong candidate for photonics applications. (C) 2011 American Institute of Physics. [doi:10.1063/1.3567091]

Social interaction as a heuristic for combinatorial optimization problems

We investigate the performance of a variant of Axelrod's model for dissemination of culture-the Adaptive Culture Heuristic (ACH)-on solving an NP-Complete optimization problem, namely, the classification of binary input patterns of size F by a Boolean Binary Perceptron. In this heuristic, N agents, characterized by binary strings of length F which represent possible solutions to the optimization problem, are fixed at the sites of a square lattice and interact with their nearest neighbors only. The interactions are such that the agents' strings (or cultures) become more similar to the low-cost strings of their neighbors resulting in the dissemination of these strings across the lattice. Eventually the dynamics freezes into a homogeneous absorbing configuration in which all agents exhibit identical solutions to the optimization problem. We find through extensive simulations that the probability of finding the optimal solution is a function of the reduced variable F/N(1/4) so that the number of agents must increase with the fourth power of the problem size, N proportional to F(4), to guarantee a fixed probability of success. In this case, we find that the relaxation time to reach an absorbing configuration scales with F(6) which can be interpreted as the overall computational cost of the ACH to find an optimal set of weights for a Boolean binary perceptron, given a fixed probability of success.

Measurement of the depth of maximum of extensive air showers above 10(18) eV

We describe the measurement of the depth of maximum, X(max), of the longitudinal development of air showers induced by cosmic rays. Almost 4000 events above 10(18) eV observed by the fluorescence detector of the Pierre Auger Observatory in coincidence with at least one surface detector station are selected for the analysis. The average shower maximum was found to evolve with energy at a rate of (106 +/- 35-21) g/cm(2)/decade below 10(18.24) +/- (0.05) eV, and d24 +/- 3 g/cm(2)/ecade above this energy. The measured shower-to-shower fluctuations decrease from about 55 to 26 g/cm(2). The interpretation of these results in terms of the cosmic ray mass composition is briefly discussed.

Density functional theory investigation of 3d, 4d, and 5d 13-atom metal clusters

The knowledge of the atomic structure of clusters composed by few atoms is a basic prerequisite to obtain insights into the mechanisms that determine their chemical and physical properties as a function of diameter, shape, surface termination, as well as to understand the mechanism of bulk formation. Due to the wide use of metal systems in our modern life, the accurate determination of the properties of 3d, 4d, and 5d metal clusters poses a huge problem for nanoscience. In this work, we report a density functional theory study of the atomic structure, binding energies, effective coordination numbers, average bond lengths, and magnetic properties of the 3d, 4d, and 5d metal (30 elements) clusters containing 13 atoms, M(13). First, a set of lowest-energy local minimum structures (as supported by vibrational analysis) were obtained by combining high-temperature first- principles molecular-dynamics simulation, structure crossover, and the selection of five well-known M(13) structures. Several new lower energy configurations were identified, e. g., Pd(13), W(13), Pt(13), etc., and previous known structures were confirmed by our calculations. Furthermore, the following trends were identified: (i) compact icosahedral-like forms at the beginning of each metal series, more opened structures such as hexagonal bilayerlike and double simple-cubic layers at the middle of each metal series, and structures with an increasing effective coordination number occur for large d states occupation. (ii) For Au(13), we found that spin-orbit coupling favors the three-dimensional (3D) structures, i.e., a 3D structure is about 0.10 eV lower in energy than the lowest energy known two-dimensional configuration. (iii) The magnetic exchange interactions play an important role for particular systems such as Fe, Cr, and Mn. (iv) The analysis of the binding energy and average bond lengths show a paraboliclike shape as a function of the occupation of the d states and hence, most of the properties can be explained by the chemistry picture of occupation of the bonding and antibonding states.

On the k-restricted structure ratio in planar and outerplanar graphs

A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-restricted ratio is the infimum, over simple planar graphs H, of the ratio of the number of edges in a maximum k-restricted structure subgraph of H to the number edges of H. We prove that, as k tends to infinity, the planar k-restricted ratio tends to 1/2. The same result holds for the weighted version. Our results are based on analyzing the analogous ratios for outerplanar and weighted outerplanar graphs. Here both ratios tend to 1 as k goes to infinity, and we provide good estimates of the rates of convergence, showing that they differ in the weighted from the unweighted case.

An algorithmic Friedman-Pippenger theorem on tree embeddings and applications

An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).

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.

ON THE THREE-DIMENSIONAL BLASCHKE-LEBESGUE PROBLEM

The width of a closed convex subset of n-dimensional Euclidean space is the distance between two parallel supporting hyperplanes. The Blaschke-Lebesgue problem consists of minimizing the volume in the class of convex sets of fixed constant width and is still open in dimension n >= 3. In this paper we describe a necessary condition that the minimizer of the Blaschke-Lebesgue must satisfy in dimension n = 3: we prove that the smooth components of the boundary of the minimizer have their smaller principal curvature constant and therefore are either spherical caps or pieces of tubes (canal surfaces).

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.

FORAMINIFERAL RECORD OF CHANGES IN SUMMER MONSOON PRECIPITATION AT THE SOUTHEASTERN BRAZILIAN CONTINENTAL MARGIN SINCE THE LAST GLACIAL MAXIMUM

Changes in the oxygen isotopic composition of the planktonic foraminifer Globigerinoides ruber and in the foraminifera faunal composition in a core retrieved from the southeastern Brazilian continental margin were used to infer past changes in the hydrological balance and monsoon precipitation in the western South Atlantic since the Last Glacial Maximum (LGM). The results suggest a first-order orbital (precessional) control on the South American Monsoon precipitation. This agrees with previous studies based on continental proxies except for LGM estimates provided by pollen records. The causes for this disagreement are discussed.

Last glacial maximum (LGM) vegetation changes in the Atlantic Forest, southeastern Brazil

This study was carried out in a continental Atlantic Forest located in the southern region of Sao Paulo State, southeastern Brazil. The aim of the study was to evaluate the vegetation dynamics in similar to 70 km forest ecosystem transect that occurred during the late Pleistocene and Holocene in this region, using the stable carbon isotopes (delta C-13) analysis on soil organic matter (SOM) and the C-14 dating of buried charcoal fragments and the humin fraction of SOM. The isotope data (delta C-13) of SOM in the deeper horizons, indicating the presence of more open vegetation than the present, with a probable mixture of C-3 and C-4 plants, suggesting the presence of a drier climate in the period of similar to 20 ka to similar to 16-14 ka BP. From similar to 16 to 14 ka BP to the present, a significant predominance Of C3 plants was observed, indicating an expansion of the forest, probably associated with the presence of a more humid climate than the previous period. The results indicated the presence of open vegetation during the late glacial, probably associated with a drier period, also observed in other regions of Brazil. The Atlantic Forest ecosystem seems to have developed at least since the early Holocene in Southeastern Brazil. (c) 2007 Elsevier Ltd and INQUA. All rights reserved.

Skewness, splitting number and vertex deletion of some toroidal meshes

The skewness sk(G) of a graph G = (V, E) is the smallest integer sk(G) >= 0 such that a planar graph can be obtained from G by the removal of sk(C) edges. The splitting number sp(G) of C is the smallest integer sp(G) >= 0 such that a planar graph can be obtained from G by sp(G) vertex splitting operations. The vertex deletion vd(G) of G is the smallest integer vd(G) >= 0 such that a planar graph can be obtained from G by the removal of vd(G) vertices. Regular toroidal meshes are popular topologies for the connection networks of SIMD parallel machines. The best known of these meshes is the rectangular toroidal mesh C(m) x C(n) for which is known the skewness, the splitting number and the vertex deletion. In this work we consider two related families: a triangulation Tc(m) x c(n) of C(m) x C(n) in the torus, and an hexagonal mesh Hc(m) x c(n), the dual of Tc(m) x c(n) in the torus. It is established that sp(Tc(m) x c(n)) = vd(Tc(m) x c(n) = sk(Hc(m) x c(n)) = sp(Hc(m) x c(n)) = vd(Hc(m) x c(n)) = min{m, n} and that sk(Tc(m) x c(n)) = 2 min {m, n}.

TOPOGRAPHIC REGISTERS OF PALEO-VALLEYS ON THE SOUTHEASTERN BRAZILIAN CONTINENTAL SHELF

The evolution of paleo-incised-valleys in the Sao Paulo State region of the southeastern Brazilian continental shelf is presented in this study in relation to the post Last Glacial Maximum (LGM) sea-level rises based on the submarine topography modeled by a detailed Digital Elevation Model and evidences noted in high resolution seismic profiles. The hypothesis that has guided this study is that the set of paleo-valley characteristics (i.e. the fluvial parameters of modern coastal drainage systems, the topographical shape and dimensions of the valleys and of the subsurface channels) may indicate aspects of the relation between the influence of the fluvial and the eustatic variation regime in geomorphological-stratigraphic registers. Models described in the literature sustain the view that faster marine transgressions tend to increase erosion in estuaries, which may explain the lack of registers of paleo-drainage both in topography and the sub-surface in areas with wider shelves. On the other hand, on narrower shelves, with a higher slope angle, the transgression process can preserve, or even enhance, the incised valley registers during shoreface retreat. In the area studied, we observed that the dimensions and form of the continental shelf varies from the northern to the southern part of the area, affecting aspects of the geomorphological registers of the submerged incised valleys.

An alternative to the Pythagorean rule? Reevaluating Problem 1 of cuneiform tablet BM 34 568

The first problem of the Seleucid mathematical cuneiform tablet BM 34 568 calculates the diagonal of a rectangle from its sides without resorting to the Pythagorean rule. For this reason, it has been a source of discussion among specialists ever since its first publication. but so far no consensus in relation to its mathematical meaning has been attained. This paper presents two new interpretations of the scribe`s procedure. based on the assumption that he was able to reduce the problem to a standard Mesopotamian question about reciprocal numbers. These new interpretations are then linked to interpretations of the Old Babylonian tablet Plimpton 322 and to the presence of Pythagorean triples in the contexts of Old Babylonian and Hellenistic mathematics. (C) 2007 Elsevier Inc. All rights reserved.