ppxscal/embedding_network huggingface dataset:
Enhancing cross-language information retrieval by an automatic acquisition of bilingual terminology from comparable corpora
Authors: Fatiha Sadat, Masatoshi Yoshikawa, Shunsuke Uemura
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

This paper presents an approach to bilingual lexicon extraction from comparable corpora and evaluations on Cross-Language Information Retrieval. We explore a bi-directional extraction of bilingual terminology primarily from comparable corpora. A combined statistics-based and linguistics-based model to select best translation candidates to phrasal translation is proposed. Evaluations using a large test collection for Japanese-English revealed the proposed combination of bi-directional comparable corpora, bilingual dictionaries and transliteration, augmented with linguistics-based pruning to be highly effective in Cross-Language Information Retrieval.
Multiscalar Processors
Authors: Manoj Franklin
Venue:  (2002)

:Multiscalar Processors is designed to meet the needs of a professional audience composed of designers and programmers of next-generation processors and researchers in computer architecture and engineering. This book is also suitable as a secondary text for graduate level students in computer science and engineering.
Macromedia Dreamweaver MX for Windows and Macintosh: Visual QuickStart Guide
Authors: J. Tarin Towers
Venue:  (2002)

:This completely updated edition of our best-selling guide to Dreamweaver will cover all the tools that beginning to intermediate level users need to know. The popular Visual QuickStart format will feature task-based, step-by-step instructions coupled with lots of screen shots highlighting just what readers need to know to get up and running quickly. Readers will quickly gain an understanding of the basic tools of the program and how to use them to design a Web site.
A Practical, Distributed Environment for Macintosh Software Development
Authors: Mark Sherman, Ann Marks, Rob Collins, Heather Anderson, Jerry Godes, Denis Devlin, Leonid Spector, Vivian Sewelson
Venue:  (1986)

We describe a development environment we created for prototyping software for the Macintosh. The programs are developed and executed on a large time-shared computer but can use the full facilities of the Macintosh. By using this system, we combine the advantages of the large system, such as large amounts of disk storage and automatic file backups, with the advantages of the Macintosh, such as advanced graphics, mouse control and sound synthesis. We also describe several projects that used the distributed development system. We conclude with a description of our future plans for this environment.
Job Scheduling in Rings
Authors: Perry Fizzano, Clifford Stein, David R. Karger, Joel Wein
Venue:  (1994)

We give distributed approximation algorithms for job scheduling in a ring architecture. In contrast to almost all other parallel scheduling models, the model we consider captures the influence of the underlying communications network by specifying that task migration from one processor to another takes time proportional to the distance between those two processors in the network. As a result, our algorithms must balance both computational load and communication time. The algorithms are simple, require no global control, and work in a variety of settings. All come with small constant-factor approximation guarantees; the basic algorithm yields schedules of length at most 4.22 times optimal. We also give a lower bound on the performance of any distributed algorithm some results for a simple capacitated case, and the results of simulation experiments, which give better results than our worst-case analysis.
Scalable Certification of Native Code: Experience from Compiling to TALx86
Authors: Dan Grossman, Greg Morrisett
Venue:  (2000)

Certifying compilation allows a compiler to produce annotations that prove that target code abides by a specified safety policy. An independent verifier can check the code without needing to trust the compiler. For such a system to be generally useful, the safety policy should be expressive enough to allow different compilers to effectively produce certifiable code. In this work, we use our experience in writing a certifying compiler to suggest general design principles that should allow concise yet expressive certificates. As an extended example, we present our compiler''s translation of the control flow of Popcorn, a high-level language with function pointers and exception handlers, to TALx86, a typed assembly language with registers, a stack, memory, and code blocks. This example motivates techniques for controlling certificate size and verification time. We quantify the effectiveness of techniques for reducing the overhead of certifying compilation by measuring the effects their use has on a real Popcorn application, the compiler itself. The selective use of these techniques, which include common-subexpression elimination of types, higher-order type abbreviations, and selective re-verification, can change certificate size and verification time by well over an order of magnitude. We consider this report to be the first quantitative study on the practicality of certifying a real program using a type system not specifically designed for the compiler or source language.
An Architectural Model For Software Reliability Quantification
Authors: C. Smidts, D. Sova, G. K. Mandela
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

