ppxscal/embedding_network huggingface dataset:
A neural-based remote eye gaze tracker under natural head motion
Authors: Diego Torricelli, Silvia Conforto, Maurizio Schmid, Tommaso D'Alessio
Venue: Computer Methods and Programs in Biomedicine (2008)

A novel approach to view-based eye gaze tracking for human computer interface (HCI) is presented. The proposed method combines different techniques to address the problems of head motion, illumination and usability in the framework of low cost applications. Feature detection and tracking algorithms have been designed to obtain an automatic setup and strengthen the robustness to light conditions. An extensive analysis of neural solutions has been performed to deal with the non-linearity associated with gaze mapping under free-head conditions. No specific hardware, such as infrared illumination or high-resolution cameras, is needed, rather a simple commercial webcam working in visible light spectrum suffices. The system is able to classify the gaze direction of the user over a 15-zone graphical interface, with a success rate of 95% and a global accuracy of around 2^o, comparable with the vast majority of existing remote gaze trackers.
Formal method for automated testing data flow aspects of communications protocols, software, and systems specified in Lotos
Authors: Hazem El-Gendy, Nabil El-Kadhi
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

In this paper, we discuss the testing of data flow aspects of communications protocols and distributed systems specified in Lotos; the ISO Formal Description Technique (FDT). We also develop a method for automated derivation of sequences to conformance test data flow aspects of a system specified in Lotos. This has applications for communications protocols, software, and distributed real time systems in general. We generalize the testing method, with best known coverage, developed for Extended Finite State Machines (EFSMs) to the algebraic FDT Lotos. The method firstly constructs a "Data-Oriented Restricted Behavior" Tree that represents the behavior of the given specification. An algorithm for the automated construction of T is developed in this paper. Then, the testing sequences are driven.
Mining Numerical Data--A Rough Set Approach
Authors: Jerzy W. Grzymala-Busse
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

We present an approach to mining numerical data based on rough set theory using calculus of attribute-value blocks. An algorithm implementing these ideas, called MLEM2, induces high quality rules in terms of both simplicity (number of rules and total number of conditions) and accuracy. Additionally, MLEM2 induces rules not only from complete data sets but also from data with missing attribute values, with or without numerical attributes.
Fatigue based 3D structural design optimisation implementing genetic algorithms and utilising the generalised Frost-Dugdale crack growth law
Authors: K. Krishnapillai, R. Jones
Venue: Proceedings of the 9th WSEAS International Conference on Evolutionary Computing (2008)

The research presented here utilises the 'Generalised Frost-Dugdale law' with a genetic algorithm in a numerical three-dimensional fatigue based optimisation study of a 7050-T7451 aluminium structure. Genetic algorithm has been utilised in many stress based optimisation applications, however to date, it has not been used in a three dimensional structural fatigue based optimisation study involving short crack lengths. The generalised Frost-Dugdale law was developed to allow for the accurate prediction of fatigue crack growth from short crack lengths. Consequently, design against fatigue failure can include the analysis of near-threshold crack propagation. The structural optimisation procedure proposed integrates 3D geometrical modelling, structural analysis and optimization into one complete and automated computer-aided design process. This paper indicates that the proposed combined procedure provides a more accurate and robust optimised solution. It was discovered that the results resembled the solutions from other optimisation algorithms. As a result, this procedure illustrates a procedure for the design of light weight structures using a fatigue based optimisation in conjunction with a genetic algorithm. Furthermore, the possibility of the application of the generalised Frost-Dugdale model in design optimisation has been demonstrated.
Modelling and Analysing the Contract Net Protocol - Extension Using Coloured Petri Nets
Authors: Jonathan Billington, Amar Kumar Gupta, Guy Edward Gallasch
Venue: Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2008)

The Contract Net Protocol is a task allocation protocol that facilitates negotiation between bidders and an auctioneer in a Multi-Agent System to form a contract. The extension allows the bidders to interact with more than one auctioneer concurrently, and to update their bids until a bid is granted. This introduces flexibility and ensures better selection of a bid. In this paper, we model the Contract Net Protocol - extension with Coloured Petri Nets and show that it terminates correctly. We analyse the terminal states and prove that the agents have consistent beliefs at the end of the negotiations, and that there is no "dead code" in the procedures. Lastly, we show how the number of terminal states and channel bounds are related to the number of bidders.
Faster Swap Edge Computation in Minimum Diameter Spanning Trees
Authors: Beat Gfeller
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

