Mixed-integer convex model for VAr expansion planning

This paper presents a mixed-integer convex-optimization-based approach for optimum investment reactive power sources in transmission systems. Unlike some convex-optimization techniques for the reactive power planning solution, in the proposed approach the taps settings of under-load tap-changing of transformers are modeled as a mixed-integer linear set equations. Are also considered the continuous and discrete variables for the existing and new capacitive and reactive power sources. The problem is solved for three significant demand scenarios (low demand, average demand and peak demand). Numerical results are presented for the CIGRE-32 electric power system.

Yang-Lee zeros of the two- and three-state Potts model defined on π3 Feynman diagrams

We present both analytical and numerical results on the position of partition function zeros on the complex magnetic field plane of the q=2 state (Ising) and the q=3 state Potts model defined on phi(3) Feynman diagrams (thin random graphs). Our analytic results are based on the ideas of destructive interference of coexisting phases and low temperature expansions. For the case of the Ising model, an argument based on a symmetry of the saddle point equations leads us to a nonperturbative proof that the Yang-Lee zeros are located on the unit circle, although no circle theorem is known in this case of random graphs. For the q=3 state Potts model, our perturbative results indicate that the Yang-Lee zeros lie outside the unit circle. Both analytic results are confirmed by finite lattice numerical calculations.

Ordered phases in the extended Hubbard model

A novel method to probe the diverse phases for the extended Hubbard model (EHM), including the correlated hopping term, is presented. We extend an effective medium approach [1] to a bipartite lattice, allowing for charge- and/or spin-ordered phases. We calculate the necessary correlation functions to build the EHM phase diagram.

Aeroelastic behavior of a wing with a magnetorheological hysteretic model to the damping

This paper shows the application of a hysteretic model for the Magnetorheological Damper (MRD) placed in the plunge degree-of-freedom of aeroelastic model of a wing. This hysteretic MRD model was developed by the researchers of the French Aerospace Lab. (ONERA) and describe, with a very good precision, the hysteretic behavior of the MRD. The aeroelastic model used in this paper do not have structural nonlinearities, the only nonlinearities showed in the model, are in the unsteady flow equations and are the same proposed by Theodorsen and Wagner in their unsteady aerodynamics theory; and the nonlinearity introduced by the hysteretic model used. The main objective of this paper is show the mathematical modeling of the problem and the equations that describes the aeroelastic response of our problem; and the gain obtained with the introduction of this hysteretic model in the equations with respect to other models that do not show the this behavior, through of pictures that represents the time response and Phase diagrams. These pictures are obtained using flow velocities before and after the flutter velocity. Finally, an open-loop control was made to show the effect of the MRD in the aeroelastic behavior.

Metaheuristics for a crop rotation problem

This paper presents a mathematical model adapted from literature for the crop rotation problem with demand constraints (CRP-D). The main aim of the present work is to study metaheuristics and their performance in a real context. The proposed algorithms for solution of the CRP-D are a genetic algorithm, a simulated annealing and hybrid approaches: a genetic algorithm with simulated annealing and a genetic algorithm with local search algorithm. A new constructive heuristic was also developed to provide initial solutions for the metaheuristics. Computational experiments were performed using a real planting area and semi-randomly generated instances created by varying the number, positions and dimensions of the lots. The computational results showed that these algorithms determined good feasible solutions in a short computing time as compared with the time spent to get optimal solutions, thus proving their efficacy for dealing with this practical application of the CRP-D.

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.

Strategies and Precise Vocabulary Knowledge: Exploring the Relationships Among Mathematics Vocabulary, Problem Solving, and Confidence

In this action research study I focused on my eighth grade pre-algebra students’ abilities to attack problems with enthusiasm and self confidence whether they completely understand the concepts or not. I wanted to teach them specific strategies and introduce and use precise vocabulary as a part of the problem solving process in hopes that I would see students’ confidence improve as they worked with mathematics. I used non-routine problems and concept-related open-ended problems to teach and model problem solving strategies. I introduced and practiced communication with specific and precise vocabulary with the goal of increasing student confidence and lowering student anxiety when they were faced with mathematics problem solving. I discovered that although students were working more willingly on problem solving and more inclined to attempt word problems using the strategies introduced in class, they were still reluctant to use specific vocabulary as they communicated to solve problems. As a result of this research, my style of teaching problem solving will evolve so that I focus more specifically on strategies and use precise vocabulary. I will spend more time introducing strategies and necessary vocabulary at the beginning of the year and continue to focus on strategies and process in order to lower my students’ anxiety and thus increase their self confidence when it comes to doing mathematics, especially problem solving.

Exact field-driven interface dynamics in the two-dimensional stochastic Ising model with helicoidal boundary conditions

