ppxscal/embedding_network huggingface dataset:
E- Subtitles: Emotional Subtitles as a Technology to Assist the Deaf and Hearing-Impaired when Learning from Television and Film.
Authors: James Ohene-Djan, Rachel Shipsey
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The use of subtitling to represent audio dialogue of film and television presentations is well known and understood. In context of learning technologies, Deaf and hearing-impaired students use subtitles to read dialogue and identify characters. Some simple manipulations such as the increasing of text sizes and the changing of colour are often made available. To date, however, little work has been directed towards the adaptation of subtitles to indicate the emotional nuances of dialogue. Such adaptation could potentially yield significant benefits to hearing-impaired and Deaf students who wish to study and learn from film and television presentations. In this paper, we introduce a model and a system that demonstrates the presentation of subtitles which depict (some of) the emotions behind the words used, as well as the words themselves. The system also provides viewers with the ability to personalise their interaction with subtitles, enabling them to gain the maximum benefit from the subtitle presentation.
Improving text clustering for functional analysis of genes
Authors: Daniel Berleant, Eve Wurtele
Venue:  (2006)

Continued rapid advancements in genomic, proteomic and metabolomic technologies demand computer-aided methods and tools to efficiently and timely process large amount of data, extract meaningful information, and interpret data into knowledge. While numerous algorithms and systems have been developed for information extraction (i.e. profiling analysis), biological interpretation still largely relies on biologists' domain knowledge, as well as collecting and analyzing functional information from various public databases. The goal of this project was to build a text clustering-based software system, called GeneNarrator, for functional analysis of genes (microarray experiments). GeneNarrator automatically collected MEDLINE citations for a list of genes as the source of functional information. A two-step clustering approach was designed to process the citations. The first-step (text) clustering grouped the citations into hierarchical topics. The second-step (gene) clustering grouped the genes based on the similarities of their occurrences across the clusters resulting from step one. Hence, we planned to demonstrate how, instead of manually collecting and tediously sifting through potentially thousands of citations, biologists can be presented with dozens of topics as a summarization of the citations, and gene (groups) mapped to the topics. In order to improve the first-step text clustering part of the system, several strategies were explored, including different vector space models (BOW-based or concept-based) for text representation, vector space dimensionality reduction (document frequency filtering), and multi clustering. The most improvement came from multi-clustering. The clusterings were evaluated in terms of self-consistency and agreement with a manually constructed gold standard dataset using a newly proposed metric, normalized mutual information.
New Traitor Tracing Scheme against Anonymous Attack
Authors: Chen Yang, Wenping Ma, Xinmei Wang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In this paper, we present a new efficient traitor tracing scheme against anonymous attack of which the security is based on the Inverse Weil-pairing Assumption and the Decisional k-BDHI assumption. The proposed scheme enables broadcasting a header with smaller constant transmission size regardless of the number of colluders and is much more efficient with lower computation cost.
Maximum likelihood method for blind identification of multiple autoregressive channels
Authors: Zheng Fang, Yingbo Hua
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

We present a two-step maximum likelihood (TSML) algorithm for blind identification of single-input-multiple-output (SIMO) channels modeled as autoregressive (AR) system. The AR-TSML algorithm provides a new and useful alternative to a previously developed TSML algorithm for moving-average (MA) system. The AR-TSML algorithm is shown to be more robust than the MA-TSML algorithm if the channel impulse responses have long tails.
Array shape reconstruction for a nominally linear array
Authors: J.-J. Fuchs
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

We consider a thin flexible line array of equispaced hydrophones that is towed through the sea and develop a procedure that estimates the shape of the array. We first define a test that decides if an array is straight or not. The test is applied to the whole array. If it is declared out of shape, the same test is used on parts of it to determine the maximum length of admissible sub-arrays on which the standard processing can be pursued. By combining then the bearings estimated by the different sub-arrays we reconstruct a piecewise linear estimate of the shape of the array. The approach allows to handle quite important deformations with no need for a cooperating source.
Detecting collisions in an unstructured environment through path anticipation
Authors: Jongan Park, Sungkwan Kang, Nishat Ahmad, Gwangwon Kang
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Detecting and avoiding a potential collision is the most important aspect when we talk about mobile objects of all types, ranging from autonomous vehicles, ship and aircraft navigation to robot manipulators etc. Image processing techniques could be used to provide solutions in such scenarios. Detection of a possible collision requires accurate information about the path of a moving object. The projected paths of all mobile objects in vicinity can illustrate if a possible collision scenario exists and its level of seriousness. Based on which, collision avoidance actions can be initiated. This paper presents use of image processing techniques for collision detection and avoidance scenarios using the statistical measurements.
dmFSQL: a Language for Data Mining
Authors: Ramon Alberto Carrasco, Maria Amparo Vila, Francisco Araque
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

