OpenRaiser/Intern-Atlas huggingface dataset:
Planar graphs with $Δ\geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable
Venue: arXiv cs.DM 2014
Year: 2014

For planar graphs, we consider the problems of \emph{list edge coloring} and \emph{list total coloring}. Edge coloring is the problem of coloring the edges while ensuring that two edges that are adjacent receive different colors. Total coloring is the problem of coloring the edges and the vertices while ensuring that two edges that are adjacent, two vertices that are adjacent, or a vertex and an edge that are incident receive different colors. In their list extensions, instead of having the same set of colors for the whole graph, every vertex or edge is assigned some set of colors and has to be colored from it. A graph is minimally edge or total choosable if it is list edge $Δ$-colorable or list total $(Δ+1)$-colorable, respectively, where $Δ$ is the maximum degree in the graph. It is already known that planar graphs with $Δ\geq 8$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable (Li Xu 2011), and that planar graphs with $Δ\geq 7$ and no triangle sharing a vertex with a $C_4$ or no triangle adjacent to a $C_k$ ($\forall 3 \leq k \leq 6$) are minimally total colorable (Wang Wu 2011). We strengthen here these results and prove that planar graphs with $Δ\geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable.
A Straightforward Preprocessing Approach for Accelerating Convex Hull Computations on the GPU
Venue: arXiv cs.CG 2014
Year: 2014

An effective strategy for accelerating the calculation of convex hulls for point sets is to filter the input points by discarding interior points. In this paper, we present such a straightforward and efficient preprocessing approach by exploiting the GPU. The basic idea behind our approach is to discard the points that locate inside a convex polygon formed by 16 extreme points. Due to the fact that the extreme points of a point set do not alter when all points are rotated in the same angle, four groups of extreme points with min or max x or y coordinates can be found in the original point set and three rotated point sets. These 16 extreme points are then used to form a convex polygon. We check all input points and discard the points that locate inside the convex polygon. We use the remaining points to calculate the expected convex hull. Experimental results show that: when employing the proposed preprocessing algorithm, it achieves the speedups of about 4x ~5x on average and 5x ~ 6x in the best cases over the cases where the proposed approach is not used. In addition, more than 99% input points can be discarded in most experimental tests.
Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R
Venue: arXiv cs.AI 2014
Year: 2014

In computational cognitive science, the cognitive architecture ACT-R is very popular. It describes a model of cognition that is amenable to computer implementation, paving the way for computational psychology. Its underlying psychological theory has been investigated in many psychological experiments, but ACT-R lacks a formal definition of its underlying concepts from a mathematical-computational point of view. Although the canonical implementation of ACT-R is now modularized, this production rule system is still hard to adapt and extend in central components like the conflict resolution mechanism (which decides which of the applicable rules to apply next). In this work, we present a concise implementation of ACT-R based on Constraint Handling Rules which has been derived from a formalization in prior work. To show the adaptability of our approach, we implement several different conflict resolution mechanisms discussed in the ACT-R literature. This results in the first implementation of one such mechanism. For the other mechanisms, we empirically evaluate if our implementation matches the results of reference implementations of ACT-R.
Complexity of checking whether two automata are synchronized by the same language
Venue: arXiv cs.FL 2014
Year: 2014

A deterministic finite automaton is said to be synchronizing if it has a reset word, i.e. a word that brings all states of the automaton to a particular one. We prove that it is a PSPACE-complete problem to check whether the language of reset words for a given automaton coincides with the language of reset words for some particular automaton.
Clingo = ASP + Control: Preliminary Report
Venue: arXiv cs.PL 2014
Year: 2014

We present the new ASP system clingo 4. Unlike its predecessors, being mere monolithic combinations of the grounder gringo with the solver clasp, the new clingo 4 series offers high-level constructs for realizing complex reasoning processes. Among others, such processes feature advanced forms of search, as in optimization or theory solving, or even interact with an environment, as in robotics or query-answering. Common to them is that the problem specification evolves during the reasoning process, either because data or constraints are added, deleted, or replaced. In fact, clingo 4 carries out such complex reasoning within a single integrated ASP grounding and solving process. This avoids redundancies in relaunching grounder and solver programs and benefits from the solver's learning capacities. clingo 4 accomplishes this by complementing ASP's declarative input language by control capacities expressed via the embedded scripting languages lua and python. On the declarative side, clingo 4 offers a new directive that allows for structuring logic programs into named and parameterizable subprograms. The grounding and integration of these subprograms into the solving process is completely modular and fully controllable from the procedural side, viz. the scripting languages. By strictly separating logic and control programs, clingo 4 also abolishes the need for dedicated systems for incremental and reactive reasoning, like iclingo and oclingo, respectively, and its flexibility goes well beyond the advanced yet still rigid solving processes of the latter.
INAUT, a Controlled Language for the French Coast Pilot Books Instructions nautiques
Venue: arXiv cs.CL 2014
Year: 2014

