An energy efficient vertical handover decision algorithm

As wireless communications evolve towards heterogeneousnetworks, mobile terminals have been enabled tohandover seamlessly from one network to another. At the sametime, the continuous increase in the terminal power consumptionhas resulted in an ever-decreasing battery lifetime. To that end,the network selection is expected to play a key role on howto minimize the energy consumption, and thus to extend theterminal lifetime. Hitherto, terminals select the network thatprovides the highest received power. However, it has been provedthat this solution does not provide the highest energy efficiency.Thus, this paper proposes an energy efficient vertical handoveralgorithm that selects the most energy efficient network thatminimizes the uplink power consumption. The performance of theproposed algorithm is evaluated through extensive simulationsand it is shown to achieve high energy efficiency gains comparedto the conventional approach.

New approximation to the third-order density : application to the calculation of correlated multicenter indices

In this work we present the formulas for the calculation of exact three-center electron sharing indices (3c-ESI) and introduce two new approximate expressions for correlated wave functions. The 3c-ESI uses the third-order density, the diagonal of the third-order reduced density matrix, but the approximations suggested in this work only involve natural orbitals and occupancies. In addition, the first calculations of 3c-ESI using Valdemoro's, Nakatsuji's and Mazziotti's approximation for the third-order reduced density matrix are also presented for comparison. Our results on a test set of molecules, including 32 3c-ESI values, prove that the new approximation based on the cubic root of natural occupancies performs the best, yielding absolute errors below 0.07 and an average absolute error of 0.015. Furthemore, this approximation seems to be rather insensitive to the amount of electron correlation present in the system. This newly developed methodology provides a computational inexpensive method to calculate 3c-ESI from correlated wave functions and opens new avenues to approximate high-order reduced density matrices in other contexts, such as the contracted Schrödinger equation and the anti-Hermitian contracted Schrödinger equation

Escacs, un sistema intel·ligent

Des dels inicis dels ordinadors com a màquines programables, l’home ha intentat dotar-los de certa intel•ligència per tal de pensar o raonar el més semblant possible als humans. Un d’aquests intents ha sigut fer que la màquina sigui capaç de pensar de tal manera que estudiï jugades i guanyi partides d’escacs. En l’actualitat amb els actuals sistemes multi tasca, orientat a objectes i accés a memòria i gràcies al potent hardware del que disposem, comptem amb una gran varietat de programes que es dediquen a jugar a escacs. Però no hi ha només programes petits, hi ha fins i tot màquines senceres dedicades a calcular i estudiar jugades per tal de guanyar als millors jugadors del món. L’objectiu del meu treball és dur a terme un estudi i implementació d’un d’aquests programes, per això es divideix en dues parts. La part teòrica o de l’estudi, consta d’un estudi dels sistemes d’intel•ligència artificial que es dediquen a jugar a escacs, estudi i cerca d’una funció d’avaluació vàlida i estudi dels algorismes de cerca. La part pràctica del treball es basa en la implementació d’un sistema intel•ligent capaç de jugar a escacs amb certa lògica. Aquesta implementació es porta a terme amb l’ajuda de les llibreries SDL, utilitzant l’algorisme minimax amb poda alfa-beta i codi c++. Com a conclusió del projecte m’agradaria remarcar que l’estudi realitzat m’ha deixat veure que crear un joc d’escacs no era tan fàcil com jo pensava però m’ha aportat la satisfacció d’aplicar tot el que he après durant la carrera i de descobrir moltes altres coses noves.

Biosynthesis of Yersinia enterocolitica serotype O:3 lipopolysaccharide outer core

