ppxscal/embedding_network huggingface dataset:
The SDCC Framework For Integrating Existing Algorithms for Diverse Data Warehouse Maintenance Tasks
Authors: Xin Zhang, Elke A. Rundensteiner
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Recently proposed view maintenance algorithms tackle the problem of concurrent data updates happening at different autonomous ISs, whereas the EVE system addresses the maintenance of a data warehouse after schema changes of ISs. The concurrency of schema changes and data updates still remains an unexplored problem however. This paper now provides a first solution that guarantees concurrent view definition evolution and view extent maintenance of a DW defined over distributed ISs. For this problem, we introduce a framework called SDCC (Schema change and Data update Concurrency Control) system. SDCC integrates existing algorithms designed to address view maintenance subproblems, such as view extent maintenance after IS data updates, view definition evolution after IS schema changes, and view extent adaptation after view definition changes, into one system by providing protocols that enable them to correctly co-exist and collaborate. SDCC tracks any potential faulty updates of the DW caused by conflicting concurrent IS changes compensates for such conflicting updates by a local correction strategy, called Local Compensation (LC).
Extracting Rules From Neural Networks Using Symbolic Algorithms: Preliminary Results
Authors: Claudia Regina Milaré, Andre C. P. L. F. de Carvalho, Maria Carolina Monard
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Although Artificial Neural Networks (ANNs) have been satisfactorily employed in severalproblems, such as clustering, pattern recognition, dynamic systems control and prediction, they still suffer of significant limitations.One of them is that the induced concept representation is not usually comprehensible to humans.Several techniques have been suggested to extract meaningful knowledge from trained ANNs.This paper proposes the use of symbolic learning algorithms, commonly used by the Machine Learning community, to extract symbolic representations from trained ANNs.The procedure proposed is similar to that used by the Trepan algorithm [4], which extracts comprehensible, symbolic representations (decision trees) from trained ANNs.
Random Characterization of Design Automation Algorithms
Authors: Sandeep K. Kondapuram, Peter M. Maurer
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

Randomly generated Directed Acyclic Graphs (DAGs)can be used to generate various kinds of EDA test data. Forexample, they can be used to characterize channel routingalgorithms. This paper uses such data to characterize therelative performance of a number of different channelrouting algorithms, with the aim of determining thosefactors that have the most effect on routing performance.Our studies show very little difference in the algorithmsstudied. Factors that have been considered to provideperformance improvements are shown to be unimportant,and in some cases even detrimental to average routingperformance. This study suggests that "well known"algorithms are not really well known at all, and that moreextensive data is needed to characterize the algorithms thatwe use every day.
Creating Abstract Digital Paintings with Painting Camera Technique
Venue: Proceedings of the International Conference on Information Visualisation (2000)

We present a simple and intuitive rendering technique to create abstract paintings. This technique allows the users to render a given animated scene with multiple cameras, using a method inspired by concepts used by cubist and futurist abstract painters. In our method, the number of cameras is unlimited and the camera parameters are continuous functions. We define the camera parameters as parametric functions that are described by images, which we call camera-control-images. The spatial distribution color in these camera-control-images determines the camera parameters such as position and orientation.For the creation of abstract paintings, we have developed two artistic techniques. In the first technique, artists incrementally paint a complicated camera-control-image for a given 3D scene. The second technique is the opposite of the first. In this technique, for a given camera-control-image artists incrementally built a 3D scene to create an interesting abstract painting. The second technique is helpful when using existing images such as photographs and paintings.
Tutorial: A Survey of Stroke-Based Rendering
Authors: Aaron Hertzmann
Venue: IEEE Computer Graphics and Applications (2003)

This tutorial describes stroke-based rendering (SBR), an automatic approach to creating nonphotorealistic imagery by placing discrete elements called strokes, such as paint strokes or stipples. Many SBR algorithms and styles have been proposed, including styles of painting, pen-and-ink drawing, tile mosaics, stippling, streamline visualization, and tensor field visualization. This tutorial attempts to make sense of the disparate work in this area by creating a unified view of SBR algorithms, identifying the common elements, as well as the unique ideas of each. Moreover, presenting ideas in this fashion suggests possibilities for future research.
Fault-tolerant routing strategy using routing capability in hypercube multicomputers
Authors: Ge-Ming Chiu, Kai-Shung Chen
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

