ppxscal/embedding_network huggingface dataset:
Hybrid Knowledge Bases
Authors: James J. Lu, Anil Nerode, V. s. Subrahmanian
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

Deductive databases that interact with, and are accessed by, reasoning agents in the real world (such as logic controllers in automated manufacturing, weapons guidance systems, aircraft landing systems, land-vehicle maneuvering systems, and air-traffic control systems) must have the ability to deal with multiple modes of reasoning. Specifically, the types of reasoning we are concerned with include, among others, reasoning about time, reasoning about quantitative relationships that may be expressed in the form of differential equations or optimization problems, and reasoning about numeric modes of uncertainty about the domain which the database seeks to describe. Such databases may need to handle diverse forms of data structures, and frequently they may require use of the assumption-based nonmonotonic representation of knowledge.A hybrid knowledge base is a theoretical framework capturing all the above modes of reasoning. The theory tightly unifies the Constraint Logic Programming Scheme of Jaffar and Lassez [12], the Generalized Annotated Logic Programming Theory of Kifer and Subrahmanian [17], and the Stable Model semantics of Gelfond and Lifschitz [7]. New techniques are introduced which extend both the work on Annotated Logic Programming and the Stable Model semantics. (Proofs are omitted from the paper to ensure readability. Complete details of all results may be found in [24].)
Active Stereo: Integrating Disparity, Vergence, Focus, Aperture and Calibration for Surface Estimation
Authors: N. Ahuja, A. L. Abbott
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

An approach to integrating stereo disparity, camera vergence, and lens focus to exploit their complementary strengths and weaknesses through active control of camera focus and orientations is presented. In addition, the aperture and zoom settings of the cameras are controlled. The result is an active vision system that dynamically and cooperatively interleaves image acquisition with surface estimation. A dense composite map of a single contiguous surface is synthesized by automatically scanning the surface and combining estimates of adjacent, local surface patches. This problem is formulated as one of minimizing a pair of objective functions. The first such function is concerned with the selection of a target for fixation. The second objective function guides the surface estimation process in the vicinity of the fixation point. Calibration parameters of the cameras are treated as variables during optimization, thus making camera calibration an integral, flexible component of surface estimation. An implementation of this method is described, and a performance evaluation of the system is presented. An average absolute error of less than 0.15% in estimated depth was achieved for a large surface having a depth of approximately 2 m.
A Diffusion Approximation for a Markovian Queue with Reneging
Authors: Amy R. Ward, Peter W. Glynn
Venue: Queueing Systems: Theory and Applications (2003)

Consider a single-server queue with a Poisson arrival process and exponential processing times in which each customer independently reneges after an exponentially distributed amount of time. We establish that this system can be approximated by either a reflected Ornstein&ndash;Uhlenbeck process or a reflected affine diffusion when the arrival rate exceeds or is close to the processing rate and the reneging rate is close to 0. We further compare the quality of the steady-state distribution approximations suggested by each diffusion.
Ring-Connected Networks and Their Relationship to Cubical Ring Connected Cycles and Dynamic Redundancy Networks
Authors: Isaac Yi-Yuan Lee, Sheng-De Wang
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

In this paper, we first reviewed a 1-fault-tolerant (1-ft) hypercube model with degree 2r, the ring-connected network (RCN), which has the lowest degree among all 1-ft, one spare node, r-dimensional hypercube architecture yet discovered. Then we proposed a constant-time reconfiguration algorithm via an add-and-modulo automorphism. Furthermore, by introducing the equivalence from hypercubes to cube-connected cycles (CCCs) and to butterflies (BFs), we find there is also a corresponding equivalence from RCNs to cubical ring connected cycles (CRCCs) and to dynamic redundancy networks (DRNs). From this fact, we find out that once a symmetric fault-tolerant structure has been discovered for one of the three models, then it can apply directly to the other hypercubic networks. Applying the technique, we find a degree 6, 1-ft Benes network. Another point is we think that the strong relationship between hypercubes, CCCs and BFs should be paid more attention, and finally from this equivalence relationship we propose three new bounded-degree k-ft models: k-ft CCCs, k-ft BFs, and k-ft Benes networks.
A Dynamic C-Based Object-Oriented System for Unix
Authors: Steve Engelstad, Keith Falck, Warren Montgomery, Joe Neumann, Ralph Straubs, Jim Vandendorpe, Mike Wilde
Venue: IEEE Software (1991)

