Switching frequency variation control in hysteresis PWM controller for IM drives using variable parabolic bands for current error space phasor

Variation of switching frequency over the entire operating speed range of an induction motor (M drive is the major problem associated with conventional two-level three-phase hysteresis controller as well as the space phasor based PWM hysteresis controller. This paper describes a simple hysteresis current controller for controlling the switching frequency variation in the two-level PWM inverter fed IM drives for various operating speeds. A novel concept of continuously variable hysteresis boundary of current error space phasor with the varying speed of the IM drive is proposed in the present work. The variable parabolic boundary for the current error space phasor is suggested for the first time in this paper for getting the switching frequency pattern with the hysteresis controller, similar to that of the constant switching frequency voltage-controlled space vector PWM (VC-SVPWM) based inverter fed IM drive. A generalized algorithm is also developed to determine parabolic boundary for controlling the switching frequency variation, for any IM load. Only the adjacent inverter voltage vectors forming a triangular sector, in which tip of the machine voltage vector ties, are switched to keep current error space vector within the parabolic boundary. The controller uses a self-adaptive sector identification logic, which provides smooth transition between the sectors and is capable of taldng the inverter up to six-step mode of operation, if demanded by drive system. The proposed scheme is simulated and experimentally verified on a 3.7 kW IM drive.

Theoretical foundations for multiple rendezvous of glowworm-inspired mobile agents with variable local-decision domains

We present the theoretical foundations for the multiple rendezvous problem involving design of local control strategies that enable groups of visibility-limited mobile agents to split into subgroups, exhibit simultaneous taxis behavior towards, and eventually rendezvous at, multiple unknown locations of interest. The theoretical results are proved under certain restricted set of assumptions. The algorithm used to solve the above problem is based on a glowworm swarm optimization (GSO) technique, developed earlier, that finds multiple optima of multimodal objective functions. The significant difference between our work and most earlier approaches to agreement problems is the use of a virtual local-decision domain by the agents in order to compute their movements. The range of the virtual domain is adaptive in nature and is bounded above by the maximum sensor/visibility range of the agent. We introduce a new decision domain update rule that enhances the rate of convergence by a factor of approximately two. We use some illustrative simulations to support the algorithmic correctness and theoretical findings of the paper.

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.

Diesel Engine Driven Stand-Alone Variable Speed Constant Frequency Slip Ring Induction Generator - Theory and Experimental Results

The operation of a stand-alone, as opposed to grid connected generation system, using a slip-ring induction machine as the electrical generator, is considered. In contrast to an alternator, a slip-ring induction machine can run at variable speed and still deliver constant frequency power to loads. This feature enables optimization of the system when the prime mover is inherently variable speed in nature eg. wind turbines, as well as diesel driven systems, where there is scope for economizing on fuel consumption. Experimental results from a system driven by a 44 bhp diesel engine are presented. Operation at subsynchronous as well as super-synchronous speeds is examined. The measurement facilitates the understanding of the system as well as its design.

Photometric calibration of the CCD camera of 1-m telescope at VBO

Calibration of the CCD camera of the 1-m telescope at the Vainu Bappu Observatory, Kavalur, to the BVR system is reported here based on the observations of stars in the 'dipper asterism' in the open cluster M 67 (NGC 2682). Transformations involving B and V have negligible colour terms, while those involving R are slightly colour dependent. The possibility of using scale-down R band fluxes to estimate the continuum flux at H-alpha is investigated by comparing the counts in R band with those through an interference filter centred at H-alpha. The scaling factor is found to remain constant over a wide range of colours. The sensitivity of the telescope-filter-CCD combination is estimated to be 2.0 per cent, 8.3 per cent and 9.7 per cent in B, V and R bands, respectively. The star F117 appears to be a small-amplitude (approximately 0.05 mag) variable.

3D MHD simulations of subsurface convection in OB stars

During their main sequence evolution, massive stars can develop convective regions very close to their surface. These regions are caused by an opacity peak associated with iron ionization. Cantiello et al. (2009) found a possible connection between the presence of sub-photospheric convective motions and small scale stochastic velocities in the photosphere of early-type stars. This supports a physical mechanism where microturbulence is caused by waves that are triggered by subsurface convection zones. They further suggest that clumping in the inner parts of the winds of OB stars could be related to subsurface convection, and that the convective layers may also be responsible for stochastic excitation of non-radial pulsations. Furthermore, magnetic fields produced in the iron convection zone could appear at the surface of such massive stars. Therefore subsurface convection could be responsible for the occurrence of observable phenomena such as line profile variability and discrete absorption components. These phenomena have been observed for decades, but still evade a clear theoretical explanation. Here we present preliminary results from 3D MHD simulations of such subsurface convection.

K1-xLaxCa2-xNb3O10, a Layered Perovskite Series with Variable Interlayer Cation Density, and LaCaNb3O10, a Novel Layered Perovskite Oxide with No Interlayer Cations

A series of layered perovskite oxides of the formula K1-xLaxCa2-xNb3O10 for 0 < x ≤ 1.0 have been prepared. All the members are isostructural, possessing the structure of KCa2Nb3O10. The interlayer potassium ions in the new series can be ion-exchanged with protons to give H1-xLaxCa2-xNb3O10. The latter readily forms intercalation compounds of the formula (CnH2n+1NH3)1-x LaxCa2-xNb3O10, just as the parent solid acid HCa2Nb3O10. The end member LaCaNb3O10 containing no interlayer cations is a novel layered perovskite oxide, being a n = 3 member of the series An-1BnX3n+1.

Pulsatile flow of a viscous fluid in elliptical pipe of variable cross-section

The pulsatile flow of an incompressible viscous fluid in an elliptical pipe of slowly varying cross-section is considered. Asymptotic series solutions for the velocity distribution and pressure gradient are obtained in terms of Mathieu functions for a low Reynold number flow in which the volume flux is prescribed. An expression for shear stress on the boundary is derived. The physically significant quantities governing the flow are computed numerically and analysed for different types of constrictions. The effect of eccentricity and Womerslay parameter on the flow is discussed.

Synthesis of Layered Perovskite Oxides, ACa2-xLaxNb3-xTix010 (A = K, Rb, Cs), and Characterization of New Solid Acids, HCa2-xLaxNb3-xTixOlo (0 < x d 2), Exhibiting Variable Bronsted Acidity?

Layered perovskite oxides of the formula ACa~,La,Nb3-,Ti,010 (A = K, Rb, Cs and 0 < x d 2) have been prepared. The members adopt the structures of the parent ACazNb3010. Interlayer alkali cations in the niobium-titanium oxide series can be ion-exchanged with Li+, Na+, NH4+, or H+ to give new derivatives. Intercalation of the protonated derivatives with organic bases reveals that the Bronsted acidity of the solid solution series, HC~ ~ , L ~ ,N~ ~ , T ~ ,dOep~eOnd, s on the titanium content. While the x = 1 member (HCaLaNbzTiOlo) is nearly as acidic as the parent HCazNb3010, the x = 2 member (HLazNbTizOlo) is a weak acid hardly intercalating organic bases with pKa - 11.3. The variation of acidity is probably due to an ordering of Nb/Ti atoms in the triple octahedral perovskite slabs, [Ca~,La,Nb~,Ti,0~0], such that protons are attached to NbO6 octahedra in the x = 1 member and to Ti06 octahedra in the x = 2 member.

Exact-Solutions Of Linear Partial-Differential Equations With Variable-Coefficients

Backlund transformations relating the solutions of linear PDE with variable coefficients to those of PDE with constant coefficients are found, generalizing the study of Varley and Seymour [2]. Auto-Backlund transformations are also determined. To facilitate the generation of new solutions via Backlund transformation, explicit solutions of both classes of the PDE just mentioned are found using invariance properties of these equations and other methods. Some of these solutions are new.

Popular matchings with variable item copies

We consider the problem of matching people to items, where each person ranks a subset of items in an order of preference, possibly involving ties. There are several notions of optimality about how to best match a person to an item; in particular, popularity is a natural and appealing notion of optimality. A matching M* is popular if there is no matching M such that the number of people who prefer M to M* exceeds the number who prefer M* to M. 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 admit popular matchings. This motivates the following extension of the popular matchings problem: Given a graph G = (A U 3, E) where A is the set of people and 2 is the set of items, and a list < c(1),...., c(vertical bar B vertical bar)> denoting upper bounds on the number of copies of each item, does there exist < x(1),...., x(vertical bar B vertical bar)> such that for each i, having x(i) copies of the i-th item, where 1 <= xi <= c(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(i) is 1 or 2. We show a polynomial time algorithm for a variant of the above problem where the total increase in copies is bounded by an integer k. (C) 2011 Elsevier B.V. All rights reserved.

Variable Elimination in Linear Constraints

Gauss and Fourier have together provided us with the essential techniques for symbolic computation with linear arithmetic constraints over the reals and the rationals. These variable elimination techniques for linear constraints have particular significance in the context of constraint logic programming languages that have been developed in recent years. Variable elimination in linear equations (Guassian Elimination) is a fundamental technique in computational linear algebra and is therefore quite familiar to most of us. Elimination in linear inequalities (Fourier Elimination), on the other hand, is intimately related to polyhedral theory and aspects of linear programming that are not quite as familiar. In addition, the high complexity of elimination in inequalities has forces the consideration of intricate specializations of Fourier's original method. The intent of this survey article is to acquaint the reader with these connections and developments. The latter part of the article dwells on the thesis that variable elimination in linear constraints over the reals extends quite naturally to constraints in certain discrete domains.

Identification of Local Conformational Similarity in Structurally Variable Regions of Homologous Proteins Using Protein Blocks

Structure comparison tools can be used to align related protein structures to identify structurally conserved and variable regions and to infer functional and evolutionary relationships. While the conserved regions often superimpose well, the variable regions appear non superimposable. Differences in homologous protein structures are thought to be due to evolutionary plasticity to accommodate diverged sequences during evolution. One of the kinds of differences between 3-D structures of homologous proteins is rigid body displacement. A glaring example is not well superimposed equivalent regions of homologous proteins corresponding to a-helical conformation with different spatial orientations. In a rigid body superimposition, these regions would appear variable although they may contain local similarity. Also, due to high spatial deviation in the variable region, one-to-one correspondence at the residue level cannot be determined accurately. Another kind of difference is conformational variability and the most common example is topologically equivalent loops of two homologues but with different conformations. In the current study, we present a refined view of the ``structurally variable'' regions which may contain local similarity obscured in global alignment of homologous protein structures. As structural alphabet is able to describe local structures of proteins precisely through Protein Blocks approach, conformational similarity has been identified in a substantial number of `variable' regions in a large data set of protein structural alignments; optimal residue-residue equivalences could be achieved on the basis of Protein Blocks which led to improved local alignments. Also, through an example, we have demonstrated how the additional information on local backbone structures through protein blocks can aid in comparative modeling of a loop region. In addition, understanding on sequence-structure relationships can be enhanced through our approach. This has been illustrated through examples where the equivalent regions in homologous protein structures share sequence similarity to varied extent but do not preserve local structure.