In this paper, we present algorithms for pattern matching, where either the pattern P or the text T can contain “don’t care” characters. If the pattern P contains don’t care characters, then we can solve the pattern matching problem in O(n +m + α) time, where α is the total number of occurrences of the component subpatterns. We also can handle online queries, given an O(n) preprocessing time, r...

In this paper, we proposed an occupant detection system using single video camera and a distance sensor for an advanced airbag deployment. We detected occupant face using skin color and motion information in real time. The proposed method acquired the color and size of the occupant face using single video camera and calculated the distance information between the occupant and airbag using a dis...

This paper presents an estimate of the probability of serious occupant injury in frontal crashes based on vehicle kinematics information. Occupant injury risk is developed by modeling the human as a point mass and computing the occupant impact velocity (OIV) using the flail space model. Event Data Recorder data provide vehicle kinematics information for real world crashes with known injury outc...

The results of this study indicate that the latency and silent periods of OCC cycles do not vary among groups representing distinct dentitional stages. The mean latency period durations obtained from the OCC cycles of the subjects in this study ranged from 16.6 to 19.5 msec and demonstrated the smallest SD of all parameters measured. The mean silent period durations ranged from 11.6 to 15.4 mse...

Mammals ovulate an oocyte cumulus complex (OCC), which contains, in addition to the oocyte, numerous cumulus cells and an extensive extracellular matrix (Mahi-Brown and Yanagimachi, 1983; Talbot and DiCarlantonio, 1984). OCCs are ovulated into the peritoneal or bursal cavity and then picked up by the infundibulum of the oviduct and carried into the ampulla where fertilization occurs (Harper, 19...

Multi-pattern matching with wildcards is to find all the occurrences of a set of patterns with wildcards in a text. This problem arises in various fields, such as computational biology and network security. But the problem is not extensively studied as the single pattern case and there is no efficient algorithm for this problem. In this paper, we present efficient algorithms based on the fast F...

1569-190X/$ see front matter 2009 Elsevier B.V doi:10.1016/j.simpat.2009.09.009 * Corresponding author. Tel.: +82 2 3408 4037; fa E-mail address: [email protected] (J.-W. Jeong The objective of this paper was to find an effective way of improving demand-controlled ventilation (DCV) simulation performed under an occupant based ventilation standard established in many countries. Two attractive ...

Although an optimistic approach has been shown to be better suited than locking protocols for real-time database systems (RTDBS), it has the problems of unnecessary restarts and heavy restart overhead. In this paper we identify the unnecessary restart problem in OCC-TI (Optimistic Concurrency Control with Time Intervals), propose a solution to this problem and demonstrate that the solution will...

Although higher-order rewrite systems (HRS) seem to have a first-order flavor, the direct translation into first-order rewrite systems, using e.g. explicit substitutions, is by no means trivial. In this paper, we explore a two-stage approach, by showing how higher-order pattern rewrite systems, and in fact a somewhat more general class, can be expressed by conditional first-order rewriting in t...