ppxscal/embedding_network huggingface dataset:
An Analysis of the "11·13 Fire and Explosion Accident in Jilin Chemical Plant: The Environment Hazards Resulted by Disposal Measures against Chemical Product Accidents
Authors: Sining Chen
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Accidents of modern chemical industry may not infrequently transform into environmental disaster, causing a series of social and public health issues. Here the labored example as typical fire and explosion accident of chemical product, refers to the “11•13” accident taken place in Jilin Chemical Plant, as to give account to possible hazards the measures adopted as emergencies disposal might cast on the environment. Comprehensive considerations regarding environment, health and social public benefit should be taken into account in dealing with chemical product relevant accidents, so as to minimize the loss in the accident as practical by offering optimal disposal in relation to specific affected site condition during the whole process of disposition, while providing elaborate environmental protection for accident rescue to control the scope of accident as possible not developing to a environmental pollution event.
On the completeness of an identifiability algorithm for semi-Markovian models
Authors: Yimin Huang, Marco Valtorta
Venue: Annals of Mathematics and Artificial Intelligence (2008)

This paper addresses the problem of identifying causal effects from nonexperimental data in a causal Bayesian network, i.e., a directed acyclic graph that represents causal relationships. The identifiability question asks whether it is possible to compute the probability of some set of (effect) variables given intervention on another set of (intervention) variables, in the presence of non-observable (i.e., hidden or latent) variables. It is well known that the answer to the question depends on the structure of the causal Bayesian network, the set of observable variables, the set of effect variables, and the set of intervention variables. Sound algorithms for identifiability have been proposed, but no complete algorithm is known. We show that the identify algorithm that Tian and Pearl defined for semi-Markovian models (Tian and Pearl 2002, 2002, 2003), an important special case of causal Bayesian networks, is both sound and complete. We believe that this result will prove useful to solve the identifiability question for general causal Bayesian networks.
Abstract Interpretation from a Topological Perspective
Authors: David A. Schmidt
Venue: Proceedings of the 16th International Symposium on Static Analysis (2009)

We develop abstract interpretation from topological principles by relaxing the definitions of open set and continuity; key results still hold. We study families of closed and open sets and show they generate post- and pre-condition analyses, respectively. Giacobazzi's forwards- and backwards-complete functions are characterized by the topologically closed and continuous maps, respectively. Finally, we show that Smyth's upper and lower topologies for powersets induce the overapproximating and underapproximating transition functions used for abstract-model checking.
A Brief Overview of Agda --- A Functional Language with Dependent Types
Authors: Ana Bove, Peter Dybjer, Ulf Norell
Venue: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (2009)

We give an overview of Agda, the latest in a series of dependently typed programming languages developed in Gothenburg. Agda is based on Martin-Löf's intuitionistic type theory but extends it with numerous programming language features. It supports a wide range of inductive data types, including inductive families and inductive-recursive types, with associated flexible pattern-matching. Unlike other proof assistants, Agda is not tactic-based. Instead it has an Emacs-based interface which allows programming by gradual refinement of incomplete type-correct terms.
It's all about being right: lessons from the R6RS process
Authors: Michael Sperber
Venue: Proceedings of the 2007 International Lisp Conference (2007)

In the Revised Reports on Scheme up to R5RS, the language could only be changed by unanimous consent. It has been widely believed that any language changes made in this way would clearly be the right thing. Arguably, this process reached its limits with the Revised5 Report on Scheme: Crucial language additions such as modules, records and exceptions had little chance of reaching unanimous consent, no matter what the specific design. While the editors of the Revised6 Report no longer follow this rule, standardization is still driven by a strong desire to do the right thing. Continuing the tradition of Lisp culture, reaching this goal has been difficult and elusive, as the participants hold different and strongly opinionated ideas about what the right thing is. In the talk, I will review the R6RS process, and attempt to show that R6RS is indeed the right thing for Scheme.
A Co-operative Intelligent Assisting Agent Architecture for Web Searching and Desktop Management
Authors: Nandan Chaturbhuj, V. Shyam Prakash, Shivashankar B. Nair
Venue: Multi-Agent Systems for Society: 8th Pacific Rim International Workshop on Multi-Agents, PRIMA 2005, Kuala Lumpur, Malaysia, September 26-28, 2005, Revised Selected Papers (2009)

