ppxscal/embedding_network huggingface dataset:
Instruction scheduling for a clustered VLIW processor with a word-interleaved cache: Research Articles
Authors: Enric Gibert, Jesús Sánchez, Antonio González
Venue: Concurrency and Computation: Practice Experience (2006)

Clustering is a common technique to overcome the wire delay problem incurred by the evolution of technology. Fully distributed architectures, where the register file, the functional units and the data cache are partitioned, are particularly effective to deal with these constraints and moreover they are very scalable. In this paper, effective instruction scheduling techniques for a word-interleaved cache clustered VLIW processor are presented. Such scheduling techniques rely on (i) loop unrolling and variable alignment to increase the fraction of local accesses, (ii) a latency assignment process to schedule memory instructions with an appropriate latency, and (iii) different heuristics to assign memory instructions to clusters. Memory consistency is guaranteed by constraining the assignment of memory instructions to clusters. In addition, the use of Attraction Buffers is also introduced. An Attraction Buffer is a hardware mechanism that allows some data replication in order to increase the number of local accesses and, in consequence, reduces stall time. Performance results for the Mediabench benchmark suite demonstrate the effectiveness of the presented techniques and mechanisms. The number of local accesses is increased by more than 25&percnt; by using the mentioned scheduling techniques, while stall time is reduced by more than 30&percnt; when Attraction Buffers are used. Finally, IPC results for such an architecture are 10&percnt; and 5&percnt; better compared to those of a clustered VLIW processor with a centralized&#x002F;unified data cache depending on the scheduling heuristic, respectively. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Prospects for Expanding Telehealth: Multi-Agent Autonomic Architectures
Authors: Gilda Pour
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The worldwide trend of rapidly rising health care costs and growing demands for access to quality health services at lower costs is a driving force for development and adoption of telehealth systems and technologies. However, the complexity of development, deployment, integration, and management of next-generation telehealth systems needs to be addressed by a new computing paradigm that will not rely on human intervention and administration to manage the system complexity. Hence, our research focuses on autonomic computing--a new computing paradigm that has been inspired by the human body's self-regulatory nervous system. Autonomic computing systems are envisioned to be self-aware and able to self-manage. In this research project, we explore multi-agent approach for development of autonomic architectures for telehealth systems. In this paper, we present multi-agent autonomic system architecture for telemonitoring that involves remotely monitoring health conditions of patients in post-surgery and patients with chronic diseases or lifethreatening health problems requiring continuous monitoring. We discuss our latest research results and plans for further research in this area.
Dual Kalman--Bucy Filters and Interactive Entropy Production
Authors: Nigel J. Newton
Venue: SIAM Journal on Control and Optimization (2006)

This paper investigates partially observed linear Gaussian systems in continuous time from an information-theoretic viewpoint. It identifies information supply, storage, and dissipation processes that quantify various dependencies between the unobservable and observable components of the state variables of such systems, which we call the signal and observation processes. The storage is that information in the past of the observation useful for estimating the present and future of the signal. It is so called because it is the information "stored" in the state variable of the Kalman--Bucy filter. The optimal properties of the Kalman--Bucy filter bring about a particular symmetry in its joint dynamics with the signal. This enables a dual system, with the same structure as the original, to be derived by time reversal. The information supply and dissipation processes of this dual problem are those of the original, with roles interchanged. The same symmetry enables us to define an entropic measure of the local time-asymmetry of the interaction between the signals and filters, which we call the rate of interactive entropy production. This is shown to be directly connected with the rates of information supply and dissipation. It is also intimately connected with the entropy production of an abstract statistical mechanical system at or near a stationary nonequilibrium state.
Scalable Cache Miss Handling for High Memory-Level Parallelism
Authors: James Tuck, Luis Ceze, Josep Torrellas
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

