Poincaré invariance of anomalous gauge theories

We establish the Poincaré invariance of anomalous gauge theories in two dimensions, for both the Abelian and non-Abelian cases, in the canonical Hamiltonian formalism. It is shown that, despite the noncovariant appearance of the constraints of these theories, Poincaré generators can be constructed which obey the correct algebra and yield the correct transformations in the constrained space.

Spin and mass content of linearized Poincaré gauge theories

A unified gauge theory of massless and massive spin-2 fields is of considerable current interest. The Poincaré gauge theories with quadratic Lagrangian are linearized, and the conditions on the parameters are found which will lead to viable linear theories with massive gauge particles. As well as the 2+ massless gravitons coming from the translational gauge potential, the rotational gauge potentials, in the linearized limit, give rise to 2+ and 2− particles of equal mass, as well as a massive pseudoscalar.

Fast Multiple Access Selection through variable power transmissions

Many wireless applications demand a fast mechanism to detect the packet from a node with the highest priority ("best node") only, while packets from nodes with lower priority are irrelevant. In this paper, we introduce an extremely fast contention-based multiple access algorithm that selects the best node and requires only local information of the priorities of the nodes. The algorithm, which we call Variable Power Multiple Access Selection (VP-MAS), uses the local channel state information from the accessing nodes to the receiver, and maps the priorities onto the receive power. It is based on a key result that shows that mapping onto a set of discrete receive power levels is optimal, when the power levels are chosen to exploit packet capture that inherently occurs in a wireless physical layer. The VP-MAS algorithm adjusts the expected number of users that contend in each step and their respective transmission powers, depending on whether previous transmission attempts resulted in capture, idle channel, or collision. We also show how reliable information regarding the total received power at the receiver can be used to improve the algorithm by enhancing the feedback mechanism. The algorithm detects the packet from the best node in 1.5 to 2.1 slots, which is considerably lower than the 2.43 slot average achieved by the best algorithm known to date.

Constraints in relativistic Hamiltonian mechanics

We propose a new scheme for the use of constraints in setting up classical, Hamiltonian, relativistic, interacting particle theories. We show that it possesses both Poincaré invariance and invariance of world lines. We discuss the transition to the physical phase space and the nonrelativistic limit.

Relativistic particle models with separable interactions

We present relativistic, classical particle models that possess Poincaré invariance, invariant world lines, particle interaction, and separability.

Paraxial-wave optics and relativistic front description .1. The scalar theory

With the extension of the work of the preceding paper, the relativistic front form for Maxwell's equations for electromagnetism is developed and shown to be particularly suited to the description of paraxial waves. The generators of the Poincaré group in a form applicable directly to the electric and magnetic field vectors are derived. It is shown that the effect of a thin lens on a paraxial electromagnetic wave is given by a six-dimensional transformation matrix, constructed out of certain special generators of the Poincaré group. The method of construction guarantees that the free propagation of such waves as well as their transmission through ideal optical systems can be described in terms of the metaplectic group, exactly as found for scalar waves by Bacry and Cadilhac. An alternative formulation in terms of a vector potential is also constructed. It is chosen in a gauge suggested by the front form and by the requirement that the lens transformation matrix act locally in space. Pencils of light with accompanying polarization are defined for statistical states in terms of the two-point correlation function of the vector potential. Their propagation and transmission through lenses are briefly considered in the paraxial limit. This paper extends Fourier optics and completes it by formulating it for the Maxwell field. We stress that the derivations depend explicitly on the "henochromatic" idealization as well as the identification of the ideal lens with a quadratic phase shift and are heuristic to this extent.

Gauge theory of a group of diffeomorphisms. II. The conformal and de Sitter groups

The extension of Hehl's Poincaré gauge theory to more general groups that include space-time diffeomorphisms is worked out for two particular examples, one corresponding to the action of the conformal group on Minkowski space, and the other to the action of the de Sitter group on de Sitter space, and the effect of these groups on physical fields.

Dual Power Multiple Access with Multipacket Reception using Local CSI

Contention-based multiple access is a crucial component of many wireless systems. Multiple-packet reception (MPR) schemes that use interference cancellation techniques to receive and decode multiple packets that arrive simultaneously are known to be very efficient. However, the MPR schemes proposed in the literature require complex receivers capable of performing advanced signal processing over significant amounts of soft undecodable information received over multiple contention steps. In this paper, we show that local channel knowledge and elementary received signal strength measurements, which are available to many receivers today, can actively facilitate multipacket reception and even simplify the interference canceling receiver¿s design. We introduce two variants of a simple algorithm called Dual Power Multiple Access (DPMA) that use local channel knowledge to limit the receive power levels to two values that facilitate successive interference cancellation. The resulting receiver structure is markedly simpler, as it needs to process only the immediate received signal without having to store and process signals received previously. Remarkably, using a set of three feedback messages, the first variant, DPMA-Lite, achieves a stable throughput of 0.6865 packets per slot. Using four possible feedback messages, the second variant, Turbo-DPMA, achieves a stable throughput of 0.793 packets per slot, which is better than all contention algorithms known to date.

