Kobuchi-Philip, Mana. 2010. Indeterminate Numeral Quantifiers, ‘Some’ and ‘Many’ Readings, and Questions in Japanese. Korean Journal of Linguistics, 35, 503-530. The Japanese indeterminate numeral quantifier (WH-CL) can directly combine with a quantificational particle ka or mo, forming, e.g., nan-nin-ka ‘what-CLperson-KA’ or nan-nin-mo ‘what-CLperson-MO’. This paper focuses on the empirical ev...

The aim of the present study was to examine physical fitness differences between Freestyle and Greco-Roman junior wrestlers. One hundred twenty-six junior wrestlers, comprising 70 Freestyle and 56 Greco-Roman wrestlers, participated in this study. The somatic and physical fitness profile included body mass, body height, body mass index, body composition, flexibility, maximal anaerobic power of ...

A Roman dominating function (RDF) on a graph G = (V,E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of an RDF f is the value f(V (G)) = ∑ u∈V (G) f(u). A function f : V (G) → {0, 1, 2} with the ordered partition (V0, V1, V2) of V (G), where Vi = {v ∈ V (G) | f(v) = i} for i = 0...

For an integer n ≥ 2, let I ⊂ {0, 1, 2, · · · , n}. A Smarandachely Roman sdominating function for an integer s, 2 ≤ s ≤ n on a graph G = (V,E) is a function f : V → {0, 1, 2, · · · , n} satisfying the condition that |f(u)− f(v)| ≥ s for each edge uv ∈ E with f(u) or f(v) ∈ I . Similarly, a Smarandachely Roman edge s-dominating function for an integer s, 2 ≤ s ≤ n on a graph G = (V,E) is a func...

let $d$ be a finite and simple digraph with vertex set $v(d)$‎.‎a signed total roman $k$-dominating function (str$k$df) on‎‎$d$ is a function $f:v(d)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that (i) $sum_{xin n^{-}(v)}f(x)ge k$ for each‎‎$vin v(d)$‎, ‎where $n^{-}(v)$ consists of all vertices of $d$ from‎‎which arcs go into $v$‎, ‎and (ii) every vertex $u$ for which‎‎$f(u)=-1$ has a...

To analyze the task of mental arithmetic with external representations in different number systems we model algorithms for addition and multiplication with Arabic and Roman numerals. This demonstrates that Roman numerals are not only informationally equivalent to Arabic ones but also computationally similar—a claim that is widely disputed. An analysis of our models’ elementary processing steps ...

The paper aims to deliver a brief outline of the architectural development and discerned types of architecture of both Germanic and Roman origin on the territories north to the middle Danube. The four centuries of the local development was somehow disturbed during the Marcomannic wars. This large-scale conflict resulted in the Roman military occupation of the neighboring regions (Moravia, South...

A paleoparasitological study was carried out on 2 lead coffins recovered from the Roman site of Jaunay-Clan (near Poitiers, France). For the first time, this particular type of burial gave positive parasitological results, and eggs of the whipworm Trichuris trichiura were identified in 1 individual. In the present case, thanatomorphose associated with funerary practices may explain the scarcity...

Roman domination is a historically inspired variety of general domination such that every vertex is labeled with labels from {0, 1, 2}. Roman domination number is the smallest of the sums of labels fulfilling condition that every vertex, labeled 0, has a neighbor, labeled 2. Using algebraic approach we give O(C) time algorithm for computing Roman domination number of special classes of polygrap...