ppxscal/embedding_network huggingface dataset:
Reasoning in Inconsistent Knowledge Bases
Authors: John Grant, V. s. Subrahmanian
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Databases and knowledge bases could be inconsistent in many ways. For example, during the construction of an expert system, we may consult many different experts. Each expert may provide us with a group of rules and facts which are self-consistent. However, when we coalesce the facts and rules provided by these different experts, inconsistency may arise. Alternatively, knowledge bases may be inconsistent due to the presence of some erroneous information. Thus, a framework for reasoning about knowledge bases that contain inconsistent information is necessary. Such a framework was described in [1], [21]. However, existing frameworks for reasoning with inconsistency do not support reasoning by cases and reasoning with the law of excluded middle (everything is either true or false). In this paper, we show how reasoning with cases, and reasoning with the law of excluded middle may be captured. We develop a declarative and operational semantics for knowledge bases that are possibly inconsistent. We compare and contrast our work with work on explicit and non-monotonic modes of negation in logic programs and suggest under what circumstances one framework may be preferred over another.
Interactive view-dependent rendering of large isosurfaces
Authors: Benjamin Gregorski, Mark Duchaineau, Peter Lindstrom, Valerio Pascucci, Kenneth I. Joy
Venue: Proceedings of the conference on Visualization '02 (2002)

We present an algorithm for interactively extracting and rendering isosurfaces of large volume datasets in a view-dependent fashion. A recursive tetrahedral mesh refinement scheme, based on longest edge bisection, is used to hierarchically decompose the data into a multiresolution structure. This data structure allows fast extraction of arbitrary isosurfaces to within user specified view-dependent error bounds. A data layout scheme based on hierarchical space filling curves provides access to the data in a cache coherent manner that follows the data access pattern indicated by the mesh refinement.
Concurrent Error Detection Using Watchdog Processors-A Survey
Authors: A. Mahmood, E. J. McCluskey
Venue: IEEE Transactions on Computers (1988)

Concurrent system-level error detection techniques using a watchdog processor are surveyed. A watchdog processor is a small and simple coprocessor that detects errors by monitoring the behavior of a system. Like replication, it does not depend on any fault model for error detection. However, it requires less hardware than replication. It is shown that a large number of errors can be detected by monitoring the control flow and memory-access behavior. Two techniques for control-flow checking are discussed and compared with current error-detection techniques. A scheme for memory-access checking based on capability-based addressing is described. The design of a watchdog for performing reasonable checks on the output of a main processor by executing assertions is discussed.
Measuring Reuse: A Cautionary Tale
Authors: Shari Lawrence Pfleeger
Venue: IEEE Software (1996)

Many organizations look to reuse for large improvements in quality and productivity. But measuring reuse is difficult, to be attempted only after careful analysis of measurement and management goals. This article describes how to measure reuse and provides warnings on how some numbers can be misleading.
Problems in Representing Liquid Tankswith Monotonicity Constraints: A Case Study inModel-Imposed Limitations on the Coverage ofQualitative Simulators
Authors: A.C. Cem Say
Venue: Artificial Intelligence Review (2002)

We subject a basic qualitative model which appears throughout the qualitative reasoning literature (the ``bathtub'' or liquid tank model) to a detailed theoretical analysis of its representation properties. We show that the standard model for this family of systems does not cover the intuitive concept of real-world tanks, in that there are both simple tanks that do not obey the model, and that there are physically impossible shapes that do obey it and get considered by qualitative reasoners using the model. We demonstrate that these modeling problems may lead to a marked decrease in the usefulness of employing qualitative reasoners in some cases. We conclude that one should be careful about making both the assumptions required by the model and the algorithm, and the family of systems that are actually reasoned about, explicit in the presentation of qualitative reasoners' output.
Counterexample-guided choice of projections in approximate symbolic model checking
Authors: Shankar G. Govindaraju, David L. Dill
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

BDD-based symbolic techniques of approximate reachability analysis based on decomposing the circuit into a collection of overlapping sub-machines (also referred to as overlapping projections) have been recently proposed. Computing a superset of the reachable states in this fashion is susceptible to false negatives. Searching for real counterexamples in such an approximate space is liable to failure. In this paper, the "hybridization effect" induced by the choice of projections is identified as the cause for the failure. A heuristic based on Hamming Distance is proposed to improve the choice of projections, that reduces the hybridization effect and facilitates either a genuine counterexample or proof of the property. The ideas are evaluated on a real large design example from the PCI Interface unit in the MAGIC chip of the Stanford FLASH Multiprocessor.
The Garp Architecture and C Compiler
Authors: Timothy J. Callahan, John R. Hauser, John Wawrzynek
Venue: Computer (2000)

