ppxscal/embedding_network huggingface dataset:
Optimal Design of Checks for Error Detection and Location in Fault-Tolerant Multiprocessor Systems
Authors: R. K. Sitaraman, N. K. Jha
Venue: IEEE Transactions on Computers (1993)

RANDGEN, a simple and efficient general-purpose algorithm for generating arbitrary data-check (DC) graphs with a small number of checks, which satisfy a variety of properties that have been found to be useful in algorithm-based fault tolerance (ABFT) designs, is proposed. The concept of majority diagnosability is introduced in an attempt to explicitly redesign DC graphs for easy diagnosis. UNIFGEN, a variation of RANDGEN that produces DC graphs with uniform checks is examined.
An emotional interface for a music gathering application
Authors: Albert van Breemen, Christoph Bartneck
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

Listening to music while travelling is a pleasant activity. The latest MP3 players demonstrate that storage and management of music will not be a problem in the near future. Besides listening to music the user might also want to gather new music from the Internet. We propose a music gathering application that helps the user to collect music and that is able to proactively search and download music based on the users music preferences. Furthermore, we developed an emotional interface character that provides instant and natural feedback on the status of the application
Some Properties for the Euclidean Distance Matrix and Positive Semidefinite Matrix Completion Problems
Authors: Hong-Xuan Huang, Zhi-An Liang, Panos M. Pardalos
Venue: Journal of Global Optimization (2003)

The Euclidean distance matrix (EDM) completion problem and the positive semidefinite (PSD) matrix completion problem are considered in this paper. Approaches to determine the location of a point in a linear manifold are studied, which are based on a referential coordinate set and a distance vector whose components indicate the distances from the point to other points in the set. For a given referential coordinate set and a corresponding distance vector, sufficient and necessary conditions are presented for the existence of such a point that the distance vector can be realized. The location of the point (if it exists) given by the approaches in a linear manifold is independent of the coordinate system, and is only related to the referential coordinate set and the corresponding distance vector. An interesting phenomenon about the complexity of the EDM completion problem is described. Some properties about the uniqueness and the rigidity of the conformation for solutions to the EDM and PSD completion problems are presented.
A new video compression algorithm for different videoconferencing standards
Authors: Awad Kh. Al-Asmari
Venue: International Journal of Network Management (2003)

In this paper, a new and simple predictive coding algorithm for video compression and multimedia communication for different network applications is investigated. This algorithm is called semi-hexagonal absolute moment block truncation coding (SH-AMBTC). It enjoys better objective and subjective qualities over the standard square shaped AMBTC. This technique based on the prediction of the bit-map of the middle frames in a sequence from the bit-map of the end frames (the first and the last frames in the group). It is of very low complexity comparing to the standard algorithm MPEG. The new algorithm adds no complexity to the existing AMBTC algorithm.
FORTRAN programs for space-time modeling
Authors: L. De Cesare, D. E. Myers, D. Posa
Venue: Computers Geosciences (2002)

Modified GSLIB FORTRAN 77 routines are given in this paper for estimating and modeling space-time variograms. Two general families of models are incorporated in the programs: these are the product model and the product-sum model, both based on the decomposition of the space-time covariance in terms of a space covariance and a time covariance. The GSLIB kriging program has also been modified to incorporate these space-time models. One of the programs detects and removes temporal periodicities in the data. The program removes them and generates residuals for all monitoring stations, in order to estimate and model the spatial-temporal variogram using residuals. The modified kriging program also allows the use of cross-validation in conjunction with fitting of space-time variogram models. The trend component and the residual variogram model can be used for prediction. To illustrate the use of the programs, hourly averages of NO2 for the first ten months of 1998 in Lombardy were used.
Point/Counterpoint
Authors: Allen Tucker, Barry Boehm
Venue: IEEE Software (2002)

Point:On the Balance between Theory and PracticeCounterpoint:Software Engineering Is a Value-Based Contact Sport
Adaptive Discontinuous Galerkin Finite Element Methods for Nonlinear Hyperbolic Conservation Laws
Authors: Ralf Hartmann, Paul Houston
Venue: SIAM Journal on Scientific Computing (2002)

