ppxscal/embedding_network huggingface dataset:
An Efficient Word Segmentation Technique for Historical and Degraded Machine-Printed Documents
Authors: M. Makridis, N. Nikolaou, B. Gatos
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

Word segmentation is a crucial step for segmentation-free document analysis systems and is used for creating an index based on word matching. In this paper, we propose a novel methodology for word segmentation in historical and degraded machine- printed documents. The proposed technique faces problems such as having text of different size, having text and non-text areas lying very near and having non-straight and warped text lines. It is based on: (i) a dynamic run length smoothing algorithm that helps grouping together homogeneous text regions, (ii) noise and punctuation marks removal as well as on obstacle detection in order to facilitate the segmentation process and (iv) a draft text line estimation procedure that guides the final word segmentation result. After testing on numerous historical and degraded machine- printed documents, it has turned out that our methodology performs better compared to current state-of-the-art word segmentation techniques for historical and degraded machine-printed documents.
MeT: a real world oriented metadata management system for semantic sensor networks
Authors: Hideyuki Kawashima, Yutaka Hirota, Satoru Satake, Michita Imai
Venue: Proceedings of the 3rd workshop on Data management for sensor networks: in conjunction with VLDB 2006 (2006)

A semantic sensor network describes the physical world using the metadata obtained from a sensor network. In this paper, we present our design and implementation of MeT, a real world oriented metadata management system for semantic sensor networks. MeT generates metadata either statically based on the application semantics, or dynamically using inference rules. It then constructs relationships between physical objects through these metadata. The sensor devices in MeT include RFID tags, position sensors and Motes. The users can query MeT about physical objects through either a Graphic User Interace, or Robovie, a communication robot. We give several concrete examples of querying physical objects in MeT to demonstrate the functionality of our system.
Streets of Byzantium: Network Architectures for Fast Reliable Broadcasts
Authors: O. Babaoglu
Venue: IEEE Transactions on Software Engineering (1985)

A site broadcasting its local value to all other sites ina fault-prone environment is a fundamental paradigm in constructing reliable distributed systems. Time complexity lower bounds and network connectivity requirements for reliable broadcast protocols in point-to-point communication networks are well known. In this paper, we consider the reliable broadcast problem in distributed systems with broadcast networks (for example, Ethernets) as the basic communication architecture. We show how properties of such network architectures can be used to effectively restrict the externally visible behavior of faulty processors. We use these techniques to derive simple protocols that implement reliable broadcast in only two rounds, independent of the failure upper bounds.
Command and control of automated subway in mode of disrupted march using fuzzy logic
Authors: E. Bailly, S. Hayat, D. Jolly, A. M. Desodt
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

After a description of the regulation of the subway of Lille called VAL, we introduce a new model of regulation of line of subway based on fuzzy logic. This model takes in account, so as to regulate one train, not only its delay but also the delay of upstream and downstream trains. In a second time, to avoid the stacking of trains stopped in anticollision behind a disrupted train, we calculate indices of risk and no risk of blocking of the train between two stations based on the time of course between the trains and on the estimate of duration of the train's disruption. The computation of risk can be done during a disruption intervening on the line and be extended in computing this index at each departure of one train from a station. We have simulated and tested our algorithm with the help of a simulation of subway's line achieved in object oriented language.
Children observation support system using multiple cameras COSS-MC
Authors: Maki Hirano, Kimio Shintani, Hiroaki Nakao, Satoshi Ohta, Shigeo Kaneda, Hirohide Haga
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

In this article, a children observation support system using multiple cameras, named COSS-MC, is proposed. The purpose of COSS-MC is to observe children in kindergartens and nursery schools. COSS-MC uses multiple video recorders. Each recorder records the children's environment from one direction. Furthermore, all cameras record motion pictures simultaneously. After recording, schoolteachers can select appropriate segments and build one streaming video for each child. COSS-MC consists of three main parts: the capturing part, which captures the motion picture and records the time and camera ID of the capturing operation; the editing part, which edits the sequences of motion pictures and builds one streaming video title; and the distribution part, which distributes the edited video stream on the Internet. We have finished developing a prototype of COSS-MC on a Linux operating system. An electronic bulletin board system (BBS) is combined with the video stream in COSS-MC.
A robust finite-point based gate model considering process variations
Authors: Alex Mitev, Dinesh Ganesan, Dheepan Shanmugasundaram, Yu Cao, Janet M. Wang
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

