Background and Objective: Since it is essential for the research policy makers to acquire knowledge about the global ranks of their countries in in Pathology and Forensic Medicine subject areas, scientometrics experts have been always ranking and analyzing countries on the basis of ‘total number of papers’, ‘total number of citations’ and ‘citations per paper’, etc. Materials and ...

Would a reader be able to predict the branch of mathematics that is the subject of this article if its title had not included the phrase “in Number Theory”? The distinction “local” versus “global”, with various connotations, has found a home in almost every part of mathematics, local problems being often a stepping-stone to the more difficult global problems. To illustrate what the earthy geome...

Overfishing threatens coral reefs worldwide, yet there is no reliable estimate on the number of reef fishers globally. We address this data gap by quantifying the number of reef fishers on a global scale, using two approaches - the first estimates reef fishers as a proportion of the total number of marine fishers in a country, based on the ratio of reef-related to total marine fish landed value...

The development of an effective and efficient method for discretization of continuous variables is an important problem to be solved in developing generally applicable methods for data mining. In Ho and Scott 1997, we describe a new technique for discretization of continuous variables based on zeta, a measure of strength of association between nominal variables. The old zeta method partitions a...

The paper presents a combined nite element and quasi-random walk method to solve the general rendering equation. Applying nite element techniques, the surfaces are decomposed into planar patches that are assumed to have position independent , but not direction independent (that is non-diiuse) radiance. The direction dependent radiance function is then computed by quasi-random walk. Since quasi-...

An offensive alliance in a graph Γ = (V,E) is a set of vertices S ⊂ V where for every vertex v in its boundary it holds that the majority of vertices in v’s closed neighborhood are in S. In the case of strong offensive alliance, strict majority is required. An alliance S is called global if it affects every vertex in V \S, that is, S is a dominating set of Γ. The offensive alliance number ao(Γ)...

Given a connected weighted graph G = (V,E), we consider a hypergraph HG = (V,PG) corresponding to the set of all shortest paths in G. For a given real assignment a on V satisfying 0 ≤ a(v) ≤ 1, a global rounding α with respect to HG is a binary assignment satisfying that |∑v∈F a(v) − α(v)| < 1 for every F ∈ PG. We conjecture that there are at most |V |+1 global roundings for HG, and also the se...

Let G = (V (G), E(G)) be a graph, and let k ≥ 1 be an integer. A set S ⊆ V (G) is called a global offensive k-alliance if |N(v) ∩ S| ≥ |N(v)−S|+k for every v ∈ V (G)−S, where N(v) is the neighborhood of v. The global offensive k-alliance number γ o (G) is the minimum cardinality of a global offensive k-alliance in G. We present different bounds on γ o (G) in terms of order, maximum degree, inde...

A set S ⊆ V is a global dominating set of a graph G = (V,E) if S is a dominating set of G and G, where G is the complement graph of G. The global domination number γg(G) equals the minimum cardinality of a global dominating set of G. The square graph G of a graph G is the graph with vertex set V and two vertices are adjacent in G if they are joined in G by a path of length one or two. In this p...

The global packing number problem arises from the investigation of optimal wavelength allocation in an optical network that employs Wavelength Division Multiplexing (WDM). Consider an optical network that is represented by a connected, simple graph G. We assume all communication channels are bidirectional, so that all links and paths are undirected. It follows that there are (|G| 2 ) distinct n...