ppxscal/embedding_network huggingface dataset:
Operation chaining asynchronous pipelined circuits
Authors: Girish Venkataramani, Seth C. Goldstein
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

We define operation chaining (op-chaining) as an optimization problem to determine the optimal pipeline depth for balancing performance against energy demands in pipelined asynchronous designs. Since there are no clock period requirements, asynchronous pipeline stages can have non-uniform latencies. We exploit this fact to coalesce several stages together thereby saving power and area due to the elimination of control-path resources from the pipeline. The trade-off is potentially reduced pipeline parallelism. In this paper, we formally define this optimization as a graph covering problem, which finds sub-graphs that will be synthesized as an opchained pipeline stage. We then define the solution space for provably correct solutions and present an algorithm to efficiently search this space. The search technique partitions the graph based on post-dominator relationships to find sub-graphs that are potential op-chain candidates. We use knowledge of the Global Critical Path (GCP) [13] to evaluate the performance impact of accepting a candidate sub-graph and formulate a heuristic cost function to model this trade-off. The algorithm has a quadratic-time complexity in the size of the dataflow graph. We have implemented this algorithm within an automated asynchronous synthesis toolchain [12]. Experimental evidence from applying the algorithm on several media processing kernels reveals that the average energy-delay and energy-delay-area products improve by about 1.4x and 1.8x respectively, with a maximum improvement of 5x and 18x.
Voronoi-based adaptive scalable transfer revisited: gain and loss of a Voronoi-based peer-to-peer approach for MMOG
Authors: Helge Backhaus, Stefan Krause
Venue: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games (2007)

We present and evaluate an implementation of VAST (Voronoi-based Adaptive Scalable Transfer) as proposed by Shun-Yun Hu and Guan-Ming Liao in Scalable Peer-to-Peer Networked Virtual Environment [4]. VAST is a fully-distributed peer-to-peer protocol, designed to handle event messages in MMOGs (Massively Multiplayer Online Games) and virtual worlds. VAST relies on voronoi diagrams and AOI (Areas Of Interest) for neighbor discovery. Benefits and problems of using voronoi diagrams in peer-to-peer-based MMOGs and virtual worlds are discussed, by looking at bandwidth usage, scalability and consistency of VAST and comparing it to other approaches. We point out certain issues regarding VASTs consistency and propose some changes to VASTs architecture aiming at enhancing its consistency. Finally we have a look at future extensions like group management and adaptive areas of interest per peer, in order to reduce bandwidth requirements and further increase VASTs consistency.
A Hybrid Evidence-Genetic Method for the Identification of Multiple Structural Damages
Authors: Huiyong Guo, Zhengliang Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

A hybrid evidence-genetic method of determining the location and extent of multiple structural damages by using genetic algorithms is presented. The method makes use of the combination information of natural frequencies and mode shapes. First the damage detection strategy is to localize the damage sites by using an evidence theory, which can perfectly integrate the damage identification information coming from both natural frequencies and mode shapes; then, an improved genetic algorithm is proposed to determine the damage extent. A cantilever beam is analyzed as a numerical example to compare the performance of the proposed method with other methods. Simulation results show that identification results of the evidence theory are better than those both of the frequency MDLAC method and the mode shape MDLAC method, and the improved genetic algorithm is also more accurate and effective than the simple genetic algorithms. Therefore, the hybrid evidence-genetic method is very effective for the identification of multiple structural damages.
RAM-based fault tolerant state machines for FPGAs
Authors: Laura Frigerio, Fabio Salice
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

This paper presents a solution to protect FSM implemented on FPGAs from SEU, exploiting the embedded memories available in modern FPGA devices and a Hamming code for error detection and correction. A fault tolerant FSM architecture is presented, along with a generator to automate the FSM implementation. Experimental results show that this solution is particularly suited especially when FSMs with a large number of outputs are present in the target design.
A Taxonomy of Information Security for Service-Centric Systems
Authors: Pekka Savolainen, Eila Niemela, Reijo Savola
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Pervasive communications and the rapid expansion of Internet trigger a myriad of concerns about trust and information security. Moreover, composing software from components and services, originating from diverse sources, without a thorough quality assurance practices may expose serious weaknesses that open up the systems for malicious attacks and misuse. In order to guarantee the security of the systems we need a uniform understanding about what security is and how to measure it. This paper introduces a taxonomy of information security, intended for the use of software architects of servicecentric systems. The security taxonomy extends our quality oriented architecting environment (QoAE)an integrated tool environment for defining quality ontologies, describing the quality properties of service architectures, and analyzing quality requirement satisfaction at the level of proposed architecture.
An Analytical Approach to Probability of Outage Evaluation in Gamma Shadowed Nakagami-m and Rice Fading Channel
Authors: Mesud Hadzialic, Sulejman Colo, Anida Sarajlic
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

