Context-sensitive refinements for stochastic optimisation algorithms in inductive logic programming

We describe a new approach to the application of stochastic search in Inductive Logic Programming (ILP). Unlike traditional approaches we do not focus directly on evolving logical concepts but our refinement-based approach uses the stochastic optimization process to iteratively adapt the initial working concept. Utilization of context-sensitive concept refinements (adaptations) helps the search operations to produce mostly syntactically correct concepts. It also enables using available background knowledge both for efficiently restricting the search space and for directing the search. Thereby, the search is more flexible, less problem-specific and the framework can be easily used with any stochastic search algorithm within ILP domain. Experimental results on several data sets verify the usefulness of this approach.     

Querying and creating visualizations by analogy

While there have been advances in visualization systems, particularly in multi-view visualizations and visual exploration, the process of building visualizations remains a major bottleneck in data exploration. We show that provenance metadata collected during the creation of pipelines can be reused to suggest similar content in related visualizations and guide semi-automated changes. We introduce the idea of query-by-example in the context of an ensemble of visualizations, and the use of analogies as first-class operations in a system to guide scalable interactions. We describe an implementation of these techniques in VisTrails, a publicly-available, open-source system.     

Characteristic measure of the departure from the eddy-viscosity model

Summary There is presented a direct evaluation of the departure from the eddy-viscosity model. This, widely used, concept of a clear physical meaning has usually been tested experimentally via simultaneous turbulence modelling of an eddy-viscosity coefficient _T . Hence, the effect of the basic model assumption remains more or less latent. In the following we propose a characteristic measure for a direct determination of the departure from the eddy-viscosity model, i.e. independently from the choice of _T -modelling from a great variety of available forms.     

Satisfiability of co-nested formulas

As a notion dual to Knuth's nested formulas [4], we call a boolean formula in conjunctive normal formco-nested if its clauses can be linearly ordered (sayC={c _i ;i=1,2, ...,n})so that the graphG ^cl =(XC, {xc _i ;xc _i or ¬xc _i } {c _i c _i+1;i=1, 2, ...,n}) allows a noncrossing drawing in the plane so that the circlec ₁,c ₂, ...,c _n bounds the outerface. Our main result is that maximum satisfiability of co-nested formulas can be decided in linear time.Both authors acknowledge a partial support of Ec Cooperative Action IC-1000 (project ALTEC:Algorithms for Future Technologies).     

Designing fast LTL model checking algorithms for many-core GPUs

Recent technological developments made various many-core hardware platforms widely accessible. These massively parallel architectures have been used to significantly accelerate many computation demanding tasks. In this paper, we show how the algorithms for LTL model checking can be redesigned in order to accelerate LTL model checking on many-core GPU platforms. Our detailed experimental evaluation demonstrates that using the NVIDIA CUDA technology results in a significant speedup of the verification process. Together with state space generation based on shared hash-table and DFS exploration, our CUDA accelerated model checker is the fastest among state-of-the-art shared memory model checking tools.     

Computing multiple-output regression quantile regions

A procedure relying on linear programming techniques is developed to compute (regression) quantile regions that have been defined recently. In the location case, this procedure allows for computing halfspace depth regions even beyond dimension two. The corresponding algorithm is described in detail, and illustrations are provided both for simulated and real data. The efficiency of a Matlab implementation of the algorithm¹ is also investigated through extensive simulations.     

Observation of a half-quantum-flux periodicity pattern in an rf SQUID with small critical currents

We have found experimentally that rf SQUID's working in a nonhysteretic mode with small critical currents give exactly at resonance and at very low rf bias a triangular pattern with a period equal to half of one elementary quantum of magnetic flux. We discuss a possible explanation of this peculiar result.