ppxscal/embedding_network huggingface dataset:
Speech acts, commitment and multi-agent communication
Authors: Rodger Kibble
Venue: Computational Mathematical Organization Theory (2006)

The principle aim of this paper is to reconsider the suitability of Austin and Searle's Speech Act theory as a basis for agent communication languages. Two distinct computational interpretations of speech acts are considered: the standard "mentalistic" approach associated with the work of Cohen and Levesque which involves attributing beliefs and intentions to artificial agents, and the "social semantics" approach originating (in the context of MAS) with Singh which aims to model commitments that agents undertake as a consequence of communicative actions. Modifications and extensions are proposed to current commitment-based analyses, drawing on recent philosophical studies by Brandom, Habermas and Heath. A case is made for adopting Brandom's framework of normative pragmatics, modelling dialogue states as deontic scoreboards which keep track of commitments and entitlements that speakers acknowledge and hearers attribute to other interlocutors. The paper concludes by outlining an update semantics and protocol for selected locutions.
Decision Trees for Functional Variables
Authors: Suhrid Balakrishnan, David Madigan
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Classification problems with functionally structured in- put variables arise naturally in many applications. In a clinical domain, for example, input variables could include a time series of blood pressure measurements. In a financial setting, different time series of stock returns might serve as predictors. In an archaeological application, the 2-D pro- file of an artifact may serve as a key input variable. In such domains, accuracy of the classifier is not the only reason- able goal to strive for; classifiers that provide easily inter- pretable results are also of value. In this work, we present an intuitive scheme for extending decision trees to handle functional input variables. Our results show that such deci- sion trees are both accurate and readily interpretable.
Information Integration for Situation Awareness
Authors: Jonathan Manternach, Tom Broadstock
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

The Air Force Research Laboratory continues to investigate technologies for improved situational awareness (SA) by developing a testbed for evaluating SA concepts and capabilities. Information Integration for Situational Awareness (IISA) is a collaborative framework that allows distributed, disparate users and resources to create and share a common understanding of the battlespace. The foundation of this framework is a message-oriented middleware that serves as an information repository and provides publish and subscribe services to push information to clients that require it. IISA clients plug into the framework via interfaces defined by Extensible Markup Language (XML) Schema, thus providing loose coupling and ease of integration. IISA envisions a wide variety of clients, both automated and user-based, to collect, refine, and distribute battlespace information. Clients connect realworld systems to IISA, including elements of command and control (C2) and intelligence, surveillance, and reconnaissance (ISR). IISA leverages modeling and simulation technologies to stimulate the testbed with synthetic battlefield information in the absence of realworld systems. The first phase of IISA development has been demonstrated in the context of an operations other than war (OOTW) scenario involving counter-insurgency operations in an urban setting. Key features of this phase of development include a flexible map viewer client and a simulation gateway. This baseline serves as a point of departure for continuing research in areas such as machine-to-machine process automation, adversarial modeling and prediction, and information distribution from unattended ground sensors (UGS). The ongoing development of IISA promises valuable lessons to support key initiatives such as predictive battlespace awareness and effects-based operations.
Demodulation of noisy phase or frequency modulated signals with Kalman filters
Authors: O. Loffeld
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

The paper addresses the problem of estimating the argument of a phase or frequency modulated sinusoidal signal of unknown amplitude in the presence of additive Gaussian white noise of known variance. It is assumed that a state space model for both the unknown phase and the unknown amplitude is available either as an exact or approximate description of the reality. The problem is solved by an extended linearised Kalman filter. The basic idea of using extended Kalman filters was previously described but has not been used to perform simultaneous amplitude and phase demodulation.
A Semantic Web ontology for context-based classification and retrieval of music resources
Authors: Alfio Ferrara, Luca A. Ludovico, Stefano Montanelli, Silvana Castano, Goffredo Haus
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2006)

