ppxscal/embedding_network huggingface dataset:
SSF fingerprint for image authentication: an incidental distortion resistant scheme
Authors: Sheng Tang, Jin-Tao Li, Yong-Dong Zhang
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

We propose a novel method for image authentication which can distinguish incidental manipulations from malicious ones. The authentication fingerprint is based on the Hotelling's T-square statistic (HTS) via Principal Component Analysis (PCA) of block DCT coefficients. HTS values of all blocks construct an unique and stable "block-edge image", i.e., Structural and Statistical Fingerprint (SSF). The characteristic of the SSF is that it is short, and can tolerate content-preserving modifications while keeping sensitive to content-changing modifications, and can locate tampered blocks easily. Furthermore, we use Fisher criterion to obtain optimal threshold for distinguishing manipulations. The security of the SSF is also achieved by encryption of the DCT coefficients with chaotic sequences. Experiments show that the proposed method is effective for authentication.
Exploiting the replication cache to improve performance for multiple-issue microprocessors
Authors: Bramha Allu, Wei Zhang
Venue: ACM SIGARCH Computer Architecture News (2005)

Performance and reliability are both of great importance for microprocessor design. Recently, the replication cache has been proposed to enhance data cache reliability against soft errors. The replication cache is a small fully associative cache to store the replica for every write to the L1 data cache. In addition to enhance data reliability, this paper proposes several cost-effective techniques to improve performance of multiple-issue microprocessors by exploiting the replication cache. The idea is to make use of the replication cache to increase cache bandwidth through dual load and to reduce the L1 data cache miss rate through partial victim caching. Built upon these two schemes, we also propose a hybrid approach to combine the benefits of both dual load and partial victim caching for improving performance further. Our experimental results show that exploiting a replication cache with only 8 entries can improve performance by 13.0% on average without compromising the enhanced data integrity.
A contribution towards the measurement of user behavior: an analysis of SPSS-use and -users
Authors: Helmut G. Wilke
Venue: ACM SIGSOC Bulletin (1982)

Within the context of a university computing center, user and uses of SPSS (Statistical Package for the Social Sciences) have been investigated. Several methods of data collection are discussed and results are presented. Besides a general user survey and general accounting data, a statistical software logfile proved to be an elegant and powerful method to obtain information on the basis of individual runs.
Discovery of Prokaryotic Relationships through Latent Structure of Correlated Nucleotide Sequences
Authors: Natalya Muzinich
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

This paper describes an application of statistical techniques that have yielded fruitful results in many fields including artificial intelligence and information retrieval to the problem of establishing relationships among organisms. A combination of these techniques constitutes a new method of comparing organisms based on their whole genomic sequences. The method represents genomes as sets of short overlapping nucleotide subsequences and employs latent structure modeling to capture correlations in the observed patterns of their distribution. Factor scores computed to measure the correlations serve as the input to a Ward¿s hierarchical cluster analysis method, which produces a tree of their relationships. The runtime results indicate that this method allows for the fast and efficient comparison that scales well as the number of organisms increases.
Semantics-Based Content Extraction in Typewritten Historical Documents
Authors: A. Antonacopoulos, D. Karatzas
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper presents a flexible approach to extracting content from scanned historical documents using semantic information. The final electronic document is the result of a "digital historical document lifecycle" process, where the expert knowledge of the historian/archivist user is incorporated at different stages. Results show that such a conversion strategy aided by (expert) user-specified semantic information and which enables the processing of individual parts of the document in a specialised way, produces superior (in a variety of significant ways) results than document analysis and understanding techniques devised for contemporary documents.
A multi-population genetic algorithm for robust and fast ellipse detection
Authors: Jie Yao, Nawwaf Kharma, Peter Grogono
Venue: Pattern Analysis Applications (2005)

