ppxscal/embedding_network huggingface dataset:
Wireless sensor network node with asynchronous architecture and vibration harvesting micro power generator
Authors: Yasser Ammar, Aurélien Buhrig, Marcin Marzencki, Benoît Charlot, Skandar Basrour, Karine Matou, Marc Renaudin
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

This paper presents recent advances in the development of a microsystem designed to be part of a wireless sensor network. This microsystem is developed with two particular technologies: asynchronous circuits and ambient energy harvesting power generator. Asynchronous technologies offer several advantages allowing a global decrease in the power consumption of the node. In addition, the presence of an ambient energy scavenger allows the system to power itself, thus reducing maintenance and increasing the lifetime of the node.
Humans in the traceability loop: can't live with 'em, can't live without 'em
Authors: Jane Huffman Hayes, Alex Dekhtyar
Venue: Proceedings of the 3rd international workshop on Traceability in emerging forms of software engineering (2005)

The human analyst is required as an active participant in the trace-ability process. Work to date has focused on automated methods that generate traceability information. There is a need for study of what the analysts do with traceability information as well as a study of how they make decisions.
Software-Based Fault Tolerant Computing
Authors: Goutam Kumar Saha
Venue: Ubiquity (2005)

This paper describes how to design a software-based fault tolerant application using microprocessor (MP), in order to tolerate the burst errors in memory. This approach may be called a single -- version scheme (SVS). The SVS relies on a single version application program which is enhanced with self-checking code redundancy to tolerate memory burst errors that are difficult to correct during the run-time of an application. Conventionally, the other software based approaches can detect a few bit errors (in memory) only towards fail-stop kind of fault tolerance against transient bit errors. Reed Solomon codes are mainly effective for burst errors in coding of audio Compact Disks at offline only. The proposed online technique does not need multiple versions of software and multiple machines. This approach employs only two copies of the application software running on one machine only. Two copies of the enhanced version version of an application are used here for online error detection and tolerance thereof as well. This is an effective low-cost online tool for hardening a microprocessor-based industrial computing system or for on-chip DRAM applications using an affordable code and time redundancy against the burst errors in processor memory. The SVS aims to provide a non-fail-stop kind of fault tolerance against burst errors. This approach supplements the Error Correcting Codes (ECC) in memory system also, against both the transient and permanent bit errors in memory.
New release of BMDP programs
Venue: ACM SIGSOC Bulletin (1976)

The August 1976 version of the BMDP programs is now available from the Health Sciences Computing Facility. The new version can be obtained in load module form for IBM 360 and 370 or in source form. For details on ordering the new version, contact:BMD Program LibrarianHealth Sciences Computing FacilityUniversity of CaliforniaLos Angeles, CA 90024One program (P1F) has been rewritten, and four new programs have been added. Abstracts for these five programs follow.
Alternate Representation of Distance Matrices for Characterization of Protein Structure
Authors: Keith Marsolo, Srinivasan Parthasarathy
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

The most suitable method for the automated classification of protein structures remains an open problem in computational biology. In order to classify a protein structure with any accuracy, an effective representation must be chosen. Here we present two methods of representing protein structure. One involves representing the distances between the Cá atoms of a protein as a two-dimensional matrix and creating a model of the resulting surface with Zernike polynomials. The second uses a wavelet-based approach. We convert the distances between a protein's Cα atoms into a one-dimensional signal which is then decomposed using a discrete wavelet transformation. Using the Zernike co-efficients and the approximation coefficients of the wavelet decomposition as feature vectors, we test the effectiveness of our representation with two different classifiers on a dataset of more than 600 proteins taken from the 27 most-populated SCOP folds. We find that the wavelet decomposition greatly outperforms the Zernike model.With the wavelet representation, we achieve an accuracy of approximately 56%, roughly 12% higher than results reported on a similar, but less-challenging dataset. In addition, we can couple our structure-based feature vectors with several sequence-based properties to increase accuracy another 5-7%. Finally, we use a multi-stage classification strategy on the combined features to increase performance to 78%, an improvement in accuracy of more than 15-20% and 34% over the highest reported sequence-based and structure-based classification results, respectively.
Writing the claims for a patent
Authors: Phil Emma
Venue: IEEE Micro (2005)

