ppxscal/embedding_network huggingface dataset:
Dynamical Cognitive Network An Extension of Fuzzy Cognitive Map
Authors: Yuan Miao, Chee Kheong Siew, Zhi-Qiang Liu, Shi Li
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

In this paper we present Dynamic Cognitive Network (DCN) which is a systematic extension of the Fuzzy Cognitive Map (FCM). Each concept in Dynamic Cognitive Network can have its own value set, depending on how precisely it needs to be described in the network. This enables dynamic cognitive network to describe the strength of the cause and the degree of the effect. This ability also enables DCN to carry out inferences via numerical calculation instead of symbolic deduction. The arcs of DCN define dynamic relationships between concepts and describe the causal procedures. DCN overcomes the problems of FCM without losing the essential advantages.
Bounding the Error in Gaussian Elimination for Tridiagonal Systems
Authors: Nicholas J. Higham
Venue:  (1988)

If $\hat{x}$ is the computed solution to a tridiagonal system $Ax = b$ obtained by Gaussian elimination, what is the ``best'''' bound available for the error $x \hat{x}$ and how can it be computed efficiently? This question is answered using backward error analysis, perturbation theory, and properties of the $LU$ factorization of $A$. For three practically important classes of tridiagonal matrix, those that are symmetric positive definite, totally nonnegative, or are $M$-matrices, it is shown that $(A + E)\hat{x} = b$ where the backward error matrix $E$ is small componentwise relative to $A$. For these classes of matrix the appropriate forward error bound involves Skeel''s condition number cond$(A, x)$, which we show can be computed exactly in $O(n)$ operations. For diagonally dominant tridiagonal $A$ the same type of backward error result holds and we obtain a useful upper bound for cond$(A, x)$ which can be computed in $O(n)$ operations. We also discuss error bounds and their computation for general tridiagonal matrices.
Dynamic Page Placement in a NUMA Multiprocessor Virtual Memory System
Authors: P R LaRowe, S C Ellis
Venue:  (1989)

Non-uniformity of memory access is an almost inevitable feature of the memory architecture in shared memory multiprocessor designs that can scale to large numbers of processors. One implication of NUMA architectures is that the placement and movement of code and data become crucial to performance. The additional complexity of a main memory architecture with a distinction between local and remote memory demands that the operating system assume a larger role in providing memory management support. When one extends the investigation of NUMA memory management techniques found in the literature to consider limitations on the sizes of various main memory components and to include transparent management of the main/secondary memory hierarchy, the issues become more complex. This paper elaborates on some of these issues and proposes a dynamic page placement policy based on frame borrowing and page recall as a partial solution. The extension of our algorithm to attack the more general migration problem is also discussed. Results of experiments designed to evaluate the approach are presented.
Cybermeeting: How to Link People and Technology in Your Organization
Authors: James L. Creighton, James W. Adams
Venue:  (2003)

:CyberMeeting is a breakthrough book that will help you head off money-wasting scenarios and take full advantage of new technologies. It provides a first-of-its-kind look at the new "collaborative technology," and tells you how to manage the transition to cybercollaboration smoothly and effectively - so that your organization reaps all the rewards from its investment and gains a competitive edge. CyberMeeting takes readers beyond the initial fascination and "oh wow" aspect of new technologies, and gives you practical guidance on the many concerns to be considered before leaping into this new world. Specifically, it will help you determine people's needs accurately (if they don't need it, they won't use it!), develop a winning business rationale to persuade your company of the advantages of collaborative technology, negotiate constraints of corporate culture for smoother integration of new systems, and ultimately give you a greater understanding of the dynamics of working in groups.
A preliminary taxonomy of multi-agent interactions
Authors: H. Van Dyke Parunak, Sven Brueckner, Mitch Fleischer, James Odell
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Agent interactions are frequently characterized as "coherent," "collaborative," "cooperative," "competitive," or "coordinated." All of these are specializations of the more foundational category of "correlation," which can be measured by the joint information of a system. "Congruence" is an orthogonal category, reflecting the degree to which correlation and its specializations satisfy user requirements. Lack of correlation can sometimes arise purposefully, and requires the use of formal stochasticity.
Faster SVD for Matrices with Small $m/n$
Authors: David Bau
Venue:  (1994)

The singular values of a matrix are conventionally computed using either the bidiagonalization algorithm by Golub and Reinsch (1970) when $m/n 5/3.$ However, there is an algorithm that is faster and that does not involve a discontinuous choice, as follows: in all cases, perform a QR factorization as in Lawson-Hanson-Chan, but rather than do this right at the beginning, do it after zeros have already been introduced in the first $j = 2n m$ rows and columns. The same technique applies when computing singular vectors, with one small modification. If left singular vectors are needed, the new algorithm becomes advantageous only when $m < 1.2661n$, and the best $j$ in this case is $3n m$. The benefits of the new algorithm appear in terms of classical scalar floating-point operation counts; the effects of locality and parallelization are not considered in the analysis.
Polarization-Based Decorrelation of Transparent Layers: The Inclination Angle of an Invisible Surface
Authors: Yoav Y. Schechner, Joseph Shamir, Nahum Kiryati
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

When a transparent surface is present between an observer and an object, an image reflected by the surface may be superimposed on the image of the observed object. We present a new approach to recover the scenes (layers) and to classify which is the reflected/transmitted one, based on imaging through a polarizing filter at two orientations. Estimates of the separate layers are obtained by weighted pixel-wise differences of these images, inverting the image formation process. However, the weights depend on the angle of incidence, hence on the inclination of the transparent (invisible) surface. This angle is estimated by seeking the angle-value which (through the weights) leads to decorrelation of the estimated layers. Experimental results, obtained using real photos of actual objects, demonstrate the success of angle estimation and consequent layer separation and labeling. The method is shown to be superior to earlier methods where only raw optical data was used.
The Art of Assembly Language
Authors: Randall Hyde
Venue:  (2003)

:THE ART OF ASSEMBLY LANGUAGE is a practical and comprehensive guide to assembly language. It presents assembly language from the high-level programmer's point of view, allowing the reader to start writing meaningful assembly language programs immediately. The CDROM includes the High Level Assembler (HLA) tool and the HLA Standard Library, all the source code from the book, plus over 50,000 lines of additional sample code, all well-documented and tested.
Improved Data Structures for Fully Dynamic Biconnectivity
Authors: Monika H. Rauch
Venue:  (1994)

We present fully dynamic algorithms for maintaining the biconnected components in general and plane graphs. A fully dynamic algorithm maintains a graph during a sequence of insertions and and deletions of edges or isolated vertices. Let $m$ be the number of edges and $n$ be the number of vertices in a graph. The time per operation of the best known algorithms are $O(\sqrt{n})$ in general graphs and $O(\log n)$ in plane graphs for fully dynamic connectivity and $O(\min\{m^{2/3}, n\})$ in general graphs and $O(\sqrt{n})$ in plane graphs for fully dynamic biconnectivity. We improve the later running times to $(\min\{\sqrt{m}\log n, n \})$ in general graphs and $O(\log^{2}n)$ in plane graphs. Our algorithm for general graphs can also find the biconnected components of all vertices in time $O(n)$. The update times in general graphs are amortized. This shows that the biconnected components of a graph can be dynamically maintained almost as efficiently as the connected components.
Long cluster neural net: architechure, training, applications and its analog realisation
Authors: Joaquin Sitte
Venue:  (1996)

The local cluster (LC) artificial neural net architecture uses sigmoid functions to generate localise functions, similar to Radial Basis Functions but somewhat more general, for multi dimensional function approximation. The LC net provides a neural network architecture of wide applicability that trains much faster than the conventional multilayer perceptron net. This report describes the computation abilities of the LC architecture and investigates the feasibility of an analog implementation. An anal implementation holds the promise of a low cost fully parallel realisation for real time control application Measurements on a prototype analog LC net built from discrete components show that the concept works well in practice. It is also shown that circuit complexity the LC architecture is very similar to an anal RBF network realisation. A parallel on chip training method is also suggested and the possible robustness
From problem to solution with quality attributes and design aspects
Authors: Jan Gerben Wijnstra
Venue: Journal of Systems and Software (2003)

It is commonly accepted that quality attributes shape the architecture of a system. There are several means via which the architecture can support certain quality attributes. For example, to deal with reliability the system can be decomposed into a number of fault containment units, thus avoiding fault propagation. In addition to structural issues of architecture, qualities also influence architectural rules and guidelines, such as coding standards. In this paper we will focus on design aspects as a means of supporting quality attributes. An example of a design aspect is error handling functionality, which supports reliability. Quality attributes play a role in the problem domain; design aspects are elements in the solution domain.We will use an industrial case to illustrate our ideas. The discussion ranges from how design aspects are defined in the architecture based on quality attributes, to how design aspects can be used to verify the realized system against the prescribed architecture. The industrial case is a product family of medical imaging systems. For this product family, the family members are constructed from a component-based platform. Here, it is especially useful to achieve aspect-completeness of components, allowing system composition without worrying about individual design aspects.
Text categorization by boosting automatically extracted concepts
Authors: Lijuan Cai, Thomas Hofmann
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Term-based representations of documents have found wide-spread use in information retrieval. However, one of the main shortcomings of such methods is that they largely disregard lexical semantics and, as a consequence, are not sufficiently robust with respect to variations in word usage.In this paper we investigate the use of concept-based document representations to supplement word- or phrase-based features. The utilized concepts are automatically extracted from documents via probabilistic latent semantic analysis. We propose to use AdaBoost to optimally combine weak hypotheses based on both types of features. Experimental results on standard benchmarks confirm the validity of our approach, showing that AdaBoost achieves consistent improvements by including additional semantic features in the learned ensemble.
Virtual fabrication of steel welded plate girders
Authors: J. Néző, B. H. V. Topping, L. Dunai
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

During the fabrication of plate girders undesirable stresses and deformations develop mainly as a result of uneven temperature distributions. These stresses and deformations (imperfections) may significantly affect the performance (e.g. ultimate strength or fatigue life) of the structure. In the research described in this paper an effective numerical method to predict these imperfections is developed with the objective of incorporating this knowledge into the design procedures. This paper presents the background of the research including the difficulties in numerical welding simulation, the numerical solution strategy and the current state of the development illustrated with examples.
DIMACS ANNUAL REPORT - DECEMBER 1996
Authors: DIMACS
Venue:  (1997)

No abstract. 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
Notes on methods based on maximum-likelihood estimation for learning the parameters of the mixture of Gaussians model
Authors: Luis E. Ortiz, Leslie Kaelbling
Venue:  (1999)

In these notes, we present and review different methods based on maximum-likelihood estimation for learning the parameters of the mixture-of-Gaussians model. We describe a method based on the likelihood equations, traditional gradient-based methods (among them steepest ascent and gradient ascent), expectation-maximization (EM), conjugate gradient methods, and proposed accelerations of EM (among them Aitken acceleration or parameterized EM, and conjugate-gradient acceleration of EM). We describe all the methods in the context of the mixture-of-Gaussians model. We relate the methods presented through the generalized gradient-based formulation. None of the methods presented are theoretically dominant. We empirically analyze their performance on synthetic datasets and suggest cases in which particular methods perform better than others.
Two Wearable Testbeds for Augmented Reality: itWARNS and WIMMIS
Authors: Reinhold Behringer, Clement Tam, Joshua McGee, Sundar Sundareswaran, Marius Vassiliou
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

Personal applications employing Augmented Reality (AR) technology require ease of use and wearability. Progress in hardware miniaturization has enabled the development of wearable testbeds providing sufficient computing power for demanding AR tasks. RSC has assembled a wearable testbed for AR applications consisting solely of commercial off-the-shelf (COTS) hardware components. The system is worn as a jacket with hardware attached to a vest frame (Xybernaut) and cabling concealed under Velcro channels. Two possible configurations allow the system to be used either in a stand-alone mode (¿itWARNS¿) or to be linked to a multi-modal user interface testbed (¿WIMMIS¿). The testbed employs wireless networking hardware and receives analog video and 3D audio signals over radio frequencies (RF), thereby achieving completely tetherless operation.
Fixed Point vs. First-Order Logic on Finite Ordered Structures with Unary Relations
Authors: A. J. Kfoury, M. Wymann-Boeni
Venue:  (1993)

Abstract We prove that first order logic is strictly weaker than fixed point logic over every infinite classes of finite ordered structures with additional unary relations: Over these classes there is always an inductive unary relation which cannot be defined by a first-order formula, even when every inductive sentence (i.e., closed formula) can be expressed in first-order over this particular class. Our proof first establishes a property valid for every unary relation definable by first-order logic over these classes which is peculiar to classes of ordered structures with unary relations. In a second step we show that this property itself can be expressed in fixed point logic and can be used to construct a non-elementary unary relation.
Conditions Unique Graph Embeddings
Authors: Bruce A. Hendrickson
Venue:  (1988)

The graph embedding problem is that of computing the relative locations of a set of vertices placed in Euclidean space relying only upon some set of inter-vertex distance measurements. This paper is concerned with the closely related problem of determining whether or not a graph has a unique embedding. Both these problems are NP-hard, but the proofs rely upon special combinations of edge lengths. If we assume the edge lengths are unrelated then the uniqueness question can be approached from a purely graph theoretic framework that ignores edge lenghts. This paper identifies three necessary graph theoretic conditions for a graph to have a unique embedding in any dimension. Efficient sequential and NC algorithms are presented for each condition, although these algorithms have very different flavors in different dimensions.
Dynamic Hybrid Routing (DHR) in Mobile Ad Hoc Networks
Authors: Seungjin Park, Brian VanVoorst
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

The route discovery and maintenance processes in wireless mobile networks are very expensive tasks due to the mobility of the host. Route discovery requires a considerable amount of resources and therefore it is wise to utilize the effort already invested in existing paths. This paper proposes a dynamic hybrid routing (DHR) protocol in ad hoc networks, which constructs paths only upon demand by taking attributes from both proactive and reactive algorithms. The goal of DHR is to reuse, whenever possible, portions of several existing paths when establishing a new path. The reusability is accomplished by using dynamic proactive zones (PZs), through which nearby existing path information is disseminated. By utilizing the information stored in PZs, considerable savings (in time and traffic) can be achieved over other on-demand routing algorithms that use flooding. In other route-finding algorithms, proactive zones are formed throughout the network and remainunchanged, whereas in DHR, routes are created and destroyed dynamically around the existing paths. Even though DHR may not find the shortest path between source and destination, it does reduce the amount of traffic needed to find a path and therefore increases the available bandwidth for data transfer.
TPO++: An Object-Oriented Message-Passing Library in C++
Authors: Tobias Grundmann, Marcus Ritt, Wolfgang Rosenstiel
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Message passing is a well-known approach for parallelizing programs. The widely used standard MPI (Message passing interface) also defines C++ bindings. Nevertheless, there is a lack of integration of object-oriented concepts. In this paper, we describe our design of TPO++1, an object-oriented message-passing library written in C++ on top of MPI. Its key features are easy transmission of objects, type-safety, MPI-conformity and integration of the C++ Standard Template Library.
Classifying Isogenous Fields
Authors: Sriharsha Veeramachaneni, Hiromichi Fujisawa, Cheng-Lin Liu, George Nagy
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Classifiers that utilize style context in co-occurring patterns increase recognition accuracy. When patterns occur as long isogenous fields, this gain should increase unless negated by parameter estimation errors that increase with field length. We show that our method achieves higher accuracy with longer input fields because it can be trained accurately. We also present some ongoing work on simple heuristics to reduce computational complexity of the scheme.
A prototype multiAgent network security system
Authors: Taraka Pedireddy, José M. Vidal
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Distributed Internet-based attacks on computer systems are becoming more prevalent. These attacks usually employ some form of automation and involve the compromise of many systems across the Internet; systems which are not necessarily owned by the same company or individual. The information needed to detect and neutralize these attacks is spread across many machines. A system administrator who wishes to detect and handle these distributed attacks must constantly monitor his systems and communicate with other administrators around the world-a challenging task. In this paper we present our design and implementation of a multi-agent system, built using FIPA-OS, in which agents responsible for different network realms communicate with each other in order to determine if certain suspicious events are actually part of a distributed attack, and to warn each other about possible threats.
Wireless Mobile Phone Access to the Internet (Innovative Technology series)
Authors: Thomas Noel
Venue:  (2003)

:Wireless mobile phone access to the Internet will add a new dimension to the way we access information and communicate. This book is devoted to the presentation of recent research on the deployment of the network protocols and services for mobile hosts and wireless communication on the Internet. This book examines these two methods of Internet access and presents research papers that propose extensions and optimizations to the existing protocols for mobility support. One can assume that in the near future new mobiles will appear that will support multiple wireless interfaces. Therefore, the new version of the Internet Protocol (IPv6) will be one of the next challenges for the wireless community.
Requirements for Requirements Engineering Technique
Authors: Linda Macaulay
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

The first argument presented in this paper is that if we have a clear understanding of the objectives of the requirements engineering (RE) process then we can identify what techniques we need. No single method or technique will be sufficient. The second argument is that a key objective of the RE process is to specify a system which will ultimately be successful. Three common types of failure are examined, process failure, expectation failure and interaction failure. The third argument is that if the causes of each type of failure can be described then we will be able to identify what techniques are needed to help us avoid failure. The five common causes are described: the requirements engineering process itself, human communication within requirements, knowledge development, documentation of requirements and management. A discussion of each cause is followed a list of the RE techniques needed. The paper concludes with a `wish list' of seventy requirements for RE techniques, and a brief discussion of the strengths and weaknesses of the RE community in meeting those requirements.