ppxscal/embedding_network huggingface dataset:
Explanation and Prediction: An Architecture for Default and Abductive Reasoning
Authors: David Poole
Venue:  (1989)

Although there are many arguments that logic is an appropriate tool for artificial intelligence, there has been a perceived problem with the monotonicity of classical logic. This paper elaborates on the idea that reasoning should be viewed as theory formation where logic tells us the consequences of our assumptions. The two activities of predicting what is expected to be true and explaining observations are considered in a simple theory formation framework. Properties of each activity are discussed, along with a number of proposals as to what should be predicted or accepted as reasonable explanations. An architecture is proposed to combine explanation and prediction into one coherent framework. Algorithms used to implement the system as well as examples from a running implementation are given.
Software Reuse and Reusability Metrics and Models
Authors: William Frakes, Carol Terry
Venue:  (1995)

As organizations implement systematic software reuse programs to improve productivity and quality, they must be able to measure their progress and identify the most effective reuse strategies. This is done with reuse metrics and models. In this paper, we survey metrics and models of software reuse and reusability, and provide a classification structure that will help users select them. Six types of metrics and models are reviewed: cost-benefit models, maturity assessment models, amount of reuse metrics, failure modes models, reusability assessment models, and reuse library metrics.
The Abstraction Refinement Model and the Modification-Cost Problem
Authors: Benjamin J. Keller, Richard E. Nance
Venue:  (1992)

A problem common to systems and software engineering is that of estimating the cost of making changes to a system. For system modifications that include changes to the design history of the system this is the "modification-cost" problem. A solution to this problem is important to planning changes in large systems engineering projects. In this paper, a cost model based on the Abstraction Refinement Model (ARM) is proposed as a framework for deriving solutions to the modification-cost problem. The ARM is a characterization of software evolution that is also applicable to general systems. Modifications to systems and their design histories are described using the components of the ARM. The cost model is defined by functions on the ARM components. The derived solution is given by an abstract expression of the cost functions.
Software for multiprocessor networks on chip
Authors: Miltos Grammatikakis, Marcello Coppola, Fabrizio Sensini
Venue: Networks on chip (2003)

Multiprocessor SoC becomes increasingly software-intensive due to multiplatform design, real-time performance, robustness, reliability, availability, and safety constraints. In this chapter, we examine multiprocessor SoC software, by focusing on user-space, i.e. application and middleware layers, and kernel space, i.e. "RTOS, system libraries and device drivers" and hardware layers. For the RTOS substrate, which forms the backbone of system design, we relate software performance to parallel programming and concurrency issues, as well as program correctness to consistency, fault tolerance, reliability, and verification and validation aspects. A case study based on a multiprocessor set-top-box design by STMicroelectronics illustrates the complexity issues inherent to SoC software design.
"Physical hypermedia": organising collections of mixed physical and digital material
Authors: Kaj Grønbæk, Jannie F. Kristensen, Peter Ørbæk, Mette Agger Eriksen
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

This paper addresses the problem of organizing material in mixed digital and physical environments. It presents empirical examples of how people use collectional artefacts and organize physical material such as paper, samples, models, mock-ups, plans, etc. in the real world. Based on this material, we propose concepts for collectional actions and meta-data actions, and present prototypes combining principles from augmented reality and hypermedia to support organising and managing mixtures of digital and physical materials. The prototype of the tagging system is running on digital desks and walls utilizing Radio Frequency IDentifier (RFID) tags and tag-readers. It allows users to tag important physical materials, and have these tracked by antennas that may become pervasive in our work environments. We work with three categories of tags: simple object tags, collectional tags, and tooltags invoking operations such as grouping and linking of physical material. Our primary application domain is architecture and design, thus we discuss use of augmented collectional artefacts primarily for this domain.
Improving the Effectiveness of ATM Traffic Control over Hybrid Fiber-Coax Networks
Authors: Nada Golmie, Mark Corner, Jorg Liebeherr, David Su
Venue:  (1997)

The IEEE 802.14 working group is currently standardizing a new media access control (MAC) protocol for the emerging Hybrid Fiber Coax (HFC) networks. Crucial for the success of 802.14 will be its ability to support higher layer traffic services, namely, ATM Constant Bit Rate (CBR), Variable Bit Rate (VBR) and Available Bit Rate (ABR) traffic classes. In this study, we investigate the interoperation of the MAC protocol, defined by 802.14, with ABR transmissions. An important finding of our study is that the bandwidth contention on the upstream channel in the HFC network may interfere with the feedback congestion control mechanisms of ABR traffic control. This interference can result in unfairness between ABR sources, and decreased utilization of the upstream HFC channel. As a solution to the problem we propose a scheme whereby the headend station of the HFC network returns congestion information contained in resource management (RM) cells to the ABR sources. The proposed mechanism can be incorporated into the ABR rate control scheme without modifying the current traffic management specifications. Numerous simulation scenarios are presented to illustrate our findings. Parts of the results have been presented to the IEEE 802.14 standardization committee.
Clustering Spatial Data Using Random Walks,
Authors: Y. Koren, D. Harel
Venue:  (2001)

