ppxscal/embedding_network huggingface dataset:
A Fault-Tolerant Adaptive and Minimal Routing Approach in n-D Meshes
Authors: Jie Wu
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

In this paper, a sufficient condition is given for minimal routing in n-dimensional (n-D) meshes with faulty nodes contained in a set of disjoint fault regions. It is based on an early work of the author on minimal routing in low dimension meshes (such as 2-D meshes with faulty blocks). Unlike many traditional models that assume all the nodes know global fault distribution, our approach is based on the concept of limited global fault information. First, a fault model called fault region is used in which all faulty nodes in the system are contained in a set of disjoint regions. Fault information is coded in a 2n-tuple called extended safety level associated with each node of an n-D mesh to support minimal routing. Specifically, we study the existence of minimal paths at a given source node, limited distribution of fault information, minimal routing, and deadlock-free routing. Our results show that any minimal routing that is partially adaptive can still be applied as long as the destination node meets a certain safety condition. A dynamic planar-adaptive routing scheme is presented that offers better fault tolerance and adaptivity than the regular planar-adaptive routing scheme in n-D meshes.
A formal specification strategy for electronic commerce
Authors: S. A. Ehikioya, K. Barker
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

Most current Web applications perform operations that are basically read-only (retrieval of data/documents), so conflicts between transactions do not arise. However as Web applications increasingly become more sophisticated, permitting both concurrent data retrieval and update operations to remote databases, the potentials for conflicts between transactions becomes very high. Therefore, we must ensure correct transaction operation and the correct synchronization of concurrent transactions to avoid deadlock and ensure correctness. The paper presents a formal specification methodology based on the concept of concurrent execution that provides automatic communication and synchronization mechanisms between concurrent processes. The paper explores the issues of correctness, reliability, and recovery of data distributed across the enterprise, describes techniques for guaranteeing and enhancing correctness and procedures for recovering transactions and data in case of any transaction failures to guarantee a high degree of system dependability. Formal methods simplify the writing of concurrent programs by taking most of the burden of synchronization away from the programmer. Further specifying transaction systems formally, enhances application quality and reliability by verifying the functionalities of applications and the correctness of data.
A-posteriori error estimates for a finite volume method for the Stokes problem in two dimensions
Authors: P. Chatzipantelidis, Ch. Makridakis, M. Plexousakis
Venue: Applied Numerical Mathematics (2003)

Two a-posteriori error estimators for a nonconforming finite volume discretization of the stationary Stokes equations are presented and analyzed. Numerical experiments are used to confirm the expected rate of convergence of the estimators.
Preserving Privacy in a Network of Mobile Computers
Authors: David A. Cooper, Kenneth P. Birman
Venue:  (1995)

Even as wireless networks create the potential for access to information from mobile platforms, they pose a problem for privacy. In order to retrieve messages, users must periodically poll the network. The information that the user must give to the network could potentially be used to track that user. However, the movements of the user can also be used to hide the user''s location if the protocols for sending and retrieving messages are carefully designed. We have developed a replicated memory service which allows users to read from memory without revealing which memory locations they are reading. Unlike previous protocols, our protocol is efficient in its use of computation and bandwidth. In this paper, we will show how this protocol can be used in conjunction with existing privacy preserving protocols to allow a user of a mobile computer to maintain privacy despite active attacks.
Learning the nonlinearity of Neurons from natural visual stimuli
Authors: Christoph Kayser, Konrad P. Körding, Peter König
Venue: Neural Computation (2003)

Learning in neural networks is usually applied to parameters related to linear kernels and keeps the nonlinearity of the model fixed. Thus, for successful models, properties and parameters of the nonlinearity have to be specified using a priori knowledge, which often is missing. Here, we investigate adapting the nonlinearity simultaneously with the linear kernel. We use natural visual stimuli for training a simple model of the visual system. Many of the neurons converge to an energy detector matching existing models of complex cells. The overall distribution of the parameter describing the nonlinearity well matches recent physiological results. Controls with randomly shuffled natural stimuli and pink noise demonstrate that the match of simulation and experimental results depends on the higher-order statistical properties of natural stimuli.
A Model for Crosstalk Noise Evaluation in Deep Submicron Processes
Authors: Fabrice Ilponse
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

To certify the correctness of a design, in deep submicron technologies, the verification process has to cover some new issues. The noise introduced on signals through the crosstalk coupling is one of these emerging problems. In this paper, we propose a model to evaluate the peak value of the noise injected on a signal during the transition of its neighboring signals. This model has been used in a prototype verification tool and has shown a satisfying accuracy within a reasonable computation delay.
Real World Adobe Illustrator 10
Authors: Deke McClelland
Venue:  (2002)