Recently-proposed processor microarchitectures for high Memory Level Parallelism (MLP) promise substantial performance gains. Unfortunately, current cache hierarchies have Miss-Handling Architectures (MHAs) that are too limited to support the required MLPthey need to be redesigned to support 1-2 orders of magnitude more outstanding misses. Yet, designing scalable MHAs is challenging: designs must minimize cache lock-up time and deliver high bandwidth while keeping the area consumption reasonable. This paper presents a novel scalable MHA design for high-MLP processors. Our design introduces two main innovations. First, it is hierarchical, with a small MSHR file per cache bank, and a larger MSHR file shared by all banks. Second, it uses a Bloom filter to reduce searches in the larger MSHR file. The result is a highperformance, area-efficient design. Compared to a state-of-the-art MHA on a high-MLP processor, our design speeds-up some SPECint, SPECfp, and multiprogrammed workloads by a geometric mean of 32%, 50%, and 95%, respectively. Moreover, compared to two extrapolations of current MHA designs, namely a large monolithic MSHR file and a large banked MSHR file, all consuming the same area, our design speeds-up the workloads by a geometric mean of 1-18% and 10-21%, respectively. Finally, our design performs very close to an unlimited-size, ideal MHA.
Error estimates for Landau-Lifshitz-Gilbert equation with magnetostriction
Authors: L'ubomír Baňas, Marián Slodička
Venue: Applied Numerical Mathematics (2006)

We consider the conservation of momentum equation for the displacement vector together with a nonlinear dissipative magnetic law described by Landau-Lifshitz-Gilbert equation. This system describes evolution of magnetization in deformable ferromagnets. We design a numerical scheme for full discretization and derive space-time a priori and a posteriori error estimates. The accuracy of the proposed method and efficiency of space-time adaptive algorithm based on the a posteriori estimates is illustrated numerically.
Computing Exact Discrete Minimal Surfaces: Extending and Solving the Shortest Path Problem in 3D with Application to Segmentation
Authors: Leo Grady
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Shortest path algorithms on weighted graphs have found widespread use in the computer vision literature. Although a shortest path may be found in a 3D weighted graph, the character of the path as an object boundary in 2D is not preserved in 3D. An object boundary in three dimensions is a (2D) surface. Therefore, a discrete minimal surface computation is necessary to extend shortest path approaches to 3D data in applications where the character of the path as a boundary is important. This minimal surface problem finds natural application in the extension of the intelligent scissors/ live wire segmentation algorithm to 3D. In this paper, the discrete minimal surface problem is both formulated and solved on a 3D graph. Specifically, we show that the problem may be formulated as a linear programming problem that is computed efficiently with generic solvers.
Integrating Measurement-Driven Development Methods into Software Engineering Training
Authors: Richard W. Selby
Venue: Proceedings of the 19th Conference on Software Engineering Education and Training Workshops (2006)

Software engineering training can incorporate approaches for using measurement-driven methods such as Six Sigma by using a 16-week project planning and tollgate review process. We discuss example software measurement-driven improvement methods, projects, and results.
Provisioning and Scheduling Resources for World-Wide Data-Sharing Services
Authors: Alexandru Iosup, Pawel Garbacki, D. H. J. Epema
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Grid computing is becoming the natural way to aggregate and share large and heterogeneous sets of resources. However, grid development and acceptance hinge on proving that grids reliably support large communities of users, and their real applications. In this paper we assess the ability of existing grid infrastructures to provision resources for a class of applications with numerous potential users, namely the class of world-wide data-sharing services. For this purpose, we first analyze the requirements of this class of applications, and match them against the existing spare capacity in three existing large-scale grid environments, namely OSG/Grid3, NorduGrid, and CERN LCG. Having shown that the existing capacity is insufficient, we devise and assess through trace-based simulation five domainspecific scheduling policies. Our findings give evidence that grid technology could be successfully leveraged for worldwide data-sharing services, without impacting the level of service for the currently existing load.
Exploiting Regularities for Boolean Function Synthesis
Authors: Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Venue: Theory of Computing Systems (2006)

The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure of regularity, however such a notion has been studied thus far either in the theoretical framework of self-dual Boolean functions, or for the synthesis of a particular family of three-level logic networks. In this paper we show that the degree of autosymmetry of an arbitrary function can be computed implicitly in a very efficient way, and autosymmetry can then be exploited in any logic minimization context. Our algorithms make crucial use of Binary Decision Diagrams. A set of experimental results on the synthesis of standard benchmark functions substantiates the practical relevance of our theoretical results.
eLearning and Teacher Training in a Disadvantaged Brazilian Area: a Project to Assess Access, Impact and Quality
Authors: Lorenzo Cantoni, Isabella Rega, NewMinE
Venue: Proceedings of the Fourth IEEE International Workshop on Technology for Education in Developing Countries (2006)

