Ions in water: Role of attractive interactions in size dependent diffusivity maximum

A molecular dynamics study of model ions in water is reported. The van der Waals diameter of both the cations and anions is varied. We have carried out two sets of simulations-with and without dispersion interaction-between the ion and water. Self-diffusivity of the ions exhibits an anomalous maximum as a function of the van der Waals diameter for both these sets. This existence of a maximum in self-diffusivity when there is no dispersion interaction between the ion and the water is attributed to the attractive term from electrostatic interactions. Detailed analysis of this effect shows that the solvent shell is more strongly defined in the presence of dispersion interactions. A smaller ion exhibits biexponential decay while a single exponential decay is seen for the ion with maximum diffusivity in the self-part of the intermediate scattering function. The solvent structure around the ion appears to determine much of the dynamics of the ion. Interesting trends are seen in the activation energies and these can be understood in terms of the levitation effect. (C) 2010 American Institute of Physics. doi:10.1063/1.3481656]

Adaptive optimal load balancing in a nonhomogeneous multiserver system with a central job scheduler

A model comprising several servers, each equipped with its own queue and with possibly different service speeds, is considered. Each server receives a dedicated arrival stream of jobs; there is also a stream of generic jobs that arrive to a job scheduler and can be individually allocated to any of the servers. It is shown that if the arrival streams are all Poisson and all jobs have the same exponentially distributed service requirements, the probabilistic splitting of the generic stream that minimizes the average job response time is such that it balances the server idle times in a weighted least-squares sense, where the weighting coefficients are related to the service speeds of the servers. The corresponding result holds for nonexponentially distributed service times if the service speeds are all equal. This result is used to develop adaptive quasi-static algorithms for allocating jobs in the generic arrival stream when the load parameters are unknown. The algorithms utilize server idle-time measurements which are sent periodically to the central job scheduler. A model is developed for these measurements, and the result mentioned is used to cast the problem into one of finding a projection of the root of an affine function, when only noisy values of the function can be observed

Vehicle Routing Problem with Load Compatibility Constraints

The major contribution of this paper is to introduce load compatibility constraints in the mathematical model for the capacitated vehicle routing problem with pickup and deliveries. The employee transportation problem in the Indian call centers and transportation of hazardous materials provided the motivation for this variation. In this paper we develop a integer programming model for the vehicle routing problem with load compatibility constraints. Specifically two types of load compatability constraints are introduced, namely mutual exclusion and conditional exclusion. The model is demonstrated with an application from the employee transportation problem in the Indian call centers.

Occurrence of maximum Tc at an optimal carrier concentration in superconducting bismuth and thallium cuprates

The superconducting transition temperatures in Bi2Ca1−xLnxSr2Cu2O8+δ, TlCa1−xLnxSr2Cu2O6+δ, and Tl0.8Ca1−xLnxBa2Cu23O6+δ (Ln=Y or rare earth) vary with composition and show a maximum at a specific value of x or δ. This observation suggests that an optimal carrier concentration is required to attain maximum Tc in such cuprates which seem to be two‐band systems

The roles of nitrification and nitrate reduction pathways in nitrogen cycling of Baltic Sea

