ppxscal/embedding_network huggingface dataset:
Biomechanics of oral implants: a review of the literature
Authors: J. Duyck, I. E. Naert, H. Van Oosterwyck, J. Van der Sloten, M. De Cooman, S. Lievens, B. Puers
Venue: Technology and Health Care (1997)

Considering biomechanics of oral implants, both loading on the implant itself and the transferred load to the bone need our attention. Mastication induces vertical and transverse forces, which induce axial forces and bending moments and exert stress gradients in the implant as well as in the bone. By the use of strain gauges or piezo-electric force transducers, one succeeds in precise intra-oral force measurements which make it possible to study a wide range of varying conditions in implant dentistry. A key determinant of the success or failure of an oral implant is the way mechanical stresses are transferred to the surrounding bone. The load transfer from implants to surrounding bone depends on the type of loading, the bone-implant interface, the length and diameter of the implants, the implant shape, structure of the implant surface, the superstructure and the quality and quantity of the surrounding bone. Finite element analyses indicate maximum stress concentrations in the contact area of the implants with the cortical bone and around the apex of the implants in the trabecular bone. Although the precise mechanisms are not fully understood, it is clear that there is an adaptive remodelling response of the surrounding bone to the current situation.
An approach to multikey sequencing in an equiprobable keyterm retrieval situation
Authors: Barry G. T. Lowden
Venue: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval (1985)

We present a simple generalised technique, for sequencing a multi-attribute file, which can be used in a situation where the query pattern is unknown and the term content equiprobable. The method is based on constructing a short spanning path through the records thereby minimising the sum of the Hamming distances between them. Retrieval performance is simulated over a range of query expressions and results suggest a significant reduction in the number of block accesses, using this technique, as compared with records randomly distributed over the file space.
MDM: a multiple-data model tool for the management of heterogeneous database schemes
Authors: Paolo Atzeni, Riccardo Torlone
Venue: ACM SIGMOD Record (1997)

MDM is a tool that enables the users to define schemes of different data models and to perform translations of schemes from one model to another. These functionalities can be at the basis of a customizable and integrated CASE environment supporting the analysis and design of information systems. MDM has two main components: the Model Manager and the Schema Manager. The Model Manager supports a specialized user, the model engineer, in the definition of a variety of models, on the basis of a limited set of metaconstructs covering almost all known conceptual models. The Schema Manager allows designers to create and modify schemes over the defined models, and to generate at each time a translation of a scheme into any of the data models currently available. Translations between models are automatically derived, at definition time, by combining a predefined set of elementary transformations, which implement the standard translations between simple combinations of constructs.
Virtual reality and simulation
Authors: Martin Barnes
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Virtual Reality is a leading edge technology which has only very recently become available on platforms and at prices accessible to the majority of simulation engineers. The media representation of Virtual Reality has been focused on the entertainment aspects of the technology. As a result many simulation engineers are unaware of or confused by the concepts embodied in applying Virtual Reality to simulations. The objective of this state-of-the-art review is to provide an awareness of Virtual Reality with respect to simulation. A brief tutorial will be presented to clarify the terminology employed in the field. Examples of applications in a range of fields will be given, using Virtual Reality software combined with a variety of simulation engines. Virtual Reality devices will be available affording attendees to experience different modes of involvement with the simulated environment.
Does collaborative hypertext support better engagement in learning of the basics in informatics?
Authors: Pekka Makkonen
Venue: ACM SIGCSE Bulletin (1997)

Hypertext is a powerful cognitive tool supporting knowledge construction. We organized two courses about the basics in informatics using collaborative hypertext (experimental groups) based on the hyperbooks built by the students participating in the courses. Simultaneously, we ran two courses without collaborative hypertext (control groups). The study found that collaborative hypertext affects motivation equally regarding most themes of the basics in informatics.The result reflects the need for traditional uncomputerized learning methods in the basics of informatics or the need to concentrate on improving the truthfulness of hypertext-based learning. However, some students may benefit from collaborative hypertext under all circumstances.
State Maps for Linear Systems
Authors: Paolo Rapisarda, J. C. Willems
Venue: SIAM Journal on Control and Optimization (1997)