Discovering significant patterns that exist implicitly in huge spatial databases is an important computational task. A common approach to this problem is to use cluster analysis. However, traditional clustering methods have several shortcomings when addressing spatial data. We propose a novel approach to clustering spatial data, based on the deterministic analysis of random walks on a weighted graph generated from the data. Our approach has several advantages. First, it can decompose the data into arbitrarily shaped clusters of different sizes and densities. Second, it can overcome noise and outliers that may blur the natural decomposition of the data. Third, our method requires only O(n*log n) time, and one of its variants needs only constant space.
The Methodology Roles in the Realization of A Model Development Environment
Authors: James D. Arthur, Richard E. Nance
Venue:  (1988)

The definition of "methodology" is followed by a very brief review of past work in modeling methodologies. The dual role of a methodologies is explained: (1) conceptual guidance in the modeling task, and (2) definition of needs for environment designers. A model development based on the conical methodology serves for specific illustration of both roles. 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
A unified Bayesian framework for evolutionary learning and optimization
Authors: Byoung-Tak Zhang
Venue: Advances in evolutionary computing: theory and applications (2003)

A probabilistic evolutionary framework is presented and shown to be applicable to both learning and optimization problems. In this framework, evolutionary computation is viewed as Bayesian inference that iteratively updates the posterior distribution of a population from the prior knowledge and observation of new individuals to find an individual with the maximum posterior probability. Theoretical foundations of Bayesian evolutionary computation are given and its generality is demonstrated by showing specific Bayesian evolutionary algorithms for learning and optimization. We also discuss how the probabilistic framework can be used to develop novel evolutionary algorithms that embed evolutionary learning for evolutionary optimization and vice versa.
A Geometric Interpretation of Weak-Perspective Motion
Authors: I. Shimshoni, R. Basri, E. Rivlin
Venue:  (1999)

We present a geometric interpretation of the problem of motion recovery from three weak-perspective images. Our interpretation is based on reducing the problem of estimating the motion to a problem of finding triangles on a sphere whose angles are known. Using this geometric interpretation, a simple method to completely recover the motion parameters using three images is developed. The results of running the algorithm on real images are presented. In addition, we describe which of the various motion parameters can be recovered already from two images.
Insitu considerations for non-linear buckling analysis
Authors: S. H. Lee
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

There are three main characteristics to examine in order to determine the integrity of a structure in a design process: stresses, dynamics, and stability. Buckling analysis assesses the stability characteristics dictating the integrity limit of a structure. A linear buckling analysis used to suffice for design requirements, but rigorous nonlinear buckling analysis has become more popular as the tools have become available and the designs more sophisticated. In this paper, the methods for linear and nonlinear buckling analysis are reviewed with a few illuminating examples to elicit the best approach for the buckling analysis procedure.
Choosing Effective Colours for Data Visualization
Authors: Christopher G. Healey
Venue:  (1996)

Choosing Effective Colours for Data Visualization Christopher G. Healey In this paper we describe a technique for choosing multiple colours for use during data visualization. Our goal is a systematic method for maximizing the total number of colours available for use, while still allowing an observer to rapidly and accurately search a display for any one of the given colours. Previous research suggests that we need to consider three separate effects during colour selection: colour distance, linear separation, and colour category. We describe a simple method for measuring and controlling all of these effects. Our method was tested by performing a set of target identification studies; we analysed the ability of thirty-eight observers to find a colour target in displays that contained differently coloured background elements. Results showed that our method can be used to select a group of colours that will provide good differentiation between data elements during visualization.
E-commerce business practices in the EU
Authors: Hamid Jahankhani, Solomon A. Alexis
Venue: Enterprise information systems IV (2003)

