Recent Advances and Industrial Applications of Multilevel Converters

Multilevel converters have been under research and development for more than three decades and have found successful industrial application. However, this is still a technology under development, and many new contributions and new commercial topologies have been reported in the last few years. The aim of this paper is to group and review these recent contributions, in order to establish the current state of the art and trends of the technology, to provide readers with a comprehensive and insightful review of where multilevel converter technology stands and is heading. This paper first presents a brief overview of well-established multilevel converters strongly oriented to their current state in industrial applications to then center the discussion on the new converters that have made their way into the industry. In addition, new promising topologies are discussed. Recent advances made in modulation and control of multilevel converters are also addressed. A great part of this paper is devoted to show nontraditional applications powered by multilevel converters and how multilevel converters are becoming an enabling technology in many industrial sectors. Finally, some future trends and challenges in the further development of this technology are discussed to motivate future contributions that address open problems and explore new possibilities.

Locally checkable proofs

This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distributed algorithm: all nodes must accept a valid proof, and at least one node must reject an invalid proof. We focus on locally checkable proofs that can be verified with a constant-time distributed algorithm. For example, it is easy to prove that a graph is bipartite: the locally checkable proof gives a 2-colouring of the graph, which only takes 1 bit per node. However, it is more difficult to prove that a graph is not bipartite—it turns out that any locally checkable proof requires Ω(log n) bits per node. In this work we classify graph problems according to their local proof complexity, i.e., how many bits per node are needed in a locally checkable proof. We establish tight or near-tight results for classical graph properties such as the chromatic number. We show that the proof complexities form a natural hierarchy of complexity classes: for many classical graph problems, the proof complexity is either 0, Θ(1), Θ(log n), or poly(n) bits per node. Among the most difficult graph properties are symmetric graphs, which require Ω(n2) bits per node, and non-3-colourable graphs, which require Ω(n2/log n) bits per node—any pure graph property admits a trivial proof of size O(n2).

Energy for the Developing World

Described are methods which can be used by developing countries to affordably obtain the energy without ruining the environment. The approaches mix efficient end-use technologies with modest increases in generating capacity. (CW).

Cloning and sequence of a cDNA encoding a novel hybrid prolme-rich protein associated with cytokinin-induced haustoria formation in Cuscuta reflexa

A complete cDNA encoding a novel hybrid Pro-rich protein (HyPRP) was identified by differentially screening 3x10(4) recombinant plaques of a Cuscuta reflexa cytokinin-induced haustorial cDNA library constructed in lambda gt10. The nucleotide (nt) sequence consists of: (i) a 424-bp 5'-non coding region having five start codons (ATGs) and three upstream open reading frames (uORFs); (ii) an ORF of 987 bp with coding potential for a 329-amino-acid (aa) protein of M(r), 35203 with a hydrophobic N-terminal region including a stretch of nine consecutive Phe followed by a Pro-rich sequence and a Cys-rich hydrophobic C terminus; and (iii) a 178-bp 3'-UTR (untranslated region). Comparison of the predicted aa sequence with the NBRF and SWISSPROT databases and with a recent report of an embryo-specific protein of maize [Jose-Estanyol et al., Plant Cell 4 (1992) 413-423] showed it to be similar to the class of HyPRPs encoded by genes preferentially expressed in young tomato fruits, maize embryos and in vitro-cultured carrot embryos. Northern analysis revealed an approx. 1.8-kb mRNA of this gene expressed in the subapical region of the C. reflexa vine which exhibited maximum sensitivity to cytokinin in haustorial induction.

Design issues and caching strategies for CD-ROM based multimedia storage

CD-ROMs have proliferated as a distribution media for desktop machines for a large variety of multimedia applications (targeted for a single-user environment) like encyclopedias, magazines and games. With CD-ROM capacities up to 3 GB being available in the near future, they will form an integral part of Video on Demand (VoD) servers to store full-length movies and multimedia. In the first section of this paper we look at issues related to the single- user desktop environment. Since these multimedia applications are highly interactive in nature, we take a pragmatic approach, and have made a detailed study of the multimedia application behavior in terms of the I/O request patterns generated to the CD-ROM subsystem by tracing these patterns. We discuss prefetch buffer design and seek time characteristics in the context of the analysis of these traces. We also propose an adaptive main-memory hosted cache that receives caching hints from the application to reduce the latency when the user moves from one node of the hyper graph to another. In the second section we look at the use of CD-ROM in a VoD server and discuss the problem of scheduling multiple request streams and buffer management in this scenario. We adapt the C-SCAN (Circular SCAN) algorithm to suit the CD-ROM drive characteristics and prove that it is optimal in terms of buffer size management. We provide computationally inexpensive relations by which this algorithm can be implemented. We then propose an admission control algorithm which admits new request streams without disrupting the continuity of playback of the previous request streams. The algorithm also supports operations such as fast forward and replay. Finally, we discuss the problem of optimal placement of MPEG streams on CD-ROMs in the third section.

Video coding mode decision as a classification problem

In this paper, we show that it is possible to reduce the complexity of Intra MB coding in H.264/AVC based on a novel chance constrained classifier. Using the pairs of simple mean-variances values, our technique is able to reduce the complexity of Intra MB coding process with a negligible loss in PSNR. We present an alternate approach to address the classification problem which is equivalent to machine learning. Implementation results show that the proposed method reduces encoding time to about 20% of the reference implementation with average loss of 0.05 dB in PSNR.

Design and Optimization of Broadband Micromachined Antenna

Performance improvement of a micromachined patch antenna operating at 30 GHz with a capacitively coupled feed arrangement is presented here. Such antennas are useful for monolithic integration with active components. Specifically, micromachining can be employed to achieve a low dielectric constant region under the patch which causes (i) the suppression of surface waves and hence the increase in radiation efficiency and (ii) increase in the bandwidth. The performance of such a patch antenna can be significantly improved by selecting a coupled feed arrangement. We have optimized the dimensions and location of the capacitive feeding strip to get the maximum improvement in bandwidth. Since this is a totally planar arrangement, and does not involve any stacked structures, this antenna is easy to fabricate using standard microfabrication techniques. The antenna element thus designed has a -10 dB bandwidth of 1600 MHz

Ag@Pd core-shell nanoparticles

Colloids of silver and palladium nanoparticles have been prepared by the Solvated Metal Atom Dispersion method. The as-prepared Ag colloid consisting of polydisperse nanoparticles is transformed into a monodisperse colloid by the digestive ripening process which involves refluxing the as-prepared colloid in the presence of a surfactant. In addition to the monodisperse nanoparticles, a small amount of an Ag-thiolate complex is also formed. Refluxing a mixture of the as-prepared Ag and Pd colloids results in Ag@Pd core-shell nanoparticles. The core-shell structure has been established using a combination of techniques such as UV-visible spectroscopy, high resolution electron microscopy, energy filtered electron microscopy, energy dispersive X-ray analysis, high angle annular dark field imaging and powder X-ray diffraction.