Software reliability assessment models in use today treat software as a monolithic block. An aversion towards "atomic" models seems to exist. These models appear to add complexity to the modeling, to the data collection and seem intrinsically difficult to generalize. This paper presents an architecturally based software reliability model and underlines its benefits. The model is based on an architecture derived from the requirements which captures both functional and non-functional requirements and on a generic classification of functions, attributes and failure modes. The model focuses on evaluation of failure mode probabilities and uses a Bayesian quantification framework. Failure mode probabilities of functions and attributes are propagated to the system level using fault trees. The model accounts explicitly for the type of software development life-cycle. It can incorporate any type of prior information, such as results of developers' testing or historical information on a specific functionality and its attributes, and is ideally suited for reusable software. By building an architecture and deriving its potential failure modes, the model forces early appraisal and understanding of the weaknesses of the software, allows reliability analysis of the structure of the system, and provides assessments at a functional level as well as at the system level. The model is applied to a simple example. The model's assessment of reliability tends to be conservative and the model appears to be scalable to larger, more complex problems.
AL-Care medical information system: developing local experience
Authors: M. S. A. Al-Hashimi
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

Medical information systems (MIS) are gaining acceptance in developed countries, and starting to diffuse in some developing countries, due to pressure exerted on improving the quality of health care for their societies, while containing health care cost on one side, and market pressure on the other side. The purpose of this paper is to report on the first Bahraini experience, with respect to a medical information system and its implications on the medical practice in Bahrain Defence Force Hospital (State of the Arabian Gulf), starting from the assessment methodologies, development and implementation strategy, user evaluation and return value. There are several reasons why the Bahraini experience is unique and different from the western world, among these are the assessment study, implementation strategy, training and support from both clinicians and management, in addition to the culture factors.
Automatic Extraction of Reference Linking Information from Online Documents
Authors: Donna Bergmark
Venue:  (2000)

The Web, with its explosive growth, is becoming an efficient resource for up-to-date information for the scientific researcher. Informal online archives are repositories for technical reports. Proceedings are more and more commonly published on the Web. The collection of online journals is growing. Indeed, a good number of online journals are "born digital". Many researchers simply put their papers up on their own web site. The large volume of online material makes it quite desirable to be able to access cited documents immediately from the citing paper. Implementing this direct access is called "reference linking". Some reference linking services exist today. A number of commercial publishers, recognizing the significant value-added nature of reference linking, have banded together to form the CrossRef organization. The CrossRef publishers share their metadata, which enables them to interlink their journals. This metadata is not, however, available without a fee to organizations or individuals outside of CrossRef. The vast majority of online scholarly literature is accompanied by little or no metadata. Since it is desirable to link up this literature as well, the problem of automatically reference linking online scholarly literature in the absence of metadata and author intervention is a problem very much worth considering. This paper explores this problem in detail, and presents some algorithms for extracting metadata from online texts and linking full-text documents together. The extent to which reference linking of the online literature can be done automatically is therefore the main topic of this paper.
Premiere 6.5 Fundamentals, 1 edition
Authors: Dennis Chominsky
Venue:  (2003)

:Whether you have some experience with Premiere or know some video-editing basics but are new to Premiere, Premiere 6.5 Fundamentals is the book for you. You'll find a wide variety of tips and tricks that have saved time and provided benefits in real video productions. From editing a piece for broadcast on the network television level to editing your personal home videos, the topics covered in this book give you the insight you need to take a project from start to finish. 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
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
Authors: Boros Endre, Elbassioni Khaled, Gurvich Vladimir, Khachiyan Leonid, Makino Kazuhisa
Venue:  (2001)

We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that for any monotone system of $r$ linear inequalities in $n$ variables, the number of maximal infeasible integer vectors is at most $rn$ times the number of minimal integer solutions to the system. This bound is accurate up to a $polylog(r)$ factor and leads to a polynomial-time reduction of the enumeration problem to a natural generalization of the well-known dualization problem for hypergraphs, in which dual pairs of hypergraphs are replaced by dual collections of integer vectors in a box. We provide a quasi-polynomial algorithm for the latter dualization problem. These results imply, in particular, that the problem of incrementally generating all minimal integer solutions to a monotone system of linear inequalities can be done in quasi-polynomial time.
Process measurement through process modeling and simulation
Authors: K. E. Huff
Venue: Proceedings of the 10th International Software Process Workshop (1996)

Measurement is an important part of the characterization of a process and the context in which it should be used and reused. We discuss our experience using process modeling to support process/product measurement. We briefly introduce APEX, a process modeling and simulation tool that embeds a Petri net representation in a discrete event simulation environment. Then, we discuss how process modeling and simulation with APEX supports experimentation with aspects of a measurement plan, and allows the evaluation and refinement of a plan prior to its deployment.
Antitrust Abuse in the New Economy: The Microsoft Case
Authors: Richard L. Gordon
Venue:  (2002)