This paper addresses fault-tolerant routing which is concerned with finding feasible minimum paths in a faulty hypercube. The concept of routing capability, which is defined with respect to the entire spectrum of distance, is proposed to assist routing function. The amount of information that is useful for message routing is increased with our scheme. The proposed algorithm routes a message in an attempt to minimize derouting. In particular, it makes use of the information embedded in routing capabilities to establish a path for a message for which an upper bound on its length may be determined at the source. We then propose the notion of directed routing capability which captures more useful information for shortest path routing in comparison with undirected counterpart. Routing in hypercubes with link failures is also addressed.
Improving Distributed Workload Performance by Sharing Both CPU and Memory Resources
Authors: Xiaodong Zhang, Li Xiao, Yanxia Qu
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

We develop and examine job migration policies by considering effective usage of global memory in addition to CPU load sharing in distributed systems. When a node is identified for lacking sufficient memory space to serve jobs, one or more jobs of the node will be migrated to remote nodes with low memory allocations. If the memory space is sufficiently large, a CPU-based load sharing policy will schedule the jobs. Following the principle of sharing both CPU and memory resources, we present several load sharing alternatives. Our objective is to reduce the number of page faults caused by unbalanced memory allocations for jobs among distributed nodes, so that overall performance of a distributed system can be significantly improved.We have conducted trace-driven simulations to compare CPU-based load sharing policies with our policies. We show that our load sharing policies not only improve performance of memory-bound jobs, but also maintain the same load sharing quality as the CPU-based policies for CPU-bound jobs. Regarding remote execution and preemptive migration strategies, our experiments indicate that a strategy selection in load sharing is dependent on the amount of memory demand of jobs - remote execution is more effective for memory-bound jobs, and preemptive migration is more effective for CPU-bound jobs. Our CPU-Memory-based policy using either high performance or high throughput approach and using the remote execution strategy performs the best for both CPU-bound and memory-bound jobs.
Content Management Systems
Authors: Phil Suh, James Ellis, David Thiemecke
Venue:  (2002)

:Content Management Systems (CMS) automate the process of creating, publishing, and updating web site content. They make maintaining and updating the content of a web site easier, giving the content contributors, not just the web team, the means with which to manage their own content. They are usually made up of a front-end editor for inputting content, a back-end system for storing the content, and a template mechanism to get the content onto the web site. This book will guide you through the process of arriving at a content management solution, including the background knowledge you need to know, how to go about getting a solution, implementing the solution, and migrating existing content to it.Author Biography: Dave Addey has experience in building and implementing we systems, and now runs a CMS consultancy. James Ellis is a writer of a CMS article on alistapart.com. Phil Suh has experience of building and evaluating CMS. He also co-founded the cms-list (cms-list.org). David Thiemecke was the architect for QuantumCMS, and co-founded Algonquin Studios.
Fearful Symmetry in System Structures
Authors: Reiko Tanaka, Seiichi Shin
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

This paper discusses the relationship between the level of symmetry in a system structure and loss of controllability. For a system consisting of a large number of modules, symmetrical structure is considered as the identity of modules and their interconnections. We especially dealt with three basic structures, such as ring-type, bus-type, and star-type structures. If the entire system becomes uncontrollable because of failures in a set of k submodules, this number k indicates the level of fault tolerance. On the other hand, the level of symmetry is evaluated by the number of transformations that keep the structure invariant. Through the evaluation of fault tolerance of three basic structures, we considered the relationship between lowering the level of symmetry and loss of controllability because of failures.
Large Margin Classifier via Semiparametric Inference
Authors: Koji Tsuda, Shotaro Akaho
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

In this paper, we construct a learning method of stochastic perceptron based on semiparametric inference, and show that this method produces large margin solutions. In semiparametric inference, the parameters are divided into structural parameters, which are to be estimated, and nuisance parameters in which we do not have any interest. Here, the weight vector of perceptron is defined as structural parameters and the steepness of transfer function is defined as a nuisance parameter. Usually, rough estimate is substituted to nuisance parameters and only structural parameters are estimated. To compensate the estimation error caused by rough estimate, an additional term is added to the derivative of likelihood. We will show that this additional term is related to the regularization term, which causes large margin solutions. This work suggests that the success of large margin classifiers can be attributed to semiparametric inference.
The role of a software process generaliser in managing a line of products
Authors: Wonkook Hong, N. H. Madhavji
Venue: Proceedings of the 10th International Software Process Workshop (1996)