At present, we have a FSQL server available for Oracle© Databases which allow us to query a Fuzzy or Classical Database with the FSQL (Fuzzy SQL) language for any data type. The FSQL language is an extension of the SQL language, which permits us to write flexible conditions in our queries to a fuzzy or traditional database. In this paper, we proceed to extend FSQL into a new language called dmFSQL (data mining Fuzzy Structured Query Language) which can be used to solve real problems of clustering and classification. We consider that this model satisfies the requirements of Data Mining systems.
Preface to AEWSE'06
Authors: Sven Casteleyn, Florian Daniel, Geert-Jan Houben, Maristella Matera, Peter Plessers, Olga De Troyer
Venue: Workshop proceedings of the sixth international conference on Web engineering (2006)

Current Web Applications are volatile in nature, and require (frequent) changes of content, functionality, semantics, structure, navigation, presentation or implementation. Often, the application is somehow engineered at design time to be able to adapt to for example the user, context, or device: this is reflected by the concept of adaptation. However, changes may also occur unexpectedly over time, for example in the case of a re-design of the site or in the case of updates due to changing external sources: in this case, we talk about evolution as a natural and intrinsic part of the application's life cycle.The First International Workshop on Adaptation and Evolution in Web Systems Engineering studies all forms of (support for) adaptation and evolution during the Web engineering process, and in particular the synergy between both.
Plagiarism Detection through Multilevel Text Comparison
Authors: Manuel Zini, Marco Fabbri, Massimo Moneglia, Alessandro Panunzi
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

The paper presents the implementation of a tool for plagiarism detection developed within the AXMEDIS project. The algorithm leverages the plagiarist behaviour, which is modeled as a combination of 3 basical actions: insertion, deletion, substitution. We recognize that this behaviour may occur at various level of the document structure: the plagiarist may insert, delete or substitute a word, period or a paragraph. The procedure consists in two main steps: document structure extraction and plagiarism function calculation. We propose a recursive plagiarism evaluation function to be evaluated at each level of the document structure which is based on the Levenshtein edit distance. We also propose a method that will eliminate unnecessary chunks comparison, avoiding similarity calculation of chunks which do not share enough 4-grams. We describe the similarity algorithm and discuss some implementation issues and future work.
Fast algorithms for systems of equations in wavelet-based solution of integral equations with Toeplitz kernels
Authors: A. Bell, R. Joshi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The wavelet transform is applied to integral equations with Toeplitz kernels. Such integral equations arise in inverse scattering and linear least-squares estimation. The result is a system of equations with block-slanted-Toeplitz structure. In previous approaches, this linear system was sparsified by neglecting all entries below some threshold. However, in inverse scattering, the Toeplitz kernel may not be a rapidly decreasing function due to reflections from great depths. In this case, neglecting entries below a threshold will not work since the system matrix is ill-conditioned. We use the different approach of exploiting the block-slanted-Toeplitz structure to obtain fast algorithms similar to the multichannel Levinson and Schur algorithms. Since it is exact to within the wavelet-basis approximation, this different approach should prove to be a valuable alternative to the approximate approach of sparsification in cases when the latter does not work.
A two-class parallel queue with pure space sharing among rigid jobs and general service times
Authors: Dimitrios Filippopoulos, Helen Karatza
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

We analyze a parallel system model with one queue, two servers and rigid jobs. Each job arriving to the queue may require either one or two servers. Jobs that require one server (type-1 jobs) have exponentially distributed service requirements while jobs requiring two servers (type-2 jobs) have general service time distribution. The FCFS scheduling discipline is assumed and all jobs are served according to pure space sharing. By applying the supplementary variable method we derive closed-form expressions, exact as well as approximate, for the steady-state mean queue length and utilization of the servers. In addition, we investigate the utilization as well as the throughput of the system as the load reaches its maximal value inside the stability region. Numerical results are presented that give insight into the impact of each parameter on system performance.
H/sub /spl infin//-optimal control of a parametrically disturbed pendulum
Authors: D. V. Balandin, M. M. Kogan, A. A. Fedukov
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

