Stability of multi-cluster synchronization

A system of many coupled oscillators on a network can show multicluster synchronization. We obtain existence conditions and stability bounds for such a multicluster synchronization. When the oscillators are identical, we obtain the interesting result that network structure alone can cause multicluster synchronization to emerge even when all the other parameters are the same. We also study occurrence of multicluster synchronization when two different types of oscillators are coupled.

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.

Four generations: SUSY and SUSY breaking

We revisit four generations within the context of supersymmetry. Wecompute the perturbativity limits for the fourth generation Yukawa couplings and show that if the masses of the fourth generation lie within reasonable limits of their present experimental lower bounds, it is possible to have perturbativity only up to scales around 1000 TeV. Such low scales are ideally suited to incorporate gauge mediated supersymmetry breaking, where the mediation scale can be as low as 10-20 TeV. The minimal messenger model, however, is highly constrained. While lack of electroweak symmetry breaking rules out a large part of the parameter space, a small region exists, where the fourth generation stau is tachyonic. General gauge mediation with its broader set of boundary conditions is better suited to accommodate the fourth generation.

Harmonic and anharmonic oscillations of a cylindrical plasma in the presence of a uniform axial magnetic field and a steady axial current

In the present note we have studied the harmonic and anharmonic oscillations of cylindrical plasma using Lagrangian formalism. In order to study the harmonic oscillations, the equations are linearized and the resulting equation for the displacement has been numerically solved. For situations present in thermonuclear reactors, the presence of axial magnetic field is found necessary to make the periods of oscillation to become comparable with the time required for the thermonuclear reactions to set in. A detailed analysis of the anharmonic oscillations reveals that the significant interaction is between the first and the second mode. The fundamental period of anharmonic oscillation is more than the corresponding period of harmonic oscillations by 9·2%. Graphs have been drawn for the amplitudes of relative variations in density and magnetic field and of the time-varying part of anharmonic oscillation.

Constraining scalar leptoquarks from the K and B sectors

Upper bounds at the weak scale are obtained for all lambda(ij)lambda(im) type product couplings of the scalar leptoquark model which may affect K-0 - (K) over bar (0), B-d - (B) over bar (d), and B-s - (B) over bar (s) mixing, as well as leptonic and semileptonic K and B decays. Constraints are obtained for both real and imaginary parts of the couplings. We also discuss the role of leptoquarks in explaining the anomalously large CP-violating phase in B-s - (B) over bar (s) mixing.

Stringent constraints on the scalar K pi form factor from analyticity, unitarity and low-energy theorems

We investigate the scalar K pi form factor at low energies by the method of unitarity bounds adapted so as to include information on the phase and modulus along the elastic region of the unitarity cut. Using at input the values of the form factor at t = 0 and the Callan-Treiman point, we obtain stringent constraints on the slope and curvature parameters of the Taylor expansion at the origin. Also, we predict a quite narrow range for the higher-order ChPT corrections at the second Callan-Treiman point.

Optimal design of multiproduct batch chemical plant using NSGA-II

The optimal design of a multiproduct batch chemical plant is formulated as a multiobjective optimization problem, and the resulting constrained mixed-integer nonlinear program (MINLP) is solved by the nondominated sorting genetic algorithm approach (NSGA-II). By putting bounds on the objective function values, the constrained MINLP problem can be solved efficiently by NSGA-II to generate a set of feasible nondominated solutions in the range desired by the decision-maker in a single run of the algorithm. The evolution of the entire set of nondominated solutions helps the decision-maker to make a better choice of the appropriate design from among several alternatives. The large set of solutions also provides a rich source of excellent initial guesses for solution of the same problem by alternative approaches to achieve any specific target for the objective functions

On the maximal rate of (n+1) x n and (n+2) x n complex orthogonal designs

For p x n complex orthogonal designs in k variables, where p is the number of channels uses and n is the number of transmit antennas, the maximal rate L of the design is asymptotically half as n increases. But, for such maximal rate codes, the decoding delay p increases exponentially. To control the delay, if we put the restriction that p = n, i.e., consider only the square designs, then, the rate decreases exponentially as n increases. This necessitates the study of the maximal rate of the designs with restrictions of the form p = n+1, p = n+2, p = n+3 etc. In this paper, we study the maximal rate of complex orthogonal designs with the restrictions p = n+1 and p = n+2. We derive upper and lower bounds for the maximal rate for p = n+1 and p = n+2. Also for the case of p = n+1, we show that if the orthogonal design admit only the variables, their negatives and multiples of these by root-1 and zeros as the entries of the matrix (other complex linear combinations are not allowed), then the maximal rate always equals the lower bound.

Construction and use of linear regression models for processor performance analysis

