ppxscal/embedding_network huggingface dataset:
Metric Evaluation of Embedded Java-Based Proxies on Handheld Devices in Cluster-Based Ad Hoc Routing
Authors: N. Migas, W. J. Buchanan
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Ad-hoc wireless networks which use ad-hoc routing methods may prove a good solution in certain applications, especially where networks have to be constructed where there is no possibly of creating a network backbone, and in emergency situations. They may also lead to more flexible networks which require reduced configuration, and allow for optimised routes. There is thus a requirement to use mobile devices as intermediate routing devices, which forward data from one device to another. One of the best methods is to run a proxy server on the mobile device, as it allows for a simple implementation on the device. A key factor in this is determining the fitness of a mobile device, especially a limited one, such as a handheld PDA. This paper discusses the metrics that could be used to assess the potential of devices and their environment to route certain types of data, and presents results from iPAQ devices using a range of differing operating systems. It shows how performance of a proxy device varies depending on several factors including the Java environment used, and the operating system used. The paper shows that Linux versions for handheld devices out-perform the equivalent Windows systems for the key performance metrics for proxy devices, such as battery usage and network performance.
ESTmapper: Efficiently Aligning DNA Sequences to Genomes
Authors: Xue Wu, Woei-Jyh (Adam) Lee, Chau-Wen Tseng
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 7 - Volume 08 (2005)

With improvements in technology, scientists are able to sequence the full DNA (genome) of an increasing number of organisms. One way biologists can take advantage of this genomic sequence data is to use it in conjunction with expressed sequence tag (EST) information to find genes and their splice sites. We describe how ESTmapper uses an eager write-only top-down (WOTD) suffix tree to efficiently align DNA sequences against genomes, and compare its precision and performance against popular techniques for DNA alignment (BLAT, sim4, Spidey, BLAST, megaBLAST) and EST clustering (TGICL and PaCE). Experimental results show that ESTmapper is 3 to 1000 times faster than current techniques for aligning and clustering DNA sequences, and produces alignments of comparable or better quality.
The PARADIGMA Project: The Architecture and the Navigator
Authors: A. Di Leva, D. Occhetti, C. Reyneri
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

PARADIGMA is a pilot project which aims to develop and demonstrate an Internet based reference framework to share scientific resources and findings in the treatment of major diseases. PARADIGMA defines and disseminates a common methodology and optimised protocols (Clinical Pathways) to support service functions directed to patients and individuals on matters like prevention, post-hospitalisation support and awareness.
On Exploring Channel Allocation in the Diverse Data Broadcasting Environment
Authors: Hao-Ping Hung, Ming-Syan Chen
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

In recent years, data broadcasting becomes a promising technique to design a mobile information system with power conservation, high scalability and high bandwidth utilization. However, prior reseach topics in data broadcasting are mainly based on the assumption that the disseminated data items are of the same size. We explore in this paper the problem of generating broadcast programs in a diverse data broadcasting environment, in which disseminated data items can be of different sizes. Given the broadcast database and the channel number, we propose algorithms DRP (Dimemsion Reduction Partitioning) to perform the channel allocation for each data item. Moreover, a Cost-Diminishing Selection mechanism is also used to help DRP achieve the local optimum with low complexity. With the capability of generating effective broadcast programs efficiently, the proposed mechanism can be practically used in a diverse data broadcasting environment.
Foot Placement Selection Using Non-geometric Visual Properties
Authors: M. Anthony Lewis, Hyo-Kyung Lee, Aftab Patla
Venue: International Journal of Robotics Research (2005)

Geometric information alone is not sufficient to guide foot placement in arobotic device. A travel path may be firm or soft, slippery or sticky, and will thus affect locomotion. In humans, associations are made between various travel surfaces and gait modification. If a preferred foot position is unavailable, an alternate is selected. This selection is biased, and not random. Here we present a model of alternate foot placement. We demonstrate some novel properties of the model, thus showing its predictive value. We give results in a small bipedal walking mechanism. The power of our approach is that it captures key features of human performance and can be easily implemented in most walking machines.
Integration of ε-Fenchel Subdifferentials and Maximal Cyclic Monotonicity
Authors: Sylvie Marcellin, Lionel Thibault
Venue: Journal of Global Optimization (2005)

