ppxscal/embedding_network huggingface dataset:
A Framework for Data Structure-Guided Extraction of XML Association Rules
Authors: Juryon Paik, Junghyun Nam, Seungcheol Lee, Ung Mo Kim
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Because of the widespread interest and use of semi-structured data in XML format, the discovery of useful information from them is currently one of the main research topics on association rule extraction. Several encouraging approaches to developing methods for mining rules from XML data have been proposed. However, efficiency and simplicity are still barriers for further development due to the combinatorial explosion in the number of tree nodes. What is needed is a clear and simple methodology for extracting the knowledge that is hidden in the heterogeneous tree data. In this paper, we show that association rules can be unveiled and provided from any XML documents using a special data structure, called Simple and Effective Lists Structure (SELS), avoiding the computationally intractable problem in the number of nodes. SELS is flexible and powerful enough to represent both simple and complex structured association relationships in XML data.
A Unifying Framework for Building Social Computing Applications
Authors: Renato A. Capuruço, Luiz F. Capretz
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

There have been a number of frameworks and models developed to support different aspects of social computing. Some were developed to deal with online interaction through the application of computer-mediated communications tools, whereas others such as social network analyses and reputation systems were more specific in their focus. While these methodologies are inter-related, current social computing research has dealt with them as separate aspects. This paper presents a comprehensive framework for social computing that aims at integrating all these three aspects into a unified model so that discovery and exploration of community members are not only made possible, but also optimized. The novelty of the proposed approach stems from: (1) integration of social interaction, social network analysis and social reputation domains; (2) incorporating many flexible and practical features such as individual- and group-level perceptions of trust in social relations for different social contexts; and (3) using path-related algorithms for selection and discovery of target community members. A description of the proposed model and its implementation are presented. This research is expected to assist online community members to make decisions that facilitate the discovery of people and their connections while promoting increased awareness of community structure and information exposure.
Parallel Actions and Generalized Multivalued Constraints in Multivalued Planning
Authors: M. Baioletti, A. Milani, V. Poggioni, S. Suriani
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

In this work an extension of the model for planning with multivalued fluents and graded actions introduced in [8] is proposed. This model is based on the infinity---valued Lukasiewicz logic, where the fluents can assume truth values in the interval [0,1] and actions can be executed at different application degrees also varying in [0,1]. Multivalued fluents and graded actions allow to model many real situations where some features of the world are fuzzy and where actions can be executed with varying strength. The main contributions of this paper are given by the introduction of the simultaneous executability of the graded actions and the extension of multivalued constraints to generalized multivalued constraints. An extension of the correct/complete algorithm which solves bounded multivalued planning problems is presented. It allows to solve problems with generalized constraints and simultaneous actions.
${\cal T}\! {\cal H} {\cal O} {\cal T}\! {\cal L}$: A Timed Extension of ${\cal H} {\cal O} {\cal T}\! {\cal L}$
Authors: Mercedes G. Merayo, Manuel Núñez, Ismael Rodríguez
Venue: Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop (2008)

${\cal T}\! {\cal H} {\cal O} {\cal T}\! {\cal L}$ represents a conservative extension of ${\cal H} {\cal O} {\cal T}\! {\cal L}$ (Hypotheses and Observations Testing Logic) to deal with systems where time plays a fundamental role. We adapt some of the ${\cal H} {\cal O} {\cal T}\! {\cal L}$ rules to cope with the new framework. In addition, we introduce several specific hypotheses and rules to appropriately express time assumptions. We provide a correctness result of ${\cal T}\! {\cal H} {\cal O} {\cal T}\! {\cal L}$ with respect to a general notion of timed conformance.
Stability of Real-Time Abstract State Machines under Desynchronization
Authors: Joelle Cohen, Anatol Slissenko
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