Modeling of physical systems consists of writing the equations describing a phenomenon and yields as a result a set of differential-algebraic equations. As such, state-space models are not a natural starting point for modeling, while they have utmost importance in the simulation and control phase. The paper addresses the problem of computing state variables for systems of linear differential-algebraic equations of various forms. The point of view from which the problem is considered is the behavioral one, as put forward in [J. C. Willems, Automatica J. IFAC, 22 (1986), pp. 561--580; Dynamics Reported, 2 (1989), pp. 171--269; IEEE Trans. Automat. Control, 36 (1991), pp. 259--294].
The Length of a Leaf Coloration on a Random Binary Tree
Authors: A. M. Hamel, M. A. Steel
Venue: SIAM Journal on Discrete Mathematics (1997)

An assignment of colors to objects induces a natural integer weight on each tree that has these objects as leaves. This weight is called "parsimony length" in biostatistics and is the basis of the "maximum parsimony" technique for reconstructing evolutionary trees. Equations for the average value (over all binary trees) of the parsimony length of both fixed and random colorations are derived using generating function techniques. This leads to asymptotic results that extend earlier results confined to just two colors. A potential application to DNA sequence analysis is outlined briefly.
Experiences in improving risk management processes using the concepts of the Riskit method
Authors: Jyrki Kontio, Gerhard Getto, Dieter Landes
Venue: Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering (1998)

This paper describes experiences from two organizations that have used the Riskit method for risk management in their software projects. This paper presents the Riskit method, the organizations involved, case study designs, and findings from case studies. We focus on the experiences and insights gained through the application of the method in industrial context and propose some general conclusions based on the case studies.
A Theory of Nets for Polyhedra and Polytopes Related toIncidence Geometries
Authors: Sabine Bouzette, Francis Buekenhout, Edmond Dony, Alain Gottcheiner
Venue: Designs, Codes and Cryptography (1997)

Our purpose is to elaborate a theory of planar nets or unfoldings for polyhedra, its generalization and extension to polytopes and to combinatorial polytopes, in terms of morphisms of geometries and the adjacency graph of facets.
How to use expert advice
Authors: Nicolò Cesa-Bianchi, Yoav Freund, David Haussler, David P. Helmbold, Robert E. Schapire, Manfred K. Warmuth
Venue: Journal of the ACM (JACM) (1997)

We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we make no assumptions about the way the sequence of bits to be predicted is generated. We measure the performance of the algorithm by the difference between the expected number of mistakes it makes on the bit sequence and the expected number of mistakes made by the best expert on this sequence, where the expectation is taken with respect to the randomization in the predictins. We show that the minimum achievable difference is on the order of the square root of the number of mistakes of the best expert, and we give efficient algorithms that achieve this. Our upper and lower bounds have matching leading constants in most cases. We then show how this leads to certain kinds of pattern recognition/learning algorithms with performance bounds that improve on the best results currently know in this context. We also compare our analysis to the case in which log loss is used instead of the expected number of mistakes.
Fault simulation under the multiple observation time approach using backward implications
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

We present an improved procedure for fault simulation under themultiple observation time approach based on state expansion.Under state expansion, an incompletely specified state reachedduring fault simulation is replaced by 2{k} states, each one assigninga different combination to k unspecified present state variables.For each expanded state, additional output values are thenimplied. As a result, a fault that cannot be identified as detectedusing conventional simulation may now be identified as detected.The procedure proposed here enhances state expansion by backwardimplications to take advantage of every present state variablevalue specified under state expansion. As a result of usingbackward implications, fewer states need to be considered afterstate expansion, fewer state expansions are potentially neededfor every fault, and the number of faults that can be efficientlyconsidered is increased. Experimental results are presented tosupport these claims.
On Slot Allocation for Time-Constrained Messages in Dual-Bus Networks
Authors: Ching-Chih Han, Chao-Ju Hou, Kang G. Shin
Venue: IEEE Transactions on Computers (1997)

Several access schemes have been suggested for dual-bus network topology, e.g., DQDB [32], Fasnet [37], CRMA [41], and Simple [36]. It is therefore important to provide various services in this type of networks. This paper addresses the issue of guaranteeing the timely delivery of isochronous (real-time) messages with hard deadlines in slotted dual-bus networks. We propose a slot allocation scheme which can allocate bandwidth for a set of isochronous message streams and provide deterministic deadline guarantees.The proposed slot allocation scheme is guaranteed to find a feasible slot allocation in the sense that all messages can be transmitted in a timely manner as long as the total message density is less than or equal to a certain threshold, where the total message density is defined as the summation of the ratio of maximum message size to message deadline over all streams. We also discuss the implementation details of this scheme, and compare our scheme with another bandwidth allocation scheme proposed in [45].
Two models of retrieval with probabilistic indexing
Authors: Norbert Fuhr
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

