ppxscal/embedding_network huggingface dataset:
New intra-video collusion attack using mosaicing
Authors: G. Doerr, J.-L. Dugelay
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Recent efforts for watermarking digital video extend the results obtained for still image watermarking. As a result, most of the proposed algorithms rely on a frame-by-frame approach. Such an adaptation leads to unreliable algorithms in terms of security. The goal of this article is to stress the problem of collusion when digital watermarked data is distributed at large scale and especially intra-video collusion in the context of video. Three simple collusion attacks are described before being evaluated on two alternative video watermarking algorithms based on the spread spectrum technique. Finally, some experimental results are presented confirming the danger of intra-video collusion and some perspectives are discussed.
A Method of Nonlinear Manifold Classification using ISOMAP
Authors: Wu Lifang, Wei Ning, Wang Juanjuan, Guo Yue
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In this paper, a new nonlinear classification algorithm is proposed using Isomap (ISOmetric feature MAPping). First, nonlinear dimensionality reduction algorithm is implemented using Isomap; then nonlinear mapping matrix is approximated by local linear mapping; next dimensionality reduction for all data sets is implemented by local linear mapping; finally linear classification is implemented. Experimental results confirm the efficiency of proposed algorithm.
An Agent-Based Architecture for Context-Aware Services Supporting Human Interaction
Authors: Axel Burkle, Wilmuth Muller, Uwe Pfirrmann, Manfred Schenk, Nikolaos Dimakis, John Soldatos, Lazaros Polymenakos
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

In this paper we present an agent-based infrastructure, which provides integration and collaboration of autonomous, context-aware services in a heterogenous environment. Special consideration is given to the support for simultaneous service combination and coordination, a plug-in mechanism to enable distributed development and service composition, and the FIPA compliant implementation of the inter-agent communication using a well defined communication ontology. Furthermore, we give an example of the architecture's ability to support the cooperation of multiple services in a meeting scenario using an intelligent connector service and a semantic web oriented travel service.
An Imitation Method of Human Action Intelligence
Authors: Tao Shang, Shuoyu Wang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

It is well known that humans have high-level action intelligence. If such action intelligence could be represented in certain form, it can be applied to various fields such as the development of intelligent robot. Therefore we shall focus on imitation approach for the acquirement of human action intelligence. In this paper, from the perspective of emphasizing knowledge usage, we propose a novel imitation method of human action intelligence by using the Distance-Type Fuzzy Reasoning (DTFR) method with knowledge radius. Concretely, the employment of human action intelligence is achieved by DTFR method with knowledge radius; a learning algorithm for DTFR method, which is strongly combined with the DTFR method, is used for obtaining fuzzy rules representing human knowledge. Finally, based on a developed driving simulator, the effectiveness of proposed method is illuminated by experiment.
Performance Analysis of 2-tier Clustering
Authors: JunWon Hwang, DooHeon Song, ChangHoon Lee
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

In this paper, we have applied the 2-tier clustering, which uses the outcome of interaction with data from other tiers for the clustering of a certain tier, to efficiently model web user clustering. The 2-tier clustering is algorithm-free and is efficient in cases of high uncertainty in tier information. Analysis has been conducted on the performance parameters, which is required to efficiently run the 2-tier clustering.
Interplay between Syntax and Semantics during Sentence Comprehension: ERP Effects of Combining Syntactic and Semantic Violations
Authors: Peter Hagoort
Venue: Journal of Cognitive Neuroscience (2003)

