Fragmentation Phase Transition in Atomic Clusters II - Coulomb Explosion of Metal Clusters -

We discuss the role and the treatment of polarization effects in many-body systems of charged conducting clusters and apply this to the statistical fragmentation of Na-clusters. We see a first order microcanonical phase transition in the fragmentation of $Na^{Z+}_{70}$ for Z=0 to 8. We can distinguish two fragmentation phases, namely evaporation of large particles from a large residue and a complete decay into small fragments only. Charging the cluster shifts the transition to lower excitation energies and forces the transition to disappear for charges higher than Z=8. At very high charges the fragmentation phase transition no longer occurs because the cluster Coulomb-explodes into small fragments even at excitation energy $\epsilon^* = 0$.Comment: 19 text pages +18 *.eps figures, my e-mail adress: [email protected] submitted to Z. Phys.

Influence of Grassland Management and Grazing by Different Farm Animals on Animal Performance and Flora Alterations

The objectives of this study were to test the possibilities of using different farm animals for landscape care on extensive pasture, taking into account their particular performance, and to analyse alterations of the flora in consequence of grazing by different animals and various pasture management. Salers had the highest (836g/d) and Galloways (584g/d) the lowest live weight gain as compared with the other breeds (771g/d). Lambs had higher live weight when grazing together with cattle and horses (mixed grazing) than under one species grazing. The number of legume increased and that of grass decreased. Following 3 years the grazing animals effected an increase of plant numbers in order of: Horses 86%, Cattle 15%, Mixed grazing 14% and sheep no effect. The most success of increasing plant numbers was registered when combined grazing and mowing of pasture was used

Student evaluation of teaching effectiveness: implications for scholars in operations management

Many times, teaching rating by students are the most influential measure of the quality of teaching departments, courses and teachers to assess how curricula changes are perceived by students. This study seeks biases introduced by background variables. If these are relevant, then student evaluations as a valid indicator of teaching effectiveness for the purpose of quality improvement and assurance could be questioned. The research purpose is (i) to appreciate the suitability of business student ratings in assessing teaching performance, and (ii) to explore limitations of current practices considering student evaluation as a primary university tool to assess teaching effectiveness.info:eu-repo/semantics/acceptedVersio

Definition of key drivers for project success regarding the General Data Protection Regulation

In the context of the General Data Protection Regulation (GDPR), organisational governance must consider data privacy concerns and regulations. This will avoid illegal situations, the related fines, damage to organisational reputation or, even, temporary/definitive limitation on processing activities. An innovative conceptual model is proposed to deliver the necessary change that addresses GDPR concerns based on the enablers concept. Moreover, project success is (re)examined to include stakeholders perceptions, in addition to organisational effectiveness, which is defined by the respect for legal requirements and by demonstration of compliance with the Regulation at an acceptable cost, i.e. the typical internal deliverables.info:eu-repo/semantics/acceptedVersio

Fully Dynamic Maintenance of Arc-Flags in Road Networks

International audienceThe problem of finding best routes in road networks can be solved by applying Dijkstra's shortest paths algorithm. Unfortunately, road networks deriving from real-world applications are huge yielding unsustainable times to compute shortest paths. For this reason, great research efforts have been done to accelerate Dijkstra's algorithm on road networks. These efforts have led to the development of a number of speed-up techniques, as for example Arc-Flags, whose aim is to compute additional data in a preprocessing phase in order to accelerate the shortest paths queries in an on-line phase. The main drawback of most of these techniques is that they do not work well in dynamic scenarios. In this paper we propose a new algorithm to update the Arc-Flags of a graph subject to edge weight decrease operations. To check the practical performances of the new algorithm we experimentally analyze it, along with a previously known algorithm for edge weight increase operations, on real-world road networks subject to fully dynamic sequences of operations. Our experiments show a significant speed-up in the updating phase of the Arc-Flags, at the cost of a small space and time overhead in the preprocessing phase

Solving order constraints in logarithmic space.

We combine methods of order theory, finite model theory, and universal algebra to study, within the constraint satisfaction framework, the complexity of some well-known combinatorial problems connected with a finite poset. We identify some conditions on a poset which guarantee solvability of the problems in (deterministic, symmetric, or non-deterministic) logarithmic space. On the example of order constraints we study how a certain algebraic invariance property is related to solvability of a constraint satisfaction problem in non-deterministic logarithmic space

On the stable degree of graphs

We define the stable degree s(G) of a graph G by s(G)∈=∈ min max d (v), where the minimum is taken over all maximal independent sets U of G. For this new parameter we prove the following. Deciding whether a graph has stable degree at most k is NP-complete for every fixed k∈≥∈3; and the stable degree is hard to approximate. For asteroidal triple-free graphs and graphs of bounded asteroidal number the stable degree can be computed in polynomial time. For graphs in these classes the treewidth is bounded from below and above in terms of the stable degree

Tropically convex constraint satisfaction

A semilinear relation S is max-closed if it is preserved by taking the componentwise maximum. The constraint satisfaction problem for max-closed semilinear constraints is at least as hard as determining the winner in Mean Payoff Games, a notorious problem of open computational complexity. Mean Payoff Games are known to be in the intersection of NP and co-NP, which is not known for max-closed semilinear constraints. Semilinear relations that are max-closed and additionally closed under translations have been called tropically convex in the literature. One of our main results is a new duality for open tropically convex relations, which puts the CSP for tropically convex semilinaer constraints in general into NP intersected co-NP. This extends the corresponding complexity result for scheduling under and-or precedence constraints, or equivalently the max-atoms problem. To this end, we present a characterization of max-closed semilinear relations in terms of syntactically restricted first-order logic, and another characterization in terms of a finite set of relations L that allow primitive positive definitions of all other relations in the class. We also present a subclass of max-closed constraints where the CSP is in P; this class generalizes the class of max-closed constraints over finite domains, and the feasibility problem for max-closed linear inequalities. Finally, we show that the class of max-closed semilinear constraints is maximal in the sense that as soon as a single relation that is not max-closed is added to L, the CSP becomes NP-hard.Comment: 29 pages, 2 figure

Scattering of first and second sound waves by quantum vorticity in superfluid Helium

We study the scattering of first and second sound waves by quantum vorticity in superfluid Helium using two-fluid hydrodynamics. The vorticity of the superfluid component and the sound interact because of the nonlinear character of these equations. Explicit expressions for the scattered pressure and temperature are worked out in a first Born approximation, and care is exercised in delimiting the range of validity of the assumptions needed for this approximation to hold. An incident second sound wave will partly convert into first sound, and an incident first sound wave will partly convert into second sound. General considerations show that most incident first sound converts into second sound, but not the other way around. These considerations are validated using a vortex dipole as an explicitely worked out example.Comment: 24 pages, Latex, to appear in Journal of Low Temperature Physic