ppxscal/embedding_network huggingface dataset:
SCTP versus TCP for MPI
Authors: Humaira Kamal, Brad Penoff, Alan Wagner
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

SCTP (Stream Control Transmission Protocol) is a recently standardized transport level protocol with several features that better support the communication requirements of parallel applications; these features are not present in traditional TCP (Transmission Control Protocol). These features make SCTP a good candidate as a transport level protocol for MPI (Message Passing Interface). MPI is a message passing middleware that is widely used to parallelize scientific and compute intensive applications. TCP is often used as the transport protocol for MPI in both local area and wide area networks. Prior to this work, SCTP has not been used for MPI. We compared and evaluated the benefits of using SCTP instead of TCP as the underlying transport protocol for MPI. We re-designed LAM-MPI, a public domain version of MPI, to use SCTP.We describe the advantages and disadvantages of using SCTP, the necessary modifications to the MPI middleware to use SCTP, and the performance of SCTP as compared to the stock implementation that uses TCP.
Reachability Analysis for Uncertain SSPs
Authors: Olivier Buffet
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Stochastic Shortest Path problems (SSPs) can be efficientlydealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reachable. This paper presents an algorithm checking for goal reachability, especially in the complex case of an uncertain SSP where only a possible interval is known for each transition probability. This gives an analysis method for determining if SSP algorithms such as RTDP are applicable, even if the exact model is not known. We aim at a symbolic analysis in order to avoid a complete state-space enumeration.
Strategies for storage of checkpointing data using non-dedicated repositories on Grid systems
Authors: Raphael Y. de Camargo, Renato Cerqueira, Fabio Kon
Venue: Proceedings of the 3rd international workshop on Middleware for grid computing (2005)

Dealing with the large amounts of data generated by long-running parallel applications is one of the most challenging aspects of Grid Computing. Periodic checkpoints might be taken to guarantee application progression, producing even more data. The classical approach is to employ high-throughput checkpoint servers connected to the computational nodes by high speed networks. In the case of Opportunistic Grid Computing, we do not want to be forced to rely on such dedicated hardware. Instead, we want to use the shared Grid nodes to store application data in a distributed fashion.In this work, we evaluate several strategies to store checkpoints on distributed non-dedicated repositories. We consider the tradeoff among computational overhead, storage overhead, and degree of fault-tolerance of these strategies. We compare the use of replication, parity information, and information dispersal (IDA). We used InteGrade, an object-oriented Grid middleware, to implement the storage strategies and perform evaluation experiments.
Computational Federation Service: Dynamic Resource Virtualization for Extensible Grid Service Design
Authors: Fabian Breg, Admela Jukan, Constantine Polychronopoulos
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Due to the increasing heterogeneity, dynamicity and scale of Grid environments, one of the emerging trends in high performance computing is to design Grid services to easily and efficiently use the vast amount of computing, storage, and visualization facilities that are available at geographically dispersed sites. In this paper, we propose an extensible, generalized design model for future Grid services, called Computational Federation Service (CFS), which is based on virtualization of Grid resources in a single system image. The approach builds on and extends our previous research on Computational Federations (CF). By utilizing a Distributed Virtual Machine (DVM) platform, the CF architecture virtualizes node heterogeneity and communication protocols, automates load balancing and includes features of persistence and multitasking, while supporting a location and registration service and the dynamic attach and detach operations of resources. The CFS can exist as part of the Grid middleware, built on top of the collective Grid, resource, and connectivity layers. Our architecture is application-profile aware and can flexibly and dynamically configure and interconnect any type of Grid resources, e.g., computational and storage nodes, instrumentation, and can also extend to different domains, change in time, and support complex application workflow compositions and collaborative applications.
Segmentation of On-line Handwritten Japanese Text of Arbitrary Line Direction by a Neural Network for Improving Text Recognition
Authors: Bilan Zhu, Masaki Nakagaw
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper describes a segmentation method of online handwritten Japanese text of arbitrary line direction by a neural network to improve text recognition performance. This method extracts multidimensional features from strokes of handwritten text and input them into a neural network to preliminarily determine segmentation points. Then, it modifies segmentation candidates using some spatial features. We compare the method with the previous method and that by Fisher's Linear Discriminant using the database HANDS-Kondate_t_bf-2001-11. This paper also shows how to generate character segmentation candidates in order to achieve high discrimination rate by investigating the relationship between recall, precision and the f measure.
Impossible geographies of belonging
Authors: Petra Gemeinboeck
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The paper discusses the boundary between virtual and physical spaces as it is constituted and perforated in a series of installation works by the author. It focuses on the recently completed interactive installation, Impossible Geographies 01: Memory, in which the memory of a space becomes the metaphoric articulation of a virtual seepage into the physical present. Impossible Geographies 02: Urban Fiction, currently being developed, will expand the underlying idea of computated negotiations of geographies and will embed these evolving dialogues in the urban fabric. The series aims to move the contact surface of the virtual further into the physical and to investigate issues of belonging and unbelonging to a space that is naturally inhabited by the participants.
Mining User Preferences, Page Content and Usage to Personalize Website Navigation
Authors: Sergio Flesca, Sergio Greco, Andrea Tagarelli, Ester Zumpano
Venue: World Wide Web (2005)

