Towards formal specification of a distributed computing system

Onboard spacecraft computing system is a case of a functionally distributed system that requires continuous interaction among the nodes to control the operations at different nodes. A simple and reliable protocol is desired for such an application. This paper discusses a formal approach to specify the computing system with respect to some important issues encountered in the design and development of a protocol for the onboard distributed system. The issues considered in this paper are concurrency, exclusiveness and sequencing relationships among the various processes at different nodes. A 6-tuple model is developed for the precise specification of the system. The model also enables us to check the consistency of specification and deadlock caused due to improper specification. An example is given to illustrate the use of the proposed methodology for a typical spacecraft configuration. Although the theory is motivated by a specific application the same may be applied to other distributed computing system such as those encountered in process control industries, power plant control and other similar environments.

On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts

A cut (A, B) (where B = V - A) in a graph G = (V, E) is called internal if and only if there exists a vertex x in A that is not adjacent to any vertex in B and there exists a vertex y is an element of B such that it is not adjacent to any vertex in A. In this paper, we present a theorem regarding the arrangement of cliques in a chordal graph with respect to its internal cuts. Our main result is that given any internal cut (A, B) in a chordal graph G, there exists a clique with kappa(G) + vertices (where kappa(G) is the vertex connectivity of G) such that it is (approximately) bisected by the cut (A, B). In fact we give a stronger result: For any internal cut (A, B) of a chordal graph, and for each i, 0 <= i <= kappa(G) + 1 such that vertical bar K-i vertical bar = kappa(G) + 1, vertical bar A boolean AND K-i vertical bar = i and vertical bar B boolean AND K-i vertical bar = kappa(G) + 1 - i. An immediate corollary of the above result is that the number of edges in any internal cut (of a chordal graph) should be Omega(k(2)), where kappa(G) = k. Prompted by this observation, we investigate the size of internal cuts in terms of the vertex connectivity of the chordal graphs. As a corollary, we show that in chordal graphs, if the edge connectivity is strictly less than the minimum degree, then the size of the mincut is at least kappa(G)(kappa(G)+1)/2 where kappa(G) denotes the vertex connectivity. In contrast, in a general graph the size of the mincut can be equal to kappa(G). This result is tight.

Boson-fermion duality in SU(m vertical bar n) supersymmetric Haldane-Shastry spin chain

By using the Y(gl(m|n)) super Yangian symmetry of the SU(m|n) supersymmetric Haldane-Shastry spin chain, we show that the partition function of this model satisfies a duality relation under the exchange of bosonic and fermionic spin degrees of freedom. As a byproduct of this study of the duality relation, we find a novel combinatorial formula for the super Schur polynomials associated with some irreducible representations of the Y(gl(m|n)) Yangian algebra. Finally, we reveal an intimate connection between the global SU(m|n) symmetry of a spin chain and the boson-fermion duality relation. (C) 2007 Elsevier B.V. All rights reserved.

Low energy properties of the SU(m|n) supersymmetric Haldane–Shastry spin chain

The ground state and low energy excitations of the SU(m|n) supersymmetric Haldane–Shastry spin chain are analyzed. In the thermodynamic limit, it is found that the ground state degeneracy is finite only for the SU(m|0) and SU(m|1) spin chains, while the dispersion relation for the low energy and low momentum excitations is linear for all values of m and n. We show that the low energy excitations of the SU(m|1) spin chain are described by a conformal field theory of m non-interacting Dirac fermions which have only positive energies; the central charge of this theory is m/2. Finally, for ngreater-or-equal, slanted1, the partition functions of the SU(m|n) Haldane–Shastry spin chain and the SU(m|n) Polychronakos spin chain are shown to be related in a simple way in the thermodynamic limit at low temperatures.

Universal SU(2) gadget for polarization optics

We present a design of a universal gadget, consisting of two half-wave plates and two quarter-wave plates coaxially mounted, which can realize every SU (2) polarization optical transformation; to realize a given SU (2) element one simply has to rotate these plates about the common axis to angular positions characteristic of the element. The design is also geometrically interpreted in terms of Hamilton's theory of turns for the group SU (2).

A method for Estimating the Degree of Uncertainty With Respect to Life Cycle Assessment During Design

Life cycle assessment (LCA) is used to estimate a product's environmental impact. Using LCA during the earlier stages of design may produce erroneous results since information available on the product's lifecycle is typically incomplete at these stages. The resulting uncertainty must be accounted for in the decision-making process. This paper proposes a method for estimating the environmental impact of a product's life cycle and the associated degree of uncertainty of that impact using information generated during the design process. Total impact is estimated based on aggregation of individual product life cycle processes impacts. Uncertainty estimation is based on assessing the mismatch between the information required and the information available about the product life cycle in each uncertainty category, as well as their integration. The method is evaluated using pre-defined scenarios with varying uncertainty. DOI: 10.1115/1.4002163]

Minimal three-component SU(2) gadget for polarization optics

