ppxscal/embedding_network huggingface dataset:
A Line-Diamond Parallel Search Algorithm for Block Motion Estimation
Authors: Guiguang Ding, Qionghai Dai
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

The widespread use of block matching motion estimation (BMME) in video coding is due to its effectiveness and simplicity of implementation. This paper presents a novel fast BMME algorithm called theLine-Diamond Parallel Search (LDPS). The algorithm is based on the following two properties: the spacial directionality of the SAD distribution and the characteristics of the center-biased motion vector distribution. In addition, in order to increase the speed of search, the parallel processing idea is used in LDPS. That is to say LDPS realizes the coarse orientation and the accurate search in the same step. Our experimental results show that not only the processing speed of the LDPS algorithm is much higher than that of other fast algorithms, but also its accuracy of motion compensation is as nearly good as that of Full Search (FS).
Distributing classes with woven concerns: an exploration of potential fault scenarios
Authors: Nathan McEachen, Roger T. Alexander
Venue: Proceedings of the 4th international conference on Aspect-oriented software development (2005)

Aspect-oriented programming (AOP) promises to benefit software engineering by providing a layer of abstraction that can modularize system-level concerns. AOP is still a very young area of research and has yet to receive mainstream acceptance in industry. As a result, the industry as a whole lacks experience and knowledge concerning long term maintenance issues with AOP in deployed commercial applications. Fault models that result from software maintenance in aspect-oriented software development (AOSD) are not nearly as well understood as they are for object-oriented software development (OOSD). This paper will explore some of the long-term maintenance issues that can occur with AspectJ, which is an implementation of AOP for the Java programming language. More specifically, the ability of AspectJ (as of version 1.2) to weave into existing bytecode that already contains woven aspects can create unexpected and potentially unsolvable problems. This will hopefully lead to further discussion in the research community that will result in a better understanding of the long-term maintenance issues inherent in AOSD.
Dragon2005: large-scale mixed-size placement tool
Authors: Taraneh Taghavi, Xiaojian Yang, Bo-Kyung choi
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

In this paper, we develop a mixed-size placement tool, Dragon2005, to solve large scale placement problems effectively. A top-down hierarchical approach based on min-cut partitioning and simulated annealing is used to place very large SoC-style designs containing thousands of macro blocks of various sizes and millions of standard cells. Macro aware partitioning and techniques to properly handle different bin sizes are required, because of the existence of large macro blocks. Our tool is also a congestion and timing aware placement tool.
Caregivers, cost, and complexity: understanding technology usage by individuals with cognitive disabilities
Authors: Melissa Dawe
Venue: Issue 81 (January 2005) (2005)

This research employs ethnographic and user-centered design methods in a multi-phase study designed to uncover usability issues and evolving user needs through the design and extended use of a handheld remote communication system for individuals with cognitive disabilities. This extended abstract focuses on the findings from the first phase of the research, an interview study exploring issues around adoption and usage of technology by individuals with cognitive disabilities.
Arithmetic, first-order logic, and counting quantifiers
Authors: Nicole Schweikardt
Venue: ACM Transactions on Computational Logic (TOCL) (2005)

This article gives a thorough overview of what is known about first-order logic with counting quantifiers and with arithmetic predicates. As a main theorem we show that Presburger arithmetic is closed under unary counting quantifiers. Precisely, this means that for every first-order formula &phiv;(y,z) over the signature &lcub;<,&plus;&rcub; there is a first-order formula &psi;(x,z) which expresses over the structure &lang;&U2115;,<,&plus;&rang; (respectively, over initial segments of this structure) that the variable x is interpreted exactly by the number of possible interpretations of the variable y for which the formula &phiv;(y,z) is satisfied. Applying this theorem, we obtain an easy proof of Ruhl's result that reachability (and similarly, connectivity) in finite graphs is not expressible in first-order logic with unary counting quantifiers and addition. Furthermore, the above result on Presburger arithmetic helps to show the failure of a particular version of the Crane Beach conjecture.
Optimizing general purpose compiler optimization
Authors: M. Haneda, P. M. W. Knijnenburg, H. A. G. Wijshoff
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