We describe INAUT, a controlled natural language dedicated to collaborative update of a knowledge base on maritime navigation and to automatic generation of coast pilot books (Instructions nautiques) of the French National Hydrographic and Oceanographic Service SHOM. INAUT is based on French language and abundantly uses georeferenced entities. After describing the structure of the overall system, giving details on the language and on its generation, and discussing the three major applications of INAUT (document production, interaction with ENCs and collaborative updates of the knowledge base), we conclude with future extensions and open problems.
Transaction Logic with (Complex) Events
Venue: arXiv cs.AI 2014
Year: 2014

This work deals with the problem of combining reactive features, such as the ability to respond to events and define complex events, with the execution of transactions over general Knowledge Bases (KBs). With this as goal, we build on Transaction Logic (TR), a logic precisely designed to model and execute transactions in KBs defined by arbitrary logic theories. In it, transactions are written in a logic-programming style, by combining primitive update operations over a general KB, with the usual logic programming connectives and some additional connectives e.g. to express sequence of actions. While TR is a natural choice to deal with transactions, it remains the question whether TR can be used to express complex events, but also to deal simultaneously with the detection of complex events and the execution of transactions. In this paper we show that the former is possible while the latter is not. For that, we start by illustrating how TR can express complex events, and in particular, how SNOOP event expressions can be translated in the logic. Afterwards, we show why TR fails to deal with the two issues together, and to solve the intended problem propose Transaction Logic with Events, its syntax, model theory and executional semantics. The achieved solution is a non-monotonic extension of TR, which guarantees that every complex event detected in a transaction is necessarily responded.
On contour representation of two dimensional patterns
Venue: arXiv cs.PL 2014
Year: 2014

Two-dimensional patterns are used in many research areas in computer science, ranging from image processing to specification and verification of complex software systems (via scenarios). The contribution of this paper is twofold. First, we present the basis of a new formal representation of two-dimensional patterns based on contours and their compositions. Then, we present efficient algorithms to verify correctness of the contour-representation. Finally, we briefly discuss possible applications, in particular using them as a basic instrument in developing software tools for handling two dimensional words.
Visualization of Constraint Handling Rules
Venue: arXiv cs.PL 2014
Year: 2014

Constraint Handling Rules (CHR) has matured into a general purpose language over the past two decades. Any general purpose language requires its own development tools. Visualization tools, in particular, facilitate many tasks for programmers as well as beginners to the language. The article presents on-going work towards the visualization of CHR programs. The process is done through source-to-source transformation. It aims towards reaching a generic transformer to visualize different algorithms implemented in CHR. Note: An extended abstract / full version of a paper accepted to be presented at the Doctoral Consortium of the 30th International Conference on Logic Programming (ICLP 2014), July 19-22, Vienna, Austria.
Application of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation of Logic Programs
Venue: arXiv cs.AI 2014
Year: 2014

My research goal is to employ a parser generation algorithm based on the Earley parsing algorithm to the evaluation and compilation of queries to logic programs, especially to deductive databases. By means of partial deduction, from a query to a logic program a parameterized automaton is to be generated that models the evaluation of this query. This automaton can be compiled to executable code; thus we expect a speedup in runtime of query evaluation. An extended abstract/ full version of a paper accepted to be presented at the Doctoral Consortium of the 30th International Conference on Logic Programming (ICLP 2014), July 19-22, Vienna, Austria
MIMO OFDM Radar IRCI Free Range Reconstruction with Sufficient Cyclic Prefix
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, we propose MIMO OFDM radar with sufficient cyclic prefix (CP), where all OFDM pulses transmitted from different transmitters share the same frequency band and are orthogonal to each other for every subcarrier in the discrete frequency domain. The orthogonality is not affected by time delays from transmitters. Thus, our proposed MIMO OFDM radar has the same range resolution as single transmitter radar and achieves full spatial diversity. Orthogonal designs are used to achieve this orthogonality across the transmitters, with which it is only needed to design OFDM pulses for the first transmitter. We also propose a joint pulse compression and pulse coherent integration for range reconstruction. In order to achieve the optimal SNR for the range reconstruction, we apply the paraunitary filterbank theory to design the OFDM pulses. We then propose a modified iterative clipping and filtering (MICF) algorithm for the designs of OFDM pulses jointly, when other important factors, such as peak-to-average power ratio (PAPR) in time domain, are also considered. With our proposed MIMO OFDM radar, there is no interference for the range reconstruction not only across the transmitters but also across the range cells in a swath called inter-range-cell interference (IRCI) free that is similar to our previously proposed CP based OFDM radar for single transmitter. Simulations are presented to illustrate our proposed theory and show that the CP based MIMO OFDM radar outperforms the existing frequency-band shared MIMO radar with polyphase codes and also frequency division MIMO radar.
A Novel Method for Developing Robotics via Artificial Intelligence and Internet of Things
Venue: arXiv cs.RO 2014
Year: 2014