Processor architects have a challenging task of evaluating a large design space consisting of several interacting parameters and optimizations. In order to assist architects in making crucial design decisions, we build linear regression models that relate Processor performance to micro-architecture parameters, using simulation based experiments. We obtain good approximate models using an iterative process in which Akaike's information criteria is used to extract a good linear model from a small set of simulations, and limited further simulation is guided by the model using D-optimal experimental designs. The iterative process is repeated until desired error bounds are achieved. We used this procedure to establish the relationship of the CPI performance response to 26 key micro-architectural parameters using a detailed cycle-by-cycle superscalar processor simulator The resulting models provide a significance ordering on all micro-architectural parameters and their interactions, and explain the performance variations of micro-architectural techniques.

Limit Analysis of Slabs with Free Edge

The general method earlier developed by the writers for obtaining valid lower bound solutions to slabs under uniformly distributed load and supported along all edges is extended to the slabs with a free edge. Lower bound solutions with normal moment criterion are presented for six cases of orthotropically reinforced slabs, with one of the short edges being free and the other three edges being any combination of fixed and simply supported conditions. The expressions for moment field and collapse load are given for each slab. The lower bounds have been compared with the corresponding upper bound values obtained from the yield line theory with simple straight yield line modes of failure. They are also compared with Nielsen’s solutions available for two cases with isotropic reinforcement.

Analysis of solar radiation pressure induced coupled liberations of a gravity stabilized axisymmetric satellite

This paper presents an analysis of solar radiation pressure induced coupled librations of gravity stabilized cylindrical spacecraft with a special reference to geostationary communication satellites. The Lagrangian approach is used to obtain the corresponding equations of motion. The solar induced torques are assumed to be free of librational angles and are represented by their Fourier expansion. The response and periodic solutions are obtained through linear and nonlinear analyses, using the method of harmonic balance in the latter case. The stability conditions are obtained using Routh-Hurwitz criteria. To establish the ranges of validity the analytic response is compared with the numerical solution. Finally, values of the system parameters are suggested to make the satellite behave as desired. Among these is a possible approach to subdue the solar induced roll resonance. It is felt that the approximate analysis presented here should significantly reduce the computational efforts involved in the design and stability analysis of the systems.

Performance analysis of a slotted-ALOHA protocol on a capture channel with fading

We consider the slotted ALOHA protocol on a channel with a capture effect. There are M bounds on the stationary moments of waiting times which can be tight under realistic conditions. Finally, we obtain several results on the transient performance of the system, e.g., first time to overflow and the limits of the overflow process. We also extend the above results to the case of a capture channel exhibiting Markov modulated fading. Most of our results and proofs will be shown to hold also for the slotted ALOHA protocol without capture.

Popular Matchings with Variable Job Capacities

We consider the problem of matching people to jobs, where each person ranks a subset of jobs in an order of preference, possibly involving ties. There are several notions of optimality about how to best match each person to a job; in particular, popularity is a natural and appealing notion of optimality. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not adroit popular matchings. This motivates the following extension of the popular rnatchings problem:Given a graph G; = (A boolean OR J, E) where A is the set of people and J is the set of jobs, and a list < c(1), c(vertical bar J vertical bar)) denoting upper bounds on the capacities of each job, does there exist (x(1), ... , x(vertical bar J vertical bar)) such that setting the capacity of i-th, job to x(i) where 1 <= x(i) <= c(i), for each i, enables the resulting graph to admit a popular matching. In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c is 1 or 2.

Quantum Error Correction via Codes over GF(2)

It is well known that n-length stabilizer quantum error correcting codes (QECCs) can be obtained via n-length classical error correction codes (CECCs) over GF(4), that are additive and self-orthogonal with respect to the trace Hermitian inner product. But, most of the CECCs have been studied with respect to the Euclidean inner product. In this paper, it is shown that n-length stabilizer QECCs can be constructed via 371 length linear CECCs over GF(2) that are self-orthogonal with respect to the Euclidean inner product. This facilitates usage of the widely studied self-orthogonal CECCs to construct stabilizer QECCs. Moreover, classical, binary, self-orthogonal cyclic codes have been used to obtain stabilizer QECCs with guaranteed quantum error correcting capability. This is facilitated by the fact that (i) self-orthogonal, binary cyclic codes are easily identified using transform approach and (ii) for such codes lower bounds on the minimum Hamming distance are known. Several explicit codes are constructed including two pure MDS QECCs.

The Shannon Cipher System with a Guessing Wiretapper: General Sources

The Shannon cipher system is studied in the context of general sources using a notion of computational secrecy introduced by Merhav & Arikan. Bounds are derived on limiting exponents of guessing moments for general sources. The bounds are shown to be tight for iid, Markov, and unifilar sources, thus recovering some known results. A close relationship between error exponents and correct decoding exponents formfixed rate source compression on the one hand and exponents for guessing moments on the other hand is established.