ppxscal/embedding_network huggingface dataset:
A Novel Approach to Steganography in High- Dynamic-Range Images
Authors: Yu-Ming Cheng, Chung-Ming Wang
Venue: IEEE MultiMedia (2009)

A steganographic method for hiding messages uses high-dynamic-range images. The technique provides for authentication, a large embedding capacity, and limited distortion.
Automatically acquiring domain knowledge for adaptive game AI using evolutionary learning
Authors: Marc J. V. Ponsen, Héctor Muñoz-Avila, Pieter Spronck, David W. Aha
Venue: Proceedings of the 17th conference on Innovative applications of artificial intelligence - Volume 3 (2005)

Game AI is the decision-making process of computer-controlled opponents in computer games. Adaptive game AI can improve the entertainment value of computer games. It allows computer-controlled opponents to automatically fix weaknesses in the game AI and respond to changes in human-player tactics. Dynamic scripting is a recently developed approach for adaptive game AI that learns which tactics (i.e., action sequences) an opponent should select to play effectively against the human player. In previous work, these tactics were manually generated. We introduce AKADS; it uses an evolutionary algorithm to automatically generate such tactics. Our experiments show that it improves dynamic scripting's performance on a real-time strategy (RTS) game. Therefore, we conclude that high-quality domain knowledge (i.e., tactics) can be automatically generated for strong adaptive AI opponents in RTS games. This reduces the time and effort required by game developers to create intelligent game AI, thus freeing them to focus on other important topics (e.g., storytelling, graphics).
Equivalence and Discretisation in Bio-PEPA
Authors: Vashti Galpin, Jane Hillston
Venue: Proceedings of the 7th International Conference on Computational Methods in Systems Biology (2009)

Bio-PEPA is a process algebra for modelling biological systems. An important aspect of Bio-PEPA is the ability it provides to discretise concentrations resulting in a smaller, more manageable state space. The discretisation is based on a step size which determines the size of each discrete level and also the maximum number of levels. This paper considers the relationship between two discretisations of the same Bio-PEPA model that differ only in the step size and hence the maximum number of levels, by using the idea of equivalence from concurrency and process algebra. We present a novel behavioural semantic equivalence, compression bisimulation, that equates two discretisations of the same model and we show that this equivalence is a congruence with respect to the synchronisation operator.
On-line recognition of surgical activity for monitoring in the operating room
Authors: N. Padoy, T. Blum, H. Feussner, M-O. Berger, N. Navab
Venue: Proceedings of the 20th national conference on Innovative applications of artificial intelligence - Volume 3 (2008)

Surgery rooms are complex environments where many interactions take place between staff members and the electronic and mechanical systems. In spite of their inherent complexity, surgeries of the same kind bear numerous similarities and are usually performed with similar workftows. This gives the possibility to design support systems in the Operating Room (OR), whose applicability range from easy tasks such as the activation of OR lights and calling the next patient, to more complex ones such as context-sensitive user interfaces or automatic reporting. An essential feature when designing such systems, is the ability for on-line recognition of what is happening inside the OR, based on recorded signals. In this paper, we present an approach using signals from the OR and Hidden Markov Models to recognize on-line the surgical steps performed by the surgeon during a laparoscopic surgery. We also explain how the system can be deployed in the OR. Experiments are presented using 11 real surgeries performed by different surgeons in several ORs, recorded at our partner hospital. We believe that similar systems will quickly develop in the near future in order to efficiently support surgeons, trainees and the medical staff in general, as well as to improve administrative tasks like scheduling within hospitals.
An Application of New Quantum-Inspired Immune Evolutionary Algorithm
Authors: Qu Hongjian, Zhou Fangzhao, Zhang Xiangxian
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

A novel algorithm, called quantum-inspired immune evolutionary algorithm (QIEA), is proposed to avoid premature convergence. Based on the combining of the quantum evolutionary algorithm with the main mechanisms of immune, QIEA can adopt the high-effective parallelism of QEA and using a lot of operators such as mutation and selection to improve the traditional quantum evolutionary algorithm (QEA), the new QIEA has better diversity of its swarm in order to avoid prematurity and converging speed than the traditional evolutionary algorithm. The convergence of the QIEA is proved and its superiority is shown by the experiments in this paper.
A Temporal Data Mining Approach for Discovering Knowledge on the Changes of the Patient's Physiology
Authors: Corrado Loglisci, Donato Malerba
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