We describe two retrieval models for probabilistic indexing. The binary independence indexing (BII) model is a generalized version of the Maron Kuhns indexing model. In this model, the indexing weight of a descriptor in a document is an estimate of the probability of relevance of this document with respect to queries using this descriptor. The retrieval-with-probabilistic-indexing (RPI) model is suited to different kinds of probabilistic indexing. Therefore we assume that each indexing model has its own concept of 'correctness' to which the probabilities relate. The concept of correctness is not necessarily identical with the concept of relevance, it is only required to depend on relevance. In addition to the probabilistic indexing weights, the RPI model provides the possibility of relevance weighting of search terms. Both retrieval models are compared in experiments, showing equally good results.
Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings
Authors: Andrzej Proskurowski, Frank Ruskey, Malcolm Smith
Venue: SIAM Journal on Discrete Mathematics (1998)

We give efficient algorithms for listing equivalence classes of k-ary strings under reversal and permutation of alphabet symbols. As representative of each equivalence class, we choose that string which is lexicographically smallest. These algorithms use space O(n) and time $O(\sqrt{k} N)$, where N is the total number of strings generated and n is the length of each string. For k = 2, we obtain a recursive decomposition of the set of binary strings that allows the strings to be generated without rejecting any strings. For $k \ge 3$, some strings must be rejected. The algorithm is simple but its exact analysis is rather complicated. In the analysis we determine a quantity of independent interest---the average length of the common prefix of two randomly chosen infinite length "restricted-growth" strings.
A simulation testbed for investigation of tandem AGV systems
Authors: Leon Bing-Shiun Chuang, Joseph A. Heim
Venue: Proceedings of the 28th conference on Winter simulation (1996)

A tandem, one vehicle per loop, approach to Automated Guided Vehicle System (AGVS) guide path design has been proposed as a more efficient and flexible alternative to traditional AGV system design. The tandem design can substantially simplify the design task while providing even further flexibility for changes in production system layout and operation. Tandem guide paths, however, have potential disadvantages because vehicle break-down, or even scheduled maintenance of vehicles, results in loop inaccessibility. Previous work comparing the efficacy of traditional guide path configurations and tandem loop configurations provided only limited flexibility for experimentation. A tandem AGV system simulation testbed has been developed to facilitate investigation and analysis of a variety of loop reconfiguration strategies and algorithms. A particular focus of our current investigations is the concept of Real-Time Loop Reconfiguration (RTLR), a means of responding to single vehicle failures in tandem AGV systems. The RTLR can solve the potential loop inaccessibility problem and also enhance the flexibility of the overall AGV system design. Results from initial studies used to verify the correct operation of the testbed are presented, and a brief outline of future applications for the tandem loop reconfiguration model are discussed.
Approximate timing analysis of combinational circuits under the XBD0 model
Authors: Yuji Kukimoto, Wilsin Gosti, Alexander Saldanha, Robert K. Brayton
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90's efficient tools exist which can analyze circuits of thousands of gates in a few minutes or even in seconds for many cases. However, the computation time of these tools is not so predictable since the internal engine of the analysis is either a SAT solver or a modified ATPG algorithm, both of which are just heuristic algorithms for an NP-complete problem. Although they are highly tuned for CAD applications, there exists a class of problem instances which exhibits the worst-case exponential CPU time behavior. In the context of timing analysis, circuits with a high amount of reconvergence, e.g. C6288 of the ISCAS benchmark suite, are known to be difficult to analyze under sophisticated delay models even with state-of-the-art techniques. For example [McGeer93] could not complete the analysis of C6288 under the mapped delay model. To make timing analysis of such corner case circuits feasible we propose an approximate computation scheme to the timing analysis problem as an extension to the exact analysis method proposed in [McGeer93]. Sensitization conditions are conservatively approximated in a selective fashion so that the size of SAT problems solved during analysis is controlled. Experimental results show that the approximation technique is effective in reducing the total analysis time without losing accuracy for the case where the exact approach takes much time or cannot complete.
Built-in test generation for synchronous sequential circuits
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

