Delay optimal control algorithm for a multiaccess fading channel with peak power constraint

We consider an optimal power and rate scheduling problem for a multiaccess fading wireless channel with the objective of minimising a weighted sum of mean packet transmission delay subject to a peak power constraint. The base station acts as a controller which, depending upon the buffer lengths and the channel state of each user, allocates transmission rate and power to individual users. We assume perfect channel state information at the transmitter and the receiver. We also assume a Markov model for the fading and packet arrival processes. The policy obtained represents a form of Indexability.

Pareto-optimal solutions for multi-objective optimization of fed-batch bioreactors using nondominated sorting genetic algorithm

Many optimal control problems are characterized by their multiple performance measures that are often noncommensurable and competing with each other. The presence of multiple objectives in a problem usually give rise to a set of optimal solutions, largely known as Pareto-optimal solutions. Evolutionary algorithms have been recognized to be well suited for multi-objective optimization because of their capability to evolve a set of nondominated solutions distributed along the Pareto front. This has led to the development of many evolutionary multi-objective optimization algorithms among which Nondominated Sorting Genetic Algorithm (NSGA and its enhanced version NSGA-II) has been found effective in solving a wide variety of problems. Recently, we reported a genetic algorithm based technique for solving dynamic single-objective optimization problems, with single as well as multiple control variables, that appear in fed-batch bioreactor applications. The purpose of this study is to extend this methodology for solution of multi-objective optimal control problems under the framework of NSGA-II. The applicability of the technique is illustrated by solving two optimal control problems, taken from literature, which have usually been solved by several methods as single-objective dynamic optimization problems. (C) 2004 Elsevier Ltd. All rights reserved.

Optimal Resource Partitioning in a Military Conflict based on Lanchester Attrition Models

This paper develops a model for military conflicts where the defending forces have to determine an optimal partitioning of available resources to counter attacks from an adversary in two different fronts. The Lanchester attrition model is used to develop the dynamical equations governing the variation in force strength. Three different allocation schemes - Time-Zero-Allocation (TZA), Allocate-Assess-Reallocate (AAR), and Continuous Constant Allocation (CCA) - are considered and the optimal solutions are obtained in each case. Numerical examples are given to support the analytical results.

Optimal threshold policies for admission control in communication networks via discrete parameter stochastic approximation

The problem of admission control of packets in communication networks is studied in the continuous time queueing framework under different classes of service and delayed information feedback. We develop and use a variant of a simulation based two timescale simultaneous perturbation stochastic approximation (SPSA) algorithm for finding an optimal feedback policy within the class of threshold type policies. Even though SPSA has originally been designed for continuous parameter optimization, its variant for the discrete parameter case is seen to work well. We give a proof of the hypothesis needed to show convergence of the algorithm on our setting along with a sketch of the convergence analysis. Extensive numerical experiments with the algorithm are illustrated for different parameter specifications. In particular, we study the effect of feedback delays on the system performance.

Combination of Tevatron Searches for the Standard Model Higgs Boson in the W+W- Decay Mode

We combine searches by the CDF and D0 collaborations for a Higgs boson decaying to W+W-. The data correspond to an integrated total luminosity of 4.8 (CDF) and 5.4 (D0) fb-1 of p-pbar collisions at sqrt{s}=1.96 TeV at the Fermilab Tevatron collider. No excess is observed above background expectation, and resulting limits on Higgs boson production exclude a standard-model Higgs boson in the mass range 162-166 GeV at the 95% C.L.

Power Optimal Network-on-Chip Interconnect Design

A large part of today's multi-core chips is interconnect. Increasing communication complexity has made essential new strategies for interconnects, such as Network on Chip. Power dissipation in interconnects has become a substantial part of the total power dissipation. Techniques to reduce interconnect power have thus become a necessity. In this paper, we present a design methodology that gives values of bus width for interconnect links, frequency of operation for routers, in Network on Chip scenario that satisfy required throughput and dissipate minimal switching power. We develop closed form analytical expressions for the power dissipation, with bus width and frequency as variables and then use Lagrange multiplier method to arrive at the optimal values. We present a 4 port router in 90 nm technology library as case study. The results obtained from analysis are discussed.

Optimal non-linear reinforcement schemes for stochastic automata

