40,885 research outputs found
Automated Analysis of MUTEX Algorithms with FASE
In this paper we study the liveness of several MUTEX solutions by
representing them as processes in PAFAS s, a CCS-like process algebra with a
specific operator for modelling non-blocking reading behaviours. Verification
is carried out using the tool FASE, exploiting a correspondence between
violations of the liveness property and a special kind of cycles (called
catastrophic cycles) in some transition system. We also compare our approach
with others in the literature. The aim of this paper is twofold: on the one
hand, we want to demonstrate the applicability of FASE to some concrete,
meaningful examples; on the other hand, we want to study the impact of
introducing non-blocking behaviours in modelling concurrent systems.Comment: In Proceedings GandALF 2011, arXiv:1106.081
Wavepacket scattering on graphene edges in the presence of a (pseudo) magnetic field
The scattering of a Gaussian wavepacket in armchair and zigzag graphene edges
is theoretically investigated by numerically solving the time dependent
Schr\"odinger equation for the tight-binding model Hamiltonian. Our theory
allows to investigate scattering in reciprocal space, and depending on the type
of graphene edge we observe scattering within the same valley, or between
different valleys. In the presence of an external magnetic field, the well know
skipping orbits are observed. However, our results demonstrate that in the case
of a pseudo-magnetic field, induced by non-uniform strain, the scattering by an
armchair edge results in a non-propagating edge state.Comment: 8 pages, 7 figure
Avaliação do lençol freático em duas áreas exploradas com a cultura do coqueiro (Cocos nucifera L.).
bitstream/item/90507/1/CPATC-PESQ.-AND.-36-86.pd
Simulação do efeito combinado de palhada e adubação na modelagem da cana-de-açúcar.
O objetivo geral do trabalho foi modelar o crescimento da cana-de-açúcar em sistemas de colheita de cana crua e queimada, com diferentes doses de adubação nitrogenada 60, 120 e 180 Kg.ha-1
All-strain based valley filter in graphene nanoribbons using snake states
A pseudo-magnetic field kink can be realized along a graphene nanoribbon
using strain engineering. Electron transport along this kink is governed by
snake states that are characterized by a single propagation direction. Those
pseudo-magnetic fields point towards opposite directions in the K and K'
valleys, leading to valley polarized snake states. In a graphene nanoribbon
with armchair edges this effect results in a valley filter that is based only
on strain engineering. We discuss how to maximize this valley filtering by
adjusting the parameters that define the stress distribution along the graphene
ribbon.Comment: 8 pages, 6 figure
HST Observations of the Central-Cusp Globular Cluster NGC 6752. The Effect of Binary Stars on the Luminosity Function in the Core
We consider the effect of binary stars on the main-sequence luminosity
functions observed in the core of globular clusters, with specific reference to
NGC 6752. We find that mass segregation results in an increased binary fraction
at fainter magnitudes along the main-sequence. If this effect is not taken into
account when analyzing luminosity functions, erroneous conclusions can be drawn
regarding the distribution of single stars, and the dynamical state of the
cluster. In the core of NGC 6752, our HST data reveal a flat luminosity
function, in agreement with previous results. However, when we correct for the
increasing binary fraction at faint magnitudes, the LF begins to fall
immediately below the turn-off. This effect appears to be confined to the inner
core radius of the cluster.Comment: 10 pages, 3 figures Accepted to ApJ Lett Vol 513 Number
Fast Community Identification by Hierarchical Growth
A new method for community identification is proposed which is founded on the
analysis of successive neighborhoods, reached through hierarchical growth from
a starting vertex, and on the definition of communities as a subgraph whose
number of inner connections is larger than outer connections. In order to
determine the precision and speed of the method, it is compared with one of the
most popular community identification approaches, namely Girvan and Newman's
algorithm. Although the hierarchical growth method is not as precise as Girvan
and Newman's method, it is potentially faster than most community finding
algorithms.Comment: 6 pages, 5 figure
- …