ppxscal/embedding_network huggingface dataset:
Visual-Based Emotion Detection for Natural Man-Machine Interaction
Authors: Samuel Strupp, Norbert Schmitz, Karsten Berns
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

The demand for humanoid robots as service robots for everyday life has increased during the last years. The processing power of the hardware and the development of complex software applications allows the realization of "natural" human-robot interaction. One of the important topics of natural interaction is the detection of emotions which enables the robot to react appropriately to the emotional state of the communication partner. Humanoid robots designed for natural interaction require a short response time and a reliable detection. In this paper we introduce a emotion detection system realized with a combination of a haar-cascade classifier and a contrast filter. The detected feature points are then used to estimate the emotional state using the so called action units. Final experiments with the humanoid robot ROMAN show the performance of the proposed approach.
Subsequence Invariants
Authors: Klaus Dräger, Bernd Finkbeiner
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

We introduce subsequence invariants, which characterize the behavior of a concurrent system in terms of the occurrences of synchronization events. Unlike state invariants, which refer to the state variables of the system, subsequence invariants are defined over auxiliary counter variables that reflect how often the event sequences from a given set have occurred so far. A subsequence invariant is a linear constraint over the possible counter values. We allow every occurrence of a subsequence to be interleaved arbitrarily with other events. As a result, subsequence invariants are preserved when a given process is composed with additional processes. Subsequence invariants can therefore be computed individually for each process and then be used to reason about the full system. We present an efficient algorithm for the synthesis of subsequence invariants. Our construction can be applied incrementally to obtain a growing set of invariants given a growing set of event sequences.
DeSiNe: a flow-level QoS simulator of networks
Authors: T. Kleiberg, B. Fu, F. A. Kuipers, P. Van Mieghem, S. Avallone, B. Quoitin
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

In this paper we present DeSiNe, a modular flow-level network simulator. DeSiNe is aimed at performance analysis and benchmarking of Quality of Service routing algorithms and traffic engineering extensions. Several well-known QoS routing algorithms and traffic engineering extensions have been implemented in DeSiNe. The flow-level nature provides scalability, such that large networks and heavy-traffic conditions are possible. In this paper, the functional and structural design of DeSiNe are presented and the usability and various features are illustrated by means of several examples. The source code of DeSiNe is publicly available.
Investigation of technology-based entrepreneurship and issues with ICT innovation in Australia
Authors: Geoff Skinner
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

The paper details the findings of a recent research project in the realms of Information and Communication Technologies (ICT) and Innovation Management. The major issues considered by the project included: investigation of the possible inherent entrepreneurial nature of ICT; how to foster ICT innovation; and examination of the inherent difficulties currently found within the ICT industry of Australia in regards to supporting the development of innovative and creative ideas. The study was completed over a twelve month period with a focus on Internet technologies and their related innovators. The results of the research, included herein, have provided a number of unique contributions to the field in addition to a set of successful industry perspectives on ICT innovation. In particular how to manage and increase the opportunities for an entrepreneur in Australia to continue economic growth in the ICT sector.
Zippy Tabulations of Recursive Functions
Authors: Richard S. Bird
Venue: Proceedings of the 9th international conference on Mathematics of Program Construction (2008)

This paper is devoted to the statement and proof of a theorem showing how recursive definitions whose associated call graphs satisfy certain shape conditions can be converted systematically into efficient bottom-up tabulation schemes. The increase in efficiency can be dramatic, typically transforming an exponential time algorithm into one that takes only quadratic time. The proof of the theorem relies heavily on the theory of zips developed by Roland Backhouse and Paul Hoogendijk.
Logical Verification and Systematic Parametric Analysis in Train Control
Authors: André Platzer, Jan-David Quesel
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

We formally verify hybrid safety properties of cooperation protocols in a fully parametric version of the European Train Control System (ETCS). We present a formal model using hybrid programs and verify correctness using our logic-based decomposition procedure. This procedure supports free parameters and parameter discovery, which is required to determine correct design choices for free parameters of ETCS.
Research on the SPLL based single phase voltage sag detection technique
Authors: Xie Yue, Chen Le, Sun Jian, Gong Xu
Venue: Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems (2008)

