نتایج جستجو برای: time constant

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

Journal: :Physiological measurement 2008
Jiun-Yan Wu Amit J Nimunkar Hongyu Sun Ann O'Rourke Shane Huebner James A Will John G Webster

The strength-duration curve for cardiac excitation can be modeled by a parallel resistor-capacitor circuit that has a time constant. Experiments on six pigs were performed by delivering current from the X26 Taser dart at a distance from the heart to cause ventricular fibrillation (VF). The X26 Taser is an electromuscular incapacitation device (EMD), which generates about 50 kV and delivers a pu...

2013
René Weller Udo Frese Gabriel Zachmann

We prove that the maximum number of intersecting pairs spheres between two sets of polydisperse sphere packings is linear in the worst case. This observation is the basis for a new collision detection algorithm. Our new approach guarantees a linear worst case running time for arbitrary 3D objects. Additionally, we present a parallelization of our new algorithm that runs in constant time, even i...

Journal: :Theor. Comput. Sci. 2011
Dany Breslauer Roberto Grossi Filippo Mignosi

We use a simple observation about the locations of critical factorizations to derive a real-time variation of the Crochemore-Perrin constant-space string matching algorithm. The real-time variation has a simple and efficient control structure.

2001
Joss Knight Andrew J. Davison Ian D. Reid

Many recent approaches to Simultaneous Localisation and Mapping (SLAM) use an Extended Kalman Filter (EKF) to update and maintain a map of vehicle location and multiple feature positions as a sensor moves through a scene. Although it is a highly powerful and well-used tool, it suffers from a well-known complexity problem, that the amount of computation at each recursion step is proportional to ...

Journal: :SIAM J. Comput. 2001
Joe Sawada

A bracelet is the lexicographically smallest element in an equivalence class of strings under string rotation and reversal. We present a fast, simple, recursive algorithm for generating (i.e., listing) k-ary bracelets. Using simple bounding techniques, we prove that the algorithm is optimal in the sense that the running time is proportional to the number of bracelets produced. This is an improv...

2015
Ran Cohen

In the setting of secure multiparty computation, a set of mutually distrusting parties wish to securely compute a joint function. It is well known that if the communication model is asynchronous, meaning that messages can be arbitrarily delayed by an unbounded (yet finite) amount of time, secure computation is feasible if and only if at least two-thirds of the parties are honest, as was shown b...

2002
Fernando R. Sousa

The evaluation of response time of a constant temperature thermoresistive sensor based feedback circuit, excited by a pulsewidth modulated (PWM) waveform is done by a way of simulation studies in PSPICE environment and compared with that of a circuit excited by an analog voltage (continuous time domain). For a thermoresistive sensor with an intrinsic time constant much larger than the period of...

Journal: :SIAM J. Comput. 1986
Robert Alan Wright L. Bruce Richmond Andrew M. Odlyzko Brendan D. McKay

An algorithm of Beyer and Hedetniemi for generating unlabeled rooted trees is extended to generate unlabeled free trees. Abstract An algorithm of Beyer and Hedetniemi for generating unlabeled rooted trees is extended to generate unlabeled free trees. “The Beyer-Hedetniemi technique is refined to produce only one member of each equivalence class of rooted trees under isomorphism of the underlyin...

1998
LUIS O. PIMENTEL

The effect of a time dependent cosmological constant is considered in a family of scalartensor theories. FriedmannRobertsonWalker cosmological models for vacuum and perfect fluid matter are found. They have a linear expansion factor, the so called coasting cosmology, the gravitational ”constant” decreases inversely with time; that is these models satisfy the Dirac Hypotheses. The cosmological ”...

2015
Yuranan Kitrungrotsakul Prabhas Chongstitvatana

Floating point unit is commonly used in computers. However, the arithmetic logic unit (ALU) for floating point operations such as addition or subtraction is complicated. Moreover, many floating point ALUs are designed to operate in many clock cycles. Thus, its speed are varied depend on the number of clock cycle. However, in many field, circuits with fix delay time are preferred. This work prop...

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

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