805 research outputs found
Sort by
Impossible selves? : challenges and strategies for encouraging individual long-term care planning
Consumer choice in home and community-based long term care : policy implications for decisionally incapacitated consumers
Compressed Bit-sliced Signature Files An Index Structure for Large Lexicons
We use the signature file method to search for partially specified terms in large lexicons. To optimize efficiency, we use the concepts of the partially evaluated bit-sliced signature file method and memory resident data structures. Our system employs signature partitioning, compression, and term blocking. We derive equations to obtain system design parameters, and measure indexing efficiency in terms of time and space. The resulting approach provides good response time and is storage-efficient. In the experiments we use four different lexicons, and show that the signature file approach outperforms the inverted file approach in certain efficiency aspects.
KEYWORDS: Lexicon search, n-grams, signature files
A Probabilistic Solution Generator of Good Enough Designs for Simulation
We build a probabilistic solution generator using the learning automata theory, which can generate a small set of "good enough" designs with a predetermined high probability. The main goal of our work is to reduce a large design population to a much smaller subset of good designs that can be analyzed thoroughly in a subsequent simulation study to identify the best design among them. In the process of building the solution generator, a rough-cut design evaluation method with a high noise error is employed in order to screen designs very rapidly _ may it be an approximate method, a heuristic approach, or short simulation runs. The solution generator has been applied successfully to several serious test problems with noisy objectives