Based on the H/sub /spl infin//-control technique, a control law for a parametrically disturbed pendulum is derived, under which a level of attenuating oscillations is close to the minimally possible one. Results of numerical modeling are presented.
The Cerebellum and English Grammatical Morphology: Evidence from Production, Comprehension, and Grammaticality Judgments
Authors: Timothy Justus
Venue: Journal of Cognitive Neuroscience (2004)

Three neuropsychological experiments on a group of 16 cerebellar patients and 16 age- and education-matched controls investigated the effects of damage to the cerebellum on English grammatical morphology across production, comprehension, and grammaticality judgment tasks. In Experiment 1, participants described a series of pictures previously used in studies of cortical aphasic patients. The cerebellar patients did not differ significantly from the controls in the total number of words produced or in the proportion of closed-class words. They did differ to a marginally significant extent in the production of required articles. In Experiment 2, participants identified the agent in a series of aurally presented sentences in which three agency cues (subject&ndash;verb agreement, word order, and noun animacy) were manipulated. The cerebellar patients were less affected than the controls were by the manipulation of subject&ndash;verb agreement to a marginally significant extent. In Experiment 3, participants performed a grammaticality judgment task on a series of aurally presented sentences. The cerebellar patients were significantly less able to discriminate grammatical and ungrammatical sentences than the controls were, particularly when the error was of subject&ndash;verb agreement as opposed to word order. The results suggest that damage to the cerebellum can result in subtle impairments in the use of grammatical morphology, and are discussed in light of hypothesized roles for the cerebellum in language.
Towards Robust and Physically Plausible Shaded Stereoscopic Segmentation
Authors: Dejun Wang, Stefano Soatto, Emmanuel Prados
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

We address the multi-view shape from shading problem, that is the recovery of 3-D shape, lighting configuration and surface albedo from multiple calibrated views. Previous approaches to this problem relied on physically impossible illumination models (negative light) and only work on constant albedo and resulted in biased estimates of shape and lighting positions. Furthermore, since the solution involves infinite-dimensional optimization, existing approaches were quite slow. We develop a new model that explicitly enforces positivity in the light sources with the assumption that the object is Lambertian and its albedo is piecewise constant and show that the new model significantly improves the accuracy and robustness relative to existing approaches. Furthermore, we show that the most computationally expensive step in the optimization can actually be solved in closed form. This significantly improves speed of convergence over existing schemes. We illustrate the behavior of our algorithm directly on the same data used by previous authors, so direct comparison is possible.
Articulated Object Recognition: A General Framework and a Case Study
Authors: Luigi Cinque, Enver Sangineto, Steven Tanimoto
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

We present in this paper a general-purpose approach for articulated object recognition. We split the recognition process in two distinct phases. In the former we use standard model-based techniques in order to recognize and localize in the input image the rigid components the articulated object is composed of. In the second phase the spatial configurations formed by the recognized components are analyzed and compared with the valid configurations of the object we are searching. The comparison is based on a constraint satisfaction method which can deal with both missing components and false positives. The proposed method is based on a redundant set of constraints which represent the valid spatial configurations of the object's components. Such constraints are not embedded in the system nor are domain-specific but they are learned during a suitable training phase. We show how this approach can be used in different scenarios with different kinds of articulated objects and we present a case study concerning a robotic application.
Applications of empirical processes in learning theory: algorithmic stability and generalization bounds
Authors: Tomaso Poggio
Venue:  (2006)