The problem of defining optimal optimization strategies for compilers is well known and has been studied extensively over the last years. The problem arises from the fact that the sheer number of possible combinations of optimizations, their order, and their setting creates a search space which cannot adequately be searched. Although it has been shown that compiler settings can be found that outperform standard -Ox switches for a single application, it is not known how to find such settings that work well for sets of applicationsIn this paper, we introduce a statistical technique to derive a methodology which trims down the search space considerably, thereby allowing a feasible and flexible solution for defining high performance optimization strategies. We show that our technique finds a single compiler setting for a collection of programs (SPECint95) that performs better than the standard -Ox settings of gcc. 3.3.1.
Making space for stories: ambiguity in the design of personal communication systems
Authors: Paul M. Aoki, Allison Woodruff
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Pervasive personal communication technologies offer the potential for important social benefits for individual users, but also the potential for significant social difficulties and costs. In research on face-to-face social interaction, ambiguity is often identified as an important resource for resolving social difficulties. In this paper, we discuss two design cases of personal communication systems, one based on fieldwork of a commercial system and another based on an unrealized design concept. The cases illustrate how user behavior concerning a particular social difficulty, unexplained unresponsiveness, can be influenced by technological issues that result in interactional ambiguity. The cases also highlight the need to balance the utility of ambiguity against the utility of usability and communicative clarity.
Invention and creativity in automated design by means of genetic programming
Authors: John R. Koza, Martin A. Keane, Matthew J. Streeter, Thomas P. Adams, Lee W. Jones
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2004)

Some designs are sufficiently creative that they are considered to be inventions. The invention process is typically characterized by a singular moment when the prevailing thinking concerning a long-standing problem is, in a &ldquo;flash of genius,&rdquo; overthrown and replaced by a new approach that could not have been logically deduced from what was previously known. This paper discusses such logical discontinuities using an example based on the history of one of the most important inventions of the 20th century in electrical engineering, namely, the invention of negative feedback by AT&T's Harold S. Black. This 1927 invention overthrew the then prevailing idiom of positive feedback championed by Westinghouse's Edwin Howard Armstrong. The paper then shows how this historically important discovery can be readily replicated by an automated design and invention technique patterned after the evolutionary process in nature, namely, genetic programming. Genetic programming employs Darwinian natural selection along with analogs of recombination (crossover), mutation, gene duplication, gene deletion, and mechanisms of developmental biology to breed an ever improving population of structures. Genetic programming rediscovers negative feedback by conducting an evolutionary search for a structure that satisfies Black's stated high-level goal (i.e., reduction of distortion in amplifiers). Like evolution in nature, genetic programming conducts its search probabilistically without resort to logic using a process that is replete with logical discontinuities. The paper then shows that genetic programming can routinely produce many additional inventive and creative results. In this regard, the paper discusses the automated rediscovery of numerous 20th-century patented inventions involving analog electrical circuits and controllers, the Sallen&ndash;Key filter, and six 21st-century patented inventions.
Angular decompositions for the discrete fractional signal transforms
Authors: Min-Hung Yeh
Venue: Signal Processing (2005)

This paper is concerned with the angular decomposition methods for the discrete fractional signal transforms. The proposed angular decomposition algorithm can be applied to many discrete fractional signal transforms, which are developed by eigen decomposition. By this angular decomposition, the discrete fractional signal transforms can be computed by a weighted summation of the transform evaluated at special angles. And the weighting coefficients are just equal to the inverse discrete Fourier transform of the eigenvalues of the fractional signal transform kernels.
Creating gender parity: an instruction aide's influence
Authors: Cynthia Y. Lester, Marcus Brown
Venue: Journal on Educational Resources in Computing (JERIC) (2004)

The decline in the number of women in computing disciplines has been attributed to different causes, and research on the decline continues to grow. While there are numerous reasons suggested for the imbalance in these disciplines, the perceptions that women hold about their computing capabilities continue to be of interest. The current study investigates how a vicarious learning experience can be used to influence computer selfefficacy. To implement the vicarious experience, a computer-assisted peer-modeling instruction aide was developed. The study reveals that vicarious learning has a significant impact on female and male computer selfefficacy, and that the impact may be more significant for females.
Concept-based querying in mediator systems
Authors: Kai-Uwe Sattler, Ingolf Geist, Eike Schallehn
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2005)

One approach to overcoming heterogeneity as a part of data integration in mediator systems is the use of metadata in the form of a vocabulary or ontology to represent domain knowledge explicitly. This requires including this meta level during query formulation and processing. In this paper, we address this problem in the context of a mediator that uses a concept-based integration model and an extension of the XQuery language called CQuery. This mediator has been developed as part of a project for integrating data about cultural assets. We describe the language extensions and their semantics as well as the rewriting and evaluation steps. Furthermore, we discuss aspects of caching and keyword-based search in support of an efficient query formulation and processing.
A transitive model for extracting translation equivalents of web queries through anchor text mining
Authors: Wen-Hsiang Lu, Lee-Feng Chien, Hsi-Jian Lee
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