In this article, we describe the MX-Onto ontology for providing a Semantic Web compatible representation of music resources based on their context. The context representation is realized by means of an OWL ontology that describes music information and that defines rules and classes for a flexible genre classification. By flexible classification we mean that the proposed approach enables capturing the subjective interpretation of music genres by defining multiple membership relations between a music resource and the corresponding music genres, thus supporting context-based and proximity-based search of music resources.
An argumentation based approach for practical reasoning
Authors: Iyad Rahwan, Leila Amgoud
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We build on recent work on argumentation frameworks for generating desires and plans. We provide a rich instantiation of Dung's abstract argumentation framework for (i) generating consistent desires; and (ii) generating consistent plans for achieving these desires. This is done through three distinct argumentation frameworks: one (now standard) for arguing about beliefs, one for arguing about what desires the agent should adopt, and one for arguing about what plans to intend in order to achieve the agent's desires. More specifically, we refine and extend existing approaches by providing means for comparing arguments based on decision-theoretic notions (cf. utility). Thus, the worth of desires and the cost of resources are integrated into the argumentation frameworks and taken into account when comparing arguments.
Lions-Schechter's methods of complex interpolation and some quantitative estimates
Authors: Ming Fan
Venue: Journal of Approximation Theory (2006)

Some quantitative estimates concerning multi-dimensional rotundity, weak noncompactness, and certain spectral inequalities are formulated for Lions-Schechter's complex methods of interpolation with derivatives.
Recognizing Facial Expressions in Videos Using a Facial Action Analysis-Synthesis Scheme
Authors: Fadi Dornaika, Bogdan Raducanu
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

In this paper, we propose a novel approach for facial expression analysis and recognition. The proposed approach relies on tracked facial actions provided by an appearance-based 3D face tracker. For each universal expression, a dynamical model for facial actions given by an auto-regressive process is learned from training data. We classify a given image in an unseen video into one of the universal facial expression categories using an analysis-synthesis scheme. This scheme uses all models and select the one that provides the most consistent synthesized spatio-temporal facial actions. The dynamical models can be utilized in the tasks of synthesis and prediction. Experiments using unseen videos demonstrated the effectiveness of the developed method.
Local Reference Frames vs. Global Reference Frame for Mobile Robot Localization and Path Planning
Authors: M. Alencastre-Miranda, L. Munoz-Gomez, R. Murrieta-Cid, R. Monroy
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

This work aims at two major goals: i) to estimate the position of a mobile robot under sensor and control errors; and ii) to provide a motion strategy that outputs a path so that the strategy diminishes the uncertainty about the robot's position both while the robot is moving along the output path and when the robot reaches a goal location. To diminish uncertainty, the path planning strategy switches between reference frames whenever required. We have found out that, for our sensor models, determining the robot position using a set of local reference frames generally yields a smaller position uncertainty than that associated with a global reference frame. To efficiently compute the robot path we use a greedy algorithm in a reduced search space that is able to explore several steps ahead without incurring in too high a computational cost.
Real-Time and Interactive Water Simulation using Precomputed Navier-Stokes Equation
Authors: Kim Tae-yi, Kim Tae-yong
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

As computer gets more faster, developers apply more complex physics theory to games. But water simulation in games is limited to render realistically. Water in games flows periodically and Floating object doesn't move depending on flow direction. Because it takes much time to simulate water, many physic methods cannot be applied to a game. This paper suggests a real time water simulation method by precomputed algorithm. This suggestion ensures real time and can interact floating objects realistically.
Interaction of Face and Voice Areas during Speaker Recognition
Authors: Katharina Von Kriegstein, Andreas Kleinschmidt, Philipp Sterzer, Anne-Lise Giraud
Venue: Journal of Cognitive Neuroscience (2005)

Face and voice processing contribute to person recognition, but it remains unclear how the segregated specialized cortical modules interact. Using functional neuroimaging, we observed cross-modal responses to voices of familiar persons in the fusiform face area, as localized separately using visual stimuli. Voices of familiar persons only activated the face area during a task that emphasized speaker recognition over recognition of verbal content. Analyses of functional connectivity between cortical territories show that the fusiform face region is coupled with the superior temporal sulcus voice region during familiar speaker recognition, but not with any of the other cortical regions normally active in person recognition or in other tasks involving voices. These findings are relevant for models of the cognitive processes and neural circuitry involved in speaker recognition. They reveal that in the context of speaker recognition, the assessment of person familiarity does not necessarily engage supramodal cortical substrates but can result from the direct sharing of information between auditory voice and visual face regions.
Multi-Agent Based Prototyping of Agriculture Robots
Authors: V. Arguenon, A. Bergues-Lagarde, C. Rosenberger, P. Bro, W. Smari
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

