Genetic algorithm for satellite customer assignment

The problem of assigning customers to satellite channels is considered. Finding an optimal allocation of customers to satellite channels is a difficult combinatorial optimization problem and is shown to be NP-complete in an earlier study. We propose a genetic algorithm (GA) approach to search for the best/optimal assignment of customers to satellite channels. Various issues related to genetic algorithms such as solution representation, selection methods, genetic operators and repair of invalid solutions are presented. A comparison of this approach with the standard optimization method is presented to show the advantages of this approach in terms of computation time

Task assignment in a multiprocessor system

One of the key problems in the design of any incompletely connected multiprocessor system is to appropriately assign the set of tasks in a program to the Processing Elements (PEs) in the system. The task assignment problem has proven difficult both in theory and in practice. This paper presents a simple and efficient heuristic algorithm for assigning program tasks with precedence and communication constraints to the PEs in a Message-based Multiple-bus Multiprocessor System, M3, so that the total execution time for the program is minimized. The algorithm uses a cost function: “Minimum Distance and Parallel Transfer” to minimize the completion time. The effectiveness of the algorithm has been demonstrated by comparing the results with (i) the lower bound on the execution time of a program (task) graph and (ii) a random assignment.

cis-trans Enantiomerism in the Diels-Alder cycloadducts of 6-arylfulvenes with maleic anhydride: resolution of the exo adducts via the N-((1S)-1-(naphth-1-yl)ethyl)imide derivatives: assignment of the absolute configurations based on the crystal structure of an imide diastereomer

A new case of the uncommon cis-trans enantiomerism is presented. The titled anhydride adducts were prepared in good yields by the known reaction of three 6-arylfulvenes with maleic anhydride (aryl = phenyl, p-tolyl and p-anisyl). The exo adducts were converted to the corresponding imides by reaction with (1S)-1-(naphth-1-yl)ethylamine in similar to 80% yields, and the resulting diastereomeric imides separated by silica gel column chromatography. They were hydrolysed and recyclised to the chiral anhydrides, in `one-pot' with 10% NaOH-EtOH, followed by treatment with 2 M HCl, in similar to 40% yields. The titled anhydrides were thus obtained in homochiral form, in enantiomeric purities (generally) of similar to 90% as indicated by chiral HPLC. The chiral anhydrides were also converted to the corresponding imides (presumably stereospecifically), by treatment with ammonia solution in excellent yields. The crystal structure of one of the above diastereomeric imides (derived from 6-phenylfulvene) was determined, and based on the known (S)-configuration of the naphthylethylamine moiety, the `configurations' of the original anhydride adducts were assigned. (c) 2005 Elsevier Ltd. All rights reserved.

Assignment of Fundamental Vibrations of Hydrazo Derivatives. Carbohydrazide and Diprotonated Carbohydrazide

The Infrared spectra of carbohydrazide, diprotonated carbohydrazide and their deuterated compounds have been measured in the solid state. From the results on thio- and selenocarbohydrazides and other related molecules and normal coordinate analyses using a Urey-Bradley force field assignments of the fundamental vibrational frequencies and a description of the normal modes of carbohydrazide, diprotonated carbohydrazide and their deuterated species are given.

Neural network approach for the two-dimensional assignment problem

A neural network approach for solving the two-dimensional assignment problem is proposed. The design of the neural network is discussed and simulation results are presented. The neural network obtains 10-15% lower cost placements on the examples considered, than the adjacent pairwise exchange method.

A non-cooperative game-theoretic approach to channel assignment in multi-channel multi-radio wireless networks

Channel assignment in multi-channel multi-radio wireless networks poses a significant challenge due to scarcity of number of channels available in the wireless spectrum. Further, additional care has to be taken to consider the interference characteristics of the nodes in the network especially when nodes are in different collision domains. This work views the problem of channel assignment in multi-channel multi-radio networks with multiple collision domains as a non-cooperative game where the objective of the players is to maximize their individual utility by minimizing its interference. Necessary and sufficient conditions are derived for the channel assignment to be a Nash Equilibrium (NE) and efficiency of the NE is analyzed by deriving the lower bound of the price of anarchy of this game. A new fairness measure in multiple collision domain context is proposed and necessary and sufficient conditions for NE outcomes to be fair are derived. The equilibrium conditions are then applied to solve the channel assignment problem by proposing three algorithms, based on perfect/imperfect information, which rely on explicit communication between the players for arriving at an NE. A no-regret learning algorithm known as Freund and Schapire Informed algorithm, which has an additional advantage of low overhead in terms of information exchange, is proposed and its convergence to the stabilizing outcomes is studied. New performance metrics are proposed and extensive simulations are done using Matlab to obtain a thorough understanding of the performance of these algorithms on various topologies with respect to these metrics. It was observed that the algorithms proposed were able to achieve good convergence to NE resulting in efficient channel assignment strategies.

Matrix method for eigenstructure assignment - The multi-input case with application

The eigenvalue and eigenstructure assignment procedure has found application in a wide variety of control problems. In this paper a method for assigning eigenstructure to a linear time invariant multi-input system is proposed. The algorithm determines a matrix that has eigenvalues and eigenvectors at the desired locations. It is obtained from the knowledge of the open-loop system and the desired eigenstructure. Solution of the matrix equation, involving unknown controller gams, open-loop system matrices, and desired eigenvalues and eigenvectors, results hi the state feedback controller. The proposed algorithm requires the closed-loop eigenvalues to be different from those of the open-loop case. This apparent constraint can easily be overcome by a negligible shift in the values. Application of the procedure is illustrated through the offset control of a satellite supported, from an orbiting platform, by a flexible tether.

