ppxscal/embedding_network huggingface dataset:
The Information Revolution Myth or Reality
Authors: Gerard Salton
Venue:  (1975)

The early work in the design of automatic information systems, exemplified by the contributions of H. P. Luhn and others, now goes back nearly twenty years. It may be useful to ask whether a great deal has changed in these twenty years, and if so, what contributions have been most influential and indicative of future trends. Two contradictory opinions are often heard: the optimists speak of the information revolution and think of mechanized international information networks; the pessimists, on the other hand, assert that little has changed and point to the continued use for well over twenty years of substantially unchanged file organizations, indexing systems, and search techniques. An attempt is made to separate fact from fiction by describing where we have stood still, and where progress has occurred. In particular, the technological environment which has evolved in many directions is distinguished from most of the intellectual components of information retrieval which have remained unchanged. Suggestions are also made relating to the design and operations of future automatic information systems. 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
Pinwheel Scheduling for Fault-tolerant Broadcast Disks in Real-time Database Systems
Authors: Sanjoy Baruah, Azer Bestavros
Venue:  (1996)

Abstract The design of programs for broadcast disks which incorporate real-time and fault-tolerance requirements is considered. A generalized model for real-time fault-tolerant broadcast disks is defined. It is shown that designing programs for broadcast disks specified in this model is closely related to the scheduling of pinwheel task systems. Some new results in pinwheel scheduling theory are derived, which facilitate the efficient generation of real-time fault-tolerant broadcast disk programs.
Tree-bank Grammars
Authors: Eugene Charniak
Venue:  (1996)

