Reactive power planning under conditional-value-at-risk assessment using chance-constrained optimisation

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

A Graph Model for DynamicWaveband Switching in WDM Mesh Networks

We investigate the problem of waveband switching (WBS) in a wavelength-division multiplexing (WDM) mesh network with dynamic traffic requests. To solve the WBS problem in a homogeneous dynamic WBS network, where every node is a multi-granular optical cross-connect (MG-OXC), we construct an auxiliary graph. Based on the auxiliary graph, we develop two heuristic on-line WBS algorithms with different grouping policies, namely the wavelength-first WBS algorithm based on the auxiliary graph (WFAUG) and the waveband-first WBS algorithm based on the auxiliary graph (BFAUG). Our results show that the WFAUG algorithm outperforms the BFAUG algorithm.

Directed Test Suite Augmentation

As software evolves, engineers use regression testing to evaluate its fitness for release. Such testing typically begins with existing test cases, and many techniques have been proposed for reusing these cost-effectively. After reusing test cases, however, it is also important to consider code or behavior that has not been exercised by existing test cases and generate new test cases to validate these. This process is known as test suite augmentation. In this paper we present a directed test suite augmentation technique, that utilizes results from reuse of existing test cases together with an incremental concolic testing algorithm to augment test suites so that they are coverage-adequate for a modified program. We present results of an empirical study examining the effectiveness of our approach.

SimSight: A Virtual Machine Based Dynamic Call Graph Generator

One problem with using component-based software development approach is that once software modules are reused over generations of products, they form legacy structures that can be challenging to understand, making validating these systems difficult. Therefore, tools and methodologies that enable engineers to see interactions of these software modules will enhance their ability to make these software systems more dependable. To address this need, we propose SimSight, a framework to capture dynamic call graphs in Simics, a widely adopted commercial full-system simulator. Simics is a software system that simulates complete computer systems. Thus, it performs nearly identical tasks to a real system but at a much lower speed while providing greater execution observability. We have implemented SimSight to generate dynamic call graphs of statically and dynamically linked functions in x86/Linux environment. A case study illustrates how we can use SimSight to identify sources of software errors. We then evaluate its performance using 12 integer programs from SPEC CPU2006 benchmark suite.

Rhodium-Catalyzed Hydroboration: Directed Asymmetric Desymmetrization

Rhodium-catalyzed asymmetric hydroboration in conjunction with directing groups can be used control relative and absolute stereochemistry. Hydroboration has the potential to create new C–C, C–O, and C–N bonds from an intermediate C–B bond with retention of stereochemistry. Desymmetrization resulting in the loss of one or more symmetry elements can give rise to molecular chirality, i.e., the conversion of a prochiral molecule to one that is chiral. Unsaturated amides and esters hold the potential for two-point binding to the rhodium catalyst and have been shown to direct the regiochemistry and impact stereochemistry in asymmetric hydroborations of acyclic β,γ-unsaturated substrates. In the present study, the pendant amide functionality directs the hydroboration cis in the cyclic substrates studied; the corresponding ester substrates do so to a lesser extent. The enantioselectivity is determined by regioselective addition to the re or si site of the rhodium-complexed alkene. The effect of catalyst, ligand and borane on the observed diastereoselectivity and enantioselectivity for a variety of cyclopentenyl ester and amide substrates is discussed.

EMERGENT CONDITIONAL RELATIONS IN A GO/NO-GO PROCEDURE: FIGURE-GROUND AND STIMULUS-POSITION COMPOUND RELATIONS

Past research has demonstrated emergent conditional relations using a go/no-go procedure with pairs of figures displayed side-by-side on a computer screen. The present Study sought to extend applications Of this procedure. In Experiment, 1, we evaluated whether emergent conditional relations Could be demonstrated when two-component stimuli were displayed in figure-ground relationships-abstract figures displayed on backgrounds of different colors. Five normal)), capable adults participated. During training, each two-component stimulus Was presented successively. Responses emitted in the presence of some Stimulus pairs (A1B1, A2B2, A3B3, B1C1, B2C2 and B3C3) were reinforced, whereas responses emitted in the presence of other pairs (A1B2, A1B3, A2B1, A2B3, A3B1, A3B2, B1C2, B1C3, B2C1, B2C3, B3C1 and B3C2) were not. During tests, new configurations (AC and CA) were presented, thus emulating structurally the matching-to-sample tests employed in typical equivalence Studies. All participants showed emergent relations consistent with stimulus equivalence during testing. In Experiment 2, we systematically replicated the procedures with Stimulus compounds consisting Of four figures (A1, A2, C1 and C2) and two locations (left - B1 and right - 132). A,11 6 normally capable adults exhibited emergent stimulus-stimulus relations. Together, these experiments show that the go/no-go procedure is a potentially useful alternative for Studying emergent. conditional relations when matching-to-sample is procedurally cumbersome or impossible to use.

Analyzing the Complexity and Reliability of Switch-Frequency-Reconfigurable Antennas Using Graph Models