This paper proposes a robust gate model based on a finite-point modeling scheme. With current source model (CSM) framework, a robust, finite-point gate model is constructed. The new model depends on the selective points of I-V curves of gates. Thus, it implicitly incorporates the variation related parameters into finite points. In addition, to provide good accuracy on output waveform, the new model creates the input and output capacitance elements as nonlinear dependency on input/output waveform and process variation parameters. Experimental results show that the generated gate model has less than 3.7% error at mean, less than 6.2% error at variance and less than 5.8% at 90% percentile for cumulative density functions (CDFs).
Scented Widgets: Improving Navigation Cues with Embedded Visualizations
Authors: Wesley Willett Jeffrey Heer, Maneesh Agrawala
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

This paper presents scented widgets, graphical user interface controls enhanced with embedded visualizations that facilitate navigation in information spaces. We describe design guidelines for adding visual cues to common user interface widgets such as radio buttons, sliders, and combo boxes and contribute a general software framework for applying scented widgets within applications with minimal modifications to existing source code. We provide a number of example applications and describe a controlled experiment which finds that users exploring unfamiliar data make up to twice as many unique discoveries using widgets imbued with social navigation data. However, these differences equalize as familiarity with the data increases.
A summability factor theorem involving an almost increasing sequence for generalized absolute summability
Authors: Ekrem Savaş
Venue: Computers Mathematics with Applications (2007)

In this paper we prove a general theorem on |A;@d|"k-summability factors of infinite series under suitable conditions by using an almost increasing sequence, where A is a lower triangular matrix with non-negative entries. Also, we deduce a similar result for the weighted mean method.
Multi-modal non-rigid registration of medical images based on mutual information maximization
Authors: Edoardo Ardizzone, Orazio Gambino, Marco La Cascia, Liliana Lo Presti, Roberto Pirrone
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this paper, a new multi-modal non-rigid registration technique for medical images is presented. Firstly, the registration problem is outlined and some of the most common approaches reported, then, the proposed algorithm is presented. The proposed technique is based on mutual information maximization and computes a deformation field through a suitable globally smoothed affine piecewise transformation. The algorithm has been conceived with particular attention to computational load and accuracy of results. Experimental results involving intra-patient, inter-patients and atlas images on brain CT and MR (T1, T2 and PD modalities) are reported.
Transactional evaluation: assessing human interactions during program development
Authors: Robert J. Seidel
Venue: ACM SIGCUE Outlook (1978)

Evaluation in educational R&D programs seems to wear many hats. There is the goal-free approach of Scriven (1974), responsive evaluation of Stake (1967) and Evers (1975), standard goal-based evaluation techniques (summarized by Stufflebeam, et al., 1971), etc. All of these evaluation techniques or models have one attribute in common. They all focus on the object of the innovation, whether it be change in process of learning by the student, or attaining of mastery of new objectives, or affective movement, etc. What seems to be missing from these approaches to evaluation of programs, and what transactional evaluation seems to provide an answer to--is a focus on the inter-personal effects of the perceptions of project team members and the people in the surrounding environment where the implementation or experimentation is taking place (see for example, Seidel, et al., 1974; Hunter, et al., 1975).
The use of the distributional Little's law in the computational analysis of discrete-time GI/G/1 and GI/D/c queues
Authors: Nam K. Kim, Mohan L. Chaudhry
Venue: Performance Evaluation (2008)

In this paper, we first establish a discrete-time version of what is called the distributional Little's law, a relation between the stationary distributions of the number of customers in a system (or queue length) and the number of slots a customer spends in that system (or waiting time). Based on this relation, we then present a simple computational procedure to obtain the queue-length distribution of the discrete-time GI/G/1 queue from its waiting-time distribution, which is readily available by various existing methods. Using the same procedure, we also obtain the queue-length distribution of the discrete-time multi-server GI/D/c queue in a unified manner. Sample numerical examples are also given.
Programming environments
Authors: John Foderaro
Venue: ACM SIGPLAN Lisp Pointers (1987)

We continue our survey of Common Lisps with a report on the environment of Extended Common Lisp from Franz Inc. of Berkeley, California. Our previous surveys were for Lisps on dedicated Lisp Machines. Extended Common Lisp is designed for general purpose machines. I wish to thank David Margolies of Franz Inc. for completing the survey. 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
Patent surrogate extraction and evaluation in the context of patent mapping
Authors: Yuen-Hsien Tseng, Yeong-Ming Wang, Yu-I Lin, Chi-Jen Lin, Dai-Wei Juang
Venue: Journal of Information Science (2007)

