Oldest Papers
M-estimation of linear models with dependent errors
Wei Biao Wu
arXiv·2004
We study asymptotic properties of $M$-estimates of regression parameters in linear models in which errors are dependent. Weak and strong Bahadur representations of the $M$-estimates are derived and a central limit theorem is established. The results are applied to linear models with errors being short-range dependent linear processes, heavy-tailed linear processes and some widely used nonlinear time series.
No ratings yet
View paper →Targeting Arab/Muslim/South Asian Americans: Criminalization and Cultural Citizenship
Louise Cainkar, Sunaina Maira
Amerasia Journal·2005·76 citations
No abstract available
No ratings yet
View paper →The Divinity of Hellenistic Rulers
Angelos Chaniotis
A Companion to the Hellenistic World·2005·31 citations
No abstract available
No ratings yet
View paper →Hellenistic Religion
David Potter
A Companion to the Hellenistic World·2005
No abstract available
No ratings yet
View paper →Worker Politics, Trade Unions and the Shiv Sena's Rise in Central Bombay
Juned Shaikh
Economic and Political Weekly·2005
The Shiv Sena's rise from the 1960s was assisted in large part by its ability to effectively channel emotions based on identity. It was the mill areas of central Bombay that formed the battleground for different political parties as they fought for representation of the class that had played a key role in shaping the city's destiny. Whereas the actions of the left parties were limited to the workplace, the Sena, through its shakhas, ensconced itself in the neighbourhood and rather than radical worker concerns took up emotive issues relating to livelihood and identity that played up the image of the deprived Maharashtrian.
No ratings yet
View paper →Clinical Studies of Olfaction
Richard L. Doty
Chemical Senses, vol.30 (suppl 1)·2005·24 citations
No abstract available
No ratings yet
View paper →The Changing Place of Cultural Production: The Location of Social Networks in a Digital Media Industry
Gina Neff
The ANNALS of the American Academy of Political and Social Science·2005·78 citations
<jats:p> This article examines the role of place and placemaking within cultural industries in the digital era. The data for this article are drawn from a data set of attendance at more than nine hundred social networking events over a six-year period in New York City’s Internet, or “new media,” industry. These data confirm that place became more,not less,important to cultural production over this period. Networking, or the processes of the formation of social network ties, is concentrated in activities within narrow geographic clusters. This study suggests that the networking events within the industry—cocktail parties, seminars, ceremonies, and the like—mediate access to crucial resources within the industry. </jats:p>
No ratings yet
View paper →Emerging Levels of Consciousness in Early Human Development
Katherine Nelson
The Missing Link in CognitionOrigins of self-reflective consciousness·2005·13 citations
No abstract available
No ratings yet
View paper →Practical Clues to Early Recognition of Bipolar Disorder
Alan C. Swann, Barbara Geller, Robert M. Post, Lori Altshuler, Kiki D. Chang, Melissa P. DelBello, Christopher Reist, Iver A. Juster
The Primary Care Companion For CNS Disorders·2005·24 citations
No abstract available
No ratings yet
View paper →Simple extractors for all min-entropies and a new pseudorandom generator
Ronen Shaltiel, Christopher Umans
Journal of the ACM·2005·97 citations
<jats:p>
A “randomness extractor” is an algorithm that given a sample from a distribution with sufficiently high min-entropy and a short random seed produces an output that is statistically indistinguishable from uniform. (Min-entropy is a measure of the amount of randomness in a distribution.) We present a simple, self-contained extractor construction that produces good extractors for all min-entropies. Our construction is algebraic and builds on a new polynomial-based approach introduced by Ta-Shma et al. [2001b]. Using our improvements, we obtain, for example, an extractor with output length
<jats:italic>m</jats:italic>
=
<jats:italic>k</jats:italic>
/(log
<jats:italic>n</jats:italic>
)
<jats:sup>
<jats:italic>O</jats:italic>
(1/α)
</jats:sup>
and seed length (1 + α)log
<jats:italic>n</jats:italic>
for an arbitrary 0 < α ≤ 1, where
<jats:italic>n</jats:italic>
is the input length, and
<jats:italic>k</jats:italic>
is the min-entropy of the input distribution.A “pseudorandom generator” is an algorithm that given a short random seed produces a long output that is computationally indistinguishable from uniform. Our technique also gives a new way to construct pseudorandom generators from functions that require large circuits. Our pseudorandom generator construction is
<jats:italic>not</jats:italic>
based on the Nisan-Wigderson generator [Nisan and Wigderson 1994], and turns worst-case hardness
<jats:italic>directly</jats:italic>
into pseudorandomness. The parameters of our generator match those in Impagliazzo and Wigderson [1997] and Sudan et al. [2001] and in particular are strong enough to obtain a new proof that
<jats:italic>P</jats:italic>
=
<jats:italic>BPP</jats:italic>
if
<jats:italic>E</jats:italic>
requires exponential size circuits.Our construction also gives the following improvements over previous work:---We construct an optimal “hitting set generator” that stretches
<jats:italic>O</jats:italic>
(log
<jats:italic>n</jats:italic>
) random bits into
<jats:italic>s</jats:italic>
<jats:sup>Ω(1)</jats:sup>
pseudorandom bits when given a function on log
<jats:italic>n</jats:italic>
bits that requires circuits of size
<jats:italic>s</jats:italic>
. This yields a quantitatively optimal hardness versus randomness tradeoff for both
<jats:italic>RP</jats:italic>
and
<jats:italic>BPP</jats:italic>
and solves an open problem raised in Impagliazzo et al. [1999].---We give the first construction of pseudorandom generators that fool
<jats:italic>nondeterministic</jats:italic>
circuits when given a function that requires large nondeterministic circuits. This technique also give a quantitatively optimal hardness versus randomness tradeoff for
<jats:italic>AM</jats:italic>
and the first hardness amplification result for nondeterministic circuits.
</jats:p>
No ratings yet
View paper →DRACULA AND CARMILLA: MONSTERS AND THE MIND
Saler and Ziegler
proquest.com·2005
Saler and Ziegler find out on what is it about the plot and the characterization of vampires in Dracula that make it the most famous example of vampires in English fiction and why in particular has it been more influential than Le Fanu's Carmilla, which preceded it in time and is of equal or perhaps greater literary distinction.
No ratings yet
View paper →From disconnection to connection: ‘Race’, gender and the politics of therapy
Khatidja Chantler
British Journal of Guidance & Counselling·2005·28 citations
No abstract available
No ratings yet
View paper →