ppxscal/embedding_network huggingface dataset:
An Implementation of XML Documents Search System based on Similarity in Structure and Semantics
Authors: Uchang Park, Yeojin Seo
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

Extensible Markup Language (XML) is an internet standard that is used to express and convert data. In order to find the necessary information out of XML documents, you need a search system for XML documents. In this research, we have developed a search system that can find documents that matches the structure and content of a given XML document, making the best use of XML structure. Search metrics take account of the similarity in tag names, tag values, and the structure of tags. After a search, the system displays the ranked results in the order of aggregate similarity. Three methods of query are provided: keyword search which is conventional; search with tag names and their values; and search with XML documents. These three methods enable users to choose the method that best suits their preference, resulting in the increase of the usefulness of the system.
Surfel Stripping
Authors: Tamy Boubekeur, Patrick Reuter, Christophe Schlick
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

This paper presents an efficient combination of techniques for fast stripping and multiresolution rendering of Point-Based Surfaces (PBS) called Surfel Stripping. Surfel Strips are small triangle strips that interpolate the PBS. There are two major contributions. First, at loading time, we efficiently convert the PBS into triangle strips. This is done by first generating a set of overlapping small triangular meshes that interpolate the PBS, then removing redundant triangles and finally stripping the small triangular meshes by using a cache-friendly stripping method. All these operations are performed by using an octree data structure. Second, we reuse this data structure for providing a multiresolution interactive visualization of the surfel strips at rendering time. Since Surfel Stripping is local and very fast, it can be used in a lot of situations as an object-space alternative to the image-space surface splatting and thus be considered half way between point-based rendering and local polygonal generation. Rendering Surfel Strips is very efficient since it neither requires multi-pass rendering nor time-consuming vertex/fragment shaders compared to surface splatting. We show also how to exploit the locality of the surfel strips for maintaining compatibility with point-based modeling tools, such as local deformations of surfaces. We finally give some examples of well known visual enrichments developed for polygons, directly applied to PBS thanks to surfel strips.
Predicting the Performance of a 3D Processor-Memory Chip Stack
Authors: Philip Jacob, Okan Erdogan, Aamir Zia, Paul M. Belemjian, Russell P. Kraft, John F. McDonald
Venue: IEEE Design Test (2005)

A primary bottleneck in the performance of a processor is in its communication with memory. By allowing the placement of processor and memory in adjacent layers, 3D design provides significant relief, reducing the communication latency. This article studies the impact of 3D design bycomparing the cycles per instruction of such a design with various alternatives.
On-line metasearch, pooling, and system evaluation
Authors: Robert A. Savell
Venue:  (2005)

This thesis presents a unified method for simultaneous solution of three problems in Information Retrieval&mdash;metasearch (the fusion of ranked lists returned by retrieval systems to elicit improved performance), efficient system evaluation (the accurate evaluation of retrieval systems with small numbers of relevance judgements), and pooling or &ldquo;active sample selection&rdquo; (the selection of documents for manual judgement, in order to develop sample pools of high precision or pools suitable for assessing system quality). The thesis establishes a unified theoretical framework for addressing these three problems and naturally generalizes their solution to the on-line context by incorporating feedback in the form of relevance judgements. The algorithm&mdash;Rankhedge for on-line retrieval, metasearch and system evaluation&mdash;is the first to address these three problems simultaneously and also to generalize their solution to the on-line context. Optimality of the Rankhedge algorithm is developed via Bayesian and maximum entropy interpretations. Results of the algorithm prove to be significantly superior to previous methods when tested over a range of TREC (Text REtrieval Conference) data. In the absence of feedback, the technique equals or exceeds the performance of benchmark metasearch algorithms such as CombMNZ and Condorcet. The technique then dramatically improves on this performance during the on-line metasearch process. In addition, the technique generates pools of documents which include more relevant documents and produce more accurate system evaluations than previous techniques. The thesis includes an information-theoretic examination of the original Hedge algorithm as well as its adaptation to the context of ranked lists. The work also addresses the concept of information-theoretic similarity within the Rankhedge context and presents a method for decorrelating the predictor set to improve worst case performance. Finally, an information-theoretically optimal method for probabilistic &ldquo;active sampling&rdquo; is presented with possible application to a broad range of practical and theoretical contexts.
Secure email-based peer to peer information retrieval
Authors: Chengye Lu, Shlomo Geva
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