Calico, a C-based object-oriented language supported by an integrated software development environment, is described. Calico features strict encapsulation, dynamic binding, fast garbage collection, and interoperability with C. It provides a simple, uniformly applied object model, a syntax easily mastered by C programmers, a new multiple inheritance model, simple method-call semantics with some novel extension and effective support for the team development process. Although Calico introduces some unique language features, its primary contribution is the productivity advantage that this feature integration provides for the Unix/C environment.
Importance of Price in Telecommunications Managers' Choice of Local Access Provider
Authors: Jerry D. Mccreary, Chetan S. Sankar
Venue: Information Technology and Management (2003)

The decision making strategies of telecommunications managers and Chief Information Officers in the USA are changing as new companies are providing local access (residential/office) telephone services in addition to the Regional Bell Operating Companies. The choice of local access providers is critical to a company since they furnish the physical connection between the company's location and the public telephone network. Using experimental research, this paper investigates whether price is an important factor to the telecommunications managers in deciding whether to stay with the current provider or switch to an alternate provider.Fifty-two telecommunications managers participated in an experiment that provided them with a local access decision situation. The managers were given the opportunity to consider information associated with different decision factors and asked to determine the percent of service they would acquire from each of two competing local access providers. A software recorded actions taken by the managers during the experiment. The managers also ranked the decision factors in a post-experiment questionnaire. The experimental results show the most important decision factors for the managers to be price, technical quality, responsiveness, and maintenance ability. Price emerged as the most important factor in the experiment, although, it was ranked only fourth in the post-experiment questionnaire.
Finding information about men's health on the internet: an overview
Authors: M. Sandra Wood
Venue: Health Care on the Internet (2002)

It's a well-known fact that men are less likely than women to seek health care. Men tend to wait as long as possible to see a doctor about a health problem, making early diagnosis of a disease difficult if not impossible. When one looks at the statistics related to men's health, the apparent aversion to seeking health care is disconcerting. Given the fact that men seem to be more private about their illnesses, the Internet provides an excellent place for them to seek health care information. A search of "men's health" finds an overwhelming number of sites on the Internet. This article provides a highly selected list of Web sites intended as a starting place for finding information about men's health on the Internet.
Evaluation of NUMA Memory Management Through Modeling and Measurements
Authors: R. P. LaRowe,  Jr., C. S. Ellis, M. A. Holliday
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

Dynamic page placement policies for NUMA (nonuniform memory access time)shared-memory architectures are explored using two approaches that complement eachother in important ways. The authors measure the performance of parallel programsrunning on the experimental DUnX operating system kernel for the BBN GP1000, whichsupports a highly parameterized dynamic page placement policy. They also develop andapply an analytic model of memory system performance of a local/remote NUMAarchitecture based on approximate mean-value analysis techniques. The model isvalidated against experimental data obtained with DUnX while running a syntheticworkload. The results of this validation show that, in general, model predictions are quitegood. Experiments investigating the effectiveness of dynamic page-placement and, inparticular, dynamic multiple-copy page placement the cost of replication/coherency faulterrors, and the cost of errors in deciding whether a page should move or be remotelyreferenced are described.
Denial of Service in Sensor Networks
Authors: Anthony D. Wood, John A. Stankovic
Venue: Computer (2002)

Sensor networks hold the promise off acilitating large-scale, real-time data processing in complex environments, environments, helping to protect and monitor military, environmental, safety-critical, or domestic infrastructures and resources. Denial-of-service attacks against such networks, however, may permit real world damage to public health and safety. Without proper security mechanisms, networks will be confined to limited, controlled environments, negating much of the promise they hold. The limited ability ofindividual sensor nodes to thwart failure or attack makes ensuring network availability more difficult.To identify denial-of-service vulnerabilities, the authors analyzed two effective sensor network protocols that did not initially consider security. These examples demonstrate that consideration of security at design time is the best way to ensure successful network deployment.
Plane triangulations are 6-partitionable
Authors: Ajit A. Diwan, Manish P. Kurhekar
Venue: Discrete Mathematics (2002)

Given a graph G = (V,E) and k positive integers n1,n2 ..... nk such that Σki = 1 ni = |V|,we wish to find a partition P1,P2,..... Pk of the vertex set V such that |Pi| = ni and Pi induces a connected subgraph of G for all i, 1 ≤ i ≤ k. Such a partition is called a k-partition of G. A graph G with n vertices is said to be k-partitionable if there exists a k-partition of G for any partition of n into k parts. Lovász (Acta Math. Acad. Sci. Hungar. 30 (1977) 241) showed that k-connected graphs are k-partitionable. In this paper we prove that plane triangulations are 6-partitionable. This result is the best possible as there exist plane triangulations which are not 7-partitionable.
Comparative study of PECVD SiOCH low-k films obtained at different deposition conditions
Authors: D. Shamiryan, K. Weidner, W. D. Gray, M. R. Baklanov, S. Vanhaelemeersch, K. Maex
Venue: Microelectronic Engineering (2002)

