265 resultados para Efficient elliptic curve arithmetic
Resumo:
A unique code (called Hensel's code) is derived for a rational number by truncating its infinite p-adic expansion. The four basic arithmetic algorithms for these codes are described and their application to rational matrix computations is demonstrated by solving a system of linear equations exactly, using the Gaussian elimination procedure.
Resumo:
A finite element method for solving multidimensional population balance systems is proposed where the balance of fluid velocity, temperature and solute partial density is considered as a two-dimensional system and the balance of particle size distribution as a three-dimensional one. The method is based on a dimensional splitting into physical space and internal property variables. In addition, the operator splitting allows to decouple the equations for temperature, solute partial density and particle size distribution. Further, a nodal point based parallel finite element algorithm for multi-dimensional population balance systems is presented. The method is applied to study a crystallization process assuming, for simplicity, a size independent growth rate and neglecting agglomeration and breakage of particles. Simulations for different wall temperatures are performed to show the effect of cooling on the crystal growth. Although the method is described in detail only for the case of d=2 space and s=1 internal property variables it has the potential to be extendable to d+s variables, d=2, 3 and s >= 1. (C) 2011 Elsevier Ltd. All rights reserved.
Resumo:
In this paper, we propose an efficient source routing algorithm for unicast flows, which addresses the scalability problem associated with the basic source routing technique. Simulation results indicate that the proposed algorithm indeed helps in reducing the message overhead considerably, and at the same time it gives comparable performance in terms of resource utilization across a wide range of workloads.
Resumo:
Traffic Engineering has been the prime concern for Internet Service Providers (ISPs), with the main focus being minimization of over-utilization of network capacity even though additional capacity is available which is under-utilized, Furthermore, requirements of timely delivery of digitized audiovisual information raises a new challenge of finding a path meeting these requirements. This paper addresses the issue of (a) distributing load to achieve global efficiency in resource utilization. (b) Finding a path satisfying the real time requirements of, delay and bandwidth requested by the applications. In this paper we do a critical study of the link utilization that varies over time and determine the time interval during which the link occupancy remains constant across days. This information helps in pre-determining link utilization that is useful in balancing load in the network Finally, we run simulations that use a dynamic time interval for profiling traffic and show improvement in terms number of calls admitted/blocked.
Resumo:
In this paper, we analyze the throughput and energy efficiency performance of user datagram protocol (UDP) using linear, binary exponential, and geometric backoff algorithms at the link layer (LL) on point-to-point wireless fading links. Using a first-order Markov chain representation of the packet success/failure process on fading channels, we derive analytical expressions for throughput and energy efficiency of UDP/LL with and without LL backoff. The analytical results are verified through simulations. We also evaluate the mean delay and delay variation of voice packets and energy efficiency performance over a wireless link that uses UDP for transport of voice packets and the proposed backoff algorithms at the LL. We show that the proposed LL backoff algorithms achieve energy efficiency improvement of the order of 2-3 dB compared to LL with no backoff, without compromising much on the throughput and delay performance at the UDP layer. Such energy savings through protocol means will improve the battery life in wireless mobile terminals.
Resumo:
We introduce ToleRace, a runtime system that allows programs to detect and even tolerate asymmetric data races. Asymmetric races are race conditions where one thread correctly acquires and releases a lock for a shared variable while another thread improperly accesses the same variable. ToleRace provides approximate isolation in the critical sections of lock-based parallel programs by creating a local copy of each shared variable when entering a critical section, operating on the local copies, and propagating the appropriate copies upon leaving the critical section. We start by characterizing all possible interleavings that can cause races and precisely describe the effect of ToleRace in each case. Then, we study the theoretical aspects of an oracle that knows exactly what type of interleaving has occurred. Finally, we present software implementations of ToleRace and evaluate them on multithreaded applications from the SPLASH2 and PARSEC suites.
Resumo:
There exists a minimum in the Waring function, psi(T) = -d(ln p)/d(1/T), and in the Riedel function, alpha(T) = d(ln p)/d(In T), in the liquid-vapor coexistence curve for most fluids. By analyzing National Institute of Standards and Technology data for the molar enthalpy of vaporization and the compressibility variation at the liquid-vapor phase change of 105 fluids, we find that the temperatures of these minima are linearly correlated with the critical temperature, T-c. Using reduced coordinates, we also demonstrate that the minima are well-correlated with the acentric factor. These correlations are used for testing four well-known vapor pressure equations in the Pitzer corresponding states scheme.
Resumo:
We present reduced dimensionality (RD) 3D HN(CA)NH for efficient sequential assignment in proteins. The experiment correlates the N-15 and H-1 chemical shift of a residue ('i') with those of its immediate N-terminal (i - 1) and C-terminal (i + 1) neighbors and provides four-dimensional chemical shift correlations rapidly with high resolution. An assignment strategy is presented which combines the correlations observed in this experiment with amino acid type information obtained from 3D CBCA(CO)NH. By classifying the 20 amino acid types into seven distinct categories based on C-13(beta) chemical shifts, it is observed that a stretch of five sequentially connected residues is sufficient to map uniquely on to the polypeptide for sequence specific resonance assignments. This method is exemplified by application to three different systems: maltose binding protein (42 kDa), intrinsically disordered domain of insulin-like growth factor binding protein-2 and Ubiquitin. Fast data acquisition is demonstrated using longitudinal H-1 relaxation optimization. Overall, 3D HN(CA)NH is a powerful tool for high throughput resonance assignment, in particular for unfolded or intrinsically disordered polypeptides.
Resumo:
In this paper, we investigate a numerical method for the solution of an inverse problem of recovering lacking data on some part of the boundary of a domain from the Cauchy data on other part for a variable coefficient elliptic Cauchy problem. In the process, the Cauchy problem is transformed into the problem of solving a compact linear operator equation. As a remedy to the ill-posedness of the problem, we use a projection method which allows regularization solely by discretization. The discretization level plays the role of regularization parameter in the case of projection method. The balancing principle is used for the choice of an appropriate discretization level. Several numerical examples show that the method produces a stable good approximate solution.
Resumo:
In this article we study bases for projective monomial curves and the relationship between the basis and the set of generators for the defining ideal of the curve. We understand this relationship best for curves in P-3 and for curves defined by an arithmetic progression. We are able to prove that the latter are set theoretic complete intersections.
Resumo:
A novel approach for the synthesis of N-1 substituted thiohydantoin has been developed to give quantitative yields of the desired products. The efficient synthesis of bis-thiohydantoin derivative and bicyclothiohydantoin has extended scope and applicability of present method. Solvent-free conditions and very easy work-up procedure make the reaction convenient and eco-friendly. All the products were characterized by spectroscopic techniques and elemental analysis, and finally the structure of representative ;compound was also confirmed by X-ray crystallography. (C) 2012 Elsevier Ltd. All rights reserved.
Resumo:
An efficient methodology to oxidize benzylic and cinnamyl alcohols to their corresponding nitriles in excellent yields has been developed. This methodology employs DDQ as an oxidant and TMSN3 as a source of nitrogen in the presence of a catalytic amount of Cu(ClO4)(2)center dot 6H(2)O.
Resumo:
We demonstrate 30 times enhanced flux of relativistic electrons by a silicon nanowire coated target excited by 30 fs, 800 nm laser pulses at an intensity of 3 x 10(18) W cm(-2). A measurement of the megaampere electron current via induced megagauss magnetic field supports the enhancement feature observed in the electron energy spectrum. The relativistic electrons generated at the front of nanowire coated surface are shown to travel efficiently over 500 mu m in the insulating substrate. The enhanced hot electron temperature is explained using a simple model and is supported by recent simulations. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4729010]