We consider the problem of built-in test generation for synchronous sequential circuits. The proposed scheme leaves the circuit flip-flops unmodified, and thus allows at-speed test application. We introduce a uniform, parametrized structure for test pattern generation. By matching the parameters of the test pattern generator to the circuit-under-test, high fault coverage is achieved. In many cases, the fault coverage is equal to the fault coverage that can be achieved by deterministic test sequences. We also investigate a method to minimize the size of the test pattern generator, and study its effectiveness alone and in conjunction with the insertion of test-points.
Systematic Design of Fault-Tolerant Multiprocessors with Shared Buses
Authors: Hung-Kuei Ku, John P. Hayes
Venue: IEEE Transactions on Computers (1997)

A multiprocessor system is fault-tolerant (FT) if it preserves a fault-free subsystem of a predetermined interconnection structure when faults appear. We present a new method for designing FT multiprocessors that can efficiently tolerate both processor and interconnection faults. The approach is general, in that it can be applied to any multiprocessor topology. Shared buses serve as the main interconnection mechanism to minimize the switching logic needed for reconfiguration. We employ processor-bus-link (PBL) graphs to model multiprocessors with either dedicated or shared buses. Both processors and buses are represented as nodes so that bus faults can be considered explicitly and tolerated efficiently by spare buses instead of by spare processors. A minimum number of spare processors and buses are used to reduce hardware overhead. The node covering concept and the maximum-weight spanning tree algorithm are then employed to construct FT systems that have lower interconnection cost than most previous designs. We also present a cost-effective implementation method which is suitable for both static and dynamic reconfiguration techniques. The FT systems obtained have the advantages of no critical single point of failure, low redundancy, local replacement, and simple circuitry for fast reconfiguration.
The DUAL-EVAL Hardware Description Language and Its Use in the Formal Specification and Verification of the FM9001 Microprocessor
Authors: Bishop C. Brock, Warren A. Hunt,  Jr.
Venue: Formal Methods in System Design (1997)

We present the full formal semantics of the DUAL-EVAL hardware description language. DUAL-EVAL is a hierarchical, occurrence-oriented simulator for synchronous Mealy machines. We briefly describe the FM9001 microprocessor, whose design has been formally specified with the DUAL-EVAL language and mechanically proved correct with respect to a behavioral specification. The FM9001 has been fabricated as a CMOS ASIC and tested extensively.
Building Large, Complex, Distributed Safety-Critical OperatingSystems
Authors: Horst F. Wedde, Jon A. Lind
Venue: Real-Time Systems (1997)

Safety-critical systems typically operate in unpredictable environments. Requirements for safety and reliability are in conflict with those for real-time responsiveness. Due to unpredictable environmental needs there is no static trade-off between measures to accommodate the conflicting objectives. Instead every feature or operating system service has to be adaptive. Finally, for any design problem, there cannot be any closed-form (formal) approach taking care at the same time of (external) time constraints or deadlines, and synchronization requirements in distributed design. The reason is that these two aspects are causally independent. - In this situation we worked out a heuristic experimental, performance-driven and performance-based methodology that allows in an educated way to start with a coarse system model, with accurate logical expectations regarding its behavior. Through experiments these expectations are validated. If they are found to successfully stand the tests extended expectations and model features are generated for refining the previous design as well as its performance criteria. The refinement is done in such a way that the previous experimental configurations are extreme model cases or data profiles which both logically and experimentally are to reproduce the behavior of the previous modeling step. Thus the novel performance aspects or tendencies could then unambiguously be attributed to the influences of the refined model features. We termed this methodology Incremental Experimentation. As a general methodology it relies on a principle of comparative performance studies rather than on realistic data for narrow application ranges. The paper describes how we applied a 5-step design and refinement procedure for developing, analyzing, and evaluating our distributed operating system MELODY that exhibits novel services for supporting real-time and safety-critical applications in unpredictable environments. Experimental set-ups and theme-related findings are discussed in particular.
APLGRAPH&mdash;how to develop graphics software without really trying
Authors: Tauno Ylinen
Venue: Proceedings of the international conference on APL: APL and the future (1986)

The paper describes the development process and system structure of a presentation graphics software written in APL, and shows its user characteristics through a few examples.