This paper discusses a novel and effective technique for extracting multiple ellipses from an image, using a genetic algorithm with multiple populations (MPGA). MPGA evolves a number of subpopulations in parallel, each of which is clustered around an actual or perceived ellipse in the target image. The technique uses both evolution and clustering to direct the search for ellipses&#x2014;full or partial. MPGA is explained in detail, and compared with both the widely used randomized Hough transform (RHT) and the sharing genetic algorithm (SGA). In thorough and fair experimental tests, using both synthetic and real-world images, MPGA exhibits solid advantages over RHT and SGA in terms of accuracy of recognition&#x2014;even in the presence of noise or/and multiple imperfect ellipses in an image&#x2014;and speed of computation.
A Generic Method for Determining the Up/Down Orientation of Text in Roman and Non-roman Scripts
Authors: Hrishikesh B. Aradhye
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper presents a method for determining the up/down orientation of text in a scanned document of unknown orientation. The method analyzes the "open" portions of text blobs to determine the direction in which the open portions face. By determining the respective densities of blobs opening in a pair of opposite directions (e.g., right or left), the method can establish the direction in which the text as a whole is oriented. We first discuss the orientation of roman text based on the asymmetry in the openness of roman letters in the horizontal direction. For non-roman text such as Pashto and Hebrew, we determine a direction that is the most asymmetric, and therefore the most useful for orientation, given a training dataset. This direction is then used for orientation. This work can be used for automated orientation of mail, checks in ATM envelopes, and scanned, copied, or faxed documents.
Location Aware Messaging - Integrating LBS Middleware and Converged Services
Authors: Ying CHEN, Wei LU, Xiaoyan CHEN, Lihua TANG, Fangyan RAO, Qingbo WANG, Long ZHANG
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

With the advent of next generation communication infrastructure where Internet and telecommunication network could work together to provide converged services like (messaging, presence and call control), Location-based Services requires not only flexible and scalable middleware that supports three LBS service models: pull, poll and push, but also advanced converged service platform that supports LBS applications in future communication infrastructure. Motivated by a typical scenario that requires location aware converged services described in the paper, key techniques are identified for building such a system. Based on our ongoing research work on NextGen LBS middleware and Converged Service, we built a location-aware massaging system for coming visitors. By marrying LBS middleware and converged service platform, we experimented LBS running on converged service network, collected requirements of LBS applications to the converged service platform, and explored new features in LBS on the converged service platform. The overall architecture and key components of the LBS middleware and converged services are also presented.
Scalable Parallel Octree Meshing for TeraScale Applications
Authors: TIANKAI TU, DAVID R. O'HALLARON, OMAR GHATTAS
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

We present a new methodology for generating and adapting octreemeshes for terascale applications. Our approach combines existing methods,such as parallel octree decomposition and space-filling curves, with a setof new methods that address the special needs of parallel octree meshing.We have implemented these techniques in a parallel meshing tool called Octor.Performance evaluations on up to 2000 processors show that Octor has goodisogranular scalability, fixed-size scalability, and absolute running time. Octor also provides a novel data access interface to parallel PDE solvers andparallel visualization pipelines, making it possible to develop tightly coupledend-to-end finite element simulations on terascale systems.
Mobile traffic sensor network versus motion-MIX: tracing and protecting mobile wireless nodes
Authors: Jiejun Kong, Dapeng Wu, Xiaoyan Hong, Mario Gerla
Venue: Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks (2005)

In this paper we focus on passive attacks that threaten the privacy of mobile wireless networks. We define the concept of "venue privacy attack" (VPA) to illustrate the emerging anonymity attacks to trace mobile wireless nodes. Then we propose "motion-MIX" as the countermeasure to defend against various venue privacy attacks. We study the necessary conditions to implement motion-MIXes. These conditions include identity-free routing, one-time packet content and various other concerns in the network protocol stack. Then we use a new asymptotic security model to verify motion-MIX's effectiveness against venue privacy attacks. In a scalable ad hoc network, we prove that the probability of security breach is negligible (aka. sub-polynomial) with respect to the polynomial-bounded network scale (i.e., number of node in the network). This notion is conforming to the existing security notions in computational cryptography, where the polynomial-bounded metric is key length.
Designing robot applications for everyday environments
Authors: Sara Ljungblad, Lars Erik Holmquist
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

We report from the workshop "Designing robot applications for everyday use". This event gathered robot researchers and interaction designers from several countries in order to push robot application domains in novel directions. This article presents the methods we used for breaking out of limited views of robots, and our process for refining ideas to more realistic product opportunities. Based on the results of the workshop, we discuss current challenges of extending the design space of novel robot product ideas.
Low Power BIST Based on Scan Partitioning
Authors: Jinkyu Lee, Nur A. Touba
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

