ppxscal/embedding_network huggingface dataset:
Exposing the Mythical MIPS Year
Authors: Robert D. Silverman
Venue: Computer (1999)

MIPS (million instructions per second) has been the most popular measure for computer speed since its inception, and people use it as the primary basis for comparing the speed of different computers. However, the author contends that using the MIPS year as a measurement of the amount of effort needed to break and compare cryptographic keys has led to some very inaccurate estimates. The MIPS year measurement has four basic problems Not all instructions are equal, so how do you really know the MIPS rating of a machine? Not all programs use the same instructions, so different programs can give different measures of speed even for the same machine. The way you measure the MIPS years expended on a single problem by many machines can introduce two possible errors: an inaccurate estimate of machine speed and an inaccurate measurement of time. If you consider only the number of instructions executed, you cannot accurately measure the difficulty of hard problems.
Software Processes: Live and Let Die
Authors: Allan Baktoft Jakobsen
Venue: IEEE Software (2000)

The software business is tough: it requires not only the right product but also the right development process. This article is about the reengineering of a catastrophic software product and the two different reengineering processes the developers used. The author, explaining why one process failed and the other succeeded, asserts that people and processes must match in software development.
An Advanced Database Accelerator
Authors: Bjorn Bergsten, Ruben Gonzalez-Rubio, Brigitte Kerherve, Jean Rohmer
Venue: IEEE Micro (1988)

The authors report on a research project launched to develop a complete database management system (DBMS) to support emerging applications. They developed a hardware architecture consisting of a general-purpose host computer and the Delta Driven Computer (DDC), a parallel system that plays the role of a relational database accelerator. They also used compilation and I/O reduction to improve the efficiency of the DBMS and proposed a production-rule language that could be compiled into programs with explicit parallelism. The authors present their research objectives, give a general overview of the DDC, and discuss the elements of a complete DBMS.
Integrated 3-D Analysis and Analysis-Guided Synthesis of Flight Image Sequences
Authors: S. Sull, N. Ahuja
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This paper is concerned with three-dimensional (3D) analysis, and analysis-guided syntheses, of images showing 3-D motion of an observer relative to a scene. There are two objectives of the paper. First, it presents an approach to recovering 3D motion and structure parameters from multiple cues present in a monocular image sequence, such as point features, optical flow, regions, lines, texture gradient, and vanishing line. Second, it introduces the notion that the cues that contribute the most to 3-D interpretation are also the ones that would yield the most realistic synthesis, thus suggesting an approach to analysis guided 3-D representation. For concreteness, the paper focuses on flight image sequences of a planar, textured surface. The integration of information in these diverse cues is carried out using optimization. For reliable estimation, a sequential batch method is used to compute motion and structure. Synthesis is done by using (i) image attributes extracted from the image sequence, and (ii) simple, artificial image attributes which are not present in the original images. For display, real and/or artificial attributes are shown as a monocular or a binocular sequence. Performance evaluation is done through experiments with one synthetic sequence, and two real image sequences digitized from a commercially available video tape and a laserdisc. The attribute based representation of these sequences compressed their sizes by 502 and 367. The visualization sequence appears very similar to the original sequence in informal, monocular as well as stereo viewing on a workstation monitor.
Parsec: A Parallel Simulation Environment for Complex Systems
Authors: Rajive Bagrodia, Richard Meyer, Mineo Takai, Yu-an Chen, Xiang Zeng, Jay Martin, Ha Yoon Song
Venue: Computer (1998)

Design and development costs for extremely large systems could be significantly reduced if only there were efficient techniques for evaluating design alternatives and predicting their impact on overall system performance metrics. Due to the systems' analytical intractability, simulation is the most common performance evaluation technique for such systems. However, the long execution times needed for sequential simulation models often hampers evaluation. The slow speeds of sequential model execution have led to growing interest in the use of parallel execution for simulating large-scale systems. Widespread use of parallel simulation, however, has been significantly hindered by a lack of tools for integrating parallel model execution into the overall framework of system simulation. Another drawback to wide-spread use of simulations is the cost of model design and maintenance. The simulation environment the authors developed at UCLA attempts to address some of these issues. It consists of three primary components: a parallel simulation language called Parsec (parallel simulation environment for complex systems), its GUI, called Pave, and the portable runtime system that implements the simulation algorithms.
PANGAEA: an information system for environmental sciences
Authors: Michael Diepenbroek, Hannes Grobe, Manfred Reinke, Uwe Schindler, Reiner Schlitzer, Rainer Sieger, Gerold Wefer
Venue: Computers Geosciences (2002)

