ppxscal/embedding_network huggingface dataset:
Automatic Assignment of Soft Boolean Operators
Authors: Gerard Salton, Ellen M. Voorhees
Venue:  (1984)

The conventional bibliographic retrieval systems are based on Boolean query formulations and inverted file implementations. Such systems provide rapid responses in answer to search queries but they are not easy to use by uninitiated patrons. An extended Boolean retrieval strategy has been devised in which the Boolean operators are treated more or less strictly, depending on the setting of a special parameter, known as the p-value. The extended system is much more forgiving than the conventional system, and provides better retrieval effectiveness. In this study various problems associated with the determination of appropriate p-values are discussed, and suggestions are made for an automatic assignment of p-values. Evaluation output is included to illustrate the operations of the suggested procedures.
A User''s Guide to The COPE Programming Environment
Authors: Richard W. Conway, Dan DeJohn, Steven L. Worona
Venue:  (1984)

NOT SUPPLIED
Reliable Laser Programmable Gate Array Technology
Authors: Hu Huang
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

Field-Programmable Gate Arrays have become popular ever since their introduction. Compared to other digital circuit implementation media, they have lower NRE cost and rapid turnaround with the penalties of reduced speed and larger size. Thus better FPGA programmable switch technology is desired in order to gain speed and density advantages. In this paper, Laser-induced MakeLinkTM technology is proposed as a programmable switch element. The Electrical resistance is as low as 0.8 W to 11 W, depending on the size of the link, which is 2-3 orders smaller than that of NMOS transistor in a SRAM based FPGA. Thus the speed improvement for Laser Field-Programmable Gate Array (LFPGA) is significant. Other features of Laser-induced vertical links technology, such as small size and radiation hardness, can also greatly improve the FPGA performance. The cluster-based LFPGA with 128 by 64 basic logic elements (BLE) is laid out under a 0.5mm commercialized technology. The chip size is about 138mm2.
Online Performance-Improvement Algorithms
Authors: Prasad Chalasani
Venue:  (2001)

The results presented in this thesis contribute to two areas of computer science: machine learning and on-line algorithms. One limitation of current theoretical approaches to learning is that most of them involve function approximation, i.e., the learner improves the accuracy of its approximation to an unknown function as it sees more samples of the function. This thesis presents algorithms for improving performance at other tasks, such as navigation and and paging. Specifically, these algorithms are online algorithms whose competitiveness improves when repeatedly applied to the same problem. The design of such algorithms is a new challenge in the area of online algorithms: the algorithms must not only be competitive on each application, but must also acquire useful information to improve their future competitiveness. We present a general framework based on task systems for studying such algorithms. One result in the thesis is an online navigation algorithm for a robot traveling back and forth between two points s and t (distance n apart) in a scene filled with unknown axis-parallel rectangular obstacles. For each i > n, the ith trip of the robot is guaranteed to be within a - ___ O(/n/i) factor of the shortest s-t path length L, and we show that up to constant factors this is the best a deterministic algorithm can do. This algorithm is based on a smooth search-quality tradeoff: we design ____ an algorithm that given any k > n, searches a distance O(L /n/k) and - finds an s-t path of length O(L /n/k). A key insight is that this tradeoff can be achieved by optimally traversing a certain tree structure based on the obstacles. For a version of the paging problem where the pager is aware only of page faults, we give an algorithm whose average competitiveness improves when the same page request sequence is repeated several times. The thesis also applies competitive analysis to design an online algorithm for a natural extension of the standard function prediction problem, where the function labeling the examples switches unpredictably between two unknown functions.
Real-Time Programming-in-the-Large: The Case of Monitoring and Control Systems
Authors: Andrea Savigni, Francesco Tisato
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

The design of object-oriented real-time distributed systems is especially hard due also to the fact that some issues (distribution) are dealt with too early in the system life-cycle, others (strategy) are hard-coded as programming-in-the-small issues, others (time) are hidden inside the operating system kernel. We present a reference architecture for monitoring and control systems that addresses the first two of these issues. The architecture lifts distribution, activation and timing up to an explicit, programming-in-the-large level.
Entity-Life Modeling: Modeling a Thread Architecture on the Problem Environment
Authors: Bo I. Sandén
Venue: IEEE Software (2003)