We consider the a posteriori error analysis and adaptive mesh design for discontinuous Galerkin finite element approximations to systems of nonlinear hyperbolic conservation laws. In particular, we discuss the question of error estimation for general target functionals of the solution; typical examples include the outflow flux, local average and pointwise value, as well as the lift and drag coefficients of a body immersed in an inviscid fluid. By employing a duality argument, we derive so-called weighted or Type I a posteriori error bounds; these error estimates include the product of the finite element residuals with local weighting terms involving the solution of a certain dual or adjoint problem that must be numerically approximated. Based on the resulting approximate Type I bound, we design and implement an adaptive algorithm that produces meshes specifically tailored to the efficient computation of the given target functional of practical interest. The performance of the proposed adaptive strategy and the quality of the approximate Type I a posteriori error bound is illustrated by a series of numerical experiments. In particular, we demonstrate the superiority of this approach over standard mesh refinement algorithms which employ Type II error indicators.
Theory and Applications of Biotelemetry
Authors: Nihal Fatma Güler, Elif Derya Übeyli
Venue: Journal of Medical Systems (2002)

In this study, biotelemetry and its evolution is explained in detail. Bioelectric and physiological variables could be measured by biotelemetry systems. The development of a biotelemetry system and its principal operation are presented. The components of a biotelemetry system are explained. Biomedical data has been telemetered through every medium between two sites by using a variety of modulated energy forms. Designing of the link between transmitter and receiver is described. Important factors in designing a backpack or implanted telemeter are explained. The main features of implanted biotelemetry units are determined. Single-channel and multichannel biotelemetry systems are defined. The types of telemetry, and a comparison thereof, are given. The power sources of biotelemetry systems and features of different power sources are explained. A survey of biotelemetry applications on humans and animals is presented and advantages of using biotelemetry systems are determined.
Why Software Managers Should Play Games
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
Putting Risk Management into Practice
Authors: Ray C. Williams, Julie A. Walker, Audrey J. Dorofee
Venue: IEEE Software (1997)

The authors use an SEI-designed road map as a guide to discussing effective and ineffective risk management methods based on six years' experience with software-intensive DoD programs. These programs followed the SEI approach of continuous and team risk management, selecting processes and methods that would best fit their work cultures.
GeoVISTA studio: a codeless visual programming environment for geoscientific data analysis and visualization
Authors: Masahiro Takatsuka, Mark Gahegan
Venue: Computers Geosciences (2002)

The fundamental goal of the GeoVISTA Studio project is to improve geoscientific analysis by providing an environment that operationally integrates a wide range of analysis activities, including those both computationally and visually based. Improving the infrastructure used in analysis has far-reaching potential to better integrate human-based and computationally based expertise, and so ultimately improve scientific outcomes. To address these challenges, some difficult system design and software engineering problems must be overcome.This paper illustrates the design of a component-oriented system, GeoVISTA Studio, as a means to overcome such difficulties by using state-of-the-art component-based software engineering techniques. Advantages described include: ease of program construction (visual programming), an open (non-proprietary) architecture, simple component-based integration and advanced deployment methods. This versatility has the potential to change the nature of systems development for the geosciences, providing better mechanisms to coordinate complex functionality, and as a consequence, to improve analysis by closer integration of software tools and better engagement of the human expert. Two example applications are presented to illustrate the potential of the Studio environment for exploring and better understanding large, complex geographical datasets and for supporting complex visual and computational analysis.
Suboptimal Minimum Cluster Volume Cover-Based Method for Measuring Fractal Dimension
Authors: Charles R. Tolle, Timothy R. McJunkin, David J. Gorisch
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

A new method for calculating fractal dimension is developed in this paper. The method is based on the box dimension concept; however, it involves direct estimation of a suboptimal covering of the data set of interest. By finding a suboptimal cover, this method is better able to estimate the required number of covering elements for a given cover size than is the standard box counting algorithm. Moreover, any decrease in the error of the covering element count directly increases the accuracy of the fractal dimension estimation. In general, our method represents a mathematical dual to the standard box counting algorithm by not solving for the number of boxes used to cover a data set given the size of the box. Instead, the method chooses the number of covering elements and then proceeds to find the placement of smallest hyperellipsoids that fully covers the data set. This method involves a variant of the Fuzzy-C Means clustering algorithm, as well as the use of the Minimum Cluster Volume clustering algorithm. A variety of fractal dimension estimators using this suboptimal covering method are discussed. Finally, these methods are compared to the standard box counting algorithm and wavelet-decomposition methods for calculating fractal dimension by using one-dimensional cantor dust sets and a set of standard Brownian random fractal images.
A Prototype Filter Design Approach to Pyramid Generation
Authors: M. G. Kim, I. Dinstein, L. Shaw
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

