ppxscal/embedding_network huggingface dataset:
A Loop Accelerator for Low Power Embedded VLIW Processors
Authors: Binu Mathew, Al Davis
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

The high transistor density afforded by modern VLSI processes have enabled the design of embedded processors that use clustered execution units to deliver high levels of performance. However, delivering data to the execution resources in a timely manner remains a major problem that limits ILP. It is particularly significant for embedded systems where memory and power budgets are limited. A distributed address generation and loop acceleration architecture for VLIW processors is presented. This decentralized on-chip memory architecture uses multiple SRAMs to provide high intra-processor bandwidth. Each SRAM has an associated stream address generator capable of implementing a variety of addressing modes in conjunction with a shared loop accelerator. The architecture is extremely useful for generating application specific embedded processors, particularly for processing input data which is organized as a stream. The idea is evaluated in the context of a fine grain VLIWarchitecture executing complex perception algorithms such as speech and visual feature recognition. Transistor level Spice simulations are used to demonstrate a 159x improvement in the energy delay product when compared to conventional architectures executing the same applications.
DanceAlong: supporting positive social exchange and exercise for the elderly through dance
Authors: Pedram Keyani, Gary Hsieh, Bilge Mutlu, Matthew Easterday, Jodi Forlizzi
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The elderly face serious social, environmental, and physical constraints that impact their well-being. Some of the most serious of these are shrinking social connections, limitations in building new relationships, and diminished health. To address these issues, we have designed an augmented dancing environment that allows elders to select dance sequences from well-known movies and dance along with them. The goal of DanceAlong is twofold: (1) to provide entertainment and exercise for each individual user and (2) to promote social engagement within the group. We deployed DanceAlong in a cultural celebration at a senior community center and conducted evaluations. In this paper, we present the design process of DanceAlong, evaluations of DanceAlong, and design guidelines for creating similar interactive systems for the elderly.
Research and development for seamless mobility
Authors: Vida Ilderem
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Motorola has recently embarked on a corporate vision of Seamless Mobility. Briefly, Seamless Mobility refers to when a user experiences connectivity to anything, anywhere, and anytime. It is uninterrupted easy access to information, entertainment, communication, monitor and control. The elements of Seamless Mobility vision and the implications to the research and development will be reviewed. The role of R&D to successfully deliver a set of solutions for Seamless Mobility will be addressed. 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
A retrieval method of a double array in secondary storage
Authors: Masao Fuketa, Yuichiro Kashiwagi, Shinkaku Kashiji, Kazuhiro Morita, Jun-Ichi Aoe
Venue: Systems and Computers in Japan (2004)

The trie method is widely used as a dictionary retrieval technique in natural language processing, and the double array method is extremely good in terms of high retrieval speed and compactness as a data structure for implementing the trie method. However, although placing the double array in main storage is effective for fast retrieval, the size of the double array increases as the number of storage keys increases. Therefore, in this paper, the authors propose a divided double array method that can execute retrieval efficiently even when using a small main storage area and can also further reduce the amount of storage by dividing the double array and storing it in secondary storage. However, a problem with this technique is that the number of accesses to secondary storage increases because the divided tries must be scanned. To deal with this problem, the authors proposed a technique that reduces the number of times the divided tries are scanned to maintain the fast access speed of the double array. They performed experiments for sets containing from 70,000 to 230,000 keys, and from the results, it was apparent that the number of accesses to secondary storage during retrieval for a single key was less than or equal to 2, and the storage capacity required for the divided tries was reduced by approximately 50&percnt; compared with the undivided trie. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(8): 72&ndash;81, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10481
Expert systems development: some issues of design process
Authors: Mehdi Sagheb-Tehrani
Venue: ACM SIGSOFT Software Engineering Notes (2005)