Object-oriented development identifies classes and relationships in the problem domain and carries them seamlessly into design and implementation. Entity-life modeling extends this modeling idea into the time domain. ELM identifies sequences of event occurrences in the problem space called event threads, which form the basis for threads in software. ELM offers two modeling techniques. The basic technique mechanically finds event threads in the problem, while the pattern technique deals with concurrency patterns in the problem, such as users contending for resources. Such patterns are modeled by means of threads and synchronized objects in software. ELM supports the notion of a concurrency level, which indicates the number of threads that is, in a certain sense, optimal for a given problem.
The GAZER Theorem Prover: Description and Reference Manual
Authors: Dave Barker-Plummer
Venue:  (1989)

This paper describes version 2.0 of the GAZER theorem proving system. GAZER is a sequent-based theorem prover for first order logic. It draws on existing techniques and original research to form a novel contribution to automated reasoning research. GAZER is written in the Quintus dialect of PROLOG and is available from the author on request.
Subjectivity and GenVoca Generators
Authors: Don Batory
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

The tenet of subjectivity is that no single interface can adequately describe any object; interfaces to the same object will vary among different applications. Thus, objects with standardized interfaces seem too brittle a concept to meet the demands of a wide variety of applications. Yet, objects with standardized interfaces is a central idea in domain modeling and software generation. Standard interfaces make objects plug-compatible and interchangeable, and it is this feature that is exploited by generators to synthesize high-performance, domain-specific software systems. Interestingly, generated systems have customized interfaces that can be quite different from the interfaces of their constituent objects. In this paper, we reconcile this apparent contradiction by showing that the objects (components) in the GenVoca model of software generation are not typical software modules; their interfaces and bodies mutate upon instantiation to a "standard" that is application-dependent.
Mastering BEA WebLogic Server: Best Practices for Building and Deploying J2EE Applications
Authors: Gregory Nyberg, Robert Patrick, Paul Bauerschmidt, Jeff McDaniel, Raja Mukherjee
Venue:  (2003)

:* Designed to show experienced developers how to become power developers with BEA WebLogic* Provides a comprehensive reference guide covering WebLogic installation, a utilities reference, tag library reference, and class and descriptor references* Covers BEA WebLogic Server version 8.0 and earlier versions* A perfect companion to the bestselling book, Mastering Enterprise JavaBeans, Second Edition* Companion Web site includes technology updates and links to related sites
From Software Metrics to Software Measurement Methods: A Process Model
Authors: Jean-Philippe Jacquet, Alain Abran
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

This paper presents a process model for software measurement methods. The proposed model details the distinct steps from the design of a measurement method, to its application, then to the analysis of its measurement results and last to the exploitation of these results in subsequent models, such as in quality and estimation models. From this model, a validation framework can be designed for analyzing whether or not a software metrics could qualify as a measurement method. The model can also be used for analyzing the coverage of the validation methods proposed for software metrics.
Multi-valued decoder based on resonant tunneling diodes in current tapping mode
Authors: Hao Tang, H. C. Lin
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

A multiple valued decoder based on RTDs is proposed and the functionality is verified via both simulation and experiment. The proposed circuit is simulated and tested with several single peaked RTD sections connected in series (stacked RTDs). The design uses current tapping techniques to switch on only one RTD section exclusively in order to create a single literal function. The number of RTD sections connected in series therefore determines the radix of signals used in the decoder.
Efficient in-place sorting algorithms using feasible parallel machine models
Authors: B. Calidas
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

We present a simple and general parallel sorting scheme, ZZ-sort, which can be used to derive a class of efficient in-place sorting algorithms on realistic parallel machine models. We prove a tight bound for the worst case performance of ZZ-sort. We also demonstrate the average performance of ZZ-sort by experimental results obtained on a MasPar parallel computer. Our experiments indicate that ZZ-sort can be incorporated into a distributed memory parallel computer system as a standard routine, and this routine is useful for space critical situations. Finally, we show that ZZ-sort can be used to convert a non-adaptive parallel sorting algorithm into an in-place and adaptive one by considering the problem of sorting an arbitrarily large input on fixed-size reconfigurable meshes.
Axial Representation for Modeling 3D Shapes
Venue: Proceedings of the International Conference on Information Visualisation (2000)

This paper presents a technique for representing animal models in terms of a set of axial curves. An object or an animal model is defined as the union of a set of different parts. Each part of the object is represented in an axial space defined by an axial curve-pair - a primary curve and an orientation curve. A hierarchy of axial curve-pairs defines the relative positions and orientations of different parts of the object. Adjusting the axial curve-pairs can modify the shape of the object. Adjusting the axial curve-pairs according to some motion constraints produces different postures of an animal model. This technique is particularly suitable for modeling animals such as fishes and snakes. 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
Controlled Flux Results in Stable Decision Trees
Authors: Dimitrios Kalles, Athanassios Papagelis
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