Four CVD SiOCH films deposited at various conditions were used for comparative evaluation. The films were evaluated by RBS, spectroscopic ellipsometry, and ellipsometric porosimetry. Oxygen plasma resistance was studied by spectroscopic ellipsometry and TOF-SIMS analysis after exposure of the films to downstream oxygen plasma. The different deposition conditions result in different carbon content and different porosity. The film with the highest carbon content has the lowest porosity and vice versa. As carbon content of films increases and their porosity decreases, the SiOCH films become more resistant to oxygen plasma.
Work-Time Optimal k-Merge Algorithms on the PRAM
Authors: Tatsuya Hayashi, Koji Nakano, Stephan Olariu
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

For 2 ¿k¿n, the k-merge problem is to merge a collection of k sorted sequences of total length n into a new sorted sequence. The k-merge problem is fundamental as it provides a common generalization of both merging and sorting. The main contribution of this work is to give simple and intuitive work-time optimal algorithms for the k-merge problem on three PRAM models, thus settling the status of the k-merge problem. We first prove that ¿(n log k) work is required to solve the k-merge problem on the PRAM models. We then show that the EREW-PRAM and both the CREW-PRAM and the CRCW require ¿(log n) time and ¿(log log n + log k) time, respectively, provided that the amount of work is bounded by O(n log k). Our first k-merge algorithm runs in ¿(log n) time and performs ¿(n log k) work on the EREW-PRAM. Finally, we design a work-time optimal CREW-PRAM k-merge algorithm that runs in ¿(log log n + log k) time and performs ¿(n log k) work. This latter algorithm is also work-time optimal on the CRCW-PRAM model. Our algorithms completely settle the status of the k-merge problem on the three main PRAM models.
A Study of the Medical Record Interface to Natural Language Processing
Authors: Tadamasa Takemura, Nobuyuki Ashida
Venue: Journal of Medical Systems (2002)

The information about a patient tends to be handled more on a computer system. However, it is not sufficiently rational enough because of the fundamental difference between man and a computer. Up to now, man has treated information using a natural language. Therefore, if it can be applied to handle medical information electrically, that will become more rational. For this reason, we developed a new classification method that interfaces a computer with the human being, using a natural language. This method was named as a situation-oriented medical record, and this depicts changes in a situation by the case frame from a viewpoint of man's cognition. Moreover, the medical communication by a natural language, which is currently used when a patient changes a hospital, was analyzed in order to confirm the validity of this method. In addition, we developed a prototype system that allows computers to implement this kind of communication.
The eTRON Wide-Area Distributed-System Architecture for E-Commerce
Authors: Ken Sakamura, Noboru Koshizuka
Venue: IEEE Micro (2001)

As RFID chips and smart cards become pervasive, the need for strong security measures will increase. The authors introduce the eTRON research project, which is addressing these security issues.
Multikey, Extensible Hashing for Relational Databases
Authors: Keith L. Kelley, Marek Rusinkiewicz
Venue: IEEE Software (1988)

The design and implementation of a multikey, extensible hashing file addressing scheme and its application as an access method for a relational database are presented. This file organization was developed for Request, a testbed relational database-management system. It offers a viable alternative to indexed sequential files. Access operations, concurrency control, and relational operations are examined. Results of an experimental evaluation are reported.
Using the Dual Path Property of Omega Networks to Obtain Conflict-Free Message Routing
Authors: P. J. Bernhard, D. J. Rosenkrantz
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

A strategy for dealing with communication conflicts that occur in omega networks is presented. The strategy operates by implementing the dual path property of omega networks, which allows the source and destination processors to reverse roles for some of the messages that are being transmitted. For certain message patterns, such as reversal, produces a modified message pattern for which the network routes are disjoint. For a circuit switching mode in which the network links and switches are bidirectional, the disjoint set of routes for modified message pattern can be used to achieve conflict-free message transmission for the original message pattern. This strategy is investigated, and an efficient algorithm to determine whether it can be successfully applied to a given message pattern is presented.
Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects
Authors: Sunil Prabhakar, Yuni Xia, Dmitri V. Kalashnikov, Walid G. Aref, Susanne E. Hambrusch
Venue: IEEE Transactions on Computers (2002)