This thesis studies two key properties of learning algorithms: their generalization ability and their stability with respect to perturbations. To analyze these properties, we focus on concentration inequalities and tools from empirical process theory. We obtain theoretical results and demonstrate their applications to machine learning.First, we show how various notions of stability upper- and lower-bound the bias and variance of several estimators of the expected performance for general learning algorithms. A weak stability condition is shown to be equivalent to consistency of empirical risk minimization. The second part of the thesis derives tight performance guarantees for greedy error minimization methods---a family of computationally tractable algorithms. In particular, we derive risk bounds for a greedy mixture density estimation procedure. We prove that, unlike what is suggested in the literature, the number of terms in the mixture is not a bias-variance trade-off for the performance. The third part of this thesis provides a solution to an open problem regarding the stability of Empirical Risk Minimization (ERM). This algorithm is of central importance in Learning Theory. By studying the suprema of the empirical process, we prove that ERM over Donsker classes of functions is stable in the L1 norm. Hence, as the number of samples grows, it becomes less and less likely that a perturbation of o( n ) samples will result in a very different empirical minimizer. Asymptotic rates of this stability are proved under metric entropy assumptions on the function class. Through the use of a ratio limit inequality, we also prove stability of expected errors of empirical minimizers. Next, we investigate applications of the stability result. In particular, we focus on procedures that optimize an objective function, such as k-means and other clustering methods. We demonstrate that stability of clustering, just like stability of ERM, is closely related to the geometry of the class and the underlying measure. Furthermore, our result on stability of ERM delineates a phase transition between stability and instability of clustering methods. In the last chapter, we prove a generalization of the bounded-difference concentration inequality for almost-everywhere smooth functions. This result can be utilized to analyze algorithms which are almost always stable. Next, we prove a phase transition in the concentration of almost-everywhere smooth functions. Finally, a tight concentration of empirical errors of empirical minimizers is shown under an assumption on the underlying space. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Enterprise information mashups: integrating information, simply
Authors: Anant Jhingran
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

There is a fundamental transformation that is taking place on the web around information composition through mashups. We first describe this transformation and then assert that this will also affect enterprise architectures. Currently the state-of-the-art in enterprises around information composition is federation and other integration technologies. These scale well, and are well worth the upfront investment for enterprise class, long-lived applications. However, there are many information composition tasks that are not currently well served by these architectures. The needs of Situational Applications (i.e. applications that come together for solving some immediate business problems) are one such set of tasks. Augmenting structured data with unstructured information is another such task. Our hypothesis is that a new class of integration technologies will emerge to serve these tasks, and we call it an enterprise information mashup fabric. In the talk, we discuss the information management primitives that are needed for this fabric, the various options that exist for implementation, and pose several, currently unanswered, research questions.
SAgent: a security framework for JADE
Authors: Vandana Gunupudi, Stephen R. Tate
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

This paper presents SAgent, a general-purpose mobile agent security framework that is designed to protect the computations of mobile agent applications in potentially hostile environments. SAgent works with the JADE (Java Agent DEvelopment) platform [6], a FIPA-compliant multi-agent environment. SAgent supports modular and mostly orthogonal development of agent protection techniques and secure agent applications, so protocols and applications can be developed independently of each other. To accomplish this, a clean conceptual framework is presented which encapsulates in several general class interfaces the common security functionality required by secure agent applications. Furthermore, implementations are provided for two secure multi-agent protocols, and we give experimental results showing the feasibility of these protections. While a few other research projects have examined protocols and techniques for protecting agents, these have been theoretical explorations. SAgent's goal is to bring these theoretical techniques into practice so that they can be experimented with and used, in the framework of a design generic enough to support both software-based and hardware-based protections. The abstractions are clean, giving a well-defined way for a new security provider to implement and experiment with new techniques for protecting mobile agents.
A Lifecycle approach to evaluating MyArtSpace
Authors: Giasemi Vavoula, Julia Meek, Mike Sharples, Peter Lonsdale, Paul Rudman
Venue: Proceedings of the Fourth IEEE International Workshop on Wireless, Mobile and Ubiquitous Technology in Education (2006)

MyArtSpace is a service on mobile phones for enquiry-led museum learning. It enables students to create their own interpretations of museum visits through descriptions of objects, images and sounds. These are automatically transmitted to a personal online gallery that they can use to reflect upon and share their experience. This paper describes the Lifecycle evaluations of MyArtSpace, throughout the design and deployment stages.
Facilitating global computing education through study abroad and collaborative projects
Authors: Cary Laxer, Ursula Fuller, Annegret Goold, Alison Young
Venue: Proceedings of the 8th Austalian conference on Computing education - Volume 52 (2006)

This panel presents the results of the ITiCSE 2005 working group on facilitating student learning through study abroad and international projects. It discusses ways of adding international experiences to student learning, barriers to international learning, and how to do more. Dialogue with the attendees will broaden the discussion.