The drop of voltage amplitude and the jump of phase angle are two important parameters of the voltage sag. The design of Dynamic Voltage Restorer (DVR) compensation voltage with voltage sag parameters is discussed and a single-phase sag parameter detection method based on synchronous d-q transformation is proposed in the paper. The transformation needed frequency or phase angle information of the fundamental voltage is provided by Soft Phase Locked Loop (SPLL). By analyzing the responses of SPLL when sag happens, it can be found that the phase synchronous method is suitable for the SPLL used in DVR. The simulation results verify the correctness of the analysis.
Towards Trustworthiness Establishment: A D-S Evidence Theory Based Scorer Reliability Tuned Method for Dishonest Feedback Filtering
Authors: Chunmei Gui, Quanyuan Wu, Huaimin Wang, Jian Qiang
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

Trust is an important character in next generation Internet. Entity's reputation aims at embodying trustworthy interaction information in history and constructing anticipation in future. Spurious reputation threatens to cause latent cheat and leakage in reputation mechanism, which is an exigent problem to be considered in wide distributed, dynamic domain. Based on D-S evidence theory, tuned by scorer reliability, the proposed approach evaluates entities' ratings on multi-facet and filters out dishonest feedbacks and malicious referrers. Importing self-adaptation mechanism, the status of reputation can be adaptively formed, updated, used and evolved in dynamic real-time environment. Compared with other methods, this approach accords with human filtering psychology naturally, is especially instructive in application.
Possibilities of Development in the Single-Pass Internal Cylindrical Grinding
Authors: Krzysztof Nadolny, Jaroslaw Plichta
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

The paper presents trends in the development in the single-pass internal cylindrical grinding worked out in the Department of Production Engineering, Koszalin University of Technology. The role of the computer modeling and simulation in creation of new abrasive tools using the grinding wheels of zoned diversified structure as an example was discussed. The techniques of introducing the artificial porosity into grinding wheels by doping the bubble corundum and by forming the micro-discontinuity on their active surface were presented. The concept for the structure of the intelligent tooling system designed for the single-pass internal cylindrical grinding was also proposed. It was assumed that this system could provide the flexible selection of individual grinding wheels, a dressing cutter, and also the grinding parameters and conditions for the specific technological operation.
Implementation of Recursive Queries for Information Systems
Authors: Kazem Taghva, Jayalakshmi Jeyaraman
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

In this paper, we give a detailed description of a bibliographic database, a set of recursive queries, an overview of some standard query processing algorithms, and an implementation of these queries in DATALOG.
Oblivious-Transfer Amplification
Authors: Jürg Wullschleger
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

Oblivious transfer (OT) is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately, OT cannot be achieved in an unconditionally secure way for both parties from scratch. Therefore, it is a natural question what information-theoretic primitives or computational assumptions OT can be based on.The results in our paper are threefold. First, we give an optimal proof for the standard protocol to realize unconditionally secure OT from a weak variant of OT called universal OT, for which a malicious receiver can virtually obtain any possible information he wants, as long as he does not get all the information. This result is based on a novel distributed leftover hash lemma which is of independent interest.Second, we give conditions for when OT can be obtained from a faulty variant of OT called weak OT, for which it can occur that any of the parties obtains too much information, or the result is incorrect. These bounds and protocols, which correct on previous results by Damgård et. al., are of central interest since in most known realizations of OT from weak primitives, such as noisy channels, a weak OT is constructed first.Finally, we carry over our results to the computational setting and show how a weak OT that is sometimes incorrect and is only mildly secure against computationally bounded adversaries can be strengthened.
Embedding Google Maps APIs into WebRatio for the Automatic Generation of Web GIS Applications
Authors: Giuseppe Avagliano, Sergio Martino, Filomena Ferrucci, Luca Paolino, Monica Sebillo, Genoveffa Tortora, Giuliana Vitiello
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

