Investigation on the development of bidding strategies for a wind farm owner

In this paper, the development of bidding strategies is investigated for a wind farm owner. The optimization model is characterized by making the analysis of scenarios. The proposed approach allows evaluating alternative production strategies in order to submit bids to the electricity market with the goal of maximizing profits. The problem is formulated as a linear programming problem. An application to a case study is presented

An heuristic approach for optimal location of gas supply units in transportation system

The best places to locate the Gas Supply Units (GSUs) on a natural gas systems and their optimal allocation to loads are the key factors to organize an efficient upstream gas infrastructure. The number of GSUs and their optimal location in a gas network is a decision problem that can be formulated as a linear programming problem. Our emphasis is on the formulation and use of a suitable location model, reflecting real-world operations and constraints of a natural gas system. This paper presents a heuristic model, based on lagrangean approach, developed for finding the optimal GSUs location on a natural gas network, minimizing expenses and maximizing throughput and security of supply.The location model is applied to the Iberian high pressure natural gas network, a system modelised with 65 demand nodes. These nodes are linked by physical and virtual pipelines – road trucks with gas in liquefied form. The location model result shows the best places to locate, with the optimal demand allocation and the most economical gas transport mode: by pipeline or by road truck.

Optimal methodology for distribution systems reconfiguration based on OPF and solved by decomposition technique

This paper presents a new and efficient methodology for distribution network reconfiguration integrated with optimal power flow (OPF) based on a Benders decomposition approach. The objective minimizes power losses, balancing load among feeders and subject to constraints: capacity limit of branches, minimum and maximum power limits of substations or distributed generators, minimum deviation of bus voltages and radial optimal operation of networks. The Generalized Benders decomposition algorithm is applied to solve the problem. The formulation can be embedded under two stages; the first one is the Master problem and is formulated as a mixed integer non-linear programming problem. This stage determines the radial topology of the distribution network. The second stage is the Slave problem and is formulated as a non-linear programming problem. This stage is used to determine the feasibility of the Master problem solution by means of an OPF and provides information to formulate the linear Benders cuts that connect both problems. The model is programmed in GAMS. The effectiveness of the proposal is demonstrated through two examples extracted from the literature.

Self-Scheduling for energy and spinning reserve of wind/CSP plants by a MILP approach

This paper is on the self-scheduling for a power producer taking part in day-ahead joint energy and spinning reserve markets and aiming at a short-term coordination of wind power plants with concentrated solar power plants having thermal energy storage. The short-term coordination is formulated as a mixed-integer linear programming problem given as the maximization of profit subjected to technical operation constraints, including the ones related to a transmission line. Probability density functions are used to model the variability of the hourly wind speed and the solar irradiation in regard to a negative correlation. Case studies based on an Iberian Peninsula wind and concentrated solar power plants are presented, providing the optimal energy and spinning reserve for the short-term self-scheduling in order to unveil the coordination benefits and synergies between wind and solar resources. Results and sensitivity analysis are in favour of the coordination, showing an increase on profit, allowing for spinning reserve, reducing the need for curtailment, increasing the transmission line capacity factor. (C) 2014 Elsevier Ltd. All rights reserved.

Optimal Methodology for Synchronized Scheduling of Parallel Station Assembly with Air Transportation

We present an optimal methodology for synchronized scheduling of production assembly with air transportation to achieve accurate delivery with minimized cost in consumer electronics supply chain (CESC). This problem was motivated by a major PC manufacturer in consumer electronics industry, where it is required to schedule the delivery requirements to meet the customer needs in different parts of South East Asia. The overall problem is decomposed into two sub-problems which consist of an air transportation allocation problem and an assembly scheduling problem. The air transportation allocation problem is formulated as a Linear Programming Problem with earliness tardiness penalties for job orders. For the assembly scheduling problem, it is basically required to sequence the job orders on the assembly stations to minimize their waiting times before they are shipped by flights to their destinations. Hence the second sub-problem is modelled as a scheduling problem with earliness penalties. The earliness penalties are assumed to be independent of the job orders.