The author demystifies the area of claim language in patents.
WSDL-Based Automatic Test Case Generation for Web Services Testing
Authors: Xiaoying Bai, Wenli Dong, Wei-Tek Tsai, Yinong Chen
Venue: Proceedings of the IEEE International Workshop (2005)

Web Services promote the specification-based cooperation and collaboration among distributed applications in an open environment. To ensure the quality of the services that are published, bound, invoked and integrated at runtime, test cases have to be automatically generated and testing executed, monitored and analyzed at runtime. This paper presents the research to generate Web Services test cases automatically based on the Web Services specification language WSDL (Web Services Description Language), which carries the basic information of a service including its interface operations and the data transmitted. The WSDL file is first parsed and transformed into the structured DOM tree. Then, test cases are generated from two perspectives: test data generation and test operation generation. Test data are generated by analyzing the message data types according to standard XML schema syntax. Operation flows are generated based on the operation dependency analysis. Three types of dependencies are defined: input dependency, output dependency, and input/output dependency. Finally, the generated test cases are documented in XML-based test files called Service Test Specification.
Development of Chemistry Portal for Grid-enabled Molecular Science
Authors: Zhongwu Zhou, Feng Wang, Billy D. Todd
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

We present a description of our ongoing efforts to develop a chemistry grid portal by utilizing core grid technologies for computational chemistry and molecular science applications. The portal aims to provide the Australian computational chemistry and molecular science community a uniform and integrated user interface for scientists to access and execute distributed applications through a conventional web browser. The portal will become a complete molecular science e-Research platform from user management, to experiment composition and preparation, execution over grid resources, and finally results analysis and visualization. The requirements for the portal, its architecture and design are discussed, along with implementation details and case studies, and future directions of the project.
Parameter sweeps for exploring GP parameters
Authors: Michael E. Samples, Jason M. Daida, Matt Byom, Matt Pizzimenti
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

This paper describes our procedure and a software application for conducting large parameter sweep experiments in genetic and evolutionary computation research. Both procedure and software allows a researcher to examine multivariate nonlinearities that are common in genetic and evolutionary computation. Experiments of this nature are well suited to distributed computing environments (such as Grids and clusters) and we present an automated system for conducting parameter sweep experiments on heterogeneous networks. Emphasis is placed on experimental sampling, distributed robustness, and data analysis. The parameter sweep experimental procedure is easily applicable to any experiment involving computer simulations but is particularly well suited for evolutionary computation experiments.
Global Warp Metric Distance: Boosting Content-based Image Retrieval through Histograms
Authors: Joaquim Cezar Felipe, Agma Juci Machado Traina, Caetano Traina,  Jr.
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

This work presents a new distance functionthe Global Warp Metric Distance - to compare histograms used as a feature to index image databases in content-based image retrieval environments. The Metric Histogram represents a compact, but efficient alternative to the use of traditional gray-level histograms to represent images. The Global Warp Metric Distance (GWMD) enhances the comparison between histograms, replacing the rigid bin-to-bin evaluation by the Warp method, which allows a local "adjustment" of one histogram to the other during the distance calculation, introducing a global matching of the curves. Besides this, GWMD applies a set of geometric global features of histograms to determine the final distance. Results on similarity retrieval in medical images demonstrate the superiority of the proposed approach in analyzing image sets that present brightness and contrast disparities: it reduces the amount of both false positive and false negative retrievals. Moreover, these results comply with similarity evaluations performed by domain specialists.
Publishing Persistent Grid Computations as WS Resources
Authors: Thomas Heinis, Cesare Pautasso, Oliver Deak, Gustavo Alonso
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Grid services can be composed into processes, providing a high level definition of the computations involved in terms of their data exchanges and control flow dependencies. In this paper we show how processes themselves can be efficiently published as Grid services by mapping the persistent state of the process executions to standard compliant interfaces as defined by the Web Services Resource Framework (WS-RF). Mapping processes to resources is a fundamental step to enable recursive Grid service composition, where composite Grid services are themselves published as services. This gives processes a standardized and well-understood interface that enables their management, monitoring, steering and adaptation. Additionally it eases their reusability and simplifies integration into existing Grid applications and portals. In order to determine the mapping's overhead, we include the results of a comprehensive performance evaluation.
Conversion of long integers from one base to another under size constraints
Authors: T. A. Kovats
Venue: ACM SIGSIM Simulation Digest (1980)