PANGAEA is an information system for processing, long-term storage, and publication of georeferenced data related to earth science fields. Essential services supplied by PANGAEA are project data management and the distribution of visualization and analysis software. Organization of data management includes quality control and publication of data and the dissemination of metadata according to international standards. Data managers are responsible for acquisition and maintenance of data. The data model used reflect the information processing steps in the earth science fields and can handle any related analytical data. The basic technical structure corresponds to a three tiered client/server architecture with a number of comprehensive clients and middleware components controlling the information flow and quality. On the server side a relational database management system (RDBMS) is used for information storage. The web-based clients include a simple search engine (PangaVista) and a data mining tool (ART). The client used for maintenance of information contents is optimized for data management purposes. Analysis and visualization of metainformation and analytical data is supported by a number of software tools, which can either be used as 'plug-ins' of the PANGAEA clients or as standalone applications, distributed as freeware from the PANGAEA website. Established and well-documented software tools are the mini-GIS PanMap, the plotting tool PanPlot, and Ocean Data View (ODV) for the exploration of oceanographic data. PANGAEA operates on a long-term basis. The available resources are sufficient not only for the acquisition of new data and the maintenance of the system but also for further technical and organizational developments.
Sequential Circuit Test Generation Using a Symbolic/Genetic Hybrid Approach
Authors: Franco Fummi, Marco Boschini, Xiaoming Yu, Elizabeth M. Rudnick
Venue: Journal of Electronic Testing: Theory and Applications (2001)

Symbolic and genetic techniques are combined in a new approach to sequential circuit test generation that uses circuit decomposition, rather than the algorithmic decomposition used in previous hybrid test generators. Symbolic techniques are used to generate test sequences for the control logic, and genetic algorithms are used to generate sequences for the datapath. The combined sequences provide higher fault coverages than those generated by existing deterministic and GA-based test generators, and execution times are significantly lower in many cases.
Embedded Computer Architecture and Automation
Authors: B. Ramakrishna Rau, Michael S. Schlansker
Venue: Computer (2001)

Exploring the emergence of embedded computing, the authors predict that the computer industry will develop significantly different computer architectures at the system and processor levels as well as a wide range of off-the- shelf (OTS) and custom designs. Automation of computer architecture will revolutionize performance and functionality. The authors probe three features of embedded computer architecture. They show that specialization increases performance and reduces manufacturing costs, that customization permits specialization when no specialized OTS product is available, and that automation reduces design costs. The costs of implementing system-on-chip designs, along with the need for more customization, will lead to the automation of computer architecture, whose practicality and effectiveness the authors demonstrate using their program- in, chip-out architecture synthesis system. The authors affirm that the distinct product, market, and application requirements of embedded computing will lead to special-purpose, heterogeneous, and irregular system and processor architecture.
Multiresolution Gray-Scale and Rotation Invariant Texture Classification with Local Binary Patterns
Authors: Timo Ojala, Matti Pietikäinen, Topi Mäenpää
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

This paper presents a theoretically very simple, yet efficient, multiresolution approach to gray-scale and rotation invariant texture classification based on local binary patterns and nonparametric discrimination of sample and prototype distributions. The method is based on recognizing that certain local binary patterns, termed "uniform" are fundamental properties of local image texture and their occurrence histogram is proven to be a very powerful texture feature. We derive a generalized gray-scale and rotation invariant operator presentation that allows for detecting the "uniform" patterns for any quantization of the angular space and for any spatial resolution and presents a method for combining multiple operators for multiresolution analysis. The proposed approach is very robust in terms of gray-scale variations since the operator is, by definition, invariant against any monotonic transformation of the gray scale. Another advantage is computational simplicity as the operator can be realized with a few operations in a small neighborhood and a lookup table. Excellent experimental results obtained in true problems of rotation invariance, where the classifier is trained at one particular rotation angle and tested with samples from other rotation angles, demonstrate that good discrimination can be achieved with the occurrence statistics of simple rotation invariant local binary patterns. These operators characterize the spatial configuration of local image texture and the performance can be further improved by combining them with rotation invariant variance measures that characterize the contrast of local image texture. The joint distributions of these orthogonal measures are shown to be very powerful tools for rotation invariant texture analysis.
Scalable Algorithms for Association Mining
Authors: Mohammed J. Zaki
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