Patent documents contain important research results. They are often collectively analyzed and organized in a visual way to support decision making. However, they are lengthy and rich in technical terminology, and thus require a lot of human effort for analysis. Automatic tools for assisting patent engineers or decision makers in patent analysis are in great demand. This paper describes a summarization method for patent surrogate extraction, intended to efficiently and effectively support patent mapping, which is an important subtask of patent analysis. Six patent maps were used to evaluate its relative usefulness. The experimental results confirm that the machine generated summaries do preserve more important content words than some other patent sections or even than the full patent texts when only a few terms are to be considered for classification and mapping. The implication is that if one were to determine a patent's category based on only a few terms at a quick pace, one could begin by reading the section summaries generated automatically.
Multi-criteria optimization in nonlinear predictive control
Authors: Kaouther Laabidi, Faouzi Bouani, Mekki Ksouri
Venue: Mathematics and Computers in Simulation (2008)

The multi-criteria predictive control of nonlinear dynamical systems based on Artificial Neural Networks (ANNs) and genetic algorithms (GAs) are considered. The (ANNs) are used to determine process models at each operating level; the control action is provided by minimizing a set of control objective which is function of the future prediction output and the future control actions in tacking in account constraints in input signal. An aggregative method based on the Non-dominated Sorting Genetic Algorithm (NSGA) is applied to solve the multi-criteria optimization problem. The results obtained with the proposed control scheme are compared in simulation to those obtained with the multi-model control approach.
An audit trail service to enhance privacy compliance in federated identity management
Authors: Liam Peyton, Chintan Doshi, Pierre Seguin
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

Federated identity management systems, such as the Liberty Alliance framework, are intended to protect identity and control access to personal information. An audit trail service has been proposed as an addition to the framework to address potential privacy breaches. A simple scenario is used to analyze what should be logged to an audit trail and how it should be logged in order to address privacy concerns and comply with privacy legislation. The implementation of an audit trail service conforming to the Liberty Alliance data service template is described. Our research to date has achieved results which show promise in terms of having a scalable solution that conforms to Liberty Alliance specifications and protects the user's identity while providing a consolidated view of the data sharing activities associated with their personal information.
Introduction
Authors: Samir Khuller
Venue: ACM SIGACT News (2007)

This issue's column is written by guest columnist, Chandra Chekuri. I am delighted that he agreed to write this column on a topic related to robust network design that has received considerable attention recently. His column introduces the reader to several recent results and provides references for further readings.
A static compliance-checking framework for business process models
Authors: Y. Liu, S. Müller, K. Xu
Venue: IBM Systems Journal (2007)

Regulatory compliance of business operations is a critical problem for enterprises. As enterprises increasingly use business process management systems to automate their business processes, technologies to automatically check the compliance of process models against compliance rules are becoming important. In this paper, we present a method to improve the reliability and minimize the risk of failure of business process management systems from a compliance perspective. The proposed method allows separate modeling of both process models and compliance concerns. Business process models expressed in the Business Process Execution Language are transformed into pi-calculus and then into finite state machines. Compliance rules captured in the graphical Business Property Specification Language are translated into linear temporal logic. Thus, process models can be verified against these compliance rules by means of model-checking technology. The benefit of our method is threefold: Through the automated verification of a large set of business process models, our approach increases deployment efficiency and lowers the risk of installing noncompliant processes; it reduces the cost associated with inspecting business process models for compliance; and compliance checking may ensure compliance of new process models before their execution and thereby increase the reliability of business operations in general.
Application of Adaptive Kernel Matching Pursuit to Estimate Mixture Pixel Proportion
Authors: Wu Bo, Wang XiaoQin, Huang Bo
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

An adaptive kernel matching pursuit (AKMP) algorithm to estimate mixture pixel proportion of remotely sensed image has been proposed. The AKMP algorithm applies greedy sparse approximation algorithm to the feature space induced by a nonlinear kernel function, and can therefore be able to capture nonlinear effects of image and performed better than conventional linear approaches. Moreover, it has the capability of adaptive selection of the kernel parameter before starting the greedy approximating procedure to avoid complex procedures of kernel function parameter selection. Experiments with ETM+ associated with IKONOS image have been carried out, and the result demonstrates that the proposed method can provide accurate proportion estimation. Comparisons with support vector regression (SVR) and linear mixture model (LMM) have also been done, and the experiments show that the proposed method outperform SVR and LMM in terms of RMSE.
Acoustic sensor networks for environmental monitoring
Authors: Jinhai Cai, Dominic Ee, Andy Lau, Richard Mason, Binh Pham, Paul Roe, Jinglan Zhang, Stuart Gage
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

