ppxscal/embedding_network huggingface dataset:
An axiomatic account of formal argumentation
Authors: Martin Caminada, Leila Amgoud
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

Argumentation theory has become an important topic in the field of AI. The basic idea is to construct arguments in favor and against a statement, to select the "acceptable" ones and, finally, to determine whether the statement can be accepted or not. Dung's elegant account of abstract argumentation (Dung 1995) may have caused some to believe that defining an argumentation formalism is simply a matter of determining how arguments and their defeat relation can be constructed from a given knowledge base. Unfortunately, things are not that simple; many straightforward instantiations of Dung's theory can lead to very unintuitive results, as is discussed in this paper. In order to avoid such anomalies, in this paper we are interested in defining some rules, called rationality postulates or axioms, that govern the well definition of an argumentation system. In particular, we define two important rationality postulates that any system should satisfy: the consistency and the closeness of the results returned by that system. We then provide a relatively easy way in which these quality postulates can be warranted by our argumentation system.
In-the-dark network traffic classification using support vector machines
Authors: William H. Turkett, Andrew V. Karode, Errin W. Fulp
Venue: Proceedings of the 20th national conference on Innovative applications of artificial intelligence - Volume 3 (2008)

This work addresses the problem of in-the-dark traffic classification for TCP sessions, an important problem in network management. An innovative use of support vector machines (SVMs) with a spectrum representation of packet flows is demonstrated to provide a highly accurate, fast, and robust method for classifying common application protocols. The use of a linear kernel allows for an analysis of SVM feature weights to gain insight into the underlying protocol mechanisms.
A hybrid approach to context modelling in large-scale pervasive computing environments
Authors: Deirdre Lee, René Meier
Venue: Proceedings of the Fourth International ICST Conference on COMmunication System softWAre and middlewaRE (2009)

Pervasive computing aims to unobtrusively embed computer systems into everyday life environments to enrich the user experience without demanding the user's explicit attention. For pervasive computing to be minimally invasive, computer systems must be conscious of and ultimately, be able to act according to the context of the user and her intelligent environment. However, such context is often heterogeneous as it is derived from myriads of independent systems and sensors, can be incomplete, and may even be erroneous. For independent systems to manage, share, correlate, and reason over context, contextual information must be modelled in a homogenous fashion. This paper proposes a hybrid approach to modelling contextual information that incorporates the management and communication benefits of traditional object-oriented context models, while also taking advantage of the semantic and inference benefits of ontology-based context models. Unlike other approaches, our hybrid model has been designed to support a specific large-scale pervasive domain, namely the transportation domain, and promotes exploiting primary context as the key to accessing and correlating distributed knowledge. The Primary-Context Model and the Primary-Context Ontology are part of a pervasive middleware architecture for integrating independent Intelligent Transport Systems and pervasive transportation services and has been applied to a prototypical realisation of such system and service integration.
A New Filtering Algorithm for Removing Salt-and-Pepper Noise
Authors: Ji-hong Yang, Min Zhang, Ling-yan Xue, Shu-bang Li
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

A new filtering algorithm for removing salt-and-pepper noise from gradation images was introduced. Eight directional templates and one nondirectional template were selected to smooth gray-scale images. First to judge which templates the pending pixel should belong to according to compatibility and similitude principle, then using the corresponding template to smooth the pending pixel.The salt-and-pepper noise in gradation images can be removed effectively as well as the margins and details can be kept well. This filtering algorithm can be more useful in the field of medical images pretreatment.
State and Parameter Estimation of a HEV Li-ion Battery Pack Using Adaptive Kalman Filter with a New SOC-OCV Concept
Authors: Haifeng Dai, Xuezhe Wei, Zechang Sun
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

A new methodology of defining the relationship between SOC (State of Charge) and OCV (Open Circuit Voltage) relationship of the Li-ion battery pack used on HEVs (Hybrid Electric Vehicles) which is independent of the battery condition was proposed. This methodology could avoid the problems resulting from the defects that the conventional SOC-OCV relationship differs between batteries and different working conditions. Based on the new definition, a state and parameter estimator of the Li-ion battery pack based on the Sage-Husa adaptive Kalman filter was proposed. This estimator recruited an equivalent circuit model to describe the dynamic characteristics of the battery pack. The estimator could estimate the SOC, the battery actual capacity and the inner resistance on-board. The implementation of the estimator on a FPGA platform was also introduced. Testing results show that the new definition and the estimator work very well in any specific working condition.
Parser combination by reparsing
Authors: Kenji Sagae, Alon Lavie
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