Two optimal non-linear reinforcement schemes—the Reward-Inaction and the Penalty-Inaction—for the two-state automaton functioning in a stationary random environment are considered. Very simple conditions of symmetry of the non-linear function figuring in the reinforcement scheme are shown to be necessary and sufficient for optimality. General expressions for the variance and rate of learning are derived. These schemes are compared with the already existing optimal linear schemes in the light of average variance and average rate of learning.

Tablettien soveltuvuus annosjakeluun

Koneellinen annosjakelu on kasvava lääkehuollon osa-alue, jossa lääkkeet pakataan koneellisesti pieniin annoskertakohtaisiin pusseihin kahden viikon erissä. Aikaisemmin lääkevalmisteiden soveltuvuutta koneelliseen annosjakeluun ei ole systemaattisesti tutkittu. Tutkimus tehtiin yhteistyössä Espoonlahden apteekin annosjakeluyksikön kanssa ja sen tavoitteena oli määrittää annosjakeluprosessin kannalta optimaaliset ominaisuudet annosjaeltavalle tabletille rikkoutumisten ja siirtymien vähentämiseksi. Rikkoutuminen on lääkevalmisteen murentumista, puolittumista tai muuta rikkoutumista annosjakelun aikana. Siirtymä on lääkevalmisteen jakelu väärään annospussiin. Prosentuaalisesti rikkoutumisia ja siirtymiä on jakelumäärästä hyvin vähän, mutta määrällisesti paljon ja koko ajan enemmän koneellisen annosjakelun yleistyessä. Rikkoutumiset ja siirtymät aiheuttavat paljon lisätyötä pussien korjaamisen takia, joten niiden määrää on pyrittävä vähentämään. Lisäksi tavoitteena oli selvittää lääkkeiden valmistajilta kysyttävissä olevat asiat lääkevalmisteiden ominaisuuksista ja säilyvyydestä, jotta voitaisiin päätellä valmisteen soveltuvuus koneelliseen annosjakeluun kirjallisen tiedon perusteella. Tutkimuksen tulosten perusteella rikkoutumisten ja siirtymien vähentämiseksi optimaalinen tablettivalmiste annosjakeluun on pienehkö tai keskisuuri, päällystetty, luja ja jakouurteeton ja optimaalinen ilman suhteellinen kosteustaso annosjakeluyksikön tuotantotiloissa olisi noin 30 – 40 %. Lääkkeiden valmistajilta kysyttäviä seikkoja ovat koon, päällysteen, murtolujuuden ja jakouurteen lisäksi valmisteen säilyvyys alkuperäispakkauksen ulkopuolella sekä valmisteen valo-, lämpö- ja kosteusherkkyys. Rikkoutumisten ja siirtymien lisäksi tutkittiin myös kosteusherkän asetyylisalisyylihappovalmisteen (Disperin 100 mg) säilyvyyttä 25 °C ja 60 % RH olosuhteissa, koska tuotantotilojen ilman kosteustasoa ei ole säädelty. Säilyvyystutkimuksen kesto oli neljä viikkoa. Se on riittävä, koska se on enimmäisaika, jonka tabletit ovat annosjakeluprosessin yhteydessä pois alkuperäispakkauksestaan ennen käyttöä. Tabletteja säilytettiin avoimessa alkuperäispakkauksessa (purkki), suljetussa alkuperäispakkauksessa, annosjakelukoneen kasetissa ja kahdessa erilaisessa annospussissa (uusi ja käytössä oleva materiaali). Tulosten mukaan annosjakelukoneen kasetti suojaa kosteudelta yhtä huonosti kuin avoin purkki. Uusi pussimateriaali sen sijaan suojaa kosteudelta paremmin kuin tällä hetkellä käytössä oleva materiaali. Raman -spektroskopiamittausten perusteella asetyylisalisyylihappotableteissa ei ehdi neljän viikon seurannan aikana tapahtua asetyylisalisyylihapon hajoamista salisyylihapoksi. Kosteus heikentää tablettien murtolujuutta, mikä saattaa aiheuttaa enemmän rikkoutumisia. Kosteustaso olisi hyvä olla säädettävissä vakioksi tuotantotiloissa tai purkaa tabletit kasetteihin mahdollisimman lähellä jakelua rikkoutumisten ehkäisemiseksi, etenkin ilman kosteustason ollessa korkea. Lisäksi tutkittiin lääkevalmisteen lämpöherkkyyttä koska annosjakelukoneen saumauslaite altistaa annospussit noin 75 °C lämmölle, jos annosjakelukone pysäytetään kesken työn. Tutkimus tehtiin XRPD:llä, jolla voidaan säätää näytteen lämpötilaa. Lämpöherkkyystutkimusten perusteella 75 °C lämpö ei ehdi tunnin aikana aiheuttaa muutoksia karbamatsepiinitabletissa (Neurotol 200 mg). Tuloksista selvisi, että tutkitun valmisteen sisältämä karbamatsepiini ei kuitenkaan ole lämpöherkin muoto, joten muita lämpöherkkiä lääkevalmisteita tulisi tutkia lisätiedon saamiseksi lämmön vaikutuksista.