In this paper, we propose a multi-agents system for the simulation of prototypes for different agriculture robots that can be employed in the harvesting of a vineyard. We show that this prototyping method works well and is appropriate for a system involving several robots. We present the behaviors of each robot, their interactions and some scenarios for the testing of the system. Of specific interest is the cooperative behavior of the robots in such a task. Preliminary results indicate that some optimal choices toward the development of the harvesting system can be correctly identified based on these simulations. The choices can then be used when designing and building the system prototype.
Exploring Solutions for a MobileWeb
Authors: Henrik Stormer
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

With the rise of mobile devices like cell phones and personal digital assistants (PDAs) in the last years, the demand for specialized mobile solutions grows. One key application for mobile devices is the Web service. Currently, almost all Web sites are designed for stationary computers and cannot be shown directly on mobile devices because of their limitations. These include a smaller display size, delicate data input facilities and smaller bandwidth compared to stationary devices. To overcome the problems and enableWeb sites also for mobile devices, a number of different approaches exist. This paper compares different ways to adapt existing web sites for mobile devices. The following three methods are generally used today: Rewrite the page, use an automatic generator to create the page, or try to use the same page for stationary and mobile devices. This paper illustrates each method by adapting two pages of the electronic shop software eSarine. Afterwards, the methods are compared using different parameters like the complexity of the approach or the ease of integration in existing systems.
Designing the Right Wiretap Solution: Setting Standards under CALEA
Authors: Albert Gidari
Venue: IEEE Security and Privacy (2006)

The US Federal Communications Commission recently extended the CommunicationsAssistance for Law Enforcement Act (CALEA) to include VoIP and broadband ISPs. Lawenforcement and the telecommunications industry must work together to set CALEA-compliant standards.
Concept Covering for Automated Building Blocks Selection based on Business Processes Semantics
Authors: Francesco di Cugno, Tommaso Di Noia, Eugenio Di Sciascio, Azzurra Ragone
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

In this paper we present a novel approach and a system for automated selection of building blocks, by exploiting business processes semantics. The selection process is based on a novel greedy concept covering algorithm, which computes, given a description of the request, the set of needed building blocks. If such a set does not exist the algorithm returns the covered subset and explanation information on both the left uncovered part and conflicting part of the request description, exploiting non-standard inference services. The requested description can be expressed as conjunction of mandatory requirements and preferences. The approach has been deployed in a system specifically designed for SAP R/3 best practices reusability, which is fully functional and is currently being evaluated in an industrial setting.
Anterior Cingulate and the Monitoring of Response Conflict: Evidence from an fMRI Study of Overt Verb Generation
Authors: Deanna M. Barch, Todd S. Braver, Fred W. Sabb, Douglas C. Noll
Venue: Journal of Cognitive Neuroscience (2000)

Studies of a range of higher cognitive functions consistently activate a region of anterior cingulate cortex (ACC), typically posterior to the genu and superior to the corpus collosum. In particular, this ACC region appears to be active in task situations where there is a need to override a prepotent response tendency, when responding is underdetermined, and when errors are made. We have hypothesized that the function of this ACC region is to monitor for the presence of "crosstalk" or competition between incompatible responses. In prior work, we provided initial support for this hypothesis, demonstrating ACC activity in the same region both during error trials and during correct trials in task conditions designed to elicit greater response competition. In the present study, we extend our testing of this hypothesis to task situations involving underdetermined responding. Specifically, 14 healthy control subjects performed a verb-generation task during event-related functional magnetic resonance imaging (fMRI), with the on-line acquisition of overt verbal responses. The results demonstrated that the ACC, and only the ACC, was more active in a series of task conditions that elicited competition among alternative responses. These conditions included a greater ACC response to: (1) Nouns categorized as low vs. high constraint (i.e., during a norming study, multiple verbs were produced with equal frequency vs. a single verb that produced much more frequently than any other); (2) the production of verbs that were weak associates, rather than, strong associates of particular nouns; and (3) the production of verbs that were weak associates for nouns categorized as high constraint. We discuss the implication of these results for understanding the role that the ACC plays in human cognition.
Global distance-based segmentation of trajectories
Authors: Aris Anagnostopoulos, Michail Vlachos, Marios Hadjieleftheriou, Eamonn Keogh, Philip S. Yu
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primitives that are better suited for storage and retrieval purposes. Previous work on trajectory segmentation attacked the problem locally, segmenting separately each trajectory of the database. Therefore, they did not directly optimize the inter-object separability, which is necessary for mining operations such as searching, clustering, and classification on large databases. In this paper we analyze the trajectory segmentation problem from a global perspective, utilizing data aware distance-based optimization techniques, which optimize pairwise distance estimates hence leading to more efficient object pruning. We first derive exact solutions of the distance-based formulation. Due to the intractable complexity of the exact solution, we present anapproximate, greedy solution that exploits forward searching of locally optimal solutions. Since the greedy solution also imposes a prohibitive computational cost, we also put forward more light weight variance-based segmentation techniques, which intelligently "relax" the pairwise distance only in the areas that affect the least the mining operation.
Measurement-based models of delivery and interference in static wireless networks
Authors: Charles Reis, Ratul Mahajan, Maya Rodrig, David Wetherall, John Zahorjan
Venue: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications (2006)

