Partial hyperbolicity for symplectic diffeomorphisms

We prove that every robustly transitive and every stably ergodic symplectic diffeomorphism on a compact manifold admits a dominated splitting. In fact, these diffeomorphisms are partially hyperbolic. (c) 2005 Elsevier SAS. All rights reserved.

Automation of shear-wave splitting parameter determination of local earthquakes at Yellowstone : application as indicator of crustal stress and temporal variation

Shear-wave splitting can be a useful technique for determining crustal stress fields in volcanic settings and temporal variations associated with activity. Splitting parameters were determined for a subset of local earthquakes recorded from 2000-2010 at Yellowstone. Analysis was automated using an unsupervised cluster analysis technique to determine optimum splitting parameters from 270 analysis windows for each event. Six stations clearly exhibit preferential fast polarization values sub-orthogonal to the direction of minimum horizontal compression. Yellowstone deformation results in a local crustal stress field differing from the regional field dominated by NE-SW extension, and fast directions reflect this difference rotating around the caldera maintaining perpendicularity to the rim. One station exhibits temporal variations concordant with identified periods of caldera subsidence and uplift. From splitting measurements, we calculated a crustal anisotropy of ~17-23% and crack density ~0.12-0.17 possibly resulting from stress-aligned fluid filled microcracks in the upper crust and an active hydrothermal system.

Circulation and suspended particulate matter transport in a tidally dominated estuary: caravelas estuary, Bahia, Brazil

The circulation and transport of suspended particulate matter in the Caravelas Estuary are assessed. Nearly-synoptic hourly hydrographic, current (ADCP velocity and volume transport) and suspended particulate matter data were collected during a full semidiurnal spring tide, on the two transects Boca do Tomba and Barra Velha and on longitudinal sections at low and high tide. On the first transect the peak ebb currents (-1.5 ms-1) were almost twice as strong as those of the wider and shallow Barra Velha inlet (-0.80 ms-1) and the peak flood currents were 0.75 and 0.60 ms-1, respectively. Due to the strong tidal currents both inlets had weak vertical salinity stratification and were classified with the Stratification-circulation Diagram as Type 2a (partially mixed-weakly stratified) and Type 1a (well mixed). Volume transports were very close, ranging from -3,500 to 3,100 m³s-1 at the ebb and flood, respectively, with a residual -630 m³s-1. The concentration of the suspended particulate matter was closely related to the tidal variation and decreased landwards from 50 mg.L-1 at the estuary mouth, to 10 mg.L-1 at distances of 9 and 16 km for the low and high tide experiments, respectively. The total residual SPM transport was out of the estuary at rates of -18 tons per tidal cycle.

Measurement of the Neutrino Mass Splitting and Flavor Mixing by MINOS

Measurements of neutrino oscillations using the disappearance of muon neutrinos from the Fermilab NuMI neutrino beam as observed by the two MINOS detectors are reported. New analysis methods have been applied to an enlarged data sample from an exposure of 7.25 x 10(20) protons on target. A fit to neutrino oscillations yields values of vertical bar Delta m(2)vertical bar = (2.32(-0.08)(+0.12) x 10(-3) eV(2) for the atmospheric mass splitting and sin(2)(2 theta) > 0.90 (90% C.L.) for the mixing angle. Pure neutrino decay and quantum decoherence hypotheses are excluded at 7 and 9 standard deviations, respectively.

Splitting of the zero-energy edge states in bilayer graphene

Bilayer graphene nanoribbons with zigzag termination are studied within the tight-binding model. We also include single-site electron-electron interactions via the Hubbard model within the unrestricted Hartree-Fock approach. We show that either the interactions between the outermost edge atoms or the presence of a magnetic order can cause a splitting of the zero-energy edge states. Two kinds of edge alignments are considered. For one kind of edge alignment (?) the system is nonmagnetic unless the Hubbard parameter U becomes greater than a critical value Uc. For the other kind of edge alignment (?) the system is magnetic for any U>0. Our results agree very well with ab initio density functional theory calculations.

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.

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}.

A report on socioeconomic attributes and gender inequality in Kondh-dominated villages: A comparative analysis of tribals and non-tribals in the Phulbani district, Orissa, India

Reports on results of a survey, completed in 2000, of wives in three villages in the Phulbani district, Orissa, India. These villages are dominated by the Kondh scheduled tribe but some also contain members of the scheduled caste, called Dombs in Orissa. The article reports on the total responses and comparative responses of these groups to a structured questionnaire. The article provides background information for the villages surveyed, and reports information in relation to wives and their families about property rights, assets and incomes, economic conditions and survival strategies, aspects of credit, production and marketing, social dynamics and eduction. In addition, children’s affairs, including the treatment and entitlements of female and male children, are considered as well as additional aspects of the socioeconomic status of wives.

