Tight co-degree condition for perfect matchings in 4-graphs

We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching.

Perfect Static Balance of Linkages by Addition of Springs But Not Auxiliary Bodies

A linkage of rigid bodies under gravity loads can be statically counter-balanced by adding compensating gravity loads. Similarly, gravity loads or spring loads can be counterbalanced by adding springs. In the current literature, among the techniques that add springs, some achieve perfect static balance while others achieve only approximate balance. Further, all of them add auxiliary bodies to the linkage in addition to springs. We present a perfect static balancing technique that adds only springs but not auxiliary bodies, in contrast to the existing techniques. This technique can counter-balance both gravity loads and spring loads. The technique requires that every joint that connects two bodies in the linkage be either a revolute joint or a spherical joint. Apart from this, the linkage can have any number of bodies connected in any manner. In order to achieve perfect balance, this technique requires that all the spring loads have the feature of zero-free-length, as is the case with the existing techniques. This requirement is neither impractical nor restrictive since the feature can be practically incorporated into any normal spring either by modifying the spring or by adding another spring in parallel. DOI: 10.1115/1.4006521]

Power Controlled Reverse Channel Training Achieves an Infinite Diversity Order in a TDD-SIMO System with Perfect CSIR

In this letter, we analyze the Diversity Multiplexinggain Tradeoff (DMT) performance of a training-based reciprocal Single Input Multiple Output (SIMO) system. Assuming Channel State Information (CSI) is available at the Receiver (CSIR), we propose a channel-dependent power-controlled Reverse Channel Training (RCT) scheme that enables the transmitter to directly estimate the power control parameter to be used for the forwardlink data transmission. We show that, with an RCT power of (P) over bar (gamma), gamma > 0 and a forward data transmission power of (P) over bar, our proposed scheme achieves an infinite diversity order for 0 <= g(m) < L-c-L-B,L-tau/L-c min(gamma, 1) and r > 2, where g(m) is the multiplexing gain, L-c is the channel coherence time, L-B,L-tau is the RCT duration and r is the number of receive antennas. We also derive an upper bound on the outage probability and show that it goes to zero asymptotically as exp(-(P) over bar (E)), where E (sic) (gamma - g(m)L(c)/L-c-L-B,L-tau), at high (P) over bar. Thus, the proposed scheme achieves a significantly better DMT performance compared to the finite diversity order achieved by channel-agnostic, fixed-power RCT schemes.

Improved perfect space-time block codes

Perfect space-time block codes (STBCs) are based on four design criteria-full-rateness, nonvanishing determinant, cubic shaping, and uniform average transmitted energy per antenna per time slot. Cubic shaping and transmission at uniform average energy per antenna per time slot are important from the perspective of energy efficiency of STBCs. The shaping criterion demands that the generator matrix of the lattice from which each layer of the perfect STBC is carved be unitary. In this paper, it is shown that unitariness is not a necessary requirement for energy efficiency in the context of space-time coding with finite input constellations, and an alternative criterion is provided that enables one to obtain full-rate (rate of complex symbols per channel use for an transmit antenna system) STBCs with larger normalized minimum determinants than the perfect STBCs. Further, two such STBCs, one each for 4 and 6 transmit antennas, are presented and they are shown to have larger normalized minimum determinants than the comparable perfect STBCs which hitherto had the best-known normalized minimum determinants.

Parameterized Algorithms for MAX COLORABLE INDUCED SUBGRAPH Problem on Perfect Graphs