This work deals with stability in incremental induction of decision trees. Stability problems arise when an induction algorithm must revise a decision tree very often and oscillations between similar concepts decrease learning speed. We introduce a heuristic and an algorithm with theoretical and experimental backing to tackle this problem.
Dynamic Half-Space Range Reporting and Its Application
Authors: K P Agarwal, Jiri Matousek
Venue:  (1991)

\indent We consider the half-space range reporting problem: Given an $n$ point set $S$ in ${\bf R} ^d$, preprocess it into a data structure, so that, given a query half-space $\gamma$, the points of $S \cap \gamma$ can be reported efficiently. We extend previously known static solutions to dynamic ones, supporting insertions and deletions of points of $S$. For given $m, n \leq m \leq n ^ {\lfloor d/2 \rfloor}$ and an arbitrarily small positive constant $\varepsilon$, we achieve $O(m^{1+ \varepsilon})$ space and preprocessing time, $O \frac {n}{m^{1/ \lfloor d/2 \rfloor}} \, \mbox {log} \, n)$ query time and $O(m^{1 + \varepsilon} / n)$ amortized update time $(d \geq 3)$. We present, among others, the following applications: an $O(n ^ {1 + \varepsilon})$ time algorithm for computing convex layers in ${\bf R}^3$, and an output sensitive algorithm for computing a level in an arrangements of planes in ${\bf R} ^3$, whose time complexity is $O((b+n) \, n^ \varepsilon)$, where $b$ is the size of the level.
An Efficient Protocol for Call Setup and Path Migration in IEEE 802.6 Based Personal Communication Networks
Authors: Xuefeng Dong, Ten H. Lai
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

Recently, DQDB (IEEE 802.6) MAN has been proposed as a component of the Personal Communication Networks, in which base stations of wireless infrastructures are connected by a number of DQDBs which in turn are connected by bridges. We propose a protocol for call setup and path migration in a cluster of DQDBs. To pursue simplicity, efficiency, and fastness in path setup, we use a link-state-like routing method for path selection, and a source-routing-based protocol for path establishment. The feasibility of the source routing protocol in a DQDB cluster is guaranteed by our novel labeling scheme. Each label represents the routing direction from one DQDB to another such that a path can be represented by a sequence of labels. Because of the locality property of the labels, a few bits are enough to denote the labels unambiguously. Using multi-bit labels instead of multi-byte physical addresses, a path can be specified in a 53-octet DQDB slot.
On Computer Supported Collaborative Writing Tools for Distributed Environments
Authors: Kai H. Chang, Yu Gong, Tim Dollar, Shefali Gajiwala, Byong G. Lee, A. W Wear
Venue:  (1994)

Traditional computerized writing tools designed for single user access often create barriers to group collaboration. Usually, participants have to work in an interleaved fashion to prevent inconsistency. Oral communication is normally used for coordinating group activities. With the recent development of computer networks and widespread deployment of networked workstations, automating the group writing process for geographically distributed users has become feasible. This paper introduces a Distributed Collaborative Writing Aid (DCWA) developed for networked workstations. The DCWA can help users cooperate on a writing task (such as programming, report writing, note taking, etc.) logically, conveniently , and efficiently. Among many important open problems, the paper addresses issues related to the four major components in the DCWA. These are group organization, multicasting within groups, distributed database, and user interface.
Combine and Conquer
Authors: Robert F. Cohen, Roberto Tamassia
Venue:  (1992)

We present a general technique for dynamizing a class of problems whose underlying structure is a computation graph embedded in a tree. We associate values, called {\em attributes}, with the nodes, paths, and subtrees of our trees. Path attributes form a {\em path attribute system}, if they are maintained in constant time under path concatenation. Additionally, attributes form a {\em tree attribute system} if the tree attributes of the tail of a path $\Pi$ are determined in constant time from the path attributes of $\Pi$. We also introduce a new data structure called a {\em linear attribute grammar}. An {\em attribute grammar} is a tree-based expression where the values a node $\mu$ are calculated from the values at the parent, siblings, and/or the children of $\mu$. A linear attribute grammar, is an attribute grammar where all dependencies are linear. Our contributions can be summarized as follows. We provide a framework for maintaining attribute systems on trees in a fully dynamic environment. We show that given a semiring ${\cal S}$, a set of linear expressions with binary and unary operators over ${\cal S}^k$ can be dynamically maintained in a fully dynamic environment using linear space and logarithmic time per operation. We show that a linear attribute grammar can be dynamically maintained in a fully dynamic environment using linear space and logarithmic time per operation. Finally, we present many examples of application of our technique to dynamic graph and geometric problems.
A Bulk Scanning Method for Uncared-for Processes on Classroom UNIX Workstations
Authors: Leo Nagamatsu
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In the University of Aizu, Information Systems and Technology Center (ISTC) has provided quite many UNIX workstations for student classroom facility. Students ¿ some of them are very beginners, often logged out a host with unintentionally left processes. In addition, some of these processes may waste processor resources. In high load averaged hosts, such aimless running processes are often found. We developed a tool for periodical search for such processes. It is to obtain basic information for management and for taking actions to keep these hosts well. In our university, user files are placed in the central file server and ¿on demand¿ mounted when a user starts to use a client host. With this configuration of file, it takes a few seconds for ¿starting up an user environment.¿ This may be a reason of long response time of remote command invocation. We designed the tool with a pipelined parallel processing, and it can collect process information of each host with high throughput. Achieved average processing time for a host is less than one second, while scanning more than 400 workstations. We also report the property of problematic processes found by this tool.
Architecting Systems with UML 2.0
Authors: Morgan Björkander, Cris Kobryn
Venue: IEEE Software (2003)

