ppxscal/embedding_network huggingface dataset:
Supporting the Guide on the SIDE
Authors: Moonyoung Kang, Sourish Chaudhuri, Rohit Kumar, Yi-Chia Wang, Eric R. Rosé, Carolyn P. Rosé, Yue Cui
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

We present SIDE (the Summarization Integrated Development Environment), which is an infrastructure that facilitates the construction of reporting interfaces that support group learning facilitators in the task of getting a quick sense of the quality and effectiveness of a collaborative learning interaction. The SIDE framework offers flexibility in the specification of which conversational behavior to take note of as well as how noted behavior should be reported to instructors, making it a valuable research tool.
Internet comunication in real time systems
Authors: Ionut Resceanu, Marius Niculescu, Cristina Pana
Venue: Proceedings of the 6th WSEAS International Conference on Applied Electromagnetics, Wireless and Optical (2008)

There is a growing need for humans to perform complex remote operations and to extend the intelligence and experience of experts to distant applications. A blending of human intelligence, modern information technology, remote control, and intelligent autonomous systems is required. Traditionally, TCP has been considered unfriendly for real-time applications. The conventional wisdom is that TCP may be inappropriate for such applications because its congestion controlled reliable delivery may lead to excessive end-to-end delays that violate the real-time requirements of these applications. This has led to the design of alternative UDP-based transport protocols that favor timely data delivery over reliability while still providing mechanisms for congestion control. A new approach for solving one of the fundamental problems facing teleoperation and real time systems is discussed: the need to overcome time delays due to telemetry and signal propagation.
A mapping study on empirical evidence related to the models and forms used in the uml
Authors: Rialette Pretorius, David Budgen
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Context: Although the Unified Modeling Language (UML) is now widely used, there is little empirical knowledge about the effectiveness of its different elements. Objectives: To conduct a systematic review of the literature describing empirical studies of this paradigm. Method: We undertook a Mapping Study of the literature, based upon electronic searching of major digital libraries. Results: 33 papers have been identified and classified by topic, form of study involved, and type of publication. Conclusions: The largest group of empirical studies of the UML concentrate on comprehension, and many key aspects have hardly been investigated at all.
Combining Multi Wavelet and Multi NN for Power Systems Load Forecasting
Authors: Zhigang Liu, Qi Wang, Yajun Zhang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

In the paper, two pre-processing methods for load forecast sampling data including multiwavelet transformation and chaotic time series are introduced. In addition, multi neural network for load forecast including BP artificial neural network, RBF neural network and wavelet neural network are introduced, too. Then, a combination load forecasting model for power load based on chaotic time series, multiwavelet transformation and multi-neural networks is proposed and discussed in the paper. Firstly, the training sample is extracted from power load data through chaotic time series and multiwavelet decomposition. Then the obtained data is trained through BP network, RBF network and wavelet neural network. Lastly, the trained data from three neural networks are input a three-layer feedforward neural network based the variable weight combination load forecasting model. Simulation results show that accuracy of the combination load forecasting model proposed in the paper is higher than any one sole network model and the combination forecast model of three neural networks.
A Virtual Therapist That Responds Empathically to Your Answers
Authors: Matthijs Pontier, Ghazanfar F. Siddiqui
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

Previous research indicates that self-help therapy is an effective method to prevent and treat unipolar depression. While web-based self-help therapy has many advantages, there are also disadvantages to self-help therapy, such as that it misses the possibility to regard the body language of the user, and the lack of personal feedback on the user responses. This study presents a virtual agent that guides the user through the Beck Depression Inventory (BDI) questionnaire, which is used to measure the severity of depression. The agent responds empathically to the answers given by the user, by changing its facial expression. This resembles face to face therapy more than existing web-based self-help therapies. A pilot experiment indicates that the virtual agent has added value for this application.
A novel algorithm for fast retrival of information from a multiprocessor server
Authors: Abdus Samad, M. Q. Rafiq, Omar Farooq
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

The popular resources in the internet are located in multiple servers that can be downloaded in parallel by a number of internet file downloading applications. In this paper an overview of a six nodes multiprocessor server, Linearly Extensible Cube (LEC), has been carried out to achieve both load balancing and downloading information efficiently. The dynamic scheduling algorithm to balance the load of multiprocessor is implemented. The database on the server is organized in such a way that a fast retrieval of information can be achieved. A new proposed algorithm is implemented on the server which uses store and forward like technique. A comparative simulation study has been carried out and the average time to download a file is computed. The simulation results show that the given multiprocessor architecture, when implemented as a server with the proposed algorithm reduces the resource download time.
Fuzzy rule generation for adaptive scheduling in a dynamic manufacturing environment
Authors: Key K. Lee
Venue: Applied Soft Computing (2008)