This study investigated the effects of combined semantic and syntactic violations in relation to the effects of single semantic and single syntactic violations on language-related event-related brain potential (ERP) effects (N400 and P600/SPS). Syntactic violations consisted of a mismatch in grammatical gender or number features of the definite article and the noun in sentence-internal or sentence-final noun phrases (NPs). Semantic violations consisted of semantically implausible adjective&ndash;noun combinations in the same NPs. Combined syntactic and semantic violations were a summation of these two respective violation types. ERPs were recorded while subjects read the sentences with the different types of violations and the correct control sentences. ERP effects were computed relative to ERPs elicited by the sentence-internal or sentence-final nouns. The size of the N400 effect to the semantic violation was increased by an additional syntactic violation (the syntactic boost). In contrast, the size of the P600/SPS to the syntactic violation was not affected by an additional semantic violation. This suggests that in the absence of syntactic ambiguity, the assignment of syntactic structure is independent of semantic context. However, semantic integration is influenced by syntactic processing. In the sentence-final position, additional global processing consequences were obtained as a result of earlier violations in the sentence. The resulting increase in the N400 amplitude to sentence-final words was independent of the nature of the violation. A speeded anomaly detection task revealed that it takes substantially longer to detect semantic than syntactic anomalies. These results are discussed in relation to the latency and processing characteristics of the N400 and P600/SPS effects. Overall, the results reveal an asymmetry in the interplay between syntax and semantics during on-line sentence comprehension.
Modularly Certified Dynamic Storage Allocation in SCAP
Authors: Sen Xiang, Yiyun Chen, Chunxiao Lin, Long Li
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Critical applications and increasing scale of software hasmade software assurance a big problem. Currently, programmers can write type-safe codes in typed languageswith sound type systems, such as Java, Cyclone, even typed assembly language(TAL). But high assurance does mean not only type safe, but also correctness and security. Since type is not expressive enough, there are still no high assurance software released in typed language, especially operating system and runtime library, which are infrastructure softwares in the computing system. Logic predicates are more expressive than types, thus substituting types with logic predicates as program specification seems a good idea. In this paper, we present a certified dynamic storage allocation library (malloc/free) in SCAP, which is a new MIPS-like assembly language with expressive and power specification structure. And we encode the SCAP language and the certified library in a modern higher-order logic(HOL) proof assistant Coq. In this work, we confirm the expressiveness and modularity of SCAP. So we can expect SCAP to be a expressive target language for some safe high-level languages in the future.
Sustained chaos and control by means of weak periodic excitations: application to a class of nonlinear electronic systems
Authors: V. M. Preciado, R. Chacon, V. Tereshko
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

The problem of homoclinic chaos enhancement by means of weak periodic perturbations is studied for a broad class of dissipative nonautonomous systems subjected to two harmonic excitations (one of them chaos inducing). Theoretical results are derived from the basis of Melnikov's analysis. Analytical expressions for optimal values of initial phase differences between excitations in order to obtain an optimal chaos-inducing situation are derived. Robustness to noise is experimentally proved by the application of this technique in the induction of chaos in a nonlinear electronic circuit.
Prematerialization: reducing register pressure for free
Authors: Ivan D. Baev, Richard E. Hank, David H. Gross
Venue: Proceedings of the 15th international conference on Parallel architectures and compilation techniques (2006)

Modern compiler transformations that eliminate redundant computations or reorder instructions, such as partial redundancy elimination and instruction scheduling, are very effective in improving application performance but tend to create longer and potentially more complex live ranges. Typically the task of dealing with the increased register pressure is left to the register allocator. To avoid introduction of spill code which can reduce or completely eliminate the benefit of earlier optimizations, researchers have developed techniques such as live range splitting and rematerializatio.This paper describes prematerialization (PM), a novel method for reducing register pressure for VLIW architectures with nop instructions. PM and rematerialization both select "never killed" live ranges and break them up by introducing one or more definitions close to the uses. However, while rematerialization is applied to live ranges selected for spilling during register allocation, PM relies on the availability of nop instructions and occurs prior to register allocation. PM simplifies register allocation by creating live ranges that are easier to color and less likely to spill. We have implemented prematerialization in HP-UX production compilers for the Intel® Itanium® architecture. Performance evaluation indicates that the proposed technique is effective in reducing register pressure inherent in highly optimized code.
Towards A Service Requirements Ontology on Knowledge and Intention
Authors: Lin Liu, Qiang Liu, Chi-hung Chi, Zhi Jin, Eric Yu
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