In our paper TR-LACL-2008---02 (www.univ-paris12.fr/lacl/) we give sufficient conditions that permit to implement a real-time ASM with instantaneous actions (IA-ASM) by an ASM with delayed actions (DA-ASM) with approximate bisimulation of runs. The time is continuous and time constraints are linear inequalities with rational coefficients. As IA-ASM we consider ASM whose programs are blocks of if guard then blockOfUpdates. The implementation is an ASM of more general type. It works by 2 phases: backup phase memorizes the values of functions, and update phase makes the updates using the backed up values. Such an implementation implies shifts of time instants and, consequently, of the values of the real-valued functions. The approximation of runs (and, thus approximate bisimulation) is determined by 2 positive parameters , where bounds time shifts, and bounds the deviations of real-valued functions. We introduce a notion of -sturdy IA-ASM, and prove that the implementation of any such IA-ASM gives an DA-ASM with -approximately bisimular runs if the delay satisfies some constraints. An interesting point is that the sources of desynchronization that destroy the bisimulation are much more subtle and numerous than one can think a priori. Another conceptual consequence concerns the adequacy of the notion of IA-ASM that was introduced in Gurevich---Huggins (LNCS, vol. 1092, 1996), and later studied in Beauquier---Slissenko, (APAL, 113(1---3):13---52, 2002) for the specification of real-time system.
Into Digital Computing through the Back Door
Authors: Sherman N. Mullin
Venue: IEEE Annals of the History of Computing (2003)

From a hazy dream of writing a great American novel to heading up the renowned Lockheed Skunk Works, Sherman Mullin explains how he came to be an engineer-in digital computing, moreover, when the rest of the world was still mostly analog. Like most people who entered the digital computing field in the 1950s, he had no formal education in this technology. Like others, he learned mostly by doing. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Personalizing Patient Education Using Internet Health Resources and EPR Data: Pilot Evaluation of the STEPPS Prototype System
Authors: Persephone Doupi, Mark A. van Wijk, Jacobus T. van Wyk, Johan van der Lei
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

A core problem for health information seekers is locating relevant information among the vast amount of online content. Personalization has been suggested as a solution to effective Web information retrieval and also explored in the healthcare context, but then primarily with paper-based or locally available material. In this paper we report on the evaluation of a prototype system, STEPPS, which utilizes electronic patient record data to personalize the retrieval of health information from a variety of online resources, for the purposes of patient education. In a blinded clinician assessment of Web pages retrieved for 27 individual profiles of patients hospitalized in Dutch burn care units, STEPPS performed significantly better than random selection of material.
Computer Simulation and Word-Updating Dynamical Systems (WDS) on Digraphs
Authors: Deqiang Chen, Jie Zheng, Xiaoqian Wu
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Discrete dynamical systems based on dependency digraphs play an important role in the mathematical theory of computer simulation. In this paper, we are concerned with word-updating dynamical systems (WDS) on digraphs, which is a generalization of sequential dynamical systems (SDS) on graphs defined by Barrett et al. By defining an equivalence relation, we obtain the number of different WDS for the given dependency digraph and local functions. It is shown that WDS with the NOR function are closely related to combinatorial properties of the dependency digraphs.
A Distributed Intrusion Detection Scheme for Wireless Sensor Networks
Authors: Guorui Li, Jingsha He, Yingfang Fu
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Many mission critical wireless sensor networks require an efficient, lightweight and flexible intrusion detection algorithm to identify malicious attackers. In this paper, we propose a distributed group-based intrusion detection scheme that meets all the above requirements by partitioning the sensor networks into many groups in which the sensors in each group are physically close to each other and are equipped with the same sensing capability. Our intrusion detection algorithm takes into consideration of multiple attributes of the sensor nodes simultaneously to detect malicious attackers precisely. We show through experiments with real data that our algorithm can decrease the false alarm rate and increase the detection accuracy rate compared with existing intrusion detection schemes while lowering the power consumption.
Agents for Searching Rules in Civil Engineering Data Mining
Authors: Janusz Kasperkiewicz, Maria Marks
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

The software agents are applied for a remote search of information. It seems natural that to analyse such information machine learning routines should be built-in into an agent system. After finding and processing the data the generated rules will be evaluated by means of so called interestingness measures, and only the best rules should be returned to the user.The paper presents situation in civil engineering data processing, as a suggestion for designers of intelligent software tools, to work out difficult but much needed procedures that should be implemented into autonomous agent system, intended for retrieving special kind of information searched for example by materials technologists.A simple architecture for an agent system is suggested without, however, getting into any technical details on how the elements of such system should be constructed.
A Formal Analysis of Complex Type Flaw Attacks on Security Protocols
Authors: Han Gao, Chiara Bodei, Pierpaolo Degano
Venue: Proceedings of the 12th international conference on Algebraic Methodology and Software Technology (2008)