The Baltic Sea is one of the largest brackish water bodies in the world. Primary production in the Baltic Sea is limited by nitrogen (N) availability with the exception of river outlets and the northernmost phosphorus limited basin. The excess human induced N load from the drainage basin has caused severe eutrophication of the sea. The excess N loads can be mitigated by microbe mediated natural N removal processes that are found in the oxic-anoxic interfaces in sediments and water column redoxclines. Such interfaces allow the close coupling between the oxic nitrification process, and anoxic denitrification and anaerobic ammonium oxidation (anammox) processes that lead to the formation of molecular nitrogen gas. These processes are governed by various environmental parameters. The effects of these parameters on N processes were investigated in the northern Baltic Sea sediments. During summer months when the sediment organic content is at its highest, nitrification and denitrification reach their maximum rates. However, nitrification had no excess potential, which was probably because of high competition for molecular oxygen (O2) between heterotrophic and nitrification microbes. Subsequently, the limited nitrate (NO3-) availability inhibited denitrification. In fall, winter and spring, nitrification was limited by ammonium availability and denitrification limited by the availability of organic carbon and occasionally by NO3-. Anaerobic ammonium oxidation (anammox) was not an important N removal process in the northern Baltic Sea. Modeling studies suggest that when hypoxia expands in the Baltic Sea, N removal intensifies. However, the results of this study suggest the opposite because bottom water hypoxia (O2< 2 ml l-1) decreased the denitrification rates in sediments. Moreover, N was recycled by the dissimilatory nitrate reduction to ammonium (DNRA) process instead of being removed from the water ecosystem. High N removal potentials were found in the anoxic water column in the deep basins of the Baltic Proper. However, the N removal in the water column appeared to be limited by low substrate availability, because the water at the depths at which the substrate producing nitrification process occurred, rarely mix with the water at the depths at which N removal processes were found. Overall, the natural N removal capacity of the northern Baltic Sea decreased compared to values measured in mid 1990s and early 2000. The reason for this appears to be increasing hypoxia.

Effect of drainage basin characteristics on the diffuse load of phosphorus and nitrogen.

Tiivistelmä: Valuma-alueen vaikutus fosforin ja typen hajakuormitukseen.

Maximum-entropy calculation of the electron density at 4 A resolution of Pf1 filamentous bacteriophage

A 4 A electron-density map of Pf1 filamentous bacterial virus has been calculated from x-ray fiber diffraction data by using the maximum-entropy method. This method produces a map that is free of features due to noise in the data and enables incomplete isomorphous-derivative phase information to be supplemented by information about the nature of the solution. The map shows gently curved (banana-shaped) rods of density about 70 A long, oriented roughly parallel to the virion axis but slewing by about 1/6th turn while running from a radius of 28 A to one of 13 A. Within these rods, there is a helical periodicity with a pitch of 5 to 6 A. We interpret these rods to be the helical subunits of the virion. The position of strongly diffracted intensity on the x-ray fiber pattern shows that the basic helix of the virion is right handed and that neighboring nearly parallel protein helices cross one another in an unusual negative sense.

Load balancing algorithms for an extended hypercube

Reduction of the execution time of a job through equitable distribution of work load among the processors in a distributed system is the goal of load balancing. Performance of static and dynamic load balancing algorithms for the extended hypercube, is discussed. Threshold algorithms are very well-known algorithms for dynamic load balancing in distributed systems. An extension of the threshold algorithm, called the multilevel threshold algorithm, has been proposed. The hierarchical interconnection network of the extended hypercube is suitable for implementing the proposed algorithm. The new algorithm has been implemented on a transputer-based system and the performance of the algorithm for an extended hypercube is compared with those for mesh and binary hypercube networks

3-D Warping in Four-Bar Laminated Linkages