This paper proposes a formalism for on-demand service selection and composition. It is based on the agent-oriented requirements modeling framework i*, which can be used as a means of studying the requirements and architectural setting for service-oriented environment. We argue that a social ontology such as i*, extended with a formal reasoning mechanism, offers better understanding to the social/organizational relationship in a component-based, on-demand service world. By representing explicitly the underlying assumptions, and essential factors of services, an informal requirements model in i* can automatically evolve and compose a new service on-demand with quality. Eventually, it will assist participants of an open service oriented platform such as SOA (Service Oriented Architecture) to make rationale communication, selection, and binding decisions.
A Fractal and Wavelet-Based Approach for Audio Coding.
Authors: Rodrigo Capobianco Guido, Lucimar Sasso Vieira, Sylvio Barbon Junior, Fabricio Lopes Sanchez, Marcio Borges Alonso Guilherme, Kim Inocencio Cesar Sergio, Thais Lorasqui Scarpa, Everthon Silva Fonseca, Jose Carlos Pereira, Mauricio Monteiro
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Towards an optimization-oriented approach for audio coding, this paper presents improved rate-distortion and perceptual strategies for bit allocation. The algorithm is based on best basis wavelet-packet trees and fractal dimension calculation. Transparent coding of high quality audio, signals sampled at 44.1 KHz using 16 bits PCM, is effectively achieved at low bit rates. Real time working of the decoder is confirmed, reassuring the usability of the proposed technique.
Stream segregation algorithm for pattern matching in polyphonic music databases
Authors: Wai Man Szeto, Man Hon Wong
Venue: Multimedia Tools and Applications (2006)

As music can be represented symbolically, most of the existing methods extend some string matching algorithms to retrieve musical patterns in a music database. However, not all retrieved patterns are perceptually significant because some of them are, in fact, inaudible. Music is perceived in groupings of musical notes called streams. The process of grouping musical notes into streams is called stream segregation. Stream-crossing musical patterns are perceptually insignificant and should be pruned from the retrieval results. This can be done if all musical notes in a music database are segregated into streams and musical patterns are retrieved from the streams. Findings in auditory psychology are utilized in this paper, in which stream segregation is modelled as a clustering process and an adapted single-link clustering algorithm is proposed. Supported by experiments on real music data, streams are identified by the proposed algorithm with considerable accuracy.
Evaluating JACK Sim for Agent-Based Modelling of Pedestrians
Authors: Nicole Ronald, Leon Sterling, Michael Kirley
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

In this paper, we describe the use of an agent-based simulation language, JACK Sim. JACK Sim is one of several add-ons for the agent language JACK, which is based on the belief-desire-intention architecture. The implementation of a prototype model of pedestrian wayfinding behaviour is described and the prototype is then evaluated using software engineering quality principles. A recent addition to the simulation language world, JACK Sim solves several problems encountered with using JACK alone for certain simulations and provides a solid framework for creating discrete-event simulations with BDI agent technology.
Backward elimination procedures for testing multiple hypotheses: application to optimal sensor location
Authors: A. M. Zoubir
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

In this study, we propose a method for finding optimum sensor positions in a group of vibration sensors for knock detection in spark ignition engines. It differs from other techniques in that only signal processing and statistical tests are used. Our method is based on linearly predicting a reference signal from the output signals of an array of sensors, distributed arbitrarily on the engine block. We derive a linear regression model in the frequency domain and discuss parametric tests for various hypotheses that are tested with respect to the model parameters. This leads us to a technique for testing irrelevancy of sensors in the considered group. Simulation and experimental results emphasize the applicability of the method.
Identifying and re-meshing contact interfaces in a polyhedral assembly for digital mock-up
Authors: R. Chouadria, P. V&#x00e9;ron
Venue: Engineering with Computers (2006)

