Typographersand printers often regard seriffed or roman typefaces as more legible and appropriate for reading material than typefaces without serifs. Authors contend that readers prefer roman above sans serif, that it is read faster, and that the comprehension rate is possibly higher when text is set in a roman typeface. The absence of satisfactory empirical data to prove these assumptions, and...

Network security partially depends on reliable user authentication; unfortunately currently used passwords are not completely secure. One of the main problems with passwords is that very good passwords are hard to remember and the ones which are easy to remember are too short or simple to be secure. We have designed a number of authentication schemas, which are easy to remember and can be relat...

Let G = (V,E) be a graph and f be a function f : V → {0, 1, 2}. A vertex u with f(u) = 0 is said to be undefended with respect to f , if it is not adjacent to a vertex with positive weight. The function f is a weak Roman dominating function (WRDF) if each vertex u with f(u) = 0 is adjacent to a vertex v with f(v) > 0 such that the function f ′ : V → {0, 1, 2} defined by f ′ (u) = 1, f ′ (v) = f...

A Roman dominating function of a graph G is a labeling f : V (G) → {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number γR(G) of G is the minimum of ∑ v∈V (G) f(v) over such functions. Let G be a connected n-vertex graph. We prove that γR(G) ≤ 4n/5, and we characterize the graphs achieving equality. We obtain sharp upper and lower bounds for γR(...

Damian Schofield Human Computer Interaction Dept. of Computer Science State University of New York [email protected] Katharina Lorenz Digital Humanities Centre Dept. of Classics University of Nottingham [email protected] Stephanie Davy-Jow Morsani College of Medicine Dept. of Radiology University of South Florida Matthew Anderson Human Computer Interaction Dept. of Compute...

Let k ≥ 1 be an integer. A signed Roman k-dominating function on a digraph D is a function f : V (D) −→ {−1, 1, 2} such that ∑x∈N−[v] f(x) ≥ k for every v ∈ V (D), where N−[v] consists of v and all in-neighbors of v, and every vertex u ∈ V (D) for which f(u) = −1 has an in-neighbor w for which f(w) = 2. A set {f1, f2, . . . , fd} of distinct signed Roman k-dominating functions on D with the pro...

When we examine the stories of women leaders in the early church—especially the stories of their actions for alleviating suffering—their teaching on the causes of suffering comes into focus: ignorance and fear which are the root of alienation, isolation, and divisions among people and from the earth. Ignorance and fear also manifest in patterns of social injustice and in organized systems of op...

Roman Empire is renowned for sharp logical design and outstanding building quality of its road system. Many roads built by Romans are still use in continental Europe and UK. The Roman roads were built for military transportations with efficiency in mind, as straight as possible. Thus the roads make an ideal test-bed for developing experimental laboratory techniques for evaluating man-made trans...

I this paper, the author underlines that epigraphic material and monuments mentioning ancient cults as patrons of seafaring and seafarers in Istria – which would correspond to numerous coastal settlements and ports, villas and landing places – are scarce. It is assumed that the supreme Roman sea deity Neptune was worshipped in the temple on the capitolium in Poreč, and in the residential mariti...