ppxscal/embedding_network huggingface dataset:
The Application of Wavelet & DCSK Watermarking in Multimedia Security
Authors: Xinghao Jiang, Tanfeng Sun, Jianhua Li
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Nowadays digital Multimedia copyright protection is up against austere challenge. The watermarking and encryption used together is more and more important in Digital Multimedia Security (DMS) application. So in this paper, a novel approximation zero-tree-wise wavelet watermarking with Difference Chaos Shift Key coding encryption method of DMS information security is present. Firstly the DMS information is got by proprietor or authority as initial watermarks. Then encrypt key is generated by DM’s data. To encrypt initial watermarks' information is to apply chaos sequence as final watermarks' information. Then the final watermark is embedded into the approximation zero-tree-wise wavelet coefficients of the image by Digital Chaos Shift Key (DCSK) coding method that makes watermarks’ information more secure and secret. The Chaos key is generated automatically by image decomposed with LUT mapped.As a result, approximation zero-tree-wise wavelet with DCSK coding watermarking is more secure and secret characteristic in protecting DMS information. Furthermore blind-detection watermarking can be achieved, encrypt key can be regain by DM data. That method possesses research value.
Preference-Based Organization Interfaces: Aiding User Critiques in Recommender Systems
Authors: Li Chen, Pearl Pu
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Users' critiques to the current recommendation form a crucial feedback mechanism for refining their preference models and improving a system's accuracy in recommendations that may better interest the user. In this paper, we present a novel approach to assist users in making critiques according to their stated and potentially hidden preferences. This approach is derived from our previous work on critique generation and organization techniques. Based on a collection of real user data, we conducted an experiment to compare our approach with three existing critique generation systems. Results show that our preference-based organization interface achieves the highest level of prediction accuracy in suggesting users' intended critiques and recommendation accuracy in locating users' target choices. In addition, it can potentially most efficiently save real users' interaction effort in decision making.
Time to the Rescue - Supporting Temporal Reasoning in the Rete Algorithm for Complex Event Processing
Authors: Karen Walzer, Matthias Groch, Tino Breddin
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

Complex event processing is an important technology with possible application in supply chain management and business activity monitoring. Its basis is the identification of event patterns within multiple occurring events having logical, causal or temporal relationships.The Rete algorithm is commonly used in rule-based systems to trigger certain actions if a corresponding rule holds. The algorithm's good performance for a high number of rules makes it ideally suited for complex event detection. However, the traditional Rete algorithm does not support aggregation of values in time-based windows although this is a common requirement in complex event processing for business applications.We propose an extension of the Rete algorithm to support temporal reasoning, namely the detection of time-based windows by adding a time-enabled beta-node to restrict event detection to a certain time-frame.
Supporting Proscriptive Metadata in an XML DBMS
Authors: Hao Jin, Curtis Dyreson
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

MetaXQuery is a language for querying data enhanced with metadata. The MetaXQuery data model (MetaDOM) attaches metadata to each element in an XML data collection, and extends XQuery with several constructs to process and query metadata. In this paper we show how to extend a native XML DBMS, namely eXist, to support MetaXQuery. The additional query functionality can be efficiently implemented by judicious reuse of eXist's indexes and query evaluation engine.
Agent Oriented Methodology Construction and Customization with HDA
Authors: Xue Xiao, Zeng Zhifeng, Cui Ying
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

The agent-oriented (AO) methodology is an effective means for constructing complex systems. Despite a great deal of research, a number of challenges still exist before making agent-based computing a widely accepted paradigm in software engineering practice. In order to solve the problem of "a variety in number, difficult to use", the paper presents a hierarchical development architecture (HDA) for customizing a new AO methodology according to the given project. Based on the HDA, the developer can extract meta models from existing AO methods to assemble a new approach, much like developers building applications from third party off-the-shelf components. To exemplify its feasibility and effectiveness, the construction of C4I system is presented as a case study.
Engineering Self-Organizing Systems
Authors: Joseph L. Hellerstein
Venue: Proceedings of the 2nd international workshop on Self-Organizing Systems (2007)