This paper addresses the functional reliability and the complexity of reconfigurable antennas using graph models. The correlation between complexity and reliability for any given reconfigurable antenna is defined. Two methods are proposed to reduce failures and improve the reliability of reconfigurable antennas. The failures are caused by the reconfiguration technique or by the surrounding environment. These failure reduction methods proposed are tested and examples are given which verify these methods.

Connections between the Sznajd model with general confidence rules and graph theory

The Sznajd model is a sociophysics model that is used to model opinion propagation and consensus formation in societies. Its main feature is that its rules favor bigger groups of agreeing people. In a previous work, we generalized the bounded confidence rule in order to model biases and prejudices in discrete opinion models. In that work, we applied this modification to the Sznajd model and presented some preliminary results. The present work extends what we did in that paper. We present results linking many of the properties of the mean-field fixed points, with only a few qualitative aspects of the confidence rule (the biases and prejudices modeled), finding an interesting connection with graph theory problems. More precisely, we link the existence of fixed points with the notion of strongly connected graphs and the stability of fixed points with the problem of finding the maximal independent sets of a graph. We state these results and present comparisons between the mean field and simulations in Barabasi-Albert networks, followed by the main mathematical ideas and appendices with the rigorous proofs of our claims and some graph theory concepts, together with examples. We also show that there is no qualitative difference in the mean-field results if we require that a group of size q > 2, instead of a pair, of agreeing agents be formed before they attempt to convince other sites (for the mean field, this would coincide with the q-voter model).

The impact of the Bolsa Escola/Familia conditional cash transfer program on enrollment, dropout rates and grade promotion in Brazil

We examine the impact of Brazil's Bolsa Escola/Familia program on Brazilian children's education outcomes. Bolsa provides cash payments to poor households if their children (ages 6 to 15) are enrolled in school. Using school census data to compare changes in enrollment, dropping out and grade promotion across schools that adopted Bolsa at different times, we estimate that the program has: increased enrollment by about 5.5% (6.5%) in grades 1-4 (grades 5-8); lowered dropout rates by 0.5 (0.4) percentage points in grades 1-4 (grades 5-8); and raised grade promotion rates by 0.9 (0.3) percentage points in grades 1-4 (grades 5-8). About one third of Brazil's children participate in Bolsa, so assuming no spillover effects onto non-participants implies that Bolsa's impacts are three times higher than these estimates. However, simple calculations using enrollment impacts suggest that Bolsa's benefits in terms of increased wages may not exceed its costs. (C) 2011 Elsevier B.V. All rights reserved.

Decision-directed feedback equalisation for QAM signals

Proposed is a symbol-based decision-directed algorithm for blind equalisation of quadrature amplitude modulation (QAM) signals using a decision feedback scheme. Independently of QAM order, it presents: (i) an error equal to zero when the equaliser output coincides with the transmitted signal; (ii) simultaneous recovery of the modulus and phase of the signal; (iii) a misadjustment close to that of the normalised least-mean squares algorithm; (iv) fast convergence; and (v) the avoidance of degenerative solutions. Additionally, its stability is ensured when the step-size is properly chosen.

Directed and elliptic flow of charged particles in Cu plus Cu collisions at root s(NN)=22.4 GeV

This paper reports results for directed flow v(1) and elliptic flow v(2) of charged particles in Cu + Cu collisions at root s(NN) = 22.4 GeV at the Relativistic Heavy Ion Collider. The measurements are for the 0-60% most central collisions, using charged particles observed in the STAR detector. Our measurements extend to 22.4-GeV Cu + Cu collisions the prior observation that v1 is independent of the system size at 62.4 and 200 GeV and also extend the scaling of v(1) with eta/y(beam) to this system. The measured v(2)(p(T)) in Cu + Cu collisions is similar for root s(NN) throughout the range 22.4 to 200 GeV. We also report a comparison with results from transport model (ultrarelativistic quantum molecular dynamics and multiphase transport model) calculations. The model results do not agree quantitatively with the measured v(1)(eta), v(2)(p(T)), and v(2)(eta).

Fuzzy Connectedness Image Segmentation in Graph Cut Formulation: A Linear-Time Algorithm and a Comparative Analysis

