ppxscal/embedding_network huggingface dataset:
Identification by biometrics
Authors: Daniel Guinier
Venue: ACM SIGSAC Review (1990)

Blometric methods can be used for people recognition using their own human characteristics and differences guaranteeing interests of both the controller and the controlled.The blometric factors retained here are Fingerprints, Retina vascularisation, Voice, Geometry of the hand, Dynamics of signature, Keyboard latencies, Genetic fingerprintingA comparison of performance of such methods including general remarks are given to show the necessity of establishing standards for objective comparison for validation and also for improving algorithms.Biometric methods for identification of people are in progress and can stengthen computer security. Biometrics represents the concept "to be". It can be mixed with the two other concepts "to know" and "to have" to solve security weaknesses like the "fuzzy password choice problem."
Experiments with tree-structured MMI encoders on the RM task
Authors: Mark T. Anikst, William S. Meisel, Matthew C. Soares
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

This paper describes the tree-structured maximum mutual information (MMI) encoders used in SSI's Phonetic Engine reg; to perform large-vocabulary, continuous speech recognition. The MMI encoders are arranged into a two-stage cascade. At each stage, the encoder is trained to maximize the mutual information between a set of phonetic targets and corresponding codes. After each stage, the codes are compressed into segments. This step expands acoustic-phonetic context and reduces subsequent computation. We evaluated these MMI encoders by comparing them against a standard minimum distortion (MD) vector quantizer (encoder). Both encoders produced code streams, which were used to train speaker-independent discrete hidden Markov models in a simplified version of the Sphinx system [3]. We used data from the DARPA Resource Management (RM) task. The two-stage cascade of MMI encoders significantly outperforms the standard MD encoder in both speed and accuracy.
Developing reusable software for military systems, why it is needed, why it isn't working
Authors: T. N. Coomer,  Jr., J. R. Comer, D. J. Rodjak
Venue: ACM SIGSOFT Software Engineering Notes (1990)

This paper discusses the importance of developing reusable software component libraries for Department of Defense (DoD) military software systems, as well as a few of the main reasons why current approaches are not working. A working definition of software resuability is estabilished and the major goals of reuse are examined. The emphasis of the paper is on the necessary characteristics of a reusable software component as well as the compilation and utilization of reusable component libraries. The roles of UNIX trade;, Ada reg;, and C in the development of reusable components are examined. Many of the problems facing the development of adaptable, reusable software components are outlined as well as some possible solutions to these problems. Conclusions are drawn concerning the critical need for these software characteristics in DoD military systems of the future.
Knowledge representation and control structure based on three-dimensional symbolic skeletons for CAD/CAM integration
Authors: I. C. You, C. N. Chu, R. L. Kashyap
Venue: Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1990)

A formalism for symbolic representation of three-dimensional model and its use for knowledge representation and control structure are presented. A robust feature-based design (RFBD) approach has been developed to represent three dimensional objects and to provide meaningful geometric and topological properties for manufacturability evaluation. For knowledge acquisition, binary syntactic primitive pairs have been established for high level symbolic reasoning. Symbolic reasoning tables provide five stages for proper knowledge invocation. This framework enables the system to reason about geometric shape based on syntactic pattern primitives and not on features. Both production rule systems and frames are used to represent the declarative and procedural knowledge sources in the EXCAST-1.0 (the expert system). Automatic meta-rule formation is proposed as a part of knowledge refinement process and the semantic data model is also proposed to aid various CAM applications for use in RFBD. The implementation of the algorithms and examples are provided.
A loosely-coupled integration of a text retrieval system and an object-oriented database system
Authors: W. Bruce Croft, Lisa A. Smith, Howard R. Turtle
Venue: Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval (1992)

Document management systems are needed for many business applications. This type of system would combine the functionality of a database system, (for describing, storing and maintaining documents with complex structure and relationships) with a text retrieval system (for effective retrieval based on full text). The retrieval model for a document management system is complicated by the variety and complexity of the objects that are represented. In this paper, we describe an approach to complex object retrieval using a probabilistic inference net model, and an implementation of this approach using a loose coupling of an object-oriented database system (IRIS) and a text retrieval system based on inference nets (INQUERY). The resulting system is used to store long, structured documents and can retrieve document components (sections, figures, etc.) based on their contents or the contents of related components. The lessons learnt from the implementation are discussed.
ACM CSC '92 case panel session
Authors: Frederick Springsteel
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

