An approach of optimal sensitivity applied in the tertiary loop of the automatic generation control

This paper proposes an approach of optimal sensitivity applied in the tertiary loop of the automatic generation control. The approach is based on the theorem of non-linear perturbation. From an optimal operation point obtained by an optimal power flow a new optimal operation point is directly determined after a perturbation, i.e., without the necessity of an iterative process. This new optimal operation point satisfies the constraints of the problem for small perturbation in the loads. The participation factors and the voltage set point of the automatic voltage regulators (AVR) of the generators are determined by the technique of optimal sensitivity, considering the effects of the active power losses minimization and the network constraints. The participation factors and voltage set point of the generators are supplied directly to a computational program of dynamic simulation of the automatic generation control, named by power sensitivity mode. Test results are presented to show the good performance of this approach. (C) 2008 Elsevier B.V. All rights reserved.

Transmission loss allocation based on optimal power flow and sensitivity analysis

This paper presents a new approach to the transmission loss allocation problem in a deregulated system. This approach belongs to the set of incremental methods. It treats all the constraints of the network, i.e. control, state and functional constraints. The approach is based on the perturbation of optimum theorem. From a given optimal operating point obtained by the optimal power flow the loads are perturbed and a new optimal operating point that satisfies the constraints is determined by the sensibility analysis. This solution is used to obtain the allocation coefficients of the losses for the generators and loads of the network. Numerical results show the proposed approach in comparison to other methods obtained with well-known transmission networks, IEEE 14-bus. Other test emphasizes the importance of considering the operational constraints of the network. And finally the approach is applied to an actual Brazilian equivalent network composed of 787 buses, and it is compared with the technique used nowadays by the Brazilian Control Center. (c) 2007 Elsevier Ltd. All rights reserved.

A STUDY OF PENALTY FORMULATIONS USED IN THE NUMERICAL APPROXIMATION OF A RADIALLY SYMMETRIC ELASTICITY PROBLEM

We consider a class of two-dimensional problems in classical linear elasticity for which material overlapping occurs in the absence of singularities. Of course, material overlapping is not physically realistic, and one possible way to prevent it uses a constrained minimization theory. In this theory, a minimization problem consists of minimizing the total potential energy of a linear elastic body subject to the constraint that the deformation field must be locally invertible. Here, we use an interior and an exterior penalty formulation of the minimization problem together with both a standard finite element method and classical nonlinear programming techniques to compute the minimizers. We compare both formulations by solving a plane problem numerically in the context of the constrained minimization theory. The problem has a closed-form solution, which is used to validate the numerical results. This solution is regular everywhere, including the boundary. In particular, we show numerical results which indicate that, for a fixed finite element mesh, the sequences of numerical solutions obtained with both the interior and the exterior penalty formulations converge to the same limit function as the penalization is enforced. This limit function yields an approximate deformation field to the plane problem that is locally invertible at all points in the domain. As the mesh is refined, this field converges to the exact solution of the plane problem.

The random barrier-crossing problem

This paper addresses the time-variant reliability analysis of structures with random resistance or random system parameters. It deals with the problem of a random load process crossing a random barrier level. The implications of approximating the arrival rate of the first overload by an ensemble-crossing rate are studied. The error involved in this so-called ""ensemble-crossing rate"" approximation is described in terms of load process and barrier distribution parameters, and in terms of the number of load cycles. Existing results are reviewed, and significant improvements involving load process bandwidth, mean-crossing frequency and time are presented. The paper shows that the ensemble-crossing rate approximation can be accurate enough for problems where load process variance is large in comparison to barrier variance, but especially when the number of load cycles is small. This includes important practical applications like random vibration due to impact loadings and earthquake loading. Two application examples are presented, one involving earthquake loading and one involving a frame structure subject to wind and snow loadings. (C) 2007 Elsevier Ltd. All rights reserved.

Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have to be scheduled without knowledge of what jobs will come afterwards. The processing times and the due dates become known when the order is placed. The order release date occurs only at the beginning of periodic intervals. A customized approximate dynamic programming method is introduced for this problem. The authors also present numerical experiments that assess the reliability of the new approach and show that it performs better than a myopic policy.

Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil

In this paper, we consider a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries that occurs in a major Brazilian retail group. A single depot attends 519 stores of the group distributed in 11 Brazilian states. To find good solutions to this problem, we propose heuristics as initial solutions and a scatter search (SS) approach. Next, the produced solutions are compared with the routes actually covered by the company. Our results show that the total distribution cost can be reduced significantly when such methods are used. Experimental testing with benchmark instances is used to assess the merit of our proposed procedure. (C) 2008 Published by Elsevier B.V.