Lipopolysacharide (LPS) present on the outer leaflet of Gram-negative bacteria is important for the adaptation of the bacteria to the environment. Structurally, LPS can be divided into three parts: lipid A, core and O-polysaccharide (OPS). OPS is the outermost and also the most diverse moiety. When OPS is composed of identical sugar residues it is called homopolymeric and when it is composed of repeating units of oligosaccharides it is called heteropolymeric. Bacteria synthesize LPS at the inner membrane via two separate pathways, Lipid A-core via one and OPS via the other. These are ligated together in the periplasmic space and the completed LPS molecule is translocated to the surface of the bacteria. The genes directing the OPS biosynthesis are often clustered and the clusters directing the biosynthesis of heteropolymeric OPS often contain genes for i) the biosynthesis of required NDP-sugar precursors, ii) glycosyltransferases needed to build up the repeating unit, iii) translocation of the completed O-unit to the periplasmic side of the inner membrane (flippase) and iv) polymerization of the repeating units to complete OPS. The aim of this thesis was to characterize the biosynthesis of the outer core (OC) of Yersinia enterocolitica serotype O:3 (YeO3). Y. enterocolitica is a member of the Gram-negative Yersinia genus and it causes diarrhea followed sometimes by reactive arthritis. The chemical structure of the OC and the nucleotide sequence of the gene cluster directing its biosynthesis were already known; however, no experimental evidence had been provided for the predicted functions of the gene products. The hypothesis was that the OC biosynthesis would follow the pathway described for heteropolymeric OPS, i.e. a Wzy-dependent pathway. In this work the biochemical activities of two enzymes involved in the NDP-sugar biosynthesis was established. Gne was determined to be a UDP-N-acetylglucosamine-4-epimerase catalyzing the conversion of UDP-GlcNAc to UDP-GalNAc and WbcP was shown to be a UDP-GlcNAc- 4,6-dehydratase catalyzing the reaction that converts UDP-GlcNAc to a rare UDP-2-acetamido- 2,6-dideoxy-d-xylo-hex-4-ulopyranose (UDP-Sugp). In this work, the linkage specificities and the order in which the different glycosyltransferases build up the OC onto the lipid carrier were also investigated. In addition, by using a site-directed mutagenesis approach the catalytically important amino acids of Gne and two of the characterized glycosyltranferases were identified. Also evidence to show the enzymes involved in the ligations of OC and OPS to the lipid A inner core was provided. The importance of the OC to the physiology of Y. enterocolitica O:3 was defined by determining the minimum requirements for the OC to be recognized by a bacteriophage, bacteriocin and monoclonal antibody. The biological importance of the rare keto sugar (Sugp) was also shown. As a conclusion this work provides an extensive overview of the biosynthesis of YeO3 OC as it provides a substantial amount of information of the stepwise and coordinated synthesis of the Ye O:3 OC hexasaccharide and detailed information of its properties as a receptor.

Stress testing and risk evaluation of new capacity payment algorithm proposed by Market Council

In the Russian Wholesale Market, electricity and capacity are traded separately. Capacity is a special good, the sale of which obliges suppliers to keep their generating equipment ready to produce the quantity of electricity indicated by the System Operator. The purpose of the formation of capacity trading was the maintenance of reliable and uninterrupted delivery of electricity in the wholesale market. The price of capacity reflects constant investments in construction, modernization and maintenance of power plants. So, the capacity sale creates favorable conditions to attract investments in the energy sector because it guarantees the investor that his investments will be returned.

DEVELOPMENT OF LOGIC IN INDIA: SIGNIFICANCE OF 'THE DUOLOGUE BETWEEN PĀYĀSI AND KASSAPA' ("LONG DISCOURSES")

ABSTRACT 'The Duologue of King/Governor Pāyāsi' ("Long Discourses") has long been recognised as a source for the proto-materialism current at the time of the Buddha. What needs to be stressed is the significance of the text as a pointer to the development of Logic in India. Perception (observation and experiment employing the joint method of agreement and difference), which is an accepted method of experimental enquiry, and reasoning from analogy, which can lead at best to a probable conclusion - these two are the only means employed to settle the dispute concerning the existence of the other-world. The Jain version of the same duologue-cum-parable, though varying in minor details regarding the name and identity of the monk refuting the king/governor, contains the same contrast, namely, perception versus analogical reasoning. There can be little doubt that the original parable was conceived with a view to asserting the existence of the other-world. In the Kaṭha Upaniṣad (sixth century BCE), an earlier Brahmanical text, however, instead of argument by analogy, verbal testimony (śabda) was invoked to settle the same point. Naciketas is assailed by doubt about the existence of a person after his or her death. The authority of Yama, the Pluto of Indian mythology, is invoked to convince him that the other-world does exist. Thus, the three parables taken together exhibit three means of knowledge in operation: verbal testimony and argument by analogy pitted against perception.