In this paper a unified analytical approach to performance analyses in gamma shadowed Nakagamim and Rice fading channel is presented. Instead of lognormal probability density function (PDF), gamma PDF is used for shadowing while multipath fading is represented with Nakagami-m and Rice distributions. A mathematical framework is developed for deriving key statistical parameters such as PDFs of signal to noise ratio(SNR) and signal to interference ratio (SIR) of several special scenarios in mobile channel as well as performance metrics including outage probability. In this way, one can conclude that presented results are reliable for lognormal shadowing spread \le 9dB (note that, the shadowing spread actually observed in macro-cells has a typical value that lies between 4 and 9 dB). The final results are remarkably simple and can serve as a quick way of assessing performance. In addition, presented analytical expressions are suitable for the asymptotic analyses, which is significant feature for both theoretical and practical aspect of theirs applications.
Visual exploration and analysis of historic hotel visits
Authors: Chris Weaver, David Fyfe, Anthony Robinson, Deryck Holdsworth, Donna Peuquet, Alan M. MacEachren
Venue: Information Visualization (2007)

Understanding the spatial and temporal characteristics of individual and group behavior in social networks is a critical component of visual tools for intelligence analysis, emergency management, consumer analysis, and human geography. Identification and analysis of patterns of recurring events is an essential feature of such tools. In this paper, we describe an interactive visual tool for exploring the visitation patterns of guests at two hotels in central Pennsylvania from 1894 to 1900. The centerpiece of the tool is a wrapping spreadsheet technique, called reruns, that reveals regular and irregular periodic patterns of events in multiple overlapping artificial and natural calendars. Implemented as a coordinated multiple view visualization in Improvise, the tool is in ongoing development through an iterative process of data collection, transcription, hypothesis, design, discovery, analysis, and evaluation in close collaboration with historical geographers. Numerous discoveries have driven additional data collection from archival newspaper and census sources, as well as plans to enhance analysis of spatial patterns using historic weather records and railroad schedules. Distributed online evaluations of usability and usefulness have resulted in feature and design recommendations that are being incorporated into the tool.
Exploiting web 2.0 forallknowledge-based information retrieval
Authors: David N. Milne
Venue: Proceedings of the ACM first Ph.D. workshop in CIKM (2007)

This paper describes ongoing research into obtaining and using knowledge bases to assist information retrieval. These structures are prohibitively expensive to obtain manually, yet automatic approaches have been researched for decades with limited success. This research investigates a potential shortcut: a way to provide knowledge bases automatically, without expecting computers to replace expert human indexers. Instead we aim to replace the professionals with thousands or even millions of amateurs: with the growing community of contributors who form the core of Web 2.0. Specifically we focus on Wikipedia, which represents a rich tapestry of topics and semantics and a huge investment of human effort and judgment. We show how this can be directly exploited to provide manually-defined yet inexpensive knowledge-bases that are specifically tailored to expose the topics, terminology and semantics of individual document collections. We are also concerned with how best to make these structures available to users, and aim to produce a complete knowledge-based retrieval system-both the knowledge base and the tools to apply it-that can be evaluated by how well it assists real users in performing realistic and practical information retrieval tasks. To this end we have developed Koru, a new search engine that offers concrete evidence of the effectiveness of our Web 2.0 based techniques for assisting information retrieval.
Testbed Experiments of Dynamic Survivable Resource Pooling Using FPGA-Based Robot
Authors: I. Hkelek, J. Zou, M. Uyar, A. Abdelal, J. Xiao, N. Chakravarthy, M. A. Fecko, S. Samtani
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

Dynamic Survivable Resource Pooling (DSRP) is a new mechanism to improve the survivability and reliability in distributed wireless mobile robotics systems. DSRP is based on a virtual backbone, which is a highly distributed, scalable, and survivable network, formed and maintained through one-hop beacons among mobile robots. We im- plement the DSRP mechanism in our FPGA-based dis- tributed robotics testbed and demonstrate its effectiveness in a search-and-rescue scenario, where robots cooperate to provide the rescuer with a set of pictures to build a panoramic view of the disaster site. The current testbed implementation at the City College of the City University of New York includes a total of 22 nodes emulating real- life mobile robots, where 2 nodes are FPGA boards and the remaining ones are laptop and desktop PCs. The mea- surements collected from the testbed confirm that the DSRP framework significantly improve the system reliability and survivability.
An Interactive Computer Graphics Language for the Design and Simulation of Digital Systems
Authors: S. S. Ching
Venue: Computer (1977)

