Modeling thermal conductivity, specific heat, and density of milk: A neural network approach

The accurate determination of thermophysical properties of milk is very important for design, simulation, optimization, and control of food processing such as evaporation, heat exchanging, spray drying, and so forth. Generally, polynomial methods are used for prediction of these properties based on empirical correlation to experimental data. Artificial neural networks are better Suited for processing noisy and extensive knowledge indexing. This article proposed the application of neural networks for prediction of specific heat, thermal conductivity, and density of milk with temperature ranged from 2.0 to 71.0degreesC, 72.0 to 92.0% of water content (w/w), and 1.350 to 7.822% of fat content (w/w). Artificial neural networks presented a better prediction capability of specific heat, thermal conductivity, and density of milk than polynomial modeling. It showed a reasonable alternative to empirical modeling for thermophysical properties of foods.

Efficient linear programming algorithm for the transmission network expansion planning problem

The transmission network planning problem is a non-linear integer mixed programming problem (NLIMP). Most of the algorithms used to solve this problem use a linear programming subroutine (LP) to solve LP problems resulting from planning algorithms. Sometimes the resolution of these LPs represents a major computational effort. The particularity of these LPs in the optimal solution is that only some inequality constraints are binding. This task transforms the LP into an equivalent problem with only one equality constraint (the power flow equation) and many inequality constraints, and uses a dual simplex algorithm and a relaxation strategy to solve the LPs. The optimisation process is started with only one equality constraint and, in each step, the most unfeasible constraint is added. The logic used is similar to a proposal for electric systems operation planning. The results show a higher performance of the algorithm when compared to primal simplex methods.

Collagen type VI is a component of the extracellular matrix microfibril network of the prostatic stroma

Stroma-epithelium relationships are of great relevance in prostatic morphogenesis and physiology, However, little knowledge exists about either stromal cells or extracellular matrix composition and arrangement in this system, Ultrastructural analysis revealed the existence of a microfibrillar system which occupies large areas of the rat prostatic stroma, In this work, we have applied immunocytochemistry and an ATP treatment for the ultrastructural identification of collagen type VI microfibrils, aiming at examining its participation in the prostatic microfibrillar network. Immunocytochemistry was also extended to a human case of prostatic nodular hyperplasia, Both methods succeeded in identifying collagen type VI in the rat ventral prostate, Collagen type VI is evenly distributed throughout the stroma but mainly associated with the basal lamina, collagen fibrils, and around the stromal cells, the use of ATP treatment allowed for the discrimination between collagen type VI and elastin-associated microfibrils, and demonstrated that these two classes of microfibrils establish an extended, mixed, and open network. The same aspects of association with the basal lamina, with stromal cells (particularly with smooth muscle cells), and with fibrillar components of the stroma were observed in the human tissue, We suggest that the collagen type VI and elastin-associated microfibril system may be involved in the control of some aspects of cellular behavior and may also play a structural role, maintaining the organ integrity after the deformations occurring under smooth muscle contraction.

Test systems and mathematical models for transmission network expansion planning

The data of four networks that can be used in carrying out comparative studies with methods for transmission network expansion planning are given. These networks are of various types and different levels of complexity. The main mathematical formulations used in transmission expansion studies-transportation models, hybrid models, DC power flow models, and disjunctive models are also summarised and compared. The main algorithm families are reviewed-both analytical, combinatorial and heuristic approaches. Optimal solutions are not yet known for some of the four networks when more accurate models (e.g. The DC model) are used to represent the power flow equations-the state of the art with regard to this is also summarised. This should serve as a challenge to authors searching for new, more efficient methods.

Optimization of Radial Basis Function neural network employed for prediction of surface roughness in hard turning process using Taguchi's orthogonal arrays

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Algorithms for network piecewise-linear programs: A comparative study

Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a subarea of PLP called Network Piecewise-Linear Programming (NPLP) is explored. The paper presents four specialised algorithms for NPLP: (Strongly Feasible) Primal Simplex, Dual Method, Out-of-Kilter and (Strongly Polynomial) Cost-Scaling and their relative efficiency is studied. A statistically designed experiment is used to perform a computational comparison of the algorithms. The response variable observed in the experiment is the CPU time to solve randomly generated network piecewise-linear problems classified according to problem class (Transportation, Transshipment and Circulation), problem size, extent of capacitation, and number of breakpoints per arc. Results and conclusions on performance of the algorithms are reported.

