ppxscal/embedding_network huggingface dataset:
Embedded Processor Validation Environment Using a Cycle-Accurate Retargetable Instruction-Set Simulator
Authors: Hoonmo Yang, Moonkey Lee
Venue: The Journal of Supercomputing (2005)

In the advent of System-on-Chip (SoC) technology, validation scope is further expanded from a single core to the system. Modules are also substituted by application specific instruction-set processors (ASIP) in order to raise abstraction level of systems from signals to instructions. As embedded processors are diversified according to their specific application, they suffer from an increasing number of irregular constraints and architectural idiosyncrasies. They also have control paths of pipeline which shows quite complicated timing. In order to alleviate these design complexities, validation must take retargetability and cycle-accuracy into consideration. We have thus proposed efficient embedded processor validation environment (EPVE) using a cycle-accurate retargetable instruction-set simulator (CARISS) as a reference model. The designed CARISS is based on an architecture description language (ADL), which provides improved retargetability for instruction-set machines. It also uses a scheduling method which can capture complex processor behavior more accurately than the ones used by the previous ADLs. We have applied the proposed EPVE for the 32bit embedded processors and investigated effectiveness of our approach by analyzing statistics on detected errors.
A web spider project for an OOP Course
Authors: Jeffrey D. Martens
Venue: Journal of Computing Sciences in Colleges (2004)

This programming assignment involves the incremental design and implementation of a web search tool as a semester-long project implemented in four phases. Further discussion, UML diagrams, and Java source code will be available on the author's web page[1].
Synthesis of C++ Software from Verifiable CSPm Specifications
Authors: Stephen Doxsee, W. B. Gardner
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

CSP++ is an object-oriented application framework for execution of CSP specifications that have been automatically synthesized into C++ source code by the cspt translator. We describe the tool's new capability of accepting input in CSPm syntax, the same dialect processed by the commercial verification tool, FDR2. Using a new ATM case study in CSPm, we give samples of generated code, and illustrate the use of "selective formalism" to code and verify some system functionality in CSP, and supply other functionality via user-coded C++ functions linked to events in the CSP specifications.
Recurrence equation as basis for designing hot-potato routing protocols
Authors: Ville Leppänen, Martti Penttonen
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

In this work we demonstrate the use of generating functions for solving recurrence equations, which can occur e.g. in the analysis of routing protocols. We prove an exact bound for the expectation of packets reaching their target in a torus, when the routing protocol makes the packets to favor with probability p in each node a diagonal route to their target. Higher probability increases expectation of successful packets. We consider designing routing protocols according to the scenario and compare them to known results.
Dynamic Voltage Scaling for Digital Control System Implementation
Authors: Hyung Sun Lee, Byung Kook Kim
Venue: Real-Time Systems (2005)

For real-time computer-controlled systems, control performances of tasks as well as energy consumption of overall system must be optimized. A control task does not have a fixed period but a range of periods in which the control performance varies. Hence, when more than one control tasks are scheduled on a single processor, an optimization problem appears. Furthermore, when an energy saving technique such as dynamic voltage scaling is used, its properties affect the control performance.Using a performance index that involves control performance and energy consumption, a static solution is proposed to obtain the optimal processor speed and a set of periods for given control tasks in O(k). Also a dynamic solution is proposed to utilize system services of real-time operating systems to overcome unavoidable deficiencies of the static solution and to further reduce the energy consumption of the overall system. The performances of proposed solutions are revealed via simulation studies.
Distance labeling schemes for well-separated graph classes
Authors: Michal Katz, Nir A. Katz, David Peleg
Venue: Discrete Applied Mathematics (2005)

Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices can be inferred from inspecting their labels. It is shown in this paper that the classes of interval graphs and permutation graphs enjoy such a distance labeling scheme using O(log2 n) bit labels on n-vertex graphs. Towards establishing these results, we present a general property for graphs, called well-(α, g)-separation, and show that graph classes satisfying this property have O(g(n) log n) bit labeling schemes. In particular, interval graphs are well-(2, log n)-separated and permutation graphs are well-(6, log n)-separated.
Strategic Technology Planning for the E-Commerce Enabled Enterprise
Authors: Jinoos (Jean) Hosseini
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

