ppxscal/embedding_network huggingface dataset:
Integrated Access to a Large Medical Literature Database
Authors: Edward A. Fox, Prabhakar M. Koushik, Qi Chen, Robert K. France
Venue:  (1991)

Project INCARD (INtegrated CARdiology Database) has adapted the CODER (COmposite Document Expert/effective/extended Retrieval) system and LEND (Large External Network object oriented Database) to provide integrated access to a large collection of bibliographic citations, a full text document in cardiology, and a large thesaurus of medical terms. CODER is a distributed expert-based information system that incorporates techniques from artificial intelligence, information retrieval, and human-computer interaction to support effective access to information and knowledge bases. LEND is an object-oriented database which incorporates techniques from information retrieval and database systems to support complex objects, hypertext/hypermedia and semantic network operations efficiently with very large sets of data. LEND stores the CED lexicon, MeSH thesaurus, MEDLARS bibliographics records on cardiology, and the syllabus for the topic Abnormal Human Biology (Cardiology Section) taught at Columbia University. Together, CODER/LEND allow efficient and flexible access to all of this information while supporting rapid "intelligent" searching and hypertext-style browsing by both novice and expert users. This report gives statistics on the collections, illustrations of the system''s use, and details on the overall architecture and design for Project INCARD.
PCA = Gabor for Expression Recognition
Authors: Matthew N. Dailey, Garrison W. Cottrell
Venue:  (1999)

We show that Gabor filter representations give quantitatively indistinguishable results for classification of facial expressions as local PCA representations, in contrast to other recent work. We also show that a simple discriminant analysis automatically locates regions roughly corresponding to relevant Facial Actions. Finally, we in troduce a method that typically boosts generalization performance 9% by "peeking" at all of the unlabeled training patt erns before classifying them.
SIMULTANEOUS CONSTRUCTION OF REFUTATIONS AND MODELS FOR PROPOSITIONAL FORMULAS
Authors: Allen VanGelder
Venue:  (1995)

Methodology is developed to attempt to construct simultaneously either a refutation or a model for a propositional formula in conjunctive normal form. The method exploits the concept of "autarky", which was introduced by Monien and Speckenmeyer. Informally, an autarky is a "self-sufficient" model for some clauses, but which does not affect the remaining clauses of the formula. Whereas their work was oriented toward finding a model, our method has as its primary goal to find a refutation in the style of model elimination. It also finds a model if it fails to find a refutation, essentially by combining autarkies. However, the autarky-related processing is integrated with the refutation search, and can greatly improve the efficiency of that search even when a refutation does exist. Unlike the pruning strategies of most refinements of resolution, autarky-related pruning does not prune any successful refutation; it only prunes attempts that ultimately will be unsuccessful; consequently, it will not force the underlying search to find an unnecessarily long refutation. A game characterization of refutation search is introduced, which demonstrates some symmetries in the search for a refutation and the search for a model. Limited experience with a prototype implementation is reported, and indicates the possibility of developing high-performance refutation methods that are competitive with recently reported model-searching methods. Considerations for first-order refutation methods are discussed briefly.
The User-Reported Critical Incident Method at a Glance
Authors: Castillo Jose C., Hartson H. Rex, Hix Deborah
Venue:  (1997)

The over-arching goal of this work is to discuss the user-reported critical incident method, a cost-effective remote usability evaluation method for real-world applications involving real users, doing real tasks in real work environments. Several methods have been developed for conducting usability evaluation without direct observation of a user by an evaluator. However, contrary to the user-reported critical incident method, none of the existing remote evaluation methods (nor even traditional laboratory-based evaluation) meets all the following criteria: - data are centered around critical incidents that occur during task performance; - tasks are performed by real users; - users are located in normal working environment; - users self-report own critical incidents; - data are captured in day-to-day task situations; - no direct interaction is needed between user and evaluator during an evaluation session; - there is a cost-effective way to capture data; and - data are high quality and therefore relatively easy to convert into usability problems.
Configuration management in a hypermedia-based software development environment
Authors: Tien N. Nguyen, Ethan V. Munson, John T. Boyland
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

