ppxscal/embedding_network huggingface dataset:
A Conceptual Model for Guiding the Clustering Analysis
Authors: Wagner F. Castilho, Gentil J. Filho, Hércules A. Prado, Edilson Ferneda, Margarete Axt
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Knowledge discovery from databases, in the descriptive approach, includes clustering analysis (CA) as an alternative to estimate how a set of objects is organized in the space of their dimensions. The main objective in this task is to find "natural" groups that could exhibit some meaning. Considering the strong subjectivity that underlies this process, an important issue refers to the relationships among the CA players when looking for a model that could adjust the data. In this work, a model for actions coordination that provides an order to drive the relationships among CA players is presented. This model is presented as a conceptual contribution towards the construction of a computational environment to support effective conversations in a subjective context.
Formal methods: Importance, experience, and comparative analysis
Authors: Hazem El-Gendy, Nabil El-Kadhi
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

In this paper, we investigate the use of formal methods in the various phases of the life-cycle of developing communications protocols, software, and distributed systems. We identify important reasons and benefits for using formal methods. We also review formal methods for automating some of these phases and conduct practical cases of using these formal methods. We elaborate on the experience gained from using such formal methods. We present comparative analysis of these methods and approaches where we prove unsuitability of some of them. The investigations of the scope of applicability and applications of these methods are also presented here. We conclude by highlighting points for further research.
Credit Risk Evaluation Using Support Vector Machine with Mixture of Kernel
Authors: Liwei Wei, Jianping Li, Zhenyu Chen
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Recent studies have revealed that emerging modern machine learning techniques are advantageous to statistical models for credit risk evaluation, such as SVM. In this study, we discuss the applications of the support vector machine with mixture of kernel to design a credit evaluation system, which can discriminate good creditors from bad ones. Differing from the standard SVM, the SVM-MK uses the 1-norm based object function and adopts the convex combinations of single feature basic kernels. Only a linear programming problem needs to be resolved and it greatly reduces the computational costs. More important, it is a transparent model and the optimal feature subset can be obtained automatically. A real life credit dataset from a US commercial bank is used to demonstrate the good performance of the SVM-MK.
Hybrid Semantics for Stochastic π-Calculus
Authors: Luca Bortolussi, Alberto Policriti
Venue: Proceedings of the 3rd international conference on Algebraic Biology (2008)

We put forward a method to map stochastic &pi;-calculus processes in chemical ground form into hybrid automata, a class of dynamical systems with both discrete and continuous evolution. The key ingredient is the separation of control and molecular terms, which turns out to be related to the conservation properties of the system.
Musicians Outperform Nonmusicians in Speech Imitation
Authors: Barbara Pastuszek-Lipińska
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

Recently can be observed a growing interest in the effects of music on humans. Music has been called a food or a multi-sensory fitness of the brain. Many studies have already confirmed that practice and active involvement in music improve spatio-temporal functions, verbal memory, visuo-spatial abilities, reading, self-esteem, and generally cognitive processes. In the present paper, a general overview of research on the influence of music on humans has been provided. Moreover, it has been presented data on a research project, which was conducted with the aim to examine whether music education may be viewed as one of the factors, that improve second language acquisition.
Building Reusable Testing Assets for a Software Product Line
Authors: John D. McGregor
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

Testing consumes a significant percentage of the resources required to produce software intensive products. The exact impact on the project is often hard to evaluate because testing activities are distributed over the entire scope of the development effort. In this tutorial we take a comprehensive end-to-end view of the testing activities and roles that should be present in a software product line organization.
A hierarchical neuro-fuzzy system to near optimal-time trajectory planning of redundant manipulators
Authors: Amar Khoukhi, Luc Baron, Marek Balazinski, Kudret Demirli
Venue: Engineering Applications of Artificial Intelligence (2008)

In this paper, the problem of minimum-time trajectory planning is studied for a three degrees-of-freedom planar manipulator using a hierarchical hybrid neuro-fuzzy system. A first neuro-fuzzy network named NeFIK is considered to solve the inverse kinematics problem. After a few pre-processing steps characterizing the minimum-time trajectory and the corresponding torques, a second neuro-fuzzy controller is built. Its purpose is to fit the robot dynamic behavior corresponding to the determined minimum-time trajectory with respect to actuators models, torque nominal values, as well as position, velocity, acceleration and jerk boundary conditions. A Tsukamoto Neuro-Fuzzy Inference network is designed to achieve the online control of the robot. The premise parameters (antecedent membership functions parameters) as well as rule-consequence parameters are learned and optimized, generating the optimal-time trajectory torques, representing the robot dynamic behavior. Simulation results are presented and discussed.
Detecting Community Structure by Network Vectorization
Authors: Wei Ren, Guiying Yan, Guohui Lin, Caifeng Du, Xiaofeng Han
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