Two identities involving quarter-wave plates and half-wave plates are established. These are used to improve on an earlier gadget involving four wave plates leading to a new gadget involving just three plates, a half-wave plate and two quarter-wave plates, which can realize all SU(2) polarization transformations. This gadget is shown to involve the minimum number of quarter-wave and half-wave plates. The analysis leads to a decomposition theorem for SU (2) matrices in terms of factors which are symmetric fourth and eighth roots of the identity.

Flap‐Lag Damping in Hover and Forward Flight with a Three‐Dimensional Wake

Prediction of lag damping is difficult owing to the delicate balance of drag, induced drag and Coriolis forces in the in‐plane direction. Moreover, induced drag” is sensitive to dynamic wake, bath shed and trailing components, and thus its prediction requires adequate unsteady‐wake representation. Accordingly, rigid‐blade flap‐lag equations are coupled with a three‐dimensional finite‐state wake model; three isolatcd rotor canfigurations with three, four and five blades are treated over a range of thrust levels, tack numbers, lag frequencies and advance ratios. The investigation includes convergence characteristics of damping with respect to the number of radial shape functions and harmonics of the wake model for multiblade modes of low frequency (< 1/ rev.) to high frequency (> 1/rev.). Predicted flap and lag damping levels are then compared with similar predictions with 1) rigid wake (no unsteady induced now), 2) Loewy lift deficiency and 3) dynamic inflow. The coverage also includes correlations with the measured lag regressive‐mode damping in hover and forward flight and comparisons with similar correlations with dynamic inflow. Lag‐damping predictions with the dynamic wake model are consistently higher than the predictions with the dynamic inflow model; even for the low frequency lag regressive mode, the number of wake harmonics should at least be equal to twice the number of blades.

On the out of phase appearance of large-scale diffuse magnetic field of the sun with respect to sunspots

We assume the large-scale diffuse magnetic field of the Sun to originate from the poloidal component of a dynamo operating at the base of the convection zone, whereas the sunspots are due to the toroidal component. The evolution of the poloidal component is studied to model the poleward migration of the diffuse field seen on the solar surface and the polar reversal at the time of sunspot maxima (Dikpati and Choudhuri 1994, 1995).

The algebra and geometry of SU(3) matrices

We give an elementary treatment of the defining representation and Lie algebra of the three-dimensional unitary unimodular group SU(3). The geometrical properties of the Lie algebra, which is an eight dimensional real Linear vector space, are developed in an SU(3) covariant manner. The f and d symbols of SU(3) lead to two ways of 'multiplying' two vectors to produce a third, and several useful geometric and algebraic identities are derived. The axis-angle parametrization of SU(3) is developed as a generalization of that for SU(2), and the specifically new features are brought out. Application to the dynamics of three-level systems is outlined.

The complexity of certain incremental code generation problems

This paper looks at the complexity of four different incremental problems. The following are the problems considered: (1) Interval partitioning of a flow graph (2) Breadth first search (BFS) of a directed graph (3) Lexicographic depth first search (DFS) of a directed graph (4) Constructing the postorder listing of the nodes of a binary tree. The last problem arises out of the need for incrementally computing the Sethi-Ullman (SU) ordering [1] of the subtrees of a tree after it has undergone changes of a given type. These problems are among those that claimed our attention in the process of our designing algorithmic techniques for incremental code generation. BFS and DFS have certainly numerous other applications, but as far as our work is concerned, incremental code generation is the common thread linking these problems. The study of the complexity of these problems is done from two different perspectives. In [2] is given the theory of incremental relative lower bounds (IRLB). We use this theory to derive the IRLBs of the first three problems. Then we use the notion of a bounded incremental algorithm [4] to prove the unboundedness of the fourth problem with respect to the locally persistent model of computation. Possibly, the lower bound result for lexicographic DFS is the most interesting. In [5] the author considers lexicographic DFS to be a problem for which the incremental version may require the recomputation of the entire solution from scratch. In that sense, our IRLB result provides further evidence for this possibility with the proviso that the incremental DFS algorithms considered be ones that do not require too much of preprocessing.

Analytical solutions for protective filters based on soil-retention and permeability criteria with respect to the phenomenon of soil boiling

For the successful performance of a granular filter medium, existing design guidelines, which are based on the particle size distribution (PSD) characteristics of the base soil and filter medium, require two contradictory conditions to be satisfied, viz., soil retention and permeability. In spite of the wider applicability of these guidelines, it is well recognized that (i) they are applicable to a particular range of soils tested in the laboratory, (ii) the design procedures do not include performance-based selection criteria, and (iii) there are no means to establish the sensitivity of the important variables influencing performance. In the present work, analytical solutions are developed to obtain a factor of safety with respect to soil-retention and permeability criteria for a base soil - filter medium system subjected to a soil boiling condition. The proposed analytical solutions take into consideration relevant geotechnical properties such as void ratio, permeability, dry unit weight, effective friction angle, shape and size of soil particles, seepage discharge, and existing hydraulic gradient. The solution is validated through example applications and experimental results, and it is established that it can be used successfully in the selection as well as design of granular filters and can be applied to all types of base soils.