In this paper, a new method is proposed to improve the canonical Katz back-off smoothing technique in language modeling. The process of Katz smoothing is detailedly analyzed and the global discounting parameters are selected for discounting. Further more, a modified version of the formula for discounting parameters is proposed, in which the discounting parameters are determined by not only the ...

The relative importance of nodes in a network can be quantified via functions of the adjacency matrix. Two popular choices of function are the exponential, which is parameter-free, and the resolvent function , which yields the Katz centrality measure. Katz centrality can be the more computationally efficient, especially for large directed networks, and has the benefit of generalizing naturally ...

BACKGROUND The Kato-Katz thick smear (Kato-Katz) is the diagnostic method recommended for monitoring large-scale treatment programs implemented for the control of soil-transmitted helminths (STH) in public health, yet it is difficult to standardize. A promising alternative is the McMaster egg counting method (McMaster), commonly used in veterinary parasitology, but rarely so for the detection o...

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 ...

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...