ppxscal/embedding_network huggingface dataset:
Robustness of temporal logic specifications
Authors: George J. Pappas
Venue:  (2008)

Temporal logic verification has been proven to be a successful tool for the analysis of software and hardware systems. For such systems, both the models and the logic are Boolean valued. In the past, similar successful results have been derived for timed and linear hybrid systems. Even though the states of these systems are real valued, temporal logics are still interpreted over Boolean signals that abstract away the actual values of the real-valued state variables. In this thesis, we advocate that in certain cases it is beneficial to define multi-valued semantics for temporal logics. That is, we consider a robust interpretation of Metric Temporal Logic (MTL) formulas over signals that take values in metric spaces. For such signals, which are generated by systems whose states are equipped with nontrivial metrics, for example continuous or hybrid, robustness is not only natural, but also a critical measure of system performance. The proposed multi-valued semantics for MTL formulas captures not only the usual Boolean satisfiability of the formula, but also topological information regarding the distance from unsatisfiability. This, in turn, enables the definition of robustness tubes that contain signals with the same temporal properties. The notion of robustness for MTL specifications can be applied to at least 3 important problems. The first problem is the verification of continuous time signals with respect to MTL specifications using only discrete time analysis. The motivating idea behind our approach is that if the continuous time signal fulfills certain conditions and the discrete time signal robustly satisfies the MTL specification, then the corresponding continuous time signal should also satisfy the same MTL specification. Second, the proposed robustness framework can be applied to the problem of bounded time temporal logic verification of dynamical systems. Our methodology has the distinctive feature that enables the verification of temporal properties of a dynamical system by checking only a finite number of its (simulated) trajectories. The interesting and promising feature of this approach is that the more robust the system is with respect to the temporal logic specification, the less is the number of simulations that are required in order to verify the system. Finally, the proposed definition of robustness for temporal logic specifications can be applied to the problem of automatic synthesis of hybrid systems. In particular, we address the problem of temporal logic motion planning for mobile robots that are modeled by second order dynamics. Temporal logic specifications can capture the usual control specifications such as reachability and invariance as well as more complex specifications like sequencing and obstacle avoidance. The resulting continuous time trajectory is provably guaranteed to satisfy the user specification.
Matrix inverse operation convolution: three models description
Authors: Consuelo V. Garcia, Jesus Medel
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

This paper gives a short introduction and a description that defines the basic inverse convolution operation structure and explains with short comments some of its applications in astronomy, microscopy and analysis of seismic measures. The second part presents formal convolution and inverse convolution operation concepts about various issues concerned: The first correspond to convolution as a matrix expands expression, which provides the necessary preamble to define the three models respect to inverse convolution operation Matrix suggested in this work. Requiring in probability manner the MSE (Mean Square Error), either the diagrams Decibels description into the proposed inverse convolution models operation in simulation graphs Finally, it shows in which of the three inverse convolutions operation methods simulated was the best convergence rate. Graphically speaking compared the inverse convolution operation signals respect to original signal before convolutioned. The convergence error functional was obtained respect to MSE, using the second probability moment and Decibels expression in recursive form. Analyzing the simulation results, could be concluded that the optimal inverse convolution operation was the good enough estimation methods, respect to the last two methods considered.
Computing minimum-area rectilinear convex hull and L-shape
Authors: Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa
Venue: Computational Geometry: Theory and Applications (2009)

We study the problems of computing two non-convex enclosing shapes with the minimum area; the L-shape and the rectilinear convex hull. Given a set of n points in the plane, we find an L-shape enclosing the points or a rectilinear convex hull of the point set with minimum area over all orientations. We show that the minimum enclosing shapes for fixed orientations change combinatorially at most O(n) times while rotating the coordinate system. Based on this, we propose efficient algorithms that compute both shapes with the minimum area over all orientations. The algorithms provide an efficient way of maintaining the set of extremal points, or the staircase, while rotating the coordinate system, and compute both minimum enclosing shapes in O(n^2) time and O(n) space. We also show that the time complexity of maintaining the staircase can be improved if we use more space.
Dynamic multimedia content allocation for scarce resource networks
Authors: Amit Pande, Amit Verma, Ankush Mittal, Ashish Agrawal
Venue: International Journal of Advanced Media and Communication (2009)