This paper reports on an overall methodology to develop a strategic architecture plan which can be applied to organizations. The deployment of the plan would allow for advanced implementation of technologies such as mass customization, customer relationship management systems, decision support systems and knowledge management systems. Despite advances in the development of new applications, many organizations are not able to embrace these new technologies mainly due to not having devised an appropriate plan to position themselves technologically and organizationally to incorporate these technologies. In many instances, organizations are even crippled to take advantage of the new competitive systems, because they lack the right standards and or suffering from old, mismatched and antiquated systems that they can not get rid of easily. The road map will provide organizations with specific technical requirements for the immediate needs as well as a migration path to "plug in" the component and the products the business is moving towards.
Scheduling Algorithms for Effective Thread Pairing on Hybrid Multiprocessors
Authors: Robert L. McGregor, Christos D. Antonopoulos, Dimitrios S. Nikolopoulos
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

With the latest high-end computing nodes combining shared-memory multiprocessing with hardware multithreading, new scheduling policies are necessary for workloads consisting of multithreaded applications. The use of hybrid multiprocessors presents schedulers with the problem of job pairing, i.e. deciding which specific jobs can share each processor with minimum performance penalty, by running on different execution contexts. Therefore, scheduling policies are expected to decide not only which job mix will execute simultaneously across the processors, but also which jobs can be combined within each processor. This paper addresses the problem by introducing new scheduling policies that use run-time performance information to identify the best mix of threads to run across processors and within each processor. Scheduling of threads across processors is driven by the memory bandwidth utilization of the threads, whereas scheduling of threads within processors is driven by one of three metrics: bus transaction rate per thread, stall cycle rate per thread, or outermost level cache miss rate per thread. We have implemented and experimentally evaluated these policies on a real multiprocessor server with Intel Hyperthreaded processors. The policy using bus transaction rate for thread pairing achieves an average 13.4% and a maximum 28.7% performance improvement over the Linux scheduler. The policy using stall cycle rate for thread pairing achieves an average 9.5% and a maximum 18.8% performance improvement. The average and maximum performance gains of the policy using cache miss rate for thread pairing are 7.2% and 23.6% respectively.
Software Reuse across Robotic Platforms: Limiting the Effects of Diversity
Authors: Glenn Smith, Robert Smith, Aster Wardhani
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

Robots have diverse capabilities and complex interactions with their environment. Software development for robotic platforms is time consuming due to the complex nature of the tasks to be performed. Such an environment demands sound software engineering practices to produce high quality software. However software engineering in the robotics domain fails to facilitate any significant level of software reuse or portability. This paper identifies the major issues limiting software reuse in the robotics domain. Lack of standardisation, diversity of robotic platforms, and the subtle effects of environmental interaction all contribute to this problem. It is then shown that software components, fuzzy logic, and related techniques can be used together to provide suitable abstractions to address this problem. While complete software reuse is not possible, it is demonstrated thatsignificant levels of software reuse can be obtained. Without an acceptable level of reuse or portability, software engineering in the robotics domain will not be able to meet the demands of a rapidly developing field. The work presented in this paper demonstrates a method for supporting software reuse across robotic platforms and hence facilitating improved software engineering practices.
Approximation of Integral Operators by **-Matrices with Adaptive Bases
Authors: S. B&#x00f6;rm
Venue: Computing (2005)

**-matrices can be used to construct efficient approximations of discretized integral operators. The **-matrix approximation can be constructed efficiently by interpolation, Taylor or multipole expansion of the integral kernel function, but the resulting representation requires a large amount of storage.In order to improve the efficiency, local Schur decompositions can be used to eliminate redundant functions from an original approximation, which leads to a significant reduction of storage requirements and algorithmic complexity.
Roads, codes, and spatiotemporal queries
Authors: Sandeep Gupta, Swastik Kopparty, Chinya Ravishankar
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks. We handle join, range, intercept, and other spatial and spatiotemporal queries under these assumptions, with distances being measured along the trajectories. Most work to date has studied the significantly simpler case of objects moving in straight lines on the plane. Our work is an advance toward solving the problem in its more general form.Central to our approach is an efficient coding technique, based on hypercube embedding, for assigning labels to nodes in the network. The Hamming distance between codes corresponds to the physical distance between nodes, so that we can determine shortest distances in the network extremely quickly. The coding method also efficiently captures many properties of the network relevant to spatial and spatiotemporal queries. Our approach also yields a very effective spatial hashing method for this domain. Our analytical results demonstrate that our methods are space- and time-efficient.We have studied the performance of our method for large planar graphs designed to represent road networks. Experiments show that our methods are efficient and practical.
Beyond Bandwidth: Dimensions of Connection in Interpersonal Communication
Authors: Bonnie A. Nardi
Venue: Computer Supported Cooperative Work (2005)

