ppxscal/embedding_network huggingface dataset:
There Exist Some ω-Powers of Any Borel Rank
Authors: Olivier Finkel, Dominique Lecomte
Venue: Proceedings of the 21st international workshop and the 16th Annual Conference of the EACSL on Computer Science Logic (2007)

The operation V ¿V ¿ is a fundamental operation over finitary languages leading to ¿-languages. Since the set Σ ¿ of infinite words over a finite alphabet Σ can be equipped with the usual Cantor topology, the question of the topological complexity of ¿-powers of finitary languages naturally arises and has been posed by Niwinski [Niw90], Simonnet [Sim92] and Staiger [Sta97a] . It has been recently proved that for each integer n ¿ 1, there exist some ¿-powers of context free languages which are ${\bf \Pi}_n^0$-complete Borel sets,[Fin01], that there exists a context free language L such that L ¿ is analytic but not Borel,[Fin03] , and that there exists a finitary language V such that V ¿ is a Borel set of infinite rank, [Fin04]. But it was still unknown which could be the possible infinite Borel ranks of ¿-powers.We fill this gap here, proving the following very surprising result which shows that ¿-powers exhibit a great topological complexity: for each non-null countable ordinal ¿, there exist some -complete ¿-powers, and some -complete ¿-powers.
Generalized Joint Linear Complexity of Linear Recurring Multisequences
Authors: Wilfried Meidl, Ferruh Özbudak
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

The joint linear complexity of multisequences is an important security measure for vectorized stream cipher systems. Extensive research has been carried out on the joint linear complexity of N-periodic multisequences using tools from Discrete Fourier transform. Each N-periodic multisequence can be identified with a single N-periodic sequence over an appropriate extension field. It has been demonstrated that the linear complexity of this sequence, the so called generalized joint linear complexity of the multisequence, may be considerably smaller than the joint linear complexity, which is not desirable for vectorized stream ciphers. Recently new methods have been developed and results of greater generality on the joint linear complexity of multisequences consisting of linear recurring sequences have been obtained. In this paper, using these new methods, we investigate the relations between the generalized joint linear complexity and the joint linear complexity of multisequences consisting of linear recurring sequences.
An Ontology-Based Index to Retrieve Documents with Geographic Information
Authors: Miguel R. Luaces, Jose R. Paramá, Oscar Pedreira, Diego Seco
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

Both Geographic Information Systems and Information Retrieval have been very active research fields in the last decades. Lately, a new research field called Geographic Information Retrieval has appeared from the intersection of these two fields. The main goal of this field is to define index structures and techniques to efficiently store and retrieve documents using both the text and the geographic references contained within the text.We present in this paper a new index structure that combines an inverted index, a spatial index, and an ontology-based structure. This structure improves the query capabilities of other proposals. In addition, we describe the architecture of a system for geographic information retrieval that uses this new index structure. This architecture defines a workflow for the extraction of the geographic references in the document.
Entering the petaflop era: the architecture and performance of Roadrunner
Authors: Kevin J. Barker, Kei Davis, Adolfy Hoisie, Darren J. Kerbyson, Mike Lang, Scott Pakin, Jose C. Sancho
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

Roadrunner is a 1.38 Pflop/s-peak (double precision) hybrid-architecture supercomputer developed by LANL and IBM. It contains 12,240 IBM PowerXCell 8i processors and 12,240 AMD Opteron cores in 3,060 compute nodes. Roadrunner is the first supercomputer to run Linpack at a sustained speed in excess of 1 Pflop/s. In this paper we present a detailed architectural description of Roadrunner and a detailed performance analysis of the system. A case study of optimizing the MPI-based application Sweep3D to exploit Roadrunner's hybrid architecture is also included. The performance of Sweep3D is compared to that of the code on a previous implementation of the Cell Broadband Engine architecture---the Cell BE---and on multi-core processors. Using validated performance models combined with Roadrunner-specific microbenchmarks we identify performance issues in the early pre-delivery system and infer how well the final Roadrunner configuration will perform once the system software stack has matured.
Incorporating Emotion Regulation into Virtual Stories
Authors: Tibor Bosse, Matthijs Pontier, Ghazanfar F. Siddiqui, Jan Treur
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