We present a novel parser combination scheme that works by reparsing input sentences once they have already been parsed by several different parsers. We apply this idea to dependency and constituent parsing, generating results that surpass state-of-the-art accuracy levels for individual parsers.
Complexity of Fractran and Productivity
Authors: Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
Venue: Proceedings of the 22nd International Conference on Automated Deduction (2009)

In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarantee that every finite part of the result can be evaluated in finitely many steps. This is known as productivity. For programming with infinite structures, productivity is what termination in well-defined results is for programming with finite structures.Fractran is a simple Turing-complete programming language invented by Conway. We prove that the question whether a Fractran program halts on all positive integers is ${\rm \Pi}^{0}_{2}$-complete. In functional programming, productivity typically is a property of individual terms with respect to the inbuilt evaluation strategy. By encoding Fractran programs as specifications of infinite lists, we establish that this notion of productivity is ${\rm \Pi}^{0}_{2}$-complete even for some of the most simple specifications. Therefore it is harder than termination of individual terms. In addition, we explore generalisations of the notion of productivity, and prove that their computational complexity is in the analytical hierarchy, thus exceeding the expressive power of first-order logic.
On the maximality of linear codes
Authors: T. L. Alderson, András Gács
Venue: Designs, Codes and Cryptography (2009)

We show that if a linear code admits an extension, then it necessarily admits a linear extension. There are many linear codes that are known to admit no linear extensions. Our result implies that these codes are in fact maximal. We are able to characterize maximal linear (n, k, d) q -codes as complete (weighted) (n, n ¿ d)-arcs in PG(k ¿ 1, q). At the same time our results sharply limit the possibilities for constructing long non-linear codes. The central ideas to our approach are the Bruen-Silverman model of linear codes, and some well known results on the theory of directions determined by affine point-sets in PG(k, q).
Emotion modulates early auditory response to speech
Authors: Jade Wang, Trent Nicol, Erika Skoe, Mikko Sams, Nina Kraus
Venue: Journal of Cognitive Neuroscience (2009)

In order to understand how emotional state influences the listener's physiological response to speech, subjects looked at emotion-evoking pictures while 32-channel EEG evoked responses (ERPs) to an unchanging auditory stimulus ("danny") were collected. The pictures were selected from the International Affective Picture System database. They were rated by participants and differed in valence (positive, negative, neutral), but not in dominance and arousal. Effects of viewing negative emotion pictures were seen as early as 20 msec (p =.006). An analysis of the global field power highlighted a time period of interest (30.4-129.0 msec) where the effects of emotion are likely to be the most robust. At the cortical level, the responses differed significantly depending on the valence ratings the subjects provided for the visual stimuli, which divided them into the high valence intensity group and the low valence intensity group. The high valence intensity group exhibited a clear divergent bivalent effect of emotion (ERPs at Cz during viewing neutral pictures subtracted from ERPs during viewing positive or negative pictures) in the time period of interest (rÎ¦ =.534, p p =.004 and.006, low valence intensity and high valence intensity, respectively), the high valence intensity group exhibited a much larger effect. Whereas the low valence intensity group exhibited its smaller effect predominantly in frontal areas, the larger effect in the high valence intensity group was found globally, especially in the left temporal areas, with the largest divergent bivalent effects (ANOVA, p
Low-cost compute clusters in virtualized lab environments
Authors: Matthew Bergman, Justin Funston, Patricia Gilfeather-Crowley
Venue: Journal of Computing Sciences in Colleges (2009)

In this paper we demonstrate and evaluate a method of creating a small compute cluster within a virtualized lab environment. Our goal is to create an easily managed, highly adaptable lab environment that simultaneously supports an undergraduate computer lab and a low-cost research compute cluster. The overall result is a demonstrated compute cluster benchmarked at 60 Gflops with a classroom lab of near-native performance Windows XP workstations.
T Cell Receptor Signalling Inspired Kernel Density Estimation and Anomaly Detection
Authors: Nick D. Owens, Andy Greensted, Jon Timmis, Andy Tyrrell
Venue: Proceedings of the 8th International Conference on Artificial Immune Systems (2009)

The T cell is able to perform fine-grained anomaly detection via its T Cell Receptor and intracellular signalling networks. We abstract from models of T Cell signalling to develop a new Artificial Immune System concepts involving the internal components of the TCR. We show that the concepts of receptor signalling have a natural interpretation as Parzen Window Kernel Density Estimation applied to anomaly detection. We then demonstrate how the dynamic nature of the receptors allows anomaly detection when probability distributions vary in time.
Development process of functional hierarchy for actions and motor imagery
Authors: Ryunosuke Nishimoto, Jun Tani
Venue: Proceedings of the 2009 IEEE 8th International Conference on Development and Learning (2009)