A built-in self-test (BIST) scheme is presented which both reduces overhead for detecting random-pattern-resistant (r.p.r.) faults as well as reduces power consumption during test. 3-valued weights are employed to detect the r.p.r. faults. The key idea is to use a new scan partitioning technique and decoding methodology that exploits correlations in the weight sets to greatly reduce the hardware overhead for multiple weight sets and reduce the number of transitions during scan shifting. The proposed scheme is simple to implement and only constrains the partitioning of scan elements into scan chains and not the scan order thereby having minimal impact on routing. Consequently, the proposed scheme can be easily implemented in standard design flows used in industry. Experiments indicate the scheme can achieve 100% fault coverage and % to 9% scan power reduction with relatively small hardware overhead.
Multiprotocol Label Switching and IP, Part 2: Multicast Virtual Private Networks
Authors: Chris Metz
Venue: IEEE Internet Computing (2006)

Part 1 of this series discussed a solution for running Multiprotocol Label Switching virtual private networks (MPLS VPNs) across a service provider's native IP network. Yet, MPLS VPNs support only unicast routing, whereas many of the enterprise customers that use the service run applications that require IP multicast. This article examines multicast VPN (mVPN),which provides the ability to support IP multicast across MPLS VPNs. Service providers can thus offer IP VPN services that support unicast and multicast applications.
Exploiting structure to efficiently solve large scale partially observable markov decision processes
Authors: Pascal Poupart
Venue:  (2005)

Partially observable Markov decision processes (POMDPs) provide a natural and principled framework to model a wide range of sequential decision making problems under uncertainty. To date, the use of POMDPs in real-world problems has been limited by the poor scalability of existing solution algorithms, which can only solve problems with up to ten thousand states. In fact, the complexity of finding an optimal policy for a finite-horizon discrete POMDP is PSPACE-complete. In practice, two important sources of intractability plague most solution algorithms: Large policy spaces and large state spaces. On the other hand, for many real-world POMDPs it is possible to define effective policies with simple rules of thumb. This suggests that we may be able to find small policies that are near optimal. This thesis first presents a Bounded Policy Iteration (BPI) algorithm to robustly find a good policy represented by a small finite state controller. Real-world POMDPs also tend to exhibit structural properties that can be exploited to mitigate the effect of large state spaces. To that effect, a value-directed compression (VDC) technique is also presented to reduce POMDP models to lower dimensional representations. In practice, it is critical to simultaneously mitigate the impact of complex policy representations and large state spaces. Hence, this thesis describes three approaches that combine techniques capable of dealing with each source of intractability: VDC with BPI, VDC with Perseus (a randomized point-based value iteration algorithm by Spaan and Vlassis [136]), and state abstraction with Perseus. The scalability of those approaches is demonstrated on two problems with more than 33 million states: synthetic network management and a real-world system designed to assist elderly persons with cognitive deficiencies to carry out simple daily tasks such as hand-washing. This represents an important step towards the deployment of POMDP techniques in ever larger, real-world, sequential decision making problems.
Predicting probability distributions for surf height using an ensemble of mixture density networks
Authors: Michael Carney, Pádraig Cunningham, Jim Dowling, Ciaran Lee
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

There is a range of potential applications of Machine Learning where it would be more useful to predict the probability distribution for a variable rather than simply the most likely value for that variable. In meteorology and in finance it is often important to know the probability of a variable falling within (or outside) different ranges. In this paper we consider the prediction of surf height with the objective of predicting if it will fall within a given 'surfable' range. Prediction problems such as this are considerably more difficult if the distribution of the phenomenon is significantly different from a normal distribution. This is the case with the surf data we have studied. To address this we use an ensemble of mixture density networks to predict the probability density function. Our evaluation shows that this is an effective solution. We also describe a web-based application that presents these predictions in a usable manner.
Correctness Verification and Performance Analysis of Real-Time Systems Using Stochastic Preemptive Time Petri Nets
Authors: Giacomo Bucci, Luigi Sassoli Enrico Vicario
Venue: IEEE Transactions on Software Engineering (2005)

Time Petri Nets describe the state of a timed system through a marking and a set of clocks. If clocks take values in a dense domain, state space analysis must rely on equivalence classes. These support verification of logical sequencing and quantitative timing of events, but they are hard to be enriched with a stochastic characterization of nondeterminism necessary for performance and dependability evaluation. Casting clocks into a discrete domain overcomes the limitation, but raises a number of problems deriving from the intertwined effects of concurrency and timing. We present a discrete-time variant of Time Petri Nets, called stochastic preemptive Time Petri Nets, which provides a unified solution for the above problems through the adoption of a maximal step semantics in which the logical location evolves through the concurrent firing of transition sets. We propose an analysis technique, which integrates the enumeration of a succession relation among sets of timed states with the calculus of their probability distribution. This enables a joint approach to the evaluation of performance and dependability indexes as well as to the verification of sequencing and timeliness correctness. Expressive and analysis capabilities of the model are demonstrated with reference to a real-time digital control system.
Aspect-oriented development of distributed object applications
Authors: Eric A. Wohlstadter
Venue:  (2005)