This paper concerns the integration of ¿-Fenchel subdifferentials of proper lower semicontinuous convex functions defined on arbitrary topological vector spaces. We make use of integration tools to provide a representation formula of the approximate subdifferential of convex functions, and also to identify the class of maximal cyclically monotone families of operators.
Higher Order Whitening of Natural Images
Authors: Joshua Gluckman
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Natural images are approximately scale invariant resulting in long range statistical regularities that typically obey a power law. For example, images have considerable regularity in their second order spatial correlations as measured by the power spectrum. Processing images to remove these expected correlations is known as whitening an image. Because the expected value of the power spectrum has a regular form (a power law) linear processing such as convolution can be used to whiten an image. After whitening an image, higher order regularities that can not be removed with linear processing still exist in the form of correlations in the magnitude. In this paper it is shown that these correlations also obey a power law and a non-linear method is used to remove them, a process referred to as higher order whitening. The method is invertible demonstrating that while redundancy is removed no information is lost. Experiments are given showing that after higher order whitening the coefficients can be severely quantized yet a good reconstruction is possible despite the nonlinearities.
Using Association Rules for Completing Missing Data
Authors: Chih-Hung Wu, Chian-Huei Wun, Hung-Ju Chou
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

We present in this paper a new method for completing missing data using the concept of association rules. The basic idea is that association rules describe the dependency relationships among data entries in a dataset where all data, including the missing ones, should hold the similar relationships. For a missing datum, we guess its possible value according to related association rules. A new completing procedure and a new evaluation function are developed and presented. The evaluation function is scored according to the support, confidence, and lift of association rules, which reasonably reflects the dependency relationships among existing and missing data. Experimental results show that our method is feasible in completing some incomplete datasets.
BioFilter: An Architecture for Parallel Deployment and Dynamic Chaining of Standalone Bioinformatics Tools
Authors: Thomas Brettin, Avinash Kewalramani
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 7 - Volume 08 (2005)

A large number of bioinformatics analysis tools available today are processor intensive. Keeping in mind that the amount of biological data to be analyzed is growing steadily, and these tools are not easily deployable on Beowulf clusters, we propose BioFilter. BioFilter is a software implementation of an architecture that provides a framework for the deployment of these tools on a cluster thereby providing large performance increases. Another facet of bioinformatics analysis is that the tools, in general, are not used in isolation, but are used collaboratively during an analysis. Our architecture provides a way to create pipelines of different analysis tools chained together in a cluster environment, passing the output from one analysis tool as the input to another analysis tool.
Explicit assumptions enrich architectural models
Authors: Patricia Lago, Hans van Vliet
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Design for change is a well-known adagium in software engineering. We separate concerns, employ well-designed interfaces, and the like to ease evolution of the systems we build. We model and build in changeability through parameterization and variability points (as in product lines). These all concern places where we explicitly consider variability in our systems. We conjecture that it is helpful to also think of and explicitly model invariability, things in our systems and their environment that we assume will not change. We give examples from the literature and our own experience to illustrate how evolution can be seriously hampered because of tacit assumptions made. In particular, we show how we can explicitly model assumptions in an existing product family. From this, we derive a metamodel to document assumptions. Finally, we show how this type of modeling adds to our understanding of the architecture and the decisions that led to it.
Thread coloring: a scheduler proposal from user to hardware threads
Authors: Marisa Gil, Ruben Pinilla
Venue: ACM SIGOPS Operating Systems Review (2005)

The appearance of simultaneous multithreading (SMT) processors, offering instruction-level parallelism and increasing hardware resources utilization, permits the execution of various instructions streams at the same time. A particular case is the Intel SMT implementation (Hyper-Threading Technology) where a processor can execute two instructions streams independently. Due to hardware resources sharing in a Hyper-Threading processor, both instruction streams can contend for the same execution resources depending on the instruction execution units utilization.As other works in this area have demonstrated, we have observed that the system throughput can be improved when the execution resources used by each thread are contemplated in their scheduling. Starting from the evaluation results, we propose a Thread Coloring philosophy that designs a way to manage information about resources utilization (hardware and software resources) per each thread. This policy permits the scheduler to select threads that will perform better with less resource contention, besides including OS upper layers in the resource management. The proposed Thread Coloring scheme establishes the bases of processor and OS cooperation, sharing resources utilization information and providing a form of controlling logical processor thread assignment taking into account possible resource contention.
Japanese text input system with digits
Authors: Kumiko Tanaka-Ishii, Yusuke Inutsuka, Masato Takeichi
Venue: Proceedings of the first international conference on Human language technology research (2001)

