ppxscal/embedding_network huggingface dataset:
Intellectual Property Management and Protection for Multimedia Content
Authors: Claudio Alberti
Venue:  (2009)

Nowadays, network infrastructures are increasingly used in support to commercialization of digital multimedia content. Non-material goods (videos, music, images and any other type of multimedia information) are migrating from traditional delivery technologies to a full-electronic delivery model. Incidentally, the same features that make the management of digital content so easy are also responsible for the difficulties of selling it on-line. Digital information as it is can be easily copied an unlimited number of times and transferred to an unlimited number of people. Thus it is of crucial importance for the digital multimedia market to insure that the holders of intellectual property over the content are appropriately rewarded and that only authorized parties can access the valuable information. The goal of this work is to describe how to implement interoperable protection systems by providing a behavioral description of terminal reactions to given inputs. This approach will enable the implementation of Intellectual Property Management and Protection (IPMP) tools allowing both wide interoperability among different platforms and rapid reconfiguration in case of tampering. 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
A Hypergraph-Based Model for Graph Clustering: Application to Image Indexing
Authors: Salim Jouili, Salvatore Tabbone
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

In this paper, we introduce a prototype-based clustering algorithm dealing with graphs. We propose a hypergraph-based model for graph data sets by allowing clusters overlapping. More precisely, in this representation one graph can be assigned to more than one cluster. Using the concept of the graph median and a given threshold, the proposed algorithm detects automatically the number of classes in the graph database. We consider clusters as hyperedges in our hypergraph model and we define a retrieval technique indexing the database with hyperedge centroids. This model is interesting to travel the data set and efficient to cluster and retrieve graphs. 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
How to Tackle Integer Weighted Automata Positivity
Authors: Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
Venue: Proceedings of the 3rd International Workshop on Reachability Problems (2009)

This paper is dedicated to candidate abstractions to capture relevant aspects of the integer weighted automata. The expected effect of applying these abstractions is studied to build the deterministic reachability graphs allowing us to semi-decide the positivity problem on these automata. Moreover, the papers reports on the implementations and experimental results, and discusses other encodings.
Robust Multiperson Tracking from a Mobile Platform
Authors: Andreas Ess, Bastian Leibe, Konrad Schindler, Luc van Gool
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

In this paper, we address the problem of multiperson tracking in busy pedestrian zones using a stereo rig mounted on a mobile platform. The complexity of the problem calls for an integrated solution that extracts as much visual information as possible and combines it through cognitive feedback cycles. We propose such an approach, which jointly estimates camera position, stereo depth, object detection, and tracking. The interplay between those components is represented by a graphical model. Since the model has to incorporate object-object interactions and temporal links to past frames, direct inference is intractable. We, therefore, propose a two-stage procedure: for each frame, we first solve a simplified version of the model (disregarding interactions and temporal continuity) to estimate the scene geometry and an overcomplete set of object detections. Conditioned on these results, we then address object interactions, tracking, and prediction in a second step. The approach is experimentally evaluated on several long and difficult video sequences from busy inner-city locations. Our results show that the proposed integration makes it possible to deliver robust tracking performance in scenes of realistic complexity.
Bounds on Non-surjective Cellular Automata
Authors: Jarkko Kari, Pascal Vanier, Thomas Zeume
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

Cellular automata (CA) are discrete, homogeneous dynamical systems. Non-surjective one-dimensional CA have finite words with no preimage (called orphans), pairs of different words starting and ending identically and having the same image (diamonds) and words with more/ fewer preimages than the average number (unbalanced words). Using a linear algebra approach, we obtain new upper bounds on the lengths of the shortest such objects. In the case of an n-state, non-surjective CA with neighborhood range 2 our bounds are of the orders O(n 2), O(n 3/2) and O(n) for the shortest orphan, diamond and unbalanced word, respectively.
Dynamic backtracking
Authors: Matthew L. Ginsberg
Venue: Journal of Artificial Intelligence Research (1993)