This paper presents a technique for image pyramid generation, in which the reduction (expansion) factor between layers is any rational number M/L. The image pyramid generation is modeled as an interpolation and filtering followed by a decimation. The model enables frequency domain analysis of the image pyramid, as well as convenient design of the generating kernels. L(M) generating kernels are necessary to produce an image pyramid with reduction (expansion) factor M/L(L/M). A polyphase filter network scheme is used where the L(M) generating kernels can be produced by sampling one prototype low-pass filter with cutoff frequency at omega = pi /max(M,L). Using these polyphase filters, the frequency content of pyramid image decompositions can be adjusted with great flexibility. A systematic procedure is presented here for specifying the relative positions of spatial samples in successive pyramid levels-a complication that arises when generalizing from integer reduction factors to rational factors. Two types of low-pass filters are employed in this work for the prototype filter design: a binomial filter and an FIR linear phase filter. Illustrative examples are presented.
Data Management and Control-Flow Aspects of an SIMD/SPMD Parallel Language/Compiler
Authors: M. A. Nichols, H. J. Siegel, H. G. Dietz
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Features of an explicitly parallel programming language targeted for reconfigurable parallel processing systems, where the machine's N processing elements (PEs) are capable of operating in both the SIMD and SPMD modes of parallelism, are described. The SPMD (single program-multiple data) mode of parallelism is a subset of the MIMD mode where all processors execute the same program. By providing all aspects of the language with an SIMD mode version and an SPMD mode version that are syntactically and semantically equivalent, the language facilitates experimentation with and exploitation of hybrid SIMD/SPMD machines. Language constructs (and their implementations) for data management, data-dependent control-flow, and PE-address-dependent control-flow are presented. These constructs are based on experience gained from programming a parallel machine prototype and are being incorporated into a compiler under development. Much of the research presented is applicable to general SIMD machines and MIMD machines.
A comparison of different decision algorithms used in volumetric storm cells classification
Authors: Z. Suraj, J. F. Peters, W. Rzasa
Venue: Fundamenta Informaticae (2002)

Decision algorithms useful in classifying meteorological volumetric radar data are the subject of described in the paper experiments. Such data come from the Radar Decision Support System (RDSS) database of Environment Canada and concern summer storms created in this country. Some research groups used the data completed by RDSS for verifying the utility of chosen methods in volumetric storm cells classification. The paper consists of a review of experiments that were made on the data from RDSS database of Environment Canada and presents the quality of particular classifiers. The classification accuracy coefficient is used to express the quality. For five research groups that led their experiments in a similar way it was possible to compare receiced outputs. Experiments showed that the support Vector Machine (SVM) method and rough set algorithms which use objects oriented reducts ro rule for rule generation to classify volumetric strom data perform better than other classifiers.
Properties of Codes from Difference Sets in 2-Groups
Authors: Deirdre Longacher Smeltzer
Venue: Designs, Codes and Cryptography (1999)

A ( v, k, \lambda)-difference set D in a group G can be used to create a symmetric 2-( v, k, \lambda) design, \cal D, from which arises a code C, generated by vectors corresponding to the characteristic function of blocks of \cal D. This paper examines properties of the code C, and of a subcode, C^o=JC, where J is the radical of the group algebra of G over {\Bbb Z}_2. When G is a 2-group, it is shown that C^o is equivalent to the first-order Reed-Muller code, {\cal R}(1, 2s+2), precisely when the 2-divisor of C^o is maximal. In addition, ifD is a non-trivial difference set in an elementary abelian 2-group, and if D is generated by a quadratic bent function, then C^o is equal to a power of the radical. Finally, an example is given of a difference set whose characteristic function is not quadratic, although the 2-divisor of C^o is maximal.
Simultaneous Multithreading: A Platform for Next-Generation Processors
Authors: Susan J. Eggers, Joel S. Emer, Henry M. Levy, Jack L. Lo, Rebecca L. Stamm, Dean M. Tullsen
Venue: IEEE Micro (1997)

As the processor community prepares for a billion transistors on a chip, researchers continue to debate the most effective way to use them. One approach is to add more memory (either cache or primary memory) to the chip, but the performance gain from memory alone is limited. Another approach is to increase the level of systems integration, bringing support functions like graphics accelerators and I/O controllers on chip. Although integration lowers system costs and communication latency, the overall performance gain to applications is again marginal. We believe the only way to significantly improve performance is to enhance the processor's computational capabilities. In general, this means increasing parallelism-in all its available forms. At present only certain forms of parallelism are being exploited. Current superscalars, for example, can execute four or more instructions per cycle; in practice, however, they achieve only one or two, because current applications have low instruction-level parallelism. Placing multiple superscalar processors on a chip is also not an effective solution, because, in addition to the low instruction-level parallelism, performance suffers when there is little thread-level parallelism. A better solution is to design a processor that can exploit all types of parallelism well. Simultaneous multithreading is a processor design that meets this goal, because it consumes both thread-level and instruction-level parallelism. In SMT processors, thread-level parallelism can come from either multithreaded, parallel programs or individual, independent programs in a multiprogramming workload. Instruction-level parallelism comes from each single program or thread. Because it successfully (and simultaneously) exploits both types of parallelism, SMT processors use resources more efficiently, and both instruction throughput and speedups are greater.
High Availability and Reliability in the Itanium Processor
Authors: Nhon Quach
Venue: IEEE Micro (2000)

