A Hybrid Multilevel Inverter Topology for an Open-End Winding Induction-Motor Drive Using Two-Level Inverters in Series With a Capacitor-Fed H-Bridge Cell

In this paper, a new five-level inverter topology for open-end winding induction-motor (IM) drive is proposed. The open-end winding IM is fed from one end with a two-level inverter in series with a capacitor-fed H-bridge cell, while the other end is connected to a conventional two-level inverter. The combined inverter system produces voltage space-vector locations identical to that of a conventional five-level inverter. A total of 2744 space-vector combinations are distributed over 61 space-vector locations in the proposed scheme. With such a high number of switching state redundancies, it is possible to balance the H-bridge capacitor voltages under all operating conditions including overmodulation region. In addition to that, the proposed topology eliminates 18 clamping diodes having different voltage ratings compared with the neutral point clamped inverter. On the other hand, it requires only one capacitor bank per phase, whereas the flying-capacitor scheme for a five-level topology requires more than one capacitor bank per phase. The proposed inverter topology can be operated as a three-level inverter for full modulation range, in case of any switch failure in the capacitor-fed H-bridge cell. This will increase the reliability of the system. The proposed scheme is experimentally verified on a four-pole 5-hp IM drive.

Probing disorder in cubic pyrochlore Bi-1 Zn-5(1) Nb-0(1) O-5(7) (BZN) thin films

