ppxscal/embedding_network huggingface dataset:
FPGA Adders: Performance Evaluation and Optimal Design
Authors: Shanzhen Xing, William W. h. Yu
Venue: IEEE Design Test (1998)

The delay models and costs analysis developed for ASIC technology are not useful for the design and implementation of fixed-point adders on FPGA devices. This paper discusses the implementation of fixed-point adders on the Xilinx 4k series devices and studies their related costs and operational delays. This work also proposes the timing models for the optimization analyses of the carry-skip and the carry-select adders and their optimization schemes. The comparison of the performances and costs of different fixed-point FPGA adders will be a useful source of information for the FPGA-based computing systems designers. The study should contribute to effective and cost-efficient designs of computational units on FPGA devices.
3-D Motion Estimation in Model-Based Facial Image Coding
Authors: H. Li, P. Roivainen, R. Forcheimer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

An approach to estimating the motion of the head and facial expressions in model-based facial image coding is presented. An affine nonrigid motion model is set up. The specific knowledge about facial shape and facial expression is formulated in this model in the form of parameters. A direct method of estimating the two-view motion parameters that is based on the affine method is discussed. Based on the reasonable assumption that the 3-D motion of the face is almost smooth in the time domain, several approaches to predicting the motion of the next frame are proposed. Using a 3-D model, the approach is characterized by a feedback loop connecting computer vision and computer graphics. Embedding the synthesis techniques into the analysis phase greatly improves the performance of motion estimation. Simulations with long image sequences of real-world scenes indicate that the method not only greatly reduces computational complexity but also substantially improves estimation accuracy.
Optimal Broadcasting on the Star Graph
Authors: V. E. Mendia, D. Sarkar
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

The star graph has been show to be an attractive alternative to the widely used n-cube. Like the n-cube, the star graph possesses rich structure and symmetry as well as fault tolerant capabilities, but has a smaller diameter and degree. However, very few algorithms exists to show its potential as a multiprocessor interconnection network. Many fast and efficient parallel algorithms require broadcasting as a basic step. An optimal algorithm for one-to-all broadcasting in the star graph is proposed. The algorithm can broadcast a message to N processors in O(log/sub 2/ N) time. The algorithm exploits the rich structure of the star graph and works by recursively partitioning the original star graph into smaller star graphs. In addition, an optimal all-to-all broadcasting algorithm is developed.
Managing Music in Orchestras
Authors: Pierfrancesco Bellini, Fabrizio Fioravanti, Paolo Nesi
Venue: Computer (1999)

The typical orchestra manages a huge amount of information. A symphonic work's main score often runs to more than 100 pages, while an operatic score can run 600 or more. From the main score, the conductor draws some 15 to 30 different instrumental parts and distributes them to 40 or more lecterns so that 70 musicians can play from them during rehearsals and performances. This overhead increases significantly if the piece requires a chorus as well. A typical performance ranges from a few minutes to more than two hours. Individual musicians often make simple changes to the score, writing them manually on their parts during rehearsals, most often by adding interpretation symbols such as dynamics, expression marks, and string bowings. More complex changes-such as arrangements for different instruments, transpositions, and the deletion or addition of music sections-must be decided by the conductor. Operas, ballets, and new symphonic works frequently require such time-consuming modifications. Many performing organizations and publishers could benefit from a computerized option that allows storage of multiple versions and reduces the amount of repetitive work involved. The authors discuss their approach: the Music Object-Oriented Distributed System.
Shading Logic: A Heuristic Approach to Recover Shape from Shading
Authors: O. E. Vaga, Y. H. Yang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A heuristic-based algorithm known as the shading logic algorithm is proposed for recovering shape from shading. The heuristics are derived on the basis of a geometrical interpretation of the M.J. Brooks and B.K.P. Horn (1985) algorithm. An experimental evaluation was performed using synthesized objects, in particular, superquadrics. The advantage of using the superquadrics is that the shape of the objects can be varied incrementally and systematically. Despite the fact that the shading logic algorithm is heuristic based, experimental results show that the proposed algorithm has a better performance than the Brooks and Horn algorithm. In addition, the proposed approach does not seem to suffer the stability problem common to most variational-based methods.
Heuristic Methods for Large Centroid Clustering Problems
Authors: Éric D. Taillard
Venue: Journal of Heuristics (2003)