This paper describes and evaluates the e-commerce issues addressed by the EU legislative framework (Directives), examines the extent of their influence on e-commerce business practices and the factors that drive e-commerce in the EU.The countdown has started for the implementation and compliance of the various EU initiatives and although opinion is divided over the regulation merits, the issues of privacy, consumer protection and progress will continue to be in the limelight. Various consumer groups have argued that the EU initiatives provide greater protection for online shoppers, while the critics claim that they halt and hinder the growth of the e-economy in Europe by making it complex and risky for smaller firms to trade online.Although, many European on-line businesses are aware of the EU Directives relating to e-commerce, they have not put into place plans to act in accordance with them.Today there are no less than fifteen different initiatives and although the Directives pose problems for businesses that operate in the Euro-zone, there is an intense effort to minimise the perceive disadvantages that they can cause.What the EU has done for e-commerce in the last decade has not been done anywhere else in the world.
Robust Model-based Motion Tracking Through the Integration of Search and Estimation
Authors: David G. Lowe
Venue:  (1992)

A computer vision system has been developed for real-time motion tracking of 3-D objects, including those with variable internal parameters. This system provides for the integrated treatment of matching and measurement errors that arise during motion tracking. These two sources of error have very different distributions and are best handled by separate computational mechanisms. These errors can be treated in an integrated way by using the computation of variance in predicted feature measurements to determine the probability of correctness for each potential matching feature. In return, a best-first search procedure uses these probabilities to find consistent sets of matches, which eliminates the need to treat outliers during the analysis of measurement errors. The most reliable initial matches are used to reduce the parameter variance on further iterations, minimizing the amount of search required for matching more ambiguous features. These methods allow for much larger frame-to-frame motions than most previous approaches. The resulting system can robustly track models with many degrees of freedom while running on relatively inexpensive hardware. These same techniques can be used to speed verification during model-based recognition.
Shallow Grates
Authors: Maria M. Klawe
Venue:  (1992)

This note proves the existence of acyclic directed graphs of logarithmic depth, such that a superlinear number of input-output pairs remain connected after the removal of any sufficiently small linearly sized subset of the vertices. The technique can be used to prove the analogous, and asymptotically optimal, result for graphs of arbitrary depth, generalizing Schnitger''s grate construction for graphs large depth. Interest in this question relates to efforts to use graph theoretic methods to prove circuit complexity lower bounds for algebraic problems such as matrix multiplication. In particular, it establishes the optimality of Valiant''s depth reduction technique as a method of reducing the number of connected input-output pairs. The proof uses Schnitger''s grate construction, but also involves a lemma on expanding graphs which may be of independent interest.
ANALYZING TRACES WITH ANONYMOUS SYNCHRONIZATION
Authors: David P. Helmbold, Charles E. McDowell, Jian Wang
Venue:  (1989)

In a parallel system, events can occur concurrently. However, programmers are often forced to rely on misleading sequential traces for information about their program''s behavior. We present a series of algorithms which extract ordering information from a sequential trace with anonymous semaphore-style synchronization. We view a program execution as a partial ordering of events, and define which executions are consistent with a given trace. Although it is generally not possible to determine which of the consistent executions occurred, we define the notion of ``safe orderings'''' which can be relied on regardless of which execution generated the trace. The main results of the paper are algorithms which determine many of the ``safe orderings''''. The first algorithm starts from a sequential trace and creates a partially ordered canonical execution. The second algorithm strips away the ordering relationships particular to the canonical execution, so that the resulting partial order is safe. The third algorithm increases the amount of ordering information while maintaining a safe partial order. All three algorithms are accompanied by proofs of correctness. Finally, an algorithm is presented to detect critical regions, to distinguish unordered sequential events from concurrent events.
Simple Algorithms for Multimessage Multicasting With Forwarding
Authors: Teofilo F. Gonzalez
Venue:  (1997)

We consider Multimessage Multicasting over the $n$ processor complete (or fully connected) static network ($MM_{C}$) when the Forwarding of messages is allowed. We present an efficient algorithm that constructs for every degree $d$ problem instance a communication schedule with total communication time at most $2d$, where $d$ is the maximum number of messages that each processor may send (receive). Our algorithm consists of two phases. In the first phase a set of communications are scheduled to be carried out in $d$ time periods in such a way that the resulting problem is a multimessage unicasting problem of degree $d$. In the second phase we generate a communication schedule for this problem by reducing it to the Makespan Openshop Preemptive Scheduling problem which can be solved in polynomial time. The final schedule is the concatenation of the communication schedules for each of these two phases. For $2 \le l \le d$ we present an algorithm to generate a communication schedule with total communication time at most $\lfloor ( 2 - \frac{1}{l} ) d \rfloor +1$, for problem instances where each processor needs to send messages to at most $ld$ destinations.
A SIMULATION STUDY OF REPLICATION CONTROL PROTOCOLS USING VOLATILE WITNESSES
Authors: Perry K. Slope, Jehan Paris, Darrell D.E. Long
Venue:  (1992)

