The NP-hard Colorful Components problem is a graph partitioning problem on vertex-colored graphs. We identify a new application of Colorful Components in the correction of Wikipedia interlanguage links, and describe and compare three exact and two heuristic approaches. In particular, we devise two ILP formulations, one based on Hitting Set and one based on Clique Partition. Furthermore, we use ...

Fault localization is considered an important and difficult task in the software engineering process. In the last decades several approaches to fault localization have been published. Some of them are based on either static or dynamic program slicing. In this paper, we present an approach that combines program slicing with the computation of hitting sets. Hitting sets are used in model-based di...

Model counting is an important problem in artificial intelligence and is applied in several areas of information science. Extension rule is a method which could be used to count models. But it’s not appropriate when clause length is short or clause number is huge. After studying extension rule, we found that the satisfiability problem could be solved by hitting set algorithms. And the models co...

The The kinematic interrelationships between the lower limbs, pelvis, trunk, and racquet in the performance of the high velocity tennis serve were investigated for 10 participants using a 12 camera opto-reflective Vicon MX system, operating at 250Hz. The average absolute peak racquet centre velocity was 34.0m∙s-1, which is comparable to previous studies using high performance players. Peak vert...

We investigate whether kernelization results can be obtained if we restrict kernelization algorithms to run in logarithmic space. This restriction for kernelization is motivated by the question of what results are attainable for preprocessing via simple and/or local reduction rules. We find kernelizations for d-hitting set(k), d-set packing(k), edge dominating set(k) and a number of hitting and...

In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected hitting time from an arbitrary spanning tree of the graph. We illustrate this method with two examples. In these examples, we show that the bounds obtained from the spanning method are sharper than bounds obtained from...

Lookback options have payoffs dependent on themaximum and/or minimum of the underlying price attained during the option’s lifetime. Based on the relationship between diffusion maximum and minimum and hitting times and the spectral decomposition of diffusion hitting times, this paper gives an analytical characterization of lookback option prices in terms of spectral expansions. In particular, an...

The paper considers a particular family of fuzzy monotone set–valued stochastic processes. The proposed setting allows us to investigate suitable α-level sets of such processes, modeling birth–and–growth processes. A decomposition theorem is established to characterize the nucleation and the growth. As a consequence, different consistent set–valued estimators are studied for growth process. Mor...

The goal of the study was to quantify error prediction processes via neural correlates in the Electroencephalogram (EEG). Access to such a neural signal will allow to gain insights into functional and temporal aspects of error perception in the course of learning. We focused on the error negativity (Ne) or error-related negativity (ERN) as a candidate index for the prediction processes. We have...

A 14-year-old girl had a mid-facial trauma event caused by hitting an opening door and experienced discomfort swelling of the columella upper lip. Physical examination revealed mild tenderness on light palpation without any with lip movement. computed tomography scan maxillofacial bones three-dimensional reconstruction showed fracture anterior nasal spine obvious leftward displacement, deviatio...