On the importance function in splitting simulation

The splitting method is a simulation technique for the estimation of very small probabilities. In this technique, the sample paths are split into multiple copies, at various stages in the simulation. Of vital importance to the efficiency of the method is the Importance Function (IF). This function governs the placement of the thresholds or surfaces at which the paths are split. We derive a characterisation of the optimal IF and show that for multi-dimensional models the natural choice for the IF is usually not optimal. We also show how nearly optimal splitting surfaces can be derived or simulated using reverse time analysis. Our numerical experiments illustrate that by using the optimal IF, one can obtain a significant improvement in simulation efficiency.

Competition and resource availability in an annual plant community dominated by an invasive species, Carrichtera annua (L. Aschers.), in South Australia

The last decade has seen spirited debates about how resource availability affect the intensity of competition. This paper examines the effect that a dominant introduced species, Carrichtera annua, has upon the winter annual community in the arid chenopod shrublands of South Australia. Manipulative field experiments were conducted to assess plant community response to changing below-ground resource levels and to the manipulation of the density of C. annua. Changes in the density of C. annua had little effect on the abundance of all other species in the guild. Nutrient addition produced an increase in the biomass of the most abundant native species, Crassula colorata. An analysis of the root distribution of the main species suggested that the areas of soil resource capture of C. annua and C. colorata are largely segregated. Our results suggest that intraspecific competition may be stronger than interspecific competition, controlling the species responses to increased resource availability. The results are consistent with a two-phase resource dynamics systems, with pulses of high resource availability triggering growth, followed by pulses of stress. Smaller plants were nutrient limited under natural field conditions, suggesting that stress experienced during long interpulse phases may override competitive effects after short pulse phases. The observed differences in root system structure will determine when plants of a different species are experiencing a pulse or an interpulse phase. We suggest that the limitations to plant recruitment and growth are the product of a complex interplay between the length and intensity of the pulse of resource availability, the duration and severity of the interpulse periods, and biological characters of the species.

On the implementation of real-time slotbased task-splitting scheduling algorithms for multiprocessor systems

In this paper we discuss challenges and design principles of an implementation of slot-based tasksplitting algorithms into the Linux 2.6.34 version. We show that this kernel version is provided with the required features for implementing such scheduling algorithms. We show that the real behavior of the scheduling algorithm is very close to the theoretical. We run and discuss experiments on 4-core and 24-core machines.

Implementing slot-based task-splitting multiprocessor scheduling

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task-splitting scheduling algorithm. Task-splitting (also called semi-partitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A particular type of task-splitting algorithms, called slot-based task-splitting dispatching, is of particular interest because of its ability to schedule tasks with high processor utilizations. Unfortunately, no slot-based task-splitting algorithm has been implemented in a real operating system so far. In this paper we discuss and propose some modifications to the slot-based task-splitting algorithm driven by implementation concerns, and we report the first implementation of this family of algorithms in a real operating system running Linux kernel version 2.6.34. We have also conducted an extensive range of experiments on a 4-core multicore desktop PC running task-sets with utilizations of up to 88%. The results show that the behavior of our implementation is in line with the theoretical framework behind it.

Practical aspects of slot-based task- splitting dispatching in its schedulability analysis

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a tasksplitting scheduling algorithm. Task-splitting (also called semipartitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.

Implementing multicore real-time scheduling algorithms based on task splitting using ada 2012

Multiprocessors, particularly in the form of multicores, are becoming standard building blocks for executing reliable software. But their use for applications with hard real-time requirements is non-trivial. Well-known realtime scheduling algorithms in the uniprocessor context (Rate-Monotonic [1] or Earliest-Deadline-First [1]) do not perform well on multiprocessors. For this reason the scientific community in the area of real-time systems has produced new algorithms specifically for multiprocessors. In the meanwhile, a proposal [2] exists for extending the Ada language with new basic constructs which can be used for implementing new algorithms for real-time scheduling; the family of task splitting algorithms is one of them which was emphasized in the proposal [2]. Consequently, assessing whether existing task splitting multiprocessor scheduling algorithms can be implemented with these constructs is paramount. In this paper we present a list of state-of-art task-splitting multiprocessor scheduling algorithms and, for each of them, we present detailed Ada code that uses the new constructs.