Bounding Run-Times of Local Adiabatic Algorithms

A common trick for designing faster quantum adiabatic algorithms is to apply the adiabaticity condition locally at every instant. However it is often difficult to determine the instantaneous gap between the lowest two eigenvalues, which is an essential ingredient in the adiabaticity condition. In this paper we present a simple linear algebraic technique for obtaining a lower bound on the instantaneous gap even in such a situation. As an illustration, we investigate the adiabatic un-ordered search of van Dam et al. [17] and Roland and Cerf [15] when the non-zero entries of the diagonal final Hamiltonian are perturbed by a polynomial (in log N, where N is the length of the unordered list) amount. We use our technique to derive a bound on the running time of a local adiabatic schedule in terms of the minimum gap between the lowest two eigenvalues.

Architecture of Run-time Reconfigurable Channel Decoder

Modern wireline and wireless communication devices are multimode and multifunctional communication devices. In order to support multiple standards on a single platform, it is necessary to develop a reconfigurable architecture that can provide the required flexibility and performance. The Channel decoder is one of the most compute intensive and essential elements of any communication system. Most of the standards require a reconfigurable Channel decoder that is capable of performing Viterbi decoding and Turbo decoding. Furthermore, the Channel decoder needs to support different configurations of Viterbi and Turbo decoders. In this paper, we propose a reconfigurable Channel decoder that can be reconfigured for standards such as WCDMA, CDMA2000, IEEE802.11, DAB, DVB and GSM. Different parameters like code rate, constraint length, polynomials and truncation length can be configured to map any of the above mentioned standards. A multiprocessor approach has been followed to provide higher throughput and scalable power consumption in various configurations of the reconfigurable Viterbi decoder and Turbo decoder. We have proposed A Hybrid register exchange approach for multiprocessor architecture to minimize power consumption.

278. Studies on ass's milk: Composition

The total solids of samples of ass's milk ranged from 7·80 to 9·10, the solids-not-fat from 7·14 to 8·50, and the fat from 0·54 to 0·71%. The nitrogen distribution in ass's milk is: casein 39·5, albumin 35·0, globulin 2·7 and non-protein nitrogen 22·8% of the total nitrogen. Ass's milk contains: casein 0·70, albumin 0·62 and globulin 0·07%. The total protein content is 1·39%. Ass's milk is therefore characterized by a low casein, a low globulin and a high albumin content. The non-protein nitrogen consists of amino nitrogen 8·1, urea nitrogen 24·3 and uric acid 0·7 mg./100 ml. of milk. The urea content is twice that present in cow's milk. The mean chloride and lactose contents of the milk samples are 0·037 and 6·1% respectively. The average calcium and phosphorus content of ass's milk are 0·081 and 0·059% respectively. Half the calcium is ionic, and half is in colloidal form. The phosphorus distribution is: total acid soluble 84·0, acid soluble organic 38·5, easily hydrolysable ester 27·4, inorganic 46·0, and colloidal inorganic 23·0 % of the total phosphorus. The ratio of CaO: P2O5 is 1:1. 46 % of the total phosphorus is in ester form; this is high when compared with only 12 % in cow's milk; most of the phosphoric ester forms soluble barium salts, which is a distinguishing feature of ass's milk. The total sulphur content is 15·8 mg./100 ml. The fat has a penetrating odour and is coloured orange-yellow. It has an iodine value of about 86, which is much higher than that for human milk fat. The Reichert (9·5) and Kirschner values (5·7) are low. In general, the composition of ass's milk resembles that of human rather than of cow's milk.

Direct detection of Salmonella without pre-enrichment in milk, ice-cream and fruit juice by PCR against hilA gene

A novel PCR based assay was devised to specifically detect contamination of any Salmonella serovar in milk, fruit juice and ice-cream without pre-enrichment. This method utilizes primers against hilA gene which is conserved in all Salmonella serovars and absent from the close relatives of Salmonella. An optimized protocol, in terms time and money, is provided for the reduction of PCR contaminants from milk, ice-cream and juice through the use of routine laboratory chemicals. The simplicity, efficiency (time taken 3-4 h) and sensitivity (to about 5-10 CFU/ml) of this technique confers a unique advantage over other previously used time consuming detection techniques. This technique does not involve pre-enrichment of the samples or extensive sample processing, which was a pre-requisite in most of the other reported studies. Hence, this assay can be ideal for adoption, after further fine tuning, by food quality control for timely detection of Salmonella contamination as well as other food-borne pathogens (with species specific primers) in food especially milk, ice-cream and fruit juice. (C) 2011 Elsevier Ltd. All rights reserved.

