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.

Protein-Protein Interactions in Clathrin Vesicular Assembly: Radial Distribution of Evolutionary Constraints in Interfaces

In eukaryotic organisms clathrin-coated vesicles are instrumental in the processes of endocytosis as well as intracellular protein trafficking. Hence, it is important to understand how these vesicles have evolved across eukaryotes, to carry cargo molecules of varied shapes and sizes. The intricate nature and functional diversity of the vesicles are maintained by numerous interacting protein partners of the vesicle system. However, to delineate functionally important residues participating in protein-protein interactions of the assembly is a daunting task as there are no high-resolution structures of the intact assembly available. The two cryoEM structures closely representing intact assembly were determined at very low resolution and provide positions of C alpha atoms alone. In the present study, using the method developed by us earlier, we predict the protein-protein interface residues in clathrin assembly, taking guidance from the available low-resolution structures. The conservation status of these interfaces when investigated across eukaryotes, revealed a radial distribution of evolutionary constraints, i.e., if the members of the clathrin vesicular assembly can be imagined to be arranged in spherical manner, the cargo being at the center and clathrins being at the periphery, the detailed phylogenetic analysis of these members of the assembly indicated high-residue variation in the members of the assembly closer to the cargo while high conservation was noted in clathrins and in other proteins at the periphery of the vesicle. This points to the strategy adopted by the nature to package diverse proteins but transport them through a highly conserved mechanism.

Constraints in relativistic Hamiltonian mechanics

We propose a new scheme for the use of constraints in setting up classical, Hamiltonian, relativistic, interacting particle theories. We show that it possesses both Poincaré invariance and invariance of world lines. We discuss the transition to the physical phase space and the nonrelativistic limit.

An Algorithm to Decide Feasibility of Linear Integer Constraints Occurrng in Decision Tables

Abstract-To detect errors in decision tables one needs to decide whether a given set of constraints is feasible or not. This paper describes an algorithm to do so when the constraints are linear in variables that take only integer values. Decision tables with such constraints occur frequently in business data processing and in nonnumeric applications. The aim of the algorithm is to exploit. the abundance of very simple constraints that occur in typical decision table contexts. Essentially, the algorithm is a backtrack procedure where the the solution space is pruned by using the set of simple constrains. After some simplications, the simple constraints are captured in an acyclic directed graph with weighted edges. Further, only those partial vectors are considered from extension which can be extended to assignments that will at least satisfy the simple constraints. This is how pruning of the solution space is achieved. For every partial assignment considered, the graph representation of the simple constraints provides a lower bound for each variable which is not yet assigned a value. These lower bounds play a vital role in the algorithm and they are obtained in an efficient manner by updating older lower bounds. Our present algorithm also incorporates an idea by which it can be checked whether or not an (m - 2)-ary vector can be extended to a solution vector of m components, thereby backtracking is reduced by one component.

Monoblock cylinder internally pressurised under asymmetric end constraints Some aspects of design

The finite element method is used to analyse stresses and displacements in a monoblock cylinder open at one end only. The cylinder is internally pressurised. The analysis shows that the minimum pressure required to cause yield in the cylinder decreases rapidly with increasing cylinder height until the height is about the same as the outer radius of the cylinder, beyond which the decrease is marginal. Introduction of a fillet at the internal corner enhances the design pressure substantially while a fillet at the outer corner affects this pressure only marginally.

Ionized Gas towards Galactic Centre-Constraints from Low-Frequency Recombination Lines

Observations of the H272α recombination line towards the galactic centre show features near VLSR= 0, -50 and + 36 kms-1 . We have combined the parameters of these features with the available -166 measurements to obtain the properties of the ionized gas present along the line of sight and also in the -3 kpc arm-. For the line-of-sight ionized gas we get an electron density around 7 cm-3 and a pathlength through it 10-60 pc. The emission measure and the electron temperature are in the range 500-2900 pc cm-6 and 2000-6000 - respectively. The ionized gas in the 3 kpc arm has an electron density of 30 cm-3 and extends over 9 pc along the line of sight if we assume an electron temperature of 104 K. Using the available upper limit to the intensity of the H351α recombination line, we show that the distributed ionized gas responsible for the dispersion of pulsar signals should have a temperature > 4500 - and a minimum filling factor of 20 per cent. We also show that recombination lines from the -warm ionized- gas proposed by McKee & Ostriker (1977) should be detectable in the frequency range 100-150 MHz towards the galactic centre with the sensitivity available at present.

