ppxscal/embedding_network huggingface dataset:
Globally Consistent Reconstruction of Ripped-Up Documents
Authors: Liangjia Zhu, Zongtan Zhou, Dewen Hu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

One of the most crucial steps for automatically reconstructing ripped-up documents is to find a globally consistent solution from the ambiguous candidate matches. However, little work has been done so far to solve this problem in a general computational framework without using application-specific features. In this paper, we propose a global approach for reconstructing ripped-up documents by first finding candidate matches from document fragments using curve matching and then disambiguating these candidates through a relaxation process to reconstruct the original document. The candidate disambiguation problem is formulated in a relaxation scheme, in which the definition of compatibility between neighboring matches is proposed and global consistency is defined as the global criterion. Initially, global match confidences are assigned to each of the candidate matches. After that, the overall local relationships among neighboring matches are evaluated by computing their global consistency. Then these confidences are iteratively updated using the gradient projection method to maximize the criterion. This leads to a globally consistent solution and thus provides a sound document reconstruction. The overall performance of our approach in several practical experiments is illustrated. The results indicate that the reconstruction of ripped-up documents up to fifty pieces is possibly accomplished automatically.
Matching twigs in probabilistic XML
Authors: Benny Kimelfeld, Yehoshua Sagiv
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of probabilistic XML, the evaluation of twigs with projection is tractable under data complexity (whereas in other probabilistic data models, projection is intractable). Under query-and-data complexity, the problem becomes intractable even without projection (and for rather simple twigs and data). In earlier work on probabilistic XML, answers are always complete. However, there is often a need to produce partial answers because XML data may have missing sub-elements and, furthermore, complete answers may be deemed irrelevant if their probabilities are too low. It is shown how to define a semantics that provides partial answers that are maximal with respect to a probability threshold, which is specified by the user. For this semantics, it is shown how to efficiently evaluate twigs, even under query-and-data complexity if there is no projection.
DoS Evading Mechanism upon Service Hopping
Authors: Leyi Shi, Chunfu Jia, Shuwang Lu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Motivated by frequency hopping for military environment, this paper introduces a DoS/DDoS evading paradigm through service hopping technique, which changes the service information such as port number or network address pseudo-randomly. A skeleton of DoS evading is established upon hopping tactic. Thereafter, theoretical analysis of evading performance is carried out; experimental validation is well performed on a centralized hopping prototype and a distributed system. Our study shows that faster tactic of port and address hopping can be able to provide better service under DoS attacks; however, excessively faster scheme would cause much service problem because of transmission delay and traffic jam.
Robustness Reducing Model of Distributed Artificial Immune System
Authors: Tao Gong, Zixing Cai
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

With the model of reducing robustness for the distributed multi-agent system, the robustness analysis problem of the distributed artificial immune system (DAIS) was reduced into robustness analysis problems of all the independent modules of the system. The artificial immune system (AIS) included the module of modeling the normal model, the module of detecting selfs and non-selfs, the module of recognizing known non-selfs, the module of learning unknown non-selfs, the module of eliminating non-selfs and the module of repairing the damaged system. After analyzing the robustness of the artificial immune system with the problem reduction method, the model of reducing robustness of the distributed artificial immune system was built. Proved by some theorems, the model of reducing robustness can reduce and simplify the robustness analysis problem of the distributed artificial immune system, and the problem can be solved after the robustness analysis problems of all the modules are solved. Therefore, the model of reducing robustness of the distributed artificial immune system is a useful tool to analyze robustness, and provides an effective approach for analyzing robustness of complex artificial immune system.
Generic Component: A Generic Programming Approach
Authors: Chen Yewang, Jiang Zhixiong, Zhao Wenyun, Peng Xin
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Generic Programming (GP) is the evolvement of OO, and more general than OO. In a certain degree, it is requirement-oriented programming. This paper, firstly, addresses some insufficiencies of OO; secondly illustrates an overview of GP briefly, then compare it with OO; finally proposes Generic Component approach which helps in implementing safe, efficient, highly customizable, and reusable design elements in GP. We do not declare that this approach can solve all problems of OO, but it gifts developers the ability of assembling what they want in the way of Design-Oriented, as well as many other advantages.
A Light-Weight Implementation Scheme of the Tree Morphing Protocol for Mobile Multicast Sources
Authors: Olaf Christ, Thomas C. Schmidt, Matthias Wahlisch
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Multicast network services advantageously complement multimedia information and communication technologies, as they open up the realm for highly scalable multicustomer applications. Mobile environments providing shared limited bandwidth to a growing number of users will emphasize the need for multicast support even further. The traditional Internet approach of Any Source Multicast (ASM) routing, though, remains hesitant to spread beyond limited, controlled environments. It is widely believed that simpler and more selective mechanisms for group distribution in Source Specific Multicast (SSM) will globally disseminate to many users of multicast infrastructure and services. However, mobility support for Source Specific Multicast is still known to be a major open problem. This paper presents a light-weight, secure implementation of the Tree Morphing protocol on the IPv6 network layer. This distributed routing algorithm allows for a continuous adaptation of multicast shortest path trees to source mobility. The approach introduced here is built upon standardized mobility signaling and includes strong authentication by means of cryptographically generated addresses. It neither requires definition of new protocol elements nor significant changes to the forwarding plane.
Immuno-inspired autonomic system for cyber defense
Authors: Dipankar Dasgupta
Venue: Information Security Tech. Report (2007)