The growing availability of information on the Web has raised a challenging problem: can a Web-based information system tailor itself to different user requirements with the ultimate goal of personalizing and improving the users' experience in accessing the contents of a website? This paper proposes a new approach to website personalization based on the exploitation of user browsing interests together with content and usage similarities among Web pages. The outcome is the delivery of page recommendations which are strictly related to the navigational purposes of visitors and their actual location within the cyberspace of the website. Our approach has been used effectively for developing a non-invasive system which allows Web users to navigate through potentially interesting pages without having a basic knowledge of the website structure.
Authentication platform for seamless handover in heterogeneous environments
Authors: Dimitris Nikitopoulos, Nikolaos Papaoulakis, Angelos Trakos, Alexandros Giamas, Efstathios Sykas, Michael Theologou
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

This work tackles the hot issue of user handover from one network to another, or generally from one Radio Access Technology (RAT) to another, in a 4G heterogeneous mobile and wireless environment without the interruption of an ongoing service (seamless handover) with user authentication support. This paper proposes an authenticated seamless handover mechanism and describes the authentication platform for two network environments: an operator with both GPRS and WLAN networks (the user performs a vertical handover). Two different WLAN operators (the user performs a horizontal handover).
Creating the Ultimate Research Assistant
Authors: Andy Hoskinson
Venue: Computer (2005)

Text-mining technologies facilitate online research of complex topics.
A Neural Network-Based Detection of Bleeding in Sequences of WCE Images
Authors: N. Bourbakis, S. Makrogiannis, D. Kavraki
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

This paper deals with development of a methodology for detecting bleeding in WCE images. The presented methodology is based on a Neural Net model available in the AIIS Inc. and the results of this methods were tested at the AT research lab. The performance of our method offers promising results in comparison with the ones made by the Given imaging RBIS (Red Blood Identification System), which vary from 21% to 41%. Our method is under improvements and the expected results will reach near 80% or more.
Data driven system level modeling for diesel engines
Authors: Indranil Brahma
Venue:  (2005)

This study investigates different approaches to system level modeling and optimization. Models developed in this work differ from existing system level models not only in their formulation but also in the extent of their dependence on the available experimental data. The emphasis in these models is to integrate the science of the problem with the knowledge extracted from available experimental data such that accurate predictions of complex phenomena are possible within a reasonable time frame. Neural network based models have been used with genetic algorithms to develop a procedure which enables the prediction and optimization of emissions over transient cycles such as the federal test procedure (FTP) cycle in less than real time. Methods to improve the performance and reduce the dependence on training data for these neural network based models have been developed and tested. The most important of these methods involves incorporating a physical model within the neural network functions itself. This idea has been extended in a proposed new approach to soot modeling in which weights similar to those used in neural networks are embedded inside the physical model itself. This integrated model needs a different training method but learns from data just like a conventional neural network. It has the advantage of the model physics inherent in the physical model. Similar ideas have been used to propose a new approach to system level NOx modeling using scaling arguments based on phenomenological grounds. Finally, experimental data has been used to unify model parameters inside a diesel particulate filter (DPF) model such that the model can be used over any operating condition without needing to describe the particular physical characteristics of the particulate deposit inside the trap at that particular operating condition. Insight gained from experimental data has been used to propose a theoretical method of estimating the mass trapped in the DPF from the pressure drop across it. System integration issues encountered during running a complete engine system model comprising of heat release, emission and DPF models have been discussed.
A rule-based poison control expert system
Authors: Catherine E. Rubens
Venue: ACM SIGBIO Newsletter (1985)