Several researchers have explored the use of hypermedia technology in software development environments (SDEs). However, existing hypermedia-based SDEs have only limited support for the evolutionary aspects of software projects. On the other hand, commercial software configuration management systems (SCMs) have had noticeable success in helping developers manage system evolution. While researchers in the hypermedia community acknowledged the need for strong version control support in their systems, they are still far from achieving this goal. The Software Concordance (SC) project is developing a SDE to experiment with the use of versioned hypermedia services for managing software documents and their logical relationships. This paper describes our versioned hypermedia framework in which hypermedia services are built on top of a SCM system and provides uniform version control supports for both software documents and their relationships.
Natural Categories for More Natural Generation
Authors: Ben E. Cline, Jane T Nutter
Venue:  (1990)

Psychological research has shown that natural taxonomies contain a distinguished or basic level. Adult speakers use the names of these categories most frequently and can list a large number of attributes for them. They typically cannot list many attributes for superordinate categories and few list additional attributes for subordinate categories. Because natural taxonomies are important to human language, their use in natural language processing systems appears well founded. In the past, however, most AI systems have been implemented around uniform taxonomies in which there is no distinguished level. It has recently been demonstrated that natural taxonomies enhance language processing systems by allowing selection of appropriate category names and by providing the means to handle implicit focus. In previous research, we have argued that benefits from the use of natural categories can be realized in multi-sentential connected generation systems. We briefly summarize the psychological research on natural taxonomies that relates to natural language processing systems, the use of natural categorizations in current natural language processing systems, and the results of our previous research in which we show how natural categories can be used in multiple sentence generation systems to allow the selection of appropriate category names, to provide a mechanism to help determine salience, and to provide for the shallow modeling of audience expertise. We then describe additional benefits of natural categories in generation systems by demonstrating that natural categories provide a mechanism that aids selection of discourse schemes and increase the efficiency of inheritance.
OCTREES FOR FASTER ISOSURFACE GENERATION
Authors: Jane Wilhelms, Allen VanGelder
Venue:  (1990)