A long integer is a vector whose elements are the digits of a number represented in a number system based on a given base; this construct is useful in extended-precision calculations. A routine is presented for converting a long integer froe one base to another, as well as routines for doing addition and multiplication of long integers.
A case study of C source code verification: the Schorr-Waite algorithm
Authors: Thierry Hubert, Claude Marche
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

We describe an experiment of formal verification of C source code, using the CADUCEUS tool.We performed a full formal proof of the classical Schorr-Waite graph-marking algorithm, which has already been used several times as a case study for formal reasoning on pointer programs. Our study is original with respect to previous experiments for several reasons. First, we use a general-purpose tool for C programs: we start from a real source code written in C, specified using an annotation language for arbitrary C programs. Second, we use several theorem provers as backends, both automatic and interactive. Third, we indeed formally establish more properties of the algorithm than previous works, in particular a formal proof of termination is made^1.
Basic components of a face-to-face interaction with a conversational agent: mutual attention and deixis
Authors: Stephan Raidt, Gérard Bailly, Frédéric Elisei
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

We present a series of experiments that involve a face-to-face interaction between an embodied conversational agent (ECA) and a human interlocutor. The main challenge is to provide the interlocutor with implicit and explicit signs of mutual interest and attention and of the awareness of environmental conditions in which the interaction takes place. A video realistic talking head with independent head and eye movements was used as a talking agent interacting with a user during a simple card game offering different levels of help and guidance. We analyzed the user performance and how the quality of assistance given by the embodied conversational agent was perceived. The experiment showed that users can profit from its presence and its facial deictic cues.
Lens Model Selection for a Markerless AR Tracking System
Authors: B. Streckel, J.-F. Evers-Senne, R. Koch
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

This paper describes a visual markerless real-time tracking system for Augmented Reality applications. The system uses a firewire camera with a fisheye lens mounted at 10 fps. Visual tracking of 3D scene points is performed simultaneously with 3D camera pose estimation without any prior scene knowledge. All visual-geometric data is acquired using a structure-from-motion approach. The lens selection was driven by research results that show the superiority of a fisheye lens to a standard perspective lens for this approach. 2D features in the hemispherical image are tracked using a 2D point tracker. Based on the feature tracks, 3D camera ego-motion and 3D features are estimated.
Shape-Based Averaging for Craniofacial Anthropometry
Authors: J. Marquez Flores, I. Bloch, F. Schmitt, C. Grangeat, T. Bousquet
Venue: Proceedings of the Sixth Mexican International Conference on Computer Science (2005)

We present in this work original methods for defining and obtaining robust, shape-based averages of any feature of the human head anatomy from a normal population. Our goal is the construction of computerized atlases with representative facial features and craniofacial anthropometry for specific human populations. A method for true-morphological averaging in three dimensions is presented, consisting of a suitable blend of shape-related information for N objects to obtain a progressive average. It is made robust by penalizing, in a morphological sense, the contributions of features less similar to the current average. The morphological error and similarity, as well as penalization, are based on the same paradigm as the morphological averaging. We present current results for the shape of the ear in 24 subjects.
Doing it Manually
Authors: Joe Rigo
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1979)

I have been making a good living from computers for 15 years now. I think they are great -- for other people. I don't want anything to do with them in my own work.
An approach towards detailed documentation
Authors: Andrew R. Farber
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1977)