In network communication systems, frequently messages are routed along a minimum diameter spanning tree (MDST) of the network, to minimize the maximum travel time of messages. When a transient failure disables an edge of the MDST, the network is disconnected, and a temporary replacement edge must be chosen, which should ideally minimize the diameter of the new spanning tree. Preparing for the failure of any edge of the MDST, the all-best-swaps (ABS) problem asks for finding the best swap for every edge of the MDST. Given a 2-edge-connected weighted graph G = (V,E), where |V| = n and |E| = m, we solve the ABS problem in $ O\left( m\log n \right) $ time and O(m ) space, thus considerably improving upon the decade-old previously best solution, which requires $O(n\sqrt{m})$ time and O(m) space, for $m=o\left(n^2/ \log^2 n\right)$.
Tests for Gene Clusters Satisfying the Generalized Adjacency Criterion
Authors: Ximing Xu, David Sankoff
Venue: Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2008)

We study a parametrized definition of gene clusters that permits control over the trade-off between increasing gene content versus conserving gene order within a cluster. This is based on the notion of generalized adjacency, which is the property shared by any two genes no farther apart, in the linear order of a chromosome, than a fixed threshold parameter ¿. Then a cluster in two or more genomes is just a maximal set of markers, where in each genome these markers form a connected chain of generalized adjacencies. Since even pairs of randomly constructed genomes may have many generalized adjacency clusters in common, we study the statistical properties of generalized adjacency clusters under the null hypothesis that the markers are ordered completely randomly on the genomes. We derive expresions for the exact values of the expected number of clusters of a given size, for large and small values of the parameter. We discover through simulations that the trend from small to large clusters as a function of the parameter theta exhibits a "cut-off" phenomenon at or near $\sqrt{\theta}$ as genome size increases.
A Detailed Comparison of Probabilistic Approaches for Coping with Unfair Ratings in Trust and Reputation Systems
Authors: Jie Zhang, Murat Sensoy, Robin Cohen
Venue: Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust (2008)

The unfair rating problem exists when a buying agent models the trustworthiness of selling agents by also relying on ratings of the sellers from other buyers. Different probabilistic approaches have been proposed to cope with this issue. In this paper, we first summarize these approaches and provide a detailed categorization of them. This includes our own "personalized" approach for addressing this problem. Based on the implication of such analysis, we then focus on experimental comparison of our approach with two key models in a framework that simulates a dynamic electronic marketplace environment. We specifically examine different scenarios, including ones where the majority of buyers are dishonest, buyers lack personal experience with sellers, sellers may vary their behavior, and buyers may provide a large number of ratings. Our study provides the basis for deciding which approach is most appropriate to employ, in which scenario.
Learning to Interact with the Caretaker: A Developmental Approach
Authors: Antoine Hiolle, Lola Cañamero, Arnaud J. Blanchard
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

To build autonomous robots able to live and interact with humans in a real-world dynamic and uncertain environment, the design of architectures permitting robots to develop attachment bonds to humans and use them to build their own model of the world is a promising avenue, not only to improve human-robot interaction and adaptation to the environment, but also as a way to develop further cognitive and emotional capabilities. In this paper we present a neural architecture to enable a robot to develop an attachment bond with a person or an object, and to discover the correct sensorimotor associations to maintain a desired affective state of well-being using a minimum amount of prior knowledge about the possible interactions with this object.
Support for Informal Information Use and its Formalization in Medical Work
Authors: Charlotte Tang, Sheelagh Carpendale
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

This paper reports the findings from two field studies that reveal paper-based artifacts being heavily relied upon in medical shift work despite the deployment of a mobile technology in a local hospital ward. We present the information flow in terms of common and personal information spaces and identify three important functions of these personal artifacts in the actual work practices. Artifacts serve as a bedside information source for patient care delivery, an opportune notepad and an information basis for reporting and handover. We thus recommend a system employing digital pens and paper so that nurses can retain the manual practice of constructing their personal artifacts, flexibly use them in the actual work and easily formalize the informal information recorded therein. We also discuss the benefits and challenges of our proposed technology.
Heart sound classification using wavelet transform and incremental self-organizing map
Authors: Zümray Dokur, Tamer Ölmez
Venue: Digital Signal Processing (2008)