In this paper we describe the implementation of a distributed search engine called SEGPX based on email communication. SEGPX uses X.509 Public-key and attribute certificate frameworks and utilizes email servers for communications. Advanced features, such as store and forward, document encryption and client side user authentication/authorization etc., are provided to adapt the use for secure group collaboration over the public networks.
A Method to Transform Object-Oriented Design into Component-Based Design using Object-Z
Authors: Suk Kyung Shin, Soo Dong Kim
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

It has become a common practice to reuse validated software components to shorten development periods and to increase the software quality. Component-based development is an effective reuse technology which extensively utilizes object-oriented design (OOD). Therefore, it is an economical approach to generate component-based design (CBD) from OOD. In this paper, we propose techniques for transforming OOD into CBD using Object-Z specifications. We first show how the structural, functional, and dynamic aspects of OOD can be specified in Object-Z. Then, we also present formal specifications of CBD in Component-Z, which is based on Object-Z and used to specify CBD. Using formal specifications of both OOD and CBD, we propose a set of rules for transforming OOD into CBD. By using our approach, OOD can be reused in generating CBD and the resulting CBD can be effectively implemented by utilizing objects in EJB, .NET, or CORBA. Also, this research provides a foundation for automating the transformation of OOD into CBD.
Fusion of Combination Rules of an Ensemble of MLP Classifiers for Improved Recognition Accuracy of Handprinted Bangla Numerals
Authors: U. Bhattacharya, B. B. Chaudhuri
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In handwritten character recognition problem, the input images are often affected by distortions and noise. Thus such images at different resolutions include different variations in the input data. In the present work, we considered wavelet transform to obtain multi-resolution representation of each input character image. At each resolution level, we considered three MLPs with different numbers of nodes in their hidden layers and combined the outputs produced by all the MLPs of the whole ensemble by using weighted sum rule, product rule and majority voting. The set of misclassified samples produced by one combination rule is neither a subset nor a superset of a similar set produced by another rule. So, majority voting has been used for the second and final round to produce final outputs after combining the results of the three combinations of the first stage. The proposed approach produced 99.10% correct recognition rate on the test set of Bangla (a major Indian script) numeral database.
Real-Time Median Filtering for Embedded Smart Cameras
Authors: Yong Zhao, Gabriel Taubin
Venue: Proceedings of the Fourth IEEE International Conference on Computer Vision Systems (2006)

This paper describes a new median filter algorithm optimized for real-time performance in smart cameras with embedded processors. As in the JPEG and MPEG compression algorithms, each frame of the video stream is first partitioned into a regular array of non-overlapping square blocks. The median value for each block is then computed and compared with corresponding values of neighboring blocks. If the magnitude of the difference does not exceed a threshold, the output value for all the pixels in the block is set to the median value. Otherwise, the output value for each pixel in the block is computed as the median value within a window of the same size centered at this pixel. We describe variations for binary and grayscale images. The algorithm has been implemented and tested in an embedded single-board-computer (SBC) with no hardware acceleration, as a component of a Visual Sensor Network (VSN) system for real-time indoor person detection and tracking. In this system, where the SBCs have the additional overhead of decoding JPEG frames from IP cameras, our new algorithm is 5 to 20 times faster than the traditional algorithms for typical window sizes. We expect further speedups to frame-rate performance on smart cameras with embedded image sensors and reconfigurable hardware.
Detection of multiple transitions in delay fault test of SPARC64 microprocessor
Authors: D. Maruyama, A. Kanuma, T. Mochiyama, H. Komatsu, Y. Sugiyama, N. Ito
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

This work presents a new non-robust delay fault test generation method for the purpose of screening delay defects of microprocessors with fewer test vectors. It is important to reduce the number of test vectors in order to reduce test time, memory usage in the tester, and the overall testing cost. By paying attention to the constraints of off-path inputs in a non-robust test, we made it possible to generate a pair of test vectors to detect multiple delay faults based on the traditional dynamic compaction technique. Delay fault test based on our method is applied to SPARC64 microprocessor with 1.3 GHz clock for screening delay defects, and we achieved 90% coverage with 3,567 test vectors. The comparison results also show that the robust test is not practical for the screening purpose, since it needs more than three times the number of test vectors as compared to the non-robust test.
Historical Recall and Precision: Summarizing Generated Hypotheses
Authors: Richard Zanibbi, Dorothea Blostein, James R. Cordy
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Document recognition involves many kinds of hypotheses: segmentation hypotheses, classification hypotheses, spatial relationship hypotheses, and so on. Many recognition strategies generate valid hypotheses which are eventually rejected, but current evaluation methods consider only accepted hypotheses. As a result, we have no way to measure errors associated with rejecting valid hypotheses. We propose describing hypothesis generation in more detail, by collecting the complete set of generated hypotheses and computing the recall and precision of this set: we call these the "historical recall" and 'historical precision.' Using table cell detection examples, we demonstrate how historical recall and precision along with the complete set of generated hypotheses assist in the evaluation, debugging, and design of recognition strategies.
Asynchronous Veri.able Information Dispersal
Authors: Christian Cachin, Stefano Tessaro
Venue: Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (2005)

