ppxscal/embedding_network huggingface dataset:
Learning Regular Languages Using Nondeterministic Finite Automata
Authors: Pedro García, Manuel Vázquez Parga, Gloria I. Álvarez, José Ruiz
Venue: Proceedings of the 13th international conference on Implementation and Applications of Automata (2008)

A new general method for inference of regular languages using nondeterministic automata as output has recently been developed and proved to converge. The aim of this paper is to describe and analyze the behavior of two implementations of that method and to compare it with two well known algorithms for the same task. A complete set of experiments has been carried out and the results of the new algorithms improve the existing ones both in recognition rates as in sizes of the output automata.
A multi-radio 802.11 mesh network architecture
Authors: Krishna Ramachandran, Irfan Sheriff, Elizabeth M. Belding, Kevin C. Almeroth
Venue: Mobile Networks and Applications (2008)

The focus of this paper is to offer a practical multi-radio mesh network architecture that can realize the benefits of multiple radios. Our architecture provides solutions to challenges in three key areas. The first is the construction of a split wireless router that enables modular wireless mesh routers to be constructed from commodity hardware. The second is the design of a centralized channel assignment algorithm that considers the inter-dependence between channel assignment and routing in order to create high-throughput channel-diversified routes. Third is the design and implementation of several communication protocols that are necessary to make our architecture operational. Our system is comprehensively evaluated on a 20-node multi-radio wireless testbed. Results demonstrate that our architecture makes feasible the deployment of large-scale high-capacity multi-radio mesh networks built entirely with commodity hardware. Our implementation is available to the community for research and development purposes.
Synthetic Fault Diagnosis Method of Power Transformer Based on Rough Set Theory and Bayesian Network
Authors: Yongqiang Wang, Fangcheng Lu, Heming Li
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

Power transformer is very important in power system. In this paper, according to complementary strategy, a new transformer fault diagnosis method based on rough sets theory (RST) and Bayesian network (BN) is present. Through reduction approach of RST information table to simplify expert knowledge and to reduce fault symptoms, the minimal diagnostic rules can be mined. According to the minimal rules, complexity of BN structure and difficulties of fault symptom acquisition are largely decreased. At the same time, probability reasoning can be realized by BN, which can be used to describe changes of fault symptoms and analyze fault reasons of transformer. Finally, the correctness and effectiveness of this method are validated by the result of practical fault diagnosis examples.
Modeling the Acquisition of Fluent Skill in Educational Action Games
Authors: Ryan S. Baker, M. P. Habgood, Shaaron E. Ainsworth, Albert T. Corbett
Venue: Proceedings of the 11th international conference on User Modeling (2007)

There has been increasing interest in using games for education, but little investigation of how to model student learning within games [cf. 6]. We investigate how existing techniques for modeling the acquisition of fluent skill can be adapted to the context of an educational action game, Zombie Division. We discuss why this adaptation is necessarily different for educational action games than for other types of games, such as turn-based games. We demonstrate that gain in accuracy over time is straightforward to model using exponential learning curves, but that models of gain in speed over time must also take gameplay learning into account.
Model and Animate Plant Leaf Wilting
Authors: Shenglian Lu, Xinyu Guo, Chunjiang Zhao, Chengfeng Li
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

We describe a venation skeleton-driven method for modeling and animating plant wilting. The proposed approach uses a representation of a three-dimensional skeleton for a leaf blade. Firstly, the leaf skeleton is used to generate a detail mesh for the leaf surface, and a venation skeleton is also generated interactively from the leaf skeleton. Each vein in the venation skeleton consists of a segmented vertices string. Secondly each vertex in the leaf mesh is banded to the nearest vertex in the venation skeleton. We then deform the venation skeleton by controlling the movement of each vertex in the venation skeleton by rotating it around a fixed vector. Finally the leaf mesh is mapped to the deformed venation skeleton, as such the deformation of the mesh follow the deformation of the venation skeleton. We apply our techniques to simulate wilting plant leaves resulted from biological response.
Emotional reading of medical texts using conversational agents
Authors: Gersende Georg, Catherine Pelachaud, Marc Cavazza
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