Because of their occasional need to return to shallow points in a search tree, existing backtracking methods can sometimes erase meaningful progress toward solving a search problem. In this paper, we present a method by which backtrack points can be moved deeper in the search space, thereby avoiding this difficulty. The technique developed is a variant of dependency-directed backtracking that uses only polynomial space while still providing useful control information and retaining the completeness guarantees provided by earlier approaches.
Modeling the Cognitive Task Load and Performance of Naval Operators
Authors: Mark A. Neerincx, Stefan Kennedie, Marc Grootjen, Franc Grootjen
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Operators on naval ships have to act in dynamic, critical and high-demand task environments. For these environments, a cognitive task load (CTL) model has been proposed as foundation of three operator support functions: adaptive task allocation, cognitive aids and resource feedback. This paper presents the construction of such a model as a Bayesian network with probability relationships between CTL and performance. The network is trained and tested with two datasets: operator performance with an adaptive user interface in a lab-setting and operator performance on a high-tech sailing ship. The "Naïve Bayesian network" tuned out to be the best choice, providing performance estimations with 86% and 74% accuracy for respectively the lab and ship data. Overall, the resulting model nicely generalizes over the two datasets. It will be used to estimate operator performance under momentary CTL-conditions, and to set the thresholds of the load-mitigation strategies for the three support functions.
Application of Residuation Theory in Network Calculus
Authors: Fan Baohua, Zhang Heying, Dou Wenhua
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

This paper proposes a framework for the application of residutaion theory in network calculus. Min-plus convolution and deconvolution composes a dual-residuated pair, their properties can be studied by using residuation theory. End-to-end performance bounds can also be obtained by residuation method. The application of residuation theory in max-plus network calculus theory and time varying network calculus are also studied.
LILA: A Connected Components Labeling Algorithm in Grid-Based Clustering
Authors: Tao Jiang, Ming Qiu, Jie Chen, Xue Cao
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Labeling the connected components in the feature space is an important step in grid based clustering algorithms in data mining. Although Connected Components LabelingAlgorithms have been highly improved in image processing domain, there is little progress in grid based clustering in data mining domain. Two problems exist in transplanting these algorithms from image processing to data mining. One is how to process multi-dimensional dataset. The other is how to reduce the cost of auxiliary space. This paper describes an optimal two-scan Connected Components Labeling algorithm based that in image processing domain. It does not need auxiliary space, and easy to be extended to multi-dimension data set.
The Vector Data Management of GIS Based on PDA
Authors: Lu Liu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

Traditionally, vector data of GIS based on PDA is managed with a traditional pyramid model to promote displaying speed. However, this pyramid model does not flexible or practical enough to solve many problems, neither the data file designing and data processing method are discussed before. Therefore, in this paper, an improved pyramid model is proposed and a new data format for the model is designed, also, the data processing method is discussed. The experimental results show that, this solution is practical and efficient.
Adaptative Instructional Planning Using Workflow and Genetic Algorithms
Authors: Robson da Silva Lopes, Márcia Aparecida Fernandes
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Many systems of distance learning do not consider the particular characteristics of the student and the same pedagogical strategies and content sequences are used for every student. But, the course can be customized by the introduction of adaptability in these systems. In order to develop adaptative systems of distance learning, it is necessary to consider the problems: instructional planning and the student model. The first problem allows to generate a specific sequence of content for each student and the second one provides the necessary information to cope with adaptativity.Planning techniques in Artificial Intelligence have been successfully used for determining the sequence of instructional actions. The Workflow technology has been used for the management of these systems. Then, this paper presents an adaptative instructional planning and a student model based on theories of cognitive levels and learning styles.
Compliance and Company Value: How Markets React to Reported Lapses in Corporate Governance
Authors: Amy McDonough, Stefan Sackmann
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

This study examines the impact of reported lapses in corporate governance, using event study analysis to explore the announcement effect of public reprimand letters issued for violations of corporate governance regulations. No evidence is found that the stock of companies receiving such a letter are subject to negative abnormal returns, thus it appears that investors do not consider the announcement to contain new relevant information for their assessment of company value.
Optical DNA
Authors: Deepak Vijaywargi, Dave Lewis, Darko Kirovski
Venue: Financial Cryptography and Data Security: 13th International Conference, FC 2009, Accra Beach, Barbados, February 23-26, 2009. Revised Selected Papers (2009)