A serious bottleneck in multimedia e-learning is the non-availability of required bandwidth. While much research has been done on multimedia compression and network resource optimisation, multimedia delivery is still a big concern, especially for scarce resource networks. In this paper we incorporate network-information to determine how various parts of the video frames are encoded. An estimate of the available network bandwidth allows optimal resource sharing between the different frame constituents based on their relative importance and motion. While this scheme is operational for all low motion videos with identifiable Visual Objects (VO), we demonstrate the approach using educational videos.
Blackjack-playing agents in an advanced AI course
Authors: Jeffrey L. Popyack
Venue: ACM SIGCSE Bulletin (2009)

Blackjack is a multi-player card game in which each player makes a sequence of decisions based on a partially-observed game state that evolves under uncertainty. In its casino variant, Blackjack is typically played as a set of separate contests, each involving a player and the dealer, whose decisions are determined according to a published, fixed policy. We have developed and used a sequence of assignments for an advanced artificial intelligence course in which students determine an optimal strategy for Blackjack, modeled as a Markov Decision Process. The course culminates in a Blackjack tournament in which agents employ policies students have determined through their analyses.
A Simple Formalism for Capturing Reduplication in Finite-State Morphology
Authors: Mans Hulden, Shannon T. Bischoff
Venue: Proceeding of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008 (2009)

This paper presents a simple formalism for capturing reduplication phenomena in the morphology and phonology of natural languages. After a brief survey of the facts common in reduplicative elements cross-linguistically, these facts are described in terms of finite-state systems. The principal idea is that an operator can be derived to ensure equivalence of finite discontinuous strings at some level of representation.
Nearest Neighbor Convex Hull Classification Method for Face Recognition
Authors: Xiaofei Zhou, Yong Shi
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

In this paper, nearest neighbor convex hull (NNCH) classification approach is used for face recognition. In NNCH classifier, a convex hull of training samples of a class is taken as the distribution estimation of the class, and Euclidean distance from a test sample to the convex hull (the distance is called convex hull distance) is taken as the similarity measure for classification. Experiments on face data show that the nearest neighbor convex hull approach can lead to better results than those of 1-nearest neighbor (1-NN) classifier and SVM classifiers.
General spanning trees and reachability query evaluation
Authors: Yangjun Chen
Venue: Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering (2009)

Graph reachability is fundamental to a wide range of applications, including CAD/CAM, CASE, office systems, software management, as well as geographical navigation and internet routing. Many applications involve huge graphs and requires fast answering of reachability queries. Several reachability labeling methods have been proposed for this purpose. They assign labels to the nodes, such that the reachability between any two nodes can be determined using their labels only. In this paper, we propose a new data structure, called a general spanning tree of a directed acyclic graph (DAG) to minimize label space. Different from a traditional spanning tree, an edge in a general spanning tree T of a DAG G may corresponds to a path in G. That is, for each edge u &rarr; v in T, we have a path from u to v in G. An algorithm is discussed to find such a tree with the least number of leaf nodes in O(bn &radic;b) time, where n is the number of the nodes of G, and b is the number of the leaf nodes of T. It can be proven that b equals G's width, defined to be the size of a largest node subset U of G such that for every pair of nodes u, v &isin; U, there does not exist a path from u to v or from v to u. Based on T, we are able to reduce the label space to O(bn) with O(logb) reachability query time. Our method can also be extended for graphs containing cycles.
An Efficient and Robust Algorithm for Improving the Resolution of Video Sequences
Authors: Yubing Han, Rushan Chen, Feng Shu
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

An efficient and robust super-resolution reconstruction algorithm for video sequences is proposed. In this algorithm, the L1 and L2 norms are introduced to form the data fusion term according to whether there exits motion estimation, and a robust Bilateral-TV regularization term is added to overcome the ill-posed problem of super-resolution estimation. Furthermore, we propose the use of regularization functional instead of a constant regularization parameter. The regularization functional is defined in terms of the reconstructed image at each iteration step, therefore allowing for the simultaneous determination of its value and the reconstruction of the super-resolution image. The iteration scheme, convexity and control parameter are thoroughly studied. Experimental results demonstrate the power of the proposed method.
E-learning System Acceptance: Implications to Institutional Implementation Strategies
Authors: Will Wai-kit Ma, Allan Hoi-kau Yuen
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

