ppxscal/embedding_network huggingface dataset:
Comparison of Complete and Elementless Native Storage of XML Documents
Authors: Theo Harder, Christian Mathis, Karsten Schmidt
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

Because XML documents tend to be very large, are accessed by declarative and navigational languages, and often are processed in a collaborative way using read/write transactions, their fine-grained storage and management in XML DBMSs is a must for which, in turn, a flexible and space-economic tree representation is mandatory. In this paper, we explore a variety of options to natively store, encode, and compress XML documents thereby preserving the full DBMS processing flexibility on the documents required by the various language models and usage characteristics. Important issues of our empirical study are related to node labeling, document container layout, indexing, as well as structure and content compression. Encoding and compression of XML documents with their complete structure leads to a space consumption of ~40% to ~60% compared to their plain representation, whereas structure virtualization (elementless storage) saves in the average more than 10%, in addition.
Distributed Software Development: Practices and challenges in different business strategies of offshoring and onshoring
Authors: Rafael Prikladnicki, Jorge Luis N. Audy, Daniela Damian, Toacy C. de Oliveira
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

Distributed Software Development involves a number of different business models, and companies intending to embark on the journey of distributed development have difficulty choosing the model(s) that suits their process and current software practice. More literature that presents similarities as well as differences among these models, in terms of processes, practices and challenges that characterize them, is thus becoming critical to software practitioners. This paper intends to bring more knowledge in this direction. We present empirical evidence from a case study of DSD practice in five companies that had projects following one or more of the different DSD business models described in the literature. We discuss the similarities and differences in the challenges faced by the projects in these models, as well as the relationship between the models, development process, and project size and complexity, as reported in the projects studied.
An Estimation Model for Test Execution Effort
Authors: Eduardo Aranha, Paulo Borba
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Testing is an important activity to ensure software quality. Big organizations can have several development teams with their products being tested by overloaded test teams. In such situations, test team managersmust be able to properly plan their schedules and resources. Also, estimates for the required test execution effort can be an additional criterion for test selection, since effort may be restrictive in practice. Nevertheless, this information is usually not available for test cases never executed before. This paper proposes an estimation model for test execution effort based on the test specifications. For that, we define and validate a measure of size and execution complexity of test cases. This measure is obtained from test specifications written in a controlled natural language. We evaluated the model through an empirical study on the mobile application domain, which results suggested an accuracy improvement when compared with estimations based only on historical test productivity.
Smoothing Algorithm for N-Gram Model Using Agglutinative Characteristic of Korean
Authors: Jae-Hyun Park, Young-In Song, Hae-Chang Rim
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Smoothing for an n-gram language model is an algorithm that can assign a non-zero probability to an unseen n-gram. Smoothing is an essential technique for an n-gram language model due to the data sparseness problem. However, in some circumstances it assigns an improper amount of probability to unseen n-grams. In this paper, we present a novel method that adjusts the improperly assigned probabilities of unseen n-grams by taking advantage of the agglutinative characteristics of Korean language. In Korean, the grammatically proper class of a morpheme can be predicted by knowing the previous morpheme. By using this characteristic, we try to prevent grammatically improper n-grams from achieving relatively higher probability and to assign more probability mass to proper n-grams. Experimental results show that the proposed method can achieve 8.6% - 12.5% perplexity reductions for Katz backoff algorithm and 4.9% - 7.0% perplexity reductions for Kneser-Ney Smoothing.
Study on a Wavelet-Extracted-Eigenvector Based Representation of Time Series on Recognition of Astronaut_s Respiratory Intensity
Authors: Daqi Li, Junyi Shen, Jianliang Zhou
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper presents a time series' representation by eigenvector sequence based on wavelet transform. This representation is applicable for recognizing astronaut's respiratory intensity. By wavelet analysis, the time series of respiratory intensity is separated into noise and de- noised curve. Noise filtered effectively, the de-noised curve is smooth enough for facile subsection. According to such representation, this paper implements the similarity comparison and recognizes the character of respiratory intensity of astronaut in China manned space flight experiment. Key words: Time Series, Wavelet Transform, Pattern Recognition, Eigenvector, Comparability Comparison
Redundancy in Data Structures: Improving Software Fault Tolerance
Authors: D. J. Taylor
Venue: IEEE Transactions on Software Engineering (1980)

