A thermodynamics description of the system with N massive parallel rigid wires

In this work, the behaviour of the system with N massive parallel rigid wires is analysed. The aim is to explore its resemblance to a system of multiple cosmic strings. Assuming that it behaves like a 'gas' of massive rigid wires, we use a thermodynamics approach to describe this system. We obtain a constraint relating the linear mass density of the massive wires, the number of the massive wires in the system and the dispersion velocity of the system. © 1996 IOP Publishing Ltd.

Towards an intelligent graphical interface for linear programming modelling

The increase of computing power of the microcomputers has stimulated the building of direct manipulation interfaces that allow graphical representation of Linear Programming (LP) models. This work discusses the components of such a graphical interface as the basis for a system to assist users in the process of formulating LP problems. In essence, this work proposes a methodology which considers the modelling task as divided into three stages which are specification of the Data Model, the Conceptual Model and the LP Model. The necessity for using Artificial Intelligence techniques in the problem conceptualisation and to help the model formulation task is illustrated.

Amplitude ratios and the approach to bulk criticality in parallel plate geometries

We present analytical and numerical results for the specific heat and susceptibility amplitude ratios in parallel plate geometries. The results are derived using field-theoretic techniques suitable to describe the system in the bulk limit, i.e., (L/ξ±)≫ 1, where L is the distance between the plates and ξ± is the correlation length above (+) and below (-) the bulk critical temperature. Advantages and drawbacks of our method are discussed in the light of other approaches previously reported in the literature.

Optimality conditions for pareto nonsmooth nonconvex programming in banach spaces

In this paper, we consider a vector optimization problem where all functions involved are defined on Banach spaces. We obtain necessary and sufficient criteria for optimality in the form of Karush-Kuhn-Tucker conditions. We also introduce a nonsmooth dual problem and provide duality theorems.

Design of microirrigation systems in sloping lands using linear programming

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

VAr planning using genetic algorithm and linear programming

A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating subproblem, which is a nonlinear, ill-conditioned and nonconvex problem, consists of determining the voltage control and the adjustment of reactive sources. The planning subproblem consists of obtaining the optimal reactive source expansion considering operational, economical and physical characteristics of the system. SLP solves the optimal reactive dispatch problem related to real variables, while SGA is used to determine the necessary adjustments of both the binary and discrete variables existing in the modelling problem. Once the set of candidate busbars has been defined, the program implemented gives the location and size of the reactive sources needed, if any, to maintain the operating and security constraints.

On the solution of mathematical programming problems with equilibrium constraints

Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. We prove that, under reasonable sufficient conditions, stationary points of the sum of squares of the constraints are feasible points of the MPEC. In usual formulations of MPEC all the feasible points are nonregular in the sense that they do not satisfy the Mangasarian-Fromovitz constraint qualification of nonlinear programming. Therefore, all the feasible points satisfy the classical Fritz-John necessary optimality conditions. In principle, this can cause serious difficulties for nonlinear programming algorithms applied to MPEC. However, we show that most feasible points do not satisfy a recently introduced stronger optimality condition for nonlinear programming. This is the reason why, in general, nonlinear programming algorithms are successful when applied to MPEC.

Dynamic programming approach for road centerline extraction from digital images

This paper presents a dynamic programming approach for semi-automated road extraction from medium-and high-resolution images. This method is a modified version of a pre-existing dynamic programming method for road extraction from low-resolution images. The basic assumption of this pre-existing method is that roads manifest as lines in low-resolution images (pixel footprint> 2 m) and as such can be modeled and extracted as linear features. On the other hand, roads manifest as ribbon features in medium- and high-resolution images (pixel footprint ≤ 2 m) and, as a result, the focus of road extraction becomes the road centerlines. The original method can not accurately extract road centerlines from medium- and high- resolution images. In view of this, we propose a modification of the merit function of the original approach, which is carried out by a constraint function embedding road edge properties. Experimental results demonstrated the modified algorithm's potential in extracting road centerlines from medium- and high-resolution images.

On the specific filtration mechanism of a mesoporous silica membrane, prepared with non-connecting parallel pores

We report the singular filtration properties of an ultrafiltration membrane made with mesoporous silica that exhibits cylindrical pores aligned mostly normal to the support. This membrane supported on tubular commercial macroporous alumina supports was prepared by the interfacial growth mechanism between stable silica-surfactant hybrid micelles made of the association of silica oligomers with polyethyleneoxide-based (PEO) surfactants and sodium fluoride, a well-known silica condensation catalyst [Boissière et al., An ultrafiltration membrane made with mesoporous MSU-X silica, Chem. Mater. 15 (2003) 460-463]. It appears that the combined effect of the silica nature of the membrane, whose surface charge can be easily adjusted by changing the pH and the non-connected cylindrical shape of the pores provides a new behavior in the retention properties, as proved by the filtration of polyoxyethylene polymers (PEO) with different molecular weights. Depending on the filtration conditions, a rejection rate of 80% and a steep cut-off at 2000 Da can be obtained or, on the reverse, polymers three times bigger than the pore diameter can diffuse through the membrane. This new filtration mechanism, which opens up new modes of separation modes, is explained in the light of both topology of the porous network and pH-dependent interactions between PEO polymers and silica porous media. © 2004 Elsevier B.V. All rights reserved.