:Readers in economics, law and public policy will find this analysis enlightening. 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
Co-Cited Author Maps as Interfaces to Digital Libraries: Designing Pathfinder Networks in the Humanities
Authors: Jan Buzydlowski
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Using data from the Arts & Humanities Citation Index for 1988-1997, we are attempting to generate co-cited author maps in real time that can serve as interfaces for document retrieval. Our novel approach is to start the maps by entering the name of a single author. Our system obtains a rank-ordered list of the other authors who are most often co-cited with the input name (e.g., the top 50) and then systematically pairs these other authors in turn to obtain their co-citation counts. The resulting matrix can be passed to a mapping program, which groups the authors meaningfully to show the structure of the field implied by the input author's name. At present, we are experimenting with Pathfinder Networks (PFNETs) as the mapping program, and show a PFNET for 25 authors in hermeneutics, a major field of the humanities. The documents co-citing the mapped authors are candidates for retrieval. We discuss desirable features and design considerations in retrieval interfaces based on PFNETs.
Independence of the Axioms of Boolean Algebra in Multiple-Valued Logic
Authors: Tomoko Ninomiya, Masao Mukaidono
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

We apply the Method of Indeterminate Coefficients to examine independence of some sets of axioms of Boolean algebra and to list up some candidates of independent and complete sets of axioms of Boolean algebra. In addition, we prove for some of some candidates that they are in fact independent and complete.
Subscription as a Model for the Architecture of Embedded Systems
Authors: Maarten Boasson
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Embedded systems have one characteristic that directly influences their design more than any other: they need to keep up with events in their environment. Whereas ordinary systems generally require their environment to adapt to the behavior of the system, embedded systems need to have the opposite attitude and must themselves adapt to their environment. This requirement implies that there must be progress at all times, regardless of what the internal status of the system may be: hardware malfunctions or software errors may never, to the extent possible, result in halting such a system. One direct consequence of this observation is that traditional architectures are less than ideally suited for designing this type of system. In many architectures there is synchronous communication between cooperating software functions, and even if asynchrony is introduced, there is generally an asymmetric relation between such functions: at least one of them has knowledge of the other. These properties reduce the resilience of systems to problems of various kinds, and lead to very complex design problems. It will be argued that subscription is a much better model for organizing the communication inside embedded systems. In this model, components have no knowledge about each other, communication channels are established only when the need to receive certain data elements is explicitly expressed by a function, and transfer of data is autonomously handled by the architecture upon production of a new element.
Compiling for Runtime Code Generation (Extended Version)
Authors: Frederick Smith, Dan Grossman, Greg Morrisett, Luke Hornof, Trevor Jim
Venue:  (2000)

Cyclone is a programming language that provides explicit support for dynamic specialization based on runtime code generation. To generate specialized code quickly, our Cyclone compiler uses a template based strategy in which pre-compiled code fragments are stitched together at runtime. To achieve good performance, the pre-compiled fragments must be optimized. This paper describes a principled approach to achieving such optimizations. In particular, we generalize standard flow-graph intermediate representations to support templates, define a formal mapping from (a subset of) Cyclone to this representation, and describe a data-flow analysis framework that supports standard optimizations. This extended version contains two mappings to the intermediate representation, a less formal one that emphasizes the novelties of our translation strategy and a purely functional one that is better suited to formal reasoning.
Transformation of Regular Non-Dominated Coteries
Authors: Makino Kazuhisa, Kameda Tiko
Venue:  (1999)

A coterie is a family of subsets such that every pair of subsets has at least one element in common but neither is a subset of the other. A coterie $C$ is said to be non-dominated (ND) if there is no other coterie $D$ such that, for $\forall Q \in C$, there exists $Q'' \in D$ satisfying $Q'' \subseteq Q$. We introduce an operator $\sigma$, which transforms a ND coterie to another ND coterie. A regular coterie is a natural generalization of a ``vote-assignable" coterie, which is used in some practical applications. We show that any ``regular" ND coterie $C$ can be transformed to any other regular ND coterie $D$ by judiciously applying $\sigma$ operations to $C$ at most $|C|+|D|-2$ times. As another application of the $\sigma$ operation, we present an incrementally-polynomial-time algorithm for generating all regular ND coteries. We then introduce the concept of ``g-regular" function, as a generalization of availability. We show how to construct an optimum coterie $C$ with respect to a g-regular function in $O(n^3|C|)$ time. We also discuss the structures of optimum coteries with respect to a g-regular function.
A Tabular Interface for Automated Verification of Event-Based Dialogs
Authors: Hung Wang, Gregory Abowd
Venue:  (1994)