Various projects and products have been built using off-the-shelf field-programmable gate arrays (FPGAs) as computation accelerators for specific tasks. Such systems typically connect one or more FPGAs to the host computer via an I/O bus. Some have shown remarkable speedups, albeit limited to specific application domains.Many factors limit the general usefulness of such systems. Long reconfiguration times prevent acceleration of applications that spread their time over many different tasks. Low-bandwidth paths for data transfer limit the usefulness of such systems to tasks that have a high compute-to-memory-bandwidth ratio. In addition, standard FPGA tools require hardware design expertise beyond the knowledge of most programmers.To help investigate the viability of connected FPGA systems, the authors designed their own architecture called Garp and experimented with running applications on it. They are also investigating whether Garp's design enables automatic, fast, effective compilation across a broad range of applications. They present their results in this article.
Evaluating Software Development Objectively
Authors: Kathryn A. Bassin, Theresa Kratschmer, P. Santhanam
Venue: IEEE Software (1998)

By employing the Orthogonal Defect Classification scheme, the authors are able to support management with a firm handle on technical decision making. Through the extensive capture and analysis of defect semantics, one can obtain information on project management, test effectiveness, reliability, quality, and customer usage. The article describes three real-life case studies, and demonstrates the applicability of their techniques.
How to Verify a Safe Real-Time System: The Application of Model Checking and Timed Automata to the Production Cell Case Study
Authors: A. Burns
Venue: Real-Time Systems (2003)

The formal verification of a real-time system requires either a proof theoretic or model theoretic approach. Both being applicable to a model of the proposed behavior of the concurrent real-time system. This paper evaluates the use model checking and timed automata by their application to an adaptation of the Production Cell case study. The Uppaal tool is used in this evaluation. The modeling aspects were found to be straightforward, but to accomplish the necessary model checking required some knowledge of the underlying process. Nevertheless, the conclusion of the study is that these techniques are generally applicable and be can be undertaken in an engineering context without detailed domain knowledge of the model checking technique.
Erosion database interface (EDI): a computer program for georeferenced application of erosion prediction models
Authors: Simone Beatriz Lima Ranieri, Quirijn de Jong van Lier, Gerd Sparovek, Dennis C. Flanagan
Venue: Computers Geosciences (2002)

The multidisciplinary approach of soil erosion research often requires erosion to be treated as spatial georeferenced information. This condition is essential so as to be compatible with information analyzed via Geographic Information Systems (GIS). The original versions of important soil erosion prediction models such as the Universal Soil Loss Equation (USLE) and Water Erosion Prediction Project (WEPP) do not operate on a georeferenced basis. The Erosion Database Interface (EDI) is a computer program for georeferenced application of USLE and WEPP. EDI uses, as input, a text format database with points defined by coordinates (x, y and z) representing hillslopes, each point associated to soil type and land use. Such input data can be provided by different methods. Exclusive field work with ordinary topographic equipment and GIS procedures are examples of methods that can be used for this purpose. Flexibility in the methods adopted for providing input data is an important prerequisite for erosion prediction in tropical and developing regions, where soil erosion is a major concern and the availability of digital data is usually restricted. Hillslopes for EDI were defined as straight line segments beginning at the upper slope and ending down at runoff output. This restricts EDI as a complete erosion-prediction method for areas where runoff deflecting features predominate or where channel or gully erosion is to be considered. As output, EDI provides georeferenced soil erosion values in another text format database. This database can be used directly for statistical or geostatistical analysis or imported into a GIS for further processing. A practical example representative of a sugarcane-growing area located at the southeastern part of Brazil is used to illustrate EDI's performance. In this example, soil erosion maps were produced from GIS data using EDI as interface for erosion calculations for WEPP and USLE.
Personal Effectiveness
Authors: Richard Mateosian
Venue: IEEE Micro (2002)

The two books I look at this month deal with personal effectiveness. One is a collection of essays by Gerald Weinberg and some of his colleagues. The other is a runaway best-seller, still relevant 12 years after it first appeared. I look at the ways in which these two books agree on all the important points.
Coercive subtyping for the calculus of constructions
Authors: Gang Chen
Venue: ACM SIGPLAN Notices (2003)

We present a coercive subtyping system for the calculus of constructions. The proposed system λCCOover≤ is obtained essentially by adding coercions and η-conversion to λC≤[10], which is a subtyping extension to the calculus of constructions without coercions. Following [17, 18], the coercive subtyping c : A η B is understood as a special case of typing in arrow type c : A → B such that the term c behaves like an identity function. We prove that, with respect to this semantic interpretation, the proposed coercive subtyping system is sound and complete, and that this completeness leads to transitivity elimination (transitivity rule is admissible). In addition, we establish the equivalence between λCCOover≤ and CCßη, this fact implies that λCCOover≤ has confluence, subject reduction and strong normalization. We propose a formalization of coercion inference problem and present a sound and complete coercion inference algorithm.
Description and Identification of Distributed Fragments of Recursive Relations
Authors: Sakti Pramanik, Sungwon Jung
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