Polyhedral models are widely used for applications such as manufacturing, digital simulation or visualization. They are discrete models; easy to store, to manipulate, allowing levels of resolution for visualization. They can be easily exchanged between CAD systems without loss of data. Previous works (Comput Aided Des 29(4):287&#x2013;298, 1997, Comput Graphics 22(5):565&#x2013;585, 1998) have focused on simplification process applied to polyhedral part models. The goal of the proposed approach is to extend these processes to polyhedral assembly models, describing the digital mock-up of a future manufacturing product. To apply simplification techniques or other processes on polyhedral assemblies, contact surfaces between interacting objects have to be identified and specific constraints must be applied for processing. The approach proposed allows checking and maintaining a global consistency of the assembly model to ensure the reliability of the future processes. Thus, contacts between objects are detected using an approach that works for a static configuration of the assembly. Finally, a precise detection of the faces involved in each contact area is made and the resulting input domains identified are processed using a local Frontal Delaunay re-meshing technique to produce an identical tessellation on both objects involved in the processed contact. The quality of the triangulation produced is also checked.
How Secure is RFID?
Authors: Sixto Ortiz Jr.
Venue: Computer (2006)

Despite RFID's growing profile, some researchers are concerned that potential security problems could cloud the technology's future.
Quantum Oblivious Transfer and Fair Digital Transactions
Authors: Yao-Hsin Chou, I-Ming Tsai, Chien-Ming Ko, Sy-Yen Kuo, Ing-Yi Chen
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Quantum entanglement is a phenomenon available only at nanometer scale. In this paper, we show how quantum entanglement can be used to build cryptographic primitives such as oblivious transfer. In addition to studying the protocol itself, we also show how to realize some applications based on our proposal. These include typical e-Business applications such as contract signing, certified mail, simultaneous secret exchange, secure transaction and remote coin flip. Unlike classical oblivious transfer, the security of this protocol is based on physical laws, instead of any unproven mathematic conjecture. As a result, our proposal provides unconditional security for e-Business.
Optimal networks, congestion and Braess' paradox
Authors: Raúl J. Mondragón C
Venue: Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems (2006)

Networks that are efficient and robust to failures tend to have either star-like or homogeneous structures in their connectivity. The choice of optimal structure depends on the network's load. The results presented in this paper are: (a) For source-routing networks the change from one structure to another is smooth and does not depends on network congestion. (b) The addition of extra links to the optimal network reduces its overall performance. This performance deterioration is small if the network structure has a narrow degree distribution centred around the mean. (c) If the network has a subset of nodes, which are more efficient in the delivery of traffic, the optimal network has a tier structure.
Distributed searching in structured peer-to-peer networks
Authors: Kyung Dong Ryu
Venue:  (2006)

In recent years, many Peer-to-Peer (P2P) systems have emerged and attracted millions of users to share files, storage and other resources on the Internet. To provide efficient routing on such large-scale networks, many structured P2P overlays were proposed. However, these systems provide only a basic name lookup service. This dissertation presents a suite of mechanisms to support complex queries on top of structured P2P networks. First, to support keyword-based search, we developed Keyword Fusion that not only reduces query latency and traffic, but also balances the storage consumption and query processing load among peers. Second, to support range queries, we developed a novel Range Hash Tree (RHT) that processes a range query with high predictability and scalability having its query processing time independent of both the queried range size and the number of total matching data objects. Finally, to help users select a more reliable query result from various peers, we developed a new reputation management system called R-Chain where each peer maintains its own transaction history locally as reputation. R-Chain guarantees the availability of reputation information for active peers with only limited network overhead for reputation maintenance. Experiments show that the proposed mechanisms are lightweight, and highly efficient in supporting complex queries.
Trusted computing
Authors: Aaron Weiss
Venue: netWorker (2006)

Will the open, unrestricted PC soon become a thing of the past?
From Languages to Systems: Understanding Practical Application Development in Security-typed Languages
Authors: Boniface Hicks, Kiyan Ahmadizadeh, Patrick McDaniel
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

Security-typed languages are an evolving tool for implementing systems with provable security guarantees. However, to date, these tools have only been used to build simple "toy programs. As described in this paper, we have developed the first real-world, security-typed application: a secure email system written in the Java language variant Jif. Real-world policies are mapped onto the information flows controlled by the language primitives, and we consider the process and tractability of broadly enforcing security policy in commodity applications. We find that while the language provided the rudimentary tools to achieve low-level security goals, additional tools, services, and language extensions were necessary to formulate and enforce application policy. We detail the design and use of these tools. We also show how the strong guarantees of Jif in conjunction with our policy tools can be used to evaluate security. This work serves as a starting point--we have demonstrated that it is possible to implement real-world systems and policy using security-typed languages. However, further investigation of the developer tools and supporting policy infrastructure is necessary before they can fulfill their considerable promise of enabling more secure systems.
Efficient Methods on Predictions for Similarity Search over Stream Time Series
Authors: Xiang Lian, Lei Chen
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

Due to the wide usage of stream time series, an efficient and effective similarity search over stream data becomes essential for many applications. Although many approaches have been proposed for searching through archived data, because of the unique characteristics of the stream, for example, data are frequently updated, traditional methods may not work for the stream time series. Especially, for the cases where the arrival of data is often delayed for various reasons, for example, the communication congestion or batch processing and so on, queries on such incomplete time series or even future time series may result in inaccuracy. Therefore, in this paper we propose two approaches, polynomial and probabilistic, to predict the unknown values that have not arrived at the system. We also present efficient indexes, that is, a multidimensional hash index and B+-tree, to facilitate the prediction and similarity search on future time series, respectively. Extensive experiments demonstrate the efficiency and effectiveness of our methods in terms of I/O, prediction and query accuracy.