Location of concentrators in a computer communication network: a stochastic automation search method

The following problem is considered. Given the locations of the Central Processing Unit (ar;the terminals which have to communicate with it, to determine the number and locations of the concentrators and to assign the terminals to the concentrators in such a way that the total cost is minimized. There is alao a fixed cost associated with each concentrator. There is ail upper limit to the number of terminals which can be connected to a concentrator. The terminals can be connected directly to the CPU also In this paper it is assumed that the concentrators can bo located anywhere in the area A containing the CPU and the terminals. Then this becomes a multimodal optimization problem. In the proposed algorithm a stochastic automaton is used as a search device to locate the minimum of the multimodal cost function . The proposed algorithm involves the following. The area A containing the CPU and the terminals is divided into an arbitrary number of regions (say K). An approximate value for the number of concentrators is assumed (say m). The optimum number is determined by iteration later The m concentrators can be assigned to the K regions in (mk) ways (m > K) or (km) ways (K>m).(All possible assignments are feasible, i.e. a region can contain 0,1,…, to concentrators). Each possible assignment is assumed to represent a state of the stochastic variable structure automaton. To start with, all the states are assigned equal probabilities. At each stage of the search the automaton visits a state according to the current probability distribution. At each visit the automaton selects a 'point' inside that state with uniform probability. The cost associated with that point is calculated and the average cost of that state is updated. Then the probabilities of all the states are updated. The probabilities are taken to bo inversely proportional to the average cost of the states After a certain number of searches the search probabilities become stationary and the automaton visits a particular state again and again. Then the automaton is said to have converged to that state Then by conducting a local gradient search within that state the exact locations of the concentrators are determined This algorithm was applied to a set of test problems and the results were compared with those given by Cooper's (1964, 1967) EAC algorithm and on the average it was found that the proposed algorithm performs better.

Beatific Enjoyment in Scholastic Philosophy and Theology: 1240-1335

This dissertation examines the concept of beatific enjoyment (fruitio beatifica) in scholastic theology and philosophy in the thirteenth and early fourteenth century. The aim of the study is to explain what is enjoyment and to show why scholastic thinkers were interested in discussing it. The dissertation consists of five chapters. The first chapter deals with Aurelius Augustine's distinction between enjoyment and use and the place of enjoyment in the framework of Augustine's view of the passions and the human will. The first chapter also focuses upon the importance of Peter Lombard's Sentences for the transmission of Augustine's treatment of enjoyment in scholastic thought as well as upon Lombard's understanding of enjoyment. The second chapter treats thirteenth-century conceptions of the object and psychology of enjoyment. Material for this chapter is provided by the writings - mostly Sentences commentaries - of Alexander of Hales, Albert the Great, Bonaventure, Thomas Aquinas, Peter of Tarentaise, Robert Kilwardby, William de la Mare, Giles of Rome, and Richard of Middleton. The third chapter inspects early fourteenth-century views of the object and psychology of enjoyment. The fourth chapter focuses upon discussions of the enjoyment of the Holy Trinity. The fifth chapter discusses the contingency of beatific enjoyment. The main writers studied in the third, fourth and fifth chapters are John Duns Scotus, Peter Aureoli, Durandus of Saint Pourçain, William of Ockham, Walter Chatton, Robert Holcot, and Adam Wodeham. Historians of medieval intellectual history have emphasized the significance of the concept of beatific enjoyment for understanding the character and aims of scholastic theology and philosophy. The concept of beatific enjoyment was developed by Augustine on the basis of the insight that only God can satisfy our heart's desire. The possibility of satisfying this desire requires a right ordering of the human mind and a detachment of the will from the relative goals of earthly existence. Augustine placed this insight at the very foundation of the notion of Christian learning and education in his treatise On Christian Doctrine. Following Augustine, the twelfth-century scholastic theologian Peter Lombard made the concept of enjoyment the first topic in his plan of systematic theology. The official inclusion of Lombard's Sentences in the curriculum of theological studies in the early universities stimulated vigorous discussions of enjoyment. Enjoyment was understood as a volition and was analyzed in relation to cognition and other psychic features such as rest and pleasure. This study shows that early fourteenth-century authors deepened the analysis of enjoyment by concentrating upon the relationship between enjoyment and mental pleasure, the relationship between cognition and volition, and the relationship between the will and the beatific object (i.e., the Holy Trinity). The study also demonstrates the way in which the idea of enjoyment was affected by changes in the method of theological analysis - the application of Aristotelian logic in a Trinitarian context and the shift from virtue ethics to normative ethics.

Evolution of Social Behavior Through Interpopulation Selection

Under certain special conditions natural selection can be effective at the level of local populations, or demes. Such interpopulation selection will favor genotypes that reduce the probability of extinction of their parent population even at the cost of a lowered inclusive fitness. Such genotypes may be characterized by altruistic traits only in a viscous population, i.e., in a population in which neighbors tend to be closely related. In a non-viscous population the interpopulation selection will instead favor spiteful traits when the populations are susceptible to extinction through the overutilization of the habitat, and cooperative traits when it is the newly established populations that are in the greatest danger of extinction.

Cu2+-induced room temperature hydrogen release from ammonia borane

Mechanical stirring of ammonia borane with CuCl2 in the solid state resulted in the release of hydrogen at room temperature through the intermediacy of [NH4](+)[BCl4](-).

Numerical simulations of crack tip fields in polycrystalline plastic solids

In this paper, modes I and II crack tip fields in polycrystalline plastic solids are studied under plane strain, small scale yielding conditions. Two different initial textures of an Al–Mg alloy, viz., continuous cast AA5754 sheets in the recrystallized and cold rolled conditions, are considered. The former is nearly-isotropic, while the latter displays distinct anisotropy. Finite element simulations are performed by employing crystal plasticity constitutive equations along with a Taylor-type homogenization as well as by using the Hill quadratic yield theory. It is found that significant texture evolution occurs close to the notch tip which profoundly influences the stress and plastic strain distributions. Also, the cold rolling texture gives rise to higher magnitude of plastic strain near the tip.

Numerical simulations of crack tip fields in polycrystalline plastic solids

In this paper, modes I and II crack tip fields in polycrystalline plastic solids are studied under plane strain, small scale yielding conditions. Two different initial textures of an Al-Mg alloy, viz.,continuous cast AA5754 sheets in the recrystallized and cold rolled conditions, are considered. The former is nearly-isotropic, while the latter displays distinct anisotropy. Finite element simulations are performed by employing crystal plasticity constitutive equations along with a Taylor-type homogenization as well as by using the Hill quadratic yield theory. It is found that significant texture evolution occurs close to the notch tip which profoundly influences the stress and plastic strain distributions. Also, the cold rolling texture gives rise to higher magnitude of plastic strain near the tip. (C) 2010 Elsevier Ltd. All rights reserved.

An X-ray and neutron diffraction study of cation substituted TlSr2CuO5

The structures of TlSr(2−x)LaxCuO(5+δ), with x=0.5, 0.75 and 1, and Tl.5Pb0.5Sr2CuO(5+δ) have been examined with X-ray and neutron powder Rietveld refinement. They are isostructural (P4/mmm) with the corresponding thallium-barium cuprate having one Cu-O layer with Cu3+ ions in octahedral coordination with oxygen (structure type 1201). The influence of cation substitution and disorder on the structure and superconducting properties of these phases have been investigated. La3+ substitution for Sr2+ stabilises the structure and reduces Cu3+, permitting superconductivity, while Pb2+ substitution for Tl3+ only stabilises the structure, without reducing Cu3+.

Popular matchings with variable item copies

We consider the problem of matching people to items, where each person ranks a subset of items in an order of preference, possibly involving ties. There are several notions of optimality about how to best match a person to an item; in particular, popularity is a natural and appealing notion of optimality. A matching M* is popular if there is no matching M such that the number of people who prefer M to M* exceeds the number who prefer M* to M. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not admit popular matchings. This motivates the following extension of the popular matchings problem: Given a graph G = (A U 3, E) where A is the set of people and 2 is the set of items, and a list < c(1),...., c(vertical bar B vertical bar)> denoting upper bounds on the number of copies of each item, does there exist < x(1),...., x(vertical bar B vertical bar)> such that for each i, having x(i) copies of the i-th item, where 1 <= xi <= c(i), enables the resulting graph to admit a popular matching? In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c(i) is 1 or 2. We show a polynomial time algorithm for a variant of the above problem where the total increase in copies is bounded by an integer k. (C) 2011 Elsevier B.V. All rights reserved.

An approach to multi-temporal MODIS image analysis using image classification and segmentation

This paper discusses an approach for river mapping and flood evaluation based on multi-temporal time series analysis of satellite images utilizing pixel spectral information for image classification and region-based segmentation for extracting water-covered regions. Analysis of MODIS satellite images is applied in three stages: before flood, during flood and after flood. Water regions are extracted from the MODIS images using image classification (based on spectral information) and image segmentation (based on spatial information). Multi-temporal MODIS images from ``normal'' (non-flood) and flood time-periods are processed in two steps. In the first step, image classifiers such as Support Vector Machines (SVMs) and Artificial Neural Networks (ANNs) separate the image pixels into water and non-water groups based on their spectral features. The classified image is then segmented using spatial features of the water pixels to remove the misclassified water. From the results obtained, we evaluate the performance of the method and conclude that the use of image classification (SVM and ANN) and region-based image segmentation is an accurate and reliable approach for the extraction of water-covered regions. (c) 2012 COSPAR. Published by Elsevier Ltd. All rights reserved.

Pattern clustering using cooperative game theory

In this paper, we approach the classical problem of clustering using solution concepts from cooperative game theory such as Nucleolus and Shapley value. We formulate the problem of clustering as a characteristic form game and develop a novel algorithm DRAC (Density-Restricted Agglomerative Clustering) for clustering. With extensive experimentation on standard data sets, we compare the performance of DRAC with that of well known algorithms. We show an interesting result that four prominent solution concepts, Nucleolus, Shapley value, Gately point and \tau-value coincide for the defined characteristic form game. This vindicates the choice of the characteristic function of the clustering game and also provides strong intuitive foundation for our approach.

Polynomial time and parameterized approximation algorithms for boxicity

The boxicity (cubicity) of a graph G, denoted by box(G) (respectively cub(G)), is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (cubes) in ℝ k . The problem of computing boxicity (cubicity) is known to be inapproximable in polynomial time even for graph classes like bipartite, co-bipartite and split graphs, within an O(n 0.5 − ε ) factor for any ε > 0, unless NP = ZPP. We prove that if a graph G on n vertices has a clique on n − k vertices, then box(G) can be computed in time n22O(k2logk) . Using this fact, various FPT approximation algorithms for boxicity are derived. The parameter used is the vertex (or edge) edit distance of the input graph from certain graph families of bounded boxicity - like interval graphs and planar graphs. Using the same fact, we also derive an O(nloglogn√logn√) factor approximation algorithm for computing boxicity, which, to our knowledge, is the first o(n) factor approximation algorithm for the problem. We also present an FPT approximation algorithm for computing the cubicity of graphs, with vertex cover number as the parameter.