The dielectric response of pulsed laser ablated Bi-1 Zn-5(1) Nb-0(1) O-5(7) (BZN) thin films are investigated within the temperature range of 300-660 K and frequency range of 100 Hz-100 kHz Thin film exhibited a strong dielectric relaxation behavior A sharp rise in dielectric constant of BZN thin film at high temperatures is related to disorder in canon and anion lattices Observed dielectric relaxation implies a redistribution of charges within the unit cell This phenomenon suggests that the large change in dielectric constant is due to a dynamical rise of dipolar fluctuations in the unit cell XPS spectra of BZN (A(2)B(2)O(6)O') cubic pyrochlore confirm that the relaxation corresponds to the ionic hopping among the A and O' positions of several local potential minima Barrier height for hopping is distributed between 0 and 0 94 eV The O is spectrum confirms presence of two types of oxygen in BZN thin film The disorder in charge neutralized thin film is correlated with XPS spectra (C) 2010 Elsevier Ltd All rights reserved

A new methodology for analyzing distributed systems modeled by petri nets

Distributed computing systems can be modeled adequately by Petri nets. The computation of invariants of Petri nets becomes necessary for proving the properties of modeled systems. This paper presents a two-phase, bottom-up approach for invariant computation and analysis of Petri nets. In the first phase, a newly defined subnet, called the RP-subnet, with an invariant is chosen. In the second phase, the selected RP-subnet is analyzed. Our methodology is illustrated with two examples viz., the dining philosophers' problem and the connection-disconnection phase of a transport protocol. We believe that this new method, which is computationally no worse than the existing techniques, would simplify the analysis of many practical distributed systems.

A Strategy for Conserving the Biodiversity of the Uttara Kannada District in South India

Taking the various values ascribed to biodiversity as its point of departure rather many years ago, the present study aims at deriving a conservation strategy for Uttara Kannada. This hilly district, with the highest proportion of its area under forests in South India, is divided into five ecological zones: coastal, northern evergreen, southern evergreen, moist deciduous, and dry deciduous. The heavily-populated coastal zone includes mangrove forests and estuarine wetlands. The evergreen forests are particularly rich in the diversity of plant species which they support - including wild relatives of a number of cultivated plants. They also serve a vital function in watershed conservation. The moist deciduous forests are rich in bird species; both moist and dry deciduous forests include a number of freshwater ponds and lakes that support a high diversity of aquatic birds.Reviewing the overall distribution of biodiversity, we identify specific localities - including estuaries, evergreen forests, and moist deciduous forests - which should be set aside as Nature reserves. These larger reserves must be complemented by a network of traditionally-protected sacred groves and sacred trees that are distributed throughout the district and that protect today, for instance, the finest surviving stand of dipterocarp trees.We also spell out the necessary policy-changes in overall development strategy that should stem the ongoing decimation of biodiversity. These include (1) revitalizing community-based systems of sustainable management of village forests and protection of sacred groves and trees; (2) reorienting the usage-pattern of reserve forests from production of a limited variety of timber and softwood species for industrial consumers, to production of a larger diversity of non-wood forest produce of commercial value to support the rural economy; (3) utilizing marginal lands under private ownership for generating industrial wood supplies; and (4) provision of incentives for in situ maintenance of land-races of cultivated plants - especially evergreen, fruit-yielding trees - by the local people.It is proposed that this broad framework be now taken to the local communities, and that an action-plan be developed on the basis of inputs provided - and initiatives taken - by them.

Social Life of Captive Asian Elephants (Elephas maximus) in Southern India: Implications for Elephant Welfare

Asian elephants in the wild live in complex social societies; in captivity, however, management often occurs in solitary conditions, especially at the temples and private places of India. To investigate the effect of social isolation, this study assessed the social group sizes and the presence of stereotypies among 140 captive Asian elephants managed in 3 captive systems (private, temple, and forest department) in Tamil Nadu, India, between 2003 and 2005. The majority of the facilities in the private (82%) and temple (95%) systems held a single elephant without opportunity for social interaction. The forest department managed the elephants in significantly larger groups than the private and temple systems. Among the 3 systems, the proportion of elephants with stereotypies was the highest in temple (49%) followed by private system (26%) and the forest department facility (6%); this correlates with the social isolation trend observed in the 3 systems and suggests a possible link between social isolation and abnormal elephant behavior separate from other environmental factors. The results of this study indicate it would be of greater benefit to elephant well being to keep the patchily distributed solitary temple and private elephants who are socially compatible and free from contagious diseases in small social groups at ocommon elephant houseso for socialization.

Armchair or Zigzag? A tool for characterizing graphene edge

Electronic, magnetic, and structural properties of graphene flakes depend sensitively upon the type of edge atoms. We present a simple software tool for determining the type of edge atoms in a honeycomb lattice. The algorithm is based on nearest neighbor counting. Whether an edge atom is of armchair or zigzag type is decided by the unique pattern of its nearest neighbors. Particular attention is paid to the practical aspects of using the tool, as additional features such as extracting out the edges from the lattice could help in analyzing images from transmission microscopy or other experimental probes. Ultimately, the tool in combination with density-functional theory or tight-binding method can also be helpful in correlating the properties of graphene flakes with the different armchair-to-zigzag ratios. Program summary Program title: edgecount Catalogue identifier: AEIA_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEIA_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 66685 No. of bytes in distributed program, including test data, etc.: 485 381 Distribution format: tar.gz Programming language: FORTRAN 90/95 Computer: Most UNIX-based platforms Operating system: Linux, Mac OS Classification: 16.1, 7.8 Nature of problem: Detection and classification of edge atoms in a finite patch of honeycomb lattice. Solution method: Build nearest neighbor (NN) list; assign types to edge atoms on the basis of their NN pattern. Running time: Typically similar to second(s) for all examples. (C) 2010 Elsevier B.V. All rights reserved.

Distributed Coding for Multiple Access Communication with Side Information

In a typical sensor network scenario a goal is to monitor a spatio-temporal process through a number of inexpensive sensing nodes, the key parameter being the fidelity at which the process has to be estimated at distant locations. We study such a scenario in which multiple encoders transmit their correlated data at finite rates to a distant, common decoder over a discrete time multiple access channel under various side information assumptions. In particular, we derive an achievable rate region for this communication problem.

Toward Effective Scalar Hardware for Highly Vectorizable Applications

The performance of a program will ultimately be limited by its serial (scalar) portion, as pointed out by Amdahl′s Law. Reported studies thus far of instruction-level parallelism have mixed data-parallel program portions with scalar program portions, often leading to contradictory and controversial results. We report an instruction-level behavioral characterization of scalar code containing minimal data-parallelism, extracted from highly vectorized programs of the PERFECT benchmark suite running on a Cray Y-MP system. We classify scalar basic blocks according to their instruction mix, characterize the data dependencies seen in each class, and, as a first step, measure the maximum intrablock instruction-level parallelism available. We observe skewed rather than balanced instruction distributions in scalar code and in individual basic block classes of scalar code; nonuniform distribution of parallelism across instruction classes; and, as expected, limited available intrablock parallelism. We identify frequently occurring data-dependence patterns and discuss new instructions to reduce latency. Toward effective scalar hardware, we study latency-pipelining trade-offs and restricted multiple instruction issue mechanisms.

Understanding changes in the Himalayan cryosphere using remote sensing techniques

In the Himalayas, a large area is covered by glaciers and seasonal snow and changes in its extent can influence availability of water in the Himalayan Rivers. In this paper, changes in glacial extent, glacial mass balance and seasonal snow cover are discussed. Glacial retreat was estimated for 1868 glaciers in 11 basins distributed in the Indian Himalaya since 1962. The investigation has shown an overall reduction in glacier area from 6332 to 5329km2 from 1962 to 2001/2 - an overall deglaciation of 16%. Snow line at the end of ablation season on the Chhota Shigri glacier observed using field and satellite methods suggests a change in altitude from 4900 to 5200m from the late 1970s to present. Seasonal snow cover was monitored in the 28 river sub-basins using normalized difference snow index (NDSI) technique in Central and Western Himalaya. The investigation has shown that in the early part of winter, i.e. from October to December, a large amount of snow retreat was observed. For many basins located in lower altitude and in the south of the Pir Panjal range, snow ablation was observed throughout the winter season. In addition, average stream runoff of the Baspa basin for the month of December increased by 75%. This combination of glacial retreat, negative mass balance, early melting of seasonal snow cover and winter-time increase in stream runoff might suggest an influence of global warming on the Himalayan cryosphere.

Automatic verification of distributed logic specifications

Formal specification is vital to the development of distributed real-time systems as these systems are inherently complex and safety-critical. It is widely acknowledged that formal specification and automatic analysis of specifications can significantly increase system reliability. Although a number of specification techniques for real-time systems have been reported in the literature, most of these formalisms do not adequately address to the constraints that the aspects of 'distribution' and 'real-time' impose on specifications. Further, an automatic verification tool is necessary to reduce human errors in the reasoning process. In this regard, this paper is an attempt towards the development of a novel executable specification language for distributed real-time systems. First, we give a precise characterization of the syntax and semantics of DL. Subsequently, we discuss the problems of model checking, automatic verification of satisfiability of DL specifications, and testing conformance of event traces with DL specifications. Effective solutions to these problems are presented as extensions to the classical first-order tableau algorithm. The use of the proposed framework is illustrated by specifying a sample problem.

Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage

In the distributed storage setting that we consider, data is stored across n nodes in the network such that the data can be recovered by connecting to any subset of k nodes. Additionally, one can repair a failed node by connecting to any d nodes while downloading beta units of data from each. Dimakis et al. show that the repair bandwidth d beta can be considerably reduced if each node stores slightly more than the minimum required and characterize the tradeoff between the amount of storage per node and the repair bandwidth. In the exact regeneration variation, unlike the functional regeneration, the replacement for a failed node is required to store data identical to that in the failed node. This greatly reduces the complexity of system maintenance. The main result of this paper is an explicit construction of codes for all values of the system parameters at one of the two most important and extreme points of the tradeoff - the Minimum Bandwidth Regenerating point, which performs optimal exact regeneration of any failed node. A second result is a non-existence proof showing that with one possible exception, no other point on the tradeoff can be achieved for exact regeneration.

A Flexible Class of Regenerating Codes for Distributed Storage

In the distributed storage setting introduced by Dimakis et al., B units of data are stored across n nodes in the network in such a way that the data can be recovered by connecting to any k nodes. Additionally one can repair a failed node by connecting to any d nodes while downloading at most beta units of data from each node. In this paper, we introduce a flexible framework in which the data can be recovered by connecting to any number of nodes as long as the total amount of data downloaded is at least B. Similarly, regeneration of a failed node is possible if the new node connects to the network using links whose individual capacity is bounded above by beta(max) and whose sum capacity equals or exceeds a predetermined parameter gamma. In this flexible setting, we obtain the cut-set lower bound on the repair bandwidth along with a constructive proof for the existence of codes meeting this bound for all values of the parameters. An explicit code construction is provided which is optimal in certain parameter regimes.

Generating synchronizable test sequences based on finite-statemachine with distributed ports

In the area of testing communication systems, the interfaces between systems to be tested and their testers have great impact on test generation and fault detectability. Several types of such interfaces have been standardized by the International Standardization Organization (ISO). A general distributed test architecture, containing distributed interfaces, has been presented in the literature for testing distributed systems based on the Open Distributing Processing (ODP) Basic Reference Model (BRM), which is a generalized version of ISO distributed test architecture. We study in this paper the issue of test selection with respect to such an test architecture. In particular, we consider communication systems that can be modeled by finite state machines with several distributed interfaces, called ports. A test generation method is developed for generating test sequences for such finite state machines, which is based on the idea of synchronizable test sequences. Starting from the initial effort by Sarikaya, a certain amount of work has been done for generating test sequences for finite state machines with respect to the ISO distributed test architecture, all based on the idea of modifying existing test generation methods to generate synchronizable test sequences. However, none studies the fault coverage provided by their methods. We investigate the issue of fault coverage and point out a fact that the methods given in the literature for the distributed test architecture cannot ensure the same fault coverage as the corresponding original testing methods. We also study the limitation of fault detectability in the distributed test architecture.

Managing interprocessor delays in distributed recursive algorithms

For a class of distributed recursive algorithms, it is shown that a stochastic approximation-like tapering stepsize routine suppresses the effects of interprocessor delays.

A Flat Concurrent Prolog compiler for PARAM

We describe a compiler for the Flat Concurrent Prolog language on a message passing multiprocessor architecture. This compiler permits symbolic and declarative programming in the syntax of Guarded Horn Rules, The implementation has been verified and tested on the 64-node PARAM parallel computer developed by C-DAC (Centre for the Development of Advanced Computing, India), Flat Concurrent Prolog (FCP) is a logic programming language designed for concurrent programming and parallel execution, It is a process oriented language, which embodies dataflow synchronization and guarded-command as its basic control mechanisms. An identical algorithm is executed on every processor in the network, We assume regular network topologies like mesh, ring, etc, Each node has a local memory, The algorithm comprises of two important parts: reduction and communication, The most difficult task is to integrate the solutions of problems that arise in the implementation in a coherent and efficient manner. We have tested the efficacy of the compiler on various benchmark problems of the ICOT project that have been reported in the recent book by Evan Tick, These problems include Quicksort, 8-queens, and Prime Number Generation, The results of the preliminary tests are favourable, We are currently examining issues like indexing and load balancing to further optimize our compiler.