The Itanium Processor is the first implementation of the Intel IA-64 architecture. Designed for the high-end server market segment, the processor is equipped with many advanced RAS (reliability, availability, and serviceability) features to maximize system reliability and availability.
Theory and Application of Nongroup Cellular Automata for Synthesis of Easily Testable Finite State Machines
Authors: Supratik Chakraborty, Dipanwita Roy Chowdhury, Parimal Pal Chaudhuri
Venue: IEEE Transactions on Computers (1996)

This paper reports some of the interesting properties and relationships of a nongroup Cellular Automata (CA) and its dual. A special class of nongroup Cellular Automata denoted as D1*CA is analytically investigated. Based on such analysis, D1*CA has been proposed as an ideal test machine which can be efficiently embedded in a finite state machine to enhance the testability of the synthesized design. A state encoding algorithm has been formulated to embed the D1*CA based test machine in the synthesized FSM while minimizing the hardware overhead. The unique state transition properties of D1*CA are then used in designing an easy testing scheme for the FSM. Experiments on FSM benchmarks have shown that the scheme achieves 100% coverage of all single stuck-at faults at the cost of hardware overhead and circuit delay that are comparable, if not better, to that incurred for scan path based designs. However, the major advantage of the scheme is the significant reduction of test time overhead due to integration of an embedded test machine in the design at the synthesis phase.
A One-Phase Algorithm to Detect Distributed Deadlocks in Replicated Databases
Authors: Ajay D. Kshemkalyani, Mukesh Singhal
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Replicated databases that use quorum-consensus algorithms to perform majority voting are prone to deadlocks. Due to the P-out-of-Q nature of quorum requests, deadlocks that arise are generalized deadlocks and are hard to detect. We present an efficient distributed algorithm to detect generalized deadlocks in replicated databases. The algorithm performs reduction of a distributed wait-for-graph (WFG) to determine the existence of a deadlock. If sufficient information to decide the reducibility of a node is not available at that node, the algorithm attempts reduction later in a lazy manner. We prove the correctness of the algorithm. The algorithm has a message complexity of $2e$ messages and a worst-case time complexity of $2d+2$ hops, where $e$ is the number of edges and $d$ is the diameter of the WFG. The algorithm is shown to perform significantly better in both time and message complexity than the best known existing algorithms. We conjecture that this is an optimal algorithm, in time and message complexity, to detect generalized deadlocks if no transaction has complete knowledge of the topology of the WFG or the system and the deadlock detection is to be carried out in a distributed manner.
Probabilistic Indexing for Object Recognition
Authors: Clark F. Olson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Recent papers have indicated that indexing is a promising approach to fast model-based object recognition because it allows most of the possible matches between sets of image features and sets of model features to be quickly eliminated from consideration. This correspondence describes a system that is capable of indexing using sets of three points undergoing three-dimensional transformations and projection by taking advantage of the probabilistic peaking effect. To be able to index using sets of three points, we must allow false negatives. These are overcome by ensuring that we examine several correct hypotheses. The use of these techniques to speed up the alignment method is described. Results are given on real and synthetic data.
Acquiring Customers' Requirementsin Electronic Commerce
Authors: Ralph Bergmann, Pádraig Cunningham
Venue: Artificial Intelligence Review (2002)

A key role for Artificial Intelligence technology in electronic commerce is in finding products and services that meet a user's requirements. This may be implemented as a three-stage process of requirements elicitation, product search, and finally product presentation. Alternatively the search of the product space may happen in tandem with the requirements elicitation process. It is also possible to use product presentation as a mechanism to focus and give context to requirements elicitation. A variety of different approaches to this issue of matching products to requirements have been explored in AI research. Thus, while the focus in this paper is on different approaches to requirements elicitation, these related issues of product search and product presentation are also discussed in detail. The paper concludes by placing the other papers in this special issue in the context of this structured overview.