One of the existing difficulties of cross-language information retrieval (CLIR) and Web search is the lack of appropriate translations of new terminology and proper names. Different from conventional approaches, in our previous research we developed an approach for exploiting Web anchor texts as live bilingual corpora and reducing the existing difficulties of query term translation. Although Web anchor texts, undoubtedly, are very valuable multilingual and wide-scoped hypertext resources, not every particular pair of languages contains sufficient anchor texts in the Web to extract corresponding translations in the language pair. For more generalized applications, in this paper we extend our previous approach by adding a phase of transitive (indirect) translation via an intermediate (third) language, and propose a transitive model to further exploit anchor-text mining in term translation extraction applications. Preliminary experimental results show that many query translations which cannot be obtained using the previous approach can be extracted with the improved approach.
Algebraic and functional specification of an interactive serializable database interface
Authors: Manfred Broy
Venue: Distributed Computing (1992)

A formal functional specification of a serializable interface for an interactive database is given and refined into two different versions with distinct strategies for solving read/write conflicts. The formalization is based on techniques of algebraic specification for defining the basic data structures and functional system specification by streams and stream processing functions for defining the properties concerning interaction. It is especially demonstrated how different specification techniques can be used side by side.
VLSI Implementation of An Adaptive Equalizer for ATSC Digital TV Receivers
Authors: Wonyong Sung, Youngho Ahn, Eunjoo Hwang
Venue: Journal of VLSI Signal Processing Systems (2005)

An adaptive equalizer for ATSC standard HDTV receivers is developed and implemented in VLSI. This equalizer is based on the G-pseudo algorithm that combines the advantages of the decision directed and blind algorithms. It also conducts ghost cancellation for the reception of NTSC analog TV signals. A programmable error calculation unit is employed for a flexible implementation of several equalization algorithms. The filter coefficients have a long internal word-length for a satisfactory operation in the blind adaptation mode, but only parts of them are used for output calculation to reduce the hardware complexity. The performance of the system for seven GA reference channels is evaluated according to the adaptation algorithms, the number of delays for the adaptation, and the word-length of the filter coefficients. The chip area and power consumption according to the time multiplexing ratio are estimated.
From Embedded Test to Embedded Diagnosis
Authors: Hans-Joachim Wunderlich
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

Testing integrated circuits with millions of transistors puts strong requirements on test volume, test application time, test speed, and test resolution. To overcome these challenges, it is widely accepted to partition test resources between the automatic test equipment (ATE) and the circuit under test (CUT). These strategies may reach from simple test data compression/decompression schemes to implementing a complete built-in self-test. Very often these schemes come with reduced diagnostic resolution. In this paper, an overview is given on techniques for embedding test into a circuit while still keeping diagnostic capabilities. Built-in diagnosis techniques may be used after manufacturing, for chip characterization and field return analysis, and even for rapid prototyping.
Approaches Based on Permutations for Partitioning Sparse Matrices on Multiprocessors
Authors: E. M. Garz, I. García
Venue: The Journal of Supercomputing (2005)

This paper introduces new approaches to the data distribution-partition problem for sparse matrices in a multiprocessor environment. In this work, the data partition problem of a sparse matrix is modeled as a Min-Max Problem subject to the uniformity constrain when the goal is to balance the load for both sparse and dense operations. This problem is NP-Complete and two heuristic solutions (ABO and GPB) are proposed. The key of ABO and GPB is to determine the permutation of rows/columns of the input sparse matrix to obtain a sorted matrix with a homogeneous density of nonzero elements. Due to the heuristic nature of the proposed methods their validation is carried out by a comparative study of the parallel efficiency of two types of problems (sparse and mixed) when ABO, GPB, Block, Cyclic and MRD data distributions are applied.
Universal partial order represented by means of oriented trees and other simple graphs
Authors: Jan Hubička, Jaroslav Nešetřil
Venue: European Journal of Combinatorics (2005)

We present several simple representations of universal partially ordered sets and use them for the proof of universality of the class of oriented trees ordered by the graph homomorphisms. This (which we believe to be a surprising result) solves several open problems. It implies for example universality of cubic planar graphs. This is in sharp contrast with representing even groups (and monoids) by automorphisms (and endomorphisms) of a bounded degree and planar graph. Thus universal partial orders (thin categories) are representable by much simpler structures than categories in general.
Coupling aware timing optimization and antenna avoidance in layer assignment
Authors: Di Wu, Jiang Hu, Rabi Mahapatra
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