:If you're looking for one book that tells you everything you need to know about Illustrator 10, you've found it. Real World Adobe Illustrator 10 is your comprehensive guide to Adobe's industry-standard vector graphics software. Whether you're new to Illustrator or just upgrading to Version 10, you need the low-down on the latest features. This book shows you how to make Web graphics using Illustrator's new symbols and slicing options and enhance your creative ideas with live distortion tools. It also shows you how to publish in record time with dynamic, data-driven graphics and other new productivity features. In the capable hands of renowned author Deke McClelland, you'll be a master in no time.
Adaptive (T/sub 1/, T/sub 2/)-multiplexing transmission schemes for voice/data integrated networks
Authors: A. Nguyen, N. Bambos, M. H. Sherif
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

Integrated multiplexing schemes are needed to optimize the use of transmission bandwidth in integrated networks. In this paper, we introduce the idea of a dynamically controlled (T/sub 1/, T/sub 2/) multiplexing scheme. The advantages of this transmission policy is that it allocates the transmission capacity of the channel to two traffic types according to the instantaneous needs. We consider only two types of traffic, voice band traffic and digital data. The channel access times for voice and data are T/sub 1/ and T/sub 2/, respectively. In this paper, we present some preliminary results of our proposed scheme. In our simulations, we observe that a reduction in blocking probability of 15% or more is possible.
Rational canonical forms and efficient representations of hypergeometric terms
Authors: S. A. Abramov, H. Q. Le, M. Petkovšek
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

We propose four multiplicative canonical forms that exhibit the shift structure of a given rational function. These forms in particular allow one to represent a hypergeometric term efficiently. Each of these representations is optimal in some sense.
Efficient Enumeration of Non-isomorphic Processing Trees
Authors: Florian Waas
Venue:  (1998)

Enumeration of search spaces belonging to join queries, so far comprises large sets of isomorphic processing trees, i.e. trees that can be equalized by only commutative exchange of the input relations to the operators. Since these differences can be handled effectively by the costing method it is sufficient to focus on the enumeration of non-isomorphic processing trees only. This restriction reduces the size of the search space by factor 2^k, k being the number of operators. In this paper we present a technique that generates all non-isomorphic trees belonging to an arbitrarily shaped query graph. The algorithm generates sequences over the query graph''s edges which are simultaneously turned into processing trees. During the incremental expansion of sequence prefixes the remaining edges are classified and only those not leading to isomorphic duplicates are appended. This incremental proceeding causes only little overhead leading to superior performance.
Multiple-Instance Learning of Real-Valued Geometric Patterns
Authors: Sally A. Goldman, Stephen D. Scott
Venue: Annals of Mathematics and Artificial Intelligence (2003)

Recently there has been significant research in multiple-instance learning, yet most of this work has only considered this model when there are Boolean labels. However, in many of the application areas for which the multiple-instance model fits, real-valued labels are more appropriate than Boolean labels. We define and study a real-valued multiple-instance model in which each multiple-instance example (bag) is given a real-valued label in [0, 1] that indicates the degree to which the bag satisfies the target concept. To provide additional structure to the learning problem, we associate a real-valued label with each point in the bag. These values are then combined using a real-valued aggregation operator to obtain the label for the bag. We then present on-line agnostic algorithms for learning real-valued multiple-instance geometric concepts defined by axis-aligned boxes in constant-dimensional space and describe several possible applications of these algorithms. We obtain our learning algorithms by reducing the problem to one in which the exponentiated gradient or gradient descent algorithm can be used. We also give a novel application of the virtual weights technique. In typical applications of the virtual weights technique, all of the concepts in a group have the same weight and prediction, allowing a single &ldquo;representative&rdquo; concept from each group to be tracked. However, in our application there are an exponential number of different weights and possible predictions. Hence, boxes in each group have different weights and predictions, making the computation of the contribution of a group significantly more involved. However, we are able to both keep the number of groups polynomial in the number of trials and efficiently compute the overall prediction.
Continuous Approach to Segmentation of Handwritten Text
Authors: L. M. Mestetskii, I. A. Reyer, T. W. Sederberg
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

