Author Contribution: Ran Klein – Study design, methods implementation, data analysis, primary author Jennifer M. Renaud – Major contributions to methodology and secondary author Maria C. Ziadi – Operator 2 Stephanie L. Thorn – Operator 1 Andy Adler – Co-supervisor for Ran Klein, revising of manuscript Robert S. Beanlands – Head of Cardiac PET Centre producing data and patient recruitment, final...

Although computer fraud continues to be a thorn in the side of many organizations, fresh perspectives to addressing this type of crime are rare. This paper advances a preventive approach which reduces those criminal opportunities that permit computer fraud to take place. The construction of crime specific opportunity structures, which enable the relevant parties to conceptualize the fraud envir...

A ternary relation |̂ between subsets of the big model of a complete first-order theory T is called an independence relation if it satisfies a certain set of axioms. The primary example is forking in a simple theory, but o-minimal theories are also known to have an interesting independence relation. Our approach in this paper is to treat independence relations as mathematical objects worth study...

Artabotrys R. Br. is one of the larger genera Annonaceae with over 100 species distributed throughout palaeotropics plus northern Australia. Although genus morphologically very well circumscribed, delimitation quite problematic owing to overlapping morphological characteristics. In Thailand, 20 have been reported, including A. multiflorus C. E. Fisch. Detailed comparisons type specimen from Mya...

0

the annihilating-ideal graph of a commutative ring $r$ is denoted by $ag(r)$, whose vertices are all nonzero ideals of $r$ with nonzero annihilators and two distinct vertices $i$ and $j$ are adjacent if and only if $ij=0$. in this article, we completely characterize rings $r$ when $gr(ag(r))neq 3$.

a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

it is necessary to generate the automorphism group of a chemical graph in computer-aidedstructure elucidation. an euclidean graph associated with a molecule is defined by a weightedgraph with adjacency matrix m = [dij], where for i≠j, dij is the euclidean distance between thenuclei i and j. in this matrix dii can be taken as zero if all the nuclei are equivalent. otherwise,one may introduce dif...