This paper shows the importance of Information and Communication Technologies in the field of education for developing countries. The opportunities they provide for teacher training in disadvantaged areas are outlined and some examples, specific of the Brazilian context, are reported to show the importance of three main issues Access, Impact and Quality. The paper also outlines the BET-K12 project structure stressing how it embeds the above mentioned issues, relevant not only for producing sound researches but also and above all for the effectiveness, the efficiency and the sustainability of activities aimed at promoting development.
A Component-Based Framework for Distributed Control Systems
Authors: Christo Angelov, Xu Ke, Krzysztof Sierszecki
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

The paper presents a two-level software framework for distributed embedded applications. At the top level, an application is conceived as a composition of embedded actors that communicate transparently by exchanging labeled messages (signals), independent of their allocation onto network nodes. Signals are exchanged at precisely specified time instants, in accordance with the concept of Distributed Timed Multitasking (DTM). The combination of actors, signal-based communication and DTM provides a framework for the development of open yet predictable embedded systems. At the lower level of specification, actors are modeled as software objects that are configured from executable components - basic, composite and modal function blocks, as well as supervisory state machines. Actor behaviour is specified with a hybrid executable model - a clocked event-driven state machine operating in conjunction with modal function blocks, which can be used to implement a broad range of applications such as sequential, continuous and hybrid control systems.
Dynamic task binding for hardware/software reconfigurable networks
Authors: Thilo Streichert, Christian Strengert, Christian Haubelt, Jürgen Teich
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

In this paper, a new methodology for tolerating link as well as node defects in self-adaptive reconfigurable networks will be presented. Currently, networked embedded systems need a certain level of redundancy for each node and link in order to tolerate defects and failures in a network. Due to monetary constraints as well as space and power limitations, the replication of each node and link is not an option in most embedded systems. Therefore, we will present a hardware/software partitioning algorithm for reconfigurable networks that optimizes the task binding onto resources at runtime such that node/link defects can be handled and data traffic on links between computational nodes will be minimized. This paper presents a new hardware/software partitioning algorithm, an experimental evaluation and for demonstrating the realizability, an implementation on a network of FPGA-based boards.
AR-TCP: Actively Replicated TCP Connections for Cluster of Workstations
Authors: Zhiyuan Shao, Hai Jin, Jie Wu
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

In this paper, we propose a novel scheme, called Actively Replicated TCP (AR-TCP), which transparently improves the service and data availability of cluster systems at TCP connection level. In this scheme, TCP connections are replicated and synchronized among all workstations of a cluster and can failover to healthy parts during failures. Moreover, request messages resulting in data exchang are delivered by the workstations atomically to guarantee data consistency. Read-only request messages are extracted and executed on only one of the replicas to improve the performance of simultaneous access. As an application, we build a fully replicated MySQL cluster based on our proposed scheme. The experimental results of the prototype implementation show that the cluster has small performance penalty on communication, high simultaneous read-only query performance and a small performance penalty on update operations.
An automatic distributed simulation environment
Authors: Sarita Mazzini Bruschi, Regina Helena Carlucci Santana, Marcos José Santana, Thais Souza Aiza
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Developing a sequential simulation program is not an easy task. Developing a distributed simulation program is harder than a sequential one because it is necessary to deal with mapping physical processes into logical processes, communication and synchronization problems and learn another simulation language/library. In literature, several simulation environments can be found but the great number are for sequential simulation, not using all the advantages of a distributed/parallel platform. This paper presents ASDA, an automatic distributed simulation environment that aims at providing several possibilities to users developing a distributed simulation. The automatic word can be understood in three diferent ways: the environment automatically generates a distributed simulation program code; the environment can automatically choose one distributed simulation approach; and the environment can automatically convert a sequential simulation program into a distributed simulation program using the MRIP (Multiple Replication in Parallel) approach.
Capital One's statistical problems: our top ten list
Authors: William Kahn
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Capital One is a highly quantitatively driven diversified financial services firm. As such, we make broad and deep use of the entire repertory of highly quantitative techniques. This talk will present our top ten statistical problems. Indeed, one of them has, as a sub point, the data mining dimension, but it will likely be useful for data miners to see how their research needs to complement, and fit into, the entire range of hard statistical issues.
Gabor Filter Analysis for Texture Segmentation
Authors: Roman Sandler, Michael Lindenbaum
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Gabor features are a common choice for texture analysis. The particular set of Gabor filters used for extracting the features is usually designed for optimal signal representation. We propose here an alternative criterion for designing the filter set. We consider a set of filters and its response to pairs of harmonic signals. Two signals are considered separable if the corresponding two sets of vector responses are disjoint in at least one of the components. We look for the set of Gabor filters that maximizes the fraction of separable harmonic signal pairs. The resulting filters are significantly different from the traditional ones. We test these maximal harmonic discrimination (MHD) filters using two texture discrimination methods, and describe their advantages over traditional filters.
Total least squares system identification and frequency estimation for overdetermined model orders
Authors: C. E. Davila
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