We discuss a Japanese text input method for mobile phones. Different from the current methods that are based on kana kanji conversion system, our system asks user only to input the sequence of digits that in fact corresponds to the sequence of consonants, and then convert it directly into the final kanji from.After the examination on the number of candidates for a sequence of digits, we explain our method of word estimation based on Hidden Markov Model and describe our implementation. Then we report the results of evaluation by comparing the number of needed keystrokes to input various kinds of actual texts.
Agile, open source, distributed, and on-time: inside the eclipse development process
Authors: Erich Gamma
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Eclipse is a widely recognized open source project dedicated to providing a platform for developing integrated tools. Throughout the history of Eclipse the development team was successful in hitting projected delivery dates with precision and quality. This isn't possible without a team strongly committed to ship quality software. How is this really done? How does Eclipse achieve quality and just-in-time delivery?This talk sheds light on the key practices of the Eclipse development process - from the development mantras "Always Beta", "Milestones First", "API First", and "Performance First" to practices such as ensuring quality through multiple feedback loops. Erich will reflect on proven practices for managing a large project performed by geographically dispersed teams and open source contributors in a highly competitive market. Most of these practices have evolved in the open source project, but they are equally applicable to closed source projects and will help to improve quality, timeliness and reduce development stress in both types of environments.
User-Centric Adaptation of Structured Web Documents for Small Devices
Authors: Wai Yip Lum, Francis C. M. Lau
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Content adaptation is a crucial step in making desktop-oriented web resources available to mobile, small device users. In this paper, we propose a decision engine comprising a content analysis module and a negotiation module to serve as the core of a content adaptation architecture. The content analysis module parses a structured web document originally intended for the desktop into small sections and transforms the document into a form that is best suited for rendering in a constrained mobile device. The transformation also provides the user with the best content value in an adapted web page while preserving content integrity. With the transformed document, the negotiation module selects the best rendering parameters to be used in the synthesis of an optimal adapted version of the content. The decisions made are based on the userýs preference and QoS considerations. We have built a prototype to demonstrate the viability of our approach.
MemoSpace: a visualization tool for web navigation
Authors: Jacqueline Waniek, Holger Langner, Falk Schmidsberger
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

A central aspect of reducing orientation problems in web navigation concerns the design of adequate navigation aids. Visualization of users' navigation path in form of a temporal-spatial template can function as external memory of users' search history, thereby supporting the user to find previously visited sites, getting an overview of the search process and moreover, provide structure for the complex WorldWideWeb (WWW) environment. This paper presents an application for dynamic 2 and 3 dimensional visualizations of users' navigation paths, called MemoSpace. In an explorative study, users behavior and subjective evaluation of a MemoSpace application was examined.
A flexible table driven LR(1) parser
Authors: Stoyan Bonev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The implementation of a flexible table driven LR(1) parser is presented in this paper. The LR(1) parsing algorithm is based on modified bottom up strategy described in [1] and it stays the same for all grammars. A parser with control tables that are initialized within the source text has no flexibility because each new LR(1) parser implementation needs to recompile the source text in order to adjust its data control structures like terminal symbols, non terminal symbols, grammar rules and control table. To avoid this drawback a configuration text edited file is to be created and read as input to adapt the parser before the syntax analysis process starts execution.
A Novel Scheme for Fingerprint Identification
Authors: Tsong-Liang Huang, Che-Wei Liu, Jui-Peng Lin, Chien-Ying Li, Ting-Yi Kuo
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Fingerprint recognition is one of the most reliable and popular biometric recognition methods in these days. In this paper, we describe a fingerprint recognition system consisting of three main steps - fingerprint image preprocessing, feature extraction and feature matching. The image preprocessing step enhances fingerprint image to obtain binarized ridges, which are needed for feature extraction. Feature points which are also called minutiae such as ridge endings, ridge bifurcations are then extracted, followed by false minutiae elimination. The novel matching algorithm is proposed, which is a fast and robust minutiae-based method.
A Fuzzy Behavior-Based Control for Mobile Robots Using Adaptive Fusion Units
Authors: Keigo Watanabe, Kiyotaka Izumi, Junnosuke Maki, Katsuharu Fujimoto
Venue: Journal of Intelligent and Robotic Systems (2005)