In this paper, we present a prototype that helps visualizing the relative importance of sentences extracted from medical texts using Embodied Conversational Agents (ECA). We propose to map rhetorical structures automatically recognized in the documents onto a set of communicative acts controlling the expression of an ECA. As a consequence, the ECA will dramatize a sentence to reflect its perceived importance and rhetorical strength (advice, requirement, open proposal, etc). This prototype is constituted of three sub-systems: i) G-DEE, a text analysis module ii) a mapping module which converts rhetorical structures produced by the text analysis module into communicative functions driving the ECA animation and iii) an ECA system. By bringing the text to life, this system could help their authors (in our application, expert physicians) to reflect on the potential impact of the writing style they have adopted. The use of ECA reintroduces an affective element which cannot easily be captured by other methods for analyzing document's style.
Knowledge and Information in Probabilistic Systems
Authors: Prakash Panangaden
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

Concurrency theory is in an exciting period of confusion. Confusion is always exciting because it heralds the coming of new ideas and deeper understanding. There are several ingredients in the cauldron: some new, some not so new. The old ingredients are process algebra, bisimulation and other equivalences and modal logics. The not-so-old ingredients are probability, mobility and real-time, and the new ingredients are knowledge, games and information theory.
A multi-level parallel simulation approach to electron transport in nano-scale transistors
Authors: Mathieu Luisier, Gerhard Klimeck
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

Physics-based simulation of electron transport in nanoelectronic devices requires the solution of thousands of highly complex equations to obtain the output characteristics of one single input voltage. The only way to obtain a complete set of bias points within a reasonable amount of time is the recourse to supercomputers offering several hundreds to thousands of cores. To profit from the rapidly increasing availability of such machines we have developed a state-of-the-art quantum mechanical transport simulator dedicated to nanodevices and working with four levels of parallelism. Using these four levels we demonstrate that an almost ideal scaling of the walltime up to 32768 processors with a parallel efficiency of 86% is reached in the simulation of realistically extended and gated field-effect transistors. Obtaining the current characteristics of these devices is reduced to some hundreds of seconds instead of days on a small cluster or months on a single CPU.
Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption
Authors: Toshinori Araki
Venue: Proceedings of the 3rd international conference on Information Theoretic Security (2008)

The model of (r-round, n-channel) message transmission scheme (MTS) was introduced by Dolev et al. [5]. In their model, there are n channels between a sender S and a receiver R, and they do not share any information like keys. S wants to send a message to R secretly and reliably in r-round. But, there is an adversary A who can observe and forge at most t information which sent through n-channels.In this paper, we propose almost secure (1-round, 3t+1 -channel) MTS. Proposed scheme has following two properties. (1) If sending message is large some degree, the communication bits for transmitting messages is much more efficient with comparing to the perfectly secure (1-round, 3t+1 -channel) MTS proposed by Dolev et.al [5]. (2) The running time of message decryption algorithm is polynomial in n.
SLR: Path-Sensitive Analysis through Infeasible-Path Detection and Syntactic Language Refinement
Authors: Gogul Balakrishnan, Sriram Sankaranarayanan, Franjo Ivančić, Ou Wei, Aarti Gupta
Venue: Proceedings of the 15th international symposium on Static Analysis (2008)

We present a technique for detecting semantically infeasible paths in programs using abstract interpretation. Our technique uses a sequence of path-insensitive forward and backward runs of an abstract interpreter to infer paths in the control flow graph that cannot be exercised in concrete executions of the program.We then present a syntactic language refinement (SLR) technique that automatically excludes semantically infeasible paths from a program during static analysis. SLR allows us to iteratively prove more properties. Specifically, our technique simulates the effect of a path-sensitive analysis by performing syntactic language refinement over an underlying path-insensitive static analyzer. Finally, we present experimental results to quantify the impact of our technique on an abstract interpreter for C programs.
Timed Traces and Strand Spaces
Authors: Robin Sharp, Michael R. Hansen
Venue: Proceedings of the 2nd international symposium on Computer Science in Russia: Theory and Applications (2007)

This paper presents an approach to the analysis of real-time properties of security protocols, based on the Strand Space formalism for describing the behaviour of the participants in the protocol. The approach is compared with a trace-based analysis introduced by Pilegaard et al. [14]. Interval Logic with durations is used to express and reason about temporal phenomena. Strand Spaces were chosen as the starting point for our approach, since the causalities between important events in protocols are revealed in an illustrative manner by this formalism. The advantage of the trace-based approach is that it supports inductive reasoning in connection with the analysis of untimed properties. Interval Logic is chosen as the real-time formalism, as timing requirements and timing properties of security protocols are often expressible as interval properties. As an example, the Kerberos authentication protocol, which is based on concepts like timestamps and lifetimes, and which requires freshness of certain messages, is analysed.
Bristlecone: A Language for Robust Software Systems
Authors: Brian Demsky, Alokika Dash
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

