@article{3209,
abstract = {We show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet longest common subsequence (LCS) problems parameterized in the number of strings are W[1]-hard. Unless W[1]=FPT, this rules out the existence of algorithms with time complexity of O(f(k)nα) for those problems. Here n is the size of the problem instance, α is constant, k is the number of strings and f is any function of k. The fixed alphabet version of the LCS problem is of particular interest considering the importance of sequence comparison (e.g. multiple sequence alignment) in the fixed length alphabet world of DNA and protein sequences.},
author = {Krzysztof Pietrzak},
journal = {Journal of Computer and System Sciences},
number = {4},
pages = {757 -- 771},
publisher = {Elsevier},
title = {{On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems}},
doi = {10.1016/S0022-0000(03)00078-3},
volume = {67},
year = {2003},
}
@inproceedings{3210,
abstract = {Luby and Rackoff showed how to construct a (super-)pseudo-random permutation {0,1}2n→ {0,1}2n from some number r of pseudo-random functions {0,1}n → {0,1}n. Their construction, motivated by DES, consists of a cascade of r Feistel permutations. A Feistel permutation 1for a pseudo-random function f is defined as (L, R) → (R,L ⊕ f (R)), where L and R are the left and right part of the input and ⊕ denotes bitwise XOR or, in this paper, any other group operation on {0,1}n. The only non-trivial step of the security proof consists of proving that the cascade of r Feistel permutations with independent uniform random functions {0,1}n → {0,1}n, denoted Ψ2nr is indistinguishable from a uniform random permutation {0,1}2n → {0,1}2n by any computationally unbounded adaptive distinguisher making at most O(2cn) combined chosen plaintext/ciphertext queries for any c < α, where a is a security parameter. Luby and Rackoff proved α = 1/2 for r = 4. A natural problem, proposed by Pieprzyk is to improve on α for larger r. The best known result, α = 3/4 for r = 6, is due to Patarin. In this paper we prove a = 1 -O(1/r), i.e., the trivial upper bound α = 1 can be approached. The proof uses some new techniques that can be of independent interest. },
author = {Maurer, Ueli M and Krzysztof Pietrzak},
pages = {544 -- 561},
publisher = {Springer},
title = {{The security of many round Luby Rackoff pseudo random permutations}},
doi = {10.1007/3-540-39200-9_34},
volume = {2656},
year = {2003},
}
@inproceedings{3425,
author = {Bollenbach, Tobias and Strother, T. and Bauer, Wolfgang},
pages = {277 -- 288},
publisher = {Springer},
title = {{3D supernova collapse calculations}},
doi = {10.1007/978-1-4020-2705-5_21},
volume = {166},
year = {2003},
}
@inbook{3458,
author = {Peter Jonas and Unsicker, Klaus},
booktitle = {Lehrbuch Vorklinik},
editor = {Schmidt, R. F.},
pages = {3 -- 26},
publisher = {Deutscher Ärzte Verlag},
title = {{Molekulare und zelluläre Grundlagen des Nervensystems.}},
volume = {B},
year = {2003},
}
@article{3526,
abstract = {Neurons can produce action potentials with high temporal precision(1). A fundamental issue is whether, and how, this capability is used in information processing. According to the `cell assembly' hypothesis, transient synchrony of anatomically distributed groups of neurons underlies processing of both external sensory input and internal cognitive mechanisms(2-4). Accordingly, neuron populations should be arranged into groups whose synchrony exceeds that predicted by common modulation by sensory input. Here we find that the spike times of hippocampal pyramidal cells can be predicted more accurately by using the spike times of simultaneously recorded neurons in addition to the animals location in space. This improvement remained when the spatial prediction was refined with a spatially dependent theta phase modulation(5-8). The time window in which spike times are best predicted from simultaneous peer activity is 10-30 ms, suggesting that cell assemblies are synchronized at this timescale. Because this temporal window matches the membrane time constant of pyramidal neurons(9), the period of the hippocampal gamma oscillation(10) and the time window for synaptic plasticity(11), we propose that cooperative activity at this timescale is optimal for information transmission and storage in cortical circuits.},
author = {Harris, Kenneth D and Jozsef Csicsvari and Hirase, Hajima and Dragoi, George and Buzsáki, György},
journal = {Nature},
number = {6948},
pages = {552 -- 556},
publisher = {Nature Publishing Group},
title = {{Organization of cell assemblies in the hippocampus}},
doi = {0.1038/nature01834},
volume = {424},
year = {2003},
}