This paper proposes a fuzzy rule-based system for an adaptive scheduling, which dynamically selects and applies the most suitable strategy according to the current state of the scheduling environment. The adaptive scheduling problem is generally considered as a classification task since the performance of the adaptive scheduling system depends on the effectiveness of the mapping knowledge between system states and the best rules for the states. A rule base for this mapping is built and evolved by the proposed fuzzy dynamic learning classifier based on the training data cumulated by a simulation method. Distributed fuzzy sets approach, which uses multiple fuzzy numbers simultaneously, is adopted to recognize the system states. The developed fuzzy rules may readily be interpreted, adopted and, when necessary, modified by human experts. An application of the proposed method to a job-dispatching problem in a hypothetical flexible manufacturing system (FMS) shows that the method can develop more effective and robust rules than the traditional job-dispatching rules and a neural network approach.
An Individualized Web-Based Algebra Tutor Based on Dynamic Deep Model Tracing
Authors: Dimitrios Sklavakis, Ioannis Refanidis
Venue: Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications (2008)

This paper describes the motivations and goals of the MATHESIS project which concerns the development of an intelligent authoring environment for cognitive math tutors. It also describes the first implemented component of the project, the MATHESIS algebra tutor, a cognitive web-based tutor for algebraic expressions' expanding and factoring. The tutor uses cognitive model tracing by dynamically generating the plausible steps, checking them against student's solution steps and intervening when errors occur. Additionally, the tutor monitors the student's mastery of knowledge from problem to problem, i.e. the various cognitive skills. The tutor will be used as a prototype for the development of an ontology that will contain all of the tutor's knowledge. This ontology will eventually guide the creation of the authoring tools that will make faster and easier the creation of other cognitive tutors.
Adaptive Navigation Support, Learner Control and Open Learner Models
Authors: Susan Bull, Norasnita Ahmad, Matthew Johnson, Rasyidi Johan, Andrew Mabbott, Alice Kerly
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

We consider open learner models (OLM) with reference to adaptive navigation support and learner control. Our purpose is to assess the potential of a greater range of OLMs in adaptive educational hypermedia. We introduce five OLMs, discuss how these might be applied, and present learner reactions.
Stochastic COWS
Authors: Davide Prandi, Paola Quaglia
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

A stochastic extension of COWS is presented. First the formalism is given an operational semantics leading to finitely branching transition systems. Then its syntax and semantics are enriched along the lines of Markovian extensions of process calculi. This allows addressing quantitative reasoning about the behaviour of the specified web services. For instance, a simple case study shows that services can be analyzed using the PRISM probabilistic model checker.
From Conceptual Structures to Semantic Interoperability of Content
Authors: Pavlin Dobrev, Ognian Kalaydjiev, Galia Angelova
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

Smart applications behave intelligently because they understand at least partially the context where they operate. To do this, they need not only a formal domain model but also formal descriptions of the data they process and their own operational behaviour. Interoperability of smart applications is based on formalised definitions of all their data and processes. This paper studies the semantic interoperability of data in the case of eLearning and describes an experiment and its assessment. New content is imported into a knowledge-based learning environment without real updates of the original domain model, which is encoded as a knowledge base of conceptual graphs. A component called mediator enables the import by assigning dummy metadata annotations for the imported items. However, some functionality of the original system is lost, when processing the imported content, due to the lack of proper metadata annotation which cannot be associated fully automatically. So the paper presents an interoperability scenario when appropriate content items are viewed from the perspective of the original world and can be (partially) reused there.
A general scheme of extracting the optimum pattern nulls for monopulse array antennas with arbitrary sidelobe levels
Authors: Keum-Sook Ha, Eui-Joon Park
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

In this paper, a generalized Fourier transform pair is newly presented for the relationship between the patterns and the corresponding line source distribution functions in the monopulse tracking array antenna synthesis problem. This pair enables the desired patterns and the distributions to be simultaneously extracted by the optimum perturbation of pattern null positions. And the difference patterns with the individually specified sidelobe levels are optimally synthesized by appropriately updating the Taylor line source sum pattern formula. Furthermore the method can be extended to the synthesis of the discrete linear array antennas. The schemes for extracting the excitation current weights are also based on the perturbations of pattern nulls which are represented by the complex root locations on Schelkunoff's unit circle. Examples are given for both the sum and difference patterns with arbitrary sidelobe levels, showing the validity of the proposed method.
A Verified AsmL Implementation of Belief Revision
Authors: Christoph Beierle, Gabriele Kern-Isberner
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