A simple type confusion attack occurs in a security protocol, when a principal interprets data of one type as data of another. These attacks can be successfully prevented by "tagging" types of each field of a message. Complex type confusions occur instead when tags can be confused with data and when fields or sub-segments of fields may be confused with concatenations of fields of other types. Capturing these kinds of confusions is not easy in a process calculus setting, where it is generally assumed that messages are correctly interpreted. In this paper, we model in the process calculus LySa only the misinterpretation due to the confusion of a concatenation of fields with a single field, by extending the notation of one-to-one variable binding to many-to-one binding. We further present a formal way of detecting these possible misinterpretations, based on a Control Flow Analysis for this version of the calculus. The analysis over-approximates all the possible behaviour of a protocol, including those effected by these type confusions. As an example, we considered the amended Needham-Schroeder symmetric protocol, where we succeed in detecting the type confusion that lead to a complex type flaw attacks it is subject to. Therefore, the analysis can capture potential type confusions of this kind on security protocols, besides other security properties such as confidentiality, freshness and message authentication.
A dual Gauss-Sedel Iteration method in calculation of cost tree of power project budget
Authors: Chen Yuchen, Cao Minnian, Liu Haisan
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

An important work of electric power budget is to calculate the costs and fees in power project, which has the data form of tree structure, or layered structure. In order to computer the cost trees quickly, flexibly and correctly, it is necessary to exchange and edit the tree structure dynamically. This paper presents a dual Gauss-Sedel method to deal with the dynamic change of cost trees. The model involves two kinds iteration, the inner iteration (c type iteration) is used to enumerate and calculate tree node throughout, the outer iteration (k type iteration) will ensure the calculation leads to convergence. Large amounts of practical budgets have shown that the method is in good operation and completely meet the needs of customer's requirements.
Individual differences in expressive response: a challenge for ECA design
Authors: Ning Wang, Stacy Marsella, Tim Hawkins
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

To create realistic and expressive virtual humans, we need to develop better models of the processes and dynamics of human emotions and expressions. A first step in this effort is to develop means to systematically induce and capture realistic expressions in real humans. We conducted a series of studies on human emotions and facial expression using the Emotion Evoking Game (EVG) and a high-speed video camera. In this paper, we discuss a detailed analysis of facial expressions in response to a surprise situation. We provide details on the rich dynamics of facial expressions, along with data useful for animation of virtual human. The analysis of the data also revealed considerable individual differences in whether surprise was evoked and how it was expressed.
Performance Bound for LDPC Coded Unitary Space---Time Modulation
Authors: Huy G. Vu, Ha H. Nguyen, David E. Dodds
Venue: Wireless Personal Communications: An International Journal (2008)

This paper is concerned with the bit error probability (BEP) of coded unitary space---time modulation systems based on finite-length low density parity check (LDPC) codes. The union bound on the BEP of the maximum likelihood (ML) decoding is derived for any code rate, unitary space---time constellation and mapping. The tightness of the bound is checked with simulation results of the ordered statistic decoding (OSD). Numerical and simulation results show that the union bound is also close to the error performance of the sum---product (SP) decoding at low BEP levels when Gray mapping is employed. The derived bound is useful to benchmark the error performance of finite-length coded unitary space---time modulation systems, especially for those that employ short-to-medium length LDPC codes.
Course Material Research Based on Perti Net
Authors: Kun Xiao, Shihong Chen, Xi Chen
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

Many designers pay much more attention to establish an e-learning system but ignore to judge what material is proper for courseware merger. This paper tries to realize it via the Petri net. The relationship between material and knowledge point (KP) is closely. So, in order to use the Petri net, it presents the relationships among KP as the net firstly. Based on the relationships among KP, It analyzes the relationships among material in detail and brings forth the material sets (MS) net. And then, it gives the formalization description of the material Petri net (MPN) based on the Petri net (PN) and provides the method of the transformation from the MS net graph to MPN. When material is merged into the courseware, some speciality of material can be checked by the MPN. The experiments shows that the MPN can validate the reasonableness of the material merger effectively.
A Minimal Set of Refactoring Rules for Object-Z
Authors: Tim Mccomb, Graeme Smith
Venue: Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems (2008)