In this demonstration, we will show how smartphones can be used as a platform for monitoring environmental change, particularly with respect to birdlife. We have researched and implemented a platform using Microsoft smartphones for remotely monitoring birds. The platform comprises smart-phones running a custom application for recording bird song. The application manages sensors in an autonomic fashion to ensure that they operate reliably for long periods of time in a power efficient manner.
COBRA: An Adaptive Runtime Binary Optimization Framework for Multithreaded Applications
Authors: Jinpyo Kim, Wei-Chung Hsu, Pen-Chung Yew
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

This paper presents COBRA (Continuous Binary Re- Adaptation), a runtime binary optimization framework, for multithreaded applications. It is currently implemented on Itanium 2 based SMP and cc-NUMA systems. Using OpenMP NAS parallel benchmark, we show how COBRA can adaptively choose appropriate optimizations according to observed changing runtime program behavior. Coherent cache misses caused by true/false data sharing often limit the scalability of multithreaded applications. This paper shows that COBRA can significantly improve the performance of some applications parallelized with OpenMP, by reducing the aggressiveness of data prefetching and by using exclusive hints for prefetch instructions. For example, we show that COBRA can improve the performance of OpenMP NAS parallel benchmarks up to 68%, with an average of 17.5% on the SGI Altix cc-NUMA system.
Special Feature Zork: A Computerized Fantasy Simulation Game
Authors: P. D. Lebling
Venue: Computer (1979)

Is magic real? Do swords glow if the enemy is nearby? In the demonic world of Zork, a simulated universe entices the player into a new form of problem solving.
Real-Time Loop Scheduling with Leakage Energy Minimization for Embedded VLIW DSP Processors
Authors: Meng Wang, Zili Shao, Chun Jason Xue, Edwin H. -M. Sha
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

In this paper, we develop a novel real-time instructionlevel loop scheduling technique to reduce leakage energy consumption for applications with loops on VLIW architecture. We first prove that the scheduling problem with the minimum leakage energy consumption within a timing constraint is NP-complete. Then, LEMLS (Leakage Energy Minimization Loop Scheduling) algorithm is designed to repeatedly regroup a loop based on rotation scheduling [3], and decrease leakage energy integrating with leakage power reduction mechanism. We conduct experiments on a set of DSP benchmarks based on the power model of the VLIW processors in [12]. The results show that our algorithm achieves significant leakage energy saving compared with list scheduling and the algorithm in [19].
Parallel Image-Based Hemodynamic Simulator
Authors: Marc Garbey, Bilel Hadri, Victoria Hilford, Christof Karmonik
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

With cost effective distributed memory computer systems reaching high performances, it may become feasible in the near future to provide routinely reliable blood flow simulations during angiographic procedures to enhance standard medical imaging techniques. The long term goal of our work is to produce a fast parallel image base Navier-Stokes flow solver for these kinds of clinical procedures. To achieve such performance, our method relies on the proper combination of three techniques that are the L_2 penalty method to deal with complex geometry, a level set method to extract the geometry of the arteries, and a fast scalable domain decomposition solver for the parallel processing of the discrete equations. We developed a web application with a database back-end to store both the original medical images and the results of these simulations. This will assist the endovascular surgeon by providing quickly blood flow indicators such as pressure or shear stresses at the wall of the artery, in addition to existing image analysis technique aimed at improving therapy.
A Cluster-Based and Routing Balanced P2P Lookup Protocol
Authors: Yang Lu, Ming Chen
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

A fundamental problem in peer-to-peer (P2P) systems is how to efficiently locate the node that stores a particular data item. As a hot issue, a number of structured P2P lookup protocols have been presented during the past few years. Unfortunately, current protocols either have uneven routing patterns or incur unnecessary high latency hops, and thus lead to inefficient routing. In this paper, a cluster-based and routing balanced P2P protocol, called CRP, is proposed. In this protocol, all participant nodes are grouped into clusters according to cost in latency, so inner-cluster hops have lower average path latencies. Inside a cluster, each node constructs a balanced lookup tree to evenly distribute routing traffic and reduce routing bottlenecks. In routing path, most hops are inner-cluster hops, and thus CRP can lead to efficient routing. A set of simulations to justify CRP is conducted, which shows that CRP is effective in reducing the average path latency and in evenly distributing routing traffic among sibling nodes.
An Indexed Bibliography on Computer Animation
Authors: Nadia Thalmann, Daniel Thalmann
Venue: IEEE Computer Graphics and Applications (1985)

Although the computer plays an ever increasing role in animation, the term ¿computer animation¿ is imprecise and sometimes can be misleading, since the computer can play a variety of different roles. A popular and simple way of classifying animation systems is to distinguish between computer-assisted and modeled animation.