‎let $r$ be a commutative ring with non-zero identity. ‎we describe all $c_3$‎- ‎and $c_4$-free intersection graph of non-trivial ideals of $r$ as well as $c_n$-free intersection graph when $r$ is a reduced ring. ‎also, ‎we shall describe all complete, ‎regular and $n$-claw-free intersection graphs. ‎finally, ‎we shall prove that almost all artin rings $r$ have hamiltonian intersection graphs. ...

Approximate Bayesian computation (ABC) is a powerful and elegant framework for performing inference in simulation-based models. However, due to the difficulty in scaling likelihood estimates, ABC remains useful for relatively low-dimensional problems. We introduce Hamiltonian ABC (HABC), a set of likelihood-free algorithms that apply recent advances in scaling Bayesian learning using Hamiltonia...

Extending umbral methods introduced by Di Nardo and Senato (2006b), in this paper we provide an unifying syntax for single and multivariate k-statistics, polykays and multivariate polykays. From a combinatorial point of view, we revisit the theory as exposed by Stuart and Ord (1987) taking into account the Doubilet approach to symmetric functions. The Moebius function, occurring in the relation...

This paper examines the task of understanding dialogues in terms of the mental states of the participating agents. We present a motivating example that clarifies the challenges this problem involves and then outline a theory of dialogue interpretation based on abductive inference of these unobserved beliefs and goals, incremental construction of explanations, and reliance on domain-independent ...

In this paper a comparative analysis of different techniques in order to transform a gray-scale edge image to a thin binary edge image is performed. Several thresholding methods and thinning methods are compared. The comparison is made according to some performance measures, such as Pratt’s figure of merit, Baddeley’s measure and the ρ-coefficient. This study is an essential intermediate step t...

in this paper, we investigate a problem of finding natural condition to assure the product of two graphs to be hamilton-connected. we present some sufficient and necessary conditions for $gbox h$ being hamilton-connected when $g$ is a hamilton-connected graph and $h$ is a tree or $g$ is a hamiltonian graph and $h$ is $k_2$.

Shadows serve as e ective cues for a user to recognize spatial relations among objects in 3D space. However simple shadows typically used in 3D interfaces are often insu cient for the purpose, and rendering of shadows with real penumbra are not only too costly for interactive interfaces, but also do not enhance their capabilities as spatial cues. Our proposal, layered penumbra is a new interact...

We present conspicuous activities of plasma ejections along a light bridge of a stable and mature sunspot in NOAA 8971 on 2000 May 02. We found the ejections both in the Hα (10 K) images obtained with the Domeless Solar Telescope (DST) at Hida Observatory, and in the 171 Å (Fe ix/x, ∼106 K) images obtained with the Transition Region and Coronal Explorer (TRACE). Main characteristics of the ejec...