The rapid growth in technology has made the computer a vital tool for a wide variety of applications. Software that aids the common user in performing routine computing chores have now become commonplace. With the Internet growing rapidly, numerous new sites are coming into existence each day. This necessarily means that a user has to spend more time and energy to search for a particular piece of information. The need of the day is to develop software that can act more like a human assistant, understanding and learning a user's behavior to emulate and aid him to carry out his task in a simpler and easier manner. Presented in this paper is one such architecture wherein agents inhabit the desktop, monitor user behavior and over a period of time learn to adapt and take over routine tasks. Embedded on the Microsoft Windows 2000 desktop, the agents in this architecture work co-operatively with one another to provide desktop management and intelligent web surfing support.
Finite Element/Infinite Element Method for Acoustic Scattering Problem
Authors: Ruiliang Yang, Caixia Zhu, Xiaowei Fan, Gaoju Song
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The acoustic scattering problem is solved and an example is calculated using the finite element/infinite element method. Firstly, the surface velocity is obtained by the incidence acoustic wave and the characteristic of structure. Then the surface pressure is solved using the finite element/infinite element method. Lastly, the frequency of the incidence acoustic wave changes for the error of this method. This problem can be solved by finite element/infinite element method efficiently. Furthermore, the solving error is relatively low in a large frequency range.
Motion on numbers: Transcranial magnetic stimulation on the ventral intraparietal sulcus alters both numerical and motion processes
Authors: Elena Salillas, Demis Basso, Maurizia Baldi, Carlo Semenza, Tomaso Vecchi
Venue: Journal of Cognitive Neuroscience (2009)

It has often been proposed that there is a close link between representation of number and space. In the present work, single-pulse transcranial magnetic stimulation (TMS) was applied to the ventral intraparietal sulcus (VIPS) to determine effects on performance in motion detection and number comparison tasks. Participants' reaction times and thresholds for perception of laterally presented coherent motion in random dot kinematograms increased significantly when the contralateral VIPS was stimulated in contrast to the interhemispheric sulcus (Experiment 1) and to the ipsilateral VIPS (Experiment 2). In number comparison tasks, participants compared the magnitude of the laterally presented numbers 1-9 with the number 5. Again, reaction times significantly increased when TMS was applied to the contralateral VIPS in contrast to control sites. The finding that VIPS-directed TMS results in impaired efficiency in both motion perception and number comparison suggests that these processes share a common neural substrate.
Non-intrusive Personalized Mental Workload Evaluation for Exercise Intensity Measure
Authors: N. Luke Thomas, Yingzi Du, Tron Artavatkun, Jin-Hua She
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

Non-intrusive measures of mental workload signals are desirable, because they minimize artificially introduced noise, and can be more accurate. A new approach for non-intrusive personalized mental workload evaluation is presented. Our research results show that human mental workload is unique to each person, non-stationary, and not zero-state.
Multi-objective Cross-Layer Algorithm for Routing over Wireless Sensor Networks
Authors: Berta Carballido Villaverde, Susan Rea, Dirk Pesch
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

With Wireless Sensor Networks popularity growth, numerous cross-layer routing protocols have been proposed. These proposals are mainly designed to address the limitations in energy resources of the sensor nodes. However, advances in technology have led to a wide variety of possible applications with many different requirements. The routing protocol should not only take into account the energy resources but it also should be able to adapt to different application requirements making different routing decisions. Here we present a flexible cross-layer algorithm based on a cost function to provide multi-objective adaptability to existing routing protocols that aims to balance the requirements of multiple applications and the resource constrained sensor network nodes. Computer simulations and real hardware experiments demonstrate that the cross layer algorithm applied over a collection protocol improves the performance for different application requirements and shows that energy resources are conserved through dynamic parameter tuning.
Fully automatic lexicon expansion for domain-oriented sentiment analysis
Authors: Hiroshi Kanayama, Tetsuya Nasukawa
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