Signaling the end of the method wars, the Object Management Group (OMG) first standardized the Unified Modeling Language in 1997. The software industry rapidly accepted it as the standard modeling language for specifying software and system architectures. Although UML is primarily intended for general-purpose modeling, it's receiving extensive use in diverse specialized areas, such as business process modeling and real-time-systems modeling. Despite these successes, development tools have been slow to realize UML's full potential. In addition, the software industry has evolved considerably during the last six years, and the first version of UML (UML 1.x) is now dated. This article explains how the proposed major revision of UML, UML 2.0, will make the language more current and improve its expressive power and precision. The finalization of the major revision process is expected to be followed by updates to modeling tools that implement the powerful new UML 2.0 features.
End-to-End Predictability in Real-Time Push-Pull Communications
Authors: Kanaka Juvva
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

Push-Pull communications is a real-time middleware service that has been implemented on top of a Resource Kernel operating system. It is a many-to-many communication model that can support multi-participant real-time applications. It covers both "push" (publisher/subscriber model) and "pull" (data transfer initiated by a receiver) communications. Unlike publisher/subscriber model, different publishers and subscribers can operate at different data rates and also can choose another (intermediate) node to act as their proxy and deliver data at their desired frequency.In this paper, we specifically address end-to-end predictability of the push-pull model. The scheduling mechanisms in the OS, the middleware architecture and the underlying network QoS support can impact the timeliness of data. We obtain our end-to-end timeliness and bandwidth guarantees by using a resource kernel offering CPU reservations and the use of a guaranteed bandwidth network (DARWIN) between push-pull end-points. We formally analyze the problem of choosing an optimal proxy location within a network. We discuss our implementation of this system and carry out a detailed performance evaluation on an integrated RT-Mach - Darwin testbed at Carnegie Mellon.Our results open up interesting research directions for the scheduling of computation and communication resources for the applications using the push-pull service. Push-Pull framework can easily be incorporated in RT-CORBA Event Service model.
An Approximation Algorithm for Multiprocessor Scheduling of Trees with Communication Delays
Authors: S. Tayu, M. Katsura, M. Kaneko
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

In this paper, we investigate multiprocessor scheduling of trees considering the communication delay. The objective of our study is to minimize the makespan of the scheduling. We propose an approximation algorithm for computing a scheduling of trees when each task and communication have unit execution times. We show that the approximation difference of the total completion time of our proposal algorithmfrom the optimum is at most [m \over 2], where m is the number of processing elements. We also show that our algorithm is optimal for m = 2.
The Complexity of the Quaternion Product
Authors: Thomas D. Howell, Jean Lafon
Venue:  (1975)

Let X and Y be two quaternions over an arbitrary ring. Eight multiplications are necessary and sufficient for computing the product XY. If the ring is assumed to be commutative, at least seven multiplications are still necessary and eight are sufficient.
When Standards and Best Practices are Ignored
Authors: George Jackelen, Mary Jackelen
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

One purpose for having standards and best practices is to illustrate what experience has shown to be a preferred sequence of events. For example, experience has shown it best to per$orm requirements analysis prior to doing design, design should be done prior to doing software coding, and software coding should be done prior to systems testing. This does not mean each event must be completed prior to going to the next event, nor that the sequence is absolute. However, experience has shown that when the identified sequence is violated (without a justified technical or business reason), risk and cost can increase to the point where the overall effort may fail. This paper presents an actual situation where the standard software model of events and best practices are ignored and the resulting complications. Another problem was late insertion of a procedural requirement that was misunderstood.