Voting protocols guarantee the consistency of replicated data objects by disallowing all access requests that cannot gather a sufficient quorum of replicas. The performance of voting protocols can be greatly enhanced by adding to the replicas small independent entities that hold no data but can attest to the state of the replicated data object. It has been recently proposed to store these *witnesses* in volatile storage. Volatile witnesses respond faster to write requests than those stored in stable storage. They can also be more easily regenerated as many local area networks contain a majority of diskless sites. We present a simulation study of the availability afforded by two voting protocols using volatile witnesses and investigate the impact of access rates, network topology and witness placement on the availability of the replicated data.
Quantifying Knowledge Complexity
Authors: O. Goldreich, E. Petrank
Venue:  (1995)

One of the many contributions of the paper of Goldwasser, Micali and Rackoff is the introduction of the notion of knowledge complexity. Knowledge complexity zero (also known as zero-knowledge) seems to have received most of the attention of the authors and all the attention of their followers. Unfortunately, the formulation of knowledge complexity (greater than zero) as appearing in that pioneering paper seems to be inadequate. In this paper, we present several alternative definitions of knowledge complexity and investigate the relations between them.
The Kyklos (n Mod R = 0) Routing Algorithm
Authors: Furman F. Haddix, Alfred G. Dale, Roy M. Jenevein, Christopher B. Walton
Venue:  (1988)

Tree network routing algorithms and node labeling sequences can simultaneously achieve O(1/N) processor loads among interior node processors, level processor loads among leaf node processors and O(1/N1-(1/r)) maximum traffic per link, where N is the number of I/O processors located at the leaf nodes, and r is the number of tree replications. Proposed routing algorithms are an r-tree analog to the 2-tree HD2 strategy [Jene86], and the YD2 strategy, which improves network performance on significant traffic metrics relative to HD2. If m is the tree branching factor, and n = log 9mN is the number of levels in each tree, the routing algorithms work for any m, n and r; however, they are most effective for m = 2 and n mod r = 0.
Defaults and Relevance in Model Based Reasoning
Authors: R. Khardon, D. Roth
Venue:  (1995)

Reasoning with model-based representations is an intuitive paradigm, which has been shown to be theoretically sound and to possess some computational advantages over reasoning with formula-based representations of knowledge. In this paper we present more evidence to the value of such representations. Our results hinge on the notion of relevance, and model based representations are shown to be useful in capturing relevant information, and in allowing to ignore irrelevant information. In particular, we consider situations where context-specific information is used in the process of reasoning. We show that reasoning with model-based representations can be done efficiently in the presence of varying context information. We then consider the task of default reasoning. We show that default reasoning is a generalization of reasoning within context, in which the reasoner has many ``context" rules, which may be conflicting. We develop model-based algorithms that handle efficiently fragments of Reiter''s default logic. Our intuition about relevance is best captured in the model for reasoning within context, where model-based representations enable us to filter out irrelevant information. Interestingly, default logic is somewhat in contrast with our intuition about relevance. Default rules do not tell us explicitly what the context information is. Instead, we have to figure out what are the possible ``extensions" and then use those as possible contexts. As we show, model-based representations capture all possible extensions in an accessible form, thereby supporting efficient default reasoning whenever possible. Lastly, we argue that these results support an incremental view of reasoning in a natural way. We discuss the Learning to Reason framework, which emphasizes this view, and the notion of relevance as manifested in it. In particular, we discuss results on Learning to Reason in which model-based representations are used to represent relevant knowledge.
Problems, Promises and Performance: Some Questions for Real-Time System Specification
Authors: M. Joseph
Venue:  (1991)

This paper considers how different views of real-time program specification and verification arise from different assumptions about the representation of time external to the program, the representation of time in the program and the verification of the timing properties on an implementation. Three different views are compared: real-time programming without time, the synchrony hypothesis and asynchronous real-time programs. Questions about the representation of time are then related to different models of time and their roles at different levels of analysis. The relationship between the development of a program from a specification and its timing characteristics in an implementation is discussed and it is suggested that the formal verification of timing properties can be extended towards the implementation. The need for fault-tolerance in a real-time system is then considered and ways examined of incorporating a formal proof of fault-tolerance along with proof of its timing properties. Keywords: real-time specification, synchronous real-time, asynchronous real-time, fault-tolerance. Presented at the REX Workshop on Real-time Systems: Theory in Practice, Plasmolen, Mook, The Netherlands, June 1991. 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
Comparative Evaluation of the Multi-Class PNN and ART2 Neural Networks for Classification of Infrared Ship Images Part II.
Authors: Anthony Zaknich, Chris deSilva, Yianni Attikiouzel
Venue:  (1991)

Abstract unavailable.