Poison Control Centers throughout the country are responsible for giving advice quickly to patients who have possibly been accidentally poisoned, There exists a need for a more reliable means of accomplishing this task. 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
Scenario based dynamic video abstractions using graph matching
Authors: JeongKyu Lee, JungHwan Oh, Sae Hwang
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, we present scenario based dynamic video abstractions using graph matching. Our approach has two main components: multi-level scenario generations and dynamic video abstractions. Multi-level scenarios are generated by a graph-based video segmentation and a hierarchy of the segments. Dynamic video abstractions are accomplished by accessing the generated hierarchy level by level. The first step in the proposed approach is to segment a video into shots using Region Adjacency Graph (RAG). A RAG expresses spatial relationships among segmented regions of a frame. To measure the similarity between two consecutive RAGs, we propose a new similarity measure, called Graph Similarity Measure (GSM). Next, we construct a tree structure called scene tree based on the correlation between the detected shots. The correlation is computed by the GSM since it considers the relations between the detected shots properly. Multi-level scenarios which provide various levels of video abstractions are generated using the constructed scene tree. We provide two types of abstraction using multi-level scenarios: multi-level highlights and multi-length summarizations. Multi-level highlights are made by entire shots in each scenario level. To summarize a video in various lengths, we select key frames by considering temporal relationships among RAGs computed by the GSM. We have developed a system, called Automatic Video Analysis System (AVAS), by integrating the proposed techniques to show their effectiveness. The experimental results show that the proposed techniques are promising.
Design of Heterogeneous Embedded Systems Using DFCharts Model of Computation
Authors: Ivan Radojevic, Zoran Salcic, Partha Roop
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Dataflow process networks have been successfully used for modeling signal processing systems which are data-dominated. In this family of models, the most popular one is synchronous dataflow (SDF). On the other hand, hierarchical concurrent finite state machines (HCFSM) have been successfully employed for control-dominated systems. Most complex embedded systems are heterogeneous, consisting of both control-dominated and data-dominated parts. In this paper, we introduce a new model of computation, called DFCharts, which targets heterogeneous embedded systems. It combines the HCFSM (with Argos semantics) and SDF models. It has a formal, operational semantics based on Boolean automata with variables.
Attacks on Feature-based Affine-invariant Watermarking Methods
Authors: Nopporn Chotikakamthorn, Natapon Pantuwong
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

A class of attacks targeting at a feature-based affineinvariant digital watermarking technique is addressed in this paper. First, it is pointed out that the use of feature points to revert an affine transform operation is equivalent to the use of a known image size or boundary for image normalization. Therefore, any method based on feature points suffers from point shifting in much the same manner as how the image normalization scheme suffers from cropping or reframing. Some simple methods to perform a (feature) point shifting attack are next described. Although use of a sufficient large number of candidate feature points can solve the problem, the paper further points out that this solution, like any secure template- based watermarking method, results in high detection complexity. A two-stage search scheme is proposed to avoid the attack, while retaining the overall detection complexity to a reasonable level.
Towards a Canonical and Structured Representation of PDF Documents through Reverse Engineering
Authors: Maurizio Rigamonti, Jean-Luc Bloechle, Karim Hadjar, Denis Lalanne, Rolf Ingold
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This article presents Xed, a reverse engineering tool for PDF documents, which extracts the original document layout structure. Xed mixes electronic extraction methods with state-of-the-art document analysis techniques and outputs the layout structure in a hierarchical canonical form, i.e. which is universal and independent of the document type. This article first reviews the major traps and tricks of the PDF format. It then introduces the architecture of Xed along with its main modules, and, in particular, the document physical structure extraction algorithm. Later on, a canonical format is proposed and discussed with an example. Finally the results of a practical evaluation are presented, followed by an outline of future works on the logical structure extraction.
The first 10 years of the ECCC digital library
Authors: Christoph Meinel, Volker Klotz
Venue: Communications of the ACM (2006)