This paper proposes an unsupervised lexicon building method for the detection of polar clauses, which convey positive or negative aspects in a specific domain. The lexical entries to be acquired are called polar atoms, the minimum human-understandable syntactic structures that specify the polarity of clauses. As a clue to obtain candidate polar atoms, we use context coherency, the tendency for same polarities to appear successively in contexts. Using the overall density and precision of coherency in the corpus, the statistical estimation picks up appropriate polar atoms among candidates, without any manual tuning of the threshold values. The experimental results show that the precision of polarity assignment with the automatically acquired lexicon was 94% on average, and our method is robust for corpora in diverse domains and for the size of the initial lexicon.
Improving Window Switching Interfaces
Authors: Susanne Tak, Andy Cockburn, Keith Humm, David Ahlström, Carl Gutwin, Joey Scarr
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Switching between windows on a computer is a frequent activity, but current switching mechanisms make it difficult to find items. We carried out a longitudinal study that recorded actual window switching behaviour. We found that window revisitation is very common, and that people spend most time working with a small set of windows and applications. We identify two design principles from these observations. First, spatial constancy in the layout of items in a switching interface can aid memorability and support revisitation. Second, gradually adjusting the size of application and window zones in a switcher can improve visibility and targeting for frequently-used items. We carried out two studies to confirm the value of these design ideas. The first showed that spatially stable layouts are significantly faster than the commonly-used recency layout. The second showed that gradual adjustments to accommodate new applications and windows do not reduce performance.
Steady-State for Batches of Identical Task Trees
Authors: Sékou Diakité, Loris Marchal, Jean-Marc Nicod, Laurent Philippe
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on steady-state scheduling, and aim at reaching the optimal throughput of the system. Contrarily to previous studies, we concentrate upon the scheduling of batches of limited size. We try to reduce the processing time of each instance, thus making steady-state scheduling applicable to smaller batches. The problem is proven NP-complete, and a mixed integer program is presented to solve it. Then, different solutions, using steady-state scheduling or not, are evaluated through comprehensive simulations.
Effective short-term opponent exploitation in simplified poker
Authors: Bret Hoehn, Finnegan Southey, Robert C. Holte, Valeriy Bulitko
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

Uncertainty in poker stems from two key sources, the shuffled deck and an adversary whose strategy is unknown. One approach is to find a pessimistic game theoretic solution (i.e. a Nash equilibrium), but human players have idiosyncratic weaknesses that can be exploited if a model of their strategy can be learned by observing their play. However, games against humans last for at most a few hundred hands so learning must be fast to be effective. We explore two approaches to opponent modelling in the context of Kuhn poker, a small game for which game theoretic solutions are known. Parameter estimation and expert algorithms are both studied. Experiments demonstrate that, even in this small game, convergence to maximally exploitive solutions in a small number of hands is impractical, but that good (i.e. better than Nash or breakeven) performance can be achieved in a short period of time. Finally, we show that amongst a set of strategies with equal game theoretic value, in particular the set of Nash equilibrium strategies, some are preferable because they speed learning of the opponent's strategy by exploring it more effectively.
Social Networks Security
Authors: Jan Nagy, Peter Pecho
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

Our study analyses possibilities of misusing social network sites due to irresponsible behaviour of users. Recent surveys show that problems of social network are more often to occur, due to openness as one of the key features of these sites. Social engineering can be misused by attackers concerning on social network with the purpose of gaining sensitive information. There is a conflict between users' security awareness and their actual behaviour, so called privacy paradox. We were interested in amount of information people are willing to reveal in their profiles. We have found out users' behaviour which leads to insufficient protection of published information. These sensitive information are suitable for all kinds of phishing and other similar attacks. In our study we compared two groups of fictive profiles (personal profiles of users having no friends and profiles of users with fictive friends) and studied their success in creating new links in social network. We also considered tools for protecting sensitive information in social networks.
A novel ICA-based hardware system for reconfigurable and portable BCI
Authors: A. Palumbo, B. Calabrese, G. Cocorullo, M. Lanuzza, P. Veltri, P. Vizza, A. Gambardella, M. Sturniolo
Venue: Proceedings of the 2009 IEEE International Workshop on Medical Measurements and Applications (2009)

Partially or completely paralyzed patients can benefit from Brain Computer Interface (BCI) in which a continuous recording of electroencephalogram (EEG) is required, operating some processing and classification to control a computer or other devices. Patients are so allowed to control external devices or to communicate simple messages through the computer, just concentrating their attention on codified movements or on a letter or icon on a digital keyboard. Using an on-purpose optimized spatial filtering technique in a BCI system, based on the ElectroEncephaloGraphic activity detection, enables to improve its accuracy, due to the explicit separation of the signal activity of interest from non-interesting signals. In this paper, a novel implementation of the spatial filtering ICA algorithm, onto a very performing and flexible hardware platform, is presented. The designed system enables the acquisition and the subsequent ICA elaboration of ElectroEncephaloGraphic signals in real-time, resulting so very effective for BCI applications. The efficiency of the implemented technique has been experimentally demonstrated.
The contribution of changes in F0 and spectral tilt to increased intelligibility of speech produced in noise
Authors: Youyi Lu, Martin Cooke
Venue: Speech Communication (2009)

