A probabilistic constrained nonlinear optimization framework to optimize RED parameters

The random early detection (RED) technique has seen a lot of research over the years. However, the functional relationship between RED performance and its parameters viz,, queue weight (omega(q)), marking probability (max(p)), minimum threshold (min(th)) and maximum threshold (max(th)) is not analytically availa ble. In this paper, we formulate a probabilistic constrained optimization problem by assuming a nonlinear relationship between the RED average queue length and its parameters. This problem involves all the RED parameters as the variables of the optimization problem. We use the barrier and the penalty function approaches for its Solution. However (as above), the exact functional relationship between the barrier and penalty objective functions and the optimization variable is not known, but noisy samples of these are available for different parameter values. Thus, for obtaining the gradient and Hessian of the objective, we use certain recently developed simultaneous perturbation stochastic approximation (SPSA) based estimates of these. We propose two four-timescale stochastic approximation algorithms based oil certain modified second-order SPSA updates for finding the optimum RED parameters. We present the results of detailed simulation experiments conducted over different network topologies and network/traffic conditions/settings, comparing the performance of Our algorithms with variants of RED and a few other well known adaptive queue management (AQM) techniques discussed in the literature.

Determination of the magnetic moment by QCD sum rules

The magnetic moment of the Λ hyperon is calculated using the QCD sum-rule approach of Ioffe and Smilga. It is shown that μΛ has the structure μΛ=(2/3(eu+ed+4es)(eħ/2MΛc)(1+δΛ), where δΛ is small. In deriving the sum rules special attention is paid to the strange-quark mass-dependent terms and to several additional terms not considered in earlier works. These terms are now appropriately incorporated. The sum rule is analyzed using the ratio method. Using the external-field-induced susceptibilities determined earlier, we find that the calculated value of μΛ is in agreement with experiment.

Gluon-field contribution in QCD sum rules for the magnetic moments of the nucleons

The Wilson coefficient corresponding to the gluon-field strength GμνGμν is evaluated for the nucleon current correlation function in the presence of a static external electromagnetic field, using a regulator mass Λ to separate the high-momentum part of the Feynman diagrams. The magnetic-moment sum rules are analyzed by two different methods and the sensitivity of the results to variations in Λ are discussed.

A new analytical approach to optimize a generation schedule

Identification of the optimum generation schedule by various methods of coordinating incremental generation costs and incremental transmission losses has been described previously in the literature. This paper presents an analytical approach which reduces the time-consuming iterative procedure into a mere positive-root determination of a third-order polynomial in λ. This approach includes the effect of transmission losses and is suitable for systems with any number of plants. The validity and effectiveness of this method are demonstrated by analysing a sample system.

Determination of baryon magnetic moments from QCD sum rules

The magnetic moment μB of a baryon B with quark content (aab) is written as μB=4ea(1+δB)eħ/2cMB, where ea is the charge of the quark of flavor type a. The experimental values of δB have a simple pattern and have a natural explanation within QCD. Using the ratio method, the QCD sum rules are analyzed and the values of δB are computed. We find good agreement with data (≊10%) for the nucleons and the Σ multiplet while for the cascade the agreement is not as good. In our analysis we have incorporated additional terms in the operator-product expansion as compared to previous authors. We also clarify some points of disagreement between the previous authors. External-field-induced correlations describing the magnetic properties of the vacuum are estimated from the baryon magnetic-moment sum rules themselves as well as by independent spectral representations and the results are contrasted.

Mechanism of adsorption effects on electrode kinetics: Part I: Selection rules in the case of low coverage by molecular surfactants

It is shown that the effect of adsorption of inert molecules on electrode reaction rates is completely accounted for, by introducing into the rate equation, adsorption-induced changes in both the effective electrode area as well as in the electrostatic potential at the reaction site with an additional term for the noncoulombic interaction between the reactant and the adsorbate. The electrostatic potential at the reaction site due to the adsorbed layer is calculated using a model of discretely-distributed molecules in parallel orientation when adsorbed on the electrode with an allowance for thermal agitation. The resulting expression, which is valid for the limiting case of low coverages, is used to predict the types of molecular surfactants that are most likely to be useful for acceleration and inhibition of electrode reactions.

Temperature independent mixing rules to correlate the solubilities of antibiotics and anti-inflammatory drugs in SCCO2

The accurate experimental determination of the solubilities of antibiotics and anti-inflammatory drugs in supercritical fluids (SCFs) and correlations are essential for the development of supercritical technologies for the pharmaceuticals industry. In this work, the solubilities of penicillinG, penicillinV, flurbiprofen, ketoprofen, naproxen, ibuprofen, aspirin and diflunisal in supercritical carbon dioxide (SCCO2) were correlated using Peng-Robinson equation of state (PR EOS) with the modified Kwak and Mansoori mixing rules (mKM) and with Bartle model. The ability of mKM rules was compared against the conventional mixing rules of van der Waals in correlating the solubilities. In the present model, vapor pressure was considered as an adjustable parameter along with binary interactions parameters. In the proposed model, the constants used in the mixing rule, and vapor pressure expression coefficients are temperature independent. The optimization of these constants with experimental data gives binary interaction parameters along with vapor pressure correlations. Sublimation enthalpies were estimated with both the models compared with literature reported experimental values.

Generic Routing Rules and a Scalable Access Enhancement for the Network-on-Chip RECONNECT

RECONNECT is a Network-on-Chip using a honeycomb topology. In this paper we focus on properties of general rules applicable to a variety of routing algorithms for the NoC which take into account the missing links of the honeycomb topology when compared to a mesh. We also extend the original proposal [5] and show a method to insert and extract data to and from the network. Access Routers at the boundary of the execution fabric establish connections to multiple periphery modules and create a torus to decrease the node distances. Our approach is scalable and ensures homogeneity among the compute elements in the NoC. We synthesized and evaluated the proposed enhancement in terms of power dissipation and area. Our results indicate that the impact of necessary alterations to the fabric is negligible and effects the data transfer between the fabric and the periphery only marginally.

A Flat Concurrent Prolog compiler for PARAM

We describe a compiler for the Flat Concurrent Prolog language on a message passing multiprocessor architecture. This compiler permits symbolic and declarative programming in the syntax of Guarded Horn Rules, The implementation has been verified and tested on the 64-node PARAM parallel computer developed by C-DAC (Centre for the Development of Advanced Computing, India), Flat Concurrent Prolog (FCP) is a logic programming language designed for concurrent programming and parallel execution, It is a process oriented language, which embodies dataflow synchronization and guarded-command as its basic control mechanisms. An identical algorithm is executed on every processor in the network, We assume regular network topologies like mesh, ring, etc, Each node has a local memory, The algorithm comprises of two important parts: reduction and communication, The most difficult task is to integrate the solutions of problems that arise in the implementation in a coherent and efficient manner. We have tested the efficacy of the compiler on various benchmark problems of the ICOT project that have been reported in the recent book by Evan Tick, These problems include Quicksort, 8-queens, and Prime Number Generation, The results of the preliminary tests are favourable, We are currently examining issues like indexing and load balancing to further optimize our compiler.

Ising pyrochlore magnets: Low-temperature properties, "ice rules," and beyond

Pyrochlore magnets are candidates for what Harris et al. [Phys. Rev. Lett. 79, 2554 (1997)] call "spin-ice" behavior. We present theoretical simulations of relevance for the pyrochlore family R2Ti2O7 (R = rare earth) supported by magnetothermal measurements on selected systems. Ey considering long-ranged dipole-dipole as well as short-ranged superexchange interactions, we get three distinct behaviors: (i) an ordered doubly degenerate state, (ii) a highly disordered state with a broad transition to paramagnetism, and (iii) a partially ordered state with a sharp transition to paramagnetism. Closely corresponding behavior is seen in the real compounds.

Shear sum rules at finite chemical potential

We derive sum rules which constrain the spectral density corresponding to the retarded propagator of the T-xy component of the stress tensor for three gravitational duals. The shear sum rule is obtained for the gravitational dual of the N = 4 Yang-Mills, theory of the M2-branes and M5-branes all at finite chemical potential. We show that at finite chemical potential there are additional terms in the sum rule which involve the chemical potential. These modifications are shown to be due to the presence of scalars in the operator product expansion of the stress tensor which have non-trivial vacuum expectation values at finite chemical potential.

Reducing convergence times of self-propelled swarms via modified nearest neighbor rules

Vicsek et al. proposed a biologically inspired model of self-propelled particles, which is now commonly referred to as the Vicsek model. Recently, attention has been directed at modifying the Vicsek model so as to improve convergence properties. In this paper, we propose two modification of the Vicsek model which leads to significant improvements in convergence times. The modifications involve an additional term in the heading update rule which depends only on the current or the past states of the particle's neighbors. The variation in convergence properties as the parameters of these modified versions are changed are closely investigated. It is found that in both cases, there exists an optimal value of the parameter which reduces convergence times significantly and the system undergoes a phase transition as the value of the parameter is increased beyond this optimal value. (C) 2012 Elsevier B.V. All rights reserved.

Applying Genetic Algorithms to Optimize Power in Tiled SNUCA Chip Multicore Architectures

We propose a novel technique for reducing the power consumed by the on-chip cache in SNUCA chip multicore platform. This is achieved by what we call a "remap table", which maps accesses to the cache banks that are as close as possible to the cores, on which the processes are scheduled. With this technique, instead of using all the available cache, we use a portion of the cache and allocate lesser cache to the application. We formulate the problem as an energy-delay (ED) minimization problem and solve it offline using a scalable genetic algorithm approach. Our experiments show up to 40% of savings in the memory sub-system power consumption and 47% savings in energy-delay product (ED).

Applying Genetic Algorithms to Optimize Power in Tiled SNUCA Chip Multicore Architectures

We propose a novel technique for reducing the power consumed by the on-chip cache in SNUCA chip multicore platform. This is achieved by what we call a "remap table", which maps accesses to the cache banks that are as close as possible to the cores, on which the processes are scheduled. With this technique, instead of using all the available cache, we use a portion of the cache and allocate lesser cache to the application. We formulate the problem as an energy-delay (ED) minimization problem and solve it offline using a scalable genetic algorithm approach. Our experiments show up to 40% of savings in the memory sub-system power consumption and 47% savings in energy-delay product (ED).

Sum rules and three point functions

Sum rules constraining the R-current spectral densities are derived holographically for the case of D3-branes, M2-branes and M5-branes all at finite chemical potentials. In each of the cases the sum rule relates a certain integral of the spectral density over the frequency to terms which depend both on long distance physics, hydrodynamics and short distance physics of the theory. The terms which which depend on the short distance physics result from the presence of certain chiral primaries in the OPE of two it-currents which are turned on at finite chemical potential. Since these sum rules contain information of the OPE they provide an alternate method to obtain the structure constants of the two R-currents and the chiral primary. As a consistency check we show that the 3 point function derived from the sum rule precisely matches with that obtained using Witten diagrams.