A Separation Principle for the Continuous-Time LQ-Problem With Markovian Jump Parameters

In this paper, we devise a separation principle for the finite horizon quadratic optimal control problem of continuous-time Markovian jump linear systems driven by a Wiener process and with partial observations. We assume that the output variable and the jump parameters are available to the controller. It is desired to design a dynamic Markovian jump controller such that the closed loop system minimizes the quadratic functional cost of the system over a finite horizon period of time. As in the case with no jumps, we show that an optimal controller can be obtained from two coupled Riccati differential equations, one associated to the optimal control problem when the state variable is available, and the other one associated to the optimal filtering problem. This is a separation principle for the finite horizon quadratic optimal control problem for continuous-time Markovian jump linear systems. For the case in which the matrices are all time-invariant we analyze the asymptotic behavior of the solution of the derived interconnected Riccati differential equations to the solution of the associated set of coupled algebraic Riccati equations as well as the mean square stabilizing property of this limiting solution. When there is only one mode of operation our results coincide with the traditional ones for the LQG control of continuous-time linear systems.

On the Filtering Problem for Continuous-Time Markov Jump Linear Systems with no Observation of the Markov Chain

We consider in this paper the optimal stationary dynamic linear filtering problem for continuous-time linear systems subject to Markovian jumps in the parameters (LSMJP) and additive noise (Wiener process). It is assumed that only an output of the system is available and therefore the values of the jump parameter are not accessible. It is a well known fact that in this setting the optimal nonlinear filter is infinite dimensional, which makes the linear filtering a natural numerically, treatable choice. The goal is to design a dynamic linear filter such that the closed loop system is mean square stable and minimizes the stationary expected value of the mean square estimation error. It is shown that an explicit analytical solution to this optimal filtering problem is obtained from the stationary solution associated to a certain Riccati equation. It is also shown that the problem can be formulated using a linear matrix inequalities (LMI) approach, which can be extended to consider convex polytopic uncertainties on the parameters of the possible modes of operation of the system and on the transition rate matrix of the Markov process. As far as the authors are aware of this is the first time that this stationary filtering problem (exact and robust versions) for LSMJP with no knowledge of the Markov jump parameters is considered in the literature. Finally, we illustrate the results with an example.

New simple and efficient heuristics for the uncapacitated single allocation hub location problem

Hub-and-spoke networks are widely studied in the area of location theory. They arise in several contexts, including passenger airlines, postal and parcel delivery, and computer and telecommunication networks. Hub location problems usually involve three simultaneous decisions to be made: the optimal number of hub nodes, their locations and the allocation of the non-hub nodes to the hubs. In the uncapacitated single allocation hub location problem (USAHLP) hub nodes have no capacity constraints and non-hub nodes must be assigned to only one hub. In this paper, we propose three variants of a simple and efficient multi-start tabu search heuristic as well as a two-stage integrated tabu search heuristic to solve this problem. With multi-start heuristics, several different initial solutions are constructed and then improved by tabu search, while in the two-stage integrated heuristic tabu search is applied to improve both the locational and allocational part of the problem. Computational experiments using typical benchmark problems (Civil Aeronautics Board (CAB) and Australian Post (AP) data sets) as well as new and modified instances show that our approaches consistently return the optimal or best-known results in very short CPU times, thus allowing the possibility of efficiently solving larger instances of the USAHLP than those found in the literature. We also report the integer optimal solutions for all 80 CAB data set instances and the 12 AP instances up to 100 nodes, as well as for the corresponding new generated AP instances with reduced fixed costs. Published by Elsevier Ltd.

The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

QUADRANT-SEARCHING: A NEW TECHNIQUE TO REDUCE THE SEARCH SPACE OF THE INVERSE PROBLEM OF EIT USING BEM TO THE DIRECT PROBLEM

The image reconstruction using the EIT (Electrical Impedance Tomography) technique is a nonlinear and ill-posed inverse problem which demands a powerful direct or iterative method. A typical approach for solving the problem is to minimize an error functional using an iterative method. In this case, an initial solution close enough to the global minimum is mandatory to ensure the convergence to the correct minimum in an appropriate time interval. The aim of this paper is to present a new, simple and low cost technique (quadrant-searching) to reduce the search space and consequently to obtain an initial solution of the inverse problem of EIT. This technique calculates the error functional for four different contrast distributions placing a large prospective inclusion in the four quadrants of the domain. Comparing the four values of the error functional it is possible to get conclusions about the internal electric contrast. For this purpose, initially we performed tests to assess the accuracy of the BEM (Boundary Element Method) when applied to the direct problem of the EIT and to verify the behavior of error functional surface in the search space. Finally, numerical tests have been performed to verify the new technique.