Information dispersal addresses the question of storing a ?le by distributing it among a set of servers in a storageef ?cient way. We introduce the problem of veri?able information dispersal in an asynchronous network, where up to one third of the servers as well as an arbitrary number of clients might exhibit Byzantine faults. Veri?ability ensures that the stored information is consistent despite such faults. We present a storage- and communication-ef?cient scheme for asynchronous veri?able information dispersal that achieves an asymptotically optimal storage blow-up. Additionally, we show how to guarantee the secrecy of the stored data with respect to an adversary that may mount adaptive attacks. Our technique also yields a new protocol for asynchronous reliable broadcast that improves the communication complexity by an order of magnitude on large inputs.
Automatic VPN Client Recovery from IPsec Pass-through Failures
Authors: Jose Carlos Brustoloni
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Network Address Translation (NAT) is often used in routers that connect home and small-office networks to the Internet. Unfortunately, NAT may not interoperate well with many protocols, including IPsec, the security protocol suite often used by telecommuters. Many NAT implementations include heuristics commonly known as IPsec Pass-through, which may enable NAT to interoperate with IPsec under certain assumptions. We characterize IPsec Pass-through's operation and failure modes, and propose IPsec Pass-Through Automatic Client Recovery (IPTACR), a novel set of mechanisms that enable VPN clients to recover automatically from IPsec Pass-through failures. Experiments show that the proposed mechanisms are effective and impose negligible overhead.
Developing Interactive Logbook: A Personal Learning Environment
Authors: Tony Chan, Dan Corlett, Mike Sharples, Jeffrey Ting, Oliver Westmancott
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

Many universities and further education colleges provide Virtual Learning Environments (VLEs). In recent years a new direction has been to extend these to support Personal Development Planning (PDP) and Student Portfolio management. A major limitation of such approach is that the plans and portfolios are owned by the institution, and do not support learning across institutions or in the workplace. We describe the development of an Interactive Logbook (IL) which provides students with a suite of mobile tools for multimedia note-taking, knowledge sharing, learning management and personal development planning. The IL environment is designed to be owned by the student and offers interoperability with a wide range of existing software for learning and office work.
Understanding Complex Network Attack Graphs through Clustered Adjacency Matrices
Authors: Steven Noel, Sushil Jajodia
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show attacker reachability across the network for a given number of attack steps, culminating in transitive closure for attack prediction over all possible number of steps. This reachability analysis provides a concise summary of the impact of network configuration changes on the attack graph. Using our framework, we also place intrusion alarms in the context of vulnerabilitybased attack graphs, so that false alarms become apparent and missed detections can be inferred. We introduce a graphical technique that shows multiple-step attacks by matching rows and columns of the clustered adjacency matrix. This allows attack impact/responses to be identified and prioritized according to the number of attack steps to victim machines, and allows attack origins to be determined. Our techniques have quadratic complexity in the size of the attack graph.
A Risk Assessment Model of Embedded Software Systems
Authors: Rattikorn Hewett, Remzi Seker
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

Assessing risk associated with safety or missioncritical embedded systems often lacks detailed considerations of software, if at all. Performing risk assessment, which considers software in its entirety, is challenging, yet necessary. This necessity stems from the need to understand the contribution of software to the risks associated with a system. We propose a modeling approach that extends dynamic flowgraph methodology via using second order decision tables to represent functions of the system, including that of the software, and the environment.
Loosely coordinated coscheduling in the context of other approaches for dynamic job scheduling: a survey: Research Articles
Authors: A. C. Sodan
Venue: Concurrency and Computation: Practice Experience (2005)