Developing a balance between author control and traditional scientific publication practices in a global digital library.
A write-prior partitioning LRU algorithm for the multi-port cache in disk arrays
Authors: Wang Yulin, Li Guangjun, Lin Shuisheng, Wu Xiaojun
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Multi-port cache is used in disk arrays to realize interface processors connecting in switch and to make disk arrays high band and high expandability. To improve the performance of disk arrays, a good cache replacement algorithm is needed in the cache. In this paper, we propose a new algorithm named the write-prior partitioning least recently used (WPP-LRU) algorithm, which distinguishes the ports and distinguishes the write blocks from the read blocks in the cache. The LRU algorithm is only used to the read blocks in each port and some especial operations are performed for all write blocks in the cache. A simulation model is developed and the simulation results show that the WPP-LRU algorithm can improve the performance of disk arrays by reducing the hit service time remarkably while it keeps the same hit ratio as the standard LRU. The WPP-LRU algorithm has a good expandability because some good algorithms can be used in the read blocks of each port to improve the hit ratio, such as the LRU-K algorithm, the 2-Q algorithm and so on, and this will not change the idea of the WPP-LRU algorithm.
Visualization of Fluid Mixing in Microchannels
Authors: Kai Kang, Rene Chevray
Venue: IEEE Computer Graphics and Applications (2005)

The development of a microchannel for fluid-mixing applications comes from the recent interest in microfluidic device applications in biology. The basic idea of microfluidics is to shrink the physical dimensions of most commonly used processors. The lab on a chip is one long-term goal in microfluidics research. In addition, the application of microfluidic technology in clinical diagnostics offers significant cost advantages in terms of reagents, device fabrication, and usage.
eSports: Collaborative and Synchronous Video Annotation System in Grid Computing Environment
Authors: Gang Zhai, Geoffrey C. Fox, Marlon Pierce, Wenjun Wu, Hasan Bulut
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

We designed eSports-a collaborative and synchronous video annotation platform, which is to be used in Internet scale cross-platform grid computing environment to facilitate Computer Supported Cooperative Work (CSCW) in education settings such as distance sport coaching, distance classroom etc. Different from traditional multimedia annotation systems, eSports provides the capabilities to collaboratively and synchronously play and archive real time live video, to take snapshots, to annotate video snapshots using whiteboard and to play back the video annotations synchronized with original video streams. eSports is designed based on the grid based collaboration paradigm the shared event model using NaradaBrokering, which is a publish/subscribe based distributed message passing and event notification system. In addition to elaborate the design and implementation of eSports, we analyze the potential use cases of eSports under different education settings. We believed that eSports will be very useful to improve the online collaborative coaching and education.
Federated identity management for protecting users from ID theft
Authors: Paul Madsen, Yuzo Koga, Kenji Takahashi
Venue: Proceedings of the 2005 workshop on Digital identity management (2005)

Federated identity management is sometimes criticized as exacerbating the problem of online identity theft, based as it is on the idea of connecting together previously separate islands of identity information. This paper explores this conjecture, and argues that, while such linkages do undeniably increase the potential scope of a successful theft of identity information, this risk is more than offset by the much greater value federated identity, in combination with strong authentication, offers in preventing such theft in the first place.
Statistical Estimation of Correlated Leakage Power Variation and Its Application to Leakage-Aware Design
Authors: Maryam Ashouei, Abhijit Chatterjee, Adit D. Singh, Vivek De, T. M. Mak
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Process parameter variations cause large changes in the delay and the leakage power consumption of scaled nanometer CMOS circuits. It has been shown that the layout of a circuit can significantly affect the variation in leakage power by controlling the effect of spatially correlated across- die process variations. In this paper, a method, which efficiently estimates the distribution of leakage power variation caused by correlated process variations, is proposed. The accuracy of the method was validated by comparing the estimated leakage power distribution with Monte Carlo simulation results on ISCAS benchmark circuits. Furthermore, it is shown how the method can be used as a guideline to determine the best possible layout of a circuit.