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.

Building the perfect 3D hologram

A new liquid crystal device structure has been developed using a vertically grown Multi-Wall Carbon NanoTube (MWCNT) as a 3D electrode structure, which allows complicated phase only hologram to be displayed using conventional liquid crystal materials. The nanotubes act as an individual electrode sites that generate an electric field profile, dictating the refractive index profile with the liquid crystal cell. Changing the electric field applied makes it possible to tune the properties to modulate the light in an ideal kinoform. A perfect 3D image can be generated by a computer generated hologram by using the diffraction of the light from the hologram pixels to create an optical wave front that appears to come from 3D object. A multilevel phase modulating device based on nematic LC's is also under progress, which will be used with the LC/CNT devices on an LCOS backplane to project a full 3D image from the kinoform.

Controllable Kerr nonlinearity with perfect transparency in the existence of spontaneously generated coherence

We investigate the Kerr nonlinearity of a V-type three-level atomic system where the upper two states decay outside to another state and hence spontaneous generated coherence may exist. It is shown that dark state and hence perfect transparency present under certain conditions. Meanwhile, the Kerr nonlinearity can be controlled by manipulation of the decay rates and the splitting of the two excited states. Therefore, enhanced Kerr nonlinearity without absorption can be obtained under proper parameters.

PGPRs and nitrogen-fixing legumes: a perfect team for efficient Cd phytoremediation?

Cadmium (Cd) is a toxic, biologically non-essential and highly mobile metal that has become an increasingly important environmental hazard to both wildlife and humans. In contrast to conventional remediation technologies, phytoremediation based on legume rhizobia symbiosis has emerged as an inexpensive decontamination alternative which also revitalize contaminated soils due to the role of legumes in nitrogen cycling. In recent years, there is a growing interest in understanding symbiotic legume rhizobia relationship and its interactions with Cd. The aim of the present review is to provide a comprehensive picture of the main effects of Cd in N-2-fixing leguminous plants and the benefits of exploiting this symbiosis together with plant growth promoting rhizobacteria to boost an efficient reclamation of Cd-contaminated soils.