With the growing number of available social and biological networks, the problem of detecting network community structure is becoming more and more important which acts as the first step to analyze these data. In this paper, we transform network data so that each node is represented by a vector, our method can handle directed and weighted networks. it also can detect networks which contain communities with different sizes and degree sequences. This paper reveals that network community can be formulated as a cluster problem.
A constant-time dynamic storage allocator for real-time systems
Authors: Miguel Masmano, Ismael Ripoll, Patricia Balbastre, Alfons Crespo
Venue: Real-Time Systems (2008)

Dynamic memory allocation has been used for decades. However, it has seldom been used in real-time systems since the worst case of spatial and temporal requirements for allocation and deallocation operations is either unbounded or bounded but with a very large bound.In this paper, a new allocator called TLSF (Two Level Segregated Fit) is presented. TLSF is designed and implemented to accommodate real-time constraints. The proposed allocator exhibits time-bounded behaviour, O(1), and maintains a very good execution time. This paper describes in detail the data structures and functions provided by TLSF. We also compare TLSF with a representative set of allocators regarding their temporal cost and fragmentation.Although the paper is mainly focused on timing analysis, a brief study and comparative analysis of fragmentation incurred by the allocators has been also included in order to provide a global view of the behaviour of the allocators.The temporal and spatial results showed that TLSF is also a fast allocator and produces a fragmentation close to that caused by the best existing allocators.
Team Cooperation for Plan Recovery in Multi-agent Systems
Authors: Roberto Micalizio, Pietro Torasso
Venue: Proceedings of the 5th German conference on Multiagent System Technologies (2007)

The paper addresses the problem of recovering the execution of a multi-agent plan when the occurrence of unexpected events (e.g. faults) may cause the failure of some actions. In our scenario actions are executed concurrently by a group of agents organized in teams and each agent performs a local control loop on the progress of the sub-plan it is responsible for. When an agent detects an action failure, the agent itself tries to repair (if possible) its own sub-plan and if this local recovery fails, a more powerful recovery strategy at team level is invoked. Such a strategy is based on the cooperation of agents within the same team: the agent in trouble asks another teammate, properly selected, to cooperate for recovering from a particular action failure. The cooperation is aimed at achieving the goal assigned to the agents' team despite the action failure and to this end the agents exchange sub-goals and synthesize new plans.
Comparative Study of Several Phonotactic-Based Approaches to Spanish-Basque Language Identification
Authors: Víctor G. Guijarrubia, M. Inés Torres
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

This paper presents a series of language identification (LID) experiments for Spanish and Basque. Spanish and Basque are both official languages in the Basque Country, a region located in northern Spain. We focused our research on studying several phonotactic-based methodologies, comparing both the performance of phonotactic models trained from text and audio samples and the use of phone and phone-sequences as decoding units. The results show that whereas the use of audio-based phonotactic models performs better than the text ones, when using task-specific information it is also possible to achieve great accuracies. The use of phone sequences as decoding units appears to be useful when constraining the phone decoders to those sequences.
Adaptive θ-methods for pricing American options
Authors: Abdul Q. M. Khaliq, David A. Voss, Kamran Kazmi
Venue: Journal of Computational and Applied Mathematics (2008)

We develop adaptive @q-methods for solving the Black-Scholes PDE for American options. By adding a small, continuous term, the Black-Scholes PDE becomes an advection-diffusion-reaction equation on a fixed spatial domain. Standard implementation of @q-methods would require a Newton-type iterative procedure at each time step thereby increasing the computational complexity of the methods. Our linearly implicit approach avoids such complications. We establish a general framework under which @q-methods satisfy a discrete version of the positivity constraint characteristic of American options, and numerically demonstrate the sensitivity of the constraint. The positivity results are established for the single-asset and independent two-asset models. In addition, we have incorporated and analyzed an adaptive time-step control strategy to increase the computational efficiency. Numerical experiments are presented for one- and two-asset American options, using adaptive exponential splitting for two-asset problems. The approach is compared with an iterative solution of the two-asset problem in terms of computational efficiency.
Predictive Profile Control for a Hot Strip Mill
Authors: T. Mróz, G. Hearns, T. Bilkhu, K. J. Burnham, J. G. Linden
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