This paper presents an approach to incorporate emotion regulation as addressed within psychology literature into virtual characters. To this end, first Gross' informal theory of emotion regulation has been formalised using a dynamical system style modelling approach. Next, a virtual environment has been created, involving a number of virtual agents, which have been equipped with the formalised model for emotion regulation. This environment has been used to successfully generate a number of emergent virtual stories, in which characters regulate their emotions by applying regulation strategies such as situation selection and attentional deployment. The behaviours shown in the stories were found consistent with descriptions of human regulation processes.
Estimation Using Differential Evolution for Optimal Crop Plan
Authors: Millie Pant, Radha Thangaraj, Deepti Rani, Ajith Abraham, Dinesh Kumar Srivastava
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

This paper presents an application of Differential Evolution (DE) to determine optimal crop plan for command area of Pamba-Achankovil-Vaippar (PAV) link project, so as to maximize the net irrigation benefit. The mathematical model of the problem is linear in nature subject to various constraints due to availability of total land area, water, fertilizers, seeds and manure, etc. Numerical results show that DE gives a better performance in comparison to the usual software tools used for solving such problems.
Amongst First-Class Protocols
Authors: Tim Miller, Jarred Mcginnis
Venue: Engineering Societies in the Agents World VIII: 8th International Workshop, ESAW 2007, Athens, Greece, October 22-24, 2007, Revised Selected Papers (2008)

The ubiquity of our increasingly distributed and complex computing environments have necessitated the development of programming approaches and paradigms that can automatically manage the numerous tasks and processes involved. Hence, research into agency and multi-agent systems are of more and more interest as an automation solution. Coordination becomes a central issue in these environments. The most promising approach is the use of interaction protocols. Interaction protocols specify the interaction or social norms for the participating agents. However the orthodoxy see protocols as rigid specifications that are defined a priori. A recent development in this field of research is the specification of protocols that are treated as first-class computational entities. This paper explores the most prominent approaches and compares them.
Incremental and Interactive Integrator Tools for Design Product Consistency
Authors: S. Becker, M. Nagl, B. Westfechtel
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

Design processes in chemical engineering are inherently complex. Various aspects of the plant to be designed are modeled in different logical documents using heterogeneous tools. There are a lot of fine-grained dependencies between the contents of these documents. Thus, if one document is changed, these changes have to be propagated to all dependent documents in order to restore mutual consistency.In current development processes, these dependencies and the resulting consistency relationships have to be handled manually by the engineers without appropriate tool support in most cases. Consequently, there is a need for incremental integrator tools which assist developers in consistency maintenance. We realized a framework for building such tools. The tools are based on models of the related documents and their mutual relationships. Realization of integrators and their integration with existing tools is carried out using graph techniques.
Working Memory for Visual and Haptic Targets: A Study Using the Interference Paradigm
Authors: Manuel Sebastián, Julia Mayas, Antonio J. Manso, Soledad Ballesteros
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

We investigated the effect of different types of interference in visual and haptic working memory using a dual-task paradigm. At encoding, 16 young adults performed both, a haptic and a visual primary task followed by the performance of a secondary interference task during a retention interval. The interference task could be a haptic (spatial), visual (spatial), auditory, or control (visual-static) task. The idea was to study the influence of spatial and verbal interference on working memory for spatial targets encoded visually or haptically. The results indicated that the auditory interference task did not deteriorate performance compared to the control condition in which participants performed the visual-static task. The negative effects of spatial interference increased when both the primary and secondary tasks were performed using the same modality. Spatial interference selectively deteriorated both visual and haptic working memory but more strongly the later.
Approximate reasoning in the algebra of bounded rational agents
Authors: Eugene Eberbach
Venue: International Journal of Approximate Reasoning (2008)

In this paper, we generalize the utility theory to allow to use various performance measures, including utilities, costs and fitness, and probability theory we extend to uncertainty theory, including probabilities, fuzzy sets and rough sets. The decision theory is defined typically as the combination of utility theory and probability theory. We generalize the decision theory as the performance measure theory and uncertainty theory. Bounded rational agents look for approximate optimal decisions under bounded resources and uncertainty. The $-calculus process algebra for problem solving applies the cost performance measures to converge to optimal solutions with minimal problem solving costs, and allows to incorporate probabilities, fuzzy sets and rough sets to deal with uncertainty and incompleteness. The approach is illustrated to find the optimal solutions with or without uncertainty. The same approach can be used to find solutions of the totally optimization problem, representing the tradeoff between the best quality and least costly solutions.
The Falcon programming language in a nutshell
Authors: Giancarlo Niccolai
Venue: Linux Journal (2008)