The biological immune system is an autonomic system for self-protection, which has evolved over millions of years probably through extensive redesigning, testing, tuning and optimization process. The powerful information processing capabilities of the immune system, such as feature extraction, pattern recognition, learning, memory, and its distributive nature provide rich metaphors for its artificial counterpart. Our study focuses on building an autonomic defense system, using some immunological metaphors for information gathering, analyzing, decision making and launching threat and attack responses. This on-going research effort is not to mimic the nature but to explore and learn valuable lessons useful for self-adaptive cyber defense systems.
Jumble Java Byte Code to Measure the Effectiveness of Unit Tests
Authors: Sean A. Irvine, Tin Pavlinic, Leonard Trigg, John G. Cleary, Stuart Inglis, Mark Utting
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

Jumble is a byte code level mutation testing tool for Java which inter-operates with JUnit. It has been designed to operate in an industrial setting with large projects. Heuristics have been included to speed the checking of mutations, for example, noting which test fails for each mutation and running this first in subsequent mutation checks. Significant effort has been put into ensuring that it can test code which uses custom class loading and reflection. This requires careful attention to class path handling and coexistence with foreign class-loaders. Jumble is currently used on a continuous basis within an agile programming environment with approximately 370,000 lines of Java code under source control. This checks out project code every fifteen minutes and runs an incremental set of unit tests and mutation tests for modified classes. Jumble is being made available as open source.
Tracking Uncertainty with Probabilistic Logic Circuit Testing
Authors: Smita Krishnaswamy, Igor L. Markov, John P. Hayes
Venue: IEEE Design Test (2007)

Probabilistic faults are increasingly affecting logic circuits in the nanometer realm. Examples include transients caused by cosmic radiation, randomness in quantum and nanocircuits, and process variability in manufacturing. The authors of this article generalize the variations caused by these faults to the notion of a probabilistic fault model. They then delineate the differences between these faults and the more traditional deterministic faults. Such effects require a reformulation of testing and test-generation methods. In particular, the same fault can be detected by several test vectors, with varying probabilities. The authors call the probability that a test vector detects a fault its "sensitivity" to the fault. They propose test generation methods for probabilistic faults with the goal of bounding and estimating fault probabilities. Finally, the authors propose a fault-modeling framework for efficient representation of probabilistic faults, algorithms to compute test-vector sensitivity, and integer linear programming (ILP) to generate compact test sets with high probabilities of coverage.
Computer aided modelling exercises
Authors: Monique Snoeck, Raf Haesen, Herman Buelens, Manu De Backer, Geert Monsieur
Venue: Informatics in education (2007)

This paper describes a didactical Computer Aided Software Engineering (CASE)-tool that was developed for use within the context of a course in object-oriented domain modelling. In particular, the tool was designed to address several inconveniences that challenge the realisation of the course objectives: the number of students enrolled does not allow for individual feedback (a); students have little opportunity to build a concrete information system, therefore they fail to predict the consequences of the different choices when building a conceptual model (b); students lack examples and practice on how to convert a conceptual model into a concrete information system (c); at the beginning of the course students have very different levels of prior knowledge leading to major differences in motivation and learning outcomes (d). The tool was evaluated positively by the students and was shown to have a positive impact on the student's capabilities to construct object-oriented models. It is argued that even better learning results can be realised by capitalizing on the opportunities for social interaction in an educational context.
RAIF: Redundant Array of Independent Filesystems
Authors: Nikolai Joukov, Arun M. Krishnakumar, Chaitanya Patti, Abhishek Rai, Sunil Satnur, Avishay Traeger, Erez Zadok
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

