ppxscal/embedding_network huggingface dataset:
A Heterogeneous Evolutional Architecture for Embedded Software
Authors: Xuejian Luan, Jing Ying, Minghui Wu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

The prosperity of small hardware and embedded system has been leading a large demand of embedded software. The existing widely used methodology of embedded software development can no longer meet the requirements for embedded software with sufficient reliability, stability, modifiability with in a short time. Heterogeneous evolutional architecture for embedded software methodology can help develop better embedded software. The methodology integrates the heterogeneous, evolutional and orthogonal concept as guidelines into the design of embedded software architecture. This methodology is validated by applying it in a project of video on demand set top box's embedded software. And it proves that the methodology has much better performance.
An Old Greek Handwritten OCR System
Authors: K. Ntzios, B. Gatos, I. Pratikakis, T. Konidaris, S. J. Perantonis
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Recognition of handwritten manuscripts is essential for efficient content exploitation of the valuable Old Greek historical collections. In this paper, we focus on the problem of recognizing Old Greek handwritten manuscripts and propose a novel recognition technique that can be applied to a large number of important historical manuscript collections which are written in lower case letters and originate from St. Catherine's Mount Sinai Monastery. Based on an open and closed cavity character representation, we propose a novel, segmentation-free, fast and efficient technique for the detection and recognition of characters and character ligatures. First, we detect open and closed cavities that exist in the skeletonized character body. Then, the recognition of a specific character or character ligature is based on the protrusible segments that appear in the topological description of the character skeletons. Experimental results prove the efficiency of the proposed approach.
An Evaluation of Content Browsing Techniques for Hierarchical Space-Filling Visualizations
Authors: Kang Shi, Pourang Irani, Ben Li
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

Space-filling visualizations, such as the TreeMap, are well-suited for displaying the properties of nodes in hierarchies. To browse the contents of the hierarchy, the primary mode of interaction is by drilling-down through many successive layers. In this paper we introduce a distortion algorithm based on fisheye and continuous zooming techniques for browsing data in the TreeMap representation. The motivation behind the distortion approach is for assisting users to rapidly browse information displayed in the TreeMap without opening successive layers of the hierarchy. Two experiments were conducted to evaluate the new approach. In the first experiment (N=20) the distortion approach is compared to the drill-down method. Results show that subjects are quicker and more accurate in locating targets of interest using the distortion method. The second experiment (N=12) evaluates the effectiveness of the two approaches in a task requiring context, we define as the context browsing task. The results show that subjects are quicker and more accurate in locating targets with the distortion technique in the context browsing task.
Automatic Data-Flow Graph Generation of MPI Programs
Authors: Rafael Ennes Silva, Guilherme Pezzi, Nicolas Maillard, Tiaraju Diverio
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

The Data-Flow Graph (DFG) of a parallel application is frequently used to take scheduling decisions, based on the information that it models (dependencies among the tasks and volume of exchanged data). In the case of MPI-based programs, the DFG may be built at run-time by overloading the data exchange primitives. This article presents a library that enables the generation of the DFG of a MPI program, and its use to analyze the network contention on a test-application: the Linpack benchmark. It is the first step towards automatic mapping of a MPI program on a distributed architecture.
A Discovery Algorithm for Physical Topology in Switched Ethernets
Authors: Yantao Sun, Zhiqiang x. Zhiqiang Shi, Zhimei Wu
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Accurate and up-to-date knowledge of topology serves as the base of a number of network management functions, such as performance monitoring and evaluation, fault detection and location, resource allocation and etc. In the paper, the topology of a Switched Ethernet is abstract to a tree and the relationship between any two network nodes is determined as a lineal connection or collateral connection by aid of a set of theorems. Based on the theorems, a practical algorithm to automatically discover the physical topology of Switched Ethernets is proposed based on the incomplete Address Forwarding Tables (AFTs). As an important part of the Network Management System of Community Broadband Integrated Services Network (CBISNMS), this mechanism is working successfully.
Collaborative distributed decision making for large scale disaster relief operations: Drawing analogies from robust natural systems
Authors: Roberto G. Aldunate, Feniosky Pena-Mora, Gene E. Robinson
Venue: Complexity (2005)