We address the parameterized complexity ofMaxColorable Induced Subgraph on perfect graphs. The problem asks for a maximum sized q-colorable induced subgraph of an input graph G. Yannakakis and Gavril IPL 1987] showed that this problem is NP-complete even on split graphs if q is part of input, but gave a n(O(q)) algorithm on chordal graphs. We first observe that the problem is W2]-hard parameterized by q, even on split graphs. However, when parameterized by l, the number of vertices in the solution, we give two fixed-parameter tractable algorithms. The first algorithm runs in time 5.44(l) (n+#alpha(G))(O(1)) where #alpha(G) is the number of maximal independent sets of the input graph. The second algorithm runs in time q(l+o()l())n(O(1))T(alpha) where T-alpha is the time required to find a maximum independent set in any induced subgraph of G. The first algorithm is efficient when the input graph contains only polynomially many maximal independent sets; for example split graphs and co-chordal graphs. The running time of the second algorithm is FPT in l alone (whenever T-alpha is a polynomial in n), since q <= l for all non-trivial situations. Finally, we show that (under standard complexitytheoretic assumptions) the problem does not admit a polynomial kernel on split and perfect graphs in the following sense: (a) On split graphs, we do not expect a polynomial kernel if q is a part of the input. (b) On perfect graphs, we do not expect a polynomial kernel even for fixed values of q >= 2.

ELISA: An Estimated Load Information Scheduling Algorithm for Distributed Computing Systems

In this paper, we present a decentralized dynamic load scheduling/balancing algorithm called ELISA (Estimated Load Information Scheduling Algorithm) for general purpose distributed computing systems. ELISA uses estimated state information based upon periodic exchange of exact state information between neighbouring nodes to perform load scheduling. The primary objective of the algorithm is to cut down on the communication and load transfer overheads by minimizing the frequency of status exchange and by restricting the load transfer and status exchange within the buddy set of a processor. It is shown that the resulting algorithm performs almost as well as a perfect information algorithm and is superior to other load balancing schemes based on the random sharing and Ni-Hwang algorithms. A sensitivity analysis to study the effect of various design parameters on the effectiveness of load balancing is also carried out. Finally, the algorithm's performance is tested on large dimensional hypercubes in the presence of time-varying load arrival process and is shown to perform well in comparison to other algorithms. This makes ELISA a viable and implementable load balancing algorithm for use in general purpose distributed computing systems.

Role of TATATAA element in the regulation of tRNA(1)(Gly) gene expression in Bombyx mori is position dependent

Transcription of tRNA genes by RNA polymerase III is controlled by the internal conserved sequences within the coding region and the immediate upstream flanking sequences. A highly transcribed copy of glycyl tRNA gene tRNA1(Gly)-1 from Bombyx mori is down regulated by sequences located much farther upstream in the region -150 to -300 nucleotides (nt), with respect to the +1 nt of tRNA. The negative regulatory effect has been narrowed down to a sequence motif 'TATATAA', a perfect consensus recognised by the TATA binding protein, TBP. This sequence element, when brought closer to the transcription start point, on the other hand, exerts a positive effect by promoting transcription of the gene devoid of other cis regulatory elements. The identity of the nuclear protein interacting with this 'TATATAA' element to TBP has been established by antibody and mutagenesis studies. The 'TATATAA' element thus influences the transcription of tRNA genes positively or negatively in a position-dependent manner either by recruitment or sequestration of TBP from the transcription machinery.

A comparative social network analysis of wasp colonies and classrooms: Linking network structure to functioning

A major question in current network science is how to understand the relationship between structure and functioning of real networks. Here we present a comparative network analysis of 48 wasp and 36 human social networks. We have compared the centralisation and small world character of these interaction networks and have studied how these properties change over time. We compared the interaction networks of (1) two congeneric wasp species (Ropalidia marginata and Ropalidia cyathiformis), (2) the queen-right (with the queen) and queen-less (without the queen) networks of wasps, (3) the four network types obtained by combining (1) and (2) above, and (4) wasp networks with the social networks of children in 36 classrooms. We have found perfect (100%) centralisation in a queen-less wasp colony and nearly perfect centralisation in several other queen-less wasp colonies. Note that the perfectly centralised interaction network is quite unique in the literature of real-world networks. Differences between the interaction networks of the two wasp species are smaller than differences between the networks describing their different colony conditions. Also, the differences between different colony conditions are larger than the differences between wasp and children networks. For example, the structure of queen-right R. marginata colonies is more similar to children social networks than to that of their queen-less colonies. We conclude that network architecture depends more on the functioning of the particular community than on taxonomic differences (either between two wasp species or between wasps and humans).

Structure and magnetotransport properties of the layered manganites REl.2Srl.8Mn,07(R E = La, Pr, Nd)

We have examined the magnetotransport properties and the structure, by Rietveld refinement of powder X-ray data, of the phases RE(1.2)Sr(1.8)Mn(2)O(7) (RE = La, Pr, Nd). We find that on cooling, La1.2Sr1.8Mn2O7 undergoes a transition to a nearly perfect ferromagnet with 90% magnetization at 1.45 T, as reported by earlier workers, but the Pr and Nd phases show only a small magnetization that grows gradually as the temperature is decreased. There seems to be significant correlation between electrical transport and the Jahn-Teller elongation of the apical Mn-O bonds in these systems. The elongation of the apical Mn-O bonds forces the nine-coordinate rock-salt site to be occupied preferentially by the smaller rare-earth-metal cations. This preferential occupation is reliably obtained from the X-ray refinement. All three title phases show a magnetoresistance ratio of about 4(corresponding to a magnetoresistance, [R(0)-R(H)]/R(0), of about 75%) at a field of 7 T and temperatures around 100 K.

In search of inorganic nonlinear optical materials for second harmonic generation

In a search for inorganic oxide materials showing second-order nonlinear optical (NLO) susceptibility, we investigated several berates, silicates, and a phosphate containing trans-connected MO6, octahedral chains or MO5 square pyramids, where, M = d(0): Ti(IV), Nb(V), or Ta(V), Our investigations identified two new NLO structures: batisite, Na2Ba(TiO)(2)Si4O12, containing trans-connected TiO5 octahedral chains, and fresnoite, Ba2TiOSi2O7, containing square-pyramidal TiO5. Investigation of two other materials containing square-pyramidal TiO5 viz,, Cs2TiOP2O7 and Na4Ti2Si8O22. 4H(2)O, revealed that isolated TiO5, square pyramids alone do not cause a second harmonic generation (SHG) response; rather, the orientation of TiO5 units to produce -Ti-O-Ti-O- chains with alternating long and short Ti-O distances in the fresnoite structure is most likely the origin of a strong SHG response in fresnoite,

Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks

A relay network with N relays and a single source-destination pair is called a partially-coherent relay channel (PCRC) if the destination has perfect channel state information (CSI) of all the channels and the relays have only the phase information of the source-to-relay channels. In this paper, first, a new set of necessary and sufficient conditions for a space-time block code (STBC) to be single-symbol decodable (SSD) for colocated multiple antenna communication is obtained. Then, this is extended to a set of necessary and sufficient conditions for a distributed STBC (DSTBC) to be SSD for. a PCRC. Using this, several SSD DSTBCs for PCRC are identified. It is proved that even if a SSD STBC for a co-located MIMO channel does not satisfy the additional conditions for the code to be SSD for a PCRC, single-symbol decoding of it in a PCRC gives full-diversity and only coding gain is lost. It is shown that when a DSTBC is SSD for a PCRC, then arbitrary coordinate interleaving of the in-phase and quadrature-phase components of the variables does not disturb its SSD property for PCRC. Finally, it is shown that the possibility of channel phase compensation operation at the relay nodes using partial CSI at the relays increases the possible rate of SSD DSTBCs from (2)/(N) when the relays do not have CSI to(1)/(2), which is independent of N.

Structure of (6S,13bR)-1,2,3,5,6,13b-hexahydro-6-isopropyl-8H-pyrrolo[1',2':1,2]pyrazino[3,4,-b]quinazoline-5,8-dione

C17H19N302, monoclinic, P21, a = 5.382 (1), b = 17.534(4), c = 8.198(1)/L ,8 = 100.46(1) °, Z= 2, d,, = 1.323, dc= 1.299 Mg m-3, F(000) = 316, /~(Cu .Ka) = 0.618 mm -1. R = 0.052 for 1284 significant reflections. The proline-containing cispeptide unit which forms part of a six-membered ring deviates from perfect planarity. The torsion angle about the peptide bond is 3.0 (5) ° and the peptide bond length is 1.313 (5)A. The conformation of the proline ring is Cs-Cf~-endo. The crystal structure is stabilized by C-H... O interactions.

Analysis of an orthotropic cylindrical shell having a transversely isotropic core subjected to axisymmetric load

A long two-layered circular cylinder having a thin orthotropic outer shell and a thick transversely isotropic core subjected to an axisymmetric radialv line load has been analysed. For analysis of the outer shell the classical thin shell theory was adopted and for analysis of the inner core the elasticity theory was used. The continuity of stresses and deformations at the interface has been satisfied by assumming perfect adhesion between the layers. Numerical results have been presented for two different ratios of outer shell thickness to inner radius and for three different ratios of modulus of elasticity in the radial direction of outer shell to inner core. The results have been compared with the elasticity solution of the same problem to bring out the reliability of this hybrid method. References

Structure of (6S,13bR)-1,2,3,5,6,13b-hexahydro-6-isopropyl-8H-pyrrolo[1',2':1,2]pyrazino[3,4,-b]quinazoline-5,8-dione

C17H19N302, monoclinic, P21, a = 5.382 (1), b = 17.534(4), c = 8.198(1)/L ,8 = 100.46(1) °, Z= 2, d,, = 1.323, dc= 1.299 Mg m-3, F(000) = 316, /~(Cu .Ka) = 0.618 mm -1. R = 0.052 for 1284 significant reflections. The proline-containing cispeptide unit which forms part of a six-membered ring deviates from perfect planarity. The torsion angle about the peptide bond is 3.0 (5) ° and the peptide bond length is 1.313 (5)A. The conformation of the proline ring is Cs-Cf~-endo. The crystal structure is stabilized by C-H... O interactions.