Determination of heart condition by heart auscultation is a difficult task and requires special training of medical staff. Computerized techniques suggest objective and more accurate results in a fast and easy manner. Hence, in this study it is aimed to perform computer-aided heart sound analysis to give support to medical doctors in decision making. In this study, a novel method is presented for the classification of heart sounds (HSs). Discrete wavelet transform is applied to windowed one cycle of HS. Wavelet transform is used both for the segmentation of S1-S2 sounds and determination of the features. Based on the third, fourth and the fifth decomposition-level detail coefficients, the timings of S1-S2 sounds are determined by an adaptive peak-detector. For the feature extraction, powers of detail coefficients in all five sub-bands are utilized. In the classification stage, Kohonen's SOM network and an incremental self-organizing map (ISOM) are examined comparatively. In order to increase the performance of heart sound classification, an incremental neural network is proposed in this study. It is observed that ISOM successfully classifies the HSs even in noisy environment.
Double-diffusive convection for a non-Newtonian fluid flow past a permeable surface embedded in a porous medium with uniform heat and mass fluxes
Authors: Ali J. Chamkha
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

The problem of steady, laminar, double-diffusive mixed convective flow of a non-Newtonian power-law fluid past a vertical semi-infinite permeable surface embedded in a porous medium with uniform heat and mass fluxes. A mixed convection parameter for the entire range of free-forced-mixed convection is employed and a set of nonsimilar equations are obtained. These equations are solved numerically by an efficient implicit, iterative, finite-difference method. The obtained results are checked against previously published work for special cases of the problem and are found to be in good agreement. A parametric study illustrating the influence of the concentration to thermal buoyancy ratio, power-law fluid viscosity index, mixed convection parameter, suction or injection parameter and the Lewis number on the local Nusselt and the Sherwood numbers is conducted. The obtained results are shown graphically and the physical aspects of the problem are discussed.
Extension of Bayesian Network Classifiers to Regression Problems
Authors: Antonio Fernández, Antonio Salmerón
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

In this paper we explore the extension of various Bayesian network classifiers to regression problems where some of the explanatory variables are continuous and some others are discrete. The goal is to compute the posterior distribution of the response variable given the observations, and then use that distribution to give a prediction. The involved distributions are represented as Mixtures of Truncated Exponentials. We test the performance of the proposed models on different datasets commonly used as benchmarks, showing a competitive performace with respect to the state-of-the-art methods.
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
Authors: Michele Conforti, Marco Summa, Laurence A. Wolsey
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

In this paper we investigate two generalizations of the continuous mixing set studied by Miller and Wolsey [5] and Van Vyve [7]: the intersection set and the continuous mixing set with flows which appears as a strong relaxation of some single-item lot-sizing problems. We give two extended formulations for the convex hull of each of these sets. In particular, for X CMF the sizes of the extended formulations are polynomial in the size of the original description of the set, thus proving that the corresponding linear optimization problem can be solved in polynomial time.
A New Association Rule Mining Algorithm
Authors: B. Chandra, Gaurav
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

A new algorithm called STAG (Stacked Graph) for association rule mining has been proposed in this paper using graph theoretic approach. A structure is built by scanning the database only once or at most twice that can be queried for varying levels of minimum support to find frequent item sets. Incremental growth is possible as and when new transactions are added to the database making it suitable for mining data streams. Transaction scanning is independent of the order of items in a transaction. Performance of this algorithm has been compared with other existing algorithms using popular datasets like the mushroom dataset, chess and connect dataset of the UCI data repository. The algorithm excels in performance when the dataset is dense.
Combining RDF Vocabularies for Expert Finding
Authors: Boanerges Aleman-Meza, Uldis Bojārs, Harold Boley, John G. Breslin, Malgorzata Mochol, Lyndon Jb Nixon, Axel Polleres, Anna V. Zhdanova
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

This paper presents a framework for the reuse and extension of existing, established vocabularies in the Semantic Web. Driven by the primary application of expert finding, we will explore the reuse of vocabularies that have attracted a considerable user community already (FOAF, SIOC, etc.) or are derived from de facto standards used in tools or industrial practice (such as vCard, iCal and Dublin Core). This focus guarantees direct applicability and low entry barriers, unlike when devising a new ontology from scratch. The Web is already populated with several vocabularies which complement each other (but also have considerable overlap) in that they cover a wide range of necessary features to adequately describe the expert finding domain. Little effort has been made so far to identify and compare existing approaches, and to devise best practices on how to use and extend various vocabularies conjointly. It is the goal of the recently started ExpertFinder initiative to fill this gap. In this paper we present the ExpertFinder framework for reuse and extension of existing vocabularies in the Semantic Web. We provide a practical analysis of overlaps and options for combined use and extensions of several existing vocabularies, as well as a proposal for applying rules and other enabling technologies to the expert finding task.
LIA: An Intelligent Advisor for e-Learning
Authors: Nicola Capuano, Matteo Gaeta, Sergio Miranda, Francesco Orciuoli, Pierluigi Ritrovato
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