The success of WebML (Web Modeling Language) and of the supporting tool WebRatio for designing and generating data-intensive web applications suggested us to extend the approach to the Web GIS context. The proposal was based on Geo Server and Map Server, two standard, open solutions, to handle spatial data. In the present paper, we propose an alternative approach based on Google Maps, a freely available web mapping application provided by Google, which allows for the search and the visualization of geographic information. This solution is so diffuse that many Internet users are identifying it as a "standard" way for the presentation of geographical informa-tion. Moreover, Google Maps can be integrated into a Web application by exploiting Google Maps APIs. In the paper, we describe the proposed WebML-based visual language to design Web GIS applications and how it has been embedded into WebRatio to generate Web GIS applications by exploiting the potentialities of the Google Maps APIs. We also illustrate the architecture of the generated Web GIS applications together with the employed technologies and provide a sample example of design and generation of a Web GIS application.
Refactoring module structure
Authors: László Lövei, Csaba Hoch, Hanna Köllö, Tamás Nagy, Anikó Nagyné Víg, Dániel Horpácsi, Róbert Kitlei, Roland Király
Venue: Proceedings of the 7th ACM SIGPLAN workshop on ERLANG (2008)

This paper focuses on restructuring software written in Erlang. In large software projects, it is a common problem that internal structural complexity can grow to an extent where maintenance becomes impossible. This situation can be avoided by careful design, building loosely coupled components with strictly defined interfaces. However, when these design decisions are not made in the right time, it becomes necessary to split an already working software into such components, without breaking its functionality. There is strong industrial demand for such transformations in refactoring legacy code. A refactoring tool is very useful in the execution of such a restructuring. This paper shows that the semantical analysis required for refactoring is also useful for making suggestions on clustering. Existing analysis results are used to cover the whole process of module restructuring, starting with planning the new structure, and finishing by making the necessary source code transformations.
Framework for extracting rotation invariant features for image classification and an application using Haar wavelets
Authors: Santiago Akle, Maria-Elena Algorri, Marc Zimmermann
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

We propose a general framework for extracting rotation invariant features from images for the tasks of image analysis and classification. Our framework is inspired in the form of the Zernike set of orthogonal functions. It provides a way to use a set of one-dimensional functions to form an orthogonal set over the unit disk by non-linearly scaling its domain, and then associating it an exponential term. When the images are projected into the subspace created with the proposed framework, the rotations in the image affect only the exponential term while the value of the orthogonal functions serve as rotation invariant features. We exemplify our framework using the Haar wavelet functions to extract features from several thousand images of symbols. We then use the features in an OCR experiment to demonstrate the robustness of the method.
Incorporating Fault Tolerance into an Autonomic-Computing Environment
Authors: Yoshihiro Tohma
Venue: IEEE Distributed Systems Online (2004)

Centralized system management is becoming increasingly difficult and thus should inevitably rely on autonomic computing. However, how might we incorporate fault tolerance into the autonomic-computing environment?
Fast and accurate sequential floating forward feature selection with the Bayes classifier applied to speech emotion recognition
Authors: Dimitrios Ververidis, Constantine Kotropoulos
Venue: Signal Processing (2008)

This paper addresses subset feature selection performed by the sequential floating forward selection (SFFS). The criterion employed in SFFS is the correct classification rate of the Bayes classifier assuming that the features obey the multivariate Gaussian distribution. A theoretical analysis that models the number of correctly classified utterances as a hypergeometric random variable enables the derivation of an accurate estimate of the variance of the correct classification rate during cross-validation. By employing such variance estimate, we propose a fast SFFS variant. Experimental findings on Danish emotional speech (DES) and speech under simulated and actual stress (SUSAS) databases demonstrate that SFFS computational time is reduced by 50% and the correct classification rate for classifying speech into emotional states for the selected subset of features varies less than the correct classification rate found by the standard SFFS. Although the proposed SFFS variant is tested in the framework of speech emotion recognition, the theoretical results are valid for any classifier in the context of any wrapper algorithm.
Intranet Based Security Infrastructure for Manufacturing Grid
Authors: Niansheng Cheng, Yisheng Zhang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

In modern manufacturing grid, different security mechanisms of systems bring usage complexities and security risks. Single sign-on (SSO) can enhance the enterprise applications security and improve the overall efficiency. A security infrastructure is proposed by the token based authentication protocol in intranet. It is designed and developed on the technology of Java GSS-API, JAAS, Kerberos and SPNEGO. The key technologies such as analyzing SPNEGO token and integrating with application server are specially discussed. The application in a blanking processing factory verifies the practicability of the security service.
Local Grading of Learners
Authors: Sotiris Kotsiantis
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