A certificate of authenticity (COA) is an inexpensive physical object with a random and unique structure S which is hard to near-exactly replicate. An inexpensive device should be able to scan object's physical "fingerprint," a set of features that represents S. In this paper, we explore one set of requirements that optical media such as DVDs should satisfy, to be considered as COAs. As manufacturing of such media produces inevitable errors, we use the locations and count of these errors as a "fingerprint" for each optical disc: its optical DNA. The "fingerprint" is signed using publisher's private-key and the resulting signature is stored onto the optical medium using a post-production process. Standard DVD players with altered firmware that includes publisher's public-key, should be able to verify the authenticity of DVDs protected with optical DNA. Our key finding is that for the proposed protocol, only DVDs with exceptional wear-and-tear characteristics would result in an inexpensive and viable anti-counterfeiting technology.
Antimony
Authors: Lucian P. Smith, Frank T. Bergmann, Deepak Chandran, Herbert M. Sauro
Venue: Bioinformatics (2009)

Motivation: Model exchange in systems and synthetic biology has been standardized for computers with the Systems Biology Markup Language (SBML) and CellML, but specialized software is needed for the generation of models in these formats. Text-based model definition languages allow researchers to create models simply, and then export them to a common exchange format. Modular languages allow researchers to create and combine complex models more easily. We saw a use for a modular text-based language, together with a translation library to allow other programs to read the models as well. Summary: The Antimony language provides a way for a researcher to use simple text statements to create, import, and combine biological models, allowing complex models to be built from simpler models, and provides a special syntax for the creation of modular genetic networks. The libAntimony library allows other software packages to import these models and convert them either to SBML or their own internal format. Availability: The Antimony language specification and the libAntimony library are available under a BSD license from http://antimony.sourceforge.net/ Contact: lpsmith@u.washington.edu
ROI Extraction Based on Rough Set
Authors: Sun Junding, Chen Suxia
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Region of interest (ROI) extraction plays an important part in image processing and analysis. Based on rough set theory, a ROI extraction algorithm was presented in the paper. Firstly, a rough ROI was determined based on the prior knowledge. Then, combining with the low-level features such as intensity, edge, location of the marked ROI, an information table reflecting the relation of classification was constructed and the basic regions were built based on its indiscernibility. Finally, the approximate region to the original rough ROI was considered as the final ROI. The experiments show that the new algorithm has higher accuracy and lower time complexity than the traditional methods.
Water Quality Prediction of Moshui River in China Based on BP Neural Network
Authors: Qun Miao, Hui Yuan, Changfei Shao, Zhiqiang Liu
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

The north of Jiaozhou Bay has become the important region for the development strategy of Qingdao in China, because the development space of the old city district gets saturated. The Moshui River will become the main contaminated river of this area. Neural network was used to build the water quality prediction model of the discharge outlet of the river to predict the concentration of COD, ammonia nitrogen and mineral oil. According to the result, the harmful effects of the emission can be analyzed and the pollution receiving ability of this area can be identified, which can meet the pollution gross control after the completion of these new and high-tech industry regions.
Enhancing Document Clustering through Heuristics and Summary-Based Pre-processing
Authors: Sri Harsha Allamraju, Robert Chun
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

Knowledge workers are burdened with information overload. The information they need might be scattered in many places, buried in a file system, in their email, or on the web. Traditional Clustering algorithms help in assimilating these wide sources of information and generating meaningful relationships amongst them. A typical clustering preprocessing involves tokenization, removal of stop words, stemming, pruning etc. In this paper, we propose the use of summary and heuristics of a document as a pre-processing technique. This technique preserves the formatting of a document and uses this information for producing better clusters. In addition, only a summary of a document is used as the basis for clustering instead of the whole document. Clustering algorithms using the proposed pre-processing technique on formatted documents resulted in improved and more meaningful clusters.
Quantitative Comparison of Similarity Measure and Entropy for Fuzzy Sets
Authors: Hongmei Wang, Sanghyuk Lee, Jaehyung Kim
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