The current paper shows a neuro-Robotics experiment on developmental learning of goal-directed actions. The robot was trained to predict visuo-proprioceptive flow of achieving a set of goal-directed behaviors through iterative tutor training processes. The learning was conducted by employing a dynamic neural network model which is characterized by their multiple time-scales dynamics. The experimental results showed that functional hierarchical structures emerge through stages of developments where behavior primitives are generated in earlier stages and their sequences of achieving goals appear later stages. It was also observed that motor imagery is generated in earlier stages compared to actual behaviors. Our claim that manipulatable inner representation should emerge through the sensorymotor interactions is corresponded to Piaget's constructivist view.
CSMA-MAC Performance Evaluation for WSN Applications
Authors: Christos Antonopoulos, Aggeliki Prayati, Fotis Kerasiotis, George Papadopoulos
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

This paper studies the MAC layer performance in demanding wireless sensor networks. The requirements for wireless MAC are discussed based on a prominent CSMA-based MAC protocol evaluation varying critical network parameters. The objective is to investigate the current radio access technologies suitability for wireless sensor networked applications. The channel access mechanisms are analyzed in more detail, important performance parameters are derived and their behavior in different traffic scenarios is investigated through simulation based analysis.
Game-Console Makers Battle over Motion-Sensitive Controllers
Authors: Steven J. Vaughan-Nichols
Venue: Computer (2009)

New controllers promise to enable more intuitive game playing based on natural body movements, rather than on button pushing.
Path Planning of Parafoil System Based on Particle Swarm Optimization
Authors: Liu Zhao, Kong Jianyi
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

The paper describes the general controlling methods of controllable parafoil and designs a parafoil path planning method based on optimal control. To improve the accuracy of falling point and reducing manipulation quantity, this method transforms path planning of parafoil into parameter optimization by using the improved particle swarm optimization algorithm. Such an algorithm is effective for reaching a ideal solution, which is also the similar optimal solution of parafoil path planning. To verify the performance and the feasibility of this method, the traditional subdivision control method and optimal control method are compared respectively in simulation environment. Experiments show that the optimal control method of the parafoil path planning based on PSO can improve the accuracy of falling point and falling direction as well as reducing manipulation quantity.
An Efficient Copyright Protection Technique for Digital Images Based on Finite Groups
Authors: Wang Yiding, Wang Xiaojing, Tang Dan
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

It is well known that a digital signature scheme and digital timestamp are two well-defined security methods for copyright protection. However, these techniques are not suitable for dealing with digital images directly because of some intrinsic features of digital images such as large amount of data, highly redundancy, and strong correlation among pixels. For this reason, digital watermarking has received considerable attention for copyright protection. In this paper, a robust copyright protection scheme for digital image is proposed. In the new scheme, Color images can be used as the watermark is an important characteristic and the watermark does not require to be embedded into the protected image but is used to generate a secret image by addition operations over finite groups, then the secret image is registered to certified authority (CA) for further protection. The experimental results show that the proposed scheme not only can clearly verify the copyright of the digital image, but also is robust to withstand many image processing attacks.
A New Model of Enterprise Framework
Authors: Yibo Yang, Tao Ji
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

With the expanding of business scale, integration is becoming the utmost needs of today's enterprises. Traditional enterprise framework not adapt to the rapid increase in the enterprise scale, a new model for Enterprise framework is presented. From the model the key factors in it were finded outwhich shaped the enterprise framework from the enterprise direction and the internal implementation effect.
Identifying Issues and Concerns in Software Reuse in Software Product Lines
Authors: Meena Jha, Liam O'Brien
Venue: Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering (2009)

One of the reasons for introducing software product lines (SPL) is the reduction of costs through reusing common assets for different products. Developing assets to be reused in different products is often not easy. Increasing complexity due to the multitude of different functions and their interactions as well as a rising number of different product variants are just some of the challenges that must be faced when reusing software and other assets. In an attempt to understand the obstacles to implementing software reuse in SPL we have conducted a survey to investigate how software reuse is adopted in SPL so as to provide the necessary degree of support for engineering software product line applications and to identify some of the issues and concerns in software reuse. This survey also gathers information from SPL practitioners on what influences the selection of software to reuse within a software product line. This paper reports the results of that survey.
Real-Time Online Video Object Silhouette Extraction Using Graph Cuts on the GPU
Authors: Zachary A. Garrett, Hideo Saito
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