We present Bristlecone, a programming language for robust software systems. Bristlecone applications have two components: a high-level organization description that specifies how the application's conceptual operations interact, and a low-level operational description that specifies the sequence of instructions that comprise an individual conceptual operation. Bristlecone uses the high-level organization description to recover the software system from an error to a consistent state and to reason how to safely continue the software system's execution after the error.We have implemented a compiler and runtime for Bristlecone.We have evaluated this implementation on three benchmark applications: a web crawler, a web server, and a multi-room chat server. We developed both a Bristlecone version and a Java version of each benchmark application. We used injected failures to evaluate the robustness of each version of the application. We found that the Bristlecone versions of the benchmark applications more successfully survived the injected failures.
Coordination Protocol Composition Approach Using Metadata in Multi-agent Systems
Authors: Ryuichi Takahashi, Kenji Tei, Fuyuki Ishikawa, Shinichi Honiden, Yoshiaki Fukazawa
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

In e-Business, agents need to coordinate with each other. Coordination protocols that specify the defining orders of message passing are very important. The scale of e-Business grows with the advancement of technology, and the number of agents involved continues to increase. Specifying the coordination protocols for so many participating agents is a complex task. A coordination protocol composition approach reduces the complexity of specifying such a coordination protocol. It treats coordination protocols as individual parts and composes them to construct the intended protocols. However, existing approaches do not sufficiently reduce the complexity when a coordination protocol is composed several times, because too many configurations are required to specify a composition. A new approach is proposed that uses metadata to specify the compositions by specifying only one configuration.It can reduce the number of configurations when a coordination protocol is composed several times.
EcoDAQ: A Case Study of a Densely Distributed Real-Time System for High Data Rate Wireless Data Acquisition
Authors: Chong-Jing Chen, Pai H. Chou
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

Densely distributed wireless real-time system must perform communication scheduling and protocols in addition to task scheduling to achieve schedulability and reliable communication. While many wireless sensor networks are densely distributed, they assume low duty cycling and trivial data packet rates, and they cannot handle many real-world applications. To highlight these design issues, this paper presents a case study with EcoDAQ, a wireless data acquisition system with 50 sensor nodes streaming real-time data over the same frequency channel. To achieve reliable communication, we define a pulling protocol that minimizes node complexity while guaranteeing collision freedom on a given frequency channel. Our case study illustrates the impact of communication requirements on the rest of the systems including bus and processing speeds. Experimental results show that our monitoring station can sustain gathering accelerometer data from up to 50 nodes in one square meter area at up to 15,000 samples per second with minimal latency and show very high expandability, flexibility and reliability.
Relationships between process, microstructure and properties of molded zirconia micro specimens
Authors: J. R&#x00f6;gner, B. Okolo, S. Kurzenh&#x00e4;user, M. M&#x00fc;ller, W. Bauer, H.-J. Ritzhaupt-Kleissl, E. Kerscher, V. Schulze
Venue: Microsystem Technologies (2008)

Due to size effects the mechanical behavior of micro-components with dimensions in the range of some 100&#x00a0;&#x03bc;m and structure details of about 10&#x00a0;&#x03bc;m differs markedly from those of larger components. This is a crucial aspect for the design of micro-components for applications where demands for high strength are critical. The present study, which was performed in the frame of the Collaborative Research Centre 499 (SFB 499), approaches this issue by investigating the relationship between production process, microstructure and the mechanical properties of micro-specimens made from zirconia using two different feedstocks. The specimens were produced by a sintering process. The sintering temperature was varied between 1,300 and 1,500&#x00b0;C. Mechanical and tribological behavior of the specimens was determined by three-point bending tests as well as static and sliding friction tests, respectively. Properties derived from these tests were then correlated to the surface states in the specimens such as porosity, edge radius and roughness. The strength of the micro-specimens was found to be significantly influenced by these surface features. Whilst low porosity alone is not sufficient for high strength, notch effects resulting from pores as well as surface roughness can lower the strength. With increasing edge radius the strength of the material also increases. The porosity, edge radius and surface roughness were mathematically correlated with the strength to allow for a forecast. Within the SFB 499 feedstocks with specific properties were designed and reliable processes were developed to guarantee desirable surface roughness and porosity in the specimens. A characteristic bending strength of about 2,000&#x00a0;MPa is realizable in the micro-specimens within a good statistical reliability. The tribological tests revealed that the wear properties of the zirconia micro-components are strongly dependent on the quality of the feedstock.
VIPER, a Student-Friendly Visual Interpreter of Pascal
Authors: Michał Adamaszek, Piotr Chrząstowski-Wachtel, Anna Niewiarowska
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

