76 resultados para EDGE DISLOCATIONS
em Consorci de Serveis Universitaris de Catalunya (CSUC), Spain
Resumo:
TCP flows from applications such as the web or ftp are well supported by a Guaranteed Minimum Throughput Service (GMTS), which provides a minimum network throughput to the flow and, if possible, an extra throughput. We propose a scheme for a GMTS using Admission Control (AC) that is able to provide different minimum throughput to different users and that is suitable for "standard" TCP flows. Moreover, we consider a multidomain scenario where the scheme is used in one of the domains, and we propose some mechanisms for the interconnection with neighbor domains. The whole scheme uses a small set of packet classes in a core-stateless network where each class has a different discarding priority in queues assigned to it. The AC method involves only edge nodes and uses a special probing packet flow (marked as the highest discarding priority class) that is sent continuously from ingress to egress through a path. The available throughput in the path is obtained at the egress using measurements of flow aggregates, and then it is sent back to the ingress. At the ingress each flow is detected using an implicit way and then it is admission controlled. If it is accepted, it receives the GMTS and its packets are marked as the lowest discarding priority classes; otherwise, it receives a best-effort service. The scheme is evaluated through simulation in a simple "bottleneck" topology using different traffic loads consisting of "standard" TCP flows that carry files of varying sizes
Resumo:
We propose an edge detector based on the selection of wellcontrasted pieces of level lines, following the proposal ofDesolneux-Moisan-Morel (DMM) [1]. The DMM edge detectorhas the problem of over-representation, that is, everyedge is detected several times in slightly different positions.In this paper we propose two modifications of the originalDMM edge detector in order to solve this problem. The firstmodification is a post-processing of the output using a generalmethod to select the best representative of a bundle of curves.The second modification is the use of Canny’s edge detectorinstead of the norm of the gradient to build the statistics. Thetwo modifications are independent and can be applied separately.Elementary reasoning and some experiments showthat the best results are obtained when both modifications areapplied together.
Resumo:
We have investigated edge modes of different multipolarity sustained by quantum antidots at zero magnetic field. The ground state of the antidot is described within a local-density-functional formalism. Two sum rules, which are exact within this formalism, have been derived and used to evaluate the energy of edge collective modes as a function of the surface density and the size of the antidot.
Resumo:
The edge excitations and related topological orders of correlated states of a fast rotating Bose gas are studied. Using exact diagonalization of small systems, we compute the energies and number of edge excitations, as well as the boson occupancy near the edge for various states. The chiral Luttinger-liquid theory of Wen is found to be a good description of the edges of the bosonic Laughlin and other states identified as members of the principal Jain sequence for bosons. However, we find that in a harmonic trap the edge of the state identified as the Moore-Read (Pfaffian) state shows a number of anomalies. An experimental way of detecting these correlated states is also discussed.
Resumo:
We show that small amounts of 3He atoms, added to a 4He drop deposited on a flat cesium surface at zero temperature, populate bound states localized at the contact line. These edge states show up for drops large enough to develop well defined surface and bulk regions together with a contact line, and they are structurally different from the well-known Andreev states that appear at the free surface and at the liquid-solid interface of films. We illustrate the one-body density of 3He in a drop with 1000 4He atoms, and show that for a sufficiently large number of impurities the density profiles spread beyond the edge, coating both the curved drop surface and its flat base and eventually isolating it from the substrate.
Resumo:
The formation of coherently strained three-dimensional (3D) islands on top of the wetting layer in the Stranski-Krastanov mode of growth is considered in a model in 1 + 1 dimensions accounting for the anharmonicity and nonconvexity of the real interatomic forces. It is shown that coherent 3D islands can be expected to form in compressed rather than expanded overlayers beyond a critical lattice misfit. In expanded overlayers the classical Stranski-Krastanov growth is expected to occur because the misfit dislocations can become energetically favored at smaller island sizes. The thermodynamic reason for coherent 3D islanding is incomplete wetting owing to the weaker adhesion of the edge atoms. Monolayer height islands with a critical size appear as necessary precursors of the 3D islands. This explains the experimentally observed narrow size distribution of the 3D islands. The 2D-3D transformation takes place by consecutive rearrangements of mono- to bilayer, bi- to trilayer islands, etc., after the corresponding critical sizes have been exceeded. The rearrangements are initiated by nucleation events, each one needing to overcome a lower energetic barrier than the one before. The model is in good qualitative agreement with available experimental observations.
Resumo:
High-sensitivity electron paramagnetic resonance experiments have been carried out in fresh and stressed Mn12 acetate single crystals for frequencies ranging from 40 GHz up to 110 GHz. The high number of crystal dislocations formed in the stressing process introduces a E(Sx2-Sy2) transverse anisotropy term in the spin Hamiltonian. From the behavior of the resonant absorptions on the applied transverse magnetic field we have obtained an average value for E=22 mK, corresponding to a concentration of dislocations per unit cell of c=10-3.
Resumo:
L'entrevista amb l'escriptora cubano-americana Cristina García explora el tema de la identitat cubanoamericana i desvetlla la riquesa literària que sorgeix de la fusió de dues cultures, la cubana i la nord-americana, i com aquesta fusió innova la literatura nord-americana tradicional. En la seva novel·la, Dreaming in Cuban (1992), l'escriptora explora els efectes de la Revolució castrista des de la perspectiva de les dones cubanes que van quedar-se a l'illa, així com de les dones que emigraren als Estats Units. The conversation with Cuban-American writer Cristina García explores what it means to be Cuban-American, and reveals how to grow bicultural enriches mainstream American literature. In her novel Dreaming in Cuban (1992), the writer explores the effects of the Castro Revolution from the perspective of Cuban women who remained in Cuba, as well as from the experience of women who emigrated to the United States.
Resumo:
L'entrevista amb l'escriptora cubano-americana Cristina García explora el tema de la identitat cubanoamericana i desvetlla la riquesa literària que sorgeix de la fusió de dues cultures, la cubana i la nord-americana, i com aquesta fusió innova la literatura nord-americana tradicional. En la seva novel·la, Dreaming in Cuban (1992), l'escriptora explora els efectes de la Revolució castrista des de la perspectiva de les dones cubanes que van quedar-se a l'illa, així com de les dones que emigraren als Estats Units. The conversation with Cuban-American writer Cristina García explores what it means to be Cuban-American, and reveals how to grow bicultural enriches mainstream American literature. In her novel Dreaming in Cuban (1992), the writer explores the effects of the Castro Revolution from the perspective of Cuban women who remained in Cuba, as well as from the experience of women who emigrated to the United States.
Resumo:
Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There are, however, subtle yet important considerations to be made regarding the nature of the weights used in this generalization. Weights can be either continuous or discrete magnitudes, and in the latter case, they can additionally have undistinguishable or distinguishable nature. This fact has not been addressed in the literature insofar and has deep implications on the network statistics. In this work we face this problem introducing multiedge networks as graphs where multiple (distinguishable) connections between nodes are considered. We develop a statistical mechanics framework where it is possible to get information about the most relevant observables given a large spectrum of linear and nonlinear constraints including those depending both on the number of multiedges per link and their binary projection. The latter case is particularly interesting as we show that binary projections can be understood from multiedge processes. The implications of these results are important as many real-agent-based problems mapped onto graphs require this treatment for a proper characterization of their collective behavior.
Resumo:
Recently, edge matching puzzles, an NP-complete problem, have rececived, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing several generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques.
Resumo:
Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There are, however, subtle yet important considerations to be made regarding the nature of the weights used in this generalization. Weights can be either continuous or discrete magnitudes, and in the latter case, they can additionally have undistinguishable or distinguishable nature. This fact has not been addressed in the literature insofar and has deep implications on the network statistics. In this work we face this problem introducing multiedge networks as graphs where multiple (distinguishable) connections between nodes are considered. We develop a statistical mechanics framework where it is possible to get information about the most relevant observables given a large spectrum of linear and nonlinear constraints including those depending both on the number of multiedges per link and their binary projection. The latter case is particularly interesting as we show that binary projections can be understood from multiedge processes. The implications of these results are important as many real-agent-based problems mapped onto graphs require this treatment for a proper characterization of their collective behavior.
Resumo:
The filling length of an edge-circuit η in the Cayley 2-complex of a finite presentation of a group is the minimal integer length L such that there is a combinatorial null-homotopy of η down to a base point through loops of length at most L. We introduce similar notions in which the full-homotopy is not required to fix a base point, and in which the contracting loop is allowed to bifurcate. We exhibit a group in which the resulting filling invariants exhibit dramatically different behaviour to the standard notion of filling length. We also define the corresponding filling invariants for Riemannian manifolds and translate our results to this setting.