ppxscal/embedding_network huggingface dataset:
A HMM approach to the estimation of random trajectories on manifolds
Authors: Jorge S. Marques, João M. Lemos, Arnaldo J. Abrantes
Venue: Signal Processing (2002)

Dynamic image analysis requires the estimation of time-varying model parameters (e.g., shape coefficients). This can be seen as states of a dynamic model which are restricted to a subset of Euclidean space. This paper describes an algorithm for the estimation of the state evolution on manifolds exploiting three sources of information: the manifold geometry, the motion model and the sensor model. Examples are provided to illustrate the performance of this method in situations where classic procedures cannot perform well.
Albert Einstein and Empirical Software Engineering
Authors: Shari Lawrence Pfleeger
Venue: Computer (1999)

The author believes that scientists apply scientific investigative techniques to gain more understanding of what makes software "good" and how to make software well. Often, they adapt investigative techniques from other disciplines to define measures that make sense in the business, technical, and social contexts people use for decision making. However, the author believes that sometimes failure can educate as well as success. Examples from nineteenth-century physics show how a change in perspective can lead to explanations for previously misunderstood phenomena. The author claims that scientists must also consider whether their measurements constrict their view of what is really happening in the development process, and they must change or expand the approach if they are. Science clearly illustrates the limitations of an overly literal approach to building and maintaining software. Too often, the author believes, scientists tend to view software development the same way nineteenth-century phsicists viewed the universe. Taking a cue from Einstein, scientists should shape their theories and models to fit a more probabilistic reality.
Annealed Embeddings of Communication Patterns in an Interconnection Cached Network
Authors: Vipul Gupta, Eugen Schenfeld
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

The communication needs of many parallel applications exhibit what we call switching locality. In such applications, each computation entity (process, thread, etc.) tends to restrict its communication to a small set of other entities. The physical location or proximity of these entities can be arbitrary, as long as the communication degree is small. The Interconnection Cached Network (ICN) is a reconfigurable network ideally suited for exploiting such locality. The use of fast small crossbar switches (Interconnection Caches) with a larger, but slower, reconfigurable network (optimized for connectivity) lets the ICN adapt to the communication requirements of individual applications, potentially achieving higher performance. Embedding communication patterns efficiently in an ICN, requires finding a bounded$\ell$-contraction of the underlying communication graph.The problem of identifying whether a graph has a bounded $\ell$-contraction for a given integer $\ell$ is known to be NP-complete for $\ell > 2$. We describe a heuristic algorithm based on simulated annealing for this problem. We test the effectiveness of our approach by using it to embed graphs, representing regular communication patterns, for which the best solutions are deterministically known. The algorithm does not rely on any structural information of the communication pattern and is therefore applicable to irregular patterns as well. The results of applying our heuristics to embed such irregular graphs are also presented. These embeddings in the ICN allow low latency communication paths to be established between the computation entities of parallel applications.
Toward the Notion of a Knowledge Repository for Financial Risk Management
Authors: Michel Benaroch
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

An approach for designing a knowledge repository for risk management is presented. Since varied representations are used to capture the diverse types of knowledge involved in this domain, the atomic knowledge units stored in the repository are considered to be domain model (K) and inference method (M) pairs, (K, M) pairs, which address subtasks in the domain. Such (K, M) pairs are semantically uniform. Conceptually, this allows to view the repository as though it were a shared "database" of (K, M) pairs that has two key features. It serves stand-alone systems by enabling them to apply stored (K, M) pairs and share the generated results, where the applied pairs can be associated with any subtask that is part of entire application tasks. Additionally, it avoids capturing redundant subtask-specific Ks to the extent possible by dynamically deriving them from deep principled Ks it stores.
Coarsening a knowledge structure
Authors: Eric Cosyn
Venue: Journal of Mathematical Psychology (2002)

This paper describes an assessment procedure which does not deal explicitly with the whole knowledge structure, but rather operates on a faithful summary of the structure. The summary is achieved through the notion of coarsening of a structure, where the knowledge states are grouped into equivalence classes. We first define a stochastic assessment procedure running on the coarsening. Then we specify a set of possible properties for the equivalence relation. In particular, we define a notion of convexity for a knowledge structure. The results are justified by a simulation study.
Formal Verification of a Pipelined Microprocessor
Authors: Mandayam Srivas, Mark Bickford
Venue: IEEE Software (1990)

The application of modern functional languages and supporting verification technology to a scaled-down but realistic microprocessor is described. The model is of an infinite stream of machine instructions consuming an infinite stream of interrupt signals and is specified at two levels: instruction and hardware design. A correctness criterion is stated for an appropriate sense of equivalent behavior of these levels and proved using a mechanically supported induction argument. The functional-language-based verification system Clio and the Mini Cayuga microprocessor are described. The formal specification and verification process are examined in detail.
The AM3 Associative Processor
Authors: Bernd Klauer, Andreas Bleck, Klaus Waldschmidt
Venue: IEEE Micro (1995)

