A lower time bound Ω(min(ν(x), n − ν(x)) for counting the number of ones in a binary input word x of length n corresponding to the word length of a processor architecture is presented, where ν(x) is the number of ones. The operations available are increment, decrement, bit-wise logical operations, and assignment. The only constant available is zero. An almost matching upper bound is also obtained.

The problem of classifying all tile-k-transitive tilings of the innnite 2-dimensional ribbon (and pinched-ribbon) is shown to be solvable by classifying certain tile-k-transitive tilings of the sphere, for all k 2 N. Complete results are listed for k 3.

The main purpose of the present study is to examine the role of TV satellite programs on family cohesion in Yazd city. The study was conducted as a survey. The sample size of divorce of people were 211 and for married ones were 323. Those divorced respondents were selected using stratified sampling and married respondents were selected using random sampling. The instrument used here was a quest...

Gene Ontology (GO) is a controlled vocabulary. Given a gene product, GO enables scientists to clearly and unambiguously describe specific molecular functions of the gene product, specific biological processes in which it is involved, and specific cellular components to which it is localized. In this paper, we present our approach to identifying which papers have experimental evidence warranting...