in this article, rubber bumpers of double - wishbone suspension system have been modeled and analyzed. the objective of the present work is to predict the performance of these products during deformation, represent an optimum method to design, obtain stiffness characteristic curves and utilize the results in the automotive suspension dynamic analysis. these parts are nonlinear and exhibit large...

Performance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem Zhi Li, John Higgins, Mark Clement 3361 TMCB Brigham Young University Provo, UT 84602 {zli,higgins,clement}@cs.byu.edu Abstract As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance bottleneck for ma...

Network is a collection of interconnected nodes which are spread over a large region. A node can be any device such as personal computer, mobile phone, tablet, WAP devices, pager, etc. Data is transmitted over channel of this network, which is prone to security threats such as loss of confidentiality, loss of integrity, fabrication attacks, etc. So, there is a need to secure this data transmiss...

We introduce the DET Curve as a means of representing performance on detection tasks that involve a tradeoff of error types. We discuss why we prefer it to the traditional ROC Curve and offer several examples of its use in speaker recognition and language recognition. We explain why it is likely to produce approximately linear curves. We also note special points that may be included on these cu...

This work proposes a processor architecture for elliptic curves cryptosystems over fields GF (2 m). This is a scalable architecture in terms of area and speed that exploits the abilities of reconfigurable hardware to deliver optimized circuitry for different elliptic curves and finite fields. The main features of this architecture are the use of an optimized bit-parallel squarer, a digit-serial...

In this paper we present a novel method for obtaining fast software implementation of the Elliptic Curve Digital Signature Algorithm in the finite field GF(p) with an arbitrary prime modulus p of arbitrary length. The most important feature of the method is that it avoids bit-level operations which are slow on microprocessors and performs word-level operations which are significantly faster. Th...

When designing a two-alternative classifier, one ordinarily aims to maximize the classifier’s ability to discriminate between members of the two classes. We describe a situation in a real-world business application of machine-learning prediction in which an additional constraint is placed on the nature of the solution: that the classifier achieve a specified correct acceptance or correct reject...

Very few data have been published that demonstrate the possible benefits to safety from advanced headlighting technologies on nighttime driving safety. By comparing insurance claim information for different vehicle models equipped with such systems, the Highway Loss Data Institute (HLDI) compared vehicles with and without adaptive curve lighting (ACL) systems. Overall, the HLDI data are consist...

This work proposes a processor architecture for elliptic curves cryptosystems over fields GF (2). This is a scalable architecture in terms of area and speed that exploits the abilities of reconfigurable hardware to deliver optimized circuitry for different elliptic curves and finite fields. The main features of this architecture are the use of an optimized bitparallel squarer, a digit-serial mu...