Just a guy in pajamas? Framing the blogs in mainstream US newspaper coverage (1999—2005)

When new technologies are introduced to the public, their widespread adoption is dependent, in part, on news coverage (Rogers, 1995).Yet, as weblogs began to play major role in the public spheres of politics and journalism, journalists faced a paradox: how to cover a social phenomenon that was too large to ignore and posed a significant threat to their profession. This article examines how blogs were framed by US newspapers as the public became more aware of the blogging world. A content analysis of blog-related stories in major US newspapers from 1999 to 2005 was conducted. Findings suggest that newspaper coverage framed blogs as more beneficial to individuals and small cohorts than to larger social entities such as politics, business and journalism. Moreover, only in the realm of journalism were blogs framed as more of a threat than a benefit, and rarely were blogs considered an actual form of journalism.Yeshttps://us.sagepub.com/en-us/nam/manuscript-submission-guideline

A code in the nose

AbstractThis talk presents a coding perspective on early olfaction. The question is, how are different smells (odorants) encoded in the olfactory epithelium? Axons from sensory neurons project into the so-called glomerular layer of the olfactory bulb, and there are say 2000 glomeruli. A sensory neuron in the nose projects on a unique glomerulus, but a given sensory neuron may have many receptor types. There about 5 × 107 sensory neurons in the rabbit; each glomerulus fed by 25,000 sensory neurons. The connection strategy, receptor specificities, and number of receptors per sensory neuron are not known, nor is the number of recognizable odorants. Coding structures are proposed which could constrain the biological parameters and be subject to experimental investigation and verification. Some of the structures involve random nearly constant weight codes, and lead to biologically plausible numbers, considering molecular and behavioral evidence

Hadamard codes which have an even number of ones in each half

This paper considers a particular case of the problem of binary codes with the constraint that the codes restricted to cerl3in subsets of columns must be contained in particular codes of the shorter lengths. Here we consider codes of even length 2 k, and of minimum distance ~ d. However, the code obtained by restricting to the first k positions must have even weight and at the same time the code obtained by restricting to the last k positions also must have even weight. If k = 2 n, so that the length is 4 n, n odd, and d = 2 n, we prove that the code has at most 8 n - 4 codewords. Further, 8n - 4 is attainable if and only if a Hadamard matrix of size 4 n exists. For n = 3, this yields 20 binary words of length 12 and distance ~ 6. where the number of 1 s in the first six and in the last six positions is even for every codeword in the code. This permits a file·transfer protocol control ftmction assignment for personal computers to be chosen for 20 control functions using what amounts to" pairs of upper-case alphabetic ASCII characters. In this case, the Hamming distance between the binary fomlS of every tWO different control fwtctions is at least six