We propose a technique of localized grading of weak classifiers. This technique identifies local regions having similar characteristics and then uses grading of weak classifiers to describe the relationship between the data characteristics and the target class. Our experiment for several UCI datasets shows that the proposed combining method outperforms other combining methods we tried as well as any base classifier.
Affect-Insensitive Speaker Recognition by Feature Variety Training
Authors: Dongdong Li, Yingchun Yang
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

A great deal of inner variabilities such as emotion and stress are largely missing from traditional speaker recognition system. The direct result is that the recognition system is easily disturbed when the enrollment and the authentication are made under different emotional state. Reynolds [1] proposed a new normalization technique called feature mapping. This technique achieved big successes in channel robust speaker verification. We extend the mapping idea to develop a feature variety training approach for affective-insensitive speaker recognition.
Weaknesses in BankID, a PKI-Substitute Deployed by Norwegian Banks
Authors: Kristian Gjøsteen
Venue: Proceedings of the 5th European PKI workshop on Public Key Infrastructure: Theory and Practice (2008)

BankID is a PKI-substitute widely deployed by Norwegian banks to provide digital signatures and identification on the internet. We have performed a reverse-engineering of part of the BankID system and analysed the security protocols and the implementation of certain cryptographic primitives. We have found cryptographic weaknesses that may indicate security problems, protocol flaws facilitating man-in-the-middle attacks, and implementation errors facilitating strong insider attacks. We also note that the system suffers from severe privacy problems.
Nurses' training and confidence on deep venous catheterization
Authors: A. P. Liachopoulou, E. E. Synodinou-Kamilou, P. G. Deligiannidi, M. Giannakopoulou, K. N. Birbas
Venue: Technology and Health Care (2008)

Aims: The rough estimation of the education and the self-confidence of nurses, both students and professionals, regarding deep venous catheterization in adult patients, the evaluation of the change in self-confidence of one team of students who were trained with a simulator on deep venous catheterization and the correlation of their self-confidence with their performance recorded by the simulator. Material and methods: Seventy-six nurses and one hundred twenty-four undergraduate students participated in the study. Fourty-four University students took part in a two-day educational seminar and were trained on subclavian and femoral vein paracentesis with a simulator and an anatomical model. Three questionnaires were filled in by the participants: one from nurses, one from students of Technological institutions, while the University students filled in the previous questionnaire before their attendance of the seminar, and another questionnaire after having attended it. Results/Discussion: Impressive results in improving the participants' self-confidence were recorded. However, the weak correlation of their self-confidence with the score automatically provided by the simulator after each user's training obligates us to be particularly cautious about the ability of the users to repeat the action successfully in a clinical environment. Conclusion: Educational courses and simulators are useful educational tools that are likely to shorten but in no case can efface the early phase of the learning curve in clinical setting, substituting the clinical training of inexperienced users.
Event Tracing and Visualization for Cell Broadband Engine Systems
Authors: Daniel Hackenberg, Holger Brunst, Wolfgang E. Nagel
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Event-based software tracing is a common technique for developing and optimizing parallel applications. It provides valuable information to application designers. This paper discusses software tracing on the Cell Broadband Engine, a heterogeneous multi-core processor, which is widely used in video game consoles, blade servers, and even supercomputer studies. However, the complex design of the Cell architecture poses challenging problems to developers. Our new monitoring approach improves this situation significantly as it visualizes Cell specific events on the SIMD cores that are usually hidden to programmers. We use the Vampir tool suite for visualization. Our design seamlessly integrates with the respective MPI monitor which additionally enables the tracking of large hybrid Cell/MPI applications.
Recognition and Optimization of Loop-Carried Stream Reusing of Scientific Computing Applications on the Stream Processor
Authors: Ying Zhang, Gen Li, Xuejun Yang
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Compared with other stream applications, scientific stream programs are usually constrained by memory access. Loop-carried stream reusing means reusing streams across different iterations and it can improve the locality of SRF greatly. In the paper, we present algorisms to recognize loop-carried stream reusing and give the steps to utilize the optimization after analyzing characteristics of scientific computing applications. Then we perform several representative microbenchmarks and scientific stream programs with and without our optimization on Isim. Simulation results show that stream programs optimized by loop-carried stream reusing can improve the performance of memory-bound scientific stream programs greatly.