Many computer hardware description languages have been introduced to describe and model digital networks at the register transfer level.1-3Most CHDL's, however, like common programming languages, are "text oriented" and employ textual statements in the specification of a digital system. The process of converting a word statement problem into a description written in a design language is often tedious, especially when the design is complex. Many designers overcome this difficulty by "drawing" register layouts and control sequence or state diagrams for a design before hand-translating them into a specification in an appropriate design language. With the reduction in the costs of on-line computing and graphic terminals, this approach can be used early in the computer-aided-design cycle. This has in fact been accomplished at the University of Missouri-Rolla, where a graphic language called FLOWWARE has been developed to allow digital networks to be specified pictorially.
Merging the results of approximate match operations
Authors: Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Srivastava
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relational tuple or tuples that are "most related" to a given query tuple. Various techniques have been proposed in the literature for efficiently identifying approximate matches to a query string against a single attribute of a relation. In addition to constructing a ranking (i.e., ordering) of these matches, the techniques often associate, with each match, scores that quantify the extent of the match. Since multiple attributes could exist in the query tuple, issuing approximate match operations for each of them separately will effectively create a number of ranked lists of the relation tuples. Merging these lists to identify a final ranking and scoring, and returning the top-K tuples, is a challenging task. In this paper, we adapt the well-known footrule distance (for merging ranked lists) to effectively deal with scores. We study efficient algorithms to merge rankings, and produce the top-K tuples, in a declarative way. Since techniques for approximately matching a query string against a single attribute in a relation are typically best deployed in a database, we introduce and describe two novel algorithms for this problem and we provide SQL specifications for them. Our experimental case study, using real application data along with a realization of our proposed techniques on a commercial data base system, highlights the benefits of the proposed algorithms and attests to the overall effectiveness and practicality of our approach.
Neighborhood classifiers
Authors: Qinghua Hu, Daren Yu, Zongxia Xie
Venue: Expert Systems with Applications: An International Journal (2008)

K nearest neighbor classifier (K-NN) is widely discussed and applied in pattern recognition and machine learning, however, as a similar lazy classifier using local information for recognizing a new test, neighborhood classifier, few literatures are reported on. In this paper, we introduce neighborhood rough set model as a uniform framework to understand and implement neighborhood classifiers. This algorithm integrates attribute reduction technique with classification learning. We study the influence of the three norms on attribute reduction and classification, and compare neighborhood classifier with KNN, CART and SVM. The experimental results show that neighborhood-based feature selection algorithm is able to delete most of the redundant and irrelevant features. The classification accuracies based on neighborhood classifier is superior to K-NN, CART in original feature spaces and reduced feature subspaces, and a little weaker than SVM.
Hard-Fault Detection and Diagnosis During the Application of Model-Based Data Converter Testing
Authors: Carsten Wegener, Michael Peter Kennedy
Venue: Journal of Electronic Testing: Theory and Applications (2007)

The concept of model-based test was developed in order to reduce the production test effort for data converters (Cherubal and Chatterjee (IEEE Trans Circuits Syst part I 50(3):317---327, 2003); Stenbakken and Souders (1985) Modelling and test point selection for data converter testing. In: ITC, Int Test Conf, pp 813---817; Wegener and Kennedy (IEEE Trans Circuits Syst I 51(1):213---217, 2004); Wrixon and Kennedy (IEEE Trans Instrum Meas IM-48(5):978---985, 1999)). In applying this concept, a vector of model parameters is determined for each device under test (DUT). Typically, this model parameter vector is merely used to calculate the DUT performance characteristic which is then subject to specification-oriented testing. However, each element of the model parameter vector represents an independent error source which contributes to performance degradations; thus, the model parameter vector can be viewed as a signature of the error sources. In this work, analyzing the error source signature is used to devise a model-based methodology for hard-fault detection and diagnosis. We investigate conditions under which hard-faults are detectable/diagnosable in spite of masking effects due to manufacturing process variations. In particular, we show that taking the model parameter vector as the fault signature is optimal as it minimizes the masking effects and thus maximizes detectability/diagnosibility.
Particle Swarm Optimization of Neural Network Architectures andWeights
Authors: Marcio Carvalho, Teresa B. Ludermir
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