In two previous articles, methods for writing maintenance documentation from program listings were presented. An index card for each module (main program or subroutine) was made showing its vital statistics. This was information giving the module name, a short (one-line) description of the module, the subroutines it called, if any, and a list of the files accessed by the module, from these cards a system data flow chart was drawn. Documentation for each program was then written. This documentation contained a data flow chart for the individual program plus a program description which varied in detail from a short narrative on the functions of the routine to a detailed flow-chart or pseudo-code description.
Practical Techniques for Performance Estimation of Processors
Authors: Abhijit Ray, Thambipillai Srikanthan, Wu Jigang
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Performance estimation of processor is important to select the right processor for an application. Poorly chosen processors can either under perform very badly or over perform but with high cost. Most previous work on performance estimation are based on generating the development tools, i.e., compilers, assemblers etc from a processor description file and then additionally generating an instruction set simulator to get the performance. In this work we present a simpler strategy for performance estimation. We propose an estimation technique based on the intermediate format of an application. The estimation process does not require the generation of all the development tools as in the prevalent methods. As a result our method is not only cheaper but also faster.
Managing Variability and Reuse of Features and Requirements for Large and Complex Organizational Structures
Authors: Margot Bittner, Ali Botorabi, Alexander Poth, Mark-Oliver Reiser, Matthias Weber
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Feature trees are a well-established instrument for domain analysis and modeling [2,3]. But for extremely complex product families like a vehicle manufacturer¿s product range, they become very large, and thus cumbersome and inflexible. This is particularly true when changes to the tree¿s structure have to be managed and documented over a long period of time. Furthermore, a conflict of aims arises when using feature trees in large organizations: while a single global feature tree for the entire company is desirable, local amendments are indispensable because often some applications of the feature models require amendments not visible in other application contexts. Especially in such intricate organizational contexts, feature modeling has great potential: features may serve as a link between management, marketing and development to ease communication between them and they can provide a central view on variability in a wide range of development artifacts - such as requirements, design models or test cases - thus becoming the core of all variability and evolution management, cf. [1]. But to take full advantage of this potential, it is essential to make feature trees more manageable.
Machine Translation with Inferred Stochastic Finite-State Transducers
Authors: Francisco Casacuberta, Enrique Vidal
Venue: Computational Linguistics (2004)

Finite-state transducers are models that are being used in different areas of pattern recognition and computational linguistics. One of these areas is machine translation, in which the approaches that are based on building models automatically from training examples are becoming more and more attractive. Finite-state transducers are very adequate for use in constrained tasks in which training samples of pairs of sentences are available. A technique for inferring finite-state transducers is proposed in this article. This technique is based on formal relations between finite-state transducers and rational grammars. Given a training corpus of source-target pairs of sentences, the proposed approach uses statistical alignment methods to produce a set of conventional strings from which a stochastic rational grammar (e.g., an n -gram) is inferred. This grammar is finally converted into a finite-state transducer. The proposed methods are assessed through a series of machine translation experiments within the framework of the EuTrans project.
Online help system design based on the situated action theory
Authors: Luc Vouligny, Jean-Marc Robert
Venue: Proceedings of the 2005 Latin American conference on Human-computer interaction (2005)

Nowadays, different forms of assistance are available in interactive computer-based systems. However, current online help systems, which correspond to the main components of online assistance, often are unsuccessful in providing support to users. The help that is offered is not well-suited to the problem the users encounter and to the particular needs they have. This paper reports on a new approach to online help system design based on the situated action theory. The approach has been implemented in a system called AIDE. The system has been evaluated with 15 subjects having to do programming tasks in C++, and compared to the online help available in the programming environment they were using and on the Web. The main results show that the assistance provided by AIDE was three times as effective as the two other forms of assistance to help in defining the problem, and twice as effective to help in resolving it. Results also show that with the AIDE system, students had much less recourse to human assistance when trying to complete their tasks.
Managing uncertainty and ontologies in databases
Authors: Edward Hung
Venue:  (2005)

Nowadays a vast amount of data is generated in Extensible Markup Language (XML). However, it is necessary for applications in some domains to store and manipulate uncertain information, e.g. when the sensor inputs are noisy, or we want to store data that is uncertain. Another big change we can see in applications and web data is the increasing use of ontologies to describe the semantics of data, i.e., the semantic relationships between the terms in the databases. As such information is usually absent from traditional databases, there is tremendous opportunity to ask new kinds of queries that could not be handled in the past. This provides new challenges on how to manipulate and maintain such new kinds of database systems. In this dissertation, we will see how we can (i) incorporate and manipulate uncertainty in databases, and (ii) efficiently compute aggregates and maintain views on ontology databases. First, I explain applications that require manipulating uncertain information in XML databases and maintaining web ontology databases written in Resource Description Framework (RDF). I then introduce the probabilistic semistructured PXML data model with two formal semantics. I describe a set of algebraic operations and its efficient implementation. Aggregations of PXML instances are studied with two semantics proposed: possible-worlds semantics and expectation semantics. Efficient algorithms with pruning are given and evaluated to show their feasibility. I introduce PIXML, an interval probability version of PXML, and develop a formal semantics for it. A query language and its operational semantics are given and proved to be sound and complete. Based on XML, RDF is a language used to describe web ontologies. RDQL, an RDF query language, is extended to support view definition and aggregations. Two sets of algorithms are given to maintain non-aggregate and aggregate views. Experimental results show that they are efficient compared with standard relational view maintenance algorithms.