ppxscal/embedding_network huggingface dataset:
Best Probability of Activation and Performance Comparisons for Several Designs of Sparse Distributed Memory
Authors: Jan Kristoferson
Venue:  (1995)

The optimal probability of activation and the corresponding performance is studied for three designs of Sparse Distributed Memory, namely, Kanerva''s original design, Jaeckel''s selected-coordinates design and Karlsson''s modification of Jaeckel''s design. We will assume that the hard locations (in Karlsson''s case, the masks), the storage addresses and the stored data are randomly chosen, and we will consider different levels of random noise in the reading address. 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 tool for rapid manual translation
Authors: Magnus Nordstroem, Paul Pettersson
Venue:  (1993)

There have been several attempts to realize the idea of a fully automatic translation system for text translation to replace human translators. By contrast, little work has been put into building tools to aid human translators. This report describes the ideas behind such a tool. The tool is intended to aid human translators in achieving higher productivity and better quality, by presenting terminological information extracted from previous translations. The report documents the implementation and evaluation of a prototype. The prototype has been demonstrated to and used by professional translators with promising results.
Managing Dynamic Groups of Mobile Systems
Authors: Stefan Schemmer, Edgar Nett
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

As road networks are the backbone of transportation and personal mobility, congestions are a severe problem. Improving the utilization of existing roads by scheduling shared resources, e.g. crossroads; more efficiently is a promising approach to alleviate the problem. We havedeveloped an architecture allowing mobile systems to schedule shared resource in real-time based on wireless communication. In this paper, we present two membership protocols, which are at the core of this architecture. The protocols allow mobile systems to join and leave a group with predictable delay. A synchronous system model with omission failures describes the dynamic properties of the medium. The protocols exploit application knowledge to allocate bandwidth to joining stations dynamically yet predictably. Nevertheless, they can be converted to a general solution if predictable join delays are not a requirement.
Detection of Logical Coupling Based on Product Release History
Authors: Harald Gall, Karin Hajek, Mehdi Jazayeri
Venue: Proceedings of the International Conference on Software Maintenance (1998)

Code-based metrics such as coupling and cohesion are used to measure a system's structural complexity. But dealing with large systems-those consisting of several millions of lines- at the code level faces many problems. An alternative approach is to concentrate on the system's building blocks such as programs or modules as the unit of examination. We present an approach that uses information in a release history of a system to uncover logical dependencies and change patterns among modules. We have developed the approach by working with 20 releases of a large Telecommunications Switching System. We use release information such as version numbers of programs, modules, and subsystems together with change reports to discover common change behavior (i.e. change patterns) of modules. Our approach identifies logical coupling among modules in such a way that potential structural shortcomings can be identified and further examined, pointing to restructuring or reengineering opportunities.
The Analogy-based Lexicon Acquisition System
Authors: Stefano Federici, Simonetta Montemagni, Vito Pirrelli
Venue:  (1997)

The Pisa Analogy-based Lexicon Acquisition System (ABLAS) is a specialized version of a general purpose acquisition engine (ABACUS, Federici and Pirrelli 1994) for extraction of subcategorization frames of Italian verbs from chunked text corpora (see deliverable 3.1). TEL:: +39 50 560481
Stability of the residual free bubble method for bilinearfinite elements on rectangular grids
Authors: Leopoldo P. Franca, Lutz Tobiska
Venue:  (2000)

We consider the nature of the stabilizing term arising in the residual free bubble approach for piecewise bilinear functions on rectangular grids. We show, that on the subspace of piecewise linear functions the stabilizing term is identical to that in the streamline diffusion approach. However, on the space of piecewise bilinear functions there is a case in which the stabilizing term is weaker compared to the term used in the streamline diffusion method. In the particular case when the direction of the convection is directed parallel to a diagonal of the quadrilateral, control is lost over the mixed derivatives in the convection-dominated limit.
Adaptive Genetic Operators
Authors: V. Estivill-Castro
Venue:  (1997)

Many intelligent systems search concept spaces that are explicitly or implicitly predefined by the choice of knowledge representation. In effect, the knowledge representation serves as a strong bias. Biases heuristically direct search towards favored regions in the search space. Genetic algorithms are a powerful general-purpose search method based on mechanisms abstracted from natural evolution. The effectiveness of the Genetic Algorithm depends heavily on the synergy of the crossover operators and selected representation. In this paper, we discuss the robustness of recombination operators for genetic operators and propose a new family of crossover operators. We present experimental results that indicate these new operators strike a superior balance between exploration and exploitation. We provide an analysis that sheds some light on why the new genetic operators are more effective and show that they are robust towards the encoding scheme 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
Professional VB.Net Transactions, 1 edition
Authors: Matthew Bortniker, Wrox Dev Team, James Conard
Venue:  (2002)