The Associative Microprogrammable Multipurpose Monoprocessor (AM3) is an associative 32-bit processor based on a modified Harvard architecture. It is provided with a standard address driven bus system to handle "von Neumann"--like data and instructions and a separate addressless associative bus-system to provide a link to associative memory components. Due to its microprogrammability it can be adapted to a variety of associative memory circuits. The following paper presents the architecture, the programming environment together with the implementations of a pattern recognition method and a method to compute the shortest path in a graph asapplication paradigms.
The Effect of Knowledge Representation Schemes on Maintainability of Knowledge-Based Systems
Authors: Sunro Lee, Robert M. O'Keefe
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

We use an experimental approach to investigate the representational effects of knowledge on maintainability, and compare this with the structural effects of rule sets investigated by Davis [5]. Results show that an object-based system, compared to a structured rule-based system, was easier to maintain in terms of the time to do the maintenance tasks, but not necessarily in terms of accuracy of the alterations. However, in some instances subsumption and redundancies were introduced into the rule-based system, which can cause problems for subsequent maintenance. Subjects perceived the structured rule-base system as more complex than the object-oriented system, and perceived the object structure as more useful than the rule modularization and documentation.
Tolerating node failures in cache only memory architectures
Authors: A. Gefflaut, C. Morin, M. Banâtre
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

COMAs (Cache Only Memory Architectures) are an interesting class of large scale shared memory multiprocessors. They extend the concepts of cache memories and shared virtual memory by using the local memories of the nodes as large caches for a single shared address space. Due to their large number of components, these architectures are particularly susceptible to hardware failures and so fault tolerance mechanisms have to be introduced to ensure a high availability. In this paper, we propose an implementation of backward error recovery in a COMA which minimizes performance degradation and requires little hardware modifications. This implementation uses the features of a COMA to implement a stable storage abstraction using the standard memories of the architecture. Recovery data are replicated and mixed with current data in node memories both of which are managed in a transparent way using an extended coherence protocol.
Volume deformation for tensor visualization
Authors: Xiaoqiang Zheng, Alex Pang
Venue: Proceedings of the conference on Visualization '02 (2002)

Visualizing second-order 3D tensor fields continue to be a challenging task. Although there are several algorithms that have been presented, no single algorithm by itself is sufficient for the analysis because of the complex nature of tensor fields. In this paper, we present two new methods, based on volume deformation, to show the effects of the tensor field upon its underlying media. We focus on providing a continuous representation of the nature of the tensor fields. Each of these visualization algorithms is good at displaying some particular properties of the tensor field.
Ensuring Latency Targets in Multiclass Web Servers
Authors: Vikram Kanodia, Edward W. Knightly
Venue: IEEE Transactions on Parallel and Distributed Systems (2003)

Two recent advances have resulted in significant improvements in web server quality-of-service. First, both centralized and distributed web servers can provide isolation among service classes by fairly distributing system resources. Second, session admission control can protect classes from performance degradation due to overload. The goal of this work is to design a general ¿front-end¿ algorithm that uses these two building blocks to support a new web service model, namely, multiclass services which control response latencies to within prespecified targets. Our key technique is to devise a general service abstraction to adaptively control not only the latency of a particular class, but also to bound the interclass relationships. In this way, we capture the extent to which classes are isolated or share system resources (as determined by the server architecture and system internals) and hence their effects on each other's QoS. For example, if the server provides class isolation (i.e., a minimum fraction of system resources independent of other classes), yet also allows a class to utilize unused resources from other classes, the algorithm infers and exploits this behavior, without an explicit low level model of the server. Thus, as new functionalities are incorporated into web servers, the approach naturally exploits their properties to efficiently satisfy the classes' performance targets. We validate the scheme with trace driven simulations.
Creating the Best First Impression
Venue: IEEE Software (1990)

No abstract available 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
Toward Object-Based Heuristics
Authors: A. D. Gross
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Recovering the 3-D shape of an object from its 2-D image contour is an important problem in computer vision. In this correspondence, the author motivates and develops two object-based heuristics. The structured nature of objects is the motivation for the nonaccidental alignment criterion: parallel coordinate axes within the object's bounding contour correspond to object-centered coordinate axes. The regularity and symmetry inherent in many man-made objects is the motivation for the orthogonal basis constraint. An oblique set of coordinate axes in the image is presumed to be the projection of an orthogonal set of 3-D coordinate axes in the scene. These object-based heuristics are used to recover shape in both real and synthetic images.
Single mode GaAs quantum cascade laser
Authors: G. Strasser, W. Schrenk, S. Anders, E. Gornik
Venue: Microelectronic Engineering (2002)

