The purpose of this master's thesis was to explore the circuit design space (speed, area, power) of conventional binary arithmetic and to suggest improvements or alternatives to this arithmetic. The alternatives to the binary arithmetic focused on was the Signed-Digit (SD) number system, the Residue Number System (RNS) and the combination of these two systems (RNS+SD). The work resulted in new ...

Ultrasonic testing is a versatile and important nondestructive testing method. In many industrial applications, ultrasonic testing is carried out at relatively high temperatures. Since the ultrasonic w...

A signed graph (G,Σ) is an undirected graph G together with an assignment of signs (positive or negative) to all its edges, where Σ denotes the set of negative edges. Two signatures are said to be equivalent if one can be obtained from the other by a sequence of resignings (i.e. switching the sign of all edges incident to a given vertex). Extending the notion of usual graph homomorphisms, homom...

The factors influencing attitudes of Taiwan Catholics regarding sexual ethics were investigated by a survey. The number of Roman Catholics in Taiwan was estimated at 230,000 by the Roman Catholic Church in 2009. Of this total, about half are aboriginal Taiwanese, scattered through seven dioceses. The survey was sent to 405 persons in these seven dioceses, based on a .0017 ratio of the Catholic ...

Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for graphs. We characterize balance in using these matrices and obtain explicit formulae the spectrum some unbalanced also notion distance-compatible partially it.

In this paper, we study the signed total domination number in graphs and present new sharp lower and upper bounds for this parameter. For example by making use of the classic theorem of Turán [8], we present a sharp lower bound on Kr+1-free graphs for r ≥ 2. Applying the concept of total limited packing we bound the signed total domination number of G with δ(G) ≥ 3 from above by n−2b 2ρo(G)+δ−3...

A signed graph is a graph in which every edge is designated to be either positive or negative; it is balanced if every cycle contains an even number of negative edges. A marked signed graph is a signed graph each vertex of which is designated to be positive or negative, and it is consistent if every cycle in the signed graph possesses an even number of negative vertices. Signed line graph L(S) ...

a {em roman dominating function} on a graph $g$ is a function$f:v(g)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}a {em restrained roman dominating}function} $f$ is a {color{blue} roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} the wei...