Self-organizing systems (SOS) hold the promise of addressing many challenges in large scale distributed systems, especially in reducing the need for human intervention for configuration, recovery from failures, and performance optimization. While there are many principles for creating SOS such as minimizing dependencies between components and avoiding the use of globally shared state, we lack a systematic methodology. This talk explores how techniques from control theory and game theory might be used in combination to engineer SOS.
Multipart 3D reconstruction of a human cervical vertebra
Authors: Dan Ioan Stoia, Mirela Toth-Tascau
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The paper describes a 3D reconstruction protocol starting from 2D scanned images of a third cervical vertebra. The purpose was to create a multipart body who meets the composite bone requirements. A number of necessaries steps were developed and implemented. The result is a multipart solid body characterized by volume, mass, material properties, surface areas and moments of inertia. A solid reconstructed in this way, can be successfully used into realistic mechanical simulations tests
Constant-Width Zones Broadcast Algorithm in Mobile Ad-Hoc Networks
Authors: D. Liarokapis, A. Shahrabi, C. Raeburn
Venue: Proceedings of the 2nd international conference on Network-Based Information Systems (2008)

Broadcast operation is perhaps the most fundamental services utilized frequently by other communication mechanisms in Mobile Ad-hoc Networks (MANETs).Supporting efficient broadcast operation is therefore very crucial for such networks. A novel distance-based broadcast algorithm, called Constant-Width Zones (CWZ), is proposed in this paper. CWZ can effectively alleviate the redundant rebroadcast (overlaying) problem by defining a constant upper limit for the width of all rebroadcast zones and, consequently, reducing the number of forwarding hosts. The results of our simulation-based performance study show that the proposed CWZ algorithm is able to rebroadcast packets more effectively in order to achieve higher reachability while reducing the latency especially for heavy host density networks.
A Transformation Function for Finding Better Minima
Authors: Weixiang Wang, Youlin Shang
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

This paper presents a class of transformation function, the T-F function, for finding better minimizers in global optimization. We first give the definition of the T-F function and prove that under some general assumptions this proposed function posses the characters of both tunneling function and filled function. Then we design an algorithm based on T-F function. Last, we make a numerical test. The numerical results show that our transformation function is very effective in finding better minima.
AOG-ags Algorithms and Applications
Authors: Lizhen Wang, Junli Lu, Joan Lu, Jim Yip
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