One of the most ignored, but urgent and vital challenges confronting society today is the vulnerability of urban areas to extreme events. Current organization of response systems, predominantly based on a command and control model, limits their effectiveness and efficiency. Particularly, in decision-making processes where a large number of actors may be involved. In this article, a new distributed collaborative decision-making model is proposed to overcome command and control limitations encountered in stressful, hostile, chaotic, and large-scale settings. This model was derived by borrowing concepts from the collective decision making of honeybees foraging, a successful process in solving complex tasks within complex settings. The model introduced in this article was evaluated through differential equations, i.e., continuous analysis, and difference equations, i.e., discrete analysis. The most important result found is that the best available option in any large-scale decision-making problem can be configured as an attractor, in a distributed and timely manner. We suggest that the proposed model has the potential to facilitate decision-making processes in large-scale settings. &copy; 2005 Wiley Periodicals, Inc. Complexity 11:28&ndash;38, 2005
Mosaicing of Microscope Images
Authors: Changming Sun, Richard Beare, Volker Hilsenstein, Paul Jackway
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Image mosaicing has found a number of applications such as panoramic imaging, digital terrain mapping, ophthalmology, and virtual microscopy. In this paper, we present an automated mosaicing technique for generating mosaics from microscope images. We carry out robust image feature matching and global geometric and radiometric parameter estimation. The images are transformed using the estimated parameters and mosaiced together, producing accurate registration of overlapping regions without visible seams.
Positive bias temperature instability in nMOSFETs with ultra-thin Hf-silicate gate dielectrics
Authors: F. Crupi, C. Pace, G. Cocorullo, G. Groeseneken, M. Aoulaiche, M. Houssa
Venue: Microelectronic Engineering (2005)

Positive bias temperature instability (PBTI) in nMOSFETs with ultra thin HfSiON gate dielectrics has been investigated. We propose that PBTI is due to electron trapping in the high-k dielectrics layer and we present results of measurements performed at different bias condition and temperatures consistent with the proposed model. Extrapolated lifetimes indicate that PBTI in HfSiON gate dielectrics severely impacts the reliability of CMOS devices only in the case of Hf rich-layers.
Understanding the Yarowsky Algorithm
Authors: Steven Abney
Venue: Computational Linguistics (2004)

Many problems in computational linguistics are well suited for bootstrapping (semisupervised learning) techniques. The Yarowsky algorithm is a well-known bootstrapping algorithm, but it is not mathematically well understood. This article analyzes it as optimizing an objective function. More specifically, a number of variants of the Yarowsky algorithm (though not the original algorithm itself) are shown to optimize either likelihood or a closely related objective function K.
Biographies
Authors: Thomas Haigh
Venue: IEEE Annals of the History of Computing (2005)

Kenneth Iverson, whose dissatisfaction with conventional mathematical notation as a graduate student led to the development of the APL and J languages, died in Toronto, Ontario on 19 October 2004 in his 84th year. This article reviews his early education, his graduate work at Harvard, and his careers with IBM in the United States and I. P. Sharp in Canada, and his retirement when he developed J, which he considered a modern dialect of APL.
StockMarket Forecasting Using Hidden Markov Model: A New Approach
Authors: Md. Rafiul Hassan, Baikunth Nath
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

This paper presents Hidden Markov Models (HMM) approach for forecasting stock price for interrelated markets. We apply HMM to forecast some of the airlines stock. HMMs have been extensively used for pattern recognition and classification problems because of its proven suitability for modelling dynamic systems. However, using HMM for predicting future events is not straightforward. Here we use only one HMM that is trained on the past dataset of the chosen airlines. The trained HMM is used to search for the variable of interest behavioural data pattern from the past dataset. By interpolating the neighbouring values of these datasets forecasts are prepared. The results obtained using HMM are encouraging and HMM offers a new paradigm for stock market forecasting, an area that has been of much research interest lately.
View-dependent progressive mesh using non-redundant DAG hierarchy
Authors: Zhi Zheng, Tony K. Y. Chan
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

We propose a non-redundant DAG hierarchy for view-dependent multiresolution mesh for client-server based online browsing of triangle mesh models. The multiresolution hierarchy and the selectively refined mesh for rendering are two relatively independent units, analogous to the server and the client. The multiresolution hierarchy, which is a DAG of vertex split operations, encodes all the dependent relationships between the vertex splits, so no extra legality checks on the surrounding neighborhood are required before a refinement or simplification operation. The DAG built by our algorithm has no redundant edges. This property can reduce run-time memory cost and time cost. We present a method to incrementally traverse the DAG as the viewing parameters change, and a mesh updating approach that is convenient for triangle budget control.
Cascade Classifier: Design and Application to Digit Recognition
Authors: Jean Duong, Hubert Emptoz
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

The focus of this paper is on machine learning. More specifically, a classifier combination is proposed. We name it "cascade classifier". Conceptually, this system is based on confusion analysis and local re-training mechanism. We describe its architecture. Experiments with handwritten digit images of the MNIST (Modified NIST) database are presented.
Omnilingual Segmentation-freeWord Spotting for Ancient Manuscripts Indexation
Authors: Yann LEYDIER, Frank Le BOURGEOIS, Hubert EMPTOZ
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This article introduces a new word spotting method designed for ancient manuscripts. We take advantage of the robustness of the gradient feature and propose a new segmentation-free matching algorithm that tolerates spatial variations. We test our algorithm on ancient Latin manuscripts and on George Washington's manuscripts.
Tutorial on petri nets
Authors: Gregory J. D'Angelo
Venue: ACM SIGSIM Simulation Digest (1983)