This paper discusses the control of the strip profile in a three stand hot strip mill. The demand for higher quality requires a control system with high accuracy and fast response. Inherent transport delays in this process motivates the design of the controller to have a predictive capability. Due to the physical limitations of the actuators the measurements of the strip profile are filtered to ensure the control actions will be feasible. The tuning and robustness of a predictive controller and a PID controller is demonstrated in the frequency domain. The interactions of the profile control with the other mill control systems are discussed. Other salient points of this method including easy installation in existing mills with appropriate actuators, without any modifications.
A Demonstrative Ad Hoc Attestation System
Authors: Endre Bangerter, Maksim Djackov, Ahmad-Reza Sadeghi
Venue: Proceedings of the 11th international conference on Information Security (2008)

Given the growing number and increasingly criminally motivated attacks on computing platforms, the ability to assert the integrity of platform becomes indispensable. The trusted computing community has come up with various remote attestation protocols that allow to assert the integrity of a remote platform over a network.A related problem is that of ad hoc attestation, where a user walks up to a computing platform and wants to find out whether that platform in front of her is in a trustworthy state or not. ad hoc attestation is considered to be an open problem, and some very recent publications have outlined a number of open challenges in this field. Major challenges are (i) the security against platform in the middle attacks (ii) viable choice of the device used to perform attestation, and (iii) the manageability of integrity measurements on that device.In this paper we describe a concrete implementation of an ad hoc attestation system that resolves these challenges. Most importantly, our system offers a novel and very intuitive user experience. In fact, from a user perspective, ad hoc attestation using our solution roughly consists of initiating the process on the target platform and then holding a security token to the screen of the target platform. The outcome of the ad hoc attestation (i.e., whether the platform is trustworthy or not) is then shown on the token's display. This usage paradigm, which we refer to as demonstrative ad hoc attestation, is based on a novel security token technology, which we have used. We believe that our system has the potential to be evolved into a system for real world usage.
A pattern language for extensible program representation
Authors: Daniel Vainsencher, Andrew P. Black
Venue: Proceedings of the 2006 conference on Pattern languages of programs (2006)

For the last 15 years, implementors of multiple view programming environments have sought a single code model that would form a suitable basis for all of the program analyses and tools that might be applied to the code. They have been unsuccessful. The consequences are a tendency to build monolithic, single-purpose tools, each of which implements its own specialized analyses and optimized representation. This restricts the availability of the analyses, and also limits the reusability of the representation by other tools. Unintegrated tools also produce inconsistent views, which reduce the value of multiple views. This paper describes a set of architectural patterns that allow a single, minimal representation of program code to be extended as required to support new tools and program analyses, while still maintaining a simple and uniform interface to program properties. The patterns address efficiency, correctness and the integration of multiple analyses and tools in a modular fashion.
A Multilingual Application for Automated Essay Scoring
Authors: Daniel Castro-Castro, Rocío Lannes-Losada, Montse Maritxalar, Ianire Niebla, Celia Pérez-Marqués, Nancy C. Álamo-Suárez, Aurora Pons-Porrata
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

In this paper, we present a text evaluation system for students to improve Basque or Spanish writing skills. The system uses Natural Language Processing techniques to evaluate essays by detecting specific measures. The application uses a client-server architecture and both the interface and the application itself are multilingual. The article also explains how the system can be adapted to evaluate Spanish essays written in Cuban schools.
Artificial Immune Recognition System with Nonlinear Resource Allocation Method and Application to Traditional Malay Music Genre Classification
Authors: Shahram Golzari, Shyamala Doraisamy, Md Nasir Sulaiman, Nur Izura Udzir, Noris Mohd. Norowi
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