A discussion is presented of why some Expert Systems (ES) that organizations have developed are not successful. The concept of design process plays a very significant role in the outset of the Expert Systems Development (ESD) process. This concept has not been the subject of much debate and attention in ESD. From the authors' point of view, one of the main issues is how the designer (knowledge Engineer) thinks about the design process. In general, the designers' process is influenced by the knowledge engineer's conception. This paper endeavors to disclose some of the main factors related to knowledge engineer's conception of design process and an attempt is made to put forward a conceptual model of the expert systems' design process. This conceptual model is an initial step towards a successful implementation of ES projects.
AutoPart: parameter-free graph partitioning and outlier detection
Authors: Deepayan Chakrabarti
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Graphs arise in numerous applications, such as the analysis of the Web, router networks, social networks, co-citation graphs, etc. Virtually all the popular methods for analyzing such graphs, for example, k-means clustering, METIS graph partitioning and SVD/PCA, require the user to specify various parameters such as the number of clusters, number of partitions and number of principal components. We propose a novel way to group nodes, using information-theoretic principles to choose both the number of such groups and the mapping from nodes to groups. Our algorithm is completely parameter-free, and also scales practically linearly with the problem size. Further, we propose novel algorithms which use this node group structure to get further insights into the data, by finding outliers and computing distances between groups. Finally, we present experiments on multiple synthetic and real-life datasets, where our methods give excellent, intuitive results.
Signal analysis on strings for immune-type pattern recognition: Conference Reviews
Authors: Nikolaos D. Atreas, Costas Karanikas, Persefoni Polychronidou
Venue: Comparative and Functional Genomics (2004)

We use wavelet-type discrete transforms for signal analysis on strings of finite length. We apply these transforms for edge and hidden Markov process detection. We also present new approaches for string matching and for measures of the diversity of chaotic strings. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Human Readable Genetic Rules for Scene Boundary Detection
Authors: Minaz J. Parmar, Marios C. Angelides
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Genetic programming is based on the Darwinian evolutionary theory that suggests that the best solution for a problem can be evolved by populating the solution space with an initial number of possible solutions and then evolving the solutions by means of mutation, reproduction and crossover until a candidate solution can be found that is close to or is the optimal solution for the problem. The initial solutions are randomly generated and set to a certain population size that the system can compute efficiently. Research has shown that better solutions can be obtained if 1) the population size is increased and 2) if multiple runs are performed of each experiment. If multiple runs are initiated on many machines the probability of finding an optimal solution are increased exponentially and computed more efficiently.
Standards for Second-Generation Portals
Authors: Fernando Bellas
Venue: IEEE Internet Computing (2004)

By integrating applications and resources, portals let users access information in a simple, straightforward manner. Currently, most portals let users create one or more personal pages composed of portlets¿ interactive Web mini-applications. Until recently, no standards for portlets existed, and thus consuming remote portlets in a generic way or deploying portlets in one portal server that were developed in a different one has been impossible. Two standards released in Fall 2003 ¿ the Web Services for Remote Portlets (WSRP) and the Java portlet specification ¿ address these problems.This articles outlines these standards and presents a typical architecture for a standards-based portal.
Information Technology and Historians
Authors: Robin C. D. Mclachlan
Venue: Social Science Computer Review (2005)

This survey reviews uses made of information technology (IT) by historians in Australian universities in their professional work since the early 1980s. Included in the discussion are examples of IT applications in teaching, quantification research, oral and Aboriginal history, collaborative projects with major institutions, professional communication, and research publishing. General observations are also provided on the educational and cultural contexts within which Australian historians work.
Minimum dilation stars
Authors: David Eppstein, Kevin A. Wortman
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

The dilation of a Euclidean graph is defined as the ratio of distance in the graph divided by distance in Rd. In this paper we consider the problem of positioning the root of a star such that the dilation of the resulting star is minimal. We present a deterministic O(n log n)-time algorithm for evaluating the dilation of a given star; a randomized O(n log n) expected-time algorithm for finding an optimal center in Rd; and for the case d = 2, a randomized O(n2α(n) log2n) expected-time algorithm for finding an optimal center among the input points.
SPANIDS: a scalable network intrusion detection loadbalancer
Authors: Lambert Schaelicke, Kyle Wheeler, Curt Freeland
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Network intrusion detection systems (NIDS) are becoming an increasingly important security measure. With rapidly increasing network speeds, the capacity of the NIDS sensor can limit the ability of the system to detect intrusions. The SPANIDS parallel NIDS architecture overcomes this limitation by distributing network traffic load over an array of sensor nodes. Based on a custom hardware load balancer and cost-effective off-the-shelf sensors, the system employs novel stateless load balancing heuristics to thwart scalability limitations. It also uses dynamic feedback from the sensor nodes to adapt to changes in network traffic. This paper describes the overall system architecture, discusses some of the critical design decisions and presents experimental results that demonstrate the performance advantage of this approach
Genericity of an Epidemiological Network for Nephrology and Rheumatology
Authors: A. Simonet, M. Simonet, C-G. Bassolet, S. Ferriol, C. Gueydan, R. Patriarche, HJ. Yu, P. Hao, Y. Liu, W. Zhang, N. Chen, M. Foret, P. Gaudin, M. Ben Said, D. Guillon, P. Landais
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