As CASE continues to broaden its scope from Software Engineering to Systems Engineering, more data designer aids will be needed that spread further &ldquo;upstream&rdquo;: to the critical problem definition and project-planning support areas. CASE should help provide a complete systems developer's environment, for the full SDLC; it then would include data re-engineering and enable reuse of existing data files.
Destination Tag Routing Techniques Based on a State Model for the IADM Network
Authors: Darwen Rau, Jose A. B. Fortes, Howard Jay Siegel
Venue: IEEE Transactions on Computers (1992)

A 'state model' is proposed for solving the problem of routing and rerouting messages in the inverse augmented data manipulator (IADM) network. Necessary and sufficient conditions the reroutability of messages are established using this model, and destination tag schemes are derived. These schemes are simpler, more efficient, and require less complex hardware than previously proposed routing schemes. Two destination tag schemes are proposed. A universal rerouting algorithm is constructed based on one of the schemes. It finds a blockage-free path for any combination of multiple blockages if there exists such a path, and indicates the absence of such a path if there exists none. In addition, the state model is used to derive constructively a lower bound on the number of subgraphs which are isomorphic to the indirect binary n-cube network in the IADM network. This knowledge can be used to characterize properties of the IADM networks and for permutation routing in the IADM networks.
Query processing and file management issues in partitioned databases (abstract)
Authors: Esen Ozkarahan, H. Cem Bozsahin
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

This study reviews the database partitioning techniques and elaborates on features of storage organization from efficiency and query processing standpoints. Methods for static files have excellent utilization records but require variable number of disk accesses, are prone to overflows, and may need re-organization when changes are made. Dynamic file schemes with directories have good retrieval query performance but tend to achieve low storage utilization, suffer from growing directory, and may propagate the effects of an update to several regions and possibly all the way up to the highest level directory. Partitioning very large databases has become an intense research area over the last few years. The characteristics of partitioned file organizations have profound effects on the efficiency of query processing and database updates. We have identified two main partitioning methodologies: static and dynamic files. While with static files we can achieve good utilization, they result in variable disk accesses per query and need frequent file reorganizations due to updates. As with the dynamic files we can achieve constant number of disk accesses for all queries at the expense of relatively low utilization (for uniform as well as non-uniform data distributions), directory sizes may grow fast, and handling of updates efficiently in extreme cases may be difficult. To this date very few has been researched in the area of updates of partitioned file organizations. However, as can be seen in our discussions there are important problems awaiting to be tackled in this area especially with respect to directory structures.
International perspectives: some thoughts on differences between North American and European HCI
Authors: John Karat
Venue: ACM SIGCHI Bulletin (1991)

With this issue we begin a column entitled "International Perspectives" in which Clare-Marie Karat and I, acting as International Editors for the SIGCHI Bulletin, will attempt to provide a range of views of HCI research and practice from around the world. We will be assisted in this by regional editors, and hope to provide a forum for human-computer professionals outside of the United States to voice their views about the field (or for those inside the US to talk about international issues). Clare-Marie and I do not intend to write this column as authorities on "international issues", but rather will encourage submissions on general themes. I invite others with views on international issues which impact (or should impact) HCI research and practice to send contributions to one of the International editors.
Regular paper: Poly(dimethyl-co-diphenylsilane) as a deep-UV and an oxygen plasma portable conformable mask
Authors: Wen-an Loong, Tsung-hsiung Wang
Venue: Microelectronic Engineering (1992)

Bi-layer resist processes for deep-UV and oxygen plasma are studied. Poly(dimethyl-co-diphenylsilane) is used as both deep-UV and oxygen plasma portable conformable masks because of its strong deep-UV and i-line (365 nm) absorption and its resistance to oxygen plasma. The bottom layer is P(MMA-PhPK), a copolymer of methylmethacrylate and 30 wt% of phenylpropenylketone, for the positive-tone pattern. P(MMA-PhPK) has greater deep-UV exposure sensitivity compared to PMMA. Good vertical sidewall profiles of lines of bottom layers are obtained.
Heuristic exhaustive search in automatic knowledge acquisition (abstract)
Authors: Hou-Mei Chang
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