The attribute-oriented generalization (AOG for short) method is one of the most important data mining methods. In this paper, a reasonable approach of AOG (AOG-ags, attribute-oriented generalization based on attributes' generalization sequence), which expands the traditional AOG method efficiently, is proposed. By introducing equivalence partition trees, an optimization algorithm of the AOG-ags is devised. Defining interestingness of attributes' generalization sequences, the selection problem of attributes' generalization sequences is solved. Extensive experimental results show that the AOG-ags are useful and efficient. Particularly, by using the AOG-ags algorithm in a plant distributing dataset, some distributing rules for the species of plants in an area are found interesting.
Intelligent Mouse-Based Object Group Selection
Authors: Hoda Dehmeshki, Wolfgang Stuerzlinger
Venue: Proceedings of the 9th international symposium on Smart Graphics (2008)

Modern graphical user interfaces support direct manipulation of objects and object groups. Current object group selection techniques such as lasso and rectangle selection can be time-consuming and error-prone. This paper presents a new approach to group selection that exploits the way human perception naturally groups objects, also known as Gestalt grouping. Based on known results from perception research, we present a novel method to group objects via models of the Gestalt principles of proximity and (curvi-)linearity. Then, we introduce several new mouse-based selection techniques that exploit these Gestalt groups. The results of a user study show that our new technique outperforms lasso and rectangle selection for object groups with an implicit structure, such as (curvi-)linear arrangements or clusters.
On Enriching Ajax with Semantics: The Web Personalization Use Case
Authors: Kay-Uwe Schmidt, Ljiljana Stojanovic, Nenad Stojanovic, Susan Thomas
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

With the dawn of Ajax the capabilities of tracking user behavior multiplied. The same holds for the capabilities of adapting the user interface in a Web browser. To provide meaningful adaptation, the events, context and elements of an Ajaxified Portal must be given meaning. We show the use of ontologies as a model for user-related context and portal-related content. Content-related concepts are used to annotate Ajax widgets to associate them with meaning. As a user navigates a portal and fires events related to the widgets, a semantically rich user model is built, enabling suitable adaptation. Both the user model and the adaptation are based on ontologies and logic rules. Since user tracking and portal adaptation in the era of Ajax, now takes place on the client-side we present a resource-saving approach to executing adaptation rules in the browser. The approach is applied in an e-Government case study.
Angle Optimization in Target Tracking
Authors: Beat Gfeller, Matúš Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

We consider the problem of tracking n targets in the plane using 2n cameras, where tracking each target requires two distinct cameras. A single camera (modeled as a point) sees a target point in a certain direction, ideally with unlimited precision, and thus two cameras (not collinear with the target) unambiguously determine the position of the target. In reality, due to the imprecision of the cameras, instead of a single viewing direction a target defines only a viewing cone, and so two cameras localize a target only within the intersection of two such cones. In general, the true localization error is a complicated function of the angle subtended by the two cameras at the target (the tracking angle), but a commonly accepted tenet is that an angle of 90° is close to the ideal. In this paper, we consider several algorithmic problems related to this so-called "focus of attention" problem. In particular, we show that the problem of deciding whether each of n given targets can be tracked with 90° is NP-complete. For the special case where the cameras are placed along a single line while the targets are located anywhere in the plane, we show a 2-approximation both for the sum of tracking angles and the bottleneck tracking angle (i.e., the smallest tracking angle) maximization problems (which is a natural goal whenever targets and cameras are far from each other). Lastly, for the uniform placement of cameras along the line, we further improve the result to a PTAS.
Feature Selection for Automatic Classification of Chinese Folk Songs
Authors: Jieping Xu, Peng Wang, Li Yan
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

The researches on feature selection play a very important role in the area of classification. In this paper, we introduce a heuristic wrapper method: Classification Contribution-Ratio Based Selection (CCRS). Using RBF neural network as a classifier, we did our experiments on a data set of 74 features extracted from 517 Chinese folk songs which come from 10 regions. The results show that Root Mean Square, Spectral Flux and Linear Prediction Coefficient are very effective for the classification of 10 kinds of Chinese folk songs. It works better when the number of features is reduced from 74 to 30 and the classification accuracy is improved from 39.74% (using the total 74 features) to 43.208% (using 30 optimal features). At last, we give an illustration of validity of the algorithm, and a comparison with the Fisher Criterion Method which shows the efficiency of CCRS.
The Printed Papers of Charles Babbage
Authors: Alfred W. Van Sinderen
Venue: IEEE Annals of the History of Computing (1980)

This paper is intended to correct the list of printed papers of Charles Babbage (1791-1871) that Babbage printed in the back of his partial autobiography, Passages from the Life of a Philosopher (London, 1864). That list has been reprinted in several modern publications, but no attempt has been made to make it accurate or complete until this article. In an effort to make the list more useful to the reader, notes follow many of the items to explain their significance in Babbage's life and work.
Deriving Input Partitions from UML Models for Automatic Test Generation
Authors: Stephan Weißleder, Bernd-Holger Schlingloff
Venue: Models in Software Engineering: Workshops and Symposia at MoDELS 2007, Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers (2008)

In this paper, we deal with model-based automatic test generation. We show how to use UML state machines, UML class diagrams, and OCL expressions to automatically derive partitions of input parameter value ranges for boundary testing. We present a test generation algorithm and describe an implementation of this algorithm. Finally, we discuss our approach and compare it to commercial tools.
Active Exploration Using Bayesian Models for Multimodal Perception
Authors: João Filipe Ferreira, Cátia Pinho, Jorge Dias
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

In this text we will present a novel solution for active perception built upon a probabilistic framework for multimodal perception of 3D structure and motion -- the Bayesian Volumetric Map (BVM). This solution applies the notion of entropy to promote gaze control for active exploration of areas of high uncertainty on the BVM so as to dynamically build a spatial map of the environment storing the largest amount of information possible. Moreover, entropy-based exploration is shown to be an efficient behavioural strategy for active multimodal perception.
The helicoidal life cycle as a tool for software development and enhancement
Authors: Antonio Carlos Pinto Dias Alves
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

In recent years we have been seeing great advances in methodologies and languages for the development of computational systems. This work presents a tool, the Helicoidal Life Cycle Model, which is not a mere evolution of the spiral or any other model. With this life cycle model, it is possible to make precise measurements of terms and costs as well as "see" the stages of system development. The practical application of this tool in the development of some Information Technology (IT) designs will be shown as much as that the helicoidal life cycle represents the most general model a life cycle can achieve.
Granular Computing and Rough Set Theory
Authors: Lotfi A. Zadeh
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

Granulation plays an essential role in human cognition and has a position of centrality in both granular computing and rough set theory. Informally, granulation involves partitioning of an object into granules, with a granule being a clump of elements drawn together by indistinguishability, equivalence, similarity, proximity or functionality. For example, an interval is a granule; so is a fuzzy interval; so is a gaussian distribution; so is a cluster of points; and so is an equivalence class in rough set theory. A granular variable is a variable which takes granules as values. If G is value of X, then G is referred to as a granular value of X. If G is a singleton, then G is a singular value of X. A linguistic variable is a granular variable whose values are labeled with words drawn from a natural language. For example, if X is temperature, then 101.3 is a singular value of temperature, while "high" is a granular (linguistic) value of temperature.
A turning bands program for conditional co-simulation of cross-correlated Gaussian random fields
Authors: Xavier Emery
Venue: Computers Geosciences (2008)

A Matlab program (TBCOSIM) is provided for co-simulating a set of stationary or intrinsic Gaussian random fields in R^3, whose simple and cross-covariance functions are fitted by a linear model of coregionalization. It relies on the turning bands method, which performs three-dimensional simulation via a series of one-dimensional simulations along lines that span R^3. There is no restriction on the number of random fields to simulate, on the number of basic structures used in the coregionalization model, and on the number and configuration of the locations where simulation has to be performed. Additionally, the realizations can be made conditional to data, back-transformed and averaged over a block support. TBCOSIM uses parallel simulation algorithms: at each location, the random fields are simulated simultaneously and a single co-kriging is needed for conditioning all the realizations. The capabilities of the program are illustrated with the analysis of a set of non-conditional realizations and with an application to a soil contamination dataset.
C++ and Massively Parallel Computers
Authors: Daniel J. Lickly, Philip J. Hatcher
Venue: Scientific Programming (1993)

Our goal is to apply the software engineering advantages of object-oriented programming to the raw power of massively parallel architectures. To do this we have constructed a hierarchy of C++ classes to support the data-parallel paradigm. Feasibility studies and initial coding can be supported by any serial machine that has a C++ compiler. Parallel execution requires an extended Cfront, which understands the data-parallel classes and generates C* code. (C* is a data-parallel superset of ANSI C developed by Thinking Machines Corporation). This approach provides potential portability across parallel architectures and leverages the existing compiler technology for translating data-parallel programs onto both SIMD and MIMD hardware.
A Scrutable User Modelling Infrastructure for Enabling Life-Long User Modelling
Authors: Demetris Kyriacou
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

User Modelling is the core component for the majority of personalisation systems. By keeping a model for every user, a system can successfully personalise its content and utilise available resources accordingly. While researching the literature, one can recognize the importance of achieving interoperability across various platforms and systems while attempting to personalise a large diversity of web resources. Furthermore, scrutable solutions allow users to control any modelling process that uses their information. Finally, privacy of user data while exchanging user models from one source to another must be taken in mind. With this paper, a Scrutable User Modelling Infrastructure is presented which blends together these user modelling 1ingredients' and, by adopting Semantic Web technologies, attempts to model a range of life-long user interactions with a variety of web-based systems from the educational, business and social networking domains.
Affect and Metaphor in an ICA: Further Developments
Authors: C. J. Smith, T. H. Rumbell, J. A. Barnden, M. G. Lee, S. R. Glasbey, A. M. Wallington
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

We describe a computational treatment of certain sorts of affect-conveying metaphorical utterances. This is part of an affect detection system used by intelligent conversational agents (ICAs) operating in an edrama system.
Learning a Person-Independent Representation for Precise 3D Pose Estimation
Authors: Shuicheng Yan, Zhenqiu Zhang, Yun Fu, Yuxiao Hu, Jilin Tu, Thomas Huang
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

Precise 3D pose estimation plays a significant role in developing human-computer interfaces and practical face recognition systems. This task is challenging due to the personality in pose variation for a certain subject. In this work, the pose data space is considered as a union of the submanifolds which characterize different subjects, instead of a single continuous manifold as conventionally regarded. A novel manifold embedding algorithm dually supervised by subjects and poses, called Synchronized Submanifold Embedding (SSE), is proposed for person-independent precise pose estimation. First, the submanifold of a certain subject is approximated as a set of simplexes constructed using neighboring samples. Then, these simplexized submanifolds from different subjects are embedded by synchronizing the locally propagated poses within the simplexes and at the same time maximizing the intra-submanifold variances. Finally, the pose of a new datum is estimated as the median of the poses for the nearest neighbors in the dimensionality reduced feature space. The experiments on the 3D pose estimation database, CHIL data for CLEAR07 evaluation demonstrate the effectiveness of our proposed algorithm.
Using Semantic Prototypes for Discourse Status Classification
Authors: Sandra Collovini, Luiz Carlos Ribeiro,  Jr., Patricia Nunes Gonçalves, Vinicius Muller, Renata Vieira
Venue: Proceedings of the 8th international conference on Computational Processing of the Portuguese Language (2008)

Discourse status is related to different aspects of entity mention in the discourse, such as whether they are first or subsequently mentioned and on what grounds. This paper presents the evaluation of semantic prototype as input feature for discourse status classification considering Decision Trees as machine learning algorithm. We show that the semantic prototypes improves classification of two specially difficult and scarce classes.