This paper describe about a new methodology for developing and improving the robotics field via artificial intelligence and internet of things. Now a day, we can say Artificial Intelligence take the world into robotics. Almost all industries use robots for lot of works. They are use co-operative robots to make different kind of works. But there was some problem to make robot for multi tasks. So there was a necessary new methodology to made multi tasking robots. It will be done only by artificial intelligence and internet of things.
Optimal Index Policies for Anomaly Localization in Resource-Constrained Cyber Systems
Venue: arXiv cs.IT 2014
Year: 2014

The problem of anomaly localization in a resource-constrained cyber system is considered. Each anomalous component of the system incurs a cost per unit time until its anomaly is identified and fixed. Different anomalous components may incur different costs depending on their criticality to the system. Due to resource constraints, only one component can be probed at each given time. The observations from a probed component are realizations drawn from two different distributions depending on whether the component is normal or anomalous. The objective is a probing strategy that minimizes the total expected cost, incurred by all the components during the detection process, under reliability constraints. We consider both independent and exclusive models. In the former, each component can be abnormal with a certain probability independent of other components. In the latter, one and only one component is abnormal. We develop optimal simple index policies under both models. The proposed index policies apply to a more general case where a subset (more than one) of the components can be probed simultaneously and have strong performance as demonstrated by simulation examples. The problem under study also finds applications in spectrum scanning in cognitive radio networks and event detection in sensor networks.
Algorithm for Adapting Cases Represented in a Tractable Description Logic
Venue: arXiv cs.AI 2014
Year: 2014

Case-based reasoning (CBR) based on description logics (DLs) has gained a lot of attention lately. Adaptation is a basic task in the CBR inference that can be modeled as the knowledge base revision problem and solved in propositional logic. However, in DLs, it is still a challenge problem since existing revision operators only work well for strictly restricted DLs of the \emph{DL-Lite} family, and it is difficult to design a revision algorithm which is syntax-independent and fine-grained. In this paper, we present a new method for adaptation based on the DL $\mathcal{EL_{\bot}}$. Following the idea of adaptation as revision, we firstly extend the logical basis for describing cases from propositional logic to the DL $\mathcal{EL_{\bot}}$, and present a formalism for adaptation based on $\mathcal{EL_{\bot}}$. Then we present an adaptation algorithm for this formalism and demonstrate that our algorithm is syntax-independent and fine-grained. Our work provides a logical basis for adaptation in CBR systems where cases and domain knowledge are described by the tractable DL $\mathcal{EL_{\bot}}$.
Mean-Field approximation and Quasi-Equilibrium reduction of Markov Population Models
Venue: arXiv cs.SY 2014
Year: 2014

Markov Population Model is a commonly used framework to describe stochastic systems. Their exact analysis is unfeasible in most cases because of the state space explosion. Approximations are usually sought, often with the goal of reducing the number of variables. Among them, the mean field limit and the quasi-equilibrium approximations stand out. We view them as techniques that are rooted in independent basic principles. At the basis of the mean field limit is the law of large numbers. The principle of the quasi-equilibrium reduction is the separation of temporal scales. It is common practice to apply both limits to an MPM yielding a fully reduced model. Although the two limits should be viewed as completely independent options, they are applied almost invariably in a fixed sequence: MF limit first, QE-reduction second. We present a framework that makes explicit the distinction of the two reductions, and allows an arbitrary order of their application. By inverting the sequence, we show that the double limit does not commute in general: the mean field limit of a time-scale reduced model is not the same as the time-scale reduced limit of a mean field model. An example is provided to demonstrate this phenomenon. Sufficient conditions for the two operations to be freely exchangeable are also provided.
Model revision inference for extensions of first order logic
Venue: arXiv cs.AI 2014
Year: 2014

I am Joachim Jansen and this is my research summary, part of my application to the Doctoral Consortium at ICLP'14. I am a PhD student in the Knowledge Representation and Reasoning (KRR) research group, a subgroup of the Declarative Languages and Artificial Intelligence (DTAI) group at the department of Computer Science at KU Leuven. I started my PhD in September 2012. My promotor is prof. dr. ir. Gerda Janssens and my co-promotor is prof. dr. Marc Denecker. I can be contacted at joachim.jansen@cs.kuleuven.be or at: Room 01.167 Celestijnenlaan 200A 3001 Heverlee Belgium An extended abstract / full version of a paper accepted to be presented at the Doctoral Consortium of the 30th International Conference on Logic Programming (ICLP 2014), July 19-22, Vienna, Austria
On the hopping pattern design for D2D Discovery
Venue: arXiv cs.NI 2014
Year: 2014