Computer-mediated communication (CMC) is a keystone of computer-supported collaborative work. Current CMC theory utilizes an information channel metaphor in which media vary according to how well they afford the transfer of messages in the channel, i.e., bandwidth. This paper draws attention to a different aspect of communication argued to be equally important: a relation between people that defines a state of communicative readiness in which fruitful communication is likely. Drawing on research on instant messaging (Nardi et al., 2000) and face to face communication (Nardi et al., 2002; Nardi and Whittaker, 2003), as well as related literature, three dimensions of connection that activate readiness are proposed: affinity, commitment, and attention. These dimensions comprise a field of connection between dyads. A field of connection is conceptualized as a labile, multidimensional space in which the values of the dimensions vary according to the history of communicative activity. Affinity, commitment, and attention are constantly monitored, negotiated, and managed through social bonding, expression of commitment, and capture of attention. The management of fields of connection requires significant interactional work to sustain communication over time.
Bayesian analysis of the unobserved ARCH model
Authors: Stefanos G. Giakoumatos, Petros Dellaportas, Dimitris N. Politis
Venue: Statistics and Computing (2005)

The Unobserved ARCH model is a good description of the phenomenon of changing volatility that is commonly appeared in the financial time series. We study this model adopting Bayesian inference via Markov Chain Monte Carlo (MCMC). In order to provide an easy to implement MCMC algorithm we adopt some suitable non-linear transformations of the parameter space such that the resulting MCMC algorithm is based only on Gibbs sampling steps. We illustrate our methodology with data from real world. The Unobserved ARCH is shown to be a good description of the exchange rate movements. Numerical comparisons between competing MCMC algorithms are also presented.
Image Denoising Using Non-Negative Sparse Coding Shrinkage Algorithm
Authors: Li Shang, Deshuang Huang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper proposes a new method for denoising natural images using our extended Non-negative Sparse Coding (NNSC) neural network shrinkage algorithm, which is self-adaptive to the statistic property of natural images. The basic principle of denoising using NNSC shrinkage is similar to that using standard sparse shrinkage and wavelet soft threshold. Using test images corrupted by additive Gaussian noise, we evaluated the method across a range of noise levels. We utilized the normalized mean squared error as a measure of the quality of denoising images and the signal to noise rate (SNR) value as an evaluative feature of different denoising approaches. The experimental results prove that the NNSC shrinkage certainly is effective in image denoising. Otherwise, we also compare the effectiveness of the NNSC shrinkage with sparse coding shrinkage and wavelet soft threshold method. The simulative tests show that our denoising method outperforms any other of the two kinds of denoising approaches.
Accurate automatic visible speech synthesis of arbitrary 3D models based on concatenation of diviseme motion capture data: Research Articles
Authors: Jiyong Ma, Ronald Cole, Bryan Pellom, Wayne Ward, Barbara Wise
Venue: Computer Animation and Virtual Worlds (2004)

We present a technique for accurate automatic visible speech synthesis from textual input. When provided with a speech waveform and the text of a spoken sentence, the system produces accurate visible speech synchronized with the audio signal. To develop the system, we collected motion capture data from a speaker's face during production of a set of words containing all diviseme sequences in English. The motion capture points from the speaker's face are retargeted to the vertices of the polygons of a 3D face model. When synthesizing a new utterance, the system locates the required sequence of divisemes, shrinks or expands each diviseme based on the desired phoneme segment durations in the target utterance, then moves the polygons in the regions of the lips and lower face to correspond to the spatial coordinates of the motion capture data. The motion mapping is realized by a key-shape mapping function learned by a set of viseme examples in the source and target faces. A well-posed numerical algorithm estimates the shape blending coefficients. Time warping and motion vector blending at the juncture of two divisemes and the algorithm to search the optimal concatenated visible speech are also developed to provide the final concatenative motion sequence. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Integrating tradeoff support in product search tools for e-commerce sites
Authors: Pearl Pu, Li Chen
Venue: Proceedings of the 6th ACM conference on Electronic commerce (2005)