Petri nets are a flowcharting technique used to model asynchronous and concurrent processes. There have been many articles written on them and various other modifications of the Petri net language. This paper cannot describe all aspects of Petri nets and latter spinoffs in detail, but is intended to give a general overview of their functionality and uses.
Combining Reconstructive and Discriminative Subspace Methods for Robust Classification and Regression by Subsampling
Authors: Sanja Fidler Danijel Skocaj, Ales Leonardis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

Linear subspace methods that provide sufficient reconstruction of the data, such as PCA, offer an efficient way of dealing with missing pixels, outliers, and occlusions that often appear in the visual data. Discriminative methods, such as LDA, which, on the other hand, are better suited for classification tasks, are highly sensitive to corrupted data. We present a theoretical framework for achieving the best of both types of methods: An approach that combines the discrimination power of discriminative methods with the reconstruction property of reconstructive methods which enables one to work on subsets of pixels in images to efficiently detect and reject the outliers. The proposed approach is therefore capable of robust classification with a high-breakdown point. We also show that subspace methods, such as CCA, which are used for solving regression tasks, can be treated in a similar manner. The theoretical results are demonstrated on several computer vision tasks showing that the proposed approach significantly outperforms the standard discriminative methods in the case of missing pixels and images containing occlusions and outliers.
FRES-CAR: An Adaptive Cache Replacement Policy
Authors: George Pallis, Athena Vakali, Eythimis Sidiropoulos
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

Caching Web objects has become a common practice towards improving content delivery and users' servicing. A Web caching framework is characterized by its cache replacement policy, which identifies the objects (i.e. the elements on a Web page, which include text, graphics, and scripts) to be replaced in a cache upon a request arrival. In this paper, we present a cache replacement algorithm (so-called FRES-CAR), which identifies the objects that should be evicted by considering together three important criteria: object's frequency, recency and size. Experimentation under synthetic workloads has shown that FRES-CAR achieves higher hit rates when compared with the most popular and existing algorithms.
A Fast Algorithm for Critical Path Tracing in VLSI Digital Circuits
Authors: Lei Wu, D. M. H. Walker
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

An exact, linear-time critical path tracing algorithm is presented. The performance of critical path tracing is determined primarily by the efficiency of stem analysis. The proposed strategy can determine stem criticality in one pass based on six rules. Experiments on ISCAS85 and ISCAS89 benchmark circuits show that the computation time is nearly linear in the number of nets.
A QoS architecture for MANETs supporting real-time peer-to-peer multimedia applications
Authors: Carlos T. Calafate, Juan-Carlos Cano, Pietro Manzoni, Manuel P. Malumbres
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In this work we propose a QoS architecture for MANETs based on a probe-based distributed admission control mechanism and the IEEE 802.11e technology. Our aim is to improve peer-to-peer communication in wireless mobile ad hoc networks by supporting real-time multimedia streaming. This technology can adapt to applications with bandwidth, delay and jitter constraints, and yet we keep to a minimum the requirements imposed on intermediate stations. Simulation results show that we successfully achieve our goal of supporting QoS-constrained applications in MANETs with a low overhead, confirming the adequateness of using probe-based admission control in these environments.
Reduction of Stability Study of Nonlinear Dynamic Systems by the Second Lyapunov Method
Authors: V. P. Zhukov
Venue: Automation and Remote Control (2005)

Consideration was given to the conditions for reduction of stability study by the second Lyapunov method of the original nonlinear autonomous dynamic system obeying a system of arbitrary-order ordinary differential equations to stability study of a simpler (abridged) dynamic system using the same method. For a wide class of original nonlinear dynamic systems, sufficient reduction conditions for asymptotic stability and instability were presented.
Optimal Loop-Unrolling Mechanisms and Architectural Extensions for an Energy-Efficient Design of Shared Register Files in MPSoCs
Authors: Jose L. Ayala, David Atienza, Marisa Lopez-Vallejo, J. M. Mendias, R. Hermida, C. A. Lopez-Barrio
Venue: Proceedings of the Innovative Architecture on Future Generation High-Performance Processors and Systems (2005)

In this paper we introduce a new hardware/software approach to reduce the energy of the shared register file in upcoming embedded architectures with several VLIW processors. This work includes a set of architectural extensions and special loop unrolling techniques for the compilers of MPSoC platforms. This complete hardware/software support enables reducing the energy consumed in the register file of MPSoC architectures up to a 60% without introducing performance penalties.
Modeling the lines at the gas stations
Authors: Alan M. Schneider, Gregory Papadopoulos
Venue: ACM SIGSIM Simulation Digest (1982)