We introduce VIPER, a visual interpreter of Pascal, designed to help both the teachers and the students of an introductory programming course. The main innovation of VIPER is the ability to display typically encountered data structures (e.g. trees, lists) in an intuitive way. This, and other usability improvements, have been designed specifically to meet the needs of future users. The interpreter is aimed mostly at small scale programming exercises, and lets the user edit and run portions of code step-by-step with all the needed values being displayed in a suitable manner.
In-situ modeling on sensing coverage and location proof
Authors: Yongdae Kim, Tian He
Venue:  (2008)

Recent development of technology in wireless network is not only limited to communication, but also covers other diverse areas. As a next generation of wireless network, wireless sensor network contributes to human comforts by providing services such as event monitoring. As another emerging technique, localization provides infrastructure for various services. While the research on those areas shows the usefulness of emerging applications, the evaluation under real environment and the potential problem in practice is often overlooked. In this dissertation, we study the limitation in these two areas, coverage problem and localization, when they are used only with their basic functionalities. In coverage problem, we study the irregularity of sensing coverage in realistic environment and its impact on sensing coverage related application. Specifically, we design and implement two Sensing Area Modeling (SAM) techniques useful in the real world. P-SAM provides accurate sensing area models for individual nodes using controlled events, while V-SAM provides continuous sensing similarity models using natural events in an environment. Evaluation results reveal several serious issues concerning circular models, and demonstrate significant improvements in coverage scheduling when SAM is used. The location information plays an important role in various applications. However, if malicious attackers distort the coordinate system severely, the performance of these applications could degrade significantly. We consider two issues related to the compromise of location information, the secure localization, and the location-based access. In the secure localization, we propose a secure localization mechanism that detects the existence of phantom nodes, without relying on any trusted entities. In the location-based access control, we present the first protocol that enables location verification in presence of colluding attack. The evaluation shows the proposed protocols are robust against various attacks.
Eigenfunctions of the 2D finite Fourier transform
Authors: B. Larsson, T. Levitina, E. J. Brändas
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

A new powerful approach to compute the eigenfunctions of the finite two-dimensional Fourier transform is developed and analysed. The numerical technique is a generalization of an earlier method developed for ordinary prolate spheroidal wave functions. Special considerations are given to the problem of singularities and the procedure to locate the eigenvalues. It is demonstrated that the computations are fundamentally improved by the introduction of appropriate auxiliary differential equations.
ECDSA-Verifiable Signcryption Scheme with Signature Verification on the Signcrypted Message
Authors: Raylin Tso, Takeshi Okamoto, Eiji Okamoto
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

In this paper, we propose a signcryption scheme which provides all the following properties at the same time. (1) forward security: the private key of a sender does not help any attack to break the confidentiality of any signcrypted message generated by the sender. (2) signature verification on the signcrypted message: this is done without revealing the original message. (3) a standardized signature mechanism: in our scheme, both the non-repudiation of the message and the signcrypted message can be done using the standardized digital signature algorithm; ECDSA. The efficiency and features of our scheme are compared with other schemes and the security is proved in the random oracle model.
Instability of Surfactant Solution Flow in a Taylor Cell
Authors: K. Watanabe, T. Takayama, S. Ogata
Venue: Journal of Visualization (2004)

The hydrodynamic instability of surfactant solutions between two coaxial cylinders was investigated by using a laser-induced-fluorescence flow visualization technique to clarify the effect of drag-reducing additives on vortex formation in Taylor-Couette flow. The test fluids were Ethoquad O/12 surfactant solutions, which have a gel-like structure called "shear-induced structure" (SIS). Photographs of the formation of G&ouml;rtler vortices were taken and compared with these of tap water. In the Taylor number range of 1.2 &times; 10$^5$ &les; T$_a$ &les; 7.1&times;10$^5$, tap water and 10 ppm surfactant solution flows consisted of Taylor vortices and much smaller G&ouml;rtler vortices at the rotating inner wall. However, for 50 and 100 ppm surfactant solutions, Taylor vortices were not apparent and G&ouml;rtler vortices were collapsed. Measurements of the wavelength of G&ouml;rtler vortices lead to the conclusion that surfactant solutions have a stabilizing effect on G&ouml;rtler instabilities. This effect depends on surfactant concentration and becomes considerable with increasing acceleration of the inner cylinder.