:This book is suitable for anyone who is interested in working with transactions using Visual Basic .NET. It can be used by beginners/intermediate-level developers who want to incorporate transactions into their .NET applications, and also by experienced Visual Basic 6 developers who want to understand how transactions are implemented in the world of .NET.It is written and tested on Visual Studio .NET 1.0.
Alias Types
Authors: Frederick Smith, David Walker, Greg Morrisett
Venue:  (1999)

Linear type systems allow destructive operations such as object deallocation and imperative updates of functional data structures. These operations and others, such as the ability to reuse memory at different types, are essential in low-level typed languages. However, traditional linear type systems are too restrictive for use in low-level code where it is necessary to exploit pointer aliasing. We present a new typed language that allows functions to specify the shape of the store that they expect and to track the flow of pointers through a computation. Our type system is expressive enough to represent pointer aliasing and yet safely permit destructive operations.
An inner approximation method incorporating with a penalty function method for a reverse convex programming problem
Authors: Syuuji Yamada, Tetsuzo Tanino, Masahiro Inuiguchi
Venue: Journal of Computational and Applied Mathematics (2002)

In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set which is defined by the complement of the interior of a compact convex set X. When X is not necessarily a polytope, an inner approximation method has been proposed (J. Optim. Theory Appl. 107(2) (2000) 357). The algorithm utilizes inner approximation of X by a sequence of polytopes to generate relaxed problems. Then, every accumulation point of the sequence of optimal solutions of relaxed problems is an optimal solution of the original problem. In this paper, we improve the proposed algorithm. By underestimating the optimal value of the relaxed problem, the improved algorithms have the global convergence.
Embedded-Quality for Test
Authors: Yervant Zorian
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

The basic concept of embedding test functions onto the very IC design is a simple one. However, the complexity offered by the emerging system-on-chip and the very deep micron technologies has created difficult challenges and quality risks. A new wave of embedded, quality insurance functions, are needed to address this complexity level. This talk will discuss such design for quality trends and solutions and will analyze their impact not only on go/no-go test, but also on a set of expanded quality insurance functions to support debug, measurement, diagnosis and repair.
Displacement finite element method for couple stress theory
Authors: E. Providas
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The present paper is concerned with the extension of the traditional displacement finite element method to the solution of boundary-value problems in the two-dimensional linear couple stress theory of elasticity. Three triangular finite elements of the displacement field are discussed. Of particular interest is a triangular finite element with merely a total of nine degrees of freedom obtained through a modified principle of potential energy with relaxed continuity requirements.
UNIX Filesystems: Evolution, Design and Impemenation
Authors: Steve Pate, Fred Van Den Bosch
Venue:  (2003)

:Every aspect of a network -- storage, file transfers, backup -- depends on the filesystem for structure, functionality, and integrity. Surprisingly, UNIX -- the operating system of choice for missioncritical networks -- has historically had little documentation on its filesystem structures. Written by Steve Pate, a senior member of the VERITAS Filesystems Group, this book sheds light on the inner workings of UNIX filesystems and gives you the know-how to fine-tune your UNIX filesystems for optimal performance. Pate also provides a complete implementation of the System V filesystem on Linux, as well as instructions on how to build, install, and analyze it.
A Note on Redundant Linear Constraints
Authors: Pascal Van Hentenryck, Jean Imbert
Venue:  (1992)

Much research on redundancy has focused on identifying syntactic properties of redundant and non-redundant constraints to avoid resorting to costly semantic methods (e.g.{} optimization). In this paper, we study the detection of redundant linear constraints using a lexicographic solved form. The lexicographic solved form is the basis of an incremental decision procedure, based on the simplex algorithm, for systems of equations, inequalities, and disequations. It enjoys the two important properties of (1) precluding syntactically the presence of implicit equalities and (2) being preserved by pivoting under a lexicographic pivoting rule. We show that the lexicographic solved form helps to identify new syntactic criteria for detectping redundant and non-redundant constraints. These criteria generalize and amplify existing results. In addition, we present a syntactic method to reduce a system of linear constraints that can be used before further applications of syntactic criteria or possibly semantic methods.
Microsoft Office Access 2003 Inside Out
Authors: John Viescas
Venue:  (2003)

Take your database expertise to the next level! This supremely organized reference packs hundreds of timesaving solutions, troubleshooting tips, and handy workarounds for Microsoft Office Access 2003 in concise, fast-answer format.
The Complexity of Matrix Rank and Feasible Systems of Linear Equations
Authors: Eric Allender, Robert Beals, Mitsunori Ogihara
Venue:  (1997)