Moving object environments are characterized by large numbers of moving objects and numerous concurrent continuous queries over these objects. Efficient evaluation of these queries in response to the movement of the objects is critical for supporting acceptable response times. In such environments, the traditional approach of building an index on the objects (data) suffers from the need for frequent updates and thereby results in poor performance. In fact, a brute force, no-index strategy yields better performance in many cases. Neither the traditional approach nor the brute force strategy achieve reasonable query processing times. This paper develops novel techniques for the efficient and scalable evaluation of multiple continuous queries on moving objects. Our solution leverages two complimentary techniques: Query Indexing and Velocity Constrained Indexing (VCI). Query Indexing relies on 1) incremental evaluation, 2) reversing the role of queries and data, and 3) exploiting the relative locations of objects and queries. VCI takes advantage of the maximum possible speed of objects in order to delay the expensive operation of updating an index to reflect the movement of objects. In contrast to an earlier technique [29] that requires exact knowledge about the movement of the objects, VCI does not rely on such information. While Query Indexing outperforms VCI, it does not efficiently handle the arrival of new queries. Velocity constrained indexing, on the other hand, is unaffected by changes in queries. We demonstrate that a combination of Query Indexing and Velocity Constrained Indexing enables the scalable execution of insertion and deletion of queries in addition to processing ongoing queries. We also develop several optimizations and present a detailed experimental evaluation of our techniques. The experimental results show that the proposed schemes outperform the traditional approaches by almost two orders of magnitude.
Using a Continuation Twice and Its Implications for the Expressive Power of call/cc
Authors: Hayo Thielecke
Venue: Higher-Order and Symbolic Computation (1999)

We study the implications for the expressive power of call/cc of upward continuations, specifically the idiom of using a continuation twice. Although such control effects were known to Landin and Reynolds when they invented J and {\tt escape}, the forebears of call/cc, they still act as a conceptual pitfall for some attempts to reason about continuations. We use this idiom to refute some recent conjectures about equivalences in a language with continuations, but no other effects. This shows that first-class continuations as given by call/cc have greater expressive power than one would expect from {\tt goto} or exits.
Practical Process Control
Authors: A. M. Seal
Venue:  (1998)

:This text provides a comprehensive guide to the numerous different types of control equipment available to engineers and technicians involved in the control of any manufacturing process. The information is kept general, applicable to most processes requiring varying degrees of control, to identify what specific information is required by suppliers and the most suitable equipment for the application in hand. A degree of troubleshooting is included, as well as equipment specification, system specification and design, through installation, to commissioning and running plant tuning. In many sections there are guidelines on how to install process control equipment, especially measurement devices. To help overcome many of the problems generated by poor installations a few examples of how not to install are also included. 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
Analysis of Macro-Dataflow Dynamic Scheduling on Nonuniform Memory Access Architectures
Authors: M. Al-Mouhamed
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The author studies dynamic scheduling of computational tasks with communication costsusing nonuniform memory access architecture. The computing model assumes that datatransfer can be partitioned into parallel and sequential parts with respect to the taskexecution. A scheduling heuristic, called least-communication (LC), together with atwo-level scheduler is proposed in an attempt to minimize the finish time. The LC selectsthe task that removes the largest amount of remaining data transfer, if no such tasks areavailable the task that has been ready to run at the earliest is selected first. The timecomplexity of LC is O(n/sub 2/). Testing the finish time of LC and first-come first-servedscheduling (FCFS) shows that LC is useful for tasks having moderate granularity andwhose computation and communication requirements vary widely for different data sets.
The Micon System for Computer Design
Authors: William P. Birmingham, Anurag P. Gupta, Daniel P. Siewiorek
Venue: IEEE Micro (1989)

A description is given of the microprocessor configurer system, or Micon, which was designed to provide support for computer hardware designers. The objective of Micon is to reduce the time required to construct a hardware system. The approach to achieving this objective rests on two points: capturing and disseminating design expertise in a format that actively assists designers, and providing a tool environment that supports all aspects of computer design. Artificial intelligence provides design synthesis and the acquisition of design expertise. Databases provide consistent views of data to all tools. Networking allows the system to efficiently share common resources, such as the database, across many users of the system. Micon is compared to related design systems, its architecture is described, examples of its use are given, and a set of experiments to test its viability is described.
NetBench: a benchmarking suite for network processors
Authors: Gokhan Memik, William H. Mangione-Smith, Wendong Hu
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

In this study we introduce NetBench, a benchmarking suite for network processors. NetBench contains a total of 9 applications that are representative of commercial applications for network processors. These applications are from all levels of packet processing; Small, low-level code fragments as well as large application level programs are included in the suite.Using SimpleScalar simulator we study the NetBench programs in detail and characterize the network processor workloads. We also compare key characteristics such as instructions per cycle, instruction distribution, branch prediction accuracy, and cache behavior with the programs from MediaBench. Although the aimed architectures are similar for MediaBench and NetBench suites, we show that these workloads have significantly different characteristics. Hence a separate benchmarking suite for network processors is a necessity. Finally, we present performance measurements from Intel IXP1200 Network Processor to show how NetBench can be utilized.