Transient stability analysis of electrical power systems using a neural network based on fuzzy ARTMAP

This work presents a methodology to analyze transient stability for electric energy systems using artificial neural networks based on fuzzy ARTMAP architecture. This architecture seeks exploring similarity with computational concepts on fuzzy set theory and ART (Adaptive Resonance Theory) neural network. The ART architectures show plasticity and stability characteristics, which are essential qualities to provide the training and to execute the analysis. Therefore, it is used a very fast training, when compared to the conventional backpropagation algorithm formulation. Consequently, the analysis becomes more competitive, compared to the principal methods found in the specialized literature. Results considering a system composed of 45 buses, 72 transmission lines and 10 synchronous machines are presented. © 2003 IEEE.

A constructive heuristic algorithm to Short Term Transmission Network Expansion Planning

In this paper a method for solving the Short Term Transmission Network Expansion Planning (STTNEP) problem is presented. The STTNEP is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In this work we present a constructive heuristic algorithm to find a solution of the STTNEP of excellent quality. In each step of the algorithm a sensitivity index is used to add a circuit (transmission line or transformer) to the system. This sensitivity index is obtained solving the STTNEP problem considering as a continuous variable the number of circuits to be added (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an interior points method that uses a combination of the multiple predictor corrector and multiple centrality corrections methods, both belonging to the family of higher order interior points method (HOIPM). Tests were carried out using a modified Carver system and the results presented show the good performance of both the constructive heuristic algorithm to solve the STTNEP problem and the HOIPM used in each step.

Network reconfiguration and loss allocation for distribution systems with distributed generation

Distribution systems with distributed generation require new analysis methods since networks are not longer passive. Two of the main problems in this new scenario are the network reconfiguration and the loss allocation. This work presents a distribution systems graphic simulator, developed with reconfiguration functions and a special focus on loss allocation, both considering the presence of distributed generation. This simulator uses a fast and robust power flow algorithm based on the current summation backward-forward technique. Reconfiguration problem is solved through a heuristic methodology and the losses allocation function, based on the Zbus method, is presented as an attached result for each obtained configuration. Results are presented and discussed, remarking the easiness of analysis through the graphic simulator as an excellent tool for planning and operation engineers, and very useful for training. © 2004 IEEE.

Network reconfiguration and loss allocation in a deregulated environment of distribution systems

Low flexibility and reliability in the operation of radial distribution networks make those systems be constructed with extra equipment as sectionalising switches in order to reconfigure the network, so the operation quality of the network can be improved. Thus, sectionalising switches are used for fault isolation and for configuration management (reconfiguration). Moreover, distribution systems are being impacted by the increasing insertion of distributed generators. Hence, distributed generation became one of the relevant parameters in the evaluation of systems reconfiguration. Distributed generation may affect distribution networks operation in various ways, causing noticeable impacts depending on its location. Thus, the loss allocation problem becomes more important considering the possibility of open access to the distribution networks. In this work, a graphic simulator for distribution networks with reconfiguration and loss allocation functions, is presented. Reconfiguration problem is solved through a heuristic methodology, using a robust power flow algorithm based on the current summation backward-forward technique, considering distributed generation. Four different loss allocation methods (Zbus, Direct Loss Coefficient, Substitution and Marginal Loss Coefficient) are implemented and compared. Results for a 32-bus medium voltage distribution network, are presented and discussed.

Substitution-newton-Raphson method for the solution of electric network equations

The power flow problem, in transmission networks, has been well solved, for most cases, using Newton-Raphson method (NR) and its decoupled versions. Generally speaking, the solution of a non-linear system of equations refers to two methods: NR and Successive Substitution. The proposal of this paper is to evaluate the potential of the Substitution-Newton-Raphson Method (SNR), which combines both methods, on the solution of the power flow problem. Simulations were performed using a two-bus test network in order to observe the characteristics of these methods. It was verified that the NR is faster than SNR, in terms of convergence, considering non-stressed scenarios. For those cases where the power flow in the network is closed to the limits (stressed system), the SNR converges faster. This paper presents the power flow formulation of the SNR and describes its potential for its application in special cases such as stressed scenarios. © 2006 IEEE.

Brazilian network for the surveillance of maternal potentially life threatening morbidity and maternal near-miss and a multidimensional evaluation of their long term consequences

Background. It has been suggested that the study of women who survive life-threatening complications related to pregnancy (maternal near-miss cases) may represent a practical alternative to surveillance of maternal morbidity/mortality since the number of cases is higher and the woman herself is able to provide information on the difficulties she faced and the long-term repercussions of the event. These repercussions, which may include sexual dysfunction, postpartum depression and posttraumatic stress disorder, may persist for prolonged periods of time, affecting women's quality of life and resulting in adverse effects to them and their babies. Objective. The aims of the present study are to create a nationwide network of scientific cooperation to carry out surveillance and estimate the frequency of maternal near-miss cases, to perform a multicenter investigation into the quality of care for women with severe complications of pregnancy, and to carry out a multidimensional evaluation of these women up to six months. Methods/Design. This project has two components: a multicenter, cross-sectional study to be implemented in 27 referral obstetric units in different geographical regions of Brazil, and a concurrent cohort study of multidimensional analysis. Over 12 months, investigators will perform prospective surveillance to identify all maternal complications. The population of the cross-sectional component will consist of all women surviving potentially life-threatening conditions (severe maternal complications) or life-threatening conditions (the maternal near miss criteria) and maternal deaths according to the new WHO definition and criteria. Data analysis will be performed in case subgroups according to the moment of occurrence and determining cause. Frequencies of near-miss and other severe maternal morbidity and the association between organ dysfunction and maternal death will be estimated. A proportion of cases identified in the cross-sectional study will comprise the cohort of women for the multidimensional analysis. Various aspects of the lives of women surviving severe maternal complications will be evaluated 3 and 6 months after the event and compared to a group of women who suffered no severe complications in pregnancy. Previously validated questionnaires will be used in the interviews to assess reproductive function, posttraumatic stress, functional capacity, quality of life, sexual function, postpartum depression and infant development. © 2009 Cecatti et al.

Distribution network planning using a constructive heuristic algorithm

An optimization technique to solve distribution network planning (DNP) problem is presented. This is a very complex mixed binary nonlinear programming problem. A constructive heuristic algorithm (CHA) aimed at obtaining an excellent quality solution for this problem is presented. In each step of the CHA, a sensitivity index is used to add a circuit or a substation to the distribution network. This sensitivity index is obtained solving the DNP problem considering the numbers of circuits and substations to be added as continuous variables (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an efficient nonlinear optimization solver. A local improvement phase and a branching technique were implemented in the CHA. Results of two tests using a distribution network are presented in the paper in order to show the ability of the proposed algorithm. ©2009 IEEE.

A specialized genetic algorithm to solve the short term transmission network expansion planning

In this paper, the short term transmission network expansion planning (STTNEP) is solved through a specialized genetic algorithm (SGA). A complete AC model of the transmission network is used, which permits the formulation of an integrated power system transmission network expansion planning problem (real and reactive power planning). The characteristics of the proposed SGA to solve the STTNEP problem are detailed and an interior point method is employed to solve nonlinear programming problems during the solution steps of the SGA. Results of tests carried out with two electrical energy systems show the capabilities of the SGA and also the viability of using the AC model to solve the STTNEP problem. © 2009 IEEE.

Problem of assignment cells to switches in a cellular mobile network via beam search method

The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic methods, because they allow us to find a good quality solution in a quite satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach to provide good solutions for medium- and large-sized cellular mobile network.