Hierarchical control and optimisation of the Tennessee Eastman process

Based on integrated system optimisation and parameter estimation a method is described for on-line steady state optimisation which compensates for model-plant mismatch and solves a non-linear optimisation problem by iterating on a linear - quadratic representation. The method requires real process derivatives which are estimated using a dynamic identification technique. The utility of the method is demonstrated using a simulation of the Tennessee Eastman benchmark chemical process.

A finite element method for second order nonvariational elliptic problems

We propose a numerical method to approximate the solution of second order elliptic problems in nonvariational form. The method is of Galerkin type using conforming finite elements and applied directly to the nonvariational (nondivergence) form of a second order linear elliptic problem. The key tools are an appropriate concept of “finite element Hessian” and a Schur complement approach to solving the resulting linear algebra problem. The method is illustrated with computational experiments on three linear and one quasi-linear PDE, all in nonvariational form.

Reaction-diffusion systems coupled at the boundary and the Morse-Smale property

We study an one-dimensional nonlinear reaction-diffusion system coupled on the boundary. Such system comes from modeling problems of temperature distribution on two bars of same length, jointed together, with different diffusion coefficients. We prove the transversality property of unstable and stable manifolds assuming all equilibrium points are hyperbolic. To this end, we write the system as an equation with noncontinuous diffusion coefficient. We then study the nonincreasing property of the number of zeros of a linearized nonautonomous equation as well as the Sturm-Liouville properties of the solutions of a linear elliptic problem. (C) 2008 Elsevier Inc. All rights reserved.

Smoothing Lipschitz functions

This paper describes a new approach to multivariate scattered data smoothing. It is assumed that the data are generated by a Lipschitz continuous function f, and include random noise to be filtered out. The proposed approach uses known, or estimated value of the Lipschitz constant of f, and forces the data to be consistent with the Lipschitz properties of f. Depending on the assumptions about the distribution of the random noise, smoothing is reduced to a standard quadratic or a linear programming problem. We discuss an efficient algorithm which eliminates the redundant inequality constraints. Numerical experiments illustrate applicability and efficiency of the method. This approach provides an efficient new tool of multivariate scattered data approximation.

Blind source separation by fully nonnegative constrained iterative volume maximization

Blind source separation (BSS) has been widely discussed in many real applications. Recently, under the assumption that both of the sources and the mixing matrix are nonnegative, Wang develop an amazing BSS method by using volume maximization. However, the algorithm that they have proposed can guarantee the nonnegativities of the sources only, but cannot obtain a nonnegative mixing matrix necessarily. In this letter, by introducing additional constraints, a method for fully nonnegative constrained iterative volume maximization (FNCIVM) is proposed. The result is with more interpretation, while the algorithm is based on solving a single linear programming problem. Numerical experiments with synthetic signals and real-world images are performed, which show the effectiveness of the proposed method.

Semi-supervised classification based on subspace sparse representation

Graph plays an important role in graph-based semi-supervised classification. However, due to noisy and redundant features in high-dimensional data, it is not a trivial job to construct a well-structured graph on high-dimensional samples. In this paper, we take advantage of sparse representation in random subspaces for graph construction and propose a method called Semi-Supervised Classification based on Subspace Sparse Representation, SSC-SSR in short. SSC-SSR first generates several random subspaces from the original space and then seeks sparse representation coefficients in these subspaces. Next, it trains semi-supervised linear classifiers on graphs that are constructed by these coefficients. Finally, it combines these classifiers into an ensemble classifier by minimizing a linear regression problem. Unlike traditional graph-based semi-supervised classification methods, the graphs of SSC-SSR are data-driven instead of man-made in advance. Empirical study on face images classification tasks demonstrates that SSC-SSR not only has superior recognition performance with respect to competitive methods, but also has wide ranges of effective input parameters.

Break: o grito corporal da periferia