A new approach to the segmentation of handwritten text is presented that is based on approximating a binary raster image with a set of polygons and building a continuous skeleton of those polygons. Polygons and skeletons are then used in extraction of lines, removingof spots and artifacts, extraction of words from lines and extraction of strokes from words.
The OpenAccess Coalition - The Drive to an Open Industry Standard Information Model, API, and Reference Implementation for IC Design Data
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

The rapidly increasing complexity of integrated circuit design can only be addressed effectively by a design system architecture that supports very efficient, high-quality sharing of IC design data. Integration of the wide variety of tools required to design and verify the performance and quality of ICs can no longer depend on low-bandwidth file formats. Rather, an Application Programming Interface (API) to a standard Information Model (IM) that provides access to a shared database is an essential infrastructure component of today's IC design systems. Furthermore, this design data API should be standard across the IC CAD industry so that design systems can efficiently draw from best-of-class applications from all sources in the EDA industry. The tight coupling of all tools through a common IM/API 1 enables rapid design convergence with an earlier emphasis on quality issues, which results in higher quality IC's while meeting aggressive time-to-market demands.
Construction of Quasi-binary Relations in the Semantic Networks
Authors: Ludmila Yu. Zhilyakova
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The goal of this paper is to introduce heterogeneous semantic network that supports binary and quasi-binary relations. The method is worked out which allows replacing relations of any complexity and combinations of different kinds of binary relations with the single quasi-binary relation. This is obtained by introducing the technique of formation of plural entities from atomic ones.Creation new nodes and relations in semantic networks is possible at design time and run time.When conjoining nodes, the topology of network is being changed.This will simplify the knowledge representation and the procedure of inference.By means of constructed network, it becomes possible to solve a large class of the problems that are not formalized within the framework of networks with constant topology. 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
Contract Type Sequencing for Reallocative Negotiation
Authors: Martin Andersson, Tuomas Sandholm
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

The capability to reallocate items (e.g. tasks, securities, bandwidth slices, Mega Watt hours of electricity, and collectibles) is a key feature in automated negotiation. Especially when agents have preferences over combinations of items, this is highly nontrivial. Marginal cost based reallocation leads to an anytime algorithm where every agent's utility increases monotonically over time. Different contract types head toward different locally optimal task allocations, and contracts from a recently introduced comprehensive contract type, OCSM-contracts, head toward the global optimum. Reaching it can take impractically long, so it is important to trade off solution quality against negotiation time.To construct negotiation protocols that lead to the best achievable allocations in a bounded amount of time, we compared sequences of four contract types: original, cluster, swap, and multiagent contracts. The experiments show that it is profitable to use multiple contract types in the sequence: significantly, better solutions are reached, and faster, than if only one contract type is used. However, the best sequences only include original and cluster contracts. Swap and multiagent contracts lead to bad local optima quickly. Interestingly, the number of contracts using any given contract, type does not always decrease over time: contracts play the role of enabling further contracts.
SICStus Prolog User''s Manual
Authors: Johan Andersson, Stefan Andersson, Kent Boortz, Mats Carlsson, Hans Nilsson, Thomas Sjöland, Johan Widen
Venue:  (1993)