The increasing cost of computer system failure has stimulated interest in improving software reliability. One way to do this is by adding redundant structural data to data structures. Such redundancy can be used to detect and correct (structural) errors in instances of a data structure. The intuitive approach of this paper, which makes heavy use of examples, is complemented by the more formal development of the companion paper, "Redundancy in Data Structures: Some Theoretical Results."
Strategies for containing an influenza pandemic: the case of Italy
Authors: Stefano Merler, Giuseppe Jurman, Cesare Furlanello, Caterina Rizzo, Antonino Bella, Marco Massari, Marta Luisa Ciofi degli Atti
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

In this paper we introduce an individual based model for simulating the spread of an emerging influenza pandemic in Italy and testing the effectiveness of some containing strategies including vaccination, antiviral prophylaxis and quarantine measures to increase social distances. Our results show that while the probability of interrupting a large outbreak is negligible, a combination of the control measures can be effective in reducing the incidence of infection. In particular, in the worst case, an incidence reduction from about 50% to about 10% can be hopefully achieved.
The ND-tree: a dynamic indexing technique for multidimensional non-ordered discrete data spaces
Authors: Gang Qian, Qiang Zhu, Qiang Xue, Sakti Pramanik
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Similarity searches in multidimensional Nonordered Discrete Data Spaces (NDDS) are becoming increasingly important for application areas such as genome sequence databases. Existing indexing methods developed for multidimensional (ordered) Continuous Data Spaces (CDS) such as R-tree cannot be directly applied to an NDDS. This is because some essential geometric concepts/properties such as the minimum bounding region and the area of a region in a CDS are no longer valid in an NDDS. On the other hand, indexing methods based on metric spaces such as M-tree are too general to effectively utilize the data distribution characteristics in an NDDS. Therefore, their retrieval performance is not optimized. To support efficient similarity searches in an NDDS, we propose a new dynamic indexing technique, called the ND-tree. The key idea is to extend the relevant geometric concepts as well as some indexing strategies used in CDSs to NDDSs. Efficient algorithms for ND-tree construction are presented. Our experimental results on synthetic and genomic sequence data demonstrate that the performance of the ND-tree is significantly better than that of the linear scan and M-tree in high dimensional NDDSs.
Streaming-Archival InkML Conversion
Authors: B. Keshari, S. Watt
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Ink Markup Language (InkML) provides a platform neutral data format that can be used to represent, store and transmit digital ink data. Both streaming and archival ap- plications are supported through different uses of InkML's primitives. While streaming ink and archival ink data can represent the same information, each supports certain oper- ations more directly. Indeed, certain applications can ben- efit from access to both representations of the same digital ink data. In this paper we present an efficient method to convert archival style InkML to streaming style and vice versa.
Tutorial: Unix Document Formatting and Typesetting
Authors: N. Gehani
Venue: IEEE Software (1986)

Unix provides extensive document formatting facilities that have been and continue to be very successful. This article surveys and introduces the Unix document preparation facilities. 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
Improving Web Service Discovery with Usage Data
Authors: Aliaksandr Birukou, Enrico Blanzieri, Paolo Giorgini, Natallia Kokash
Venue: IEEE Software (2007)

Web service discovery is a difficult and challenging activity that makes the development of service-based applications a time-consuming and still not widely practiced process. Descriptions of publicly available services are scarce and their quality isn't guaranteed. This article presents a recommendation system to help developers of service-based applications discover and select appropriate services. Given a task description, the system recommends service operations according to the history of decisions previously made for similar objectives. The system is developed using IC-Service, a domain-independent recommendation Web service based on the implicit culture theory of service developers. IC-Service automatically collects information about service usage. Experimental results show that the system can learn from experience and achieve fair precision in its recommendations. This article is part of a special focus on service-centric software systems.
Factoring IPv6 Device Mobility and Ad-hoc Interactions into the Service Location Protocol
Authors: Bilhanan Silverajan, Jarmo Harju
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

The rise in device mobility, interactions for service discovery as well as IPv6 networking, necessitate a means by which a clear and consistent approach towards supporting rapid, dynamic service discovery and service provision must be undertaken. This paper describes ways to provide movement detection, automatic and dynamic discovery of network services as well as network characteristics at the point of attachment for mobile devices moving in IPv6 network spaces. It employs a service discovery mechanism based on using the Service Location Protocol (SLP), one of the most extensively researched and standardised discovery protocols in existence today. We show why traditional means of service discovery have shortcomings when used in advanced mobile networking environments, and describe new extensions to overcome these issues without losing compatibility to existing work in SLP. Prototypes developed and tested from the work described provided empirical verification over several of our production and research IPv6 networks.
Seamless Mobility of Users with QoS and Connectivity Support
Authors: Luis Veloso, Eduardo Cerqueira, Edmundo Monteiro, Paulo Mendes
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