Association rule discovery has emerged as an important problem in knowledge discovery and data mining. The association mining task consists of identifying the frequent itemsets and then, forming conditional implication rules among them. In this paper, we present efficient algorithms for the discovery of frequent itemsets which forms the compute intensive phase of the task. The algorithms utilize the structural properties of frequent itemsets to facilitate fast discovery. The items are organized into a subset lattice search space, which is decomposed into small independent chunks or sublattices, which can be solved in memory. Efficient lattice traversal techniques are presented which quickly identify all the long frequent itemsets and their subsets if required. We also present the effect of using different database layout schemes combined with the proposed decomposition and traversal techniques. We experimentally compare the new algorithms against the previous approaches, obtaining improvements of more than an order of magnitude for our test databases.
Learning Texture Discrimination Rules in a Multiresolution System
Authors: H. Greenspan, R. Goodman, R. Chellappa, C. H. Anderson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

We describe a texture analysis system in which informative discrimination rules are learned from a multiresolution representation of time textured input. The system incorporates unsupervised and supervised learning via statistical machine learning and rule-based neural networks, respectively. The textured input is represented in the frequency-orientation space via a log-Gabor pyramidal decomposition. In the unsupervised learning stage a statistical clustering scheme is used for the quantization of the feature-vector attributes. A supervised stage follows in which labeling of the textured map is achieved using a rule-based network. Simulation results for the texture classification task are given. An application of the system to real-world problems is demonstrated.
A note on the ultimate categorical matching in a graph
Authors: Lih-Hsing Hsu
Venue: Discrete Mathematics (2002)

Let m(G) denote the number of vertices covered by a maximum matching in a graph G. The ultimate categorical matching m*(G) is defined as m*(G) = limn → ∞m(Gn)1/n where the categorical graph product is used. In (Discrete Math. 232 (2001) 1), Albert et al. ask that "Is there a graph G, with at least one edge, such that for all graphs H, m*(G×H) = m*(G)m*(H)?". Actually, m*(G × H)=m*(G)m*(H) holds for any graphs G and H with the previous result of Hsu et al. (Discrete Math, 65 (1987) 53).
A semantical perspective on verification of knowledge
Authors: Paul Leemans, Jan Treur, Mark Willems
Venue: Data Knowledge Engineering (2002)

The usual approaches to verification of knowledge in the literature have a rather practical nature, and are sometimes ad hoc and depending on the syntactical structure of a particular knowledge representation language in the definitions of the properties that are tested. In this paper, a more principled investigation provides a well-defined semantical basis, independent of any particular syntactical representation, of the various properties that can be tested, and their logical relationships. Central in this unifying semantical framework is the notion of domain description and the forcing relation that is used as a standard for the inferences. Properties covered include consistency, three variants of soundness, three variants of completeness, empirically foundedness, and well-informedness.
Building More Usable APIs
Authors: Samuel G. McLellan, Alvin W. Roesler, Joseph T. Tempest, Clay I. Spinuzzi
Venue: IEEE Software (1998)

When the authors asked users to test an API early in the development life cycle, the users' questions about how the API works and in what contexts turned out to be extremely helpful. Iterative API design and testing, along with feedback from real users, contribute to cleaner design and a more helpful reference manual.
Assessing and satisfying user needs: WSU model
Authors: Jonelle C. Moore
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

This paper will explain Wayne State's consulting services vis a vis user needs. Computing centers are having to play many roles as it becomes evident that more than systems programmers are necessary to give diverse services to a larger population. Technical writers who can write clearly, consultants who can deal with all types of users, documentation which is accessible and up-to-date--all these and more are crucial if we are going to try and meet user needs. 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
An Analysis of Edge Fault Tolerance in Recursively Decomposable Regular Networks
Authors: A. Lagman, W. A. Najjar, P. K. Srimani
Venue: IEEE Transactions on Computers (1994)

Fault tolerance of interconnection networks is one of the major considerations in evaluating the reliability of large scale multiprocessor systems. In the paper, the reliability of a family of regular networks with respect to edge failures is investigated using four different fault tolerance measures. Two probabilistic measures, resilience and restricted resilience, are developed, used to evaluate disconnection likelihoods using two different failure models, and compared with corresponding deterministic measures. The network topologies chosen for the present study all have the recursive decomposition property, where larger networks can be decomposed into copies of smaller networks of the same topology. This family of graphs includes the k-ary n-cube, star and cube connected cycle graphs, which have optimal deterministic connectivities. The probabilistic fault tolerance measures, however, are found to depend on topological properties such as network size and degree.
M2Tracker: A Multi-View Approach to Segmenting and Tracking People in a Cluttered Scene
Authors: Anurag Mittal, Larry S. Davis
Venue: International Journal of Computer Vision (2003)