A simulation model of the gasoline delivery system demonstrates the panic and formation of long lines at service stations. The dynamics of this process are similar to those observed in Southern California in the Spring of 1979.
Hands-On RFID: Wireless Wearables for Detecting Use of Objects
Authors: Kenneth P. Fishkin, Matthai Philipose, Adam Rea
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

Recent research has explored ways to obtain and use knowledge of person-object interactions. We present a novel pair of wearables, a glove and a bracelet, that detect when users interact with unobtrusively tagged objects. The glove can also report whether the grasp was with the palm or the fingertips. Both devices have been built and deployed. We present the requirements, design and early experiences.
Acting as an archivist
Authors: Philip Lelle
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1977)

The Bureau of Labor Statistics' Occupational Wage Survey (BLS/OWS) System has a long history of how it grew from manual to nearly automatic processing procedures. The current version of the Survey collection-to-bulletin publication application is written in COBOL and runs as a batch job in the Departmental Computer Center's (DCC) IBM 360-68. Previous versions had made use of 7074's, 1401's, 650's, et al.. During all of these generations, there were many studies such as Task Force group reports on defining functions and their implementation, given the set of hardware capabilities they had to work with. These reports, memos of Regional Office and Washington discussions of realities and hopes, the ad hoc and preemptory user's broadsides, written up in haste for fielding the software, and the technicalities of Wage Survey operation as defined by BLS, made up the inputs that had to be arranged in the, as-yet, undefined structure. 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
Addressing Queuing Bottlenecks at High Speeds
Authors: Sailesh Kumar, Jonathan Turner, Patrick Crowley
Venue: Proceedings of the 13th Symposium on High Performance Interconnects (2005)

Modern routers and switch fabrics can have hundreds of input and output ports running at up to 10 Gb/s; 40 Gb/s systems are starting to appear. At these rates, the performance of the buffering and queuing subsystem becomes a significant bottleneck. In high performance routers with more than a few queues, packet buffering is typically implemented using DRAM for data storage and a combination of off-chip and on-chip SRAM for storing the linked-list nodes and packet length, and the queue headers, respectively. This paper focuses on the performance bottlenecks associated with the use of off-chip SRAM. We show how the combination of implicit buffer pointers and multi-buffer list nodes can dramatically reduce the impact of buffering and queuing subsystem on queuing performance. We also show how combining it with coarse-grained scheduling can improve the performance of fair queuing algorithms, while also reducing the amount of off-chip memory and bandwidth needed. These techniques can reduce the amount of SRAM needed to hold the list nodes by a factor of 10 at the cost of about 10% wastage of the DRAM space, assuming an aggregation degree of 16.
Secure Cross-Domain Positioning Architecture for Autonomic Systems
Authors: Tom Pfeifer
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Positioning, as one of the prime components of Context, has been a driving factor in the development of ubiquitous computing applications throughout the past two decades. Based on the Redundant Positioning architecture, this paper discusses the issues of exchanging positioning data between applications and between different administrative domains, with a focus on implementing security and privacy concepts in a self-learning and self-adapting autonomic systems environment.
Genetic Programming with a Genetic Algorithm for Feature Construction and Selection
Authors: Matthew G. Smith, Larry Bull
Venue: Genetic Programming and Evolvable Machines (2005)

The use of machine learning techniques to automatically analyse data for information is becoming increasingly widespread. In this paper we primarily examine the use of Genetic Programming and a Genetic Algorithm to pre-process data before it is classified using the C4.5 decision tree learning algorithm. Genetic Programming is used to construct new features from those available in the data, a potentially significant process for data mining since it gives consideration to hidden relationships between features. A Genetic Algorithm is used to determine which such features are the most predictive. Using ten well-known datasets we show that our approach, in comparison to C4.5 alone, provides marked improvement in a number of cases. We then examine its use with other well-known machine learning techniques.
An analysis of the witty outbreak: exploiting underlying structure for detailed reconstruction of an internet-scale event
Authors: Vern Paxson
Venue: Proceedings of the 2005 ACM workshop on Rapid malcode (2005)

In this talk we discuss an analysis of the propagation in March 2004 of the "Witty" worm, which infected more than 12,000 hosts worldwide in 75 minutes. We show that by carefully exploiting the structure of the worm, especially its pseudo-random number generation, from limited and imperfect telescope data we can recover a wealth of information with high fidelity. The corresponding paper, coauthored with Abhishek Kumar and Nicholas Weaver, appears in the Proceedings of the 2005 ACM Internet Measurement Conference.