In a distributed environment, it is advantageous to fragment a relation and store the fragments at various sites. In this paper, based on the concept of lattice structures, we develop a framework to study the fragmentation problems of distributed recursive relations. Two of the fragmentation problems are how to describe and identify fragments. Description and identification methods previously suggested are more suitable in parallel environments than in distributed databases. We propose a method to describe and identify fragments based on lattice structures. Finding lattice descriptions of fragments is shown to be an NP-complete problem. We analyze the performance of lattice approach both theoretically and experimentally. This is done by creating a database of recursive relations. The empirical analysis shows that our proposed algorithms give near-optimal solutions.
Glossary of Computing Terms, 9th edition
Authors: British Computer Society
Venue:  (1998)

:The glossary provides explanations for over 2400 computing terms. All aspects of computing are covered from programming languages to personnel, from architecture to applications, from storage to systems software. The text is structured around three themes: how computer systems are used, what computer systems are made up of, and how computer systems work. It includes over 40 essays as introductions to sections, which illustrate how terms may be used in a written context as well as provide background information for each section. Features now includes comprehensive coverage of the internet allows quick and easy reference guides the reader to other related terms where applicable includes a comprehensive index contains a list of common abbreviations and acronyms some current A-levels refer explicitly to the Glossary as a reference source for definitions of terms A Glossary of Computing Terms has been compiled by a working party of The British Computer Society's Education Committee and provides a standardized interpretation of computing terms to use on Information Systems, Information Technology and Computing courses at GCSE level and upwards. It is also a useful reference source for any other courses where computers are used. For anyone requiring a simple painless introduction to computer technology this book will prove invaluable.
SH4 RISC Multimedia Microprocessor
Authors: Fumio Arakawa, Osamu Nishii, Kunio Uchiyama, Norio Nakagawa
Venue: IEEE Micro (1998)

The SH4 is the latest SH series microprocessor. It achieives 360 MIPS and 1.4 GFLOPS at 200 MHz. Its architectural enhancement is based on two-way superscalar issue of instructions, separate instruction and data caches, and early stage branches. The main target applications of the SH4 are consumer multimedia systems, such as home video games and handheld PCs. The unique floating-point vector instructions are more effective than the conventional SIMD architecture for 3D graphics processing.
Protection and administration of XML data sources
Authors: Elisa Bertino, Silvana Castano, Elena Ferrari, Marco Mesiti
Venue: Data Knowledge Engineering (2002)

EXtensible Markup Language (XML) security has become a relevant research topic due to the wide-spread use of XML as the language for information interchange and document definition over the Web. In this context, developing an access control mechanism in terms of XML is an important step for Web information security. In this paper, we present the protection and administration facilities of Author-X, a Java-based system for discretionary access control to XML documents. Relevant features of Author-X are both a set-oriented and a document-oriented credential-based document protection, a differentiated protection of document/document type contents through the support of multi-granularity protection objects and positive/negative authorizations, and the support for different access control strategies. In this paper, we focus on the strategies we have developed for enforcing access control. Additionally, we provide a description of the environment we have developed to help the Security Officer in performing administrative activities related to both security policy and subject credential management.
Cobol in an Object-Oriented World: A Learning Perspective
Authors: Bill C. Hardgrave, E. Reed Doke
Venue: IEEE Software (2000)

Although recent Internet, Java, and OO trends threaten Cobol's dominance, industry will continue to need the language and its programmers for development as well as maintenance--especially once OO Cobol becomes an official standard. Thus, Cobol training remains a priority. By leveraging their existing knowledge, Cobol programmers can make a smooth transition to OO development and Java programming.
Finding Aggregate Proximity Relationships and Commonalities in Spatial Data Mining
Authors: Edwin M. Knorr, Raymond T. Ng
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

