We present Fluid Inking, a generally applicable approach to augmenting the fluid medium of free-form inking with gestural commands. Our approach is characterized by four design criteria, including: 1) pen-based hardware impartiality: all interactions can be performed with a button-free stylus, the minimal input hardware requirement for inking, and the least common denominator device for pen-bas...

Introduction: Radiofrequency ablation is the most commonly used percutaneous procedure to treat trigeminal neuralgia. This therapy less invasive, safe, and provides immediate results minimal side effects. study aims demonstrate potential of radiofrequency in management neuralgia pain.
 Case presentation: A 64-year-old man with recurrent was treated at Hasanuddin University Hospital. The pa...

OBJECTIVE To study the relationship between suboptimal maternal thyroid function during gestation and breech presentation at term. DESIGN Prospective follow-up study during three trimesters of gestation. PATIENTS A total of 1058 Dutch Caucasian healthy pregnant women were prospectively followed from 12 weeks gestation until term (>or=37 weeks) delivery. MEASUREMENTS Maternal thyroid param...

An irreducibly odd graph is a graph such that each vertex has odd degree and for every pair of vertices, a third vertex in the graph is adjacent to exactly one of the pair. This family of graphs was introduced recently by Manturov [1] in relation to free knots. In this paper, we show that every graph is the induced subgraph of an irreducibly odd graph. Furthermore, we prove that irreducibly odd...

Let A be a noetherian local ring, and let C in PA be a family of curves, flat over A. We showed in an earlier paper how to associate to C a locally free sheaf N on PA, and we showed that two families of curves C,C′ are in the same biliaison class if and only if the corresponding sheaves N,N ′ are pseudoisomorphic (generalization of the theorem Rao). In this paper we show how to find all the fla...

we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.

This paper gives a new presentation of Kozen’s proof of Kleene algebra completeness featured in his article A completeness theorem for Kleene algebras and the algebra of regular events. A few new variants are introduced, shortening the proof. Specifically, we directly construct an ε-free automaton to prove an equivalent to Kleene’s representation theorem (implementing Glushkov’s instead of Thom...