Boxicity of Circular Arc Graphs

A k-dimensional box is a Cartesian product R(1)x...xR(k) where each R(i) is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. That is, two vertices are adjacent if and only if their corresponding boxes intersect. A circular arc graph is a graph that can be represented as the intersection graph of arcs on a circle. We show that if G is a circular arc graph which admits a circular arc representation in which no arc has length at least pi(alpha-1/alpha) for some alpha is an element of N(>= 2), then box(G) <= alpha (Here the arcs are considered with respect to a unit circle). From this result we show that if G has maximum degree Delta < [n(alpha-1)/2 alpha] for some alpha is an element of N(>= 2), then box(G) <= alpha. We also demonstrate a graph having box(G) > alpha but with Delta = n (alpha-1)/2 alpha + n/2 alpha(alpha+1) + (alpha+2). For a proper circular arc graph G, we show that if Delta < [n(alpha-1)/alpha] for some alpha is an element of N(>= 2), then box(G) <= alpha. Let r be the cardinality of the minimum overlap set, i.e. the minimum number of arcs passing through any point on the circle, with respect to some circular arc representation of G. We show that for any circular arc graph G, box(G) <= r + 1 and this bound is tight. We show that if G admits a circular arc representation in which no family of k <= 3 arcs covers the circle, then box(G) <= 3 and if G admits a circular arc representation in which no family of k <= 4 arcs covers the circle, then box(G) <= 2. We also show that both these bounds are tight.

Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis

In this article, we consider the single-machine scheduling problem with past-sequence-dependent (p-s-d) setup times and a learning effect. The setup times are proportional to the length of jobs that are already scheduled; i.e. p-s-d setup times. The learning effect reduces the actual processing time of a job because the workers are involved in doing the same job or activity repeatedly. Hence, the processing time of a job depends on its position in the sequence. In this study, we consider the total absolute difference in completion times (TADC) as the objective function. This problem is denoted as 1/LE, (Spsd)/TADC in Kuo and Yang (2007) ('Single Machine Scheduling with Past-sequence-dependent Setup Times and Learning Effects', Information Processing Letters, 102, 22-26). There are two parameters a and b denoting constant learning index and normalising index, respectively. A parametric analysis of b on the 1/LE, (Spsd)/TADC problem for a given value of a is applied in this study. In addition, a computational algorithm is also developed to obtain the number of optimal sequences and the range of b in which each of the sequences is optimal, for a given value of a. We derive two bounds b* for the normalising constant b and a* for the learning index a. We also show that, when a < a* or b > b*, the optimal sequence is obtained by arranging the longest job in the first position and the rest of the jobs in short processing time order.

An Overmodulation Scheme for Vector Controlled Induction Motor Drives

This paper presents an algorithm for control of line side voltage of a voltage source inverter upto six-step mode. This is a modified version of an existing overmodulation algorithm. The modified algorithm maintains proportionality between the reference voltage and the output fundamental voltage, and also reduces the computational effort required for implementation, while resulting in a marginally higher harmonic distortion. An estimation method is proposed for calculation of lower order ripple current. This estimation method is applied to a sensorless vector controlled induction motor drive to improve the performance of the drive during overmodulation.

Support Vector Machine Approach to Downscale Precipitation in Climate Change Scenarios

Concern over changes in global climate has increased in recent years with improvement in understanding of atmospheric dynamics and growth in evidence of climate link to long‐term variability in hydrologic records. Climate impact studies rely on climate change information at fine spatial resolution. Towards this, the past decade has witnessed significant progress in development of downscaling models to cascade the climate information provided by General Circulation Models (GCMs) at coarse spatial resolution to the scale relevant for hydrologic studies. While a plethora of downscaling models have been applied successfully to mid‐latitude regions, a few studies are available on tropical regions where the atmosphere is known to have more complex behavior. In this paper, a support vector machine (SVM) approach is proposed for statistical downscaling to interpret climate change signals provided by GCMs over tropical regions of India. Climate variables affecting spatio‐temporal variation of precipitation at each meteorological sub‐division of India are identified. Following this, cluster analysis is applied on climate data to identify the wet and dry seasons in each year. The data pertaining to climate variables and precipitation of each meteorological sub‐division is then used to develop SVM based downscaling model for each season. Subsequently, the SVM based downscaling model is applied to future climate predictions from the second generation Coupled Global Climate Model (CGCM2) to assess the impact of climate change on hydrological inputs to the meteorological sub‐divisions. The results obtained from the SVM downscaling model are then analyzed to assess the impact of climate change on precipitation over India.

Optimal maintenance policy of a machine subject to failure

Optimal maintenance policies for a machine with degradation in performance with age and subject to failure are derived using optimal control theory. The optimal policies are shown to be, normally, of bang-coast nature, except in the case when probability of machine failure is a function of maintenance. It is also shown, in the deterministic case that a higher depreciation rate tends to reverse this policy to coast-bang. When the probability of failure is a function of maintenance, considerable computational effort is needed to obtain an optimal policy and the resulting policy is not easily implementable. For this case also, an optimal policy in the class of bang-coast policies is derived, using a semi-Markov decision model. A simple procedure for modifying the probability of machine failure with maintenance is employed. The results obtained extend and unify the recent results for this problem along both theoretical and practical lines. Numerical examples are presented to illustrate the results obtained.

Suggested improvements in the performance calculations of single-phase induction motors

a complete and accurate analysis is provided for the solution of single-phase induction motor performance characteristics based on a paper by F.W. Suhr ["SYMMETRICAL COMPONENTS AS APPLIED TO THE SINGLE PHASE INDUCTION MOTOR," Electrical Engineering (AlEE Transactions), volume 64, September 1945, pages 651-66].

Digital Simulation of Field-Oriented Control of Induction Motor

This paper describes the simulation of a control scheme using the principle of field orientation for the control of a voltage source inverter-fed induction motor. The control principle is explained, followed by an algorithm to simulate various components of the system in the digital computer. The dynamic response of the system for the load disturbance and set-point variations have been studied. Also, the results of the simulation showing the behavior of field coordinates for such disturbances are given.

Ground-fault-arc suppression on series-and shunt-compensated lines

An extension of Rizk's analysis to cover any type of switching is presented for calculating the residual current and recovery voltage in a singlephase switched transmission system. Equations for the determination of the current and voltage are shown, and the method has been used for the analysis of a series- and shunt-compensated line.Three possible switching methods for the effective control of the recovery voltage and residual current are discussed: normal switching, switching at the ends of the line and switching of the series capacitors.