نتایج جستجو برای: potentially h

تعداد نتایج: 711730  

Journal: :IACR Cryptology ePrint Archive 2009
Craig Costello Tanja Lange Michael Naehrig

Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restrictive criterion but luckily constructions for pairing-friendly elliptic curves with such twists exist. In fact, Freeman, Scott and Teske showed in their overview paper that often the best known methods of constructing ...

2014
Jaco van de Pol Jozef Hooman Edwin de Jong

This paper presents an approach to formal requirements speci cation of embedded systems. The speci c demands of a speci cation for command and control systems are addressed. The proposed method allows various views of a system, like conventional methods. The added value lies in the fact that the relationship between the views is speci ed formally, and consistency between views can be analyzed f...

2017
Yan-Chang Ge Ai-Min Xue Kai-Jun Ma Yi-Wen Shen

Neonaticide is defined as killing of a newborn within the first 24 hours of life. Neonaticide happens globally. The characteristics and motives of Chinese neonaticide are unknown. This study is committed to outline Chinese neonaticide offenders’ characteristics and primary motives. Neonaticide cases in Shanghai Public Security Bureau (SPSB) were reviewed and analyzed. All offenders were domesti...

2001
Jirí Bittner Peter Wonka Michael Wimmer

We present an algorithm for visibility preprocessing of urban environments. The algorithm uses a subdivision of line space to analytically calculate a conservative potentially visible set for a given region in the scene. We present a detailed evaluation of our method including a comparison to another recently published visibility preprocessing algorithm. To the best of our knowledge the propose...

Journal: :Networks 2011
Bilal Khan Kiran R. Bhutani

In this paper, we describe how to construct physical computer network topologies which can support the establishment of overlays that reduce or increase the distances between nodes. Reducing pairwise distances (i.e., compression) implies that the overlay enjoys significantly lower inter-node latencies compared to the ambient physical network; such an overlay can be used to implement a “high-per...

2013
O. Meinander

We have measured spectral albedo, as well as ancillary parameters, of seasonal European Arctic snow at Sodankylä, Finland (6722 N, 2639 E). The springtime intensive melt period was observed during the Snow Reflectance Transition Experiment (SNORTEX) in April 2009. The upwelling and downwelling spectral irradiance, measured at 290–550 nm with a double monochromator spectroradiometer, revealed al...

1998
Shaz Qadeer

We present a detailed description of a machine-assisted veriication of an algorithm for self-stabilizing mutual exclusion that is due to Dijkstra Dij74]. This veriication was constructed using PVS. We compare the mechanical veriication to the informal proof sketch on which it is based. This comparison yields several observations regarding the challenges of formalizing and mechanically verifying...

Journal: :Medical image analysis 2002
Yasuyo Kita Eriko Tohno Ralph Highnam Michael Brady

A CAD system for estimating the 3D (three-dimensional) positions of lesions found in two mammographic views is described. The system is an extension of our previous method [Comput. Vis. Image Understand. 83 (2001) 38] which finds corresponding 2D positions in different mammographic views. The method calculates curved epipolar lines by developing a simulation of breast deformation into stereo ca...

1998
Jozef Hooman

We present a formal framework for the speciication and veriication of distributed real-time systems. To obtain mechanical support, this framework has been deened in the language of the proof checker PVS. Intermediate stages of the design are represented by mixed terms where speciications and programming constructs can be combined. Compositional proof rules allow the veriication of design steps....

2005
César A. Muñoz David R. Lester

Wouldn’t it be nice to be able to conveniently use ordinary real number expressions within proof assistants? In this paper we outline how this can be done within a theorem proving framework. First, we formally establish upper and lower bounds for trigonometric and transcendental functions. Then, based on these bounds, we develop a rational interval arithmetic where real number calculations can ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید