ppxscal/embedding_network huggingface dataset:
Look-up Table Based Reversible Data Hiding for Error Diffused Halftone Images
Authors: Jeng-Shyang Pan, Hao Luo, Zhe-Ming Lu
Venue: Informatica (2007)

This paper proposes a reversible data hiding method for error diffused halftone images. It employs statistics feature of pixel block patterns to embed data, and utilizes the HVS characteristics to reduce the introduced visual distortion. The watermarked halftone image can be perfectly recovered if it is intact, only a secret key is required. The method is suitable for the applications where the content accuracy of the original halftone image must be guaranteed, and it is easily extended to the field of halftone image authentication.
On Learning Regular Expressions and Patterns Via Membership and Correction Queries
Authors: Efim Kinber
Venue: Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications (2008)

Based on the ideas suggested in [5], the following model for learning from a variant of correction queries to an oracle is proposed: being asked a membership query, the oracle, in the case of negative answer, returns also a correction --- a positive datum (that has not been seen in the learning process yet) with the smallest edit distance from the queried string. Polynomial-time algorithms for learning a class of regular expressions from one such query and membership queries and learning pattern languages from queries of this type are proposed and discussed.
How Robust Is a Probabilistic Neural VLSI System Against Environmental Noise
Authors: C. C. Lu, C. C. Li, H. Chen
Venue: Proceedings of the 3rd IAPR workshop on Artificial Neural Networks in Pattern Recognition (2008)

Implementing probabilistic models in the Very-Large-Scale- Integration (VLSI) has been attractive to implantable biomedical devices for improving sensor fusion and power management. However, implantable devices are normally exposed to noisy environments which can introduce non-negligible computational errors and hinder optimal modelling on-chip. While the probablistic model called the Continuous Restricted Boltzmann Machine (CRBM) has been shown useful and realised as a VLSI system with noise-induced stochastic behaviour, this paper investigates the suggestion that the stochastic behaviour in VLSI could enhance the tolerance against the interferences of environmental noise. The behavioural simulation of the CRBM system is used to examine the system's performance in the presence of environmental noise. Furthermore, the possibility of using environmental noise to induce stochasticity in VLSI for computation is investigated.
Extension of the Top-Down Data-Driven Strategy to ILP
Authors: Erick Alphonse, Céline Rouveirol
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

Several upgrades of Attribute-Value learning to Inductive Logic Programming have been proposed and used successfully. However, the Top-Down Data-Driven strategy, popularised by the AQ family, has not yet been transferred to ILP: if the idea of reducing the hypothesis space by covering a seed example is utilised with systems like PROGOL, Aleph or MIO, these systems do not benefit from the associated data-driven specialisation operator. This operator is given an incorrect hypothesis h and a covered negative example e and outputs a set of hypotheses more specific than h and correct wrt e. This refinement operator is very valuable considering heuristic search problems ILP systems may encounter when crossing plateaus in relational search spaces. In this paper, we present the data-driven strategy of AQ, in terms of a lgg-based change of representation of negative examples given a positive seed example, and show how it can be extended to ILP. We evaluate a basic implementation of AQ in the system Propal on a number of benchmark ILP datasets.
A Unified Mathematical Treatment of Regression Problems in Image Processing
Authors: Karlheinz Spindler
Venue: Proceedings of the 3rd international conference on Advances in Mass Data Analysis of Images and Signals in Medicine, Biotechnology, Chemistry and Food Industry (2008)

In this paper we study some optimization problems resulting from image processing tasks in medical applications. These problems are solved using a coordinate-free approach which not only reduces the computational effort in finding the solutions and enhances conceptual clarity, but also leads to closed-form solutions.
On the Non-deterministic Communication Complexity of Regular Languages
Authors: Anil Ada
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

In this paper we study the non-deterministic communication complexity of regular languages. We show that a regular language has either constant or at least logarithmic non-deterministic communication complexity. We prove several linear lower bounds which we know cover a wide range of regular languages with linear complexity. Furthermore we find evidence that previous techniques (Tesson and Thérien 2005) for proving linear lower bounds, for instance in deterministic and probabilistic models, do not work in the non-deterministic setting. 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
Development of a Femininity Estimator for Voice Therapy of Gender Identity Disorder Clients
Authors: Nobuaki Minematsu, Kyoko Sakuraba
Venue: Speaker Classification II: Selected Projects (2007)