We characterize the complexity of some natural and important problems in linear algebra. In particular, we identify natural complexity classes for which the problems of (a) determining if a system of linear equations is feasible and (b) computing the rank of an integer matrix, (as well as other problems), are complete under logspace reductions. As an important part of presenting this classification, we show that the ``exact counting logspace hierarchy'''' collapses to near the bottom level. (We review the definition of this hierarchy below.) We further show that this class is closed under NC^1-reducibility, and that it consists of exactly those languages that have logspace uniform span programs (introduced by Karchmer and Wigderson) over the rationals. In addition, we contrast the complexity of these problems with the complexity of determining if a system of linear equations has an integer solution.
Sparse Sets in NP-P: EXPTIME Versus NEXPTIME
Authors: Juris Hartmanis, Vivian Sewelson, Neil Immerman
Venue:  (1983)

This paper investigates the structural properties of sets in NP-P and shows that the computational difficulty of lower density sets in NP depends explicitly on the relations between higher deterministic and nondeterministic time-bounded complexity classes. The paper exploits the recently discovered upward sparation method, which shows for example that there exist sparse sets in NP-P if and only if EXPTIME $\neq$ NEXPTIME. In addition, the paper uses relativization techniques to determine logical possibilities, limitations of these proof techniques, and, for the first time, to exhibit structural differences between relativized NP and CoNP.
Analyzing the efficiency of strategies for MAS-based sensor interpretation and diagnosis
Authors: Norman Carver, Ruj Akavipat
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

One of the factors holding back the application of multi-agent, distributed approaches to large-scale sensor interpretation and diagnosis problems is the lack of good techniques for predicting the performance of potential systems. In this paper we use a consideration of Bayesian network inference algorithms to construct formulas that describe the computational and communication resources required by several strategies for MAS-based distributed SI/diagnosis.
Perl Cookbook, 2 edition
Authors: Tom Christiansen, Nathan Torkington
Venue:  (2003)

:The Perl Cookbook is a comprehensive collection of problems, solutions, and practical examples for anyone programming in Perl. Topics range from beginner questions to techniques that even the most experienced Perl programmers can learn from. More than just a collection of tips and tricks, the Perl Cookbook is the long-awaited companion volume to Programming Perl, filled with previously unpublished Perl arcana.
Verification of Temporal Properties
Authors: Limor Fix, Orna Grumberg
Venue:  (1993)

The paper presents a relatively complete deductive system for proving branching time temporal properties of reactive programs. No deductive system for verifying branching time temporal properties has been presented before. Our deductive system enjoys the following advantages. First, given a well-formed specification there is no need to translate it into a normal-form specification since the system can handle any well-formed specification. Second, given a specification to be verified, the proof rule to be applied is easily determined according to the top level operator of the specification. Third, the system reduces temporal verification to assertional reasoning rather than to temporal reasoning.
Coordination factors in adaptive scheduling for soft real-time cooperative tasks: a performance study
Authors: F. Daoud
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

In the complex work environments of modern industrial and administrative organisations, the problems of articulating distributed activities are at a high order of complexity. To master these complexities, we adopt a reflective system architecture. With such architecture the necessary adaptability for complex real-time systems can be attained. The advantage of the coordination mechanism (help) defined in this paper is to allow multi-agent systems to reason about their performance in terms of missed soft deadlines and completeness and to adapt to dynamic environments.
Incorporating Business Process Management into Network and Systems Management
Authors: Lundy Lewis, Jim Frey
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

Integrated network and systems management for communications networks is relatively mature. In addition, techniques for off-line simulation and analysis of business processes is relatively mature. Since many of the components of a business process now include network communications, devices, and applications, the time is ripe for integrating business process (BP) modeling methods and network management into real-time BP monitoring and control. In this paper we describe our direction and results towards this end, where we employ the Spectrum network management platform, the Atrium systems management agent, and the NerveCenter process modeling tool in an integrated, decentralized architecture.
Projective Alignment with Regions
Authors: Ronen Basri, David Jacobs
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

We consider a recent approach to recognition that uses regions to determine the pose of objects while allowing for partial occlusion of the regions. In this paper we further analyze properties of the method for planar objects undergoing projective transformations. We prove that three visible regions are sufficient to determine the transformation uniquely, and that for a large class of objects two regions are insufficient. However, we show that when several regions are available the pose of the object can generally be recovered even when all but two regions are significantly occluded. Our analysis is based on investigating the flow patterns of points under projective transformations in the presence of fixed points.
A Process Framework for Requirements Analysis and Specification
Authors: Enrique García Alcázar, Antonio Monzón
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

This paper presents a new approach for linking Requirements Engineering activities into a Process Framework that can br used as a reference for driving concrete Requirements Engineering processes. Special emphasis is placed on constructing Problem Domain models in order to build a common understanding of the problem context, to situate user requirements with reference to it, and as a technique for user requirements refinement. Another aspect highlighted by the Process Framework is the separation of the elicitation, analysis and refinement of user requirements from the construction of a system or software specification. Although the emphasis is placed on the process and the activities to be performed, the paper describes specific techniques that have been used successfully. The Process Framework is supported by a tool and has been tested in several projects from different organizations. This paper describes these experiences, draws conclusions and highlights future issues.
Extensionality of simply typed logic programs
Authors: Marc A. Bezem
Venue:  (1999)

We set up a framework for the study of extensionality in the context of higher-order logic programming. For simply typed logic programs we propose a novel declarative semantics, consisting of a model class with a semi-computable initial model, and a notion of extensionality. We show that the initial model of a simply typed logic program, in case the program is extensional, collapses into a simple, set-theoretic representation. Given the undecidability of extensionality in general, we develop a decidable, syntactic criterion which is sufficient for extensionality. Some typical examples of higher-order logic programs are shown to be extensional.
Empirical TCP Profiles and Application
Authors: Catalin T. Popescu, A. Udaya Shankar
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

We characterize a TCP implementation by a function, called a profile, that expresses the instantaneous throughput at the source in terms of the instantaneous roundtrip time and instantaneous loss rate for bulk transfers. We empirically obtain profiles of several TCP implementations, accurately enough to distinguish not only the TCP version but also the implementation (BSD, Windows, etc).Profiles have several uses: comparing different TCP implementations, diagnosing a TCP implementation, quantifying TCP-friendly flows, etc. We devise a method that uses profiles to compute the time-evolution of instantaneous performance metrics (throughput, queue size, loss rate, etc.) of TCP networks. Comparison against ns simulations shows the method to be accurate and fast.
Von Neumann's machine in the shell: enhancing the robustness of self-replication processes
Authors: Hiroki Sayama
Venue: Proceedings of the eighth international conference on Artificial life (2002)

One of the grand challenges in artificial life is to create an artificial system that demonstrates self-replication and evolution in the real physical world (Bedau et al. 2000). This question was obviously initiated by von Neumann's seminal work on the self-replicating and evolving automaton that was presented more than five decades ago (von Neumann 1951; 1966). Unlike his well known idea of universal computer, however, von Neumann's universal constructor has never been subject to physical implementation (Friedman 1996). This is mainly due to the fragility of its mechanisms against perturbations that are unavoidable in more realistic kinematic settings. In this brief concept paper, I present a simple, but substantial, I believe, idea of enhancing the robustness of the self-replication processes, by introducing an additional subsystem that constructs a "workplace" prior to automaton construction. Workplaces are assumed to be solid structures that can be easily assembled under perturbations and can rigidly hold other components during the automaton construction processes. Similar kind of strategies are found to be prevalent in biological organisms, suggesting the effectiveness of the presented idea for the realization of kinematic models of self-replication and evolution.
Combinatorial Optimization 1990: Lecture Notes
Authors: P. Klein, P. Hubbard, P. Krishnan, G. Hillebrand, D. Langworthy, M. Goldwasser, A. Mayer, K. Basye, J. Borger, D. Luks, D. B. Conner, D. Cervone, S. Sairam, R. Ravi, A. Agrawal, R. Cohen, S. Rosenzweig
Venue:  (1991)

This technical report consists of lecture notes for a seminar on combinatorial optimization held in fall 1990. The notes were edited by Philip Klein and written by members of the class. Editorial and organizational assistance was provided by Tina Cantor and Hsueh-I Lu.
On Characterizations of Superlinear Convergence for Constrained Optimization
Authors: Thomas F. Coleman
Venue:  (1988)

We show how the Dennis-More characterization of superlinear convergence for unconstrained optimization can be applied, and usefully restricted for use in the constrained setting.
Analysis of Fitness Landscape Properties for Evolutionary Antenna Design
Authors: Jarmo T. Alander, Lyudmila A. Zinchenko, Sergey N. Sorokin
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Antenna design is a complex engineering problem domain in which effective search methods are required. In this paper, we examine several fitness function landscapes using the method of barrier trees. A practical illustration of the use of the method is demonstrated for the design of 3 and 5 element dipole antennas.