We present practical models for the physical layer behaviors of packet reception and carrier sense with interference in static wireless networks. These models use measurements of a real network rather than abstract RF propagation models as the basis for accuracy in complex environments. Seeding our models requires N trials in an N node network, in which each sender transmits in turn and receivers measure RSSI values and packet counts, both of which are easily obtainable. The models then predict packet delivery and throughput in the same network for different sets of transmitters with the same node placements. We evaluate our models for the base case of two senders that broadcast packets simultaneously. We find that they are effective at predicting when there will be significant interference effects. Across many predictions, we obtain an RMS error for 802.11a and 802.11b of a half and a third, respectively, of a measurement-based model that ignores interference.
A Generic Time Hierarchy for Semantic Models with One Bit of Advice
Authors: Dieter van Melkebeek, Konstantin Pervyshev
Venue: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (2006)

We show that for any reasonable semantic model of computation and for any positive integer a and rationals 1 \leqslantc \le d, there exists a language computable in time n^d with a bits of advice but not in time n^c with a bits of advice. A semantic model is one for which there exists a computable enumeration that contains all machines in the model but may also contain others. We call such a model reasonable if it has an efficient universal machine that can be complemented within the model in exponential time and if it is efficiently closed under deterministic transducers. Our result implies the first such hierarchy theorem for randomized machines with zero-sided error, quantum machines with one- or zero-sided error, unambiguous machines, symmetric alternation, Arthur-Merlin games of any signature, etc. Our argument yields considerably simpler proofs of known hierarchy theorems with one bit of advice for randomized and quantum machines with two-sided error. Our paradigm also allows us to derive stronger separation results in a unified way. For models that have an efficient universal machine that can be simulated deterministically in exponential time and that are efficiently closed under randomized reductions with two-sided error, we establish the following: For any constants a and c, there exists a language computable in polynomial time with one bit of advice but not in time n^c with a log n bits of advice. The result applies to randomized and quantum machines with two-sided error. For randomized machines with one-sided error, our approach yields that for any constants a and c there exists a language computable in polynomial time with one bit of advice but not in time n^c with a(log n)^1/c bits of advice.
Trustworthiness of Peers Based on Access Control in Peer-to-Peer Overlay Networks
Authors: Kenichi Watanabe, Yoshio Nakajima, Naohiro Hayashibara, Tomoya Enokido, Makoto Takizawa, S. Misbah Deen
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Service supported by an object in a peer-to-peer (P2P) overlay network is modeled to be a set of methods and quality of service (QoS). In addition to discovering a peer holding a target object, it is critical to discuss what peer is allowed to manipulate the target object in what method. In this paper, we take an acquaintance approach to finding and manipulating objects in P2P overlay networks. An acquaintance peer of a peer is a peer whose service the peer knows and with which the peer can directly communicate In this paper, we discuss ways to obtain results satisfying an access request by the cooperation of acquaintances. Acquaintance peers of a peer p may hold different information on target peers since it takes time to propagate change information of the target peers, and peers may be faulty. Here, it is critical to discuss how much a peer can trust each acquaintance. First, we define how much a requesting peer is satisfied for each access request issued to an acquaintance. Then, we define the trustworthiness of an acquaintance based on the satisfiability.