This article presents new heuristic methods for solving a class of hard centroid clustering problems including the p-median, the sum-of-squares clustering and the multi-source Weber problems. Centroid clustering is to partition a set of entities into a given number of subsets and to find the location of a centre for each subset in such a way that a dissimilarity measure between the entities and the centres is minimized. The first method proposed is a candidate list search that produces good solutions in a short amount of time if the number of centres in the problem is not too large. The second method is a general local optimization approach that finds very good solutions. The third method is designed for problems with a large number of centres&semi; it decomposes the problem into subproblems that are solved independently. Numerical results show that these methods are efficient&mdash;dozens of best solutions known to problem instances of the literature have been improved&mdash;and fast, handling problem instances with more than 85,000 entities and 15,000 centres&mdash;much larger than those solved in the literature. The expected complexity of these new procedures is discussed and shown to be comparable to that of an existing method which is known to be very fast.
A self-similarity structure generated by King's walk
Authors: Marko Razpet
Venue: Discrete Mathematics (2002)

For all non-negative integers i,j let w(i,j) denote the number of all paths in the plane from (0,0) to (i,j) with steps (1,0), (0, 1), and (1, 1). The numbers w(i,j) are known as the Delannoy numbers. They were studied by several authors. Let p be an odd prime and let w(i,j) denote the remainders of w(i,j) when divided by p where 0 ≤ w(i,j) > p. The Lucas property of w(i,j) which implies the self-similar pattern of w(i,j) is derived in a new way.The aim of this article is to show that for the array w(i,j) a principal cell exists and that this principal cell has some symmetry properties with special features for p=3,5,7,11,19. Triples of equal numbers of the principal cell are also discussed.
Shock: Aggregating Information While Preserving Privacy
Authors: Eytan Adar, Rajan Lukose, Caesar Sengupta, Josh Tyler, Nathaniel Good
Venue: Information Systems Frontiers (2003)

An important problem facing large, distributed organizations is the efficient management and distribution of information, knowledge, and expertise. In this paper we present the design and implementation of a low-cost, extensible, flexible, and dynamic peer-to-peer (P2P) knowledge network that helps address this problem. This system, known as Shock, is designed to protect the privacy of user's personal information, such as email, web browsing habits, etc., while making that information available for knowledge management applications. It reduces participation costs for such applications as expert-finding, allows highly targeted messaging, and enables novel kinds of ad hoc conversation and anonymous messaging. The system is tightly integrated with users' email clients, taking advantage of email as habitat.
Database Design Principles for Placement of Delay-Sensitive Data on Disks
Authors: Stavros Christodoulakis, Fenia A. Zioga
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

We investigate design principles for placing striped delay-sensitive data on a number of disks in a distributed environment. The cost formulas of our performance model allow us to calculate the maximum number of users that can be supported by n disks, as well as to study the impact of other performance-tuning options. We show that, for fixed probabilities of accessing the delay-sensitive objects, partitioning the set of disks is always better than striping in all of the disks. Then, given a number n of disks and r distinct delay-sensitive objects with probabilities of access p1, p2, ..., pr that must be striped across r different disk partitions (i.e., nonoverlapping subsets of the n disks), we use the theory of Schur functions in order to find what is the optimal number of disks that must be allocated to each partition. For objects with different consumption rates, we provide an analytic solution to the problem of disk partitioning. We analyze the problem of grouping the more- and less-popular delay-sensitive objects together in partitions¿when the partitions are less than the objects¿so that the number of supported users is maximized. Finally, we analyze the trade-off of striping on all the disks versus partitioning the set of the disks when the access probabilities of the delay-sensitive objects change with time.
Object-Oriented Development of Large Applications
Authors: Blayne Maring
Venue: IEEE Software (1996)

Object-oriented application development is today in a state analogous to that of relational technology in the late '70s. The models are well understood, development tools are available, and prices are becoming attractive. However, most users have not yet reengineered their development methodologies and processes to accommodate object-oriented techniques in a way that can guarantee success in terms of time-to-market, costs, and quality.For more than 10 years, GTE has been working to reengineer user development methodologies and process so that object-oriented application development will be feasible ¿ and repeatable ¿ for large applications. This article reports on lessons learned from our experiences over a ten-year period in which three different teams developed three different applications of one-million lines of code or more. Some of these lessons were learned through near failures; others through difficult successes.
The infamous upper tail
Authors: Svnate Janson, Andrzej Rucin´ski
Venue: Random Structures Algorithms (2002)

Let Γ be a finite index set and k ≥ 1 a given integer. Let further S ⊆ [Γ]≤k be an arbitrary family of k element subsets of Γ. Consider a (binomial) random subset Γp of Γ, where p = (pt : i ∈ Γ) and a random variable X counting the elements of S that are contained in this random subset. In this paper we survey techniques of obtaining upper bounds on the upper tail probabilities P(X ≥ λ + t) for t > 0. Seven techniques, ranging from Azuma's inequality to the purely combinatorial deletion method, are described, illustrated, and compared against each other for a couple of typical applications. As one application, we obtain essentially optimal bounds for the upper tails for the numbers of subgraphs isomorphic to K4 or C4 in a random graph G(n, p), for certain ranges of p.
Mentor-1: An Expert Database System for Student Guidance
Authors: James L. Frank, Charles A. Duffield, Craig A. Swearingen
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