New constraints on the pion EM form factor using Pi `(-Q(2))

We study the constraints arising on the expansion parameters c and d of the pion electromagnetic form factor from the inclusion of pure spacelike data and the phase of timelike data along with one spacelike datum, using as input the first derivative of the QCD polarization amplitude Pi'(-Q(2)). These constraints when combined with other analyses, provide a valuable check on a determination of c due to Guo et al. and on our previous work where pionic contribution to the (g - 2) of the muon was used as the input. This work further illustrates the power of analyticity techniques in form factor analysis.

Derivation of the decoupling relations for composite models from anomaly constraints and n-independence

It is shown, in the composite fermion models studied by 't Hooft and others, that the requirements of Adler-Bell-Jackiw anomaly matching and n-independence are sufficient to fix the indices of composite representations. The third requirement, namely that of decoupling relations, follows from these two constraints in such models and hence is inessential.

Aspects of tautomerism. 13. Alkaline hydrolysis of .gamma.-, .delta.-, and .epsilon.-keto esters and their desoxy analogs. Geometrical constraints on keto participation

The rates of alkaline hydrolysis of methyl &benzoylpropionate (I), methyl y-benzoylbutyrate (11) and methyll6-benzoylvalerate (In) decrease in the order I > I1 > III. Keto participation is the predominant pathway in the case of y-keto esters. Evidence has also been obtained for keto participation in the case of 6-keto esters, whereas no such evidence is available in the case of r-keto esters studied.

Structures of isopropylidene nucleoside derivatives - implications for ribose ring flexibility under external cyclic constraints

Crystal structures of six isopropylidene nucleoside derivatives are described. The results show that, under external cyclic constraints, the ribose assumes a variety of unusual conformations. In those compounds which possess a base-to-sugar cyclization through the C(4′) atom, the furanose pucker is predominantly C(4′)-endo, O(4′)-exo. The possible relevance of the sulphur geometry in two of the compounds to certain structural aspects of the action of the enzyme thymidylate synthetase is also pointed out.

Symmetries and constraints in generalized Hamiltonian dynamics

A general analysis of symmetries and constraints for singular Lagrangian systems is given. It is shown that symmetry transformations can be expressed as canonical transformations in phase space, even for such systems. The relation of symmetries to generators, constraints, commutators, and Dirac brackets is clarified.

Determination of optimal trajectory under design constraints for a satellite launch vehicle

An optimal pitch steering programme of a solid-fuel satellite launch vehicle to maximize either (1) the injection velocity at a given altitude, or (2) the size of circular orbit, for a given payload is presented. The two-dimensional model includes the rotation of atmosphere with the Earth, the vehicle's lift and drag, variation of thrust with time and altitude, inverse-square gravitational field, and the specified initial vertical take-off. The inequality constraints on the aerodynamic load, control force, and turning rates are also imposed. Using the properties of the central force motion the terminal constraint conditions at coast apogee are transferred to the penultimate stage burnout. Such a transformation converts a time-free problem into a time-fixed one, reduces the number of terminal constraints, improves accuracy, besides demanding less computer memory and time. The adjoint equations are developed in a compact matrix form. The problem is solved on an IBM 360/44 computer using a steepest ascent algorithm. An illustrative analysis of a typical launch vehicle establishes the speed of convergence, and accuracy and applicability of the algorithm.

Inferring neuronal network connectivity from spike data: A temporal data mining approach

Understanding the functioning of a neural system in terms of its underlying circuitry is an important problem in neuroscience. Recent d evelopments in electrophysiology and imaging allow one to simultaneously record activities of hundreds of neurons. Inferring the underlying neuronal connectivity patterns from such multi-neuronal spike train data streams is a challenging statistical and computational problem. This task involves finding significant temporal patterns from vast amounts of symbolic time series data. In this paper we show that the frequent episode mining methods from the field of temporal data mining can be very useful in this context. In the frequent episode discovery framework, the data is viewed as a sequence of events, each of which is characterized by an event type and its time of occurrence and episodes are certain types of temporal patterns in such data. Here we show that, using the set of discovered frequent episodes from multi-neuronal data, one can infer different types of connectivity patterns in the neural system that generated it. For this purpose, we introduce the notion of mining for frequent episodes under certain temporal constraints; the structure of these temporal constraints is motivated by the application. We present algorithms for discovering serial and parallel episodes under these temporal constraints. Through extensive simulation studies we demonstrate that these methods are useful for unearthing patterns of neuronal network connectivity.

Real-coded genetic algorithm for machining condition optimization

In this paper, we consider the machining condition optimization models presented in earlier studies. Finding the optimal combination of machining conditions within the constraints is a difficult task. Hence, in earlier studies standard optimization methods are used. The non-linear nature of the objective function, and the constraints that need to be satisfied makes it difficult to use the standard optimization methods for the solution. In this paper, we present a real coded genetic algorithm (RCGA), to find the optimal combination of machining conditions. We present various issues related to real coded genetic algorithm such as solution representation, crossover operators, and repair algorithm in detail. We also present the results obtained for these models using real coded genetic algorithm and discuss the advantages of using real coded genetic algorithm for these problems. From the results obtained, we conclude that real coded genetic algorithm is reliable and accurate for solving the machining condition optimization models.

Sequence design for symbol-asynchronous CDMA with power or rate constraints

Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound on the minimum sum-power required for a non-oversized system, based on the best achievable for a non-spread system, and an analogous upper bound on the sum rate are first summarised. Subsequently, an algorithm of Sundaresan and Padakandla is shown to achieve the lower bound on minimum sum power (upper bound on sum rate, respectively). Analogous to the synchronous case, by splitting oversized users in a system with processing gain N, a system with no oversized users is easily obtained, and the lower bound on sum power (upper bound on sum rate, respectively) is shown to be achieved by using N orthogonal sequences. The total number of splits is at most N - 1.