Electromagnetic-thermal design optimization of the brushless doubly fed induction generator

In view of its special features, the brushless doubly fed induction generator (BDFIG) shows high potentials to be employed as a variable-speed drive or wind generator. However, the machine suffers from low efficiency and power factor and also high level of noise and vibration due to spatial harmonics. These harmonics arise mainly from rotor winding configuration, slotting effects, and saturation. In this paper, analytical equations are derived for spatial harmonics and their effects on leakage flux, additional loss, noise, and vibration. Using the derived equations and an electromagnetic-thermal model, a simple design procedure is presented, while the design variables are selected based on sensitivity analyses. A multiobjective optimization method using an imperialist competitive algorithm as the solver is established to maximize efficiency, power factor, and power-to-weight ratio, as well as to reduce rotor spatial harmonic distortion and voltage regulation simultaneously. Several constraints on dimensions, magnetic flux densities, temperatures, vibration level, and converter voltage and rating are imposed to ensure feasibility of the designed machine. The results show a significant improvement in the objective function. Finally, the analytical results of the optimized structure are validated using finite-element method and are compared to the experimental results of the D180 frame size prototype BDFIG. © 1982-2012 IEEE.

Design optimization and experimental demonstration of low VπL carrier-depletion silicon mach-zehnder modulator

We design, optimize and demonstrate a highly efficient carrier-depletion silicon Mach-Zehnder modulator with very low VπL of ~0.2Vcm. Design consideration, fabrication process and experimental results will be presented. © OSA 2013.

Design optimization of the APF DTL in the SSC-linac

A linear accelerator as a new injector for the SSC (Separated Sector Cyclotron) of the HIRFL (Heavy ton Research Facility Lanzhou) is being designed. The DTL (Drift-Tube-Linac) has been designed to accelerate U-238(34+) from 0.140 MeV/u to 0.97 MeV/u. To the first accelerating tank which accelerates U-238(34+) to 0.54 MeV/u, the approach of Alternating-Phase-Focusing (APF) is applied. The phase array is obtained by coupling optimization software Dakota and beam optics code LINREV. With the hybrid of Multi-objective Genetic Algorithm (MOGA) and a pattern search method, an optimum array of asynchronous phases is determined. The final growth, both transversely and longitudinally, can meet the design requirements. In this paper, the deign optimization of the APF DTL is presented.

Design Optimization and Security For Communication Networks

In this work we introduce a new mathematical tool for optimization of routes, topology design, and energy efficiency in wireless sensor networks. We introduce a vector field formulation that models communication in the network, and routing is performed in the direction of this vector field at every location of the network. The magnitude of the vector field at every location represents the density of amount of data that is being transited through that location. We define the total communication cost in the network as the integral of a quadratic form of the vector field over the network area. With the above formulation, we introduce a mathematical machinery based on partial differential equations very similar to the Maxwell's equations in electrostatic theory. We show that in order to minimize the cost, the routes should be found based on the solution of these partial differential equations. In our formulation, the sensors are sources of information, and they are similar to the positive charges in electrostatics, the destinations are sinks of information and they are similar to negative charges, and the network is similar to a non-homogeneous dielectric media with variable dielectric constant (or permittivity coefficient). In one of the applications of our mathematical model based on the vector fields, we offer a scheme for energy efficient routing. Our routing scheme is based on changing the permittivity coefficient to a higher value in the places of the network where nodes have high residual energy, and setting it to a low value in the places of the network where the nodes do not have much energy left. Our simulations show that our method gives a significant increase in the network life compared to the shortest path and weighted shortest path schemes. Our initial focus is on the case where there is only one destination in the network, and later we extend our approach to the case where there are multiple destinations in the network. In the case of having multiple destinations, we need to partition the network into several areas known as regions of attraction of the destinations. Each destination is responsible for collecting all messages being generated in its region of attraction. The complexity of the optimization problem in this case is how to define regions of attraction for the destinations and how much communication load to assign to each destination to optimize the performance of the network. We use our vector field model to solve the optimization problem for this case. We define a vector field, which is conservative, and hence it can be written as the gradient of a scalar field (also known as a potential field). Then we show that in the optimal assignment of the communication load of the network to the destinations, the value of that potential field should be equal at the locations of all the destinations. Another application of our vector field model is to find the optimal locations of the destinations in the network. We show that the vector field gives the gradient of the cost function with respect to the locations of the destinations. Based on this fact, we suggest an algorithm to be applied during the design phase of a network to relocate the destinations for reducing the communication cost function. The performance of our proposed schemes is confirmed by several examples and simulation experiments. In another part of this work we focus on the notions of responsiveness and conformance of TCP traffic in communication networks. We introduce the notion of responsiveness for TCP aggregates and define it as the degree to which a TCP aggregate reduces its sending rate to the network as a response to packet drops. We define metrics that describe the responsiveness of TCP aggregates, and suggest two methods for determining the values of these quantities. The first method is based on a test in which we drop a few packets from the aggregate intentionally and measure the resulting rate decrease of that aggregate. This kind of test is not robust to multiple simultaneous tests performed at different routers. We make the test robust to multiple simultaneous tests by using ideas from the CDMA approach to multiple access channels in communication theory. Based on this approach, we introduce tests of responsiveness for aggregates, and call it CDMA based Aggregate Perturbation Method (CAPM). We use CAPM to perform congestion control. A distinguishing feature of our congestion control scheme is that it maintains a degree of fairness among different aggregates. In the next step we modify CAPM to offer methods for estimating the proportion of an aggregate of TCP traffic that does not conform to protocol specifications, and hence may belong to a DDoS attack. Our methods work by intentionally perturbing the aggregate by dropping a very small number of packets from it and observing the response of the aggregate. We offer two methods for conformance testing. In the first method, we apply the perturbation tests to SYN packets being sent at the start of the TCP 3-way handshake, and we use the fact that the rate of ACK packets being exchanged in the handshake should follow the rate of perturbations. In the second method, we apply the perturbation tests to the TCP data packets and use the fact that the rate of retransmitted data packets should follow the rate of perturbations. In both methods, we use signature based perturbations, which means packet drops are performed with a rate given by a function of time. We use analogy of our problem with multiple access communication to find signatures. Specifically, we assign orthogonal CDMA based signatures to different routers in a distributed implementation of our methods. As a result of orthogonality, the performance does not degrade because of cross interference made by simultaneously testing routers. We have shown efficacy of our methods through mathematical analysis and extensive simulation experiments.

Parametrical modeling and design optimization of blood plasma separation device with microchannel mechanism

This paper presents an analysis of biofluid behavior in a T-shaped microchannel device and a design optimization for improved biofluid performance in terms of particle liquid separation. The biofluid is modeled with single phase shear rate non-Newtonian flow with blood property. The separation of red blood cell from plasma is evident based on biofluid distribution in the microchannels against various relevant effects and findings, including Zweifach-Fung bifurcation law, Fahraeus effect, Fahraeus-Lindqvist effect and cell free phenomenon. The modeling with the initial device shows that this T-microchannel device can separate red blood cell from plasma but the separation efficiency among different bifurcations varies largely. In accordance with the imbalanced performance, a design optimization is conducted. This includes implementing a series of simulations to investigate the effect of the lengths of the main and branch channels to biofluid behavior and searching an improved design with optimal separation performance. It is found that changing relative lengths of branch channels is effective to both uniformity of flow rate ratio among bifurcations and reduction of difference of the flow velocities between the branch channels, whereas extending the length of the main channel from bifurcation region is only effective for uniformity of flow rate ratio.