The optimization of architecture and weights of feed forward neural networks is a complex task of great importance in problems of supervised learning. In this work we analyze the use of the Particle Swarm Optimization algorithm for the optimization of neural network architectures and weights aiming better generalization performances through the creation of a compromise between low architectural complexity and low training errors. For evaluating these algorithms we apply them to benchmark classification problems of the medical field. The results showed that a PSOPSO based approach represents a valid alternative to optimize weights and architectures of MLP neural networks.
Improved Fuzzy Inference Network and Its Applications in Multi-targets Optimization of the High-Rise Structure Form Selection
Authors: Shihai Zhang, Shujun Liu, Jinping Ou, Guangyuan Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Firstly, two kinds of improved weighted fuzzy inference networks were established, namely the multi output multi input (MIMO) one and the multi input single output (MISO) one. The newly built networks share common merits with the weighted fuzzy evaluation method, the fuzzy inference method and the traditional fuzzy inference method, laying foundation for highly and effectively expressing, memorizing and utilizing the domain experts' knowledge and strategies used in form selection. Then, two kinds of multi-target high-rise structure form selection optimization methods were established based on the improved fuzzy inference network and the fuzzy comprehensive evaluation model; and a comparison of characteristics was made between the two kinds of multi-targets optimization models: Both of them can directly and effectively solve the form selection optimization problem for the multi-target and multi layer structures. Moreover, the reasoning process of the first model can produce clearer and more concrete results, and the reasoning process of the second model is simpler. And it has been proven that the results of the models have the same conclusion. Finally, a project example was given, which proved that the methods can meet the needs and the optimization process better resembles people's habits, experience and strategies in form selection.
Correction to "Fault-Tolerant Multiprocessor Link and Bus Architectures"
Authors: D. K. Pradhan
Venue: IEEE Transactions on Computers (1986)

In the above paper1 the following typographical errors should be corrected. 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
Designing Extensible Classes
Authors: Rebecca J. Wirfs-Brock
Venue: IEEE Software (2007)

Building clean abstractions with clearly defined extension points is satisfying, but the best design choice isn't always obvious. How much access should you give a subclass to a class's inner workings? How much freedom should you give a subclass designer to "bend" inherited behaviors to make a new abstraction fit in or to extend an existing one? These decisions involve nuanced reasoning. The contract between a class and its subclasses requires thoughtful design, experimentation, and careful specification.
A Dual Mode Human-Robot Teleoperation Interface Based on Airflow in the Aural Cavity
Authors: Ravi Vaidyanathan, Monique P. Fargues, R. Serdar Kurcan, Lalit Gupta, Srinivas Kota, Roger D. Quinn, Dong Lin
Venue: International Journal of Robotics Research (2007)

Robot teleoperation systems have been limited in their utility due to the need for operator motion, lack of portability and limitation to singular input modalities. In this article, the design and construction of a dual-mode human&#x2014;machine interface system for robot teleoperation addressing all these issues is presented. The interface is capable of directing robotic devices in response to tongue movement and/or speech without insertion of any device in the vicinity of the oral cavity. The interface is centered on the unique properties of the human ear as an acoustic output device. Specifically, we present: (1) an analysis of the sensitivity of human ear canals as acoustic output device; (2) the design of a new sensor for monitoring airflow in the aural canal; (3) pattern recognition procedures for recognition of both speech and tongue movement by monitoring aural flow across several human test subjects; and (4) a conceptual design and simulation of the machine interface system. We believe this work will lay the foundation for a new generation of human machine interface systems for all manner of robotic applications.
An Inverted File Processor for Information Retrieval
Authors: W. H. Stellhorn
Venue: IEEE Transactions on Computers (1977)

Response time in large, inverted file document retrieval systems is determined primarily by the time required to access files of document identifiers on disk and perform the processing associated with a Boolean search request. This paper describes a specialized computer system capable of performing these functions in hardware. Using this equipment, a complicated sample search involving 70 terms and over 67 000 document references can be performed from 13 to 60 times faster than with a conventional machine. Alternatively, many small searches can be processed concurrently with little effect upon system performance. Similar configurations can be applied to standard merging and sorting problems.
Grids Enter a New Generation
Authors: Rita Pužmanová
Venue: IEEE Distributed Systems Online (2007)

A review of Future Generation Grids, Vladimir Getov, Domenico Laforenza, and Alexander Reinefeld, eds.