In order to question a sociology as it considers appropriate the body dimensions, which contributes in a mean singular in relation to body, not only as a matter, but mainly as a producer of knowledge, our research shows a reflection on corporality as the production of knowledge and to understand different perspectives and social logic here in contemporaneity, whose rationality seems to be placed in question through a performance expressed, a lot of 'breaks', including the space, which the dancer break appropriates of a reversed form and not more than linear. Our problem is the possibility of a greater understanding of this young body with dance the break, is not only 'breaking' his body, but fluent in their own body fragments, producing probably a break in relation to a dominant power established, by creating a kind of 'social resistance' to provide another sense for his life, out of the senses by the dominant of a social field. This is the area of production of knowledge, of the 'body' that cries keep our eyes, the challenge of dive in the depth of gestures, beyond the physical structure, restoring in a strong political constitution and cultural in so far as this body faces. The body as spectacular becomes 'cause and effect' of communication, this body is not only individual, it is not expression only for itself; when the young dance outside their walls individuals, makes it relational, turning to relate with the other, with the space, time and the world. The methodological point of view, to study this corporality in element break, the body as language of senses, we considered withdrawals in the field, observations of movements of the universe of break creative dance, performance and analysis of "attitudes" (expression peculiar world hip hop ), as well as my experience with dancing in the street interventions through 'urban' and our own attitudes to the object of research which challenges us academically and, it all, existentially

Uma nova proposta de antenas Quasi-Yagi banda larga para comunicação sem fio

ln this work, planar quasi- Y agi antennas are investigated based on the concept of the classic Y agi_Uda antennas. These antennas represent improvements on the topologies of the antennas existing printed because they present characteristics of broad bandwidth, excellent radiation diagrams and simple construction. New configurations are adapted for the driver of the antennas, introducing patches elements into the driver. These new configurations are named Patches Elements Anteonas (PEA). This adaptation is obtained from simulations that are executed usiog the software C8T Microwave 8tudio 5. After doing the optimizations, procedures for construction and measurement ofthe prototypes are executed in order to improve the performance of the antennas in such way that they could be used in wireless communication applications, such as Bluetooth, WLAN' s and Wi-Fi. Next, the quasi- Y agi antennas are studied in order to implement them in arrangements. The arrangements construction is based 00 the best driver configuration of the antenna developed in this work. First, a linear arrangement composed by two elements of quasi¬Yagi antennas is constructed in such way that the radiation characteristics and the mutual coupling effects could be analyzed. After that, a 90° angle arrangement composed by two elements is studied to observe the effect of circular polarization. Experiments are executed in order to evaluate the arrangements performance. The experimental results show that the analysis made in this work is efficient and accurate. The numerical values obtained for the analyzed parameters of each structure developed are compared with the experimental values. 80, it is possible to observe a good concordance between them. Finally, some future works proposals are presented

A Bilevel Approach to Transmission Expansion Planning Within a Market Environment

We present a bilevel model for transmission expansion planning within a market environment, where producers and consumers trade freely electric energy through a pool. The target of the transmission planner, modeled through the upper-level problem, is to minimize network investment cost while facilitating energy trading. This upper-level problem is constrained by a collection of lower-level market clearing problems representing pool trading, and whose individual objective functions correspond to social welfare. Using the duality theory the proposed bilevel model is recast as a mixed-integer linear programming problem, which is solvable using branch-and-cut solvers. Detailed results from an illustrative example and a case study are presented and discussed. Finally, some relevant conclusions are drawn.

On asymptotic solutions of integrable wave equations

Asymptotic 'soliton train' solutions of integrable wave equations described by inverse scattering transform method with second-order scalar eigenvalue problem are considered. It is shown that if asymptotic solution can be presented as a modulated one-phase nonlinear periodic wavetrain, then the corresponding Baker-Akhiezer function transforms into quasiclassical eigenfunction of the linear spectral problem in weak dispersion limit for initially smooth pulses. In this quasiclassical limit the corresponding eigenvalues can be calculated with the use of the Bohr Sommerfeld quantization rule. The asymptotic distributions of solitons parameters obtained in this way specify the solution of the Whitham equations. (C) 2001 Elsevier B.V. B.V. All rights reserved.