Remarks on an algebraic semantics for paraconsistent Nelson's logic

In the paper Busaniche and Cignoli (2009) we presented a quasivariety of commutative residuated lattices, called NPc-lattices, that serves as an algebraic semantics for paraconsistent Nelson's logic. In the present paper we show that NPc-lattices form a subvariety of the variety of commutative residuated lattices, we study congruences of NPc-lattices and some subvarieties of NPc-lattices.

Matrix- based logic for avoiding paradoxes and its paraconsistent alternative

The present article shows that there are consistent and decidable many- valued systems of propositional logic which satisfy two or all the three criteria for non- trivial inconsistent theories by da Costa (1974). The weaker one of these paraconsistent system is also able to avoid a series of paradoxes which come up when classical logic is applied to empirical sciences. These paraconsistent systems are based on a 6- valued system of propositional logic for avoiding difficulties in several domains of empirical science (Weingartner (2009)).

Solving Leontief Input-Output Model with Trapezoidal Fuzzy Numbers and Gauss-Seidel Algorithm

In this work a fuzzy linear system is used to solve Leontief input-output model with fuzzy entries. For solving this model, we assume that the consumption matrix from di erent sectors of the economy and demand are known. These assumptions heavily depend on the information obtained from the industries. Hence uncertainties are involved in this information. The aim of this work is to model these uncertainties and to address them by fuzzy entries such as fuzzy numbers and LR-type fuzzy numbers (triangular and trapezoidal). Fuzzy linear system has been developed using fuzzy data and it is solved using Gauss-Seidel algorithm. Numerical examples show the e ciency of this algorithm. The famous example from Prof. Leontief, where he solved the production levels for U.S. economy in 1958, is also further analyzed.

GAMS MINLP Solver comparisons and some improvements to the AlphaECP algorithm

I doktorsavhandlingen undersöks förmågan att lösa hos ett antal lösare för optimeringsproblem och ett antal svårigheter med att göra en rättvis lösarjämförelse avslöjas. Dessutom framläggs några förbättringar som utförts på en av lösarna som heter GAMS/AlphaECP. Optimering innebär, i det här sammanhanget, att finna den bästa möjliga lösningen på ett problem. Den undersökta klassen av problem kan karaktäriseras som svårlöst och förekommer inom ett flertal industriområden. Målet har varit att undersöka om det finns en lösare som är universellt snabbare och hittar lösningar med högre kvalitet än någon av de andra lösarna. Det kommersiella optimeringssystemet GAMS (General Algebraic Modeling System) och omfattande problembibliotek har använts för att jämföra lösare. Förbättringarna som presenterats har utförts på GAMS/AlphaECP lösaren som baserar sig på skärplansmetoden Extended Cutting Plane (ECP). ECP-metoden har utvecklats främst av professor Tapio Westerlund på Anläggnings- och systemteknik vid Åbo Akademi.

Kernel-Based Ranking. Methods for Learning and Performance Estimation

Machine learning provides tools for automated construction of predictive models in data intensive areas of engineering and science. The family of regularized kernel methods have in the recent years become one of the mainstream approaches to machine learning, due to a number of advantages the methods share. The approach provides theoretically well-founded solutions to the problems of under- and overfitting, allows learning from structured data, and has been empirically demonstrated to yield high predictive performance on a wide range of application domains. Historically, the problems of classification and regression have gained the majority of attention in the field. In this thesis we focus on another type of learning problem, that of learning to rank. In learning to rank, the aim is from a set of past observations to learn a ranking function that can order new objects according to how well they match some underlying criterion of goodness. As an important special case of the setting, we can recover the bipartite ranking problem, corresponding to maximizing the area under the ROC curve (AUC) in binary classification. Ranking applications appear in a large variety of settings, examples encountered in this thesis include document retrieval in web search, recommender systems, information extraction and automated parsing of natural language. We consider the pairwise approach to learning to rank, where ranking models are learned by minimizing the expected probability of ranking any two randomly drawn test examples incorrectly. The development of computationally efficient kernel methods, based on this approach, has in the past proven to be challenging. Moreover, it is not clear what techniques for estimating the predictive performance of learned models are the most reliable in the ranking setting, and how the techniques can be implemented efficiently. The contributions of this thesis are as follows. First, we develop RankRLS, a computationally efficient kernel method for learning to rank, that is based on minimizing a regularized pairwise least-squares loss. In addition to training methods, we introduce a variety of algorithms for tasks such as model selection, multi-output learning, and cross-validation, based on computational shortcuts from matrix algebra. Second, we improve the fastest known training method for the linear version of the RankSVM algorithm, which is one of the most well established methods for learning to rank. Third, we study the combination of the empirical kernel map and reduced set approximation, which allows the large-scale training of kernel machines using linear solvers, and propose computationally efficient solutions to cross-validation when using the approach. Next, we explore the problem of reliable cross-validation when using AUC as a performance criterion, through an extensive simulation study. We demonstrate that the proposed leave-pair-out cross-validation approach leads to more reliable performance estimation than commonly used alternative approaches. Finally, we present a case study on applying machine learning to information extraction from biomedical literature, which combines several of the approaches considered in the thesis. The thesis is divided into two parts. Part I provides the background for the research work and summarizes the most central results, Part II consists of the five original research articles that are the main contribution of this thesis.