Reprocessing and reuse of single-use medical devices used during hemodynamic procedures in Brazil: A widespread and largely overlooked problem

Background. Several medical devices used during hemodynamic procedures, particularly angiographic diagnostic and therapeutic cardiac catheters, are manufactured for single use only. However, reprocessing and reuse of these devices has been reported, to determine the frequency of reuse and reprocessing of single-use medical devices used during hemodynamic procedures in Brazil and to evaluate how reprocessing is performed. Design. National survey, conducted from December 1999 to July 2001. Methods. Most of the institutions affiliated with the Brazilian Society of Hemodynamic and Interventional Cardiology were surveyed by use of a questionnaire sent in the mail. Results. The questionnaire response rate was 50% (119 of 240 institutions). Of the 119 institutions that responded, 116 (97%) reported reuse of single-use devices used during hemodynamic procedures, and only 26 (22%) reported use of a standardized reprocessing protocol. Cleaning, flushing, rinsing, drying, sterilizing and packaging methods varied greatly and were mostly inadequate. Criteria for discarding reused devices varied widely. Of the 119 institutions that responded, 80 (67%) reported having a surveillance system for adverse events associated with the reuse of medical devices, although most of these institutions did not routinely review the data, and only 38 (32%) described a training program for the personnel who reprocessed single-use devices. Conclusions. The reuse of single-use devices used during hemodynamic procedures was very frequent in hospitals in Brazil. Basic guidance on how to reuse and reprocess single-use medical devices is urgently needed, because, despite the lack of studies to support reusing and reprocessing single-use medical devices, such devices are necessary in limited-resource areas in which these practices are current.

Rehabilitation of executive dysfunction: A controlled trial of an attention and problem solving treatment group

In this study, the effectiveness of a group-based attention and problem solving (APS) treatment approach to executive impairments in patients with frontal lobe lesions was investigated. Thirty participants with lesions in the frontal lobes, 16 with left frontal (LF) and 14 with right frontal (RF) lesions, were allocated into three groups, each with 10 participants. The APS treatment was initially compared to two other control conditions, an information/education (IE) approach and treatment-as-usual or traditional rehabilitation (TR), with each of the control groups subsequently receiving the APS intervention in a crossover design. This design allowed for an evaluation of the treatment through assessment before and after treatment and on follow up, six months later. There was an improvement on some executive and functional measures after the implementation of the APS programme in the three groups. Size, and to a lesser extent laterality, of lesion affected baseline performance on measures of executive function, but there was no apparent relationship between size, laterality or site of lesion and level of benefit from the treatment intervention. The results were discussed in terms of models of executive functioning and the effectiveness of domain specific interventions in the rehabilitation of executive dysfunction.

Pruritus in hemodialysis patients: The problem remains

Pruritus is still one of the most common and disturbing symptoms of end-stage renal disease. The objective of this study is to analyze the prevalence of pruritus in hemodialysis patients and the possible factors implicated in its genesis. In a cross-sectional study, 101 patients on hemodialysis at our center were screened for pruritus. The relationship of various factors with pruritus was evaluated. Of the 101 patients included, 31(30.7%) had pruritus at the time of examination. Patients with pruritus were significantly older than those without pruritus (P=0.0027). Pruritus tended to be more prevalent in patients undergoing dialysis 3 times a week than in those undergoing daily dialysis, but the difference did not reach statistical significance (P=0.0854). Lower transferrin saturation levels were found in patients with pruritus than in those without pruritus (P=0.0144). C-reactive protein levels were significantly higher in patients with pruritus than in those without pruritus (P=0.0013). There was no significant difference between the groups in the levels of the other inflammatory biomarkers measured. However, there was a tendency toward a correlation between the levels of alpha-1-glycoprotein and the intensity of pruritus (P=0.0834). Our results suggest a possible relationship of the inflammatory response upregulation to pruritus. Additionally, there was a positive relationship between pruritus and iron deficiency, possibly associated with inflammatory elevation of hepcidin. A better understanding of the factors implicated in the genesis of pruritus related to end-stage renal disease is crucial in the development of more effective treatments for this symptom.

ROOT PROBLEM FOR CONVENIENT MAPS

In this paper we study when the minimal number of roots of the so-called convenient maps horn two-dimensional CW complexes into closed surfaces is zero We present several necessary and sufficient conditions for such a map to be root free Among these conditions we have the existence of specific fittings for the homomorphism induced by the map on the fundamental groups, existence of the so-called mutation of a specific homomorphism also induced by the map, and existence of particular solutions of specific systems of equations on free groups over specific subgroups