Belief revision is a key functionality for any intelligent agent being able to perceive pieces of knowledge from its environment and to give back sentences she believes to be true with a certain degree of belief. We report on a refinement of a previous, abstract ASM specification of Condor, a system modeling such an agent, to a fully operational specification implemented in AsmL. The complete AsmL implementation of various belief revision operators is presented, demonstrating how using AsmL enabled a high-level implementation that minimizes the gap between the abstract specification of the underlying concepts and the executable code in the implemented system. Based on ASM refinement and verification concepts, a full mathematical correctness proof for different belief revision operators realized in Condor@AsmL is given.
Implementation of an Electronic Park Brake Feature with Limited Data Availability
Authors: K. Slósarczyk, J. G. Linden, K. J. Burnham, K. Cockings, R. Capolongo
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

Many automotive companies utilise an electronic park brake (EPB) system as a replacement for the conventional manual parking brake system. This allows to reduced driver workload and also supports automatic apply/realase features. This paper discusses a development of an EPB control model that comprises the high level functional software algorithms to control the operation of the remote EPB actuator. The objective is to improve and extend the existing system functionality employing feature enhancements via in-house development. The control strategy utilised in the model development involves implementation of the safety requirements, vehicle attribute estimation, driver presence detection, diagnostics and fault reaction strategy. The latter is presented in the context of a drive away release (DAR) function, an automatic release feature determined based upon detection of driver intention to drive. Necessary information is inferred from secondary available data as a development of the specific sensors is considered to be too expensive. These are required to be estimated/observed with increased precision to fulfil the safety requirements. The development of the EPB control strategy is realised via MathWorks Simulink and validated/refined in the experimental phase using hardware in the loop simulation and test (HILST) technique employing dSpace MicroAutoBox.
Confluently Persistent Tries for Efficient Version Control
Authors: Erik D. Demaine, Stefan Langerman, Eric Price
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

We consider a data-structural problem motivated by version control of a hierarchical directory structure in a system like Subversion. The model is that directories and files can be moved and copied between two arbitrary versions in addition to being added or removed in an arbitrary version. Equivalently, we wish to maintain a confluently persistent trie (where internal nodes represent directories, leaves represent files, and edge labels represent path names), subject to copying a subtree between two arbitrary versions, adding a new child to an existing node, and deleting an existing subtree in an arbitrary version.Our first data structure represents an n-node degree-Δ trie with O(1) "fingers" in each version while supporting finger movement (navigation) and modifications near the fingers (including subtree copy) in $O(\lg \Delta)$ time and space per operation. This data structure is essentially a locality-sensitive version of the standard practice--path copying--costing $O(d \lg \Delta)$ time and space for modification of a node at depth d, which is expensive when performing many deep but nearby updates. Our second data structure supporting finger movement in $O(\lg \Delta)$ time and no space, while modifications take $O(\lg n)$ time and space. This data structure is substantially faster for deep updates, i.e., unbalanced tries. Both of these data structures are functional, which is a stronger property than confluent persistence. Without this stronger property, we show how both data structures can be sped up to support movement in $O(\lg \lg \Delta)$, which is essentially optimal. Along the way, we present a general technique for global rebuilding of fully persistent data structures, which is nontrivial because amortization and persistence do not usually mix. In particular, this technique improves the best previous result for fully persistent arrays and obtains the first efficient fully persistent hash table.
About the Buildings' Danger Control Systems Vulnerabilities
Authors: Daniela E. Popescu, Marcela F. Prada
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

Analysis is an important security component, because it provides a systematic way to approach computer and communications security. There is no single context within which to address the subject. There are distinct environments, each of which appears in a different light and must be considered with some degree of independence. The present paper give a potential solution for reducing the vulnerabilities for danger control systems. A danger control system is designed for managing different building dangers and any specific building activity. So, the danger control systems are an essential prerequisite for the reliable and efficient functioning of the life-safety measures and security in a building. The present paper gives the fault and recovery tress for a potential solution that enhances the quality for danger control systems.
A Perspective on Program Verification
Authors: Willem-Paul Roever
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