There is an urgent need for tools for understanding commonality and variability amongst a set of projects, for example, those dealing with a line of products. We describe some of the problems faced in practice by practitioners dealing with multiple projects or families of products. We then describe a prototype system, called the Generaliser, aimed to assist in the assessment of commonality and variability.
Optimization Of Reliability Allocation And Testing Schedule For Software Systems
Authors: M. R. Lyu, S. Rangarajan, A. P. A. van Moorsel
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

To ensure an overall reliability of an integrated software system, software components of the system have to meet certain reliability requirements, subject to some testing schedule and resource constraints. The system testing activity can be formulated as a combinatorial optimization problem with known cost, reliability, effort and other attributes of the system components. In this paper, we consider the software component reliability allocation problem for a system with multiple applications. The failure rate of components used to build the applications are related to the testing cost through various types of reliability growth curves. We achieve closed-form solutions to problems where there is one single application in the system. Analytical solutions are not readily available when there are multiple applications; however, numerical solutions can be obtained using a nonlinear programming tool. To ease the specification of the optimization problem, we develop a GUI front-end to existing mathematical software. We present a systematic outline of the problem formulation and solution, and apply this to an example of a telecommunication software system.
Commitments and causality for multiagent design
Authors: Feng Wan, Munindar P. Singh
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper unifies two recent strands of research in multiagent system design. One, commitments are widely recognized as capturing important aspects of interactions among agents, but current approaches tend to emphasize individual commitments and typically restrict themselves to interactions between pairs of agents. Two, methodologies for multiagent system design consider protocols and coordination requirements, but do not seriously accommodate commitments. This paper proposes a methodology to infer commitments from an example conversation among several parties. Based on the conversation, we build a commitment causality diagram indicating the causal relations among the commitments. Using this diagram, we generate behavior models for each role. We show that the models produced successfully capture commitment-level protocols and allow flexible implementation of non-commitment communications provided the causal relations are preserved.
An efficient class of SEC-DED-AUED codes
Authors: D. K. Bhattacharryya, S. Nandi
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In this paper, an efficient method for constructing a class of Single Error Correcting and Double Error Detecting and All Unidirectional Error Detecting (SEC-DED-AUED) codes has been presented. The encoding/decoding algorithms proposed with this method can be implemented with a simple and faster hardware. Also, in ROM based implementation, it results in significant saving of word-length. This scheme in general, needs less or equal number of check bits.
Hop integrity in computer networks
Authors: M. G. Gouda, E. N. Elnozahy, C.-T. Huang, T. M. McGuire
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

A computer network is said to provide hop integrity iff when any router p in the network receives a message m supposedly from an adjacent router q, then p can check that m was indeed sent by q, was not modified after it was sent, and was not a replay of an old message sent from q to p. We describe three protocols that can be added to the routers in a computer network so that the network can provide hop integrity. These three protocols are a secret exchange protocol, a weak integrity protocol, and a strong integrity protocol. All three protocols are stateless, require small overhead, and do not constrain the network protocol in the routers in any way.
Building Secure Survivable Semantic Webs
Authors: Bhavani Thuraisingham
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

This paper describes some ideas for a secure survivable semantic web that follows some of our previous ideas on dependable semantic web. Semantic web is a technology for understanding web pages. It is important that the semantic web is secure. In addition, data exchanged by the web has to be of high quality and survive failures and errors. The processes that the web supports have to meet certain timing constraints. This paper discusses these aspects, and describes how they provide a dependable semantic web.
Cyberliteracy: Navigating the Internet with Awareness
Authors: Laura J. Gurak
Venue:  (2003)

:The Internet has changed our social spaces, our political and social realities, our use of language, and the way we communicate, all with breathtaking speed. Almost everyone who deals with the Internet and the new world of cyberspace communication at times feels bewildered, dismayed, or even infuriated. In this clear and helpful book, computer communications scholar Laura J. Gurak takes a close look at the critical issues of online communication and discusses how to become literate in the new mass medium of our era. In cyberspace, Gurak shows us, literacy means much more than knowing how to read. Cyberliteracy means being able to sort fact from fiction, to detect extremism from reasonable debate, and to identify gender bias, commercialism, imitation, parody, and other aspects of written language that are problematic in online communication. Active reading skills are essential in cyberspace, where hoaxes abound, advertising masquerades as product information, privacy is often compromised, and web pages and e-mail messages distort the truth. Gurak analyzes the new language of the Internet, explaining how to prepare for its discourse and protect oneself from its hazards. This book will appeal to anyone with an interest in the impact of the Internet on the practices of reading and writing and on our culture in general.Author Biography: Laura J. Gurak is associate professor at the University of Minnesota, faculty fellow at the University of Minnesota Law School, and director of the Internet Studies Center. She is the author of Persuasion and Privacy in Cyberspace, published by Yale University Press.
Limited Data Rate in Control Systems with Networks
Authors: Hideaki Ishii, Bruce A. Francis
Venue:  (2002)