Artificial Immune Recognition System (AIRS) has shown an effective performance on several machine learning problems. In this study, the resource allocation method of AIRS was changed with a nonlinear method. This new algorithm, AIRS with nonlinear resource allocation method, was used as a classifier in Traditional Malay Music (TMM) genre classification. Music genre classification has a great important role in music information retrieval systems nowadays. The proposed system consists of three stages: feature extraction, feature selection and finally using proposed algorithm as a classifier. Based on results of conducted experiments, the obtained classification accuracy of proposed system is 88.6 % using 10 fold cross validation for TMM genre classification. The results also show that AIRS with nonlinear allocation method obtains maximum classification accuracy for TMM genre classification.
Constructive Dimension and Weak Truth-Table Degrees
Authors: Laurent Bienvenu, David Doty, Frank Stephan
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. The main result is that every infinite sequence S with constructive Hausdorff dimension dimH(S) and constructive packing dimension dimP(S) is weak truth-table equivalent to a sequence R with ${\rm dim_H}({\it R}) \geq {\rm dim_H}(S) / {\rm dim_P}(S) - \epsilon$, for arbitrary &epsilon;> 0. Furthermore, if dimP(S) > 0, then dimP(R) &ge; 1 - &epsilon;. The reduction thus serves as a randomness extractor that increases the algorithmic randomness of S, as measured by constructive dimension. A number of applications of this result shed new light on the constructive dimensions of wtt degrees (and, by extension, Turing degrees). A lower bound of dimH(S) / dimP(S) is shown to hold for the wtt degree of any sequence S. A new proof is given of a previously-known zero-one law for the constructive packing dimension of wtt degrees. It is also shown that, for any regular sequence S (that is, dimH(S) = dimP(S)) such that dimH(S) > 0, the wtt degree of S has constructive Hausdorff and packing dimension equal to 1. Finally, it is shown that no single Turing reduction can be a universal constructive Hausdorff dimension extractor.
Experiences with Functional Programming in an Introductory Curriculum
Authors: Michael R. Hansen, Jens Thyge Kristensen
Venue: Reflections on the Teaching of Programming: Methods and Implementations (2008)

We present the rationale behind a first semester course on functional programming. We describe the design of the course, emphasizing programming as a modelling discipline, as well as the curriculum it was a part of. In particular, we discuss our experiences concerning the transition from functional programming to object-oriented programming. We also discuss and compare this functional-first approach to the objects-first approach of our recently introduced curriculum.
Connecting ABT with Arc Consistency
Authors: Ismel Brito, Pedro Meseguer
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogoods has an empty left-hand side, the considered value is eliminated unconditionally, once and for all. This value deletion can be propagated using standard arc consistency techniques, producing new deletions in the domains of other variables. This causes substantial reductions in the search effort required to solve a class of problems. We also extend this idea to the propagation of conditional deletions, something already proposed in the past. We provide experimental results that show the benefits of the proposed approach, especially considering communication cost.
Symmetric and Synchronous Communication in Peer-to-Peer Networks
Authors: Andreas Witzel
Venue: Proceedings of the 9th international conference on Mathematics of Program Construction (2008)

Motivated by distributed implementations of game-theoretical algorithms, we study symmetric process systems and the problem of attaining common knowledge between processes. We formalize our setting by defining a notion of peer-to-peer networks and appropriate symmetry concepts in the context of Communicating Sequential Processes (CSP) [1]. We then prove that CSP with input and output guards makes common knowledge in symmetric peer-to-peer networks possible, but not the restricted version which disallows output statements in guards and is commonly implemented. Our results extend [2].An extended version is available at http://arxiv.org/abs/0710.2284 .
Editorial: Special issue on foundations, advanced topics and industrial perspectives of multi-agent systems
Authors: Peter Mcburney, Andrea Omicini
Venue: Autonomous Agents and Multi-Agent Systems (2008)

This paper introduces the Special Issue of the Journal of Autonomous Agents and Multi-Agent Systems on Foundations, Advanced Topics and Industrial Perspectives of Multi-Agent Systems. This special issue collects four articles dealing with some of the main issues that arose during the three Technical Forum Group meetings held in 2004 and 2005, which were organised and sponsored by the European FP6 Coordination Action AgentLink III.
An Effectiveness Study of Pictogram Elements for Steps in Manufacturing Procedures
Authors: Atsuko K. Yamazaki, Kenji Goto, Hirokazu Taki, Satoshi Hori
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

In this study, the authors investigated the effectiveness of pictograms for steps in manufacturing procedures. Pictograms for manufacturing steps, such as "cut", "push" and "measure," were designed for the study. Their effectiveness was examined by means of both questionnaires and a comprehension experiment related to the subjects' response actions to the pictograms. The questionnaires were presented to 72 Japanese and 40 Portuguese-speaking subjects. The comprehension experiment was conducted with a different group of 69 Japanese subjects. Results from the questionnaires and the experiment suggest that the meaning of a pictogram containing an object can be comprehended better than one without an object. In particular, the pictograms for procedures performed by a body part, such as pushing by a finger and stepping by a foot, induced erroneous responses when they were presented without an object. On the other hand, the pictograms for procedures using a tool, such as cutting with scissors and measuring with a scale, tended to be comprehended more correctly and spontaneously than the procedural pictograms containing body parts.