Comparison and data analysis to the similarity measures and entropy for fuzzy sets are studied. The distance proportional value between the fuzzy set and the corresponding crisp set is represented as fuzzy entropy. We also verified that the sum of the similarity measure and the entropy between fuzzy set and the corresponding crisp set constitutes the total information. Finally, we derive a similarity measure from entropy with the help of total information property, and illustrate a simple example that the maximum similarity measure can be obtained using a minimum entropy formulation.
A Study of Virtual Product Presentation with Whiteboard and Its Effect on Users Perception
Authors: Wu-Yuin Hwang, Siao-Han Syu, Jung-Lung Hsu, Chio-Tan Kuo
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

In this paper, one innovative VPPW (Virtual Product Presentation with Whiteboard) system is proposed. The system provides multi-presentation virtual products and high level of interactivity on products to let users explore products online. In addition, semi-translucent multimedia whiteboards were provided in which users could study products information and explore 3D product simultaneously. By investigating the effect of consumers' attitude toward product, shopping enjoyment and purchase intention, this paper contributes to better understand how different level of interactivity influence consumer online shopping behavior.
Fundamental Research on Tactile Perception for Development of a Tactile Feel Display
Authors: Iyo Kunimoto, Naoki Saiwaki, Osamu Katayama, Yasuji Inobe
Venue: Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009 (2009)

In our daily life we use a large number of electronic devices incorporating a touch interface, e.g., mobile phones and the iPod Touch. This function is, however, in its infancy, permitting only input, with output being limited only to vibration to confirm input. Meanwhile, if we could create touch sensations with "qualitative information," such as the delicate sensation of materials or the feeling of touching an object, it would bring not only an improvement in the quality of touch sensations, but would also bring the possibility of developing new human interfaces such as more realistic VR systems and user-friendly universal communication tools for people with disability. Such human interfaces would be most effective if they did not require the development of special vibratory devices.On this basis, the authors have developed, based on knowledge gained from previous research, a prototype of a unique vibratory device employing a micro- motor, and employed it in evaluation experiment in which various differing tactile sensations are presented to study subjects.
Reactive redundancy and listener comprehension in direction-giving
Authors: Rachel E. Baker, Alastair J. Gill, Justine Cassell
Venue: Proceedings of the 9th SIGdial Workshop on Discourse and Dialogue (2008)

We explore the role of redundancy, both in anticipation of and in response to listener confusion, in task-oriented dialogue. We find that direction-givers provide redundant utterances in response to both verbal and non-verbal signals of listener confusion. We also examine the effects of prior acquaintance and visibility upon redundancy. As expected, givers use more redundant utterances overall, and more redundant utterances in response to listener questions, when communicating with strangers. We discuss our findings in relation to theories of redundancy, the balance of speaker and listener effort, and potential applications.
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
Authors: John Case
Venue: Theory of Computing Systems (2009)

Computability theoretic learning theory (machine inductive inference) typically involves learning programs for languages or functions from a stream of complete data about them and, importantly, allows mind changes as to conjectured programs. This theory takes into account algorithmicity but typically does not take into account feasibility of computational resources. This paper provides some example results and problems for three ways this theory can be constrained by computational feasibility. Considered are: the learner has memory limitations, the learned programs are desired to be optimal, and there are feasibility constraints on learning each output program as well as other constraints to minimize postponement tricks.
How to augment the second image? Recovery of the translation scale in image to image registration
Authors: Pierre Georgel, Pierre Schroeder, Selim Benhimane, Mirko Appel, Nassir Navab
Venue: Proceedings of the 7th IEEE/ACM International Symposium on Mixed and Augmented Reality (2008)

In this paper, we present an automatic pose estimation (6 DoF) technique to augment images using keyframes pre-registered to a CAD model. State of the art techniques recover the essential matrix (5 DoF) in an automatic manner, but include a manual step to align the image with the CAD reference system because the essential matrix does not provide the scale of the translation. We propose using planar structures to recover this scale automatically and to offer immediate augmentation. These techniques have been implemented in our augmented reality software. Qualitative tests are performed in an industrial environment.