This paper deals with the evaluation of the component-laminate load-carrying capacity, i.e., to calculate the loads that cause the failure of the individual layers and the component-laminate as a whole in four-bar mechanism. The component-laminate load-carrying capacity is evaluated using the Tsai-Wu-Hahn failure criterion for various layups. The reserve factor of each ply in the component-laminate is calculated by using the maximum resultant force and the maximum resultant moment occurring at different time steps at the joints of the mechanism. Here, all component bars of the mechanism are made of fiber reinforced laminates and have thin rectangular cross-sections. They could, in general, be pre-twisted and/or possess initial curvature, either by design or by defect. They are linked to each other by means of revolute joints. We restrict ourselves to linear materials with small strains within each elastic body (beam). Each component of the mechanism is modeled as a beam based on geometrically nonlinear 3-D elasticity theory. The component problems are thus split into 2-D analyses of reference beam cross-sections and nonlinear 1-D analyses along the three beam reference curves. For the thin rectangular cross-sections considered here, the 2-D cross-sectional nonlinearity is also overwhelming. This can be perceived from the fact that such sections constitute a limiting case between thin-walled open and closed sections, thus inviting the nonlinear phenomena observed in both. The strong elastic couplings of anisotropic composite laminates complicate the model further. However, a powerful mathematical tool called the Variational Asymptotic Method (VAM) not only enables such a dimensional reduction, but also provides asymptotically correct analytical solutions to the nonlinear cross-sectional analysis. Such closed-form solutions are used here in conjunction with numerical techniques for the rest of the problem to predict more quickly and accurately than would otherwise be possible. Local 3-D stress, strain and displacement fields for representative sections in the component-bars are recovered, based on the stress resultants from the 1-D global beam analysis. A numerical example is presented which illustrates the failure of each component-laminate and the mechanism as a whole.

Stiffened composite cylindrical panels�Optimum lay-up for buckling by ranking

Buckling of discretely stiffened composite cylindrical panels made of repeated sublaminate construction is studied using a finite element method. In repeated sublaminate construction, a full laminate is obtained by repeating a basic sublaminate, which has a smaller number of plies. This paper deals with the determination of the optimum lay-up for buckling by ranking of such stiffened (longitudinal and hoop) composite cylindrical panels. For this purpose we use the particularized form of a four-noded, 48 degrees of freedom doubly curved quadrilateral thin shell finite element together with a fully compatible two-noded, 16 degrees of freedom composite stiffener element. The computer program developed has been used, after extensive checking for correctness, to obtain an optimum orientation scheme of the plies in the sublaminate so as to achieve maximum buckling load for a specified thickness of typical stiffened composite cylindrical panels.

Effect of Short Duration of Load increment on the Compressibility of Soils

This study concerns the effect of duration of load increment (up to 24 h) on the consolidation properties of expansive black cotton soil (liquid limit = 81%) and nonexpansive kaolinite (liquid limit = 49%). It indicates that the amount and rate of compression are not noticeably affected by the duration of loading for a standard sample of 25 mm in height and 76.2 mm in diameter with double drainage. Hence, the compression index and coefficient of consolidation can be obtained with reasonable accuracy even if the duration of each load increment is as short as 4 h. The secondary compression coefficient (C-alpha epsilon) for kaolinite can be obtained for any pressure range with 1/2 h of loading, which, however, requires 4 h for black cotton soil. This is because primary consolidation is completed early in the case of kaolinite. The paper proves that the conventional consolidation test can be carried out with much shorter duration of loading (less than 4 h) than the standard specification of 24 h or more even for remolded fine-grained soils.

Scheduling expression trees with reusable registers on delayed-load architectures

In this paper, we look at the problem of scheduling expression trees with reusable registers on delayed load architectures. Reusable registers come into the picture when the compiler has a data-flow analyzer which is able to estimate the extent of use of the registers. Earlier work considered the same problem without allowing for register variables. Subsequently, Venugopal considered non-reusable registers in the tree. We further extend these efforts to consider a much more general form of the tree. We describe an approximate algorithm for the problem. We formally prove that the code schedule produced by this algorithm will, in the worst case, generate one interlock and use just one more register than that used by the optimal schedule. Spilling is minimized. The approximate algorithm is simple and has linear complexity.

Learning the global maximum with parameterized learning automata

A feedforward network composed of units of teams of parameterized learning automata is considered as a model of a reinforcement teaming system. The internal state vector of each learning automaton is updated using an algorithm consisting of a gradient following term and a random perturbation term. It is shown that the algorithm weakly converges to a solution of the Langevin equation implying that the algorithm globally maximizes an appropriate function. The algorithm is decentralized, and the units do not have any information exchange during updating. Simulation results on common payoff games and pattern recognition problems show that reasonable rates of convergence can be obtained.