A description is given of Mentor-1, a deductive database system written in C-Prolog that advises undergraduate computer science majors at the University of Arkansas in Fayetteville. An experimental prototype, the system uses a relational database model for rules and student records. Expert knowledge for the system is embodied in rules that the advisor uses to suggest how many course hours to take and the order in which to satisfy college degree requirements. Additional expertise is supplied in the form of suggestions for free elective courses based on student interests and career goals. The system has been designed to be used by the computer science department as the prototype for a subsequent collegewide system. The discussion focuses on the representation of data as relations in a Prolog environment, specific program module implementation, and a tree search method for schedule generation.
Algorithm-Based Fault Tolerance for FFT Networks
Authors: Sying-Jyan Wang, N. K. Jha
Venue: IEEE Transactions on Computers (1994)

Algorithm-based fault tolerance (ABFT) is a low-overhead system-level fault tolerance technique. Many ABFT schemes have been proposed in the past for fast Fourier transform (FFT) networks. In this paper, a new ABFT scheme for FFT networks is proposed. We show that the new approach maintains the high throughput of previous schemes, yet needs lower hardware overhead and achieves higher fault converge than previous schemes by J.Y. Jou et al. (1988) and D.I. Tao et al. (1990).
Preconditioned Uzawa Algorithm for the Velocity-Pressure-Stress Formulation of Viscoelastic Flow Problems
Authors: X. Escriva, E. Leriche, T. N. Phillips
Venue: Journal of Scientific Computing (2002)

This paper is devoted to the development of efficient iterative methods for solving the systems of algebraic equations arising from a spectral element discretization of the equations governing the flow of an Oldroyd B fluid. The governing equations are written in terms of velocity, pressure and extra-stress, giving rise to the so-called three-field formulation. The convection terms are treated using an operator-integration-factor splitting method. The remaining terms in the system of equations constitute a generalized Stokes problem. This problem is formulated in terms of an Uzawa operator applied to the pressure. Efficient preconditioners are developed for inverting this operator that are independent of the numerical and physical parameters of the problem.
Applying Discount Usability Engineering
Authors: Bill Curtis, Jakob Nielsen
Venue: IEEE Software (1995)

Usability engineering isn¿t just for the multimillion dollar companies with massive internal test labs. Jakob Nielsen, a distinguished engineer at SunSoft, relates how he and another designer (yes, a two-person project) employed low-cost, easily accessible techniques to perform several useful studies. The techniques, detailed in his recent book Usability Engineering (AP Professional, 1994), are virtually free of complex statistical methods, relying instead on simple observation and interpretation. Nielsen also joins me as coeditor of Interface beginning with this issue.¿ Bill Curtis
System-level exploration for pareto-optimal configurations in parameterized systems-on-a-chip
Authors: Tony Givargis, Frank Vahid, Jörg Henkel
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

In this work, we provide a technique for efficiently exploring the configuration space of a parameterized system-on-a-chip (SOC) architecture to find all Pareto-optimal configurations. These configurations represent the range of meaningful power and performance tradeoffs that are obtainable by adjusting parameter values for a fixed application mapped onto the SOC architecture. Our approach extensively prunes the potentially large configuration space by taking advantage of parameter dependencies. We have successfully incorporated our technique into the parameterized SOC tuning environment (Platune) and applied it to a number of applications.
Digital Planarity of Rectangular Surface Segments
Authors: P. Veelaert
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

We generalize the concept of evenness which has been developed for digital straight lines. Evenness is a necessary and sufficient condition for a digital arc segment to be a digital straight line segment. We prove that evenness is also a necessary and sufficient condition for a rectangular surface segment to be a digital plane segment. This is not true for surface segments of arbitrary shape. To clarify the relation between shape and evenness we introduce the notion of a regular shape and of an arbitrarily extendable even set.
Learning Similarity Matching in Multimedia Content-Based Retrieval
Authors: Joo-Hwee Lim, Jian Kang Wu, Sumeet Singh, Desai Narasimhalu
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Many multimedia content-based retrieval systems allow query formulation with user setting of relative importance of features (e.g., color, texture, shape, etc) to mimic the user's perception of similarity. However, the systems do not modify their similarity matching functions, which are defined during the system development. In this paper, we present a neural network-based learning algorithm for adapting similarity matching function toward the user's query preference based on his/her relevance feedback. The relevance feedback is given as ranking errors (misranks) between the retrieved and desired lists of multimedia objects. The algorithm is demonstrated for facial image retrieval using the NIST Mugshot Identification Database with encouraging results.
Classifying Software-Based Cache Coherence Solutions
Authors: Igor Tartalja, Veljko ${\bf Milutinovi \acute c}$
Venue: IEEE Software (1997)