This manual describes a Prolog system developed at the Swedish Institute of Computer Science. Parts of the system were developed by the project ``Industrialization of SICStus Prolog'''' in collaboration with Ericsson Telecom AB, NobelTech Systems AB, Infologics AB and Televerket. The system consists of a WAM emulator written in C, a library and runtime system written in C and Prolog and an interpreter and a compiler written in Prolog.
User-trainable video annotation using multimodal cues
Authors: C-Y. Lin, M. Naphade, A. Natsev, C. Neti, J. R. Smith, B. Tseng, H. J. Nock, W. Adams
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

This paper describes progress towards a general framework for incorporating multimodal cues into a trainable system for automatically annotating user-defined semantic concepts in broadcast video. Models of arbitrary concepts are constructed by building classifiers in a score space defined by a pre-deployed set of multimodal models. Results show annotation for user-defined concepts both in and outside the pre-deployed set is competitive with our best video-only models on the TREC Video 2002 corpus. An interesting side result shows speech-only models give performance comparable to our best video-only models for detecting visual concepts such as "outdoors", "face" and "cityscape".
Crosstalk Aware Static Timing Analysis: A Two Step Approach
Authors: B. Franzini, C. Forzan, D. Pandini, P. Scandolara, A. Dal Fabbro
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Interconnect parasitic effects are one of the limiting factors for the performances of deep submicron VLSI designs, where the interconnect induced delay dominates over the gate delay. Furthermore, as coupling capacitance between wires increases due to the geometry scaling, the design verification process must accurately take into account crosstalk induced effects.In this paper, we describe CASTA (Crosstalk Aware Static Timing Analysis), a new efficient and accurate methodology for the timing performance verification of large VLSI designs, which accurately considers the crosstalk induced delay and noise injection. Our approach is based on the combination of Static Timing Analysis (STA) with interconnect network order reduction macromodeling techniques and it allows to evaluate the crosstalk effects during gate-level delay calculation, thus enlightening potential timing hazards.The timing effects due to the crosstalk between adjacent interconnects are accounted by a order reduction based macromodel of the overall linear interconnect network. The effectiveness of the proposed methodology has been demonstrated with the analysis of the crosstalk effects on a 0.25mm, high density, CMOS technology.
A Hybrid Large Vocabulary Handwritten Word Recognition System Using Neural Networks with Hidden Markov Models
Authors: Alessandro L. Koerich, Yann Leydier, Robert Sabourin, Ching Y. Suen
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

In this paper we present a hybrid recognition system that integrates hidden Markov models (HMM) with neural networks (NN) in a probabilistic framework. The input data is processed first by a lexicon-driven word recognizer based on HMMs to generate a list of the candidate N-best-scoring word hypotheses as well as the segmentation of such word hypotheses into characters. An NN classifier is used to generate a score for each segmented character and inthe end, the scores from the HMM and the NN classifiers are combined to optimize performance. Experimental results show that for an 80,000-word vocabulary, the hybrid HMM/NN system improves by about 10% the word recognition rate over the HMM system alone.
Optimal Distribution Tree for Internet Streaming Media
Authors: Min Sik Kim, Simon S. Lam, Dong-Young Lee
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Internet radio and television stations require significantbandwidth to support delivery of high quality audio andvideo streams to a large number of receivers. IP multicast isan appropriate delivery model for these applications. However,widespread deployment of IP multicast on the Internetis unlikely in the near future. An alternative is to builda multicast tree in the application layer. Previous studieshave addressed tree construction in the application layer.However, most of them focus on reducing delay. Few systemshave been designed to achieve a high throughput forbandwidth-intensive applications. In this paper, we presenta distributed algorithm to build an application-layer tree.We prove that our algorithm finds a tree such that the averageincoming rate of receivers in the tree is maximized (undercertain network model assumptions). We also describeprotocols that implement the algorithm. For implementationon the Internet, there is a tradeoff between the overheadof available bandwidth measurements and fast convergenceto the optimal tree. This tradeoff can be controlled by tuningsome parameters in our protocols. Our protocols arealso designed to maintain a small number, O(log n), of softstates per node to adapt to network changes and node failures.
Process synchronization by counter variables
Authors: A. J. Gerber
Venue: ACM SIGOPS Operating Systems Review (1977)

A new method for expressing synchronization is presented which derives from several concepts in existing notational schemes. Synchronization conditions are expressed in terms of (integer) counters which are incorporated into the definitions of data objects shared by several asynchronous processes. It is shown that the method is at least as powerful as PV-type synchronization, and the solutions to some "classical" problems are presented using the notation.
Weighted well-covered graphs and complexity questions
Authors: Zverovich I. E.
Venue:  (2001)

A weighted graph G is called well-covered if all its maximal stable sets have the same weight. This common weight is the value of G. Let S be a stable set of G (possibly, $S = \emptyset$). The subgraph $G - N[S]$ is called a co-stable subgraph of G. We denote by Sub(G) the set of all co-stable subgraphs of G (considered up to isomorphism). A class of weighted graphs P is called co-hereditary if it is closed under taking co-stable subgraphs, i.e., $G \in \mathcal{P}$ implies ${\rm CSub}(G) \subseteq \mathcal{P}$. We note that the class $\mathcal{WW}$ of all weighted well-covered graphs is co-hereditary and characterize $\mathcal{WW}$ in terms of forbidden co-stable subgraphs. Then we use a reduction from Satisfiability to show that the following decision problems are NP-complete. Decision Problem 1 (Co-Stable Subgraph). Instance: A graph $G$ and a set $U \subseteq V(G)$ that induces a subgraph $H$. Question: Is $H$ a co-stable subgraph of $G$? Decision Problem 2 (Co-Stable Subgraph $H$). Instance: A graph $G$. Question: Is $H$ a co-stable subgraph of $G$? Let $\Delta(G)$ be the maximum vertex degree of a graph $G$. We show that recognizing weighted well-covered graphs with bounded $\Delta(G)$ can be done in polynomial time.