This paper presents a minimal and complete set of structural refactoring rules for the Object-Z specification language that allow for the derivation of arbitrary object-oriented architectures. The rules are equivalence preserving and work in concert with existing class refinement theory, so that any design derived using the rule set can be shown to be equivalent to, or a refinement of, the original specification.
Strategy Description for Mobile Embedded Control Systems Exploiting the Multi-agent Technology
Authors: Vilém Srovnal, Bohumil Horák, Václav Snášel, Jan Martinovič, Pavel Krömer, Jan Platoš
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Mobile embedded systems are a part of standard applications of distributed system control in real time. An example of a mobile control system is the robotic system. The software part of a distributed control system is realized by decision making and executive agents. The algorithm of agents cooperation was proposed with the control agent on a higher level. The algorithms for agents realized in robots are the same. Real---time dynamic simple strategy description and strategy learning possibility based on game observation is important for discovering opponent's strategies and searching for tactical group movements, simulation and synthesis of suitable counter-strategies. For the improvement of game strategy, we are developing an abstract description of the game and propose ways to use this description (e.g. for learning rules and adapting team strategies to every single opponent).
Patterns of simple gene assembly in ciliates
Authors: Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz Rozenberg
Venue: Discrete Applied Mathematics (2008)

The intramolecular model for gene assembly in ciliates considers three operations, ld, hi, and dlad that can assemble any gene pattern through folding and recombination: the molecule is folded so that two occurrences of a pointer (short nucleotide sequence) get aligned and then the sequence is rearranged through recombination of pointers. In general, the sequence rearranged by one operation can be arbitrarily long and consist of many coding and noncoding blocks. We consider in this paper simple variants of the three operations, where only one coding block is rearranged at a time. We characterize in this paper the gene patterns that can be assembled through these variants. Our characterization is in terms of signed permutations and dependency graphs. Interestingly, we show that simple assemblies possess rather involved properties: a gene pattern may have both successful and unsuccessful assemblies and also more than one successful assembling strategy.
Just-in-Time Knowledge for Effective Hybrid Learning
Authors: Michel C. Desmarais
Venue: Proceedings of the 1st international conference on Hybrid Learning and Education (2008)

The means for Hybrid learning take on many forms. In this paper, we look at learning facilitators that can be embedded within the user interface. We argue that these means of learning can be even more effective than formal training. We describe different features of the user interface that can provide just-in-time knowledge that fosters learning: immersing the student into a rich environment where he can readily have access to the information for the task at hand.
TTY phone: direct, equal emergency access for the deaf
Authors: Zahoor Zafrulla, John Etherton, Thad Starner
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Seeking to enable direct and equal access for the Deaf to emergency call centers, we analyze the current state of the emergency phone system in the United States and elsewhere in the world. Leveraging teletypewriter (TTY) technology mandated by the Americans with Disabilities Act of 1990 to be installed in all emergency call centers in the United States, we developed software that emulates a TTY on a smart phone. We present an Instant Messaging style interface for mobile phones that uses the existing emergency infrastructure and allows Deaf users to communicate directly with emergency operators.
Boosting the Performance of Iterative Flattening Search
Authors: Angelo Oddi, Nicola Policella, Amedeo Cesta, Stephen F. Smith
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

Iterative Flattening search is a local search schema introduced for solving scheduling problems with a makespan minimization objective. It is an iterative two-step procedure, where on each cycle of the search a subset of ordering decisions on the critical path in the current solution are randomly retracted and then recomputed to produce a new solution. Since its introduction, other variations have been explored and shown to yield substantial performance improvement over the original formulation. In this spirit, we propose and experimentally evaluate further improvements to this basic local search schema. Specifically, we examine the utility of operating with a more flexible solution representation, and of integrating iterative-flattening search with a complementary tabu search procedure. We evaluate these extensions on large benchmark instances of the Multi-Capacity Job-Shop Scheduling Problem (mcjssp) which have been used in previous studies of iterative flattening search procedures.
FIDS: Monitoring Frequent Items over Distributed Data Streams
Authors: Robert Fuller, Mehmed Kantardzic
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

Many applications require the discovery of items which have occur frequently within multiple distributed data streams. Past solutions for this problem either require a high degree of error tolerance or can only provide results periodically. In this paper we introduce a new algorithm designed for continuously tracking frequent items over distributed data streams providing either exact or approximate answers. We tested the efficiency of our method using two real-world data sets. The results indicated significant reduction in communication cost when compared to naïve approaches and an existing efficient algorithm called Top-K Monitoring. Since our method does not rely upon approximations to reduce communication overhead and is explicitly designed for tracking frequent items, our method also shows increased quality in its tracking results.