A perspective on program verification is presented from the point of view of a university professor who has been active over a period of 35 years in the development of formal methods and their supporting tools. He has educated until now approx. 25 Ph.D. researchers in those fields and has written two handbooks in the field of program verification, one unifying known techniques for proving data refinement, and the other on compositional verification of concurrent and distributed programs, and communication-closed layers. This essay closes with formulating a grand challenge worthy of modern Europe.
On the Application of Model Reduction Techniques to Real-Time Simulation of Non-linear tissues
Authors: Siamak Niroomandi, Icíar Alfaro, Elías Cueto, Francisco Chinesta
Venue: Proceedings of the 4th international symposium on Biomedical Simulation (2008)

In this paper we introduce a new technique for the real-time simulation of non-linear tissue behavior based on a model reduction technique known as Proper Orthogonal (POD) or Karhunen-Loève Decompositions. The technique is based upon the construction of a complete model (using Finite Element modelling or other numerical technique, for instance, but possibly from experimental data) and the extraction and storage of the relevant information in order to construct a model with very few degrees of freedom, but that takes into account the highly non-linear response of most living tissues. We present its application to the simulation of palpation a human cornea and study the limitations and future needs of the proposed technique.
Emotion from Speakers to Listeners: Perception and Prosodic Characterization of Affective Speech
Authors: Catherine Mathon, Sophie Abreu
Venue: Speaker Classification II: Selected Projects (2007)

This article describes a project which aimes at reviewing perceptive works on emotion and prosodic description of affective speech. A study with a spontaneous French corpus, for which a corresponding acted version has been built, shows that native listeners perceive the difference between acted and spontaneous emotions. The results of cross-linguistic perceptual studies indicate that emotions are perceived by listeners partly on the basis of prosody only, proposing the universality of emotions like anger, and partly on the basis of the variability. The latter assumption is supported by the fact that the characterization of anger in degrees is different depending on the mother tongue of the listeners. Finally, a prosodic analysis of the emotional speech is presented, measuring F0 cues, duration parameters and intensity.
Care - Making the Affective Leap: More Than a Concerned Interest in a Learner's Cognitive Abilities
Authors: Bridget Cooper
Venue: International Journal of Artificial Intelligence in Education (2003)

This commentary addresses the issues of 'care' in intelligent learning systems more precisely, elaborating and extending the definition to include recent research from neuroscience and education on the affective aspects of learning. It reflects on the association of profound empathy with care and in what ways the systems described in this issue illustrate features of profound empathy. It concludes that though they all include some features of profound empathy they all lack an elaborate definition of 'care' which means their ability to reproduce it is limited and they tend to focus more heavily on the cognitive rather than the affective nature of care. However it concludes that there are exciting opportunities ahead in the field if we consider the affective nature of learning and care more seriously.
The Hosoya polynomial decomposition for catacondensed benzenoid graphs
Authors: Shoujun Xu, Heping Zhang
Venue: Discrete Applied Mathematics (2008)

For a graph G with the vertex set V(G), we denote by d(u,v) the distance between vertices u and v in G, by d(u) the degree of vertex u. The Hosoya polynomial of G is H(G)=@?"{"u","v"}"@?"V"("G")x^d^(^u^,^v^). The partial Hosoya polynomials of G are H"m"n(G)=@?"{"u","v"}"@?"V"("G")"d"("u")"="m","d"("v")"="nx^d^(^u^,^v^) for positive integer numbers m and n. It is shown that H(G"1)-H(G"2)=x^2(x+1)^2(H"3"3(G"1)-H"3"3(G"2)),H"2"2(G"1)-H"2"2(G"2)=(x^2+x-1)^2(H"3"3(G"1)-H"3"3(G"2)) and H"2"3(G"1)-H"2"3(G"2)=2(x^2+x-1)(H"3"3(G"1)-H"3"3(G"2)) for arbitrary catacondensed benzenoid graphs G"1 and G"2 with equal number of hexagons. As an application, we give an affine relationship between H(G) with two other distance-based polynomials constructed by Gutman [I. Gutman, Some relations between distance-based polynomials of trees, Bulletin de l'Academie Serbe des Sciences et des Arts (Cl. Math. Natur.) 131 (2005) 1-7].
Brief paper: Constrained linear system with disturbance: Convergence under disturbance feedback
Authors: Chen Wang, Chong-Jin Ong, Melvyn Sim
Venue: Automatica (Journal of IFAC) (2008)

This paper proposes a disturbance-based control parametrization under the Model Predictive Control framework for constrained linear discrete time systems with bounded additive disturbances. The proposed approach has the same feasible domain as that obtained from parametrization over the family of time-varying state feedback policies. In addition, the closed-loop system is stable in the sense that the state converges to a bounded set that has a characterization determined by a feedback gain.