Study of alternative schemes for the parameterization step of the continuation power flow method based on physical parameters, part I: Mathematical modeling

The conventional power flow method is considered to be inadequate to obtain the maximum loading point because of the singularity of Jacobian matrix. Continuation methods are efficient tools for solving this kind of problem since different parameterization schemes can be used to avoid such ill-conditioning problems. This paper presents the details of new schemes for the parameterization step of the continuation power flow method. The new parameterization options are based on physical parameters, namely, the total power losses (real and reactive), the power at the slack bus (real or reactive), the reactive power at generation buses, and transmission line power losses (real and reactive). The simulation results obtained with the new approach for the IEEE test systems (14, 30, 57, and 118 buses) are presented and discussed in the companion paper. The results show that the characteristics of the conventional method are not only preserved but also improved.

Study of alternative schemes for the parameterization step of the continuation power flow method based on physical parameters, part II: Performance evaluation

New parameterization schemes have been proposed by the authors in Part I of this paper. In this part these new options for the parameterization of power flow equations are tested, namely, the total power losses (real and reactive), the power at the slack bus (real or reactive), the reactive power at generation buses, and the transmission line power losses (real and reactive). These different parameterization schemes can be used to obtain the maximum loading point without ill-conditioning problems, once the singularity of Jacobian matrix is avoided. The results obtained with the new approach for the IEEE test systems (14, 30, 57, and 118 buses) show that the characteristics of the conventional method are not only preserved but also improved. In addition, it is shown that the proposed method and the conventional one can be switched during the tracing of PV curves to determine, with few iterations, all points of the PV curve. Several tests were also carried out to compare the performance of the proposed parameterization schemes for the continuation power flow method with the use of both the secant and tangent predictors.

Settling analysis of MOS regulated current mirrors applied to micropower D/A converters

This paper provides an insight to the trade-off between settling time and power consumption in regulated current mirrors as building parts in micropower current-switching D/A converters. The regulation-loop frequency characteristic is obtained and difficulties to impose a dominant-pole condition to the resulting 2nd-order system are evaluated. Raising pole frequencies in micropower circuits, while meeting consumption requirements, is basically limited by parasitic capacitances. For such cases, an alternative is to impose a twin-pole condition in which design constraints are somewhat relieved and settling slightly improved. Relationships between pole frequencies, transistor geometry and bias are established and design guidelines for regulated current mirrors founded. By placing loop-transistors in either weak or strong inversion, small (W/L) ratios are allowed and stray capacitances reduced. Simulated waveforms suggest a good agreement with theory. The proposed approach applied to the design of a micropower current-mode D/A converter improves both simulated and experimental settling performance.

Aggregation in the generalized transportation problem

Aggregation disaggregation is used to reduce the analysis of a large generalized transportation problem to a smaller one. Bounds for the actual difference between the aggregated objective and the original optimal value are used to quantify the error due to aggregation and estimate the quality of the aggregation. The bounds can be calculated either before optimization of the aggregated problem (a priori) or after (a posteriori). Both types of the bounds are derived and numerically compared. A computational experiment was designed to (a) study the correlation between the bounds and the actual error and (b) quantify the difference of the error bounds from the actual error. The experiment shows a significant correlation between some a priori bounds, the a posteriori bounds and the actual error. These preliminary results indicate that calculating the a priori error bound is a useful strategy to select the appropriate aggregation level, since the a priori bound varies in the same way that the actual error does. After the aggregated problem has been selected and optimized, the a posteriori bound provides a good quantitative measure for the error due to aggregation.

A low-voltage wide-swing programmable-gain current amplifier

A CMOS low-voltage, wide-swing continuous-time current amplifier is presented. Exhibiting an open-loop architecture, the circuit is composed of transresistance and transconductance stages built upon triode-operating transistors. In addition to an extended dynamic range, the current gain can be programmed within good accuracy by a rapport involving only transistor geometries and tuning biases. Low temperature-drift on gain setting is then expected.In accordance with a 0.35 mum n-well CMOS fabrication process and a single 1.1 V-supply, a balanced current-amplifier is designed for a programmable gain-range of 6 - 34 dB and optimized with respect to dynamic range. Simulated results from PSPICE and Bsim3v3 models indicate, for a 100 muA(pp)-output current, a THD of 0.96 and 1.87% at 1 KHz and 100 KHz, respectively. Input noise is 120 pArootHz @ 10 Hz, with S/N = 63.2 dB @ 1%-THD. At maximum gain, total quiescent consumption is 334 muW. Measurements from a prototyped amplifier reveal a gain-interval of 4.8-33.1 dB and a maximum current swing of 120 muA(pp). The current-amplifier bandwidth is above 1 MHz.

Aggregation-based decomposition for multi-divisional models

The aggregation theory of mathematical programming is used to study decentralization in convex programming models. A two-level organization is considered and a aggregation-disaggregation scheme is applied to such a divisionally organized enterprise. In contrast to the known aggregation techniques, where the decision variables/production planes are aggregated, it is proposed to aggregate resources allocated by the central planning department among the divisions. This approach results in a decomposition procedure, in which the central unit has no optimization problem to solve and should only average local information provided by the divisions.

Band-edge states of the zero(th)-order gap in quasi-periodic photonic superlattices