By a ``tree-bank grammar'''' we mean a context-free grammar created by reading the production rules directly from hand-parsed sentences in a tree bank. Common wisdom has it that such grammars do not perform well, though we know of no published data on the issue. The primary purpose of this paper is to show that the common wisdom is wrong. In particular we present results on a tree-bank grammar based on the Penn Wall Street Journal tree bank. To the best of our knowledge, this grammar out-performs all other non-word-based statistical parsers/grammars on this corpus. That is, it out-performs parsers that consider the input as a string of tags and ignore the actual words of the corpus.
Take control of TCPA
Authors: David Safford, Jeff Kravitz, Leendert van Doorn
Venue: Linux Journal (2003)

The free code behind IBM's new security chip. Menace or protector?
IPSC-MATLAB Reference Manual
Authors: Shirish Chinchalkar
Venue:  (1992)

IPSC-MATLAB is a programming environment for running MATLAB programs on the Intel iPSC/860 hypercube. The system is designed such that the user can execute computationally intensive poitions of MATLAB programs on the hypercube, whereas all other code is executed on a Sun-4 workstation (SPARCstation). The workstation acts as a remote host for the hypercube. MATLAB variables can migrate from the front-end (workstation) to the back-end (hypercube) and vice versa. IPSC-MATLAB combines the flexibility of MATLAB programming with the speed of the Intel hypercube. Writing parallel programs in Fortran or C for the hypercube is a tedious task. Testing and debugging programs is difficult and time consuming. On the other hand, MATLAB, which runs on workstations, provides a convenient means of writing programs. However, because of the limited speed and memory of workstations, large problems cannot be solved. The hypercube is fast and has more memory. IPSCMATLAB attempts to use the workstation as well as the hypercube to provide the user with a fast, flexible environment for programming.
On the Inadequacy of Ordinary Preconditions for the Practical Design and Verification of Programs
Authors: Robert L. Baber
Venue: Proceedings of the The Ninth International Symposium on Software Reliability Engineering (1998)

A mathematical basis for verifying computer programs has existed for some time but is used in practice only relatively infrequently. One of the reasons often cited for this lack of acceptance is that the proposed approaches fail to address certain questions of practical importance, e.g. whether a program even executes successfully or not. The commonly propounded proof rules do not deal with "run time" errors. While such considerations can be brought into a formal analysis of program correctness, previously proposed methods add extra steps and significant complexity to the process or are at least perceived by many to do so.Traditional approaches to program correctness distinguish between partial and total correctness. Very frequently the only difference between them is the consideration of whether loops terminate or not. This is not sufficient in practice, where the failure of even a simple assignment statement to execute must be considered. Three levels of correctness are required: partial correctness (as defined traditionally), semi-strictly total correctness and strictly total correctness. Semi-strictly total correctness guarantees that each individual statement in the program executes with a defined result (no "run time" errors) but permits loops (and recursive calls) to execute indefinitely. Strictly total correctness guarantees in addition that execution of the entire program terminates.This paper presents straightforward extensions to traditional proof rules for semi-strict and strict preconditions, enabling considerations of total program correctness to be directly and simply integrated into the process of proving a program partially correct.
Automatic Test Program Generation from RT-Level Microprocessor Descriptions
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

The paper addresses the issue of microprocessor and microcontroller testing, and follows an approach based on the generation of a test program. The proposed method relies on two phases: in the first, a library of code fragments (named macros) is generated by hand based on the knowledge of the instruction set, only. In the second phase, an optimization algorithm is run to suitably select macros and values for their parameters. The algorithm only relies on RT-level information, and exploits a suitable RT-level fault model to guide the test program generation. A major advantage of the proposed approach lies in the fact that it does not require any knowledge about the low level implementation of the processor. Experimental results gathered on an i8051 model using a prototypical implementation of the approach show that it is able to generate test programs whose gate-level fault coverage is higher than the one obtained by comparable gate-level ATPG tools, while the computational effort and the length of the generated test program are similar. The method is thus suitable to be applied during the incoming inspection test phase performed on small processors, and for developing implementation-independent test suites for soft IP cores. 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
Neural Synthesis of Teleo-Reactive Programs
Authors: Jose Ramírez
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

The Teleo-Reactive (TR) formalism has been presented as a new programming paradigm to write agent programs with reactive control and goal oriented behavior. The formalism is based in a circuit semantics that intuitively can be converted directly to a layered neural network architecture. But to capture the essence of the TR paradigm, a mechanism of synthesis must be developed, allowing to express in a neural architecture 1) the reactive nature of the programs, 2) the incremental learning of TR sequences and trees and 3) the continuous feedback from the world. We present an analysis of TR programs and a method to synthesize those programs into an ontogenic neural network model that captures all the features of the program and can evolve with the agent as he explore the world. 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
Developing .NET Web Services with XML
Authors: David Jorgensen, Jonothon Ortiz
Venue:  (2002)

:Web Services provide a new level of interaction to all kinds of applications. The ability to access and use a remote Web Service to perform a function within an application enables programmers to quickly deliver more sophisticated applications in less time. Programmers no longer have to create and maintain all functions of an application. Reusability is also greatly enhanced by creating multiple Web Services that perform functions in multiple applications, thus freeing up time and resources to work on other aspects of specific projects. About the Authors: David Jorgensen (MCP) David works for Alliance Enterprises, Inc. in Olympia WA, which develops Web-based case management software for social service organizations such as state vocational rehabilitation agencies. His latest project; convert a state agencies data, involved complex SQL Server Data Transformation Packages David is a contributor to Syngress Publishings C# .NET Web Developers Guide (ISBN: 1-928994-50-4), and the .NET Mobile Web Developer's Guide (ISBN: 1-928994-56-3). Patrick Coelho (MCP) is an Instructor at The University of Washington Extension, North Seattle Community College, Puget Sound Center, and Seattle Vocational Institute, where he teaches courses in Web Development (DHTML, ASP, XML, XSLT, C#, and ASP.NET). Patrick is a Co-Founder of DotThatCom.com, a company that provides consulting, online development resources, and internships for students. Patrick is a contributor to Syngress Publishings ASP .NET Developers Guide (ISBN: 1-928994-51-2), C# .NET Web Developers Guide (ISBN: 1-928994-50-4), and .NET Mobile Web Developers Guide (ISBN: 1-928994-56-3).
A Reliable Multicast Algorithm for Mobile Ad Hoc Networks
Authors: Thiagaraja Gopalsamy, Mukesh Singhal, D. Panda, P. Sadayappan
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path between a pair of nodes. The algorithm has the characteristics of using an undirected graph for its routing operations rather than a fixed structure like a tree or a mesh. Previously proposed routing metrics for mobile ad hoc networks were designed for use in wired environments, where link stability is not a concern. We propose a new metric, called the lifetime, which is more appropriate for mobile ad hoc networks. The lifetime metric is dependent on the predicted future life of the link under consideration. We developed a simulator for the mobile ad hoc networks, which is portable and scalable to a large number of nodes. Using the simulator, we carried out a simulation study to analyze the effectiveness of the routing metrics and the performance of the proposed reliable multicast algorithm. The simulation results show that thelifetime metric helps achieve better performance in mobile ad hoc environments than the hop count metric.
Constructing some Distributed Programs
Authors: H. P Hofstee
Venue:  (1992)

No abstract available.
Modeling Uncertainty in RC Timing Analysis
Authors: Cheryl L. Harkness, Daniel P. Lopresti
Venue:  (1989)

Even subtle disturbances in the manufacturing process used to fabricate a chip introduce variations in the values of circuit parameters (e.g., capacitances, resistances, transistor sizes). Although expected values can be obtained for all such parameters, the true values are likely to differ from those stated. Given the range of possible values for each input parameter, our goal is to determine bounds on the resulting timing behavior produced by these variations. We propose representing uncertain parameters as intervals and present a theoretical framework based on interval algebra for manipulating these ranges. To illustrate this methodology, we modify an existing RC analysis algorithms (Crystal''s PR-Slope model) to create one which computes worst-case delay bounds when given uncertain input parameters. We provide proofs of correctness for our approach and test its performance. Analysis shows that our algorithm is much more efficient than Monte Carlo simulation and produces bounds with similar accuracy.
FLAMES IN DUSTY MIXTURES -- THEIR STRUCTURE AND STABILITY
Authors: J. Buckmaster, T. Jackson
Venue:  (1993)

The structure and stability of flames in dusty mixtures is investigated. The presence of the dust leads to significant transport of energy by radiation and the fundamental goal of the analysis is to explore to what extent this displaces the classical non-hydrodynamical stability boundaries of the plane deflagration. An approximate description of the radiative transport permits analysis for arbitrary values of both the Planck length and teh Boltzman number. It is shown that the pulsating/traveling-wave instability usually associated with values of Lewis number (Le) bigger than 1 is strongly enhanced by the presence of radiation and can be present even if Le > 1. On the other hand radiation tends to suppress the cellular instability normally associated with values of Le less than 1. The latter is consistent with preliminary experimental observations of Abbud-Madrid and Ronney.
Computing a Segment-Center for a Planar Point Set
Authors: K P Agarwal, Alon Efrat, Micha Sharir, Sivan Toledo
Venue:  (1991)

\indent Given a set $S$ of $n$ points in the plane and a segment $e$, a {\em center placement} of $e$ is a placement (allowing translation and rotation) that minimizes the maximum distance from $e$ to the points of $S$. We present an algorithm for computing a center placement for $S$, whose running time is $O(n^{2} \alpha (n) \, \mbox {log} ^{3}n),$ where $\alpha (n)$ is the inverse Ackermann function. The algorithm makes use of the parametric searching technique of Megiddo.
On Presenting Monotonicity and On EA=<AE
Authors: David Gries
Venue:  (1995)

Two independent topics are treated. First, the problem of weakening/strengthening steps in calculational proofs is discussed and a form of substantiating such steps is proposed. Second, a simple proof of (Ex| R.x: (Ay| S.y: P.x.y)) =< (Ay| S.y: (Ex| R.x: P.x.y)) is presented, which uses the idea of a witness for an existnetial quantification. 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
EcomRISK.org : A site to classify and organize the risks of performing business on the Internet
Authors: Aidan S. Marcuss
Venue:  (2001)

As the use of the Internet and other computer networks to transact business grows, there is an ever increasing need for those taking part in those transactions to understand the risks of doing so. While there are many web sites that have created valuable databases of specific vulnerabilities for certain types of hardware and software, there is a lack of focus on attempting to analyze the interaction of businesses, their systems, computer networks, and their customers and the risks that are created by either intended or unattended interactions. EcomRISK.org is a web site that presents a clear taxonomy to classify these risks and provides other features to aid in the general discussion of e-commerce risk. The site, and the taxonomy at the center of it, creates a database of these incidents so they can be clearly searched. This paper discusses the creation of EcomRISK.org, from vision to birth. 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
On Real-Time Quasi-Durable Checkpointing
Authors: J. Huang, P. J. Wan, V. Thomas
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Checkpointing is a commonly used technique for fault tolerant computing. However, most of the existing approaches focus on improving checkpointing reliability and performance. This study investigates real-time checkpointing techniques in the context of distributed process control applications where checkpointing and recovery operations must meet timing constraints, such as process deadline and plant state validity. We introduce the notion of quasi-durability, which allows one to make tradeoffs between storage device reliability and the process control and recovery timing constraints. Based on this notion, we define recoverability as the expected validity of the internal plant state used for recovery in case of process failure. We study three protocols for real-time quasi-durable checkpointing and recovery. For each protocol, we analyze its recoverability and give the sufficient and necessary conditions for a set of device to be feasible for checkpointing and recovery.
Tool Interoperability is Key to Improved Design Quality
Authors: Richard Goldman, Karen Bartleson
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Deep submicron processes are driving silicon complexity, time-to-market windows continue to shrink and experienced design engineers are at a premium. The System-on-a-Chip era is approaching and pushing technology at every turn.As a result, companies are looking for ways to get the most out of their design resources. High quality design systems, developed from powerful EDA tools and interface software, ensure more efficient use of resources und ultimately, high quality designs.Unfortunately, many engineers are spending time wrestling new tools into their design systems instead of designing or verifying their designs. The need for EDA tool interoperability has never been greater. Fortunately, some progressive EDA companies are spearheading efforts to improve tool interoperability. This paper will explore the benefits of tool interoperability and define several ways that it can be achieved.
Voronoi Diagrams and Arrangements
Authors: Herbert Edelsbrunner, Raimund Seidel
Venue:  (1985)

We propose a uniform and general framework for defining and dealing with Voronoi Diagrams. In this framework a Voronoi Diagram is a partition of a domain $D$ induced by a finite number of real valued functions on $D$. Valuable insight can be gained when one considers how these real valued functions partition $D \times R$. With this view it turns out that the standard Euclidean Voronoi Diagram of point sets in $R^{d}$ along with its order-$k$ generalizations are intimately related to certain arrangements of hyperplanes. This fact can be used to obtain new Voronoi Diagram algorithms. We also discuss how the formalism of arrangements can be used to solve certain intersection and union problems.
Flexible Manufacturing Control with PLC, CNC, and Software-Agents
Authors: Ronald Schoop, Ralf Neubert, Boris Suessmann
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

This paper reports on the design and realization of a flexible and robust control system, based on an agent architecture. Regarding the increasing availability, performance and acceptance of distributed object-oriented systems as well as the growing number of agent-oriented software it is natural to adapt and use the capabilities of both object-oriented and agent-oriented software as a platform for distributed industrial applications. The agent-oriented software components are implemented as intelligent add-ons to conventional PLC and CNC control equipment as well as Industrial PCs operating under Windows NT and interfacing via DCOM and Ethernet. It is used for the control of a flexible manufacturing system-cylinder head production at DaimlerChrysler, Germany. Similar known systems are in research status only. The results of a 2 (and partly 3) shift production since more than one year are outstanding: k-factor of 0.89 by tolerating failed machines, production of specific, none pre-planned workpieces.
Davenport--Schinzel Sequences and Their Geometric Applications
Authors: K P Agarwal, Micha Sharir
Venue:  (1995)

An $(n,s)$ Davenport--Schinzel sequence, for positive integers $n$ and $s$, is a sequence composed of $n$ symbols with the properties that no two adjacent elements are equal, and that it does not contain, as a (possibly non-contiguous) subsequence, any alternation $a \cdots b \cdots a \cdots b \cdots$ of length $s+2$ between two distinct symbols $a$ and $b$. The close relationship between Davenport--Schinzel sequences and the combinatorial structure of lower envelopes of collections of functions make the sequences very attractive, because a wide variety of geometric problems can be formulated in terms of lower envelopes. A close to linear bound on the maximum length of Davenport--Schinzel sequences enable us to derive sharp bounds on the combinatorial structure underlying various geometric problems, which in turn yields efficient algorithms for these problems. This paper gives a comprehensive survey on the theory of Davenport--Schinzel sequences and their geometric applications.
Minimum Classification Error Training for Online Handwritten Word Recognition
Authors: Alain Biem
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

We describe an application of the Minimum Classification Error (MCE) training criterion to online unconstrained-style word recognition. The described system uses allograph-HMMs to handle writer variability. The result, on vocabularies of 5k to 10k, shows that MCE trainingachieves around 17% word error rate reduction when compared to the baseline Maximum Likelihood system.
Variational approach to the Thomas--Fermi equation
Authors: Ji-Huan He
Venue: Applied Mathematics and Computation (2003)

By the semi-inverse method, a variational principle is obtained for the Thomas-Fermi equation, then the Ritz method is applied to solve an analytical solution, which is a much simpler and more efficient method.
Aggressive release consistency for software distributed shared memory
Authors: S. S. Fu, Nian-Feng Tzeng
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

As a software-based distributed shared memory (DSM) system is especially sensitive to the traffic amount over the network, we propose a new software DSM model. The model postpones the enforcement of data coherence at the time of the first shared memory access after an acquire, instead of at the time of the acquire like the lazy release consistency (LRC) model. This leads to an aggressive implementation of release consistency and thus a reduced number of messages transferred over the network when compared with LRC. Our model is evaluated on the basis of the TreadMarks framework using three applications, where TreadMarks is a software DSM implementation following LRC. The experimental results on a network of workstations indicate that our model leads to fewer messages transmitted across the network than LRC, by over 16% for one application and over 12% for the other two.