ppxscal/embedding_network huggingface dataset:
Some Results on Activation and Scaling of Sparse Distributed Memory
Authors: Jan Kristoferson
Venue:  (1997)

It has been suggested that in certain situations it would make sense to use different activation probabilities for writing and reading in SDM (Sparse Distributed Memory). However, here we model such a situation and find that, at least approximately, it is optimal to use the same probabilities for writing and reading. We also investigate the scaling up of SDM, in connection with some observations made by Sj{\"o}din, see \cite{Sjodin-97}. It is shown that the original SDM (here in Jaeckel''s version) does not scale up if the reading address is disturbed, but that this can be remedied by using a kind of sparse SDM. 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
Reliable Broadcast Protocols
Authors: Thomas A. Joseph, Kenneth P. Birman
Venue:  (1988)

NO AVAILABLE
A Recursive Relation for the Determinant of a Pentadiagonal Matrix
Authors: Roland A. Sweet
Venue:  (1968)

A recursive relation is developed for the determinant of a pentadiagonal matrix $S$ which satisfies $s_{i,j} \neq 0$ for $|i-j|=1$. When $S$ is symmetric, one has a six-term recursive relation. An example is given to illustrate its use in the computation of eigenvalues.
A Simple Domain Decomposition Algorithm with Nonconforming Elements
Authors: Jin Gu, Zian Hu
Venue:  (1995)

A simple domain decomposition algorithm is proposed to solve the algebraic system of equations arising from the discretization of symmetric elliptic problems via nonconforming finite elements which are only continuous at the midpoints of the elements'' edges of the quasi-uniform mesh. Theoretical analysis is given and the results of numerical experiments are reported.
Software reliability engineering for client-server systems
Authors: N. F. Schneidewind
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Too often, when doing software reliability modeling and prediction, the assumption is made that the software involves either a single module or a single node. The reality in today's increasing use of multi-node client-server systems is that there are multiple software entities that execute on multiple nodes that must be modeled in a system context, if realistic reliability predictions and assessments are to be made. For example, if there are N/sub c/ clients and N/sub x/ servers in a client-server system, it is not necessarily the case that a software failure in any of the N/sub c/ clients or N/sub x/ servers will cause the system to fail. Thus, if such a system were to be modeled as a single entity, the predicted reliability would be much lower than the true reliability, because the prediction would not account for criticality and redundancy. The first factor accounts for the possibility that the survivability of some clients and servers will be more critical to continued system operation than others, while the second factor accounts for the possibility of using redundant nodes to allow for system recovery should a critical node fail. To address this problem, we must identify which nodes-clients and servers-are critical and which are not critical, as defined by whether these nodes are used for critical or non-critical functions, respectively.
Extended Boolean Information Retrieval
Authors: Gerard Salton, Edward A. Fox, Harry Wu
Venue:  (1982)

In conventional information retrieval Boolean combinations of index terms are used to formulate the users'' information requests. While any document is in principle retrievable by a Boolean query, the amount of output obtainable by Boolean processing is difficult to control, and the retrieved items are not ranked in any presumed order of importance to the user population. In the vector processing model of retrieval, the retrieved items are easily ranked in decreasing order of the query-record similarity, but the queries themselves are unstructured and expressed as simple sets of weighted index terms. A new, extended Boolean information retrieval system is introduced which is intermediate between the Boolean system of query processing and the vector processing model. The query structure inherent in the Boolean system is preserved, while at the same time weighted terms may be incorporated into both queries and stored documents; the retrieved output can also be ranked in strict similarity order with the user queries. A conventional retrieval system can be modified to make use of the extended system. Laboratory tests indicate that the extended system produces better retrieval output than either the Boolean or the vector processing systems.
Integration of reactive utilitarian navigation and topological modeling
Authors: Javier de Lope, Darío Maravall
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

This chapter describes a hybrid autonomous navigation system for mobile robots. The control architecture proposed is highly modular and is based on the concept of behavior, which is a generalization of the usual reactive interpretation of this term. The proposed navigation system involves a straightforward integration of reactive and deliberative modules, enabling global, model-based navigation and local, adaptive navigation. At the local navigation level, we introduce the concept of utilitarian navigation, which models low-level robot navigation as a functional optimization process. Thanks to this innovative perspective, we have been able to implement low-level tasks, like collision avoidance and sensory source search and evasion, which have been integrated into the hybrid navigation system. At the global navigation level, two fundamental problems are considered: (1) map or model building and (2) route planning. Fuzzy Petri nets (FPN) are used to construct topological maps. A minimum cost algorithm of the FPN propagation has been implemented for route planning and execution. This chapter also discusses the experimental work carried out with realistic simulations, as well as with a holonomic prototype built by the authors and a NOMAD-200 mobile platform.
Simulation of Hardware Dynamic Scheduling on the DLX Architecture
Authors: Azer Bestavros, Yueh Liu
Venue:  (1995)

Abstract We describe our extention of the existing DLX simulator (DLXsim), available from the University of California at Berkeley, which allows the simulation of two hardware dynamic scheduling techniques. There are two DLXsim-like interactive simulators developed as part of this project. DLXscore simulates the operation of a DLX architecture equipped with scoreboarding hardware. DLXscore provides the status of instructions, scoreboard tables, and statistics. DLXtomasulo simulates the operation of a DLX architecture equipped with a hardware implementation of Tomasulo''s algorithm. DLXtomasulo provides the status of instructions, reservation stations, and statistics. Both programs allow the user to configure the number of functional units and the latency of floating point operations.
An Analysis of the Slapper Worm
Authors: Iván Arce, Elias Levy
Venue: IEEE Security and Privacy (2003)

The Slapper Worm has a rich mix of features for both a historical and technical analysis and can help us identify some expectations for information security threats.
Probabilistic Semantics for Cost-Based Abduction
Authors: Eugene Charniak, Solomon E. Shimony
Venue:  (1990)

Cost-based abduction attempts to find the best explanation for a set of facts by finding a minimal-cost proof for the facts. The costs are computed by summing the cost of the assumptions necessary for the proof plus the cost of the rules. We examine existing methods for constructing explanations (proofs) as a minimization problem on a DAG. We then define a probabilistic semantics for the costs, and prove the equivalence of the cost-minimization problem to the Bayesian-network-MAP solution of the system.
Analysis of Implicit Parallelism in Evolutionary Algorithms: A Stochastic Version
Authors: Ding Lixin, Kang Lishan
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

In this paper, implicit parallelism in evolutionary algorithms is discussed.Under the conditionof sampling populations with equal probability, an accurate express of the expected numberof different schemata processed by the evolutionary algorithms in each generation is obtained. Moreover, some kinds of the upper and lower bounds of the expected number are estimated.
Comparison of selection schemes for evolutionary constrained optimization
Authors: Cees H.M. Kemenade
Venue:  (1996)

Evolutionary algorithms simulate the process of evolution in order to evolve solutions to optimization problems. An interesting domain of application is to solve numerical constrained optimization problems. We introduce a simple constrained optimization problem with scalable dimension, adjustable complexity, and a known optimal solution. A set of evolutionary algorithms, all using different selection schemes, is applied to this problem. The performance of the evolutionary algorithms differs strongly. Selection schemes that only use a limited number of offspring as parents for the next generation consistently outperform the schemes that accept all offspring as parents and adjust their fertility based on (relative) fitness during the experiments.
Dynamic Replica Allocation Using Database Migration in Broadband Networks
Authors: Takahiro Hara, Kaname Harumoto, Masahiko Tsukamoto, Shojiro Nishio
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Dynamic relocation of databases through networks, or database migration, will soon become a powerful standard database operation effectively using recent advances in broadband networks. In our previous work, a transaction processing method has been proposed in distributed database environments, based on database migration operations. Generally, database replication is an effective technique to improve transaction-processing throughput in conventional systems.In this paper, we propose a replica management method for use with database migration. Database migration is used at the beginning of a transaction to dynamically relocate database replicas. The performance of the proposed method is evaluated using simulation results.
Solving Time-Dependent Problems: A Decision-Theoretic Approach to Planning in Dynamic Environments
Authors: Mark S Boddy
Venue:  (1991)

Controlling a robot involves making decisions that modify its behavior. Making good decisions may require time-consuming computation. Changes in the environment over time affect when this computation can be done (e.g., after obtaining the necessary information), and when a result is useful (e.g., before some event occurs). This sensitivity to when computation is performed and when decisions are made is what makes these problems ``time-dependent.'''' A controller with more than one decision to make must trade off computation time, based on the expected effect on the system''s behavior. We call the resulting meta-level scheduling problem a ``deliberation-scheduling'''' problem. We have developed a framework for doing deliberation scheduling called ``expectation-driven iterative refinement''''. This framework requires that the decision procedures to which time is allocated be ``anytime algorithms,'''' which can be interrupted at any point to return an answer whose expected utility increases with computation time. We have conducted a theoretical and empirical investigation of the application of expectation-driven iterative refinement to time-dependent problems. We discuss the problem of finding or generating anytime decision procedures and gathering useful expectations on their behavior. The difficulty of doing deliberation scheduling depends in large part on the decision model to be used in computing expectations on the system''s behavior. We show that for many time-dependent problems, optimal deliberation scheduling for a reasonably complex decision model is likely to be computationally expensive. We suggest some ways in which the decision model can be restricted so as to simplify deliberation scheduling. In particular, we discuss generating an explicit ``deliberation schedule'''' on the occurrence of a restricted set of significant events. Empirical results obtained for three different examples demonstrate that this approach can provide computationally inexpensive deliberation scheduling with an expected utility only slightly less than for a more complete (and computationally intractable) decision model. These examples also serve to elucidate some of the issues involved in generating solutions to time-dependent problems, and support our contention that expectation-driven iterative refinement is a useful tool for providing these solutions.
An Approach to Uncertainty in VLSI Design
Authors: Cheryl L Harkness
Venue:  (1991)

Computer-aided design (CAD) tools take a circuit description and analyze the design to predict circuit behavior. Although these descriptions take many forms ranging from behavioral specifications to mask layouts, all of them contain bits of quantitative information about the circuit (e.g. physical dimensions, logic values, threshold voltages, parasitic capacitances). Often the precise values of these circuit characteristics cannot be determined before the layout is completed and/or the chip is fabricated. Even though the exact values are not known, estimates in the form of bounds, probability distributions, or average values can be obtained for these uncertain circuit parameters. Most current CAD tools employ only `expected'' values in their calculations, returning one of several possible outcomes. A fundamental issue is how the circuit will behave with other combinations of possible values. In this thesis, we present a general framework based on interval algebra for modeling uncertainty in VLSI. Our approach is to represent uncertain parameters as bounding intervals and to develop algebras for manipulating these ranges. We explore applications for this framework in several areas of VLSI design, including switch-level simulation, timing analysis, and placement. For each area, we create an application-specific interval algebra and incorporate this algebra within an existing algorithm for solving the problem. The result is a new interval version of the algorithm that uses the full range of values for each uncertain parameter in its computations and returns all possible solutions. The different applications reveal the strengths and the weaknesses of the interval paradigm. Among its many advantages are its versatility, simplicity, and speed. Its main liability is that it may produce over-conservative bounds for some applications. For these cases, we provide alternative interval-based techniques that improve the bounds but require more computation time.
DCWA: A Distributed Collaborative Writing Aid
Authors: K. H. Chang, Y. Gong, A. R. Khan, R. Vuppula, A. W. Wear
Venue:  (1994)

Existing computerized writing tools are mostly designed for access by one user where participants must work in an interleaved fashion to prevent inconsistency. The need for collaborative writing tools has just been recognized in recent years. In this paper, the focus is on the design of a real-time platform-independent collaborative writing prototype, called DCWA. This prototype can be used to improve productivity in many application areas such as academic writing, programming, and administration. No attempt has been made in this work to address all issues related to collaborative writing since it is believed that those should be answered at some later time. Observations of the use of DCWA, including its strength and weakness, are also discussed.
Relaxations of the satisfiability problem using semidefinite programming
Authors: E. Klerk, Hans Maaren, Joost P. Warners
Venue:  (1999)

We derive a semidefinite relaxation of the satisfiability (SAT) problem and discuss its strength. We give both the primal and dual formulation of the relaxation. The primal formulation is an eigenvalue optimization problem, while the dual formulation is a semidefinite feasibility problem. It is shown that using the relaxation, the notorious pigeon hole and mutilated chessboard problems are solved in polynomial time. As a byproduct we find a new `sandwich'' theorem that is similar to Lov\''asz'' famous $\vartheta$-function. Furthermore, using the semidefinite relaxation 2SAT problems are solved. By adding an objective function to the dual formulation, a specific class of polynomially solvable 3SAT instances can be identified. We conclude with discussing how the relaxation can be used to solve more general SAT problems and some empirical observations.
Optimal partitioning of multicast receivers
Authors: Y. R. Yang, Min Sik Kim, S. S. Lam
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

Multicast sessions may have a large number of receivers with heterogeneous reception capacities. To accommodate this heterogeneity various multi-rate schemes, based upon the use of layering or replication, have been proposed. We consider the optimal partitioning of receivers into groups for multi-rate schemes. For a general class of utility functions, we formulate the partitioning problem as an optimization problem to maximize the sum of receiver utilities. We present an efficient dynamic programming algorithm to solve the partitioning problem, and prove that the solution it finds is optimal. We also show that the majority of the benefit of a multi-rate scheme can be gained by using a small number of groups (or layers), say 4 to 5. To illustrate our solution approach, we apply it to the case where receiver capacities are determined by multi-rate max-min fair rates. A complete protocol for receiver rates computation, rates collection, optimal receiver partitioning, and receiver adaptation is presented. We then compare our approach with other multi-rate approaches as well as a single-rate approach. Experimental results show that our approach provides substantial performance improvements.
Admissibility of Fixpoint Induction over Partial Types
Authors: Karl Crary
Venue:  (1998)

Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned types using fixpoint induction. However, fixpoint induction is valid only on admissible types. Previous work has shown many types to be admissible, but has not shown any dependent products to be admissible. Disallowing recursion on dependent product types substantially reduces the expressiveness of the logic; for example, it prevents much reasoning about modules, objects and algebras. In this paper I present two new tools, predicate-admissibility and monotonicity, for showing types to be admissible. These tools show a wide class of types to be admissible; in particular, they show many dependent products to be admissible. This alleviates difficulties in applying partial types to theorem proving in practice. I also present a general least upper bound theorem for fixed points with regard to a computational approximation relation, and show an elegant application of the theorem to compactness.
Model for Fault Tolerance and Policy from RM-ODP Expressed in UML/OCL
Authors: Janis Putman
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

Fault tolerance (FT) is a topic of major concern in achieving dependable systems, for both real-time as well as non-real-time systems. This paper provides a model of achieving fault tolerance, based on the ISO/ITU Reference Model for Open Distributed Processing (RM-ODP). This reference model provides a system software engineering methodology for fault tolerance, an object based model of fault tolerance, system requirements for achieving fault tolerance in an open manner 1, modeling constructs and rules to enable a proper system specification of fault tolerance, and business rules in terms of policies to achieve a well-formed system specification. All these aspects are discussed at some depth in this paper, but primarily focused on how certain behavior can be specified and achieved in an object-based system, using the constructs of the Unified Modeling Language (UML) and Object Constraint Language (OCL).
ARCA Target Configuration Interface Manual
Authors: Maria B Baldacci, Pasquale Pagano
Venue:  (1997)

This is the manual for the users of the interface to configure the ARCA target upon a specific OPAC. EMAIL:: baldacci@iei.pi.cnr.it
An Automated Client-Driven Approach to Data Extraction using an Autonomous Decentralized Architecture
Authors: M. Brian Blake, Patricia Liguori
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Over recent years, "Internet-able" applications and architectures have been used to support domains where there are multiple interconnected systems that are both decentralized and autonomous. One such domain is the support of data management at the enterprise level. Typically, in these domains, both the schema of the data repository and the individual query needs of the users evolve over time. These query needs can include both the type of data and the required format and structure. To handle this evolution, the resulting architecture must enforce the autonomy in systems that support the client needs and constraints, in addition to maintaining the autonomy in systems that support the actual data schema and extraction mechanisms [1], [5], [9]. At the MITRE Corporation, this domain has been identified in the development of a composite data repository for the Center for Advanced Aviation System Development (CAASD). In the development of such a repository, the supporting architecture includes specialized mechanisms to disseminate the data to a diverse evolving set of researchers [2]. This paper presents the motivation and design of such an architecture to support these autonomous data extraction environments. This run-time configurable architecture is implemented using web-based technologies such as the Extensible Markup Language (XML) [6], [11], Java Servlets [10], Extensible Stylesheets (XSL), and a relational database management system (RDBMS).
A Theory of the Brain: There Are Parts of the Brain That Control Other Parts
Authors: Asim Roy
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

A large body of science about the brain, such as connectionism and artificial neural networks, is based on the notion that there are no controllers in the brain. This paper focuses on connectionism and artificial neural networks and argues that this assumption of ¿no controllers in the brain¿ is flawed and violated in every connectionist and neural network system. Moreover, given the current evidence from neuroscience about the brain and from the work of the last fifty years from the connectionist and neural network fields, it is obvious that there are parts of the brain that control other parts. This paper presents this new theory about the brain and argues for it.
Dynamic Bandwidth Allocation for VBR Video Traffic Based on Scene Change Identification
Authors: Hai Liu, Nirwan Ansari, Yun-Qing Shi
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

To guarantee quality of service (QoS), the requirements of video transmission, such as delay and cell loss rate (CLR), are very stringent. These constraints are difficult to meet if high network utilization is desired. In this paper, dynamic bandwidth allocation algorithms, in which scene change identification is incorporated, are proposed to improve the bandwidth utilization. The bandwidth allocated for each scene is based on the maximum and mean bandwidth of the scene. When a scene change is identified, a new negotiation process is triggered, and the bandwidth is reallocated.