Eigenvalue analyses of two parallel lines using a single real transformation matrix

For a typical non-symmetrical system with two parallel three phase transmission lines, modal transformation is applied using some examples of single real transformation matrices. These examples are applied searching an adequate single real transformation matrix to two parallel three phase transmission line systems. The analyses are started with the eigenvector and eigenvalue studies, using Clarke's transformation or linear combinations of Clarke's elements. The Z C and parameters are analyzed for the case that presents the smallest errors between the exact eigenvalues and the single real transformation matrix application results. The single real transformation determined for this case is based on Clarke's matrix and its main characteristic is the use of a unique homopolar reference. So, the homopolar mode becomes a connector mode between the two three-phase circuits of the analyzed system. ©2005 IEEE.

Programmable PFC based hybrid multipulse power rectifier for utility interface of power electronic converters

In this paper it is proposed a novel hybrid three-phase rectifier capable to achieve high input power factor (PF), and low total harmonic distortion in the input currents (THDI). The proposed hybrid high power rectifier is composed by a standard three-phase 6-pulses diode rectifier (Graetz bridge) with a parallel connection of single-phase Boost rectifiers in each three-phase rectifier leg. Such topology results in a structure capable of programming the input current waveform and providing conditions for obtaining high input power factor and low harmonic current distortion. In order to validate the proposed hybrid rectifier, this paper describes its principles of operation, with detailed experimental results and discussions on power rating of the required Boost converters as related to the desired total harmonic current distortion. It is demonstrated that only a fraction of the output power is processed through the Boost converters, making the proposed solution economically viable for very high power installations, with fast pay back of the investment. Moreover, retrofitting to existing installations is also feasible since the parallel path can be easily controlled by integration with the existing de-link. A prototype rated at 6 kW has been implemented in laboratory and fully demonstrated its operation, performance and feasibility to high power applications. © 2005 IEEE.

Optimized dynamic response of parallel operation of two single phase inverters based on evolutionary theory

In this work it is proposed an optimized dynamic response of parallel operation of two single-phase inverters with no control communication. The optimization aims the tuning of the slopes of P-ω and Q-V curves so that the system is stable, damped and minimum settling time. The slopes are tuned using an algorithm based on evolutionary theory. Simulation and experimental results are presented to prove the feasibility of the proposed approach. © 2010 IEEE.

A multi-objective programming approach for the optimal operation of distributed generation considering uncertainty

Due to the renewed interest in distributed generation (DG), the number of DG units incorporated in distribution systems has been rapidly increasing in the past few years. This situation requires new analysis tools for understanding system performance, and taking advantage of the potential benefits of DG. This paper presents an evolutionary multi-objective programming approach to determine the optimal operation of DG in distribution systems. The objectives are the minimization of the system power losses and operation cost of the DG units. The proposed approach also considers the inherent stochasticity of DG technologies powered by renewable resources. Some tests were carried out on the IEEE 34 bus distribution test system showing the robustness and applicability of the proposed methodology. © 2011 IEEE.

LUTS: A lightweight user-level transaction scheduler

Software Transactional Memory (STM) systems have poor performance under high contention scenarios. Since many transactions compete for the same data, most of them are aborted, wasting processor runtime. Contention management policies are typically used to avoid that, but they are passive approaches as they wait for an abort to happen so they can take action. More proactive approaches have emerged, trying to predict when a transaction is likely to abort so its execution can be delayed. Such techniques are limited, as they do not replace the doomed transaction by another or, when they do, they rely on the operating system for that, having little or no control on which transaction should run. In this paper we propose LUTS, a Lightweight User-Level Transaction Scheduler, which is based on an execution context record mechanism. Unlike other techniques, LUTS provides the means for selecting another transaction to run in parallel, thus improving system throughput. Moreover, it avoids most of the issues caused by pseudo parallelism, as it only launches as many system-level threads as the number of available processor cores. We discuss LUTS design and present three conflict-avoidance heuristics built around LUTS scheduling capabilities. Experimental results, conducted with STMBench7 and STAMP benchmark suites, show LUTS efficiency when running high contention applications and how conflict-avoidance heuristics can improve STM performance even more. In fact, our transaction scheduling techniques are capable of improving program performance even in overloaded scenarios. © 2011 Springer-Verlag.