Intelligent e-learning systems have revolutionized online education by providing individualized and personalized instruction for each learner. Nevertheless, till now very few systems were able to leave academic labs and be integrated in real commercial products. One of this few exceptions is the Learning Intelligent Advisor (LIA) described in this paper, built on results coming from several research projects and currently integrated in a complete e-learning solution named IWT. The purpose of this paper is to describe how LIA works and how it cooperates with IWT in the provisioning of an individualized and personalized e-learning experience. Results of experimentations with real users coming from IWT customers are also presented and discussed in order to demonstrate the benefits of LIA as an add-on in on-line learning.
Range Extension for Weak PRFs; The Good, the Bad, and the Ugly
Authors: Krzysztof Pietrzak, Johan Sjödin
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

We investigate a general class of (black-box) constructions for range extension of weak pseudorandom functions: a construction based on m independent functions F 1,...,F m is given by a set of strings over {1,...,m}*, where for example $\{\langle{2}\rangle, \langle{1,2}\rangle\}$ corresponds to the function X ¿[F 2(X),F 2(F 1(X))]. All efficient constructions for range expansion of weak pseudorandom functions that we are aware of are of this form.We completely classify such constructions as good, bad or ugly, where the good constructions are those whose security can be proven via a black-box reduction, the bad constructions are those whose insecurity can be proven via a black-box reduction, and the ugly constructions are those which are neither good nor bad.Our classification shows that the range expansion from [10] is optimal, in the sense that it achieves the best possible expansion (2 m ¿ 1 when using m keys).Along the way we show that for weak quasirandom functions (i.e. in the information theoretic setting), all constructions which are not bad --- in particular all the ugly ones --- are secure.
An Interactive User Interface for Text Display
Authors: Hyungsuk Ji, Hyunseung Choo
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Studies on the effect of text width on readability have encouraged the use of fixed text-width web/electronic text design. The drawback of this type of design is the loss of users' interactivity with regard to text modification. In this paper, we investigate the web design of the world's top 100 websites and present an alternative interactive user interface for text display.
Linear Polynomial-Time Algorithms To Construct 4-Connected 4-Regular Locally Connected Claw-Free Graphs
Authors: Mingchu Li, Liming Xiong, Hong Liu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

A vertex of a graph is locally connected if its neighborhood is connected. A graph G is locally connected if every vertex of G is locally connected. A graph is called claw-free if it does not contain a copy of K 1,3 as an induced subgraph. In this paper, we provide a constructive characterization of 4-connected 4-regular locally connected claw-free graphs. From its proof, we can give a linear polynomial-time algorithm to construct a 4-connected 4-regular locally connected claw-free graph.
Robust parameter estimation with a small bias against heavy contamination
Authors: Hironori Fujisawa, Shinto Eguchi
Venue: Journal of Multivariate Analysis (2008)

In this paper we consider robust parameter estimation based on a certain cross entropy and divergence. The robust estimate is defined as the minimizer of the empirically estimated cross entropy. It is shown that the robust estimate can be regarded as a kind of projection from the viewpoint of a Pythagorean relation based on the divergence. This property implies that the bias caused by outliers can become sufficiently small even in the case of heavy contamination. It is seen that the asymptotic variance of the robust estimator is naturally overweighted in proportion to the ratio of contamination. One may surmise that another form of cross entropy can present the same behavior as that discussed above. It can be proved under some conditions that no cross entropy can present the same behavior except for the cross entropy considered here and its monotone transformation.
P2P Mobile Multimedia Group Conferencing: Combining SIP, SSM and Scalable Adaptive Coding for Heterogeneous Networks
Authors: Thomas C. Schmidt, Matthias Wählisch, Hans L. Cycon, Mark Palkow
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In this paper we present work in progress on extending multimedia conferencing standards to scalable, mobile multimedia group support based on SIP initiated Source Specific IP Multicast. We propose extensions of SIP for negotiating SSM sessions. SIP protocol specifications and semantics are compatibly extended without adding new SIP methods. We will introduce a multimedia communication software with distributed architecture as implementation reference. The software is built on a scalable video codec adaptive to heterogeneous network capacities.