The popularity of mobile devices associated with the growing interest in multi-user real-time sessions, such as IPTV, is foreseen as having a strong impact in the architecture of future heterogeneous networks. An important issue that needs to be solved concerns the capability to provide a seamless experience and an assured quality to the user independently of the connectivity technology supported by the mobile devices and offered by each network along the end-to- end path (e.g., unicast and/or multicast). In this paper, a solution to provide seamless mobility to users with connectivity and Quality of Service (QoS) control is presented. Seamless mobility is achieved through the use of buffers during movement and caches after the handover, and the quality level of the ongoing session is supported by using an end-to-end QoS mapping, QoS adaptation and connectivity control scheme. The obtained results confirm the capability of the proposal to avoid packet losses resulting from handover, and to improve the perceived quality of a received video sequence.
Bayesian approaching for Asian Suprema soybean rust incidence study in different conditions of temperatures and leaf wetness
Authors: Ricardo M. A. Silva, Felipe L. Valentim, Marcelo de C. Alves
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

The Asian soybean rust (Phakopsora pachyrhizi H. Sydow & P. Sydow), which has been reported in areas of tropical and subtropical climates around the world, causes significant soybean (Glycine max L. Merr.) yield reduction. The disease progress is influenced by biotic factors such as interaction pathogen/host and abiotic factors of the environment. This work presents three models using bayesian approach to study Asian Suprema soybean rust incidence in different temperature and leaf wetness conditions. The models present estimates equivalents to non-linear regression model of Reis et al [12], fuzzy model of Alves et al [2] and neuro-fuzzy model of Silva et al [14], when compared on the results from experimental design realized by Alves et al [1].
Particle filtering on the Euclidean group: framework and applications
Authors: Junghyun Kwon, Minseok Choi, F. C. Park, Changmook Chun
Venue: Robotica (2007)

We address general filtering problems on the Euclidean group SE(3). We first generalize, to stochastic nonlinear systems evolving on SE(3), the particle filter of Liu and West for simultaneous estimation of the state and covariance. The filter is constructed in a coordinate-invariant way, and explicitly takes into account the geometry of SE(3) and P(n), the space of symmetric positive definite matrices. Some basic results for bilinear systems on SE(3) with linear and quadratic measurements are also derived. Three examples—GPS attitude estimation, needle tip location, and vision-based robot end-effector pose estimation—are presented to illustrate the framework.
Fast Perspective Views of Images Using One-Dimensional Operations
Authors: P. Robertson
Venue: IEEE Computer Graphics and Applications (1987)

Generating arbitrary perspective views of images portraying 3D surfaces can involve extensive computation and data I/O time because of the problems in determining visibility, and performing hidden-point removal. Appropriate 1D transforms of an image can allow hidden-point removal and perspective projection to be performed on scan lines or columns of these transforms. Perspective view generation then reduces to a series of extremely fast 1D operations. As a result, exact perspective views of 3D surfaces of unlimited size can be generated very much more rapidly than hitherto possible, making this a feasible interactive tool in image analysis. Maximum speed is possible when entire data sets can be stored in random access memory (RAM). However, the scan-line nature of the algorithm also allows sequential processing of data stored on disk, and fast image transposition methods allow the generation of views of surfaces much larger than available memory.
Good System Structure Features: Their Complexity and Execution Time Cost
Authors: J. A. Stankovic
Venue: IEEE Transactions on Software Engineering (1982)

This paper describes a multistep technique that can be applied to improve system structure and to improve performance when necessary. The technique begins with the analysis of system structure via the structured design guidelines of coupling and cohesion. Next, manual system structure improvement transformations are applied. The effect of the transformations on execution time is then determined. Finally, vertical migration is used on the restructured system to improve its performance. Using the results of this paper, system programmers can identify specific cases where both good system structure and good performance are attainable, and others where tradeoffs must be made. The technique is most applicable during the maintenance phase of the software life cycle.
Neighborhood Rank Order Coding for Robust Texture Analysis and Feature Extraction
Authors: Christian Mayr, Rene Schuffny
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