Storage virtualization and data management are well known problems for individual users as well as large organizations. Existing storage-virtualization systems either do not support a complete set of possible storage types, do not provide flexible data-placement policies, or do not support per-file conversion (e.g., encryption). This results in suboptimal utilization of resources, inconvenience, low reliability, and poor performance. We have designed a stackable file system called Redundant Array of Independent Filesystems (RAIF). It combines the data survivability and performance benefits of traditional RAID with the flexibility of composition and ease of development of stackable file systems. RAIF can be mounted on top of directories and thus on top of any combination of network, distributed, disk-based, and memory-based file systems. Individual files can be replicated, striped, or stored with erasure-correction coding on any subset of the underlying file systems. RAIF has similar performance to RAID. In configurations with parity, RAIF's write performance is better than the performance of driver-level and even entry-level hardware RAID systems. This is because RAIF has better control over the data and parity caching.
MF1: security by construction
Authors: Rod Chapman
Venue: ACM SIGAda Ada Letters (2007)

Practising software engineers, programme managers, and those involved with procurement of high-integrity software systems might attend this tutorial. Some background in the development of safety- or security-critical software might be useful, but not essential. This tutorial will cover the use of "Correctness by Construction" (CbyC) techniques in the development of highly secure software systems. While the use of CbyC is well-known in the development of safety-related systems, it has also been deployed in the domain of highly secure systems. The software world seems plagued by security problems caused by basic mistakes in software design and construction, but this tutorial will show how practices from the safety-critical domain can be used to tackle these problems. In particular, the role of formal methods, programming language design, and strong static verification will be covered. The tutorial will be illustrated with reference to CbyC security projects such as the MULTOS CA and the NSA Tokeneer system. Software security is one of the highest-profile and most important topics facing researchers today. The plague of "buffer overflow" and similar attacks that we read about every day seem almost endemic, yet these are problems that have been faced (and solved) by the safety-critical community for many years. This tutorial will recount our experience in building high-grade secure systems using the CbyC approach developed by Praxis over the last 15 years.
ECG signal denoising and baseline wander correction based on the empirical mode decomposition
Authors: Manuel Blanco-Velasco, Binwei Weng, Kenneth E. Barner
Venue: Computers in Biology and Medicine (2008)

The electrocardiogram (ECG) is widely used for diagnosis of heart diseases. Good quality ECG are utilized by physicians for interpretation and identification of physiological and pathological phenomena. However, in real situations, ECG recordings are often corrupted by artifacts. Two dominant artifacts present in ECG recordings are: (1) high-frequency noise caused by electromyogram induced noise, power line interferences, or mechanical forces acting on the electrodes; (2) baseline wander (BW) that may be due to respiration or the motion of the patients or the instruments. These artifacts severely limit the utility of recorded ECGs and thus need to be removed for better clinical evaluation. Several methods have been developed for ECG enhancement. In this paper, we propose a new ECG enhancement method based on the recently developed empirical mode decomposition (EMD). The proposed EMD-based method is able to remove both high-frequency noise and BW with minimum signal distortion. The method is validated through experiments on the MIT-BIH databases. Both quantitative and qualitative results are given. The simulations show that the proposed EMD-based method provides very good results for denoising and BW removal.
Gene symbol disambiguation using knowledge-based profiles
Authors: Hua Xu, Jung-Wei Fan, George Hripcsak, Eneida A. Mendonça, Marianthi Markatou, Carol Friedman
Venue: Bioinformatics (2007)