In this paper, we study two spatial knowledge discovery problems involving proximity relationships between clusters and features. The first problem is: Given a cluster of points, how can we efficiently find features (represented as polygons) that are closest to the majority of points in the cluster? We measure proximity in an aggregate sense due to the nonuniform distribution of points in a cluster (e.g., houses on a map), and the different shapes and sizes of features (e.g., natural or man-made geographic features). The second problem is: Given n clusters of points, how can we extract the aggregate proximity commonalities (i.e., features) that apply to most, if not all, of the n clusters? Regarding the first problem, the main contribution of the paper is the development of Algorithm CRH which uses geometric approximations (i.e., circles, rectangles, and convex hulls) to filter and select features. Highly scalable and incremental, Algorithm CRH can examine over 50,000 features and their spatial relationships with a given cluster in approximately one second of CPU time. Regarding the second problem, the key contribution is the development of Algorithm GenCom that makes use of concept generalization to effectively derive many meaningful commonalities that cannot be found otherwise.
Techniques for Update Handling in the Enhanced Client-Server DBMS
Authors: Alex Delis, Nick Roussopoulos
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

The Client-Server computing paradigm has significantly influenced the way modern Database Management Systems are designed and built. In such systems, clients maintain data pages in their main-memory caches, originating from the server's database. The Enhanced Client-Server architecture takes advantage of all the available client resources, including their long-term memory. Clients can cache server data into their own disk units if these data are part of their operational spaces. However, when updates occur at the server, a number of clients may need to not only be notified about these changes, but also obtain portions of the updates as well. In this paper, we examine the problem of managing server imposed updates that affect data cached on client disk managers. We propose a number of server update propagation techniques in the context of the Enhanced Client-Server DBMS architecture, and examine the performance of these strategies through detailed simulation experiments. In addition, we study how the various settings of the network affect the performance of these policies.
Development and modelling of arterial applanation tonometry: a review
Authors: Koen Matthys, Pascal Verdonck
Venue: Technology and Health Care (2002)

Arterial tonometry allows non-invasive and continuous registration of the arterial pressure waveform, by applanating (flattening) a superficial artery supported by bone with an external transducer. Inspired by ocular tonometry used for eye disease diagnosis, G.L. Pressman and P.M. Newgard built the first arterial tonometer in 1963, and derived a discrete, linear mechanical model. Accuracy remained poor until new sensor production techniques (silicon technology) arrived. G.M. Drzewiecki et al. published a second, more elaborate theoretical model for tonometer positioning in 1983: Few years later, the first modern tonometers were commercialised. Although the problems of sensor positioning, motion artefacts and calibration still exist, the tonometer has proven its usefulness in arterial compliance and hypertension studies. Attention should now go to analysis of the arterial pressure waveforms, and the combination with other signals (e.g. flow wave morphology) to allow a complete non-invasive haemodynamical description of the heart and the arterial tree.
The Visual Display of Parallel Performance Data
Authors: Michael T. Heath, Allen D. Malony, Diane T. Rover
Venue: Computer (1995)

Data visualization can help users decipher scientific and engineering data and better comprehend large, complex data sets. The authors present a high-level abstract model for performance visualization that relates behavior abstractions to visual representations in a structured way. This model is based on two principles: Displays of performance information are linked directly to parallel performance models, and performance visualizations are designed and applied in an integrated environment. The authors explain some advantages of adhering to these principles. They begin by establishing a context for users to clearly understand performance information, defining terms such as perspective, semantic context, and subview mapping. Next, they describe the techniques used to scale graphical views as data sets become very large. Finally, they discuss concepts such as user perception and interaction, comparisons and cross-correlations between related views or representations, and information extraction. On the basis of this conceptual foundation, the authors present examples of practical applications for the model. These case studies address topics such as concurrency and communication in data-parallel computation, access patterns for data distributions, and critical paths in parallel computation. The authors conclude by discussing the relationship between performance visualization and general scientific visualization.
Affinity-based management of main memory database clusters
Authors: Minwen Ji
Venue: ACM Transactions on Internet Technology (TOIT) (2002)

We study management strategies for main memory database clusters that are interposed between Internet applications and back-end databases as content caches. The task of management is to allocate data across individual cache databases and to route queries to the appropriate databases for execution. The goal is to maximize effective cache capacity and to minimize synchronization cost. We propose an affinity-based management system for main memory database cLUsters (ALBUM). ALBUM executes each query in two stages in order to take advantage of the query affinity that is observed in a wide range of applications. We evaluate the data/query distribution strategy in ALBUM with a set of trace-based simulations. The results show that ALBUM reduces cache miss ratio by a factor of 1.7 to 9 over alternative strategies. We have implemented a prototype of ALBUM, and compare its performance to that of an existing infrastructure: a fully replicated database with large buffer cache. The results show that ALBUM outperforms the existing infrastructure with the same number of server machines by a factor of 2 to 7, and that ALBUM with only 1/3 to 1/2 of the server machines achieves the same throughput as the existing infrastructure.
On separable self-complementary graphs
Authors: Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Katsuhiro Ota, Shinsei Tazawa, Mamoru Watanabe
Venue: Discrete Mathematics (2002)

In this paper, we describe the structure of separable self-complementary graphs.