Loosely coordinated (implicit&#x002F;dynamic) coscheduling is a time-sharing approach that originates from network of workstations environments of mixed parallel&#x002F;serial workloads and limitedsoftware support. It is meant to be an easy-to-implement and scalable approach. Considering that the percentage of clusters in parallel computing is increasing and easily portable software is needed, loosely coordinated coscheduling becomes an attractive approach for dedicated machines. Loose coordination offers attractive features as a dynamic approach. Static approaches for local job scheduling assign resources exclusively and non-preemptively. Such approaches still remain beyond the desirable resource utilization and average response times. Conversely, approaches for dynamic scheduling of jobs can preempt resources and&#x002F;or adapt their allocation. They typically provide better resource utilization and response times. Existing dynamic approaches are full preemption with checkpointing, dynamic adaptation of node&#x002F;CPU allocation, and time sharing via gang or loosely coordinated coscheduling. This survey presents and compares the different approaches, while particularly focusing on the less well-explored loosely coordinated time sharing. The discussion particularly focuses on the implementation problems, in terms of modification of standard operating systems, the runtime system and the communication libraries. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Incentives to Promote Availability in Peer-to-Peer Anonymity Systems
Authors: Daniel Figueiredo, Jonathan Shapiro, Don Towsley
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

Peer-to-peer (P2P) anonymous communication systems are vulnerable to free-riders, peers that use the system while providing little or no service to others and whose presence limits the strength of anonymity as well as the ef- ficiency of the system. Free-riding can be addressed by building explicit incentive mechanisms into system protocols to promote two distinct aspects of cooperation among peers - compliance with the protocol specification and the availability of peers to serve others. In this paper we study the use of payments to implement an incentive mechanism that attaches a real monetary cost to low availability. Through a game theoretic analysis, we evaluate the effectiveness of such an incentive, finding that peer availability can be significantly increased through the introduction of payments under many conditions. We also demonstrate how a payment-based incentive that preserves anonymity can be implemented and integrated with a popular class of P2P anonymity systems.
Review of "Mathematical Techniques for Biology and Medicine, by William Simon", The MIT Press, 1977
Venue: ACM SIGSIM Simulation Digest (1979)

This worthwhile volume makes worthwhile reading for any modeler and/or simulator but should be of special interest to those in the biomedical field. The author uses the first three chapters to 'review' the fundamentals of calculus and the development and solution of differential equations. His style is fluid and even the rusty reader will quickly understand the approach. 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
Thinking About Evolution in Terms of Cellular Computing
Authors: James A. Shapiro
Venue: Natural Computing: an international journal (2005)

The past five decades of molecular genetics have produced many discoveries about genome structure and function that can only be understood from an informatic perspective:--- distinct sequence codes to mark the individual steps in packaging, expression, replication, transmission, repair and restructuring of DNA molecules;--- modularity of data files for RNA and protein products;--- combinatoric organization of signals to format the genome for differential functioning during cellular and organismal cycles;--- direct participation of DNA in the execution of biological algorithms (formation of highly structured nucleoprotein complexes);--- hierarchical organization of genomic subsystems to form higher level system architectures.This review will discuss aspects of genome organization and genome change that require a more formal computational analysis. We will see how modern results indicate that genome evolution has many similarities to computer system engineering. The ability of cells to control the function of natural genetic engineering systems is central to the genome's potential as a Read---Write information storage system.
Estimation of internet file-access/modification rates from indirect data
Authors: Norman Matloff
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2005)

Consider an Internet file for which data on last time of access/modification (A/M) of the file are collected at periodic intervals, but for which direct A/M data are not available. Methodology is developed here that enables estimation of the A/M rates, in spite of having only indirect data of this nature. Both parametric and nonparametric methods are developed. Theoretical and empirical analyses are presented that indicate that the problem is indeed statistically tractable, and that the methods developed are of practical value. Behavior of the parametric estimators is examined when these assumptions are violated, and these estimators are found to be robust against some such violations.
Controllability of Mechanical Systems with Allowance for the Drive Dynamics
Authors: V. I. Matyukhin
Venue: Automation and Remote Control (2005)

Controllability studies of the mechanical nonlinear dynamic systems such manipulators or air and water craft were continued. Controllability was previously studied disregarding the dynamics of the control drives of mechanical systems [1---5]. The present paper established a controllability criterion for the mechanical systems where the drive dynamics is considered explicitly. Controllability conditions having an obvious physical sense were established. As before, the controllability condition is related with domination of the control forces over any other generalized forces of weight, environmental resistance, and so on. If the drive dynamics is taken into account, then domination in the rate of force variation, that is, in the derivative, is required. Stated differently, the control drives must tolerate sufficiently fast changes in the control output, that is, control forces.