N. Dumitru, R. Nouta - Delft University(Correct)
different modes of switching, one for relatively fast input slope and other for relatively slow input donau.et.tudelft.nl/pub/dumitru/Prag96.ps.gz
Topic Detection and Tracking Pilot Study - Allan, Carbonell, Doddington.. (1998)(Correct)(3 citations)
of the HMM implementation is that it is very fast. Training time is approximately 15 minutes on the
work can be extended, improved, and made more practical. There is current work going on at CMU to build
(namely Carter in Bosnia and Serbs violate Bihac)Nonetheless, the assumption that each story discusses www.cs.cmu.edu/~yiming/papers.yy/tdt1-final-report.ps
Modified Maurer-Yacobi's scheme and its applications - Lim, Lee (1993)(Correct)
size, the elliptic curve method [L]and the fastest known algorithm for computing discrete
we maintain that it is more efficient and practical to take a certificate-based scheme on which all
a composite number which enables an identity-based non-interactive key distribution system. In this wooly.postech.ac.kr/library/papers/chlim/publications/aus92.ps
Limited Logical Belief Analysis - Moreno, Sales (1996)(Correct)
belief analysis"Workshop on Theoretical and Practical Foundations of Intelligent Agents, at
due to the agent's deductive power. It is shown how non-perfect reasoning can be modelled in two ways: on www.etse.urv.es/recerca/banzai/toni/articles/pricai96.ps
Concurrent Programming in ERLANG - Second Edition - Armstrong, al. (1996)(Correct)(1 citation)
half the storage of lists and have much faster access. Lists should be used when the problem
identifier (Pid)In some cases this is neither practical nor desirable: for example, in a large system
3 Also called write-once variables or non-destructive assignment. Acknowledgments The heaven.oeh.univie.ac.at/www.erlang.org/download/erlang-book-part1.ps.gz
A Hybrid Approach to Formal Verification Applied to an ATM.. - Clarke, Lee (1996)(Correct)
representing all possible behaviors) also has practical advantages. When testing individual behaviors,
their worth in their roles as passive assistants in non-critical tasks, computers are increasingly being
\Theta 2 switching elements are the basic building block of the Sunshine network. The processes shown in ftp.cis.upenn.edu/pub/rtg/BKUP/atm.ps.Z
Constraints on Synchronizing Oscillator Networks - David Cairns (1993)(Correct)(1 citation)
the most basic phase response one can obtain from a non-linear system [App. A.1]As an example of models
Following observations of oscillations and synchronization behaviour in cat visual cortex (Eckhorn et
that a possible interpretation of the observed synchronization behaviour is that the brain could be using www.biols.susx.ac.uk/Home/Roland_Baddeley/phase.ps.Z
Characterization of Contention in Real Relational Databases - Singhal, Smith (1994)(Correct)
2.3 Index locks Index locks (used to provide fast access to data) also have to be locked to maintain
Review, 13(2)Apr. 1979. 6] W. J. Conover. PracticalNonparametric Statistics. John Wiley &Sons,
between applications of lock types, two-phase vs. non-twophase locking, when locks are held and ic.eecs.berkeley.edu/pub/Memos_ERL/csd94-801.ps.Z
Hybrid Instruction Cache Partitioning for.. - Busquets-Mataix..(Correct)
with on-chip caches. These caches are extremely fast on a hit, which produces a large difference
theory has been extensively extended to meet practical requirements [2]Two solutions can be used to
restricts the application of such tools to non preemptive scheduling policies like cyclic archi.snu.ac.kr/skkim/paper/busque-euro97.ps.gz
A Formal Model of Several Fundamental VHDL Concepts - Goldschlag (1994)(Correct)
several extensions to VHDL are proposed, including nondeterministic assignments and unbounded
in VHDL including the semantics of individual concurrent statements, and groups of those statements, www.itd.nrl.navy.mil/ITD/5540/publications/CHACS/1994/1994goldschlag-compassmd94.ps
Tripod Operators for the Interpretation of Range Images - Pipitone (1991)(Correct)
area has led to the development of increasingly fast and accurate rangefinders [6] and to a variety of
and grouping, since they are crucial in any practical object recognition system. The problem now is
,p 2 ,and p 3 are not colinear, since fixing three noncolinear points belonging to a rigid object www.aic.nrl.navy.mil/papers/1991/AIC-91-034.ps.Z
Fast VLSI Binary Addition - Parhi(Correct) Fast Vlsi Binary Addition Keshab K. Parhi Dept. Of
of carry signal for inputs 1 and 0 followed by block multiplexing operation. Note that 8-bit carry www.ee.umn.edu/groups/ddp/dig_ser/../Publications/parhi/parhiuk.ps
REDUCE: a prototypical cooperative editing system - Chengzheng Sun (1997)(Correct)
which it was originally generated, regardless the nondeterministic latency of communications and
RSH or UIH-I) is active inside the RE, this RSH is blocked until the active thread leaves the RE. Then,
collaboration -multiple users may concurrently and freely edit any parts of the document at www.cit.gu.edu.au/~scz/papers/hci97.ps.Z
Concurrency and Recovery in Generalized Search Trees - Kornacker, Mohan, Hellerstein (1997)(Correct)(12 citations)
applications. A key feature of these systems is fast, index-based access to the data as well as support
to more general tree structures. We also address practical issues such as support for unique indices and
being able to store and access non-traditional datatypes such as images, audio and wuarchive.wustl.edu/packages/postgres/papers/sigmod97-gist.ps.Z
Multithreaded approach for dynamic load balancing of parallel.. - Chrisochoides(Correct)
[16] D. Keppel, Tools and techniques for building fast portable threads packages, University of
computations we address in this paper we need non-preemptive scheduling of the threads (i.e.
one of the following states: new, ready, running, blocked, dead. The state of a thread is defined by its ftp.npac.syr.edu/pub/docs/sccs/papers/ps/0650/sccs-0683.ps.Z
Access Order and Memory-Conscious Cache Utilization - McKee, Wulf (1995)(Correct)(2 citations)
Introduction Processor speeds are increasing much faster than memory speeds, thus memory bandwidth is
memory systems [3, 10, 33, 36]and prefetching or non-blocking caches [1, 6, 34]Here we take one
systems [3, 10, 33, 36]and prefetching or non-blocking caches [1, 6, 34]Here we take one technique, ftp.cs.virginia.edu/pub/techreports/CS-94-10.ps.Z
Simulation of PRAM Models on Meshes - Leppänen, Penttonen (1994)(Correct)(1 citation)
models has also been investigated. Unfortunately, a fast deterministic simulation is not possible: If the
4, 37, 68, 33]None of the simulations is really practical, and therefore we only state that in [33] it is
access to a memory location 5 Optics or some other non-VLSI technology however might provide a (partial) ftp.cs.utu.fi/pub/techreports/1993/R-93-4.ps.Z
Optimistic Timed HW-SW Cosimulation - Yoo, Choi (1997)(Correct)(2 citations)
and interacts with other simulators which can have faster or slower local times. Asynchronous algorithms
Predicting a next interactive event, however, is practically hard to accomplish in timed cosimulation. Due
single processor cosimulation is performed by concurrently executing multiple processes each of which is poppy.snu.ac.kr/papers/APCHDL97.ps
Multimedia Synchronization and UNIX - Bulterman, van Liere (1992)(Correct)(5 citations)
the user/computer interface have changed, providing faster generation and presentation of information
of separate synchronization streams. In most non-trivial multimedia applications, each stream will synchronization is implemented by fetching input blocks at a predefined rate and then routing them (by www.cwi.nl/ftp/mmpapers/av.doc.ps.gz
Design Rationale of the PURE Object-Oriented.. - Haack..(Correct)
(3) the action box, i.e. abstractions for the non-blockingsynchronization of active objects (i.e.
The Pure nucleus consists of four building blocks: 1) the flange, i.e. abstractions for the
(2) the sluice, i.e. abstractions for the synchronization of interrupt-driven activities in an ivs.cs.uni-magdeburg.de/bs/papers/dipes98/dipes-abstract.ps.gz