Physiological data represent the health conditions of a patient over time. They can be analyzed to gain knowledge on the course of a disease or, more generally, on the physiology of a patient. Typical approaches rely on background medical knowledge to track or recognize single stages of the disease. However, when no one domain knowledge is available these approaches become inapplicable. In this paper we describe a Temporal Data Mining approach to acquire knowledge about the possible causes which can trigger particular stages of the disease or, more generally, which can determine changes in the patient's physiology. The analysis is performed in two steps: first, identification of the states of the disease (namely, the stages through which the physiology evolves), then detection of the events which may determine the change from a state to the next one. Computational solutions to both issues are presented. The application to the scenario of the sleep disorders allows to discover events, in the form of breathing and cardiovascular disorders, which may trigger particular sleep stages. Results are evaluated and discussed.
Sentiment summarization: evaluating and learning user preferences
Authors: Kevin Lerman, Sasha Blair-Goldensohn, Ryan McDonald
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

We present the results of a large-scale, end-to-end human evaluation of various sentiment summarization models. The evaluation shows that users have a strong preference for summarizers that model sentiment over non-sentiment baselines, but have no broad overall preference between any of the sentiment-based models. However, an analysis of the human judgments suggests that there are identifiable situations where one summarizer is generally preferred over the others. We exploit this fact to build a new summarizer by training a ranking SVM model over the set of human preference judgments that were collected during the evaluation, which results in a 30% relative reduction in error over the previous best summarizer.
On Analysis and Design of Student Course Selection System with UML
Authors: Xiaohui Wang, Lin Lin
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

In this paper, UML (Unified Modeling Language) which is used for the object-oriented analysis and design will be mainly investigated. Student course selection system will be as an example to show how to use UML language for Object-Oriented analysis and design.
Cumulative effects of concurrent actions on numeric-valued fluents
Authors: Esra Erdem, Alfredo Gabaldon
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

We propose a situation calculus formalization of action domains that include numeric-valued fluents (so-called additive or measure fluents) and concurrency. Our approach allows formalizing concurrent actions whose effects increment/decrement the value of additive fluents. For describing indirect effects, we employ mathematical equations in a manner that is inspired by recent work on causality and structural equations.
Design of a Web Intervention to Change Youth Smoking Habits
Authors: Kim Nee Goh, Yoke Yie Chen, Emy Elyanee Mustapha, Subarna Sivapalan, Sharina Nordin
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

Web interventions are gaining popularity in trying to change a person's behavior. However, poorly designed intervention websites will affect the learning process of a person, what more to remember the content that they have learnt. The objective of this paper is to discuss the design of a web intervention using Gagne's Condition of Learning Theory and cognitive dissonance. The usage of learning theory enables the designers to develop the intervention website based on users' learning capabilities, thus placing users as priority. This ensures that users are able to maximize learning and recall of its content when faced with the decision to smoke or not. We are planning to recruit target users who are smokers, ranging from the 18 to 22 age range. Smokers will be categorized according to a baseline survey. Each category of users will go through the web intervention of different content. It is hoped that by combining the abovementioned theories, smokers are able to reduce their intake.
A Bayesian approach to automating argumentation
Authors: Richard McConachy, Kevin B. Korb, Ingrid Zukerman
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

Our argumentation system NAG uses Bayesian networks in a user model and in a normative model to assemble and assess nice arguments, that is arguments which balance persuasiveness with normative correctness. Attentional focus is simulated in both models to select relevant subnetworks for Bayesian propagation. Bayesian propagation in the user model is modified to represent some human cognitive weaknesses. The subnetworks are expanded in an iterative abductive process until argumentative goals are achieved in both models, when the argument is presented to the user.
High-Level Fusion of Depth and Intensity for Pedestrian Classification
Authors: Marcus Rohrbach, Markus Enzweiler, Dariu M. Gavrila
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

This paper presents a novel approach to pedestrian classification which involves a high-level fusion of depth and intensity cues. Instead of utilizing depth information only in a pre-processing step, we propose to extract discriminative spatial features (gradient orientation histograms and local receptive fields) directly from (dense) depth and intensity images. Both modalities are represented in terms of individual feature spaces, in each of which a discriminative model is learned to distinguish between pedestrians and non-pedestrians. We refrain from the construction of a joint feature space, but instead employ a high-level fusion of depth and intensity at classifier-level.Our experiments on a large real-world dataset demonstrate a significant performance improvement of the combined intensity-depth representation over depth-only and intensity-only models (factor four reduction in false positives at comparable detection rates). Moreover, high-level fusion outperforms low-level fusion using a joint feature space approach.
Atomicity for XML Databases
Authors: Debmalya Biswas, Ashwin Jiwane, Blaise Genest
Venue: Proceedings of the 6th International XML Database Symposium on Database and XML Technologies (2009)