A deep theoretical analysis of the graph cut image segmentation framework presented in this paper simultaneously translates into important contributions in several directions. The most important practical contribution of this work is a full theoretical description, and implementation, of a novel powerful segmentation algorithm, GC(max). The output of GC(max) coincides with a version of a segmentation algorithm known as Iterative Relative Fuzzy Connectedness, IRFC. However, GC(max) is considerably faster than the classic IRFC algorithm, which we prove theoretically and show experimentally. Specifically, we prove that, in the worst case scenario, the GC(max) algorithm runs in linear time with respect to the variable M=|C|+|Z|, where |C| is the image scene size and |Z| is the size of the allowable range, Z, of the associated weight/affinity function. For most implementations, Z is identical to the set of allowable image intensity values, and its size can be treated as small with respect to |C|, meaning that O(M)=O(|C|). In such a situation, GC(max) runs in linear time with respect to the image size |C|. We show that the output of GC(max) constitutes a solution of a graph cut energy minimization problem, in which the energy is defined as the a"" (a) norm ayenF (P) ayen(a) of the map F (P) that associates, with every element e from the boundary of an object P, its weight w(e). This formulation brings IRFC algorithms to the realm of the graph cut energy minimizers, with energy functions ayenF (P) ayen (q) for qa[1,a]. Of these, the best known minimization problem is for the energy ayenF (P) ayen(1), which is solved by the classic min-cut/max-flow algorithm, referred to often as the Graph Cut algorithm. We notice that a minimization problem for ayenF (P) ayen (q) , qa[1,a), is identical to that for ayenF (P) ayen(1), when the original weight function w is replaced by w (q) . Thus, any algorithm GC(sum) solving the ayenF (P) ayen(1) minimization problem, solves also one for ayenF (P) ayen (q) with qa[1,a), so just two algorithms, GC(sum) and GC(max), are enough to solve all ayenF (P) ayen (q) -minimization problems. We also show that, for any fixed weight assignment, the solutions of the ayenF (P) ayen (q) -minimization problems converge to a solution of the ayenF (P) ayen(a)-minimization problem (ayenF (P) ayen(a)=lim (q -> a)ayenF (P) ayen (q) is not enough to deduce that). An experimental comparison of the performance of GC(max) and GC(sum) algorithms is included. This concentrates on comparing the actual (as opposed to provable worst scenario) algorithms' running time, as well as the influence of the choice of the seeds on the output.

Algebraic-graph method for identification of islanding in power system grids

In this paper, a new algebraic-graph method for identification of islanding in power system grids is proposed. The proposed method identifies all the possible cases of islanding, due to the loss of a equipment, by means of a factorization of the bus-branch incidence matrix. The main features of this new method include: (i) simple implementation, (ii) high speed, (iii) real-time adaptability, (iv) identification of all islanding cases and (v) identification of the buses that compose each island in case of island formation. The method was successfully tested on large-scale systems such as the reduced south Brazilian system (45 buses/72 branches) and the south-southeast Brazilian system (810 buses/1340 branches). (C) 2011 Elsevier Ltd. All rights reserved.

Changes in tissue perfusion parameters in dogs with severe sepsis/septic shock in response to goal-directed hemodynamic optimization at admission to ICU and the relation to outcome

Objective To evaluate the changes in tissue perfusion parameters in dogs with severe sepsis/septic shock in response to goal-directed hemodynamic optimization in the ICU and their relation to outcome. Design Prospective observational study. Setting ICU of a veterinary university medical center. Animals Thirty dogs with severe sepsis or septic shock caused by pyometra who underwent surgery and were admitted to the ICU. Measurements and Main Results Severe sepsis was defined as the presence of sepsis and sepsis-induced dysfunction of one or more organs. Septic shock was defined as the presence of severe sepsis plus hypotension not reversed with fluid resuscitation. After the presumptive diagnosis of sepsis secondary to pyometra, blood samples were collected and clinical findings were recorded. Volume resuscitation with 0.9% saline solution and antimicrobial therapy were initiated. Following abdominal ultrasonography and confirmation of increased uterine volume, dogs underwent corrective surgery. After surgery, the animals were admitted to the ICU, where resuscitation was guided by the clinical parameters, central venous oxygen saturation (ScvO2), lactate, and base deficit. Between survivors and nonsurvivors it was observed that the ScvO2, lactate, and base deficit on ICU admission were each related independently to death (P = 0.001, P = 0.030, and P < 0.001, respectively). ScvO2 and base deficit were found to be the best discriminators between survivors and nonsurvivors as assessed via receiver operator characteristic curve analysis. Conclusion Our study suggests that ScvO2 and base deficit are useful in predicting the prognosis of dogs with severe sepsis and septic shock; animals with a higher ScvO2 and lower base deficit at admission to the ICU have a lower probability of death.

Aging reduces complexity of heart rate variability assessed by conditional entropy and symbolic analysis

Increasing age is associated with a reduction in overall heart rate variability as well as changes in complexity of physiologic dynamics. The aim of this study was to verify if the alterations in autonomic modulation of heart rate caused by the aging process could be detected by Shannon entropy (SE), conditional entropy (CE) and symbolic analysis (SA). Complexity analysis was carried out in 44 healthy subjects divided into two groups: old (n = 23, 63 +/- A 3 years) and young group (n = 21, 23 +/- A 2). It was analyzed SE, CE [complexity index (CI) and normalized CI (NCI)] and SA (0V, 1V, 2LV and 2ULV patterns) during short heart period series (200 cardiac beats) derived from ECG recordings during 15 min of rest in a supine position. The sequences characterized by three heart periods with no significant variations (0V), and that with two significant unlike variations (2ULV) reflect changes in sympathetic and vagal modulation, respectively. The unpaired t test (or Mann-Whitney rank sum test when appropriate) was used in the statistical analysis. In the aging process, the distributions of patterns (SE) remain similar to young subjects. However, the regularity is significantly different; the patterns are more repetitive in the old group (a decrease of CI and NCI). The amounts of pattern types are different: 0V is increased and 2LV and 2ULV are reduced in the old group. These differences indicate marked change of autonomic regulation. The CE and SA are feasible techniques to detect alteration in autonomic control of heart rate in the old group.