Accelerating Numerical Linear Algebra Kernels on a Scalable Run Time Reconfigurable Platform

Numerical Linear Algebra (NLA) kernels are at the heart of all computational problems. These kernels require hardware acceleration for increased throughput. NLA Solvers for dense and sparse matrices differ in the way the matrices are stored and operated upon although they exhibit similar computational properties. While ASIC solutions for NLA Solvers can deliver high performance, they are not scalable, and hence are not commercially viable. In this paper, we show how NLA kernels can be accelerated on REDEFINE, a scalable runtime reconfigurable hardware platform. Compared to a software implementation, Direct Solver (Modified Faddeev's algorithm) on REDEFINE shows a 29X improvement on an average and Iterative Solver (Conjugate Gradient algorithm) shows a 15-20% improvement. We further show that solution on REDEFINE is scalable over larger problem sizes without any notable degradation in performance.

Apparatus and method for heat-run test on high-power PWM converters with low energy expenditure

Before installation, a voltage source converter is usually subjected to heat-run test to verify its thermal design and performance under load. For heat-run test, the converter needs to be operated at rated voltage and rated current for a substantial length of time. Hence, such tests consume huge amount of energy in case of high-power converters. Also, the capacities of the source and loads available in the research and development (R&D) centre or the production facility could be inadequate to conduct such tests. This paper proposes a method to conduct heat-run tests on high-power, pulse width modulated (PWM) converters with low energy consumption. The experimental set-up consists of the converter under test and another converter (of similar or higher rating), both connected in parallel on the ac side and open on the dc side. Vector-control or synchronous reference frame control is employed to control the converters such that one draws certain amount of reactive power and the other supplies the same; only the system losses are drawn from the mains. The performance of the controller is validated through simulation and experiments. Experimental results, pertaining to heat-run tests on a high-power PWM converter, are presented at power levels of 25 kVA to 150 kVA.

How to run a campaign: Optimal control of SIS and SIR information epidemics

Information spreading in a population can be modeled as an epidemic. Campaigners (e.g., election campaign managers, companies marketing products or movies) are interested in spreading a message by a given deadline, using limited resources. In this paper, we formulate the above situation as an optimal control problem and the solution (using Pontryagin's Maximum Principle) prescribes an optimal resource allocation over the time of the campaign. We consider two different scenarios-in the first, the campaigner can adjust a direct control (over time) which allows her to recruit individuals from the population (at some cost) to act as spreaders for the Susceptible-Infected-Susceptible (SIS) epidemic model. In the second case, we allow the campaigner to adjust the effective spreading rate by incentivizing the infected in the Susceptible-Infected-Recovered (SIR) model, in addition to the direct recruitment. We consider time varying information spreading rate in our formulation to model the changing interest level of individuals in the campaign, as the deadline is reached. In both the cases, we show the existence of a solution and its uniqueness for sufficiently small campaign deadlines. For the fixed spreading rate, we show the effectiveness of the optimal control strategy against the constant control strategy, a heuristic control strategy and no control. We show the sensitivity of the optimal control to the spreading rate profile when it is time varying. (C) 2014 Elsevier Inc. All rights reserved.

Light stop in the MSSM after LHC Run 1

The discovery of a Higgs boson with a mass of 126 GeV at the LHC when combined with the non-observation of new physics both in direct and indirect searches imposes strong constraints on supersymmetric models and in particular on the top squark sector. The experiments for direct detection of dark matter have provided with yet more constraints on the neutralino LSP mass and its interactions. After imposing limits from the Higgs, flavour and dark matter sectors, we examine the feasibility for a light stop in the context of the pMSSM, in light of current results for stop and other SUSY searches at the LHC. We only require that the neutralino dark matter explains a fraction of the cosmologically measured dark matter abundance. We find that a stop with mass below similar to 500 GeV is still allowed. We further study various probes of the light stop scenario that could be performed at the LHC Run-II either through direct searches for the light and heavy stop, or SUSY searches not currently available in simplified model results. Moreover we study the characteristics of heavy Higgs for the points in the parameter space allowed by all the available constraints and illustrate the region with large cross sections to fermionic or electroweakino channels. Finally we show that nearly all scenarios with a small stop-LSP mass difference will be tested by Xenon1T provided the NLSP is a chargino, thus probing a region hard to access at the LHC.