In a previously reported user study, we found that users were able to perform decision tradeoff tasks more efficiently and commit considerably fewer errors with the example critiquing interface than with the ranked list. We concluded that example-based search tools were likely to be useful particularly for extending the scope of consumer e-commerce to more complex products where decision making is critical. This paper presents results from a follow-up user study quantifying the benefits of tradeoff support. Users were able to refine the quality of their preference structures and improve decision accuracy by up to 57% after performing tradeoff tasks. Tradeoff support also significantly increased users' confidence in their choices. Together, these two studies show that example critiquing enables users to more accurately find what they want and be confident in their choices, while only requiring a level of effort that is comparable to the ranked list interface.
Attitude dead reckoning in a collaborative virtual environment using cumulative polynomial extrapolation of quaternions: Research Articles
Authors: Yim-Pan Chui, Pheng-Ann Heng
Venue: Concurrency and Computation: Practice Experience (2004)

In this paper, we propose a new attitude dead-reckoning paradigm in a collaborative virtual environment (CVE). We derive a general polynomial construction scheme of attitude trajectory that uses a number of previous packets in order to extrapolate the future trajectory of objects by quaternion representation. The scheme allows consecutive attitudes received from the network to propagate in a smooth manner. This cumulative trajectory construction scheme helps in developing our adaptive prediction and convergence mechanism of the overall estimation paradigm.Aiming to facilitate the remote rendering of objects, our proposed cumulative polynomial extrapolation technique provides a robust management of rotational states of objects and at the same time reduces the bandwidth consumption compared with the traditional method. By devising a quaternion-based attitude estimation paradigm, the complete predictive management for shared states is built; this permits us to estimate rotational trajectory of objects as well as camera views. The proposed algorithm can perform remote rendering accurately in the presence of network latency. Experiments are carried out to illustrate the effectiveness of our proposed algorithm. Copyright &copy; 2004 John Wiley & Sons, Ltd.
The English literature researcher in the age of the Internet
Authors: David Ellis, Hanna Oldman
Venue: Journal of Information Science (2005)

This study explores the extent to which the information seeking behaviour of researchers active in the field of English Literature in the universities of the UK and the wider world has changed as a result of the developing electronic information revolution. It deals with the researchers' attitudes towards the Internet and examines their position with regard to utilizing the Internet as a publication outlet. The different types of electronic information sources for English literature are identified and the experiences of researchers using them explored. Finally, the study examines researcher attitudes towards electronic publication and to plans for a `virtual library'. The article concludes with recommendations for further study of the use of electronic resources in relation to information literacy and browsing and other facilities for subject access on the Internet.
Extendability of Ternary Linear Codes
Authors: Tatsuya Maruta
Venue: Designs, Codes and Cryptography (2005)

There are four diversities for which ternary linear codes of dimension k ¿ 3, minimum distance d with gcd(3,d) = 1 are always extendable. Moreover, three of them yield double extendability when d ¿ 1 (mod 3). All the diversities are found for ternary linear codes of dimension 3 ¿ k ¿ 6. An algorithm how to find an extension from a generator matrix is also given.
Not So Naive Bayes: Aggregating One-Dependence Estimators
Authors: Geoffrey I. Webb, Janice R. Boughton, Zhihai Wang
Venue: Machine Learning (2005)

Of numerous proposals to improve the accuracy of naive Bayes by weakening its attribute independence assumption, both LBR and Super-Parent TAN have demonstrated remarkable error performance. However, both techniques obtain this outcome at a considerable computational cost. We present a new approach to weakening the attribute independence assumption by averaging all of a constrained class of classifiers. In extensive experiments this technique delivers comparable prediction accuracy to LBR and Super-Parent TAN with substantially improved computational efficiency at test time relative to the former and at training time relative to the latter. The new algorithm is shown to have low variance and is suited to incremental learning.
Skewed caches from a low-power perspective
Authors: Mathias Spjuth, Martin Karlsson, Erik Hagersten
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

The common approach to reduce cache conflicts is to increase the associativity. From a dynamic power perspective this associativity comes at a high cost. In this paper we present miss ratio performance and a dynamic power comparison for set-associative caches, a skewed cache and also for a new organization proposed,the elbow cache. The elbow cache extends the skewed cache organization with a relocation strategy for conflicting blocks. We show that these skewed designs significantly reduce the conflict problems while consuming p to 56% less dynamic power than a comparably performing 8-way set associative cache. We believe this to be the strongest case in favor of skewed caches presented so far