Linear time algorithms for Abelian group isomorphism and related problems

We consider the problem of determining if two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. We present an O(n) algorithm that determines if two Abelian groups with n elements each are isomorphic. This improves upon the previous upper bound of O(n log n) [Narayan Vikas, An O(n) algorithm for Abelian p-group isomorphism and an O(n log n) algorithm for Abelian group isomorphism, J. Comput. System Sci. 53 (1996) 1-9] known for this problem. We solve a more general problem of computing the orders of all the elements of any group (not necessarily Abelian) of size n in O(n) time. Our algorithm for isomorphism testing of Abelian groups follows from this result. We use the property that our order finding algorithm works for any group to design a simple O(n) algorithm for testing whether a group of size n, described by its multiplication table, is nilpotent. We also give an O(n) algorithm for determining if a group of size n, described by its multiplication table, is Abelian. (C) 2007 Elsevier Inc. All rights reserved.

On the PAPR of cosets of linear codes

Employing an error control code is one of the techniques to reduce the Peak-to-Average Power Ratio (PAPR) in a Orthogonal Frequency Division Multiplexing system, a well known class of such codes being the cosets of Reed-Muller codes. In this paper, we consider the class of such coset-codes of arbitrary linear codes and present a method of doubling the size of such a code without increasing the PAPR, by combining two such binary coset-codes. We identify the conditions under which we can employ this doubling more than once with no marginal increase in the PAPR value. Given a PAPR and length, our method has enabled to get the best coset-code (in terms of the size). Also, we show that the PAPR information of the coset-codes of the extended codes is obtainable from the PAPR of the corresponding coset-codes of the parent code. We have also shown a special type of lengthening is useful in PAPR studies.

A new approach to the study of non-linear non-autonomous systems

In this paper, a new approach to the study of non-linear, non-autonomous systems is presented. The method outlined is based on the idea of solving the governing differential equations of order n by a process of successive reduction of their order. This is achieved by the use of “differential transformation functions”. The value of the technique presented in the study of problems arising in the field of non-linear mechanics and the like, is illustrated by means of suitable examples drawn from different fields such as vibrations, rigid body dynamics, etc.

Protein sequence design on the basis of topology optimization techniques -Using continuous modeling of discrete amino acid types

The notion of optimization is inherent in protein design. A long linear chain of twenty types of amino acid residues are known to fold to a 3-D conformation that minimizes the combined inter-residue energy interactions. There are two distinct protein design problems, viz. predicting the folded structure from a given sequence of amino acid monomers (folding problem) and determining a sequence for a given folded structure (inverse folding problem). These two problems have much similarity to engineering structural analysis and structural optimization problems respectively. In the folding problem, a protein chain with a given sequence folds to a conformation, called a native state, which has a unique global minimum energy value when compared to all other unfolded conformations. This involves a search in the conformation space. This is somewhat akin to the principle of minimum potential energy that determines the deformed static equilibrium configuration of an elastic structure of given topology, shape, and size that is subjected to certain boundary conditions. In the inverse-folding problem, one has to design a sequence with some objectives (having a specific feature of the folded structure, docking with another protein, etc.) and constraints (sequence being fixed in some portion, a particular composition of amino acid types, etc.) while obtaining a sequence that would fold to the desired conformation satisfying the criteria of folding. This requires a search in the sequence space. This is similar to structural optimization in the design-variable space wherein a certain feature of structural response is optimized subject to some constraints while satisfying the governing static or dynamic equilibrium equations. Based on this similarity, in this work we apply the topology optimization methods to protein design, discuss modeling issues and present some initial results.

Distributed nonlinear optimization algorithms for general network problems

There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.

Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems

In this paper, a novel genetic algorithm is developed by generating artificial chromosomes with probability control to solve the machine scheduling problems. Generating artificial chromosomes for Genetic Algorithm (ACGA) is closely related to Evolutionary Algorithms Based on Probabilistic Models (EAPM). The artificial chromosomes are generated by a probability model that extracts the gene information from current population. ACGA is considered as a hybrid algorithm because both the conventional genetic operators and a probability model are integrated. The ACGA proposed in this paper, further employs the ``evaporation concept'' applied in Ant Colony Optimization (ACO) to solve the permutation flowshop problem. The ``evaporation concept'' is used to reduce the effect of past experience and to explore new alternative solutions. In this paper, we propose three different methods for the probability of evaporation. This probability of evaporation is applied as soon as a job is assigned to a position in the permutation flowshop problem. Experimental results show that our ACGA with the evaporation concept gives better performance than some algorithms in the literature.

A New Liquid Level Sensor for Process-Control Applications

Many process-control systems are air-operated. In such an environment, it would be desirable and economical to use pneumatic sensors. Bubble-back pressure sensors perform quite satisfactorily, but in case of viscous inflammable and slurry-like liquids with a tendency to froth, this level sensor is inadequate. The method suggested in this paper utilizes a pneumatic capacitor, one boundary of which is formed by the liquid level, to modulate a fluid amplifier feedback oscillator. The absence of moving parts and economy obtained makes this method attractive for process-control applications. The system has been mathematically modeled and simulated on an IBM 360/44 digital computer. Experimental values compare fairly well with the theoretical results. For the range tested, the sensor is found to have a linear frequency variation with the liquid level Extended running in the laboratory shows that the system is very reliable. This system has been found insensitive to temperature variations of up to 15ðC.