When occlusion is minimal, a single camera is generally sufficient to detect and track objects. However, when the density of objects is high, the resulting occlusion and lack of visibility suggests the use of multiple cameras and collaboration between them so that an object is detected using information available from all the cameras in the scene.In this paper, we present a system that is capable of segmenting, detecting and tracking multiple people in a cluttered scene using multiple synchronized surveillance cameras located far from each other. The system is fully automatic, and takes decisions about object detection and tracking using evidence collected from many pairs of cameras. Innovations that help us tackle the problem include a region-based stereo algorithm capable of finding 3D points inside an object knowing only the projections of the object (as a whole) in two views, a segmentation algorithm using bayesian classification and the use of occlusion analysis to combine evidence from different camera pairs.The system has been tested using different densities of people in the scene. This helps us determine the number of cameras required for a particular density of people. Experiments have also been conducted to verify and quantify the efficacy of the occlusion analysis scheme.
A New Approach for the Verification of Cache Coherence Protocols
Authors: Fong Pong, Michel Dubois
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

In this paper, we introduce a cache protocol verification technique based on a symbolic state expansion procedure. A global Finite State Machine (FSM) model characterizing the protocol behavior is built and protocol verification becomes equivalent to finding whether or not the global FSM may enter erroneous states. In order to reduce the complexity of the state expansion process, all the caches in the same state are grouped into an equivalence class and the number of caches in the class is symbolically represented by a repetition constructor. This symbolic representation is partly justified by the symmetry and homogeneity of cache-based systems. However, the key idea behind the representation is to exploit a unique property of cache coherence protocols: the fact that protocol correctness is not dependent on the exact number of cached copies. Rather, symbolic states only need to keep track of whether the caches have 0, 1, or multiple copies. The resulting symbolic state expansion process only takes a few steps and verifies the protocol for any system size. Therefore, it is more efficient and reliable than current approaches.The verification procedure is first applied to the verification of five existing protocols under the assumption of atomic protocol transitions. A simple snooping protocol on a split-transaction shared bus is also verified to illustrate the extension of our approach to protocols with nonatomic transitions.
Shape Matching and Object Recognition Using Shape Contexts
Authors: S. Belongie, J. Malik, J. Puzicha
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by 1) solving for correspondences between points on the two shapes, 2) using the correspondences to estimate an aligning transform. In order to solve the correspondence problem, we attach a descriptor, the shape context, to each point. The shape context at a reference point captures the distribution of the remaining points relative to it, thus offering a globally discriminative characterization. Corresponding points on two similar shapes will have similar shape contexts, enabling us to solve for correspondences as an optimal assignment problem. Given the point correspondences, we estimate the transformation that best aligns the two shapes; regularized thin-plate splines provide a flexible class of transformation maps for this purpose. The dissimilarity between the two shapes is computed as a sum of matching errors between corresponding points, together with a term measuring the magnitude of the aligning transform. We treat recognition in a nearest-neighbor classification framework as the problem of finding the stored prototype shape that is maximally similar to that in the image. Results are presented for silhouettes, trademarks, handwritten digits, and the COIL data set.
Computing the Generalized Aspect Graph for Objects with Moving Parts
Authors: K. Bowyer, M. Sallam, D. Eggert, J. Stewman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Algorithms for computing the aspect graph representation are generalized to include a larger, more realistic domain of objects known as articulated assemblies those objects composed of rigid parts with articulated connections allowed between parts. The generalization suggests two slightly different representations: one that directly summarizes the possible general views of the object and another (hierarchical) form summarizing the possible general configurations and their respective views. Algorithms are outlined for computing both representations. The generalized aspect graphs of assemblies formed using translational connections are examined.
Stability of Gauss&ndash;Radau Pseudospectral Approximations of the One-Dimensional Wave Equation
Authors: Z. Jackiewicz, B. D. Welfert
Venue: Journal of Scientific Computing (2003)

We first extend the stability analysis of pseudospectral approximations of the one-dimensional one-way wave equation \frac{\partial u}{\partial x}=c(x) \frac {\partial u}{\partial x} given in (11) to general Gauss&ndash;Radau collocation methods. We give asufficient condition on the collocation points for stability whichshows that classical Gauss&ndash;Radau ultraspherical methods are perfectly stable while their Gauss&ndash;Lobatto counterpart is not. When the stability condition is not met we introduce a simple modification of the approximation which leads to better stability properties. Numerical examples show that long term stability may substantially improve.