Most countries face today a growing burden of chronical diseases. In France the Multi-Source Information System MSIS_REIN has been built to collect and analyse epidemiological data about End-Stage Renal Diseases, dialysis andkidney transplant. It enables a better knowledge of the demand and of the needs for care. This system is patient-centred and based on a regional organization. With the support of the European Commission, the actors of the French experiment are setting up a similar system in Shanghai, albeit fully adapted to Chinese medical needs and administrative context. The design and the implementation of the system, named Gennere, have put emphasis on its genericity in order to enable the system to be easily adapted to other chronic diseases and/or other countries. The first experiment deals with two fields: nephrology and rheumatology.
Robot colony power supply: controlled use with PIC chip
Authors: Richard Zbeda
Venue: Journal of Computing Sciences in Colleges (2005)

A robot colony allows the study of member interaction such as cooperation, competition, communication, and predator-prey issues. The task of supplying power to the colony robot is difficult because the robots must be powered in such a way that they can function autonomously. A continuous power supply for colony robots provides the benefit of reduced human intervention. Previous work has been done concerning an optimal implementation of a continuous power supply.
Schedulability-driven frame packing for multicluster distributed embedded systems
Authors: Paul Pop, Petru Eles, Zebo Peng
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2005)

We present an approach to frame packing for multicluster distributed embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways. In our approach, the application messages are packed into frames such that the application is schedulable, thus the end-to-end message communication constraints are satisfied. We have proposed a schedulability analysis for applications consisting of mixed event-triggered and time-triggered processes and messages, and a worst-case queuing delay analysis for the gateways, responsible for routing inter-cluster traffic. Optimization heuristics for frame packing aiming at producing a schedulable system have been proposed. Extensive experiments and a real-life example show the efficiency of our frame-packing approach.
A Programmable Time Measurement Architecture for Embedded Memory Characterization
Authors: Matthew Collins, Bashir M. Al-Hashimi, Neil Ross
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

This paper describes a programmable time measurement architecture that facilitates memory characterization. We have created a novel stand-alone time measurement architecture that can measure rise time, fall time, pulse width and propagation delay time measurements without the need of additional circuitry [1] or circuit duplication [2]. This is achieved by the use of Time-to-Digital Conversion (TDC) based on the dual-slope principle. The key feature of the proposed architecture is programmability through the use of a novel programmable input stage. Furthermore, a current steering Time-to-Voltage Converter (TVC) is used in order to improve the linearity and dynamic range as compared to recent designs. The proposed architecture has been designed using 0.18 µm CMOS process and results from simulations using foundry models suggest it is possible to achieve a timing resolution of 103ps. The measurement core size is 110 µm x 75 µm.
Characterizing antivirus workload execution
Authors: Derek Uluski, Micha Moffie, David Kaeli
Venue: ACM SIGARCH Computer Architecture News (2005)

Despite the pervasive use of anti-virus (AV) software, there has not been a systematic study of the characteristics of the execution of this workload. In this paper we present a characterization of four commonly used anti-virus software packages. Using the Virtutech Simics toolset, we profile the behavior of four popular anti-virus packages as run on an Intel PentiumIV platform running Microsoft Windows-XP.In our study, we focus on the overhead introduced by the anti-virus software during on-access execution. The overhead associated with anti-virus execution can dominate overall performance. The AV-Test group has already reported that this overhead can range from 23-129% on live systems running on-access experiments [3]. 1 The performance impact of the anti-virus execution is clearly an important issue, and we present the first quantitative study of the characteristics of this workload. Our study includes the impact of both operating system execution and system call execution.
Cardinality constrained path covering problems in grid graphs
Venue: Networks (2004)