Optimal design of multiproduct batch chemical plant using NSGA-II

The optimal design of a multiproduct batch chemical plant is formulated as a multiobjective optimization problem, and the resulting constrained mixed-integer nonlinear program (MINLP) is solved by the nondominated sorting genetic algorithm approach (NSGA-II). By putting bounds on the objective function values, the constrained MINLP problem can be solved efficiently by NSGA-II to generate a set of feasible nondominated solutions in the range desired by the decision-maker in a single run of the algorithm. The evolution of the entire set of nondominated solutions helps the decision-maker to make a better choice of the appropriate design from among several alternatives. The large set of solutions also provides a rich source of excellent initial guesses for solution of the same problem by alternative approaches to achieve any specific target for the objective functions

Optimal Risk Adoption: A Real Options Approach

This study develops a real options approach for analyzing the optimal risk adoption policy in an environment where the adoption means a switch from one stochastic flow representation into another. We establish that increased volatility needs not decelerate investment, as predicted by the standard literature on real options, once the underlying volatility of the state is made endogenous. We prove that for a decision maker with a convex (concave) objective function, increased post-adoption volatility increases (decreases) the expected cumulative present value of the post-adoption profit flow, which consequently decreases (increases) the option value of waiting and, therefore, accelerates (decelerates) current investment.

Bank Run Risk and Optimal Reserves

We characterize the optimal reserves, and the generated probability of a bank run, as a function of the penalty imposed by the central bank, the probability of depositors’ liquidity needs, and the return on outside investment opportunities.

Wave algorithms:Optimal database search and catalysis

Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any physical system that allows superposition of states. A physical realization of this algorithm is described using coupled simple harmonic oscillators, which can be exactly solved in both classical and quantum domains. Classical wave algorithms are far more stable against decoherence compared to their quantum counterparts. In addition to providing convenient demonstration models, they may have a role in practical situations, such as catalysis.

Optimal reactive power dispatch based on voltage stability criteria in a large power system with AC/DC and FACTs devices

An algorithm for optimal allocation of reactive power in AC/DC system using FACTs devices, with an objective of improving the voltage profile and also voltage stability of the system has been presented. The technique attempts to utilize fully the reactive power sources in the system to improve the voltage stability and profile as well as meeting the reactive power requirements at the AC-DC terminals to facilitate the smooth operation of DC links. The method involves successive solution of steady-state power flows and optimization of reactive power control variables with Unified Power Flow Controller (UPFC) using linear programming technique. The proposed method has been tested on a real life equivalent 96-bus AC and a two terminal DC system under normal and contingency conditions.

A generalized Linear Programming based approach to optimal divisible load scheduling

In this paper we propose a general Linear Programming (LP) based formulation and solution methodology for obtaining optimal solution to the load distribution problem in divisible load scheduling. We exploit the power of the versatile LP formulation to propose algorithms that yield exact solutions to several very general load distribution problems for which either no solutions or only heuristic solutions were available. We consider both star (single-level tree) networks and linear daisy chain networks, having processors equipped with front-ends, that form the generic models for several important network topologies. We consider arbitrary processing node availability or release times and general models for communication delays and computation time that account for constant overheads such as start up times in communication and computation. The optimality of the LP based algorithms is proved rigorously.