With more and more data stored into XML databases, there is a need to provide the same level of failure resilience and robustness that users have come to expect from relational database systems. In this work, we discuss strategies to provide the transactional aspect of atomicity to XML databases. The main contribution of this paper is to propose a novel approach for performing updates-in-place on XML databases, with the undo statements stored in the same high level language as the update statements. Finally, we give experimental results to study the performance/storage trade-off of the updates-in-place strategy (based on our undo proposal) against the deferred updates strategy to providing atomicity.
Algorithmic Verification of Systems Software Using SMT Solvers
Authors: Shaz Qadeer
Venue: Proceedings of the 16th International Symposium on Static Analysis (2009)

Program verification is an undecidable problem; all program verifiers must make a tradeoff between precision and scalability. Over the past decade, a variety of scalable program analysis tools have been developed. These tools, based primarily on techniques such as type systems and dataflow analysis, scale to large and realistic programs. However, to achieve scalability they sacrifice precision, resulting in a significant number of false error reports and adversely affecting the usability of the tool.In this talk, I will present a different approach to program verification realized in the HAVOC verifier for low-level systems software. HAVOC works directly on the operational semantics of C programs based on a physical model of memory that allows precise modeling of pointer arithmetic and other unsafe operations prevalent in low-level software. To achieve scalability, HAVOC performs modular verification using contracts in an expressive assertion language that includes propositional logic, arithmetic, and quantified type and data-structure invariants. The assertion logic is closed under weakest precondition, thereby guaranteeing precise verification for loop-free and call-free code fragments. To reduce the effort of writing contracts, HAVOC provides a mechanism to infer them automatically. It allows the user to populate the code with candidate contracts and then searches efficiently through the candidate set for a subset of consistent contracts.The expressive contract language in HAVOC has two important benefits. First, it allows the documentation and verification of properties and invariants specific to a particular software system. Second, it allows a user to systematically achieve the ideal of precise verification (with no false alarms) by interacting with the verifier and providing key contracts that could not be inferred automatically.HAVOC has been implemented using the Boogie verification-condition generator and the Z3 solver for Satisfiability-Modulo-Theories. I will describe the design and implementation of HAVOC and our experience applying it to verify typestate assertions on medium-sized device drivers with zero false alarms. I will conclude with a discussion of remaining challenges and directions for future work.
Distributed Range-Free Localization Algorithm Based on Self-Organizing Maps
Authors: Pham Doan Tinh, Makoto Kawai
Venue: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (2009)

In Mobile Ad-Hoc Networks (MANETs), determining the physical location of nodes (localization) is very important for many network services and protocols. This paper proposes a new Distributed Range-free Localization Algorithm Based on Self-Organizing Maps (SOM) to deal with this issue. Our proposed algorithm utilizes only connectivity information to determine the location of nodes. By utilizing the intersection areas between radio coverage of neighboring nodes, the algorithm has maximized the correlation between neighboring nodes in distributed implementation of SOM and reduced the SOM learning time. An implementation of the algorithm on Network Simulator 2 (NS-2) was done with the mobility consideration to verify the performance of the proposed algorithm. From our intensive simulations, the results show that the proposed scheme achieves very good accuracy in most cases.
An Entropy-Based Countermeasure against Intelligent DoS Attacks Targeting Firewalls
Authors: F. Al-Haidari, M. Sqalli, K. Salah, J. Hamodi
Venue: Proceedings of the 2009 IEEE International Symposium on Policies for Distributed Systems and Networks (2009)

Denial of Service (DoS) attacks are very dangerous as they consume resources at the network and transport layers. Firewalls are considered as the first line of defense in any network. An attacker may use probing to learn a firewall’s policy, and then launch a DoS attack that floods the firewall with traffic targeting the rules at the bottom of this policy. In this paper, we propose a countermeasure that enables the firewall to endure the attack attempts without denying service to legitimate clients. The goal of this work is to use an entropy-based scheme to distinguish between the legitimate and attack traffic. Then, the legitimate traffic will be placed in a queue with a higher priority than the queue holding the attack traffic. The results show that the proposed scheme improves on the performance of the firewall under a DoS attack.
Technical paper recommendation: a study in combining multiple information sources
Authors: Chumki Basu, Haym Hirsh, William W. Cohen, Craig Nevill-Manning
Venue: Journal of Artificial Intelligence Research (2001)