In this article we continue our study on the complexity of Path Covering Problems started in [2]. Here, taking one further step, we investigate the complexity of the problem on grids. For special classes of grids &lpar;general grids, grids with a fixed number of rows, ladders&rpar;, and several special unweighted path collections &lpar;general paths, paths of length 2, L-shaped paths, pipes, hooks, staples&rpar; we either give polynomial-time algorithms or prove NP-completeness results. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;2&rpar;, 120&ndash;131 2004
A Novel Fingertip Haptic Device for Display of Local Contact Geometry
Authors: G. Cini, A. Frisoli, S. Marcheschi, F. Salsedo, M. Bergamasco
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper presents a new concept of fingertip haptic device for the display of local contact geometry on the userýs fingerpad. We propose an extension of the encountered haptic interface concept [6], in order to build an active haptic thimble, that is portable and can be fixed to the userýs finger. The device is endowed with an actuation system that controls the motion of a platform, that can come in contact with the fingerpad with different orientations and at different fingerpad locations, simulating the contact with a virtual surface. A prototype of the device has been built and tested and is presented throughout the paper.
Bounded Blending for Function-Based Shape Modeling
Authors: Galina I. Pasko, Alexander A. Pasko, Tosiyasu L. Kunii
Venue: IEEE Computer Graphics and Applications (2005)

We propose new analytical formulations of bounded blending operations for the function-based constructive shape modeling. The blending set operations are defined using R-functions and displacement functions with the localized area of influence. The shape and location of the blend is defined by control points on the surfaces of two solids or by an additional arbitrary bounding solid also defined by a real-valued function. The proposed blending using a bounding solid can be applied to a single selected edge, a vertex, or another blend. We introduce new types of blends such as a multiple blend with the disconnected bounding solid and a partial edge blend. We show that the proposed operations can replace pure set-theoretic operations in the solid model without rebuilding the entire construction tree data structure. The proposed blending is shown to have versatile applications in interactive design. Influence of all parameters on the blend shape and location is illustrated.
Selective sweeping
Authors: Yoo C. Chung, Soo-Mook Moon, Kemal Ebcioğlu Dan Sahlin
Venue: Software&mdash;Practice Experience (2005)

Traditional mark and sweep garbage collectors use time proportional to the heap size when sweeping memory, since all objects in the heap, dead or alive, must be traversed. Here we introduce a sweeping algorithm which traverses only the live objects. Since this sweeping algorithm is slower when the heap occupancy is high, we also discuss how to avoid this slowdown by using an adaptive algorithm.
The Interoperability between Different e-Business Specifications
Authors: Peng Liang, Keqing He, Bing Li, Jin Liu
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

The interoperability among the e-Business solutions is the key issue for the implementation of seamless e-Business, and the interoperability of the e-Business solutions are determined bythe e-Business specification on which the e-Business solution are implemented. In this paper, the analysis is performed for the technical architecture comparison between cnXML and ebXML, the de facto e-Business standards in China and worldwide. The interoperability assurance layers between different e-Business specifications are proposed, namely the data layer, the semantic layer and process layer. We focus on the interoperability of data layer, namely the messaging service layer in this research, and through the XML schema comparison between cnMS and ebMS, we propose the interoperability test levels and assurance method for the e-Business messaging service layer.
Path decompositions and Gallai's conjecture
Authors: Genghua Fan
Venue: Journal of Combinatorial Theory Series B (2005)

Let G be a connected simple graph on n vertices. Gallai's conjecture asserts that the edges of G can be decomposed into ⌈n/2⌉ paths. Let H be the subgraph induced by the vertices of even degree in G. Lovász showed that the conjecture is true if H contains at most one vertex. Extending Lovász's result, Pyber proved that the conjecture is true if H is a forest. A forest can be regarded as a graph in which each block is an isolated vertex or a single edge (and so each block has maximum degree at most 1). In this paper, we show that the conjecture is true if H can be obtained from the emptyset by a series of so-defined α-operations. As a corollary, the conjecture is true if each block of H is a triangle-free graph of maximum degree at most 3.
Robust Stopping Criteria for Dykstra's Algorithm
Authors: Ernesto G. Birgin, Marcos Raydan
Venue: SIAM Journal on Scientific Computing (2005)

Dykstra's algorithm is a suitable alternating projection scheme for solving the optimization problem of finding the closest point to one given in the intersection of a finite number of closed and convex sets. It has been recently used in a wide variety of applications. However, in practice, the commonly used stopping criteria are not robust and could stop the iterative process prematurely at a point that does not solve the optimization problem. In this work we present a counterexample to illustrate the weakness of the commonly used criteria, and then we develop robust stopping rules. Additional experimental results are shown to illustrate the advantages of this new stopping criteria, including their associated computational cost.