A method of obtaining accurate parameter and frequency estimates using the total least squares (TLS) method when the model order is overdetermined is described. The proposed method finds the linear combination of the noise subspace eigenvectors which yields the sought-after unknown system parameters. The proposed approach was demonstrated to perform better than the minimum-norm method in a parameter identification and a frequency estimation experiment. 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
Context-Sensitive Access to Information Sources
Authors: A. Smirnov, T. Levashova, N. Shilov, M. Pashkin, A. Kashevnik, A. Krizhanovsky, A. Komarova
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

The paper presents an approach to accessing information sources for an intelligent decision support system (DSS). Presented DSS is based on the idea of fusion of heterogeneous information from distributed sources. Proposed approach is based on integrated usage of such technologies as ontology and context management, Web-services, similarity-based indexing. One of the problems solved within this approach is assigning values to the attributes of objects acquired from different information sources. In the presented work the access to the information sources is made in a unified way using Web-services. Web-services translate information from information sources to the formalism understandable by the DSS. The services acquire information from the information sources and transform it into the values of class attributes of ontology.
RCA: experiences with an IDE annotation tool
Authors: Richard Priest, Beryl Plimmer
Venue: Proceedings of the 7th ACM SIGCHI New Zealand chapter's international conference on Computer-human interaction: design centered HCI (2006)

Ink annotation is a common method for recording feedback on a paper document. However, reviewing code on paper is difficult due to its non-linear nature. This project extends existing research ideas to develop a digital ink annotation tool within an Integrated Development Environment (IDE). The aim is to provide code reviewers with an effective tool for directly commenting on code within the IDE. We describe scenarios where ink annotation would provide benefits, along with requirements and our implementation of the Rich Code Annotation Tool (RCA).
Analysis and reduction of reference frames for motion estimation in MPEG-4 AVC/JVT/H.264
Authors: Yu-Wen Huang, Bing-Yu Hsieh, Tu-Chih Wang, Shao-Yi Chen, Shyh-Yih Ma, Chun-Fu Shen, Liang-Gee Chen
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In the new video coding standard, MPEG-4 AVC/JVT/H.264, motion estimation is allowed to use multiple reference frames. The reference software adopts full search scheme, and the increased computation is in proportion to the number of searched reference frames. However, the reduction of prediction residues is highly dependent on the nature of sequences, not on the number of searched frames. In this paper, we present a method to speed up the matching process for multiple reference frames. For each macroblock, we analyze the available information after intra prediction and motion estimation from previous one frame to determine whether it is necessary to search more frames. The information we use includes selected mode, inter prediction residues, intra prediction residues, and motion vectors. Simulation results show that the proposed algorithm can save up to 90% of unnecessary frames while keeping the average miss rate of optimal frames less than 4%.
Computer support of guided generative learning
Authors: Sean P. Brophy
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

My study explores two aspects of a generative learning environment designed to support problem based instruction in a middle school science classroom. The first relates to sequencing problem solving activities relative to formal instruction of the concepts embedded in problems. The second aspect of the study features a computer environment designed to help students maintain their own inquiry process. Current learning theory stresses the need to encourage students to take an active role in their own learning. Through the guidance of the teacher, students work together to generate an understanding of the formal concepts of science. However, does starting instruction with a problem solving activity provide a context students can use to comprehend lessons containing formally presented scientific concepts? Or, do students require a certain level of prior knowledge before they engage in complex problem solving? Further, how much support do students need to sustain their own inquiry?