:This book incorporates data rate issues that arise in control design for systems involving communication networks. The general setup is that, given a plant, a communication channel with limited data rate and control objectives, one must find a controller that uses the channel in the feedback loop to achieve the control objectives. The theoretical question of interest is to find the minimum data rate necessary for the channel. This book is motivated by the recent developments in communication technology and aims at engineers and scientists in this field. The use of networks has become common practice in many control applications connecting sensors/actuators to controllers. The book therefore provides the fundamentals of the networks used in control systems, based on hybrid systems theory. The book focuses on the use of networks in distributed systems and on quantization in messages sent over networks.
Distribution of goals addressed to a group of agents
Authors: Laurence Cholvy, Christophe Garion
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The problem investigated in this paper is the distribution of goals addressed to a group of rational agents. Those agents are characterized by their ability (i.e. what they can do), their knowledge about the world and their commitments.The goals of the group are represented by conditional preferences. In order to deduce the actual goals of the group, we determine its ability using each agent's ability and we suppose that the agents share a common knowledge about the world. The individual goals of an agent are deduced using its ability, the knowledge it has about the world, its own commitments and the commitments of the other agents of the group.
On multiple coverings of the infinite rectangular grid with balls of constant radius
Authors: Maria A. Axenovich
Venue: Discrete Mathematics (2003)

We consider the coverings of graphs with balls of constant radius satisfying special multiplicity condition. A (t, i, j)-cover of a graph G = (V, E) is a subset S of vertices, such that every element of S belongs to exactly i balls of radius t centered at elements of S and every element of V\S belongs to exactly j balls of radius t centered at elements of S. For the infinite rectangular grid, we show that in any (t, i, j)-cover, i and j differ by at most t + 2 except for one degenerate case. Furthermore, for i and j satisfying |i - j| > 4 we show that all (t, i, j)-covers are the unions of the diagonals periodically located in the grid. Also, we give the description of all (1, i, j)-covers.
Towards Fault-Tolerant and Secure On-line Services
Authors: Lidong Zhou
Venue:  (2001)

Integrating fault tolerance and security is crucial for building trustworthy on-line services. Such integration is studied in this dissertation through the design and implementation of COCA (Cornell On-line Certification Authority), a fault-tolerant and secure on-line certification authority. COCA maintains a service private key to sign the responses it sends to clients, and achieves availability using replicated servers that employ threshold cryptography and store shares of the service private key. Periodic share refreshing, coupled with periodic recovery of server states, defends against so-called mobile adversaries which move from one server to another. COCA is designed for a weak system model: no assumptions are made about server speed or message delay, and communications are assumed to employ links that are intermittent. The result is a service with reduced vulnerability to attacks because, by their nature, weaker assumptions are more difficult for adversaries to invalidate. COCA further employs an array of defense mechanisms specific to denial of service attacks. COCA runs both on a local area network and on the Internet. Performance measurements of COCA under simulated denial of service attacks demonstrate the effectiveness of COCA''s defenses.
On the outcomes of formal inter-agent dialogues
Authors: Simon Parsons, Michael Wooldridge, Leila Amgoud
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper studies argumentation-based dialogues between agents. It takes a previously defined system by which agents can trade arguments and examines the outcomes of the dialogues this system permits. In addition to providing a first characterisation of such outcomes, the paper also investigates the extent to which outcomes are dependent on tactical play by the agents, and arguing that this violates principles of mechanism design, identifies how to prevent tactics having an effect.
External-Memory Graph Algorithms (extended abstract)
Authors: Yi Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren E Vengroff, Jeffrey S Vitter
Venue:  (1994)

We present a collection of new techniques for designing and analyzing efficient external-memory algorithms for graph problems and illustrate how these techniques can be applied to a wide variety of specific problems.