The photonic modes of Thue-Morse and Fibonacci lattices with generating layers A and B, of positive and negative indices of refraction, are calculated by the transfer-matrix technique. For Thue-Morse lattices, as well for periodic lattices with AB unit cell, the constructive interference of reflected waves, corresponding to the zero(th)-order gap, takes place when the optical paths in single layers A and B are commensurate. In contrast, for Fibonacci lattices of high order, the same phenomenon occurs when the ratio of those optical paths is close to the golden ratio. In the long wavelength limit, analytical expressions defining the edge frequencies of the zero(th) order gap are obtained for both quasi-periodic lattices. Furthermore, analytical expressions that define the gap edges around the zero(th) order gap are shown to correspond to the = 0 and = 0 conditions.

Studying properties of Lagrangian bounds for many-to-many assignment problems

Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are studied. For the class of many-to-many assignment problems, this property of constraints is used to design a subgradient algorithm for solving the modified dual problem. Numerical results are presented to compare the quality of classical and modified bounds, as well as the properties of the corresponding Lagrangian solutions.

An extended Weyl-Wigner transformation for special finite spaces

We extend the Weyl-Wigner transformation to those particular degrees of freedom described by a finite number of states using a technique of constructing operator bases developed by Schwinger. Discrete transformation kernels are presented instead of continuous coordinate-momentum pair system and systems such as the one-dimensional canonical continuous coordinate-momentum pair system and the two-dimensional rotation system are described by special limits. Expressions are explicitly given for the spin one-half case. © 1988.

An evaluation of the productivity of mischocyttarus drewseni in a semi-urban environment (Hymenoptera: Polistinae)

The biology and productivity of Myschocytarus drewseni were studied in semi urban conditions at Rio Claro, S P - Brazil. We observed 51 nest foundations, of which 24 (47%) were destroyed or predated, 13 (25.5 %) were abandoned and 14 (27.5%) completed the cycle. The life-span of colonies ranged from 44-427 days with a mean of 216.7 ± 140.6 days, producing 8-390 cells with a mean of 125.7 ± 137.9 cells, and 2-303 adults with a mean of 89.4 ± 110.36 adults. We observed a maximum of 3 utilizations/cell. This showed that the species presents asynchronous foundation and abandoningoccurs throughout the year. Also, the chance of a colony utilizing the same cells two or three times for adult production is highly dependent on the colony size/age, and the relation between them is positive, meaning that there is a greater chance of cell re-utilization in larger/older colonies.

Radial basis function network applied to the linearization of a voltage controlled oscillator

An analog circuit that implements a radial basis function network is presented. The proposed circuit allows the adjustment of all shape parameters of the radial functions, i.e., amplitude, center and width. The implemented network was applied to the linearization of a nonlinear circuit, a voltage controlled oscillator (VCO). This application can be classified as an open-loop control in which the network plays the role of the controller. Experimental results have proved the linearization capability of the proposed circuit. Its performance can be improved by using a network with more basis functions. Copyright 2007 ACM.

Corona effect in frequency dependent transmission line models

The inclusion of the corona effect in a frequency dependent transmission line model is proposed in this paper. The transmission line is represented through a cascade of π circuits and the frequency dependence of the longitudinal parameters is synthesized with series and parallel resistors and inductors. The corona effect will be represented using the Gary and Skilling-Umoto models. The currents and voltages along the line are calculated by using state-space technique. To demonstrate the accuracy and validity of the proposed frequency dependent line model, time domain simulations of a 10 km length single-phase line response under energization procedure will be presented. ©2008 IEEE.

Pattern recognition structured heuristics methods for image processing in mobile robot navigation

In this project, the main focus is to apply image processing techniques in computer vision through an omnidirectional vision system to agricultural mobile robots (AMR) used for trajectory navigation problems, as well as localization matters. To carry through this task, computational methods based on the JSEG algorithm were used to provide the classification and the characterization of such problems, together with Artificial Neural Networks (ANN) for pattern recognition. Therefore, it was possible to run simulations and carry out analyses of the performance of JSEG image segmentation technique through Matlab/Octave platforms, along with the application of customized Back-propagation algorithm and statistical methods as structured heuristics methods in a Simulink environment. Having the aforementioned procedures been done, it was practicable to classify and also characterize the HSV space color segments, not to mention allow the recognition of patterns in which reasonably accurate results were obtained. ©2010 IEEE.

Automatic segmentation of latent fingerprints

Latent fingerprints are routinely found at crime scenes due to the inadvertent contact of the criminals' finger tips with various objects. As such, they have been used as crucial evidence for identifying and convicting criminals by law enforcement agencies. However, compared to plain and rolled prints, latent fingerprints usually have poor quality of ridge impressions with small fingerprint area, and contain large overlap between the foreground area (friction ridge pattern) and structured or random noise in the background. Accordingly, latent fingerprint segmentation is a difficult problem. In this paper, we propose a latent fingerprint segmentation algorithm whose goal is to separate the fingerprint region (region of interest) from background. Our algorithm utilizes both ridge orientation and frequency features. The orientation tensor is used to obtain the symmetric patterns of fingerprint ridge orientation, and local Fourier analysis method is used to estimate the local ridge frequency of the latent fingerprint. Candidate fingerprint (foreground) regions are obtained for each feature type; an intersection of regions from orientation and frequency features localizes the true latent fingerprint regions. To verify the viability of the proposed segmentation algorithm, we evaluated the segmentation results in two aspects: a comparison with the ground truth foreground and matching performance based on segmented region. © 2012 IEEE.

TAO - A software platform for autonomous mobile robots

To date, different techniques of navigation for mobile robots have been developed. However, the experimentation of these techniques is not a trivial task because usually it is not possible to reuse the developed control software due to system incompabilities. This paper proposes a software platform that provides means for creating reusable software modules through the standardization of software interfaces, which represent the various robot modules. © 2012 ICROS.