Given an n-node undirected simple graph G and a positive integer k, the k-connectivity labeling problem for G seeks short labels for the nodes of G such that whether any two nodes are k-connected in G can be determined merely by their labels. For k = 1, an optimal solution to the problem is to give each node in the same connected component of G a common log2 n -bit label, uniquely chosen for th...

Vol. XLIV (May 2007), 200–213 200 © 2007, American Marketing Association ISSN: 0022-2437 (print), 1547-7193 (electronic) *Tuo Wang is Assistant Professor of Marketing, College of Business Administration, Kent State University (e-mail: [email protected]). R. Venkatesh is Associate Professor of Business Administration (e-mail: [email protected]), and Rabikar Chatterjee is Professor of Business ...

OBJECTIVES Hospitalisation for medical illness has ongoing impact on individuals, healthcare services and society beyond discharge. This study's objective was to determine the 12-month mortality and functional outcomes of patients admitted to the acute medical service at Groote Schuur Hospital (GSH). METHODS Follow-up, using the hospital records system and provincial death registry, together ...

We have performed a series of systematic tests to evaluate quantitatively the effects of spurious transport in three-dimensional smoothed particle hydrodynamics (SPH) calculations. Our tests investigate (i) particle diffusion, (ii) shock heating, (iii) numerical viscosity, and (iv) angular momentum transport. The effects of various program parameters on spurious mixing and on viscosity are inve...

The popular Katz-Yung compiler from CRYPTO 2003 can be used to transform unauthenticated group key establishment protocols into authenticated ones. In this paper we present a modification of Katz and Yung’s construction which maintains the round complexity of their compiler, but for ‘typical’ unauthenticated group key establishments adds authentication in such a way that deniability is achieved...

Introduction The global number of papers published in different areas has increased over the years (King, 2004). Moreover, the science has experimented changes in academic production scenarios, such as decreased number of solo and increased team authors over the years (Nabout et al., 2015). For many a researcher the number of authors is one measure of collaborations (Price, 1958). In fact the c...

In this paper we study the question of what security is achievable for stand-alone two-party computation in four-rounds. Our starting point point is the Katz-Ostrovsky lower bound [KO04] which determines that the exact round complexity of achieving a secure two-party computation protocol is five. To get around this lower bound we consider two relaxations of the standard simulation-based securit...