We investigate the interface dynamics of the two-dimensional stochastic Ising model in an external field under helicoidal boundary conditions. At sufficiently low temperatures and fields, the dynamics of the interface is described by an exactly solvable high-spin asymmetric quantum Hamiltonian that is the infinitesimal generator of the zero range process. Generally, the critical dynamics of the interface fluctuations is in the Kardar-Parisi-Zhang universality class of critical behavior. We remark that a whole family of RSOS interface models similar to the Ising interface model investigated here can be described by exactly solvable restricted high-spin quantum XXZ-type Hamiltonians. (C) 2012 Elsevier B.V. All rights reserved.

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).

Smart histogram analysis applied to the skull-stripping problem in T1-weighted MRI

In this paper we address the "skull-stripping" problem in 3D MR images. We propose a new method that employs an efficient and unique histogram analysis. A fundamental component of this analysis is an algorithm for partitioning a histogram based on the position of the maximum deviation from a Gaussian fit. In our experiments we use a comprehensive image database, including both synthetic and real MRI. and compare our method with other two well-known methods, namely BSE and BET. For all datasets we achieved superior results. Our method is also highly independent of parameter tuning and very robust across considerable variations of noise ratio.

Analytic perturbation theory for bound states in the transfer matrix spectrum of weakly correlated lattice ferromagnetic spin systems

We consider general d-dimensional lattice ferromagnetic spin systems with nearest neighbor interactions in the high temperature region ('beta' << 1). Each model is characterized by a single site apriori spin distribution taken to be even. We also take the parameter 'alfa' = ('S POT.4') - 3 '(S POT.2') POT.2' > 0, i.e. in the region which we call Gaussian subjugation, where ('S POT.K') denotes the kth moment of the apriori distribution. Associated with the model is a lattice quantum field theory known to contain a particle of asymptotic mass -ln 'beta' and a bound state below the two-particle threshold. We develop a 'beta' analytic perturbation theory for the binding energy of this bound state. As a key ingredient in obtaining our result we show that the Fourier transform of the two-point function is a meromorphic function, with a simple pole, in a suitable complex spectral parameter and the coefficients of its Laurent expansion are analytic in 'beta'.

Linear matrix inequality-based robust model predictive control for time-delayed systems

This work addresses the solution to the problem of robust model predictive control (MPC) of systems with model uncertainty. The case of zone control of multi-variable stable systems with multiple time delays is considered. The usual approach of dealing with this kind of problem is through the inclusion of non-linear cost constraint in the control problem. The control action is then obtained at each sampling time as the solution to a non-linear programming (NLP) problem that for high-order systems can be computationally expensive. Here, the robust MPC problem is formulated as a linear matrix inequality problem that can be solved in real time with a fraction of the computer effort. The proposed approach is compared with the conventional robust MPC and tested through the simulation of a reactor system of the process industry.

Two versions of the threshold contact model in two dimensions

Two versions of the threshold contact process ordinary and conservative - are studied on a square lattice. In the first, particles are created on active sites, those having at least two nearest neighbor sites occupied, and are annihilated spontaneously. In the conservative version, a particle jumps from its site to an active site. Mean-field analysis suggests the existence of a first-order phase transition, which is confirmed by Monte Carlo simulations. In the thermodynamic limit, the two versions are found to give the same results. (C) 2012 Elsevier B.V. All rights reserved.

Asynchronous teams for joint lot-sizing and scheduling problem in flow shops

The integrated production scheduling and lot-sizing problem in a flow shop environment consists of establishing production lot sizes and allocating machines to process them within a planning horizon in a production line with machines arranged in series. The problem considers that demands must be met without backlogging, the capacity of the machines must be respected, and machine setups are sequence-dependent and preserved between periods of the planning horizon. The objective is to determine a production schedule to minimise the setup, production and inventory costs. A mathematical model from the literature is presented, as well as procedures for obtaining feasible solutions. However, some of the procedures have difficulty in obtaining feasible solutions for large-sized problem instances. In addition, we address the problem using different versions of the Asynchronous Team (A-Team) approach. The procedures were compared with literature heuristics based on Mixed Integer Programming. The proposed A-Team procedures outperformed the literature heuristics, especially for large instances. The developed methodologies and the results obtained are presented.

Heuristic methods for the single machine scheduling problem with different ready times and a common due date

The single machine scheduling problem with a common due date and non-identical ready times for the jobs is examined in this work. Performance is measured by the minimization of the weighted sum of earliness and tardiness penalties of the jobs. Since this problem is NP-hard, the application of constructive heuristics that exploit specific characteristics of the problem to improve their performance is investigated. The proposed approaches are examined through a computational comparative study on a set of 280 benchmark test problems with up to 1000 jobs.