It is often useful to distinguish between the definition of a core software system and features that may apply to it. A feature is an optional extension of the original system. Systems need to be adapted in order to take on new features. Distributed heterogeneous software is particularly hard to adapt for deployment in disparate execution environments. We introduce the concept of an adaptation service to coordinate crosscutting modifications to standard program components, transparently. This is achieved through Aspect-Oriented Programming. A service is made up of client- and server-side components called adaptlets. At run-time a protocol, GlueQoS, can be used to determine what adaptlets are activated. The goal is to reduce development costs associated with middleware application maintenance and deployment.
Event: scheduling simulation program modules
Authors: Leon Katz
Venue: ACM SIGSIM Simulation Digest (1976)

A standard set of event-scheduling simulation program modules is presented. The basis for these program modules is empirical and subjective. In the author's experience, the arrangement of a program into these modules has proven beneficial.
Safety Analysis of Software Product Lines Using State-Based Modeling
Authors: Jing Liu, Josh Dehlinger, Robyn Lutz
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

The analysis and management of variations (such as optional features) are central to the development of safety-critical, software product lines. However, the difficulty of managing variations, and the potential interactions among them, across an entire product line currently hinders safety analysis in such systems. The work described here contributes to a solution by integrating safety analysis of a product line with model-based development. This approach provides a structured way to construct a state-based model of a product line having significant, safety-related variations. The process described here uses and extends previous work on product-line Software Fault Tree Analysis to explore hazard-prone variation points. The process then uses scenario-guided executions to exercise the state model over the variations as a means of validating the product-line safety properties. Using an available tool, relationships between behavioral variations and potentially hazardous states are systematically explored and mitigation steps are identified. The paper uses a product line of embedded medical devices to demonstrate and evaluate the process and results.
Supervised versus multiple instance learning: an empirical comparison
Authors: Soumya Ray, Mark Craven
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We empirically study the relationship between supervised and multiple instance (MI) learning. Algorithms to learn various concepts have been adapted to the MI representation. However, it is also known that concepts that are PAC-learnable with one-sided noise can be learned from MI data. A relevant question then is: how well do supervised learners do on MI data? We attempt to answer this question by looking at a cross section of MI data sets from various domains coupled with a number of learning algorithms including Diverse Density, Logistic Regression, nonlinear Support Vector Machines and FOIL. We consider a supervised and MI version of each learner. Several interesting conclusions emerge from our work: (1) no MI algorithm is superior across all tested domains, (2) some MI algorithms are consistently superior to their supervised counterparts, (3) using high false-positive costs can improve a supervised learner's performance in MI domains, and (4) in several domains, a supervised algorithm is superior to any MI algorithm we tested.
Reference specification in multilingual document production
Authors: Barbara J. Grosz
Venue:  (2005)

To produce documents in multiple languages automatically requires a language-independent representation of the documents' meaning. For a person to build this language-independent representation by communicating in natural language with a computer system, the problem of reference must be addressed. This problem, inherent in natural language, presents itself not only in the specification of the language-independent representation, but also in the generation of documents with the meaning contained in this representation. This thesis presents methods to make both the specification of entities in the user interface and the generation of expressions to refer to these entities in documents more natural and provides empirical evidence demonstrating the efficacy of these methods. More specifically, this thesis describes the development of three types of reference mechanisms: a statistical model that uses domain and lexical knowledge to organize new options in the interface; techniques for controlling coreference specification that take advantage of discourse structure and genre features; and automatically learned models for generating expressions to refer to new and already mentioned entities in a particular domain. The evaluation of these reference mechanisms establishes that specifying new entities using an interface informed by computational linguistic processing reduces the amount of time required to refer to entities in the interface; exploiting discourse structure and genre features is more helpful than traditional knowledge-editing interfaces for referring to entities in the interface that are already contained in the knowledge representation; and using learned linguistic information to generate referring expressions in documents leads to expressions that more closely match the decisions of people.