The authors propose a classification for software solutions to cache coherence in shared-memory multiprocessors and show how it can be applied to more completely understand existing approaches and explore possible alternatives.
New Algorithms for Parallelizing Relational Database Joins in the Presence of Data Skew
Authors: J. L. Wolf, D. M. Dias, P. S. Yu, J. Turek
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Parallel processing is an attractive option for relational database systems. As in any parallel environment however, load balancing is a critical issue which affects overall performance. Load balancing for one common database operation in particular, the join of two relations, can be severely hampered for conventional parallel algorithms, due to a natural phenomenon known as data skew. In a pair of recent papers (J. Wolf et al., 1993; 1993), we described two new join algorithms designed to address the data skew problem. We propose significant improvements to both algorithms, increasing their effectiveness while simultaneously decreasing their execution times. The paper then focuses on the comparative performance of the improved algorithms and their more conventional counterparts. The new algorithms outperform their more conventional counterparts in the presence of just about any skew at all, dramatically so in cases of high skew.
Combining Classifiers with Meta Decision Trees
Authors: Ljupčo Todorovski, Sašo Džeroski
Venue: Machine Learning (2003)

The paper introduces meta decision trees (MDTs), a novel method for combining multiple classifiers. Instead of giving a prediction, MDT leaves specify which classifier should be used to obtain a prediction. We present an algorithm for learning MDTs based on the C4.5 algorithm for learning ordinary decision trees (ODTs). An extensive experimental evaluation of the new algorithm is performed on twenty-one data sets, combining classifiers generated by five learning algorithms: two algorithms for learning decision trees, a rule learning algorithm, a nearest neighbor algorithm and a naive Bayes algorithm. In terms of performance, stacking with MDTs combines classifiers better than voting and stacking with ODTs. In addition, the MDTs are much more concise than the ODTs and are thus a step towards comprehensible combination of multiple classifiers. MDTs also perform better than several other approaches to stacking.
A Reconfiguration Algorithm for a Double-Loop Token Ring Local Area Network
Authors: R. Rom, N. Shacham
Venue: IEEE Transactions on Computers (1988)

A distributed algorithm to reconfigure a double-loop token-ring local area network following topological changes is presented. Each node, upon detection of a broken link, attempts to use another link, and when this is not possible it connects its input and output lines to form a loopback. The nodes communicate only with their neighbors and base their actions on the messages they receive and on their local observations. The algorithm guarantees that at all times the network is organized to provide maximum possible connectivity among the nodes-either one loop that encompasses all nodes in the network or several subloops, each of which operates as a separate token-ring network. Tokens are generated or eliminated as necessary to result in one and only one token in each (sub)loop. The algorithm is formally specified and its properties are verified.
Adlet: An Active Document Abstraction for Multimedia Information Fusion
Authors: Shi-Kuo Chang, Taieb Znati
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

A new approach is described for the fusion of multimedia information based on the concept of active documents advertising on the Internet, whereby the metadata of a document travels in the network to seek out documents of interest to the parent document and, at the same time, advertises its parent document to other interested documents. This abstraction of metadata is called an adlet, which is the core of our approach. Two important features make this approach applicable to multimedia information fusion, information retrieval, data mining, geographic information systems, and medical information systems: 1) any document, including a web page, database record, video file, audio file, image and even paper documents, can be enhanced by an adlet and become an active document, and 2) any node in a nonactive network can be enhanced by adlet-savvy software and the adlet-enhanced node can coexist with other nonenhanced nodes. An experimental prototype provides a testbed for feasibility studies in a hybrid active network environment.
Continuous-time hidden Markov models for network performance evaluation
Authors: Wei Wei, Bing Wang, Don Towsley
Venue: Performance Evaluation (2002)

In this paper, we study the use of continuous-time hidden Markov models (CT-HMMs) for network protocol and application performance evaluation. We develop an algorithm to infer the CT-HMM from a series of end-to-end delay and loss observations of probe packets. This model can then be used to simulate network environments for network performance evaluation. We validate the simulation method through a series of experiments both in ns and over the Internet. Our experimental results show that this simulation method can represent a wide range of real network scenarios. It is easy to use, accurate and time efficient.
Maintaining Statistics Counters in Router Line Cards
Authors: Devavrat Shah, Sundar Iyer, Balaji Prabhakar, Nick McKeown
Venue: IEEE Micro (2002)

A network device stores and updates statistics counters. Using an optimal counter management algorithm minimizes required SRAM size and ensures correct line-rate operation for many counters.