In this paper, heuristics and other techniques are introduced to the exhaustive search algorithm such that in some typical searching problems the computer complexities can be reduced from billions of years to a few minutes or hours. The reason why the exhaustive search has not yet been used in most artificial intelligence problems, is due to too much computer complexity. To find all possible solutions in most machine inductive learning problems are NP-hard problems. Too much CPU-time is needed for the solving of a NP-hard problem, except for the very simple ones. In order to reduce the CPU-time, the following techniques are introduced: All instances of concepts are expressed by the character strings of the same length n, no matter they are general or specific. A tolerance is introduced instead of the consistency condition. Top-down from general-to-specific search is used. Heuristics are introduced to an exhaustive search. A system using this algorithm called AKA (Automatic Knowledge Acquisition) is established. It is used to do automatic knowledge acquisition for expert systems. An example is provided and the results of an exhaustive search are displayed to show how the computer complexity is reduced and how the algorithm works.
Authenticating Multicast Internet Electronic Mail Messages Using a Bidirectional MAC is Insecure
Authors: Chris J. Mitchell
Venue: IEEE Transactions on Computers (1992)

The 1988 version of the message encryption and authentication procedures for Internet electronic mail makes use of bidirectional MAC (BMAC). When used for multicast electronic mail it is important that this BMAC act as a one-way function. It is shown that it is not a one-way function, which means that the BMAC technique should not be used for authenticating multicast messages.
The (n2¿1)-puzzle and related relocation problems
Authors: Daniel Ratner, Manfred Warmuth
Venue: Journal of Symbolic Computation (1990)

The 8-puzzle and the 15-puzzle have been used for many years as a domain for testing heuristic search techniques. From experience it is known that these puzzles are ''difficult'' and therefore useful for testing search techniques. In this paper we give strong evidence that these puzzles are indeed good test problems. We extend the 8-puzzle and the 15-puzzle to an nxn board and show that finding a shortest solution for the extended puzzle is NP-hard and is thus believed to be computationally infeasible. We also sketch an approximation algorithm for transforming boards that is guaranteed to use no more than a constant times the minimum number of moves, where the constant is independent of the given boards and their side length n. The studied puzzles are instances of planar relocation problems where the reachability question is polynomial but efficient relocation is NP-hard. Such problems are natural robotics problems: A robot needs to efficiently relocate packages in the plane. Our research encourages the study of polynomial approximation algorithms for related robotics problems.
Deriving good transformations for mapping nested loops on hierarchical parallel machines in polynomial time
Authors: K. G. Kumar, D. Kulkarni, A. Basu
Venue: Proceedings of the 6th international conference on Supercomputing (1992)

We present a computationally efficient method for deriving the most appropriate transformation and mapping of a nested loop for a given hierarchical parallel machine. This method is in the context of our systematic and general theory of unimodular loop transformations for the problem of iteration space partitioning [7]. Finding an optimal mapping or an optimal associated unimodular transformation is NP-complete. We present a polynomial time method for obtaining a &lsquo;good&rsquo; transformation using a simple parameterized model of the hierarchical machine. We outline a systematic methodology for obtaining the most appropriate mapping.
Marketing the information systems profession: a preliminary report on the Boston-Sim careers videotape
Authors: Charles H. Mawhinney, Gerald Miller
Venue: ACM SIGCPR Computer Personnel (1991)

Student interest in computer-related careers has declined dramatically in recent years, resulting in a shortage of entry-level personnel pursuing careers in information management. In an effort to attract students to the profession, the Boston Chapter of the Society for Information Management (Boston-SIM) has developed a prototype videotape targeted at high school students. The tape has been shown at several high schools in the greater Boston area and its effectiveness measured through a questionnaire administered before and after viewing. The tape has been found to be reasonably effective in familiarizing students with the information management profession.
Constraining Object Features Using a Polarization Reflectance Model
Authors: Lawrence B. Wolff, Terrance E. Boult
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The authors present a polarization reflectance model that uses the Fresnel reflection coefficients. This reflectance model accurately predicts the magnitudes of polarization components of reflected light, and all the polarization-based methods presented follow from this model. The authors demonstrate the capability of polarization-based methods to segment material surfaces according to varying levels of relative electrical conductivity, in particular distinguishing dielectrics, which are nonconducting, and metals, which are highly conductive. Polarization-based methods can provide cues for distinguishing different intensity-edge types arising from intrinsic light-dark or color variations, intensity edges caused by specularities, and intensity edges caused by occluding contours where the viewing direction becomes nearly orthogonal to surface normals. Analysis of reflected polarization components is also shown to enable the separation of diffuse and specular components of reflection, unobscuring intrinsic surface detail saturated by specular glare. Polarization-based methods used for constraining surface normals are discussed.
Managing Communication Networks by Monitoring Databases
Authors: Ouri Wolfson, Soumitra Sengupta, Yechiam Yemini
Venue: IEEE Transactions on Software Engineering (1991)