A homotopy approach for stabilizing single-input systems with control structure constraints

A linear state feedback gain vector used in the control of a single input dynamical system may be constrained because of the way feedback is realized. Some examples of feedback realizations which impose constraints on the gain vector are: static output feedback, constant gain feedback for several operating points of a system, and two-controller feedback. We consider a general class of problems of stabilization of single input dynamical systems with such structural constraints and give a numerical method to solve them. Each of these problems is cast into a problem of solving a system of equalities and inequalities. In this formulation, the coefficients of the quadratic and linear factors of the closed-loop characteristic polynomial are the variables. To solve the system of equalities and inequalities, a continuous realization of the gradient projection method and a barrier method are used under the homotopy framework. Our method is illustrated with an example for each class of control structure constraint.

Integral method for the calculation of incompressible two-dimensional transitional boundary layers

The method proposed here considers the mean flow in the transition zone as a linear combination of the laminar and turbulent boundary layer in proportions determined by the transitional intermittency, the component flows being calculated by approximate integral methods. The intermittency distribution adopted takes into account the possibility of subtransitions within the zone in the presence of strong pressure gradients. A new nondimensional spot formation rate, whose value depends on the pressure gradient, is utilized to estimate the extent of the transition zone. Onset location is determined by a correlation that takes into account freestream turbulence and facility-specific residual disturbances in test data. Extensive comparisons with available experimental results in strong pressure gradients show that the proposed method performs at least as well as differential models, in many cases better, and is always faster.

Positional Consensus of Multi-Agent Systems Using Linear Programming Based Decentralized Control with Rectilinear Decision Domain

In this paper we develop a Linear Programming (LP) based decentralized algorithm for a group of multiple autonomous agents to achieve positional consensus. Each agent is capable of exchanging information about its position and orientation with other agents within their sensing region. The method is computationally feasible and easy to implement. Analytical results are presented. The effectiveness of the approach is illustrated with simulation results.

Linear dynamics and active control of an elastically supported travelling string

In this paper, the linear dynamics and active control of a string travelling with uniform velocity is presented. Discrete elastic supports are introduced along the length of the string. Finite element formulation is adopted to obtain the governing equations of motion. The velocity of translation introduces gyroscopic terms in the system equations. The effect of translation and the discrete elastic supports on the free vibration solution is studied. The solution is utilized in actively controlling the string vibrations due to an initial disturbance. The control, affected in modal space, is optimal with respect to a quadratic performance index. Numerical results are presented to demonstrate the effectiveness of the control strategy in regulating the travelling string vibrations.

Solving linear programming problems exactly

A linear programming problem in an inequality form having a bounded solution is solved error-free using an algorithm that sorts the inequalities, removes the redundant ones, and uses the p-adic arithmetic. (C) Elsevier Science Inc., 1997

Two-Parameter Uniformly Elliptic Sturm–Liouville Problems With Eigenparameter-Dependent Boundary Conditions

We consider the two-parameter Sturm–Liouville system $$ -y_1''+q_1y_1=(\lambda r_{11}+\mu r_{12})y_1\quad\text{on }[0,1], $$ with the boundary conditions $$ \frac{y_1'(0)}{y_1(0)}=\cot\alpha_1\quad\text{and}\quad\frac{y_1'(1)}{y_1(1)}=\frac{a_1\lambda+b_1}{c_1\lambda+d_1}, $$ and $$ -y_2''+q_2y_2=(\lambda r_{21}+\mu r_{22})y_2\quad\text{on }[0,1], $$ with the boundary conditions $$ \frac{y_2'(0)}{y_2(0)} =\cot\alpha_2\quad\text{and}\quad\frac{y_2'(1)}{y_2(1)}=\frac{a_2\mu+b_2}{c_2\mu+d_2}, $$ subject to the uniform-left-definite and uniform-ellipticity conditions; where $q_{i}$ and $r_{ij}$ are continuous real valued functions on $[0,1]$, the angle $\alpha_{i}$ is in $[0,\pi)$ and $a_{i}$, $b_{i}$, $c_{i}$, $d_{i}$ are real numbers with $\delta_{i}=a_{i}d_{i}-b_{i}c_{i}>0$ and $c_{i}\neq0$ for $i,j=1,2$. Results are given on asymptotics, oscillation of eigenfunctions and location of eigenvalues.

Right-Definite Multiparameter Sturm–Liouville Problems With Eigenparameter-Dependent Boundary Conditions

We study a system of ordinary differential equations linked by parameters and subject to boundary conditions depending on parameters. We assume certain definiteness conditions on the coefficient functions and on the boundary conditions that yield, in the corresponding abstract setting, a right-definite case. We give results on location of the eigenvalues and oscillation of the eigenfunctions.