Today, most universities have enhanced their classroom courses with online learning systems. However, studies still find organizational systems with specific low usage, compared with the large population within the universities. In order to suggest effective institutional implementation strategies in e-learning system deployment, a validated model framework is applied to a local private tertiary institution. 507 respondents (students) completed an online survey during the second year of the system deployment. Significant correlations were found for performance expectancy, effort expectancy, social influence, and facilitating conditions, in predicting and explaining intention to use of the system. Age and voluntariness were found significant moderator to the determinants; while gender and computer experience were found non-significant in the model. Based on the results, implementation strategies, including institutional issues, management issues, technological issues, pedagogical issues, ethical issues, interface design issues, resource support issues, and evaluation issues were discussed. Limitations and further research agenda were also suggested.
Concepts and Ontologies
Authors: Marie Duží, Pavel Materna
Venue: Proceeding of the 2009 conference on Information Modelling and Knowledge Bases XX (2009)

We introduce a new theory of concepts conceived as structured abstract entities. The theory is based on the key notion of Transparent Intensional Logic (TIL), known as TIL construction. The rich procedural semantics of TIL makes it possible to explicitly analyze all the semantically salient features of natural language expressions. We illustrate how to make use of TIL theory of concepts in distinguishing analytical and empirical concepts, and particular kinds of necessities. We also deal with a rigorous specification of requisite relations between intensions such as properties. Finally, ontology is characterised as a relatively stable part of the system that should play an integrating role. We show how to make use of TIL rich theory in specification of the content of ontologies in a multi-agent system.
Developing rules and criteria for rice ontology construction
Authors: Aree Thunkijjanukij, Asanee Kawtrakul, Supamard Panichsakpatana, Uamporn Veesommai
Venue: International Journal of Metadata, Semantics and Ontologies (2009)

The Rice Production Ontology (RPO) was constructed from scratch in consultation with domain-experts. This ontology covers the domain of rice production from cultivation to harvesting. Refinement in the loop was done by performing the transformation following the criteria validated by expert to improve the created ontology. The RPO contains 2322 concepts and 5603 terms in a system of hierarchical and 57 associative relations and provides an organisational framework that allows reasoning about rice production knowledge. From the study, eight criteria for constructing ontology and five rules for the semi-automatic maintenance were derived.
From IMS Management to SOA Based NGN Management
Authors: Niklas Blum, Thomas Magedanz, Florian Schreiner, Sebastian Wahle
Venue: Journal of Network and Systems Management (2009)

Although IP Multimedia Subsystem (IMS) based Next Generation Networks (NGNs) are already emerging as the common session control platform for converging fixed, mobile and cable networks, harmonized solutions for the management of these converged platforms have still got to be developed. This document describes a hands-on approach to NGN Management. Started with IMS specific management systems, succeeding research had to take into account the importance of the management of NGN SDPs as well. This work shows that the hybrid nature of an NGN, where services can be delivered at the IMS layer, by SIP signaling mechanisms, as well as at the SDP, via Web Services, requires a harmonized management approach. Taking into account Service Oriented Architecture (SOA) principles and policy based model driven architectures, this work shows that a unification of service composition and service management already at the workflow creation level, bares significant benefits in terms of automation and harmonization. Following the SOA paradigm, the approach presented here does not differentiate between business process management (BPM) and management process management. Focusing on Telemanagement Forum's enhanced Telecom Operations Map service fulfillment and service assurance operations, this document describes an New Generation Software and Services (NGOSS) based implementation of a unified Operation Support System (OSS) for NGNs that encompasses many problems of former stovepipe management solutions in terms of automation, flexibility and manageability.
Connections between the lines: augmenting social networks with text
Authors: Jonathan Chang, Jordan Boyd-Graber, David M. Blei
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Network data is ubiquitous, encoding collections of relationships between entities such as people, places, genes, or corporations. While many resources for networks of interesting entities are emerging, most of these can only annotate connections in a limited fashion. Although relationships between entities are rich, it is impractical to manually devise complete characterizations of these relationships for every pair of entities on large, real-world corpora. In this paper we present a novel probabilistic topic model to analyze text corpora and infer descriptions of its entities and of relationships between those entities. We develop variational methods for performing approximate inference on our model and demonstrate that our model can be practically deployed on large corpora such as Wikipedia. We show qualitatively and quantitatively that our model can construct and annotate graphs of relationships and make useful predictions.
CMAC-Based PID Control of an XY Parallel Micropositioning Stage
Authors: Qingsong Xu, Yangmin Li
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