The problem of managing large communication networks using statistical tests, alerts, and correlation among alerts is considered. The authors propose a model of these network management functions as data-manipulation operations. They argue that this approach can improve the flexibility of network management systems by providing a language that is declarative and set-oriented. These are properties of existing data-manipulation languages and it is shown that any data-manipulation language, augmented with several new capabilities, can serve as a language for specifying the aforementioned network management functions. The new capabilities required are specification of events, correlation among events, and change-tracking.
Pipelining and bypassing in a VLIW processor (abstract)
Authors: Arthur Abnous, Nader Bagherzadeh
Venue: Proceedings of the 19th annual international symposium on Computer architecture (1992)

This paper describes issues involved in the bypassing mechanism for a VLIW processor and its relation to the pipeline structure of the processor. We will first describe the pipeline structure of our processor and analyze its performance and compare it to typical RISC-style pipeline structures given the context of a processor with multiple functional units. Next, we shall study the performance effects of various bypassing schemes in terms of their effectiveness in resolving pipeline data hazards and their effect on the processor cycle time.
Recognizing substrings of LR(k) languages in linear time
Authors: Joseph Bates, Alon Lavie
Venue: Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1992)

LR parsing techniques have long been studied as efficient and powerful methods for processing context free languages. A linear time algorithm for recognizing languages representable by LR(k) grammars has long been known. Recognizing substrings of a context-free language is at least as hard as recognizing full strings of the language, as the latter problem easily reduces to the former. In this paper we present a linear time algorithm for recognizing substrings of LR(k) languages, thus showing that the substring recognition problem for these languages is no harder than the full string recognition problem. An interesting data structure, the Forest Structured Stack, allows the algorithm to track all possible parses of a substring without loosing the efficiency of the original LR parser. We present the algorithm, prove its correctness, analyze its complexity, and mention several applications that have been constructed.
Addressing large distributed collections of persistent objects: the Mneme project's approach
Authors: J. Eliot B. Moss
Venue: Proceedings of the second international workshop on Database programming languages (1989)

The Mneme persistent object store project has as one of its primary goals to support cooperative, concurrent, and reliable use of large, distributed collections of objects. In our case, distribution is intended to mean not only physical dispersion, but also some autonomy or independence of subcollections of objects&mdash;that is, the object space is under some degree of decentralized management. Providing independence of subcollections of objects has interesting implications as to how to address and retrieve objects efficiently. Here we describe the need for and benefits of independent subcollections of objects, examine the addressing implications, and show how these implications have affected the design of Mneme. Most particularly, we argue against the appropriateness of a large flat store of bytes or even of object identifiers, and in favor of richer, more flexible, structures. We also contend that comparable performance can be achieved by careful implementation of the richer structures, with considerably more functionality and flexibility than flat structures provide. The cost is increased complexity of the supporting software.
VADS APSE: an integrated Ada programming support environment
Authors: Ed Matthews, Greg Burns
Venue: Proceedings of the first international symposium on Environments and tools for Ada (1991)

During the 1980's, the United States Department of Defense developed the Ada language to combat the growing "software crisis," while software companies developed Computer-Aided Software Engineering (CASE) tools to enhance software development productivity. Ada and CASE are beginning to merge, but the disjoined solutions offered by individual CASE vendors to this point are lacking in two key areas: (1) exploitation of program information available as a by-product of compiling an Ada program; and (2) integration of individual tools to produce synergistic benefits over a broader range of the software development cycle.To remedy these shortcomings, Verdix Corporation has begun development of an Integrated Ada Programming Support Environment, VADS APSE. VADS APSE represents a significant departure from previous APSE development efforts in that it is built on an environment framework from commercially available software and it exploits the capabilities of powerful, low-cost, networked engineering workstations. While VADS APSE represents an instance of an environment built upon a framework, it also represents, through extensions to the underlying framework, an Ada-specific environment framework that can be tailored to meet the needs of a specific software development activity.
Identifying and Qualifying Reusable Software Components
Authors: Gianluigi Caldiera, Victor R. Basili
Venue: Computer (1991)

Identification and qualification of reusable software based on software models and metrics is explored. Software metrics provide a way to automate the extraction of reusable software components from existing systems, reducing the amount of code that experts must analyze. Also, models and metrics permit feedback and improvement to make the extraction process fit a variety of environments. Some case studies are described to validate the experimental approach. They deal with only the identification phase and use a very simple model of a reusable code component, but the results show that automated techniques can reduce the amount of code that a domain expert needs to evaluate to identify reusable parts.