Abstract The dividing line between galaxies that are quenched by reionization (“relics”) and survive (i.e., continue forming stars) is commonly discussed in terms of a halo mass threshold. We probe this threshold physically more complete accurate way than has been possible to date, using five extremely high resolution ( M target = 4 ⊙ ) cosmological zoom-in simulations dwarf within the range (1...

An L(2, 1)-labeling of a graph G is a function f from the vertex set V (G) into the set of nonnegative integers such that | f (x) − f (y)| ≥ 2 if d(x, y) = 1 and | f (x) − f (y)| ≥ 1 if d(x, y) = 2, where d(x, y) denotes the distance between x and y in G. The L(2, 1)-labeling number, λ(G), of G is the minimum k where G has an L(2, 1)-labeling f with k being the absolute difference between the l...

In this paper, we present a fast and optimal method for the lossy encoding of object boundaries which are given as 8-connect chain codes. We approximate the boundary by a polygon and consider the problem of nding the polygon which can be encoded with the smallest number of bits for a given maximum distortion. To this end, we derive a fast and optimal scheme which is based on a shortest path alg...

The current research draws on the agency theory, the IT governance literature, and the executive compensation literature to present a theory of the antecedents of IT control weaknesses as reported under Sections 404 of Sarbanes-Oxley Act. More specifically, this paper examines the association between two categories of governance mechanisms (IT governance mechanisms and IT executive incentive al...