We report on the realization of distributed feedback quantum cascade lasers in the AlGaAs/GaAs material system. The active material is designed as a chirped superlattice. Strong coupling is achieved by the use of a metallized surface relief grating, allowing the realization of short lasers. Further, the emission wavelength of the distributed feedback laser is continuously tunable according to the temperature dependence of the refractive index. Pulsed single mode emission at room temperature was achieved at 12.5 µm.
Fifteen Principles of Software Engineering
Venue: IEEE Software (1994)

Because the product of software engineering is not physical, physical laws do not form a suitable foundation. Instead, software engineering has had to evolve its principles based solely on observations of thousands of projects. The following are probably the 15 most important principles: (1) make quality number one priority; (2) high-quality software is possible; (3) give products to customers early; (4) determine the problem before writing requirements; (5) evaluate design alternatives; (6) use an appropriate process model; (7) use different languages for different phases; (8) minimize intellectual distance; (9) put technique before tools; (10) get it right before you make it faster; (11) inspect code; (12) good management is more important than good technology; (13) people are the key to success; (14) follow hype with care; and (15) take responsibility. An additional 15 software engineering principles are also listed.
Reconstructing Surfaces by Volumetric Regularization Using Radial Basis Functions
Authors: Huong Quynh Dinh, Greg Turk, Greg Slabaugh
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

We present a new method of surface reconstruction that generates smooth and seamless models from sparse, noisy, nonuniform, and low resolution range data. Data acquisition techniques from computer vision, such as stereo range images and space carving, produce 3D point sets that are imprecise and nonuniform when compared to laser or optical range scanners. Traditional reconstruction algorithms designed for dense and precise data do not produce smooth reconstructions when applied to vision-based data sets. Our method constructs a 3D implicit surface, formulated as a sum of weighted radial basis functions. We achieve three primary advantages over existing algorithms: 1) the implicit functions we construct estimate the surface well in regions where there is little data, 2) the reconstructed surface is insensitive to noise in data acquisition because we can allow the surface to approximate, rather than exactly interpolate, the data, and 3) the reconstructed surface is locally detailed, yet globally smooth, because we use radial basis functions that achieve multiple orders of smoothness.
IBM's Linux Watch: The Challenge of Miniaturization
Authors: Chandra Narayanaswami, Noboru Kamijoh, Mandayam Raghunath, Tadanobu Inoue, Thomas Cipolla, Jim Sanford, Eugene Schlig, Sreekrishnan Venkiteswaran, Dinakar Guniguntala, Vishal Kulkarni, Kazuhiko Yamazaki
Venue: Computer (2002)

Nearly four years in development, the IBM Linux watch contains a complete computer system that runs Linux, displays X11 graphics, and has wireless connectivity. The system fits in a case that could pass as a slightly unusual analog timepiece with a somewhat odd shape and an extraordinarily brilliant face. The developers have created two versions of the watch, one with an organic light-emitting diode display and the other with a liquid crystal display. Still considered a research prototype, the watch already runs some personal information management applications, and it can communicate with PCs, PDAs, and other wireless-enabled devices, viewing condensed e-mail and directly receiving pager-like messages. Eventually, users will be able to access various Internet-based services, such as up-to-the-minute information about weather, traffic conditions, the stock market, and sports.
Software Defect Reduction Top 10 List
Authors: Barry Boehm, Victor R. Basili
Venue: Computer (2001)

Software's complexity and accelerated development schedules make avoiding defects difficult. These 10 techniques can help reduce the flaws in your code.
The Impact of Boundary Scan on Board Test
Authors: Kenneth P. Parker
Venue: IEEE Design Test (1989)

Three categories of approaches to board test in manufacturing today are discussed: as a sorting process; as a repair driver: and as a process monitor. The costs associated with each are briefly examined. Elements in the overall testing and manufacturing process that can sabotage the success of a board-test operation are described. They are inaccuracies, misdiagnosis, test-repair looping, and handling-induced failures. Some industry trends that can threaten a manufacturer's ability to control the board-manufacturing process, namely, ASICs, surface-mount technology/tape automated bonding, miniaturized components, and node counts, are considered. The ability of boundary scan to enhance fault diagnosis, reduce test-repair looping, and enable standardized testing and the reuse of tests is discussed. Future trends in boundary-scan testing are indicated.
Demonstration of an Interactive Multimedia Environment
Authors: Charles Rich, Richard C. Waters, Carol Strohecker, Yves Schabes, William T. Freeman, Mark C. Torrance, Andrew R. Golding, Michal Roth
Venue: Computer (1994)

The images in this article tell the story of one user's experience with a virtual reality environment that promotes collaboration and learning.
MCSE Exam Notes: Core Requirements
Venue:  (1998)