Talkers modify the way they speak in the presence of noise. As well as increases in voice level and fundamental frequency (F0), a flattening of spectral tilt is observed. The resulting ''Lombard speech'' is typically more intelligible than speech produced in quiet, even when level differences are removed. What is the cause of the enhanced intelligibility of Lombard speech? The current study explored the relative contributions to intelligibility of changes in mean F0 and spectral tilt. The roles of F0 and spectral tilt were assessed by measuring the intelligibility gain of non-Lombard speech whose mean F0 and spectrum were manipulated, both independently and in concert, to simulate those of natural Lombard speech. In the presence of speech-shaped noise, flattening of spectral tilt contributed greatly to the intelligibility gain of noise-induced speech over speech produced in quiet while an increase in F0 did not have a significant influence. The perceptual effects of spectrum flattening was attributed to its ability of increasing the amount of speech time-frequency plane ''glimpsed'' in the presence of noise. However, spectral tilt changes alone could not fully account for the intelligibility of Lombard speech. Other changes observed in Lombard speech such as durational modifications may well contribute to intelligibility.
Research on Self-Adaptived Algorithm in Data Distributed Management
Authors: Dou Zhiwu, Li Hongwei
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

In order to resolve the general adaptive problem of the dynamic grid-based algorithm in distributed interactive simulation based on HLA, the adaptive dynamic grid-based algorithm is suggested out through thoroughly researching the theory proof and formula deduction of the dynamic grid-based algorithm in this paper. The availability of dynamic grid-based algorithm is studied under three special situations by theory proving and formula deducing dwell on, and the results of instance imply that the dynamic grid-based algorithm is availability under three special situations by changing the implement process of the dynamic grid-based algorithm. The conclusions show that the adaptive dynamic grid-based algorithm is self-adaptive, can reach the goal of the data distributed management and hugely improves the effect and efficiency of the high complexity simulation system based on HLA.
Adaptation in Collaborative Virtual Environments for Training
Authors: Stéphanie Gerbaud, Valérie Gouranton, Bruno Arnaldi
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

Virtual environments for training, especially collaborative ones, require adaptability in order to be used in various situations. In this paper, we classify the needs for adaptation into two levels. The first one concerns the application setting. The second one is a dynamic adaptation, at runtime. The models proposed in this paper fulfill these two levels of requirements. Virtual world, virtual humans' behavior, scenario and application configuration can be adapted to a specific training situation. Moreover, an action selection mechanism enables actors to dynamically adapt their action scheduling to a situation. This situation is defined by a current context, past actions and a goal to achieve, namely a scenario. Finally we validate our models by presenting an illustrative scenario: the collaborative assembly of a piece of furniture.
Novel Method for Optimal Number of Cluster Heads in LEACH
Authors: Hong Li, Xu Shunjie, Li Shurong, Zou Weixia, Zhou Zheng
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

The optimal number of cluster heads is animportant parameter of wireless sensor networkperformance. Network nodes will consume moreenergy if the number of cluster heads is too much ortoo little. This paper focuses on novel calculationmethod for optimal number of cluster heads. Base onthe analysis of LEACH energy dissipation model,novel calculation method is derived from the totalenergy dissipation of a round. Simulation shows therelationship of the optimal number of cluster heads,the number of frames in steady state phase and thedistance between cluster heads and base station (BS).And it provides a theoretical basis for calculation ofoptimal number of cluster heads which can reducethe energy consumption among nodes and achievesan improvement on the network lifetime.
Anaerobic Dechlorination of Perchloroethylene and Factors Influence under Iron Reducing Condition
Authors: Ye Li, Jianmin Li, Yipeng Du, Fei Liu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

The Anaerobic degradation of perchloroethylene under iron reducing condition was studied by batch experiments in the microcosm with the temperature of 20°C. It showed that PCE could be sequentially dechlorinated to TCE and then to DCEs. TCE appeared at the second day of degradation experiment and a few μg/L of DCEs appeared about 10 days later. But the decrease of the concentration of TCE was not observed. The carbon balance in the reaction system is between 89.00~100.0%, which shows that PCE volatilization was controlled relatively well. The dechlorination rate of PCE is 0.2489d-1 and its half life is 2.78 d under the experiment condition. The influence of temperature and pH to the PCE dechlorination were also investigated. When the temperature is 12°C, the dechlorination rate is 0.1233d-1. The optimum pH for dechlorination microbe is about 7.