The growing need to manage and exploit the proliferation of online data sources is opening up new opportunities for bringing people closer to the resources they need. For instance, consider a recommendation service through which researchers can receive daily pointers to journal papers in their fields of interest. We survey some of the known approaches to the problem of technical paper recommendation and ask how they can be extended to deal with multiple information sources. More specifically, we focus on a variant of this problem - recommending conference paper submissions to reviewing committee members - which offers us a testbed to try different approaches. Using WHIRL - an information integration system - we are able to implement different recommendation algorithms derived from information retrieval principles. We also use a novel autonomous procedure for gathering reviewer interest information from the Web. We evaluate our approach and compare it to other methods using preference data provided by members of the AAAI-98 conference reviewing committee along with data about the actual submissions.
Intelligence on the Web and e-Inclusion
Authors: Laura Burzagli, Francesco Gabbanini
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

Within the context of Web, the word intelligence is often connected with the visions of Semantic Web and Web 2.0. One of the main characteristic of Semantic Web lies in the fact that information is annotated with metadata and this gives the opportunity of organizing knowledge, extracting new knowledge and performing some basic operations like query answering or inference reasoning. Following this argument, the advent of the Semantic Web is often claimed to bring about substantial progress in Web accessibility (which is part of the e-Inclusion concept). Web 2.0 sites, favoring massive information sharing, could as well be of great importance for e-Inclusion, enabling new forms of social interaction, collective intelligence and new patterns of interpersonal communication. Benefits could be substantial also for people with activity limitations. The paper tries to highlight the possible roles and convergence of Web 2.0 and Semantic Web in favoring e-Inclusion. It highlights the fact that examples of applications of these concepts to the e-Inclusion domain are few and limited to the e-Accessibility field.
Regional Assessment of Eco-environmental Vulnerability Based on GIS A Case Study of Hubei Province, China
Authors: Lu Li, Zhihua Shi, Dun Zhu, Chongfa Cai, Tianwei Wang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

The regional eco-environment quality is the base of the sustainable development. This paper developed an eco-environmental vulnerability evaluation model using spatial principle component analysis (SPCA) and eco-environment vulnerability index method. This method was carried out in a case study of Hubei Province, China. The vulnerability was classified into six levels: potential, slight, light, medial, heavy, and extreme level. The results showed that the majority of Hubei Province was at slight, light or medial vulnerable level and the environmental vulnerability was increased from south to north.
Method for Joining Intersected Contour Lines Intelligently
Authors: Sun Yan, Wang Cheng, Xie Fei
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Continuous contour lines rise prominent function in drawing DEM and querying between graphics and attribute. When they are divided into a lot of parts and drawn in the map with fixed size, the merged problem of the contour lines which are described in different maps has been a tough problem during the handling process of foundation data. This paper puts forward the problems when joining the intersected contour lines firstly, and then give five constraints about merging contour lines. Trough coordinate system conversion and template matrix calculating, we find the identical points of two corresponding regular grid DEMs. Finally, we get the results of joining the intersected contour lines intelligently.
Multiagent graph coloring: Pareto efficiency, fairness and individual rationality
Authors: Yaad Blum, Jeffrey S. Rosenschein
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in coloring the graph has associated cost. In this multi agent graph coloring scenario, we seek a minimum legal coloring of the global graph's vertices, such that the coloring is also Pareto efficient, socially fair, and individual rational. We analyze complexity of individual-rational solutions in special graph classes where classical coloring algorithms are known. Multiagent graph coloring has application to a wide variety of multi agent coordination problems, including multiagent scheduling.
The Designer's Guide to Jitter in Ring Oscillators, 1st edition
Authors: John A. McNeill, David Ricketts
Venue:  (2009)

The Designer's Guide to Low Jitter Oscillators emphasizes jitter for time domain applications so that there is not a need to translate from frequency domain. This provides a more direct path to the results for designing in an application area where performance is specified in the time domain. The book includes classification of oscillator types and an exhaustive guide to existing research literature which allows designers to find appropriate publications for more detailed design guidance. It also includes classification of measurement techniques to help designers understand how the eventual performance of circuit design is verified. This book contains a CD-ROM with MATLAB examples of design optimization, system level behavioral simulation, and intuitive presentation of probability background. The Designer's Guide to Low Jitter Oscillatorsis a companion to The Designers Guide to High Purity Oscillators by Hegazi, Rael, and Abidi. This book is for practicing designers with BS or MS degrees and researchers working in fields where noise requirements are specified in the time domain.