Motivation: The ambiguity of biomedical entities, particularly of gene symbols, is a big challenge for text-mining systems in the biomedical domain. Existing knowledge sources, such as Entrez Gene and the MEDLINE database, contain information concerning the characteristics of a particular gene that could be used to disambiguate gene symbols. Results: For each gene, we create a profile with different types of information automatically extracted from related MEDLINE abstracts and readily available annotated knowledge sources. We apply the gene profiles to the disambiguation task via an information retrieval method, which ranks the similarity scores between the context where the ambiguous gene is mentioned, and candidate gene profiles. The gene profile with the highest similarity score is then chosen as the correct sense. We evaluated the method on three automatically generated testing sets of mouse, fly and yeast organisms, respectively. The method achieved the highest precision of 93.9% for the mouse, 77.8% for the fly and 89.5% for the yeast. Availability: The testing data sets and disambiguation programs are available at http://www.dbmi.columbia.edu/~hux7002/gsd2006 Contact: friedman@dbmi.columbia.edu
Dynamic Group Membership Management for Distributed Interactive Applications
Authors: Knut-Helge Vik, Carsten Griwodz, Pal Halvorsen
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Distributed interactive applications have become in- creasingly popular, making it important to address their commu- nication needs, where one of the needs is group communication. In this paper, we consider the applications in which it is at any given time possible to divide its users into groups. The group membership changes over time, and the group division is unrelated to the physical proximity. As a way of enabling the group communication in distributed interactive applications, we choose application layer multicast. We use simulation to evaluate several dynamic algorithms for managing overlay multicast trees. They are compared with respect to four metrics that can be relevant for a distributed interactive application. These are total tree cost, diameter, reconfiguration time and stability. We demonstrate algorithms that perform well for these metrics although they do not consider all users during reconfiguration.
Identifying Code for Directed Graph
Authors: Yi-Chun Xu, Ren-Bin Xiao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Identifying code is a concept for undirected graph and can be applied to target identification. Its ability of identification comes from a fact that different elements in a system may have different neighbors. In this paper we extend the concept to directed graph. Then the determination rules, the concept of optimal identifying code, the formulation with integer program, and the solving steps are all extended. In this way, the identifying code problem and the alarm placement problem in earlier literatures are linked together and solved together.
The Performance Evaluation of Control Implementations
Authors: J. P. Kearns, Carol J. Meier, Mary Lou Soffa
Venue: IEEE Transactions on Software Engineering (1982)

A methodology for the experimental investigation of the implementation of control in programming languages is presented. The methodology specifies a data-collection technique, the environment for driving simulations of control implementations, and a meaningful metric for performance evaluation. The key in the methodology is the separation of activity which is affected by the control implementation from that which is not.
Simulation Optimization Based on the Hypothesis Testing and ITO Process
Authors: Wenyong Dong, Dengyi Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

The ITO algorithm, which is a new kind of simulation optimization methods and is based on the hypothesis testing and Ito stochastic process, is proposed in this paper. The local strategies and global strategies can be utilized to design the ITO algorithm. The experimental results show that the ITO algorithm is suitable for the simulation optimization problems. The methods to improve the evaluation credibility in the simulation optimization are also discussed. Moreover, in this paper, the credibility based on the hypothesis testing is also proposed.
Identification of Petri Nets from Knowledge of Their Language
Authors: Maria Paola Cabasino, Alessandro Giua, Carla Seatzu
Venue: Discrete Event Dynamic Systems (2007)

In this paper we deal with the problem of identifying a Petri net system, given a finite language generated by it. First we consider the problem of identifying a free labeled Petri net system, i.e., all transition labels are distinct. The set of transitions and the number of places is assumed to be known, while the net structure and the initial marking are computed solving an integer programming problem. Then we extend this approach in several ways introducing additional information about the model (structural constraints, conservative components, stationary sequences) or about its initial marking. We also treat the problem of synthesizing a bounded net system starting from an automaton that generates its language. Finally, we show how the approach can also be generalized to the case of labeled Petri nets, where two or more transitions may share the same label. In particular, in this case we impose that the resulting net system is deterministic. In both cases the identification problem can still be solved via an integer programming problem.
Extracting Qualitative States from Nonlinear Time Series Using Integration of Fuzzy c-Means and Hierarchical Clustering
Authors: Chenxi Shao, Jinfeng Fan, Xiaoping Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

A novel method combined fuzzy c-means (FCM) and hierarchical agglomerative clustering (HAC) is presented to extract the qualitative states from reconstructed phase space by considering the dynamical relations of underlying nonlinear system. The qualitative state, in which all points have similar properties, is characterized by three measures, linear density, temporal reachability, and stable degree, which are defined as the criteria of merging subclasses. The time series sampled from a classic nonlinear system, Lorenz system, and electroencephalogram (EEG) signals are used to test this method. The results show that the qualitative states can be efficiently distinguished from these time series by the proposed method.
Research on CCD Noise Signal Processing
Authors: Zhang Lin, Wu Xiaoqin, Hu Xueyou
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In CCD signal acquisition system, reset noise becomes important compared with the other noise sources at high pixel readout frequencies. According to CCD output noise characteristic, the noise transmission function and analysis model are established, the reset noises is tested by using the most suitable CDS technology. Experimental result shows that reset noises is farthest restrained only selecting suitable sampling time.