This work describes the development of an automatic estimator of perceptual femininity (PF) of an input utterance using speaker verification techniques. The estimator was designed for its clinical use and the target speakers are Gender Identity Disorder (GID) clients, especially MtF (Male to Female) transsexuals. The voice therapy for MtFs, which is conducted by the second author, comprises three kinds of training; 1) raising the baseline F 0 range, 2) changing the baseline voice quality, and 3) enhancing F 0 dynamics to produce an exaggerated intonation pattern. The first two focus on static acoustic properties of speech and the voice quality is mainly controlled by size and shape of the articulators, which can be acoustically characterized by the spectral envelope. Gaussian Mixture Models (GMM) of F 0 values and spectrums were built separately for biologically male speakers and female ones. Using the four models, PF was estimated automatically for each of 142 utterances of 111 MtFs. The estimated values were compared with the PF values obtained through listening tests with 3 female and 6 male novice raters. Results showed very high correlation (R=0.86) between the two, which is comparable to the intra- and inter-rater correlation.
A User Independent, Biosignal Based, Emotion Recognition Method
Authors: G. Rigas, C. D. Katsis, G. Ganiatsas, D. I. Fotiadis
Venue: Proceedings of the 11th international conference on User Modeling (2007)

A physiological signal based emotion recognition method, for the assessment of three emotional classes: happiness, disgust and fear, is presented. Our approach consists of four steps: (i) biosignal acquisition, (ii) biosignal preprocessing and feature extraction, (iii) feature selection and (iv) classification. The input signals are facial electromyograms, the electrocardiogram, the respiration and the electrodermal skin response. We have constructed a dataset which consists of 9 healthy subjects. Moreover we present preliminary results which indicate on average, accuracy rates of 0.48,0.68 and 0.69 for recognition of happiness, disgust and fear emotions, respectively.
Report from the Ubicomp Education Workshop
Authors: Gregory D. Abowd, Gaetano Borriello, Gerd Kortuem
Venue: IEEE Pervasive Computing (2004)

This Education and Training column departs somewhat from the norm. Rather than presenting information about a specific class, the authors discuss, more broadly, the status and future directions for pervasive and ubiquitous computing education. The column summarizes the Ubicomp Education Workshop, which the authors chaired, held in conjunction with Ubicomp 2003. The column aims to serve as a foundation for future discussions on pervasive and ubiquitous computing education, such as at the Workshop on Pervasive Computing Education held in conjunction with PerCom 2004 (www.percom.org).
Service-Oriented Architectures and Application Integration
Authors: Th. Haase, M. Nagl
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

Service-oriented architectures define an architectural style for the construction of a heterogeneous application landscape. By abstracting services, business processes are decoupled from the underlying applications.This section describes how the results of the IMPROVE subproject I3, related to model-driven development process for wrapper construction, are transferred and extended within the area of business applications. We present an approach which yields a prototype to formally specify service descriptions and service compositions. This prototype makes it possible to evaluate and explore service-oriented architecture concepts.
Real-Time Recognition of Human Gestures for 3D Interaction
Authors: Antoni Jaume-I-Capó, Javier Varona, Francisco J. Perales
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

A fundamental natural interaction concept is not yet fully exploited in most of the existing human-computer interfaces. Recent technological advances have created the possibility to naturally and significantly enhance the interface perception by means of visual inputs, the so called Vision-Based Interaction (VBI). In this paper, we present a gesture recognition algorithm where the user's movements are obtained through a real-time vision-based motion capture system. Specifically, we focus on recognizing users motions with a particular mean, that is, a gesture. Defining an appropriate representation of the user's motions based on a temporal posture parameterization, we apply non-parametric techniques to learn and recognize the user's gestures in real-time. This scheme of recognition has been tested for controlling a classical computer videogame. The results obtained show an excellent performance in on-line classification and it allows the possibility to achieve a learning phase in real-time due to its computational simplicity.
Feature Extraction and Coverage Problems in Distributed Sensor Networks
Authors: Sitharama S. Iyengar
Venue: Proceedings of the 5th international symposium on Parallel and Distributed Processing and Applications (2007)

Distributed Sensor Network is a classical area of multi- disciplinary science. This needs a special type of computing, communication and sensing. This talk presents some new results on the following topics: 1) An optimization framework based on mathematical programming for maximizing the coverage probability of a sensor field under the constraints of investment limit; 2) Feature extraction using sensor networks.
The Research and Application of Nonlinear Predictive Functional Control Based on Characteristic Models
Authors: Peijian Zhang, Jianguo Wu, Minrui Fei
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

By combining dynamical feature of objects with requirements of control performance, predictive model uses a second order slow time varying linear model to characterize original controlled station. This paper introduces a way to establish a category of predictive models of nonlinear objects and lead this kind of model into predictive functional control (PFC) so then obtain nonlinear PFC arithmetic based on characteristic model. We successfully avoid the problem of online identification of slow time varying parameters by setting parameter interval, thereby this kind of control arithmetic is typical of easy operation, high speed and wide applicability in comparison with traditional PFC. Finally this paper offers applied living examples by considering temperature control problem of continuous stirring tank reactor(CSTR).
SIGACT news online algorithms column 13: 2007 - an offine perspective
Authors: Marek Chrobak
Venue: ACM SIGACT News (2008)

This is a survey of last year's work on online competitive algorithms. The survey covers only conference papers, including those from SODA, FOCS, STOC, STACS, COCOON, ISAAC, ESA, ICALP, WAOA, and ISAAC. I tried to focus on research directly dealing with competitive analysis, and in many cases I had to make judgment calls, whether to include them or not. My initial intent was to cover only some highlights, representative of the current trends in the field, but somehow, over time, it grew to a much longer and comprehensive document. I feel compelled to add that, with the deadline approaching, I was not able to spend as much time on debugging as I should, and some errors and omissions are, I'm afraid, inevitable. If you spot anything that should be corrected, please let me know.
Exploring Computational Scheme of Complex Problem Solving Based on Meta-Synthesis Approach
Authors: Yijun Liu, Wenyuan Niu, Jifa Gu
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

There are many approaches to complex problem solving, depending on the nature of the problem and the people involved in the problem. In this paper, a computational scheme based on meta-synthesis approach is applied to a social problem on exploring some issues about taxis drivers. Firstly, group argumentation environment (GAE) as a computerized tool is used to facilitate expert thinking process (meeting) about the concerned topics and form scenario or hypotheses based on qualitative meta-synthesis approach. Next, six strategies of quantitative meta-synthetic system modeling are introduced and one of that is used to construct a multi-agent model which aims to analyze the relations between taxis drivers' income and their behavior response intensity. Finally, some concluding remarks and future works are given.
An Extensible State Machine Pattern for Interactive Applications
Authors: Brian Chin, Todd Millstein
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

The state design pattern is the standard object-oriented programming idiom for implementing the state machine logic of interactive applications. While this pattern provides a number of advantages, it does not easily support the creation of extended state machines in subclasses. We describe the extensible state design pattern, which augments the traditional state pattern with a few additional constraints that allow subclasses to easily add both new states and new events. Further, we observe that delimited continuations, a well-known construct from functional programming languages, supports state refinement in subclasses as well as the modular expression of control flow in the presence of interaction. We illustrate our pattern in the context of Java, leveraging its generics to obviate the need for dynamic typecasts and employing a small library that implements delimited continuations. We have used our pattern to simplify and modularize a widely used application written by others.
An Efficient Algorithm for Naive Possibilistic Classifiers with Uncertain Inputs
Authors: Salem Benferhat, Karim Tabia
Venue: Proceedings of the 2nd international conference on Scalable Uncertainty Management (2008)

Possibilistic networks are graphical models particularly suitable for representing and reasoning with uncertain and incomplete information. According to the underlying interpretation of possibilistic scales, possibilistic networks are either quantitative or qualitative. In this paper, we address possibilistic-based classification with uncertain inputs. More precisely, we first analyze Jeffrey's rule for revising possibility distributions by uncertain observations. Then, we propose an efficient algorithm for revising possibility distributions encoded by a naive possibilistic network. This algorithm is particularly suitable for classification with uncertain inputs since it allows classification in polynomial time using different efficient transformations of initial naive possibilistic networks.
Bringing Creation of Context-Aware Mobile Services to the Masses
Authors: Jan Keiser, Tham Kriengchaiyapruk
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

There are major barriers of entry that prevent individuals or small businesses from taking advantage of web services to enhance their businesses. Creating a web service is a task that would normally require someone with technical skills in programming. The overall cost of maintenance of the servers is also usually prohibitively high. The LOMS (Local Mobile Services) project addresses the above issues and tries to bring a context sensitive web service creation to the masses. In this project, by combining the concept of an open integrated SOA platform and a style-sheet transformation, nontechnical users as well as small businesses are able to create and manage context-aware web services easily and quickly. This paper focuses on the service creation aspect.
Striping without sacrifices: maintaining POSIX semantics in a parallel file system
Authors: Jan Stender, Björn Kolbeck, Felix Hupfeld, Eugenio Cesario, Erich Focht, Matthias Hess, Jesús Malo, Jonathan Martí
Venue: First USENIX Workshop on Large-Scale Computing (2008)

Striping is a technique that distributes file content over multiple storage servers and thereby enables parallel access. In order to be able to provide a consistent view across file data and metadata operations, the file system has to track the layout of the file and know where the file ends and where it contains gaps. In this paper, we present a light-weight protocol for maintaining a consistent notion of a file's layout that provides POSIX semantics without restricting concurrent access to the file. In an evaluation, we show that the protocol scales and elicit its corner cases.
Accuracy in Rating and Recommending Item Features
Authors: Lloyd Rutledge, Natalia Stash, Yiwen Wang, Lora Aroyo
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

This paper discusses accuracy in processing ratings of and recommendations for item features. Such processing facilitates feature-based user navigation in recommender system interfaces. Item features, often in the form of tags, categories or meta-data, are becoming important hypertext components of recommender interfaces. Recommending features would help unfamiliar users navigate in such environments. This work explores techniques for improving feature recommendation accuracy. Conversely, it also examines possibilities for processing user ratings of features to improve recommendation of both features and items.This work's illustrative implementation is a web portal for a museum collection that lets users browse, rate and receive recommendations for both artworks and interrelated topics about them. Accuracy measurements compare proposed techniques for processing feature ratings and recommending features. Resulting techniques recommend features with relative accuracy. Analysis indicates that processing ratings of either features or items does not improve accuracy of recommending the other.
m-Sequences of Lengths 22k 1 and 2k - 1 with at Most Four-Valued Cross Correlation
Authors: Tor Helleseth, Alexander Kholosha
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

Considered is the distribution of the cross correlation between m-sequences of length 2 m - 1, where m is even, and m-sequences of a shorter length 2 m/2- 1. Pairs of this type with at most four-valued cross correlation are found and the complete correlation distribution is determined. These results cover the two-valued Kasami case and all three-valued decimations found earlier. Conjectured is that there are no other cases leading to at most four-valued cross correlation apart from the ones proven here and except for a single, seemingly degenerate, case.
An Algorithmic Study of Deduction in Simple Conceptual Graphs with Classical Negation
Authors: Michel Leclère, Marie-Laure Mugnier
Venue: Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning (2008)

Polarized conceptual graphs (PGs) are simple conceptual graphs added with a restricted form of negation, namely negation on relations. Classical deduction with PGs (in short PG-Deduction) is highly intractable; it is indeed ${\Pi}^2_P$ complete. In [LM06] a brute-force algorithm for solving PG-Deduction was outlined. In the present paper, we extend previous work with two kinds of results. First, we exhibit particular cases of PGs for which the complexity of PG-Deduction decreases and becomes not more difficult than in simple conceptual graphs. Secondly, we improve the brute-force algorithm with several kinds of techniques based on properties concerning the graph structure and the labels.
Beam Me Up, Doctor McCoy
Authors: Vince Stanford
Venue: IEEE Pervasive Computing (2003)

Interplanetary explorers in science fiction have long worn communicators to keep in voice contact with team members and deliver crucial information just when needed. Wearers simply ask the badge to contact appropriate individuals by name, function, or location voil`a, they're connected. Moreover, the badges respond only to their owners, not to nearby casual conversations.They are always light, small, and casually portable. Best yet, they are no longer fiction. To see how this concept translates to a real-life working organization with pressing schedules and a busy staff, I spoke with representatives from Vocera Communications, which has developed a working communicator badge system for mobile users, and from St. Vincent's Hospital in Birmingham, Alabama, which has deployed the Vocera system. As with other pervasive systems we've covered, this one delivers information directly to mobile workers, at the point of service, thus saving numerous trips to distant telephones, terminals, and PCs to get needed data and messages. Vince Stanford
Color Word Processing
Authors: Andrew Lippman, Walter Bender, Gitta Soloman, Mitsuo Saito
Venue: IEEE Computer Graphics and Applications (1985)

This text editor uses display color not as a design element but as a way to convey the author's intent in every stage of a document's evaluation.
Solving Multiple Dataflow Queries Using WPDSs
Authors: Akash Lal, Thomas Reps
Venue: Proceedings of the 15th international symposium on Static Analysis (2008)

A dataflow query asks for the set of reachable (abstract) states, given a starting set of states. In this paper, we show how to optimize multiple queries on the same program (each with a different starting set of states) for better overall running time. After a preprocessing phase, we obtain an asymptotic improvement in answering dataflow queries. We use weighted pushdown systems as the abstract model of a program. Our techniques are interprocedural. They are general, yet provide an impressive speedup. We applied our algorithm to three very different applications, one based on finding affine relations using linear algebra, and others for model checking Boolean programs, and obtained 1.5-fold to 7-fold speedups.