Geometrical interpretation of Inönü-Wigner contractions

The Inönü-Wigner contractions which interrelate the Lie algebras of the isometry groups of metric spaces are discussed with reference to deformations of the absolutes of the spaces. A general formula is derived for the Lie algebra commutation relations of the isometry group for anyN-dimensional metric space. These ideas are illustrated by a discussion of important particular cases, which interrelate the four-dimensional de Sitter, Poincaré, and Galilean groups.

Gauging the conformal group

It is demonstrated that Kibble’s method of gauging the Poincaré group can be applied to the gauging of the conformal group. The action of the gauge transformations is the action of general spacetime diffeomorphisms (or coordinate transformations) combined with a local action of an 11-parameter subgroup of SO(4,2). Because the translational subgroup is not an invariant subgroup of the conformal group the appropriate generalisation of the derivative of a physical field is not a covariant derivative in the usual sense, but this does not lead to any inconsistencies.

Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View

Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been proposed for selecting one or more relays, distributed mechanisms that perform the selection have received relatively less attention. In this paper, we develop a novel, yet simple, asymptotic analysis of a splitting-based multiple access selection algorithm to find the single best relay. The analysis leads to simpler and alternate expressions for the average number of slots required to find the best user. By introducing a new contention load' parameter, the analysis shows that the parameter settings used in the existing literature can be improved upon. New and simple bounds are also derived. Furthermore, we propose a new algorithm that addresses the general problem of selecting the best Q >= 1 relays, and analyze and optimize it. Even for a large number of relays, the scalable algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. We also propose a new and simple scheme for the practically relevant case of discrete metrics. Altogether, our results develop a unifying perspective about the general problem of distributed selection in cooperative systems and several other multi-node systems.

Oligosaccharides modulate the apoptotic activity of glycodelin

GlycodelinA (GdA), a multifunctional glycoprotein secreted at high concentrations by the uterine endometrium during the early phases of pregnancy, carries glycan chains on asparagines at positions N28 and N63. GdA purified from amniotic fluid is known to be a suppressor of T-cell proliferation, an inducer of T-cell apoptosis, and an inhibitorof sperm-zona binding in contrast to its glycoform, glycodelinS (GdS), which is secreted by the seminal vesicles into the seminal plasma. The oligosaccharide chains of GdA terminate in sialic acid residues, whereas those of GdS are not sialylated but are heavily fucosylated. Our previous work has shown that the apoptogenic activity of GdA resides in the protein backbone, and we have also demonstrated the importance of sialylation for the manifestation of GdA-induced apoptosis. Recombinant glycodelin (Gd) expressed in the Sf21 insec cell line yielded an apoptotically active Gd; however, the same geneexpressed in the insect cell line Tni produced apoptotically inactive Gd, as observed with the gene expressed in the Chinese hamster ovary(CHO) cell line and earlier in Pichia pastoris. Glycan analysis of the Tni and Sf21 cell line-expressed Gd proteins reveals differences in their glycan structures, which modulate the manifestation of apoptogenic activity of Gd. Through apoptotic assays carried out with the wild-type (WT) and glycosylation mutants of Gd expressed in Sf21 and Tni cells before and after mannosidase digestion, we conclude that the accessibility to the apoptogenic region of Gd is influenced by the size of the glycans.

Hamilton’s theory of turns and a new geometrical representation for polarization optics

Hamilton’s theory of turns for the group SU(2) is exploited to develop a new geometrical representation for polarization optics. While pure polarization states are represented by points on the Poincaré sphere, linear intensity preserving optical systems are represented by great circle arcs on another sphere. Composition of systems, and their action on polarization states, are both reduced to geometrical operations. Several synthesis problems, especially in relation to the Pancharatnam-Berry-Aharonov-Anandan geometrical phase, are clarified with the new representation. The general relation between the geometrical phase, and the solid angle on the Poincaré sphere, is established.

Relay Selection and Data Transmission Throughput Tradeoff in Cooperative Systems

A common and practical paradigm in cooperative communications is the use of a dynamically selected 'best' relay to decode and forward information from a source to a destination. Such a system consists of two core phases: a relay selection phase, in which the system expends resources to select the best relay, and a data transmission phase, in which it uses the selected relay to forward data to the destination. In this paper, we study and optimize the trade-off between the selection and data transmission phase durations. We derive closed-form expressions for the overall throughput of a non-adaptive system that includes the selection phase overhead, and then optimize the selection and data transmission phase durations. Corresponding results are also derived for an adaptive system in which the relays can vary their transmission rates. Our results show that the optimal selection phase overhead can be significant even for fast selection algorithms. Furthermore, the optimal selection phase duration depends on the number of relays and whether adaptation is used.

A soluble random-matrix model for relaxation in quantum systems

We study the relaxation of a degenerate two-level system interacting with a heat bath, assuming a random-matrix model for the system-bath interaction. For times larger than the duration of a collision and smaller than the Poincaré recurrence time, the survival probability of still finding the system at timet in the same state in which it was prepared att=0 is exactly calculated.