The sustained progress of VLSI technology has altered the landscape of routing which is a major physical design stage. For timing driven routings, traditional approaches which consider only wire self capacitance become inadequate since the wire delay is affected more by coupling capacitance in ultra-deep submicron designs. Furthermore, the technology scaling dramatically increases the likelihood of the antenna problem in manufacturing and requests corresponding considerations in the routing stage. In this paper, we propose techniques that can be applied to handle the coupling aware timing and the antenna problem simultaneously during layer assignment which is an important step between global routing and detailed routing. An improved probabilistic coupling capacitance model is suggested for coupling aware timing optimization without performing track assignment. The antenna avoidance problem is modeled as a tree partitioning problem with a linear time optimal algorithm solution. This algorithm is customized to guide antenna avoidance in layer assignment. A linear time optimal jumper insertion algorithm is also derived. Experimental results on benchmark circuits show that the proposed techniques can lead to an average of 270ps timing slack improvement validated by track assignment, 76% antenna violation reduction and 99% via violation reduction.
A Probabilistic Signal-Strength-Based Evaluation Methodology for Sensor Network Deployment
Authors: Sheng-Po Kuo, Yu-Chee Tseng, Fang-Jing Wu, Chun-Yu Lin
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

The deployment of senor networks have attracted a lot of attention recently. In essence this issue is concerned with how well a sensing field is monitored by sensors to achieve a particular coverage. In this paper, we propose asignal-strength-based approach to evaluate how well a sensing field is covered/monitored. We first formulate object tracking by a single sensor as a Gaussian-error model. Then we establish an error model on location estimation given that the location of an object is known. This leads to a model to evaluate a sensor network with given locations of sensors. We then apply the result to several applications, such as adding more sensor nodes for error reduction and scheduling power modes (awake or sleep) of sensors, and demonstrate our simulation results.
Mixed binary integer programming formulations for the reentrant job shop scheduling problem
Authors: Jason Chao-Hsien Pan, Jen-Shiang Chen
Venue: Computers and Operations Research (2005)

This paper describes the development of mixed binary integer programming (BIP) formulations for the reentrant job shop scheduling problem. Based on an earlier classical job shop model developed by Manne and improved by Liao and You, this paper presents two extended BIP optimization formulations for the problem under consideration. In order to improve the solution speed of the BIP formulations, two layer division procedures are developed and incorporated in the corresponding models. Results of computational experiments, in which an average performance of these formulations is investigated, are also reported.
A model for parallel job scheduling on dynamical computer Grids: Research Articles
Authors: Alfredo Goldman, Carlos Queiroz
Venue: Concurrency and Computation: Practice Experience (2004)

This work presents a model that allows the execution of parallel applications in a Grid environment. Our main focus is on how to share the idle cycles of clusters and computers to execute real parallel applications. We present a new model which introduces the notions of locality and adaptability. The locality is used for job allocation, and for job migration. The adaptability provides a simple mechanism to allow clusters to join or leave a Grid. We also propose the middleware architecture to implement the model, and provide some simulation results to show the main characteristics of the model. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Extracting Speedup From C-Code With Poor Instruction-Level Parallelism
Authors: Dara Kusic, Raymond Hoare, Alex K. Jones, Joshua Fazekas, John Foster
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 14 - Volume 15 (2005)

Scientific computing and multimedia applications frequently call loop-intensive functions that dominate execution time. Applying homogeneous, parallel processors (e.g. single-instruction, multiple-data (SIMD) and very-long instruction word (VLIW)) is a common approach to minimizing execution time. However, many benchmark applications offer disappointingdegrees of instruction-level parallelism (ILP) that cause these ar-chitectures to fall short of expected performance gains. This paper presents findings on execution time speedup achieved by heterogeneousmassively parallel processors - standard reduced instruction-set comput-ing (RISC) CPUstightly coupled with arrays of super-complex instruction-set computing (SuperCISC) datapaths on the same chip. SuperCISC datapaths are created by mapping frequently-called functions into reconfigurable hardware. Encouraging performance results from the RISC/SuperCISC architecture point to the efficiency of reconfigurable devices to support large numbers of parallel computational accelerators. Calls to SuperCISC functions can greatly expedite execution time when applied to CPUs that support extensible in-struction sets. In this paper we show how SuperCISC functions can accelerate an application up to 25x over a 4-way VLIW. SuperCISC functions show superlinear speedup, a per-formance gain significantly greater than the software's ILP. SuperCISC functions also benefit from cycle com-pression, or a reduction of the idle cycle time for an operation to execute within a traditional CPU. Imple-menting software controls, or if-then-else statements, as hardware multiplexers within a SuperCISC function further advances performance.