It is known that a behavior-based control approach is effective for acquiring an intelligent control system of robots. However, further improvements are required for making any behavior-based control system robust against changes in the environments. A module learning method has been applied in the framework of fuzzy behavior-based control to have an adaptive behavioral fusion. In this paper, an adaptive fusion strategy is proposed to adaptively select a cooperative fusion unit or competitive fusion unit, depending on the external sensor information. Some simulations are given to illustrate that the present control systems are flexible against the change of environments or untrained environments, compared to those with a conventional priority-based fusion unit.
Reliable Detection of BPCS-Steganography in Natural Images
Authors: Xiaoyi Yu, Tieniu Tan, Yunhong Wang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Image steganalysis has attracted increasing attention recently. BPCS steganalysis is currently a hot research topic. Although some BPCS steganalysis methods have been proposed, these methods have their limitations. In this paper, we propose a new approach to detect BPCS-Steganography. The approach, based on statistical features, can detect the existence of secret message not only in spatial domain, but also in transform domain. To evaluate the proposed steganalytic framework, two examples of detection are performed. It is shown that the accuracy of detection of the existence of secret message in images is relatively high. Experimental results and theoretical analysis show that the proposed method is an effective steganlytic method of BPCS-Steganography.
Interactive posters: THE MISUNDERSTOOD PICTURE: A STUDY OF ICON RECOGNITION
Authors: Michael D. Byrne
Venue: ACM SIGCHI Bulletin (1991)

Icons are a prevalent feature in current computer systems. Yet, little substantive research has been done on the benefits, drawbacks, ideal properties, and cognitive impact of icons. To some extent, it seems that it has just been assumed that icons are a generally better representation.
Schemaless XML Document Management in Object-Oriented Databases
Authors: Soon M. Chung, Sheeya B. Jesurajaiah
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

XML has emerged as the universal format for data exchange and is being widely used in technical documentation of manufacturing companies, book publishing, and Web publishing. It is also being used in contexts that are mission-critical, such as banking and e-commerce. One of the main reasons for the popularity of XML is its semi-structured nature and the flexibility of its component parts. Schemaless XML documents, which do not have a schema or Document Type Definition (DTD), have the highest level of flexibility, as they are not bound to any kind of structure. However, support for schemaless XML documents in the major relational and object-oriented databases is limited to storing each of them as a CLOB (Character Large Object). This kind of storage requires the usage of associative search criteria to query the document, and does not support piecewise update and multiple document queries. In this research, we developed a middleware layer over an Oracle DBMS to support the storage, retrieval, query and update of schemaless XML documents. We also propose an algorithm by which we can store the logical structure of the XML document in addition to storing its content. The final part of this paper presents an algorithm that can rebuild XML documents by using the stored logical structures and the content of the XML documents. The rebuilt XML document is a well-formed document and is similar to the original document.
The case for crypto protocol awareness inside the OS kernel
Authors: Matthew Burnside, Angelos D. Keromytis
Venue: ACM SIGARCH Computer Architecture News (2005)

Separation of control and data plane is a principle increasingly used to improve the performance of network protocols and applications, such as the Web. Use of security mechanisms, such as the SSL/TLS protocol, can negate these performance gains, since such mechanisms need to be located on the data path. We argue that the same principle of separation can be applied to security mechanisms, by removing the web server from the secure data path.We present a minimal operating system extension that can improve the performance of web servers using SSL/TLS by up to 27%. Our intuition is that protocol framing and cryptographic transforms can be applied to incoming and outgoing data frames by the operating system under a policy specified by the web server. In this way, we can reduce the number of system calls and context switches to a small constant number, and the amount of data copying that involves the web server by 100%. We describe our prototype implementation for the OpenBSD operating system and quantify its performance implications.
A genetic algorithm for the project assignment problem
Authors: Paul R. Harper, Valter de Senna, Israel T. Vieira, Arjan K. Shahani
Venue: Computers and Operations Research (2005)

In this paper we present a genetic algorithm as an aid for project assignment. The assignment problem illustrated concerns the allocation of projects to students. Students have to choose from a list of possible projects, indicating their preferred choices in advance. Inevitably, some of the more popular projects become 'over-subscribed' and assignment becomes a complex problem. The developed algorithm has compared well to an optimal integer programming approach. One clear advantage of the genetic algorithm is that, by its very nature, we are able to produce a number of feasible project assignments, thus facilitating discussion on the merits of various allocations and supporting multi-objective decision making.