Being able to find the silhouette of an object is a very important front-end processing step for many high-level computer vision techniques, such as Shape-from-Silhouette 3D reconstruction methods, object shape tracking, and pose estimation. Graph cuts have been proposed as a method for finding very accurate silhouettes which can be used as input to such high level techniques, but graph cuts are notoriously computation intensive and slow. Leading CPU implementations can extract a silhouette from a single QVGA image in 100 milliseconds, with performance dramatically decreasing with increased resolution. Recent GPU implementations have been able to achieve performance of 6 milliseconds per image by exploiting the intrinsic properties of the lattice graphs and the hardware model of the GPU. However, these methods are restricted to a subclass of lattice graphs and are not generally applicable. We propose a novel method for graph cuts on the GPU which places no limits on graph configuration and which is able to achieve comparable real-time performance in online video processing scenarios.
Spatio-temporal variations of vehicle traffic in VANETs: facts and implications
Authors: Fan Bai, Bhaskar Krishnamachari
Venue: Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking (2009)

Via statistical analysis of several sets of empirical data collected from realistic scenarios, we realize that exponential model is a good fit for highway vehicle traffic. This model provides a single parameter (the exponent of vehicle density λs) to describe traffic variation. We reveal that highway traffic drastically varies over time (of different scales), across geographic locations and over technology adoption phases. Considering multi-hop geocast and single-hop broadcast, we show via both mathematical analysis and simulations the performance of path availability in the former, and packet delivery ratio in the latter, with respect to short- and long-term traffic variation. Therefore, we argue that the critical challenge in vehicular networking is dealing with traffic variation over the small scale (due to differences in vehicular density over space and time) and over the long term (due to market penetration).
Prediction in Dynamic SDRAM Controller Policies
Authors: Ying Xu, Aabhas S. Agarwal, Brian T. Davis
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

Memory access latency can limit microcontroller system performance. SDRAM access control policies impact latency through SDRAM device state. It is shown that execution time can be reduced by using a state machine which predicts, for each access, the policy which will minimize latency. Two-level dynamic predictors are incorporated into the SDRAM controller. A range of organizations for dynamic predictors are described, and the performance improvements predicted by simulation are compared using execution time and prediction accuracy as metrics. Results show that predictive SDRAM controllers, reduce execution time by 1.6% to 17% over static access control policies. The prediction accuracy of the best predictor results in 93% prediction accuracy, with 87% accuracy for OP state preferred accesses, and 96% for CPA state preferred accesses. Results show that execution time is strongly correlated to the prediction accuracy of OP, suggesting directions for future predictor development.
Modeling task experience in user assistance systems
Authors: Andrea E. Kohlhase, Michael Kohlhase
Venue: Proceedings of the 27th ACM international conference on Design of communication (2009)

One of the major issues for user assistance systems consists of "providing help at an appropriate level". In this paper we analyze the problem of modeling task experience - a prerequisite for provisioning adequate help. In contrast to level-based approaches we propose an ontology-based model, which allows fine-grained modeling of task experience using the concepts of the task domain as granules. The model is semantic in the sense that it allows to take advantage of the relations between concepts to provide novel semantic services and interactions. We present the SACHS (Semantic Annotations for a Controlling Help System, a semantic help system for a spreadsheet-based financial controlling system) software as an exemplary application of the proposed task experience model.
On the partial observability of temporal uncertainty
Authors: Michael D. Moffitt
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

We explore a means to both model and reason about partial observability within the scope of constraint-based temporal reasoning. Prior studies of uncertainty in Temporal CSPs have required the realization of all exogenous processes to be made entirely visible to the agent. We relax this assumption and propose an extension to the Simple Temporal Problem with Uncertainty (STPU), one in which the executing agent is made aware of the occurrence of only a subset of uncontrollable events. We argue that such a formalism is needed to encode those complex environments whose external phenomena share a common, hidden source of temporal causality. After characterizing the levels of controllability in the resulting Partially Observable STPU and various special cases, we generalize a known family of reduction rules to account for this relaxation, introducing the properties of extended contingency and sufficient observability. We demonstrate that these modifications enable a polynomial filtering algorithm capable of determining a local form of dynamic controllability; however, we also show that there do remain some instances whose global controllability cannot yet be correctly identified by existing inference rules, leaving the true computational complexity of dynamic controllability an open problem for future research.