Automation Concept for Electrically Excited LV Synchronous Motor: Implementation into AC500 Programmable Logic Environment

This bachelor’s thesis is a part of the research project realized in the summer 2011 in Lappeenranta University of Technology. The goal of the project was to develop an automation concept for controlling the electrically excited synchronous motor. Thesis concentrates on the implementation of the automation concept into the ABB’s AC500 programmable logic enviroment. The automation program was developed as a state machine with the ABB’s PS501 Control Builder software. For controlling the automation program is developed a fieldbus control and with CodeSys Visualization Tool a local control with control panel. The fieldbus control is done to correspond the ABB drives communication profile and the local control is implemented with a function block which feeds right control words into the statemachine. A field current control of the synchronous motor is realized as a method presented in doctoral thesis of Olli Pyrhönen (Pyrhönen 1998). The Method combines stator flux and torque based openloop control and power factor based feedback control.

Application of fuzzy logic for the evaluation of livestock slaughtering

The fuzzy logic admits infinite intermediate logical values between false and true. With this principle, it developed in this study a system based on fuzzy rules, which indicates the body mass index of ruminant animals in order to obtain the best time to slaughter. The controller developed has as input the variables weight and height, and as output a new body mass index, called Fuzzy Body Mass Index (Fuzzy BMI), which may serve as a detection system at the time of livestock slaughtering, comparing one another by the linguistic variables "Very Low", "Low", "Average ", "High" and "Very High". For demonstrating the use application of this fuzzy system, an analysis was made with 147 Nellore beeves to determine Fuzzy BMI values for each animal and indicate the location of body mass of any herd. The performance validation of the system was based on a statistical analysis using the Pearson correlation coefficient of 0.923, representing a high positive correlation, indicating that the proposed method is appropriate. Thus, this method allows the evaluation of the herd comparing each animal within the group, thus providing a quantitative method of farmer decision. It was concluded that this study established a computational method based on fuzzy logic that mimics part of human reasoning and interprets the body mass index of any bovine species and in any region of the country.

Software for calculation of reservoir active capacity with the sequent-peak algorithm

It is presented a software developed with Delphi programming language to compute the reservoir's annual regulated active storage, based on the sequent-peak algorithm. Mathematical models used for that purpose generally require extended hydrological series. Usually, the analysis of those series is performed with spreadsheets or graphical representations. Based on that, it was developed a software for calculation of reservoir active capacity. An example calculation is shown by 30-years (from 1977 to 2009) monthly mean flow historical data, from Corrente River, located at São Francisco River Basin, Brazil. As an additional tool, an interface was developed to manage water resources, helping to manipulate data and to point out information that it would be of interest to the user. Moreover, with that interface irrigation districts where water consumption is higher can be analyzed as a function of specific seasonal water demands situations. From a practical application, it is possible to conclude that the program provides the calculation originally proposed. It was designed to keep information organized and retrievable at any time, and to show simulation on seasonal water demands throughout the year, contributing with the elements of study concerning reservoir projects. This program, with its functionality, is an important tool for decision making in the water resources management.