The large size of many volume data sets often prevents visualization algorithms from providing interactive rendering. The use of hierarchical data structures can ameliorate this problem by storing summary information to prevent useless exploration of regions of little or no interest within the volume. This paper discusses research into the use of the *octree* hierarchical data structure for this purpose. Octrees are well suited to the six-sided cell structure of many volumes. We introduce a new space-efficient design for octree representations of volumes whose dimensions are not conveniently a power of two; octrees following this design are called *branch-on-need octrees* (BONOs). We also describe a caching method that essentially passes information between octree neighbors whose visitation times may be quite different, then discards it when its useful life is over. Using the application of octrees is isosurface generation as a focus, we present space and time comparisons for octree-based versus more traditional ``marching'''' methods.
Randomized Routing with Shorter Paths
Authors: E. Upfal, S. Feleprin, M. Snir
Venue:  (1993)

We study in this paper the use of randomized routing in multistage networks. While log N additional randomizing stages are needed to breat ``spatial locality'''', within each permutation, only loglogN additional randomizing stages are needed to breat ``temporal locality'''' among successive permutations. Thus, logN bits of initial randomization per input, followed by loglogN bits of randomization per packet are sufficient to ensure that t permutatios are delivered in time t+logN. We present simulation results that validate this analysis.
Supporting the Integration and Evolution of Components Through Binary Component Adaptation
Authors: Ralph Keller, Urs Holzle
Venue:  (1997)

Object-oriented components are hard to integrate if developed independently of each other, and difficult to evolve without affecting existing clients, particularly with widely distributed components that have thousands of reusers. We propose binary component adaptation (BCA), a new solution that allows components to be adapted and evolved in binary form and on-the-fly (during program load ing). Binary component adaptation rewrites component binaries before (or while) they are loaded and is significantly more flexible than previous approaches. Also, BCA requires no source code access and guarantees release-to-release compatibility. That is, an adaptation is guaranteed to be compatible with a new binary release of the component as long as the new release itself is compatible with clients compiled using the earlier release. We show how binary component adaptation can solve a number of important integration and evolution problems and discuss how it can be implemented for JVM class files (e.g., Java programs). We believe that binary component adaptation could significantly improve the integration and evolution of software components, especially in a relatively uncoordinated and fast-evolving environment such as the Internet.
Low Error Path Planning for a Synchro-Drive Mobile Robot
Authors: David P. Miller, Prabhakar M. Koushik
Venue:  (1986)

A path-planning system is presented which, given any points, calculates a low-error path for a synchro-drive robot. The path reduces dead-reckoning errors by using gentle, constant curvature turns for switching directions of the robot''s travel---yet direct and minimal length travel are maintained. The system has been implemented and tested with a Vectrobot mobile platform.
Minimum-Buffered Routing Of Non-critical Nets
Authors: Andrew K Charles Alpert
Venue:  (2001)

In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal transition edges, and reduce delay uncertainty due to coupling noise. Bounding load capacitance also improves reliability with respect to hot-carrier oxide breakdown and AC self-heating in interconnects, and guarantees bounded input rise/fall times at buffers and sinks. This report introduces a new minimum-buffer routing problem (MBRP) formulation which requires that the capacitive load of each buffer, and of the source driver, be upper-bounded by a given constant. Our contributions include the following. (a) We give linear-time algorithms for optimal buffering of a given routing tree with a single (inverting or non-inverting) buffer type. (b) For simultaneous routing and buffering with a single non-inverting buffer type, we give a factor $2(1+\varepsilon)$ approximation algorithm and prove that no algorithm can guarantee a factor smaller than 2 unless P=NP. For the case of a single inverting buffer type, we give a factor $4(1+\varepsilon)$ approximation algorithm. (c) We give local-improvement and clustering MBRP heuristics with improved practical performance and present a comprehensive experimental study comparing the runtime/quality tradeoffs of the proposed MBRP heuristics on test cases extracted from recent industrial designs.
Positive Alternatives to Computer Misuse: A Report of the Proceedings of an ACM Panel on Hacking
Authors: John A. N. Lee, Roz Steier, Gerald Segal
Venue:  (1986)

If one believes press reports, the misuse of computers is rampant. The same the many other misuses have gone unreported as a result of the embarrassment and loss of image/integrity of those affected (as victims) and the belief that to expose misuses will lead to further problems and expense, as well as encourage copy-cat crimes. Much of the press coverage of computer misuse has centered on the younger members of computing community using inexpensive personal computer systems. The placement of powerful tools into the hands of adolescents without imposing the appropriate control would appear to be a contributing factor to their unfettered use of computers and communications systems. Such usage ranges from benign exploration of the powers of computational and communication systems, through the malicious use of those devices for personal aggrandisement, to the use of computers for distinctly criminal activities. At present there are no technological or ethical barriers that separate the explorer from the criminal; possibly the prospect of being able to perform more and more complex projects can innocently lead the benign learner into improper activities. Conversely the blame for breaches of security and the infiltration of personal, private systems, is sometimes placed on the backs of the owners of those systems for maintaining an attractive nuisance. Concern must also be expressed about the community-developing attractive nuisances of bulletin boards (BBS''s), many of which are benign, but too many of which are used to extend the fringe area of illegality in exchanging pirated software, providing message systems for immoral or illegal purposes, and revealing cracks in governmental and commercial security.
Sicherheit im Internet: Stand der Technik
Authors: Harald Weidner
Venue:  (1997)

Dieser Bericht behandelt Sicherheitsprobleme, die beim Anschluss an das Internet und der Nutzung von Online-Diensten relevant sind. Er beschreibt bekannte Sicherheitsprobleme, stellt Loesungen vor, die mit den derzeit bekannten Techniken realisierbar sind, und vergleicht das Machbare mit dem tatsaechlich Eingesetzten. Ziel ist es, eine Einfuehrung in die Sicherheitsproblematik beim Anschluss an das Internet zu geben und das Bewusstsein fuer Sicherheits- und Datenschutzaspekte zu schaerfen. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
LATENCY-RATE SERVERS: A GENERAL MODEL FOR ANALYSIS OF TRAFFIC SCHEDULING ALGORITHMS
Authors: Dimitrios Stiliadis, Anujan Varma
Venue:  (1995)

In this paper, we develop a general model, called Latency-Rate servers ($\cal LR$-servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of an $\cal LR$ scheduler is determined by two parameters --- the latency and the allocated rate. We show that several well-known scheduling algorithms, such as Weighted Fair Queueing, VirtualClock, Self-Clocked Fair Queueing, Weighted Round Robin, and Deficit Round Robin, belong to the class of $\cal LR$-servers. We derive tight upper bounds on the end-to-end delay, internal burstiness, and buffer requirements of individual sessions in an arbitrary network of ${\cal LR}$-servers in terms of the latencies of the individual schedulers in the network, when the session traffic is shaped by a leaky bucket. Thus, the theory of $\cal LR$-servers enables computation of tight upper-bounds on end-to-end delay and buffer requirements in a network of servers in which the servers on a path may not all use the same scheduling algorithm. We also define a self-contained approach to evaluate the fairness of $\cal LR$-servers and use it to compare the fairness of many well-known scheduling algorithms.
Foderierung von Dateien: Finden, Verwalten und Nutzen vonMetainformationen
Authors: Hö, M. ding
Venue:  (1996)

Im Rahmen des Projektes SIGMA_FDB sind Fragestellungen der Unterstutzung einer unternehmensweiten Informations- und Kommunikationsinfrastruktur zur durchgangigen Unternehmensorganisation zu untersuchen. Insbesondere geht es um Konzepte zur informationstechnischen Unterstutzung des Fabrikplanungsprozesses. Wir gehen davon aus, da? der Einsatz foderierter Systeme ein geeigneter Ansatz ist, um vorhandene bzw. neu hinzukommende Applikationen korrekt zu integrieren und die Erhaltung eines konsistenten globalen Datenbestandes zu gewahrleisten. Bei einer ersten Anforderungsanalyse und bei der Analyse der vorhandenen, teilweise gekoppelten Spezialapplikationen hat sich insbesondere die Forderung nach der Integration von auf spezifischen Dateiformaten basierenden Daten herauskristallisiert. Zu diesem Thema werden im vorliegenden Papier wichtige Fragestellungen aufgeworfen und erste Losungsansatze skizziert. Nach einer weitergehenden Motivation des Themas wird die zentrale Frage des Findens und Aufbereitens der Metainformation fur verschiedene Klassen von Dateien diskutiert. Im weiteren werden Uberlegungen zur moglichen Realisierung eines solchen heterogenen Informationssystems vorgestellt. Abschlie?end werden die Ergebnisse kurz zusammengefa?t und ein Ausblick auf zukunftige Arbeiten gegeben.
A NEW INTERACTIVE ANALOG LAYOUT METHODOLOGY BASED ON RUBBER-BAND ROUTING
Authors: Kazuhiko Kobayashi, Wayne W Dai
Venue:  (1996)

In this report we formulate analog layout constraints and survey the state of the art of automatic analog layout systems, which can handle only few analog constraints, and generate less dense layout. To solve these problems we propose a new interactive analog layout methodology. It provides topological editing in the geometrical view based on Rubber-band routing. The purposes of this new methodology are i) to overcome the difficulty to control the layout parasitic elements with irregularities of analog devices and wiring effects and ii) to reduce the analog VLSI design period. After describing new concepts for that interactive methodology, we state some specific challenges.
Can Statistical Zero Knowledge be made Non-Interactive? or On the Relationship of SZK and NISZK
Authors: O. Goldreich, A. Sahai, S. Vadhan
Venue:  (1998)

We further extend the study, recently initiated by De-Santis et. al (ICALP98) of non-interactive statistical zero-knowledge proofs. Our main focus is to compare the class NISZK of problems possessing such non-interactive proofs to the class SZK of problems possessing interactive statistical zero-knowledge proofs. Along these lines, we first show that if statistical zero-knowledge is non-trivial then so is non-interactive statistical zero-knowledge, where by non-trivial we mean that the class includes problems which are not solvable in probabilistic polynomial-time. (The hypothesis holds under various assumptions, such as the intractability of the Discrete Logarithm Problem.) Furthermore, we show that if NISZK is closed under complementation, then in fact SZK=NISZK, i.e. all statistical zero-knowledge proofs can be made non-interactive. The main tools in our analysis are two promise problems that are natural restrictions of promise problems known to be complete for SZK. We show that these restricted problems are in fact complete for NISZK, and using this relationship we derive our results comparing the two classes. The two problems refer to the statistical difference, and difference in entropy, respectively, of a given distribution from the uniform one. We also consider a weak form of NISZK, in which only requires that for every inverse polynomial 1/p(n), there exists a simulator which achieves simulator deviation 1/p(n), and show that this weak form of NISZK actually equals NISZK.
PREDICTING PROTEIN STRUCTURE USING HIDDEN MARKOV MODELS
Authors: Kevin Karplus, Kimmen Sjolander, Christian Barrett, Melissa Cline, David Haussler, Richard Hughey, Liisa Holm
Venue:  (1997)

We discuss how methods based on hidden Markov models performed in the fold recognition section of the CASP2 experiment. Hidden Markov models were built for a set of about a thousand structures from the PDB database, and each CASP2 target sequence was scored against this library of hidden Markov models. In addition, a hidden Markov model was built for each of the target sequences, and all of the sequences in PDB were scored against that target model. Having high scores from both methods was found to be highly indicative of the target and a structure being homologous. Predictions were made based on several criteria: the scores with the structure models, the scores with the target models, consistency between the secondary structure in the known structure and predictions for the target (using the program PhD), human examination of predicted alignments between target and structure (using RASMOL), and solvation preferences in the alignment of the target and structure. The method worked well in comparison to other methods used at CASP2 for targets of moderate difficulty, where the closest structure in PDB could be aligned to the target with at least 15% residue identity. There was no evidence for the method''s effectiveness for harder cases, where the residue identity was much lower than 15%.
DETECTION OF ALL MULTIPLE FAULTY CELLS IN ARRAY MULTIPLIERS
Authors: Martine Schlag, F. J Ferguson
Venue:  (1990)

Array multipliers are well suited for VLSI implementation because of their regular structure and relative ease of test. Previous research has provided test sets that detect all single faulty cells in array multipliers. We provide tests that detect all multiple faulty cells in the two-dimensional array of full-adders in the multiplier with a test set whose length is proportional to the square root of the number of cells in the multiplier array. We show an Omega(n / log n) lower bound on the number of tests required to detect all multiple faulty cells in the full adder array of an n X n multiplier.
Automating the Construction of Authority Files in Digital Libraries: A Case Study
Authors: James C. French, Allison L. Powell, Eric Schulman
Venue:  (1997)

The issue of quality control has become increasingly important as more online databases are integrated into digital libraries. This can have a dramatic effect on the search effectiveness of an online system. Authority work, the need to discover and reconcile variant forms of strings in bibliographic entries, will become more difficult. Spelling variants, misspellings, translation and transliteration differences all increase the difficulty of retrieving information. This paper is a case study of our efforts to create an authority file for authors'' institutional affiliations in the Astrophysics Data System. The techniques surveyed here for the detection and categorization of variant forms have broader applicability and may be used in authority work for other bibliographic fields.