This paper presents the controller design of an XY parallel micropositioning stage aiming at a sub-micron accuracy for micro scale manipulation. Owning to the decoupled design of the mechanism, a simple single-input-single-output (SISO) PID controller is adopted for each axis. To compensate for the hysteresis arising from piezoelectric actuator, credit assigned CMAC (cerebellar model articulation controller) neural network with adjustable learning rate is employed into the PID control. Experimental results show that the hysteresis of the stage has been significantly reduced by the CMAC-based PID controller and the stage can achieve a sub-micron positioning accuracy, which demonstrate the effectiveness of the designed controller as well.
Towards a Methodology for Engineering Self-Organising Emergent Systems
Authors: Tom De Wolf, Tom Holvoet
Venue: Proceeding of the 2005 conference on Self-Organization and Autonomic Informatics (I) (2005)

When designing self-organising emergent multi-agent systems (MASs), a fundamental engineering issue is to achieve a macroscopic behaviour that meets the requirements and emerges only from the behaviour of locally interacting agents. Agent-oriented methodologies today are mainly focussed on engineering the microscopic issues, i.e. the agents, their rules, how they interact, etc, without explicit support for engineering the required macroscopic behaviour. As a consequence, the macroscopic behaviour is achieved in an ad-hoc manner. This paper proposes a way to define a full life-cycle methodology based on an industry-ready software engineering process, i.e. the Unified Process, which is customised to explicitly focus on engineering macroscopic behaviour of self-organising emergent MASs. As such, the MAS paradigm is integrated into an existing and widely accepted methodology and we can systematically develop a solution that exhibits the required macroscopic behaviour.
Ramsey goodness and beyond
Authors: Vladimir Nikiforov, Cecil C. Rousseau
Venue: Combinatorica (2009)

In a seminal paper from 1983, Burr and Erd&#x0151;s started the systematic study of Ramsey numbers of cliques vs. large sparse graphs, raising a number of problems. In this paper we develop a new approach to such Ramsey problems using a mix of the Szemer&#x00e9;di regularity lemma, embedding of sparse graphs, Tur&#x00e1;n type stability, and other structural results. We give exact Ramsey numbers for various classes of graphs, solving five &#x2014; all but one &#x2014; of the Burr-Erd&#x0151;s problems.
Research challenges in future networks: a report from US-Japan workshop on future networks
Authors: Deep Medhi, Peter A. Freeman
Venue: ACM SIGCOMM Computer Communication Review (2009)

A US-Japan Workshop on Future Networks was held in Palo Alto, CA on October 31 - November 1, 2008. This workshop brought together leading US and Japanese network researchers and network research infrastructure developers who are interested in future networks. The focus was on research issues and experimental infrastructure to support research on future generation networks. The goal was to foster cooperation and communication between peers in the two countries. Through this workshop, a number of research challenges were identified. The workshop also made recommendations to: create a new funding mechanism to foster special collaborations in networking and experimentation, extend current national testbeds with international connectivity; and urge the respective governments to exert strong leadership to ensure that collaborative research for creating future networks is carried out.
Modelling State Intervention in Cases of Conflicting Interests
Authors: Alison Chorley, Trevor Bench-Capon
Venue: Proceeding of the 2006 conference on Legal Knowledge and Information Systems: JURIX 2006: The Nineteenth Annual Conference (2006)

In previous work we have looked at how agents reason in situations of conflict of interest, using an approach based on an argument scheme for practical reasoning and associated critical questions. In this paper we add the possibility of the State intervening to attempt to improve the outcome. We model the State as another agent in the scenario, with its own repertoire of actions, and its own interests represented as an ordering on values. Where arguments are directed towards different agents with their own different interests it is not possible to use standard means of determining the acceptability of arguments, since these methods evaluate arguments from a single perspective. We therefore adopt the approach of simulating the reasoning of the agents using a procedural version of the argument scheme and associated questions. We present our work through consideration of an extended example, draw some conclusions and identify directions for future work.