The hopping pattern for D2D Discovery are investi- gated. We propose three metrics for hopping pattern performance evaluation: column period, maximal collision ratio, maximal con- tinual collision number. A class of hopping patterns is constructed based on the metrics, and through simulation the patterns show better discovery performance.
Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types
Venue: arXiv cs.PL 2014
Year: 2014

We present a novel general resource analysis for logic programs based on sized types. Sized types are representations that incorporate structural (shape) information and allow expressing both lower and upper bounds on the size of a set of terms and their subterms at any position and depth. They also allow relating the sizes of terms and subterms occurring at different argument positions in logic predicates. Using these sized types, the resource analysis can infer both lower and upper bounds on the resources used by all the procedures in a program as functions on input term (and subterm) sizes, overcoming limitations of existing resource analyses and enhancing their precision. Our new resource analysis has been developed within the abstract interpretation framework, as an extension of the sized types abstract domain, and has been integrated into the Ciao preprocessor, CiaoPP. The abstract domain operations are integrated with the setting up and solving of recurrence equations for inferring both size and resource usage functions. We show that the analysis is an improvement over the previous resource analysis present in CiaoPP and compares well in power to state of the art systems.
Wiener Filters in Gaussian Mixture Signal Estimation with Infinity-Norm Error
Venue: arXiv cs.IT 2014
Year: 2014

Consider the estimation of a signal ${\bf x}\in\mathbb{R}^N$ from noisy observations ${\bf r=x+z}$, where the input~${\bf x}$ is generated by an independent and identically distributed (i.i.d.) Gaussian mixture source, and ${\bf z}$ is additive white Gaussian noise (AWGN) in parallel Gaussian channels. Typically, the $\ell_2$-norm error (squared error) is used to quantify the performance of the estimation process. In contrast, we consider the $\ell_\infty$-norm error (worst case error). For this error metric, we prove that, in an asymptotic setting where the signal dimension $N\to\infty$, the $\ell_\infty$-norm error always comes from the Gaussian component that has the largest variance, and the Wiener filter asymptotically achieves the optimal expected $\ell_\infty$-norm error. The i.i.d. Gaussian mixture case is easily applicable to i.i.d. Bernoulli-Gaussian distributions, which are often used to model sparse signals. Finally, our results can be extended to linear mixing systems with i.i.d. Gaussian mixture inputs, in settings where a linear mixing system can be decoupled to parallel Gaussian channels.
Probabilistic Alias Analysis for Parallel Programming in SSA Forms
Venue: arXiv cs.PL 2014
Year: 2014

Static alias analysis of different type of programming languages has been drawing researcher attention. However most of the results of existing techniques for alias analysis are not precise enough compared to needs of modern compilers. Probabilistic versions of these results, in which result elements are associated with occurrence probabilities, are required in optimizations techniques of modern compilers. This paper presents a new probabilistic approach for alias analysis of parallel programs. The treated parallelism model is that of SPMD where in SPMD, a program is executed using a fixed number of program threads running on distributed machines on different data. The analyzed programs are assumed to be in the static single assignment (SSA) form which is a program representation form facilitating program analysis. The proposed technique has the form of simply-strictured system of inference rules. This enables using the system in applications like Proof-Carrying Code (PPC) which is a general technique for proving the safety characteristics of modern programs.
A Kernel-Based Calculation of Information on a Metric Space
Venue: arXiv cs.IT 2014
Year: 2014

Kernel density estimation is a technique for approximating probability distributions. Here, it is applied to the calculation of mutual information on a metric space. This is motivated by the problem in neuroscience of calculating the mutual information between stimuli and spiking responses; the space of these responses is a metric space. It is shown that kernel density estimation on a metric space resembles the k-nearest-neighbor approach. This approach is applied to a toy dataset designed to mimic electrophysiological data.
ESSP: An Efficient Approach to Minimizing Dense and Nonsubmodular Energy Functions
Venue: arXiv cs.CV 2014
Year: 2014

Many recent advances in computer vision have demonstrated the impressive power of dense and nonsubmodular energy functions in solving visual labeling problems. However, minimizing such energies is challenging. None of existing techniques (such as s-t graph cut, QPBO, BP and TRW-S) can individually do this well. In this paper, we present an efficient method, namely ESSP, to optimize binary MRFs with arbitrary pairwise potentials, which could be nonsubmodular and with dense connectivity. We also provide a comparative study of our approach and several recent promising methods. From our study, we make some reasonable recommendations of combining existing methods that perform the best in different situations for this challenging problem. Experimental results validate that for dense and nonsubmodular energy functions, the proposed approach can usually obtain lower energies than the best combination of other techniques using comparably reasonable time.