:Save $15! This box set contains the MCSE Exam Notes for the Networking Essentials, NT Workstation 4, NT Server 4, and NT Server 4 in the Enterprise exams--plus a CD containing the Network Press custom test-preparation program. Review your knowledge objective-by-objective with the Exam Notes books, then test yourself with the CD to make sure you're ready for the exams. | 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
COMPLEX: An Object-Oriented Logic Programming System
Authors: S. Greco, N. Leone, P. Rullo
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

The design and a prototypical implementation of COMPLEX, which is a logic-based system extended with concepts from the object-oriented paradigm and is intended as a tool for the development of knowledge-based applications, are described. The system supports a logic language, called Complex-Datalog (C-Datalog), enhanced by semantic constructs to provide facility for data abstraction. Its implementation is based on a bottom-up computational model that guarantees a fully declarative style of programming. However, the user is also given the possibility of running a query using a top-down model of computation. Efficiency of execution is the result of the integration of different novel technologies for the compilation and the execution of queries.
Enridged contour maps
Authors: Jarke J. van Wijk, Alexandru Telea
Venue: Proceedings of the conference on Visualization '01 (2001)

The visualization of scalar functions of two variables is a classic and ubiquitous application. We present a new method to visualize such data. The method is based on a non-linear mapping of the function to a height field, followed by visualization as a shaded mountain landscape. The method is easy to implement and efficient, and leads to intriguing and insightful images: The visualization is enriched by adding ridges. Three types of applications are discussed: visualization of iso-levels, clusters (multivariate data visualization), and dense contours (flow visualization).
Processor Integration in a Disk Controller
Authors: Lyle Adams, Michael Ou
Venue: IEEE Micro (1997)

Applications with embedded processor cores represent a rapidly growing segment in industry today. One of the processor cores which has currently achieved high visibility in many different products is the ARM7TDMI core, developed by Advanced RISC Machines Ltd (ARM). The ARM7TDMI processor has recently been targeted for use in disk drive products by Palmchip Corporation. This paper details the experience at Palmchip Corporation of embedding the ARM7TDMI processor into their GreenLite disk drive controller.
On Properties of Discretized Convex Curves
Authors: X. Wu, J. Rokne
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

The connection between a continuous convex curve and its discrete image is investigated using an appropriate definition of discrete convexity. It is shown that the discrete image of continuous convex curve may not be convex; however, its deviation from convexity (in the discrete definition) is bounded by a small constant. The actual pixel patterns that are obtained by discretizing convex curves are studied. Certain constraints on the context of discrete images of continuous convex curves were discovered.
Orthogonal factorizations of graphs
Authors: Guojun Li, Chuanping Chen, Gang Yu
Venue: Discrete Mathematics (2002)

Let G be a graph with vertex set V(G) and edge set E(G), and let g and f be two nonnegative integer-valued functions defined on V(G) such that g(x) ≤ f(x) for every vertex x of V(G). We use dG(x) to denote the degree of a vertex x of G. A graph G is called a (g,f)-graph if g(x) ≤ dG(x) ≤ f(x) for each x ∈ V(G). Then a spanning subgraph F of G is said to be a (g,f)-factor of G if F itself is a (g,f)-graph. A (g,f)-factorization of G is a partition of E(G) into edge disjoint (g,f)-factors. Let F = {F1,F2,... ,Fm} be a factorization of G and H be a subgraph of G with m edges. If Fi, 1 ≤ i ≤ m, has exactly one edge in common with H, we say that F is orthogonal to H. In this paper it is proved that every (mg + k,mf - k)-graph contains a subgraph R such that R has a (g,f)-factorization orthogonal to a given subgraph with k edges, where m and k are positive integers with 1 ≤ k > m and g(x) ≥ 0. This result has been conjectured by Yan in Yan (Sci. China Ser. A 41(1) (1998) 48).
A Parallel Algorithm for Random Walk Construction with Application to the Monte Carlo Solution of Partial Differential Equations
Authors: A. Youssef
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Random walks are widely applicable in statistical and scientific computations. Inparticular, they are used in the Monte Carlo method to solve elliptic and parabolic partialdifferential equations (PDEs). This method holds several advantages over other methodsfor PDEs as it solves problems with irregular boundaries and/or discontinuities, givessolutions at individual points, and exhibits great parallelism. However, the generation ofeach random walk in the Monte Carlo method has been done sequentially because eachpoint in the walk is derived from the preceding point by moving one grid step along arandomly selected direction. A parallel algorithm for random walk generation in regular as well as irregular regions is presented. The algorithm is based on parallel prefixcomputations. The communication structure of the algorithm is shown to ideally fit on ahypercube of n nodes, where n is the number of processors.