Periodic orbit quantization of a Hamiltonian map on the sphere

In a previous paper we introduced examples of Hamiltonian mappings with phase space structures resembling circle packings. It was shown that a vast number of periodic orbits can be found using special properties. We now use this information to explore the semiclassical quantization of one of these maps.

A uniform white-noise model for fixed-point roundoff errors in digital systems

Fixed-point roundoff noise in digital implementation of linear systems arises due to overflow, quantization of coefficients and input signals, and arithmetical errors. In uniform white-noise models, the last two types of roundoff errors are regarded as uniformly distributed independent random vectors on cubes of suitable size. For input signal quantization errors, the heuristic model is justified by a quantization theorem, which cannot be directly applied to arithmetical errors due to the complicated input-dependence of errors. The complete uniform white-noise model is shown to be valid in the sense of weak convergence of probabilistic measures as the lattice step tends to zero if the matrices of realization of the system in the state space satisfy certain nonresonance conditions and the finite-dimensional distributions of the input signal are absolutely continuous.

Mean anisotropy of homogeneous Gaussian random fields and anisotropic norms of linear translation-invariant operators on multidimensional integer lattices

Sensitivity of output of a linear operator to its input can be quantified in various ways. In Control Theory, the input is usually interpreted as disturbance and the output is to be minimized in some sense. In stochastic worst-case design settings, the disturbance is considered random with imprecisely known probability distribution. The prior set of probability measures can be chosen so as to quantify how far the disturbance deviates from the white-noise hypothesis of Linear Quadratic Gaussian control. Such deviation can be measured by the minimal Kullback-Leibler informational divergence from the Gaussian distributions with zero mean and scalar covariance matrices. The resulting anisotropy functional is defined for finite power random vectors. Originally, anisotropy was introduced for directionally generic random vectors as the relative entropy of the normalized vector with respect to the uniform distribution on the unit sphere. The associated a-anisotropic norm of a matrix is then its maximum root mean square or average energy gain with respect to finite power or directionally generic inputs whose anisotropy is bounded above by a≥0. We give a systematic comparison of the anisotropy functionals and the associated norms. These are considered for unboundedly growing fragments of homogeneous Gaussian random fields on multidimensional integer lattice to yield mean anisotropy. Correspondingly, the anisotropic norms of finite matrices are extended to bounded linear translation invariant operators over such fields.

Discrete cyanide-bridged mixed-valence Co/Fe complexes: Outer-sphere redox behaviour

The outer-sphere redox behaviour of a series of [LnCoIII-NCFeII(CN)(5)](-) (L-n = n-membered pentadentate aza-macrocycle) complexes have been studied as a function of pH and oxidising agent. All the dinuclear complexes show a double protonation process at pH approximate to 2 that produces a shift in their UV/Vis spectra. Oxidation of the different non-protonated and diprotonated complexes has been carried out with peroxodisulfate, and of the non-protonated complexes also with trisoxalatocobaltate(III). The results are in agreement with predictions from the Marcus theory. The oxidation of [Fe(phen)(3)](3+) and [IrCl6](2-) is too fast to be measured, although for the latter the transient observation of the process has been achieved at pH = 0. The study of the kinetics of the outer-sphere redox process, with the S2O82- and [Co(ox)(3)](3-) oxidants, has been carried out as a function of pH, temperature, and pressure. As a whole, the values found for the activation volumes, entropies, and enthalpies are in the following margins, for the diprotonated and non-protonated dinuclear complexes, respectively: DeltaV(not equal) from 11 to 13 and 15 to 20 cm(3) mol(-1); DeltaS(not equal) from 110 to 30 and -60 to -90 J K-1 mol(-1); DeltaH(not equal) from 115 to 80 and 50 to 65 kJ.mol(-1). The thermal activation parameters are clearly dominated by the electrostriction occurring on outer-sphere precursor formation, while the trends found for the values of the volume of activation indicate an important degree of tuning due to the charge distribution during the electron transfer process. The special arrangement on the amine ligands in the isomer trans[(L14CoNCFeII)-N-III(CN)(5)](-) accounts for important differences in solvent-assisted hydrogen bonding occurring within the outer-sphere redox process, as has been established in redox reactions of similar compounds. ((C) Wiley-VCH Verlag GmbH & Co. KGaA, 69451 Weinheim, Germany, 2003).

New Technique for Uniform Voltage Sharing in Series Stacked Semiconductors

This paper describes the operation of a solid-state series stacked topology used as a serial and parallel switch in pulsed power applications. The proposed circuit, developed from the Marx generator concept, balances the voltage stress on each series stacked semiconductor, distributing the total voltage evenly. Experimental results from a 10 kV laboratory series stacked switch, using 1200 V semiconductors in a ten stages solid-state series stacked circuit, are reported and discussed, considering resistive, capacitive and inductive type loads for high and low duty factor voltage pulse operation.

On the monoids of transformations that preserve the order and a uniform partition

In this article we consider the monoid O(mxn) of all order-preserving full transformations on a chain with mn elements that preserve a uniformm-partition and its submonoids O(mxn)(+) and O(mxn)(-) of all extensive transformations and of all co-extensive transformations, respectively. We determine their ranks and construct a bilateral semidirect product decomposition of O(mxn) in terms of O(mxn)(-) and O(mxn)(+).

Branching points in the low-temperature dipolar hard sphere fluid

In this contribution, we investigate the low-temperature, low-density behaviour of dipolar hard-sphere (DHS) particles, i.e., hard spheres with dipoles embedded in their centre. We aim at describing the DHS fluid in terms of a network of chains and rings (the fundamental clusters) held together by branching points (defects) of different nature. We first introduce a systematic way of classifying inter-cluster connections according to their topology, and then employ this classification to analyse the geometric and thermodynamic properties of each class of defects, as extracted from state-of-the-art equilibrium Monte Carlo simulations. By computing the average density and energetic cost of each defect class, we find that the relevant contribution to inter-cluster interactions is indeed provided by (rare) three-way junctions and by four-way junctions arising from parallel or anti-parallel locally linear aggregates. All other (numerous) defects are either intra-cluster or associated to low cluster-cluster interaction energies, suggesting that these defects do not play a significant part in the thermodynamic description of the self-assembly processes of dipolar hard spheres. (C) 2013 AIP Publishing LLC.

Real-time scheduling with resource sharing on uniform multiprocessors

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a uniform multiprocessor platform where each task may access at most one of |R| shared resources and at most once by each job of that task. The resources have to be accessed in a mutually exclusive manner. We propose an algorithm, GIS-vpr, which offers the guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that allows a task to migrate only when it accesses or releases a resource, then our algorithm also meets the deadlines with the same restriction on the task migration, if given processors 4 + 6|R| times as fast. The proposed algorithm, by design, limits the number of migrations per job to at most two. To the best of our knowledge, this is the first result for resource sharing on uniform multiprocessors with proven performance guarantee.

Competitive analysis of partitioned scheduling on uniform multiprocessors

Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. We propose an algorithm which can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are three times faster.

Competitive analysis of static-priority partitioned scheduling on uniform multiprocessors

Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. On each processor, tasks are scheduled according to rate-monotonic. We propose an algorithm that can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are √2 / √2−1 ≈ 3.41 times faster. No such guarantees are previously known for partitioned static-priority scheduling on uniform multiprocessors.