Research into the visual cortex and general neural information processing has led to various attempts to integrate pulse computation schemes in image analysis systems. Of interest is especially the robustness of representing an analogue signal in the phase or duration of a pulsed, quasi-digital signal, as well as the possibility of direct digital interaction, i.e. computation, among these signals. Such a computation can also achieve information compaction for subsequent processing stages. By using a pulse order encoding scheme motivated by dendritic pulse interaction, we will show that a powerful low-level feature and texture extraction operator, called Pulsed Local Orientation Coding (PLOC), can be implemented. Feature extraction results are being presented, and a possible VLSI implementation is detailed.
Interactive control of physically-valid aerial motion: application to VR training system for gymnasts
Authors: Franck Multon, Ludovic Hoyet, Taku Komura, Richard Kulpa
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

This paper aims at proposing a new method to animate aerial motions in interactive environments while taking dynamics into account. Classical approaches are based on spacetime constraints and require a complete knowledge of the motion. However, in Virtual Reality, the user's actions are unpredictable so that such techniques cannot be used. In this paper, we deal with the simulation of gymnastic aerial motions in virtual reality. A user can directly interact with the virtual gymnast thanks to a real-time motion capture system. The user's arm motions are blended to the original aerial motions in order to verify their consequences on the virtual gymnast's performance. Hence, a user can select an initial motion, an initial velocity vector, an initial angular momentum, and a virtual character. Each of these choices has a direct influence on mechanical values such as the linear and angular momentum. We thus have developed an original method to adapt the character's poses at each time step in order to make these values compatible with mechanical laws: the angular momentum is constant during the aerial phase and the linear one is determined at take-off. Our method enables to animate up to 16 characters at 30hz on a common PC. To sum-up, our method enables to solve kinematic constraints, to retarget motion and to correct it to satisfy mechanical laws. The virtual gymnast application described in this paper is very promising to help sports-men getting some ideas which postures are better during the aerial phase for better performance.
Deeper Bound in BMC by Combining Constant Propagation and Abstraction
Authors: Roy Armoni Limor Fix, Ranan Fraer, Tamir Heyman, Moshe Vardi, Yakir Vizel, Yael Zbar
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

The most successful technologies for automatic verification of large industrial circuits are bounded model checking, abstraction, and iterative refinement. Previous work has demonstrated the ability to verify circuits with thousands of state elements achieving bounds of at most a couple of hundreds. In this paper we present several novel techniques for abstraction-based bounded model checking. Specifically, we introduce a constant-propagation technique to simplify the formulas submitted to the CNF SAT solver; we present a new proof-based iterative abstraction technique for bounded model checking; and we show how the two techniques can be combined. The experimental results demonstrate our ability to handle circuit with several thousands state elements reaching bounds nearing 1,000.
Deadline-Oriented Servicing: Waiting-Time Distributions
Authors: B. Walke
Venue: IEEE Transactions on Software Engineering (1980)

An infinite queue single server model is considered where requests arrive from independent Poisson streams and demand service according to arbitrary distribution functions which may be different for different requests. Associated with each request is an urgency number which, together with request's time of arrival, defines a deadline for beginning its service. This relative urgency discipline has at its two limiting case the fint-come first-serve and head of the line discipline. In [1] the mean waiting time is computed approximately and dose bounds are derived there. Here we present simulation results, derive close approximations for the tails of the waiting-time distribution functions and compare them to those of the two limiting cases.
Robust computational secret sharing and a unified account of classical secret-sharing goals
Authors: Phillip Rogaway, Mihir Bellare
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

We give a unified account of classical secret-sharing goals from a modern cryptographic vantage. Our treatment encompasses perfect, statistical, and computational secret sharing; static and dynamic adversaries; schemes with or without robustness; schemes where a participant recovers the secret and those where an external party does so. We then show that Krawczyk's 1993 protocol for robust computational secret sharing (RCSS) need not be secure, even in the random-oracle model and for threshold schemes, if the encryption primitive it uses satisfies only one-query indistinguishability (ind1), the only notion Krawczyk defines. Nonetheless, we show that the protocol is secure (in the random-oracle model, for threshold schemes) if the encryption scheme also satisfies one-query key-unrecoverability (key1). Since practical encryption schemes are ind1+key1 secure, our result effectively shows that Krawczyk's RCSS protocol is sound (in the random-oracle model, for threshold schemes). Finally, we prove the security for a variant of Krawczyk's protocol, in the standard model and for arbitrary access structures, assuming ind1 encryption and a statistically-hiding, weakly-binding commitment scheme.
Multiple Fault Detection in Combinational Circuits: Algorithms and Computational Results
Authors: Min-Wen Du
Venue: IEEE Transactions on Computers (1973)

A new approach is developed for finding multiple fault detection tests under quite arbitrary fault models. Computational results are reported and discussed.