Matrix method for eigenvalue assignment: The single input case

The eigenvalue assignment/pole placement procedure has found application in a wide variety of control problems. The associated literature is rather extensive with a number of techniques discussed to that end. In this paper a method for assigning eigenvalues to a Linear Time Invariant (LTI) single input system is proposed. The algorithm determines a matrix, which has eigenvalues at the desired locations. It is obtained from the knowledge of the open-loop system and the desired eigenvalues. Solution of the matrix equation, involving unknown controller gains, open-loop system matrices and desired eigenvalues, results in the state feedback controller. The proposed algorithm requires the closed-loop eigenvalues to be different from those of the open-loop case. This apparent constraint is easily overcome by a negligible shift in the values. Two examples are considered to verify the proposed algorithm. The first one pertains to the in-plane libration of a Tethered Satellite System (TSS) while the second is concerned with control of the short period dynamics of a flexible airplane. Finally, the method is extended to determine the Controllability Grammian, corresponding to the specified closed-loop eigenvalues, without computing the controller gains.

Matrix method for eigenstructure assignment - The multi-input case with application

The eigenvalue and eigenstructure assignment procedure has found application in a wide variety of control problems. In this paper a method for assigning eigenstructure to a Linear time invariant multi-input system is proposed. The algorithm determines a matrix that has eigenvalues and eigenvectors at the desired locations. It is obtained from the knowledge of the open-loop system and the desired eigenstructure. solution of the matrix equation, involving unknown controller gains, open-loop system matrices, and desired eigenvalues and eigenvectors, results in the state feedback controller. The proposed algorithm requires the closed-loop eigenvalues to be different from those of the open-loop case. This apparent constraint can easily be overcome by a negligible shift in the values. Application of the procedure is illustrated through the offset control of a satellite supported, from an orbiting platform, by a flexible tether,

Matrix method for eigenvalue assignment: The single input case

The eigenvalue assignment/pole placement procedure has found application in a wide variety of control problems. The associated literature is rather extensive with a number of techniques discussed to that end. In this paper a method for assigning eigenvalues to a Linear Time Invariant (LTI) single input system is proposed. The algorithm determines a matrix, which has eigenvalues at the desired locations. It is obtained from the knowledge of the open-loop system and the desired eigenvalues. Solution of the matrix equation, involving unknown controller gains, open-loop system matrices and desired eigenvalues, results in the state feedback controller. The proposed algorithm requires the closed-loop eigenvalues to be different from those of the open-loop case. This apparent constraint is easily overcome by a negligible shift in the values. Two examples are considered to verify the proposed algorithm. The first one pertains to the in-plane libration of a Tethered Satellite System (TSS) while the second is concerned with control of the short period dynamics of a flexible airplane. Finally, the method is extended to determine the Controllability Grammian, corresponding to the specified closed-loop eigenvalues, without computing the controller gains.

Spin-Selective Correlation Experiment for Measurement of Long-Range J Couplings and for Assignment of (R/S) Enantiomers from the Residual Dipolar Couplings and DFT

We report the C-HETSERF experiment for determination of long- and short-range homo- and heteronuclear scalar couplings ((n)J(HH) and (n)J(XH), n >= 1) of organic molecules with a low sensitivity dilute heteronucleus in natural abundance. The method finds significant advantage in measurement of relative signs of long-range heteronuclear total couplings in chiral organic liquid crystal. The advantage of the method is demonstrated for the measurement of residual dipolar couplings (RDCs) in enantiomers oriented in the chiral liquid crystal with a focus to unambiguously assign R/S designation in a 2D spectrum. The alignment tensor calculated from the experimental RDCs and with the computed structures of enantiomers obtained by DFT calculations provides the size of the back-calculated RDCs. Smaller root-mean-square deviations (rmsd) between experimental and calculated RDCs indicate better agreement with the input structure and its correct designation of the stereogenic center.

Redistribution Mechanisms for Assignment of Heterogeneous Objects

There are p heterogeneous objects to be assigned to n competing agents (n > p) each with unit demand. It is required to design a Groves mechanism for this assignment problem satisfying weak budget balance, individual rationality, and minimizing the budget imbalance. This calls for designing an appropriate rebate function. When the objects are identical, this problem has been solved which we refer as WCO mechanism. We measure the performance of such mechanisms by the redistribution index. We first prove an impossibility theorem which rules out linear rebate functions with non-zero redistribution index in heterogeneous object assignment. Motivated by this theorem,we explore two approaches to get around this impossibility. In the first approach, we show that linear rebate functions with non-zero redistribution index are possible when the valuations for the objects have a certain type of relationship and we design a mechanism with linear rebate function that is worst case optimal. In the second approach, we show that rebate functions with non-zero efficiency are possible if linearity is relaxed. We extend the rebate functions of the WCO mechanism to heterogeneous objects assignment and conjecture them to be worst case optimal.

Enantiospecific first total synthesis and assignment of absolute configuration of the sesquiterpene (-)-cucumin H

The first total synthesis of the sesquiterpene (-)-cucumin H, a linear triquinane isolated from Macrocystidia cucumis, has been accomplished starting from (R)-limonene employing two different cyclopentannulation methodologies, which in addition to confirming the structure also established the absolute configuration of the natural product.