In this report, we investigate the feasibility of a tabular interface for the specification and analysis of event-based dialogues. These dialogues are used to define high-level descriptions of interactive systems, and they are based on Olsen''s Propositional Production System (PPS) notation. The simulation of the abstract user-system dialogue is an effective means of matching a design with an expected task model. Monk and Curry have produced a prototype dialogue simulation tool, the Action Simulator, which demonstrates how a tabular paradigm can be used to specify and simulate the dialogue. Further analysis of the dialogue can uncover problems which are not so easy to detect with simulation. If we view the dialogue as defining a finite state machine, then we can make use of powerful model verification tools, such as Clarke''s Symbolic Model Verifier (SMV) tool, to perform more powerful analyses on the dialogue. We also find that the tabular paradigm for input is an interesting alternative to the input language for the SMV tool. We provide in this report a mechanical translation from the tabular dialogue specification into SMV and provide templates or heuristics for various reachability analyses using the Computation Tree Logic (CTL) formalism. This research, therefore, presents the beginnings of two significant contributions. For the HCI community, we show how model verification tools can be used to provide a more powerful analytic technique beyond simulation for the specification and design of interactive dialogues. For the model verification community, we demonstrate the possibility of developing a simpler interface to specify and analyze certain finite state machines.
Visual Data Mining: Techniques and Tools for Data Visualization and Mining
Authors: Tom Soukup, Ian Davidson
Venue:  (2002)

:Marketing analysts use data mining techniques to gain a reliable understanding of customer buying habits and then use that information to develop new marketing campaigns and products. Visual mining tools introduce a world of possibilities to a much broader and non-technical audience to help them solve common business problems.* Explains how to select the appropriate data sets for analysis, transform the data sets into usable formats, and verify that the sets are error-free* Reviews how to choose the right model for the specific type of analysis project, how to analyze the model, and present the results for decision making* Shows how to solve numerous business problems by applying various tools and techniques* Companion Web site offers links to data visualization and visual data mining tools, and real-world success stories using visual data mining
Tree and Forest Volumes of Graphs
Authors: Kelmans Alexander, Igor Pak, Postnikov Alexander
Venue:  (2000)

The tree volume of a weighted graph $G$ is the ``sum'''' of the tree volumes of all spanning trees of $G$, and the tree volume of a weighted tree $T$ is the product of the edge weights of $T$ times the ``product'''' of the letters of the Pr\"{u}fer code of $T$ where the vertices of $G$ are viewed as independent indeterminants that can be multiplied and commute. The forest volume of $G$ is the tree volume of the graph $G^c$ obtained from $G$ by adding a new vertex $c$ and connecting every vertex of $G$ with $c$ by an arc of weight 1. We show that the forest volume is a natural generalization of the Laplacian polynomial of graphs and that it also can be expressed as the characteristic polynomial of a certain matrix similar to the Laplacian matrix. It turns out that the forest volumes of graphs possesses many important properties of the Laplacian polynomials, for example, the reciprocity theorem holds also for the forest volumes. We describe two constructions of graph compositions, and show that the forest volume of a composition can be easily found if the ``structure'''' of the composition and the forest volumes of the graph--bricks are known. As an illustration of the results on the forest volume of graph--compositions we give a combinatorial interpretation and proof of Hurwitz''s identity. Keywords: graph, tree, forest spanning tree, Laplacian matrix and polynomial, tree and forest volume.
On the Average Path Length in Decision Diagrams of Multiple-Valued Functions
Authors: J. T. Butler, T. Sasao
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

We consider the path length in decision diagramsfor multiple-valued functions. This is an importantmeasure of decision diagram, since this models thetime needed to evaluate the function. We focus onthe average path length (APL), which is the sumof the path lengths over all ssignments of valuesto the variables divided by the number of assignments. First, we show multiple-valued functionin which the APL is markedly affected by the orderof variables. We show upper and lower bounds onthe longest path length in decision diagram ofmultiple-valued function. Next, we derive the APLfor individual functions, the MAX, ALL_MAX, andMODSUM functions. We show that the latter twofunctions achieve the lower and upper bound on theAPL over all n-variable r-valued functions. Finally,we derive the average of the APL for two sets offunctions, symmetric functions and all functions.