Messages can carry anything, including methods or whole Sigma sequences for remote execution in foreign objects.
Text summarization evaluation: correlation human performance on an extrinsic task with automatic intrinsic metrics
Authors: Bonnie J. Dorr
Venue:  (2007)

Text summarization evaluation is the process of assessing the quality of an individual summary produced by human or automatic methods. Many techniques have been proposed for text summarization and researchers require an easy and uniform method for evaluation of their summarization systems. Human evaluations are often costly, labor-intensive and time-consuming, but are known to produce the most accurate results. Automatic evaluations are fast, easy to use and reusable, but the quality of their results have not been independently shown to be similar to that of human evaluations. This thesis introduces a new human task-based summarization evaluation measure called Relevance Prediction that is a more intuitive measure of an individual's performance on a real-world task than agreement based on external judgments. Relevance Prediction parallels what a user does in the real world task of browsing a set of documents using standard search tools, i.e., the user judges relevance based on a short summary and then that same user&mdash;not an independent user&mdash;decides whether to open (and judge) the corresponding document. This measure is shown to be a more reliable measure of task performance than LDC Agreement, a current external gold-standard based measure used in the summarization evaluation community. Six experimental studies are conducted to examine the existence of correlations between the human task-based evaluations of text summarization and the output of current intrinsic automatic evaluation metrics. The experimental results indicate that moderate, yet consistent correlations exist between the Relevance-Prediction method and the ROUGE metric for single-document summarization. This work also formally establishes the usefulness of text summarization in reducing task time while maintaining a similar level of task judgment accuracy as seen with the full text documents.
Motion coordination for mobile robotic networks with visibility sensors
Authors: Francesco Bullo
Venue:  (2007)

The subject of this dissertation is motion coordination for mobile robotic networks with visibility sensors. Such networks consist of robotic agents equipped with sensors that can measure distances to the environment boundary and to other agents within line of sight. We look at two fundamental coordination problems: (i) deploying over an unknown nonconvex environment to achieve complete visibility, and (ii) gathering all agents initially scattered over the environment at a single location. As a special case of problem (i), we first address the problem of optimally locating a single robotic agent in a nonconvex environment. The agent is modeled as a point mass with continuous first-order dynamics. We propose a nonsmooth gradient algorithm for the problem of maximizing the area of the region visible to the observer in a non-self-intersecting nonconvex polygon. First, we show that the visible area is almost everywhere a locally Lipschitz function of the observer location. Second, we provide a novel version of the LaSalle Invariance Principle for discontinuous vector fields and for Lyapunov functions with a finite number of discontinuities. Finally, we establish the asymptotic convergence properties of the nonsmooth gradient algorithm and we illustrate numerically its performance. Second, we address problem (i) by proposing a novel algorithm to the deploy a group of robotic agents in an unknown nonconvex environment to achieve complete visibility. The agents are point masses with discrete-time first-order dynamics. The agents operate asynchronously and two agents can communicate when mutually visible. We also address this deployment problem under the additional constraint that the visibility graph of the final agent locations is connected. We provide distributed algorithms that are guaranteed to solve the two deployment problems if a sufficient number of agents is available. Remarkably, this number is identical to the upper bound established in the famous art gallery problem, i.e., the number of agents sufficient to achieve complete visibility in a known environment through centralized computation. We additionally provide time complexity bounds for the proposed algorithms. Third, we address problem (ii) by proposing a novel motion coordination algorithm for a group of robotic agents to achieve rendezvous, that is, to move to a common location inside a nonconvex environment. The robots move synchronously in discrete time, they have a range-limited visibility sensor, and no communication ability is required. The algorithm is designed using the notions of robust visibility, connectivity-preserving constraint sets, and proximity graphs. We rigorously establish the correctness of the algorithm and we illustrate through simulations the algorithm's performance in asynchronous setups with sensor measurement and control errors.
A new criterion for global robust stability of interval delayed neural networks
Authors: Vimal Singh
Venue: Journal of Computational and Applied Mathematics (2008)

A novel criterion for the global robust stability of Hopfield-type interval neural networks with delay is presented. An example showing the effectiveness of the present criterion is given.
An Analysis of Bloggers, Topics and Tags for a Blog Recommender System
Authors: Conor Hayes, Paolo Avesani, Uldis Bojars
Venue: From Web to Social Web: Discovering and Deploying User and Content Profiles: Workshop on Web Mining, WebMine 2006, Berlin, Germany, September 18, 2006. Revised Selected and Invited Papers (2007)

Over the past few years the web has experienced an exponential growth in the use of weblogs or blogs, web sites containing journal-style entries presented in reverse chronological order. In this paper we provide an analysis of the type of recommendation strategy suitable for this domain. We introduce measures to characterise the blogosphere in terms of blogger and topic drift and we demonstrate how these measures can be used to construct a plausible explanation for blogger behaviour. We show that the blog domain is characterised by bloggers moving frequently from topic to topic and that blogger activity closely tracks events in the real world. We then demonstrate how tag cloud information within each cluster allows us to identify the most topic-relevant and consistent blogs in each cluster. We briefly describe how we plan to integrate this work within the SIOC framework.
Graph Transformation Units --- An Overview
Authors: Hans-Jörg Kreowski, Sabine Kuske, Grzegorz Rozenberg
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

In this paper, we give an overview of the framework of graph transformation units which provides syntactic and semantic means for analyzing, modeling, and structuring all kinds of graph processing and graph transformation.
Linking Programs to Architectures: An Object-Oriented Hierarchical Software Model Based on Boxes
Authors: Jan Schäfer, Markus Reitz, Jean-Marie Gaillourdet, Arnd Poetzsch-Heffter
Venue: The Common Component Modeling Example: Comparing Software Component Models (2007)

Modeling software systems has several purposes. The model provides a communication means between developers, a backbone to specify and check properties of the system, and a structure to organize, explain, and develop the implementation of the system. The focus of our approach is to address these purposes for hierarchically structured, object-oriented software systems. The hierarchical structure refers to the component instances at runtime: a runtime component may consist of a dynamically changing number of objects and other runtime components. Our modeling technique builds on and extends the concepts of class-based object-oriented languages. Runtime components are created by instantiating box classes. The modeling technique provides ports to tame object references and aliasing and to decouple components from their environment. It supports dynamic linkage, i.e. ports can be connected and disconnected at runtime. The used concurrency model is based on the join calculus.
More Bang For the Bug: An Account of 2003's Attack Trends
Authors: Ivan Arce
Venue: IEEE Security and Privacy (2004)

In this issue's Attack Trends, I will examine a handful of the more than 3,000 unique vulnerabilities and 115,000 security incidents reported in 2003 and do my best to predict information security woes for 2004. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Detecting Stepping-Stone Intrusion and Resisting Evasion through TCP/IP Packets Cross-Matching
Authors: Jianhua Yang, Byong Lee
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

In this paper, we propose a cross-matching algorithm that can detect stepping-stone intrusion. The theoretical analysis of this algorithm shows that it can completely resist intruder's time-jittering evasion. The results of the experiments and the simulation show that this algorithm can also resist intruders' chaff-perturbation with chaff-rate up to 80%. Compared with A. Blum's approach, which can resist chaff-perturbation with every x inserted packets out of 8*(x+1), this approach has promising performance in terms of resistance to intruders' manipulation.
Qualification of Fuzzy Statements Under Fuzzy Certainty
Authors: A. González, N. Marín, O. Pons, M. A. Vila
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

In many problems the information can be imprecise and uncertain simultaneously. Linguistic terms can be then used to represent each one of these aspects. In some applications it is desirable to combine imprecision and uncertainty into a single value which appropriately describes the original information. We propose a method to combine imprecision and uncertainty when they are expressed as trapezoidal fuzzy numbers and the final goal is to obtain a normalized fuzzy number. This property is very useful in several applications like flexible querying processes, where the linguistic label used in the query is always normalized.
M-Geocast: Robust and Energy-Efficient Geometric Routing for Mobile Sensor Networks
Authors: Lynn Choi, Jae Kyun Jung, Byong-Ha Cho, Hyohyun Choi
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

In this paper we investigate a practical routing solution for a new class of wireless sensor networks where any node can be mobile anytime. Assuming GPS-enabled sensor nodes we propose a new geometric routing protocol called M-Geocast that is designed to efficiently support node mobility as well as location service for such mobile sensor networks. Unlike existing geometric routing schemes, M-Geocast can also discover a non-geometric path to the destination by exploiting the path history of location updates. Thus, the routing void can be minimized by alternating the two. In addition, M-Geocast employs two location-based optimizations to further reduce the overhead of on-demand route discovery on inevitable routing voids. Through detailed NS-2 simulations we demonstrate that M-Geocast can not only increase network performance but can also reduce energy consumption compared to the existing protocols based on on-demand route discovery or a plain geometric routing.