[Depmix-commits] r375 - in papers/jss: . graphs

noreply at r-forge.r-project.org noreply at r-forge.r-project.org
Wed Mar 3 16:17:57 CET 2010


Author: ingmarvisser
Date: 2010-03-03 16:17:57 +0100 (Wed, 03 Mar 2010)
New Revision: 375

Added:
   papers/jss/all.bib
   papers/jss/graphs/balprior.pdf
   papers/jss/ingmar.bib
Removed:
   papers/jss/README
   papers/jss/article.tex
   papers/jss/articleEXAMPLE.tex
   papers/jss/dpx4Rev.R
   papers/jss/dpx4Rev.tex
   papers/jss/dpx4Stangle.R
   papers/jss/dpx4Sweave.R
   papers/jss/jss.dbj
   papers/jss/jss.drv
   papers/jss/jss.dtx
   papers/jss/jss.ins
Modified:
   papers/jss/dpx4Rev.Rnw
Log:
Cleaned up jss directory, added new bib files

Deleted: papers/jss/README
===================================================================
--- papers/jss/README	2010-03-03 15:07:33 UTC (rev 374)
+++ papers/jss/README	2010-03-03 15:17:57 UTC (rev 375)
@@ -1,48 +0,0 @@
-***************************************************
-** jss: A Document Class for Publications in the **
-**        Journal of Statistical Software        **
-***************************************************
-
-This zip-archive contains the pdfLaTeX infrastructure
-for publications in the Journal of Statistical Software.
-The files
-  - jss.cls (LaTeX2e class)
-  - jss.bst (BibTeX style)
-  - jsslogo.jpg (JPG logo)
-need to be included in your search path (local working
-directory, texmf or localtexmf tree).
-
-A manual how to use jss.cls is provided in
-  - jss.pdf.
-
-Furthermore, there are templates for articles, code
-snippets, book reviews and software reviews available
-in 
-  - article.tex
-  - codesnippet.tex
-  - bookreview.tex
-  - softwarereview.tex
-
-The final version of JSS papers should be prepared using
-JSS styles; the submission of the final version needs to
-include the full sources (.tex, .bib, and all graphics).
-A quick check for the most important aspects of the JSS
-style is given below; authors should make sure that all
-of them are addressed in the final version:  
-  - The manuscript can be compiled by pdfLaTeX.
-  - \proglang, \pkg and \code have been used for highlighting
-    throughout the paper (including titles and references),
-    except where explicitly escaped.
-  - References are provided in a .bib BibTeX database
-    and included in the text by \cite, \citep, \citet,
-    etc.
-  - Titles and headers are formatted as described in
-    the JSS manual:
-      - \title in title style,
-      - \section etc. in sentence style,
-      - all titles in the BibTeX file in title style.
-  - Figures, tables and equations are marked with a \label
-    and referred to by \ref, e.g., "Figure~\ref{...}".
-  - Software packes are \cite{}d properly.
-For more details, see the manual jss.pdf, in particular
-the style checklist in Section 2.1.

Added: papers/jss/all.bib
===================================================================
--- papers/jss/all.bib	                        (rev 0)
+++ papers/jss/all.bib	2010-03-03 15:17:57 UTC (rev 375)
@@ -0,0 +1,5249 @@
+%% This BibTeX bibliography file was created using BibDesk.
+%% http://bibdesk.sourceforge.net/
+
+
+%% Created for Ingmar Visser at 2010-03-03 16:14:55 +0100 
+
+
+%% Saved with string encoding Unicode (UTF-8) 
+
+
+
+ at manual{Ghalanos2010,
+	Author = {Alexios Ghalanos and Stefan Theussl},
+	Date-Added = {2010-03-03 16:10:55 +0100},
+	Date-Modified = {2010-03-03 16:14:21 +0100},
+	Title = {Rsolnp},
+	Url = {https://r-forge.r-project.org/projects/rino/}}
+
+ at book{Abramowitz1964,
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Editor = {Milton Abramowitz and Irene A. Segun},
+	Keywords = {math},
+	Publisher = {New York: Dover Publications},
+	Title = {Handbook of mathematical functions},
+	Year = 1964}
+
+ at book{Agresti2002,
+	Address = {Hoboken, NJ},
+	Author = {Alan Agresti},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Edition = {2},
+	Publisher = {Wiley-Interscience},
+	Series = {Wiley series in probability and mathematical statistics},
+	Title = {Categorical Data Analysis},
+	Year = {2002}}
+
+ at incollection{Akaike1973,
+	Author = {Hirotugu Akaike},
+	Booktitle = {Second international symposium on information theory},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Editor = {B. N. Petrov and F. Csaki},
+	Keywords = {AIC, information theory},
+	Pages = {267--281},
+	Publisher = {Budapest: Academiai Kiado},
+	Title = {Information theory and an extension of the maximum likelihood principle},
+	Year = 1973}
+
+ at article{Akaike1979,
+	Author = {Hirotugu Akaike},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Biometrika},
+	Keywords = {AIC},
+	Number = 2,
+	Pages = {237--242},
+	Title = {A Bayesian extension of the minimum AIC procedure of autoregressive models},
+	Volume = 66,
+	Year = 1979}
+
+ at book{Anderson1981,
+	Address = {Hillsdale (NJ)},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Editor = {John R. Anderson},
+	Keywords = {skill acquisition},
+	Publisher = {LEA},
+	Title = {Cognitive Skills and Their Acquisition},
+	Year = 1981}
+
+ at book{Anderson1983,
+	Address = {Cambridge (MA)},
+	Author = {J. R. Anderson},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Publisher = {Harvard University Press},
+	Title = {The architecture of cognition},
+	Year = 1983}
+
+ at article{Anderson1999,
+	Author = {Brian D. O. Anderson},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Mathematical Control Signal Systems},
+	Keywords = {hidden markov model, realization},
+	Pages = {80--120},
+	Summary = {Contains a proof that an HMM can be found for a given probability structure. The probabilities of combinations of substrings have to be known for the construction of the model to work, i.e., the joint probabilities of two following substrings has to be known for all possible combinations of substrings. This results in a Hankel matrix of infinite order. Anderson shows that this matrix can be factored into the matrices of an HMM. Further work is needed to see if this is possible given only a finite fragment of the Hankel matrix concerned. The proof provides an upper limit to the number of states of the HMM: the maximal number of states is the row rank of the Hankel matrix. This could possibly be applied in finite data examples to provide a maximum for the number of states that needs to be estimated.},
+	Title = {The realization problem for hidden {M}arkov models},
+	Volume = {12},
+	Year = 1999}
+
+ at article{Andrieu2002,
+	Author = {Christophe Andrieu, Nando de Freitas, Arnaud Doucet and Michael I. Jordan},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Machine Learning},
+	Keywords = {MCMC},
+	Title = {An Introduction to MCMC for Machine Learning},
+	Year = {In press,2002}}
+
+ at article{Angluin83,
+	Author = {D. Angluin and C. Smith},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Computing Surveys},
+	Keywords = {grammatical inference},
+	Number = 3,
+	Pages = {237--269},
+	Summary = {Proof that inference of FSAs with the use of positive and negative examples is NP-complete.},
+	Title = {Inductive inference: {T}heory and methods},
+	Volume = {15},
+	Year = 1983}
+
+ at article{Arai2000,
+	Author = {K. Arai and R. Nakano},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Neural Networks},
+	Keywords = {state extraction},
+	Pages = {667--680},
+	Summary = {Authors adopt a Bayesian learning strategy for recurrent neural networks, SRNs and second-order networks, to learn stable representations of FSAs. The main trick it seems is to consider internal state representations, that is the points in the hidden state space of the network, as prior knowledge. Also they use a sigmoidal function that approximates threshold units, $1+\tanh(mx)/2$ where $m$ increases during training. This results in internal dynamics of the network to approach only the corners of the hidden state space.},
+	Title = {Stable behavior in a recurrent neural network for a finite state machine},
+	Volume = 13,
+	Year = 2000}
+
+ at book{Arbib1991,
+	Booktitle = {Neural Networks},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Editor = {D. Arbib},
+	Keywords = {neural network introduction},
+	Publisher = {Addison-Wesley},
+	Title = {Neural Networks},
+	Year = 1991}
+
+ at book{Arbib1995,
+	Booktitle = {The Handbook of Brain Theory and Neural Networks},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Editor = {M. A. Arbib},
+	Publisher = {Cambridge: MIT Press},
+	Title = {The Handbook of Brain Theory and Neural Networks},
+	Year = 1995}
+
+ at book{Arminger1995,
+	Booktitle = {Handbook of statistical modeling for the social and behavioral sciences},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Editor = {G. Arminger and C. C. Clogg and M. E. Sobel},
+	Publisher = {New York: Plenum press},
+	Title = {Handbook of statistical modeling for the social and behavioral sciences},
+	Year = 1995}
+
+ at article{Ashby1989,
+	Author = {F. Gregory Ashby},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Human Information Processing: {M}easures, Mechanism, and Models},
+	Pages = {435--457},
+	Summary = {Presents a stochastic version of the general recognition theory. Through the stochastics of the model it is possible to make predictions about RTs. recognition theory. Through the stochastics of the model it is possible to make predictions about RTs.},
+	Title = {Stochastic general recognition theory},
+	Year = 1989}
+
+ at article{Ashby1998,
+	Author = {F. Gregory Ashby and Leola A. Alfonso-Reese and U. Turken and Elliott M. Waldron},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Psychological Review},
+	Keywords = {category learning; procedural learning; rule-based learning.},
+	Pages = {442--481},
+	Read = {No},
+	Title = {A Neuropsychological theory of multiple systems in category learning},
+	Volume = {105},
+	Year = 1998}
+
+ at article{Ashby2001,
+	Author = {F. Gregory Ashby and S. W. Ell},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {TRENDS in Cognitive Sciences},
+	Pages = {204-210},
+	Title = {The neurobiology of human category learning},
+	Volume = {5},
+	Year = {2001}}
+
+ at book{Azzalini1996,
+	Abstract = {
+   Publisher's description: The likelihood plays a key 
+   role both in introducing general notions of statistical theory and 
+   in developing specific methods.  This book introduces 
+   likelihood-based statistical theory and related methods from a 
+   classical viewpoint, and demonstrates how the main body of 
+   currently used statistical techniques can be generated from a few 
+   key concepts, in particular the likelihood.
+
+   Focusing on those methods which have both a solid theoretical 
+   background and practical relevance, the author gives formal 
+   justification of the methods used and provides numerical answers 
+   with real data.
+
+   Statistical inference is aimed at graduate students and researchers 
+   in statistics and applied statistics.
+
+   Contents: Preface; 1.  Introduction and overview; 2.  Likelihood; 
+   3.  Maximum likelihood estimation; 4.  Hypothesis testing; 5.  
+   Linear models; 6.  Generalized linear models; Appendix: Complements 
+   of probability theory.},
+	Author = {Adelchi Azzalini},
+	Booktitle = {Statistical inference},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Publisher = {London: Chapman \& Hall},
+	Title = {Statistical inference},
+	Year = 1996}
+
+ at book{Baddeley1999,
+	Booktitle = {Information theory and the brain},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Editor = {{Roland Baddeley and Peter Hancock and Peter F\"{o}ldi\'{a}k}},
+	Keywords = {Information theory},
+	Publisher = {Cambridge University Press},
+	Title = {Information theory and the brain},
+	Year = 1999}
+
+ at incollection{Baddeley1999a,
+	Author = {Roland Baddeley},
+	Crossref = {Baddeley1999},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Summary = {Introduces notions such as entropy, information, mutual information between variables et cetera. It further discusses a number of illustrative applications.},
+	Title = {Introductory information theory and the brain},
+	Year = 1999}
+
+ at inproceedings{Bakker2000,
+	Author = {Bram Bakker and Michiel de Jong},
+	Booktitle = {From Animals to Animats 6: Proceedings of The Sixth International Conference on the Simulation of Adaptive Behavior, SAB 2000},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Title = {The Epsilon State Count},
+	Year = {In press}}
+
+ at article{Baldi1994,
+	Author = {Pierre Baldi and Yves Chauvin},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Machine Learning},
+	Keywords = {hidden markov model; linear representation; boltzmann chains; on-line learning.},
+	Pages = {307--318},
+	Summary = {Authors present reestimation formulas for hidden markov model parameters for on-line learning, that is, after each training sequence has been received. On-line thus refers to not waiting for all the sequences to come in before starting reestimation. They incidentally show that the weight factors that should be applied when reestimating on the basis of multiple sequences can be dropped without loss of convergence properties (although occasionally small drops in the loglikelihood may occur). They reparametrize parameters by taking the (weighted) exponent. This transformation leads to a representation as a linear Boltzmann chain with normalized weights. This also results in the impossibility of having transmission or emission probabilities equal to zero.},
+	Title = {Smooth on-line learning algorithms for hidden Markov models},
+	Volume = 6,
+	Year = 1994}
+
+ at techreport{Bartsch1994,
+	Author = {Renate Bartsch},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Institution = {Institute for Logic, Language and Computation},
+	Keywords = {category learning},
+	Publisher = {Amsterdam: University of Amsterdam},
+	Series = {Research report No. LP-94-19},
+	Title = {The relationschip between connectionist models and a dynamic data-oriented theory of concept formation},
+	Year = 1994}
+
+ at article{Baum1966,
+	Author = {L. E. Baum and T. Petrie},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Annals of Mathematical Statistics},
+	Keywords = {hidden markov model},
+	Pages = {1554--40},
+	Title = {Statistical inference for probabilistic functions of finite state {M}arkov Chains},
+	Volume = 67,
+	Year = 1966}
+
+ at incollection{Bechtel1990,
+	Author = {William Bechtel},
+	Crossref = {Lycan1990},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Keywords = {connectionism},
+	Title = {Connectionism and the philosophy of mind: An overview},
+	Year = 1990}
+
+ at incollection{Bechtel1991,
+	Author = {William Bechtel and A. Abrahamsen},
+	Booktitle = {Connectionism and the Mind: Introduction to parallel processing in networks},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Keywords = {connectionism, rules in neural networks},
+	Publisher = {Oxford: Blackwell},
+	Title = {Are rules and symbols needed?},
+	Year = 1991}
+
+ at article{Becker1994,
+	Author = {J.D. Becker and J. Honerkamp and J. Hirsch and U. Fr{\"o}be and E. Schlatter and R. Greger},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {European Journal of Physiology},
+	Keywords = {hidden markov model},
+	Pages = {328--332},
+	Title = {Analysing ion channels with hidden {M}arkov models},
+	Volume = 426,
+	Year = 1994}
+
+ at article{Behrmann2000,
+	Author = {Marlene Behrmann},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Current directions in psychological science},
+	Number = {2},
+	Pages = {50--54},
+	Title = {The Mind's Eye Mapped onto the Brain's Matter},
+	Volume = {9},
+	Year = {2000}}
+
+ at book{Bekker1994,
+	Author = {Paul A. Bekker and Arjen Merckens and Tom J. Wansbeek},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Keywords = {identification},
+	Publisher = {Boston etc.: Academic Press},
+	Title = {Identification, equivalent models, and computer algebra},
+	Year = 1994}
+
+ at inproceedings{Bengio1995,
+	Author = {Yoshua Bengio and Paolo Frasconi},
+	Crossref = {Tesauro1995},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Keywords = {input conditioned hidden markov model.},
+	Pages = {427--434},
+	Summary = {Authors propose a model that a discrete hidden state space and continuous inputs and outputs. The hidden state dynamics is a markov process conditioned on a continuous input signal. The output is a mapping from input to output conditioned on the discrete hidden state. In fact then, this is a mixture model in time. They attain good results with inference of the Tomita grammars which however do not have any inputs, so the case for their architecture is somewhat lost. Moreover, they rely on computing partial derivatives of the likelihood to the weigths in output and state transition subnetworks which are vanishingly small in long timeseries.},
+	Title = {An input/output {HMM} architecture},
+	Year = 1995}
+
+ at inproceedings{Bengio1996a,
+	Author = {Samy Bengio},
+	Crossref = {LXu96},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Keywords = {asynchronous input output hidden markod model.},
+	Pages = {328--334},
+	Summary = {Asynchronous refers to the possibility of having a misalignment between input and output symbols. This work extends on the work by Bengio \& Frasconi (1995) who present an EM algorithm input/output hidden markov models. The authors specify the EM algorithm. The $\gamma$- and $\xi$-variables are premultiplied by an indicator variable that specifies whether there is an input/output or not at the current time.},
+	Title = {An EM algorithm for asynchronous input/output hidden markov models},
+	Year = 1996}
+
+ at article{Bengio1996b,
+	Author = {Yoshua Bengio and Paolo Frasconi},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {IEEE Transactions on Neural Networks},
+	Keywords = {input output hidden markov model},
+	Number = 5,
+	Summary = {The message is: instead of using expected counts of state transitions and observations use expected counts of the same quantities partitioned by input symbol.},
+	Title = {Input/Output HMMs for Sequence Processing},
+	Volume = {7},
+	Year = 1996}
+
+ at article{Bereiter1985,
+	Author = {Carl Bereiter},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Review of Educational Research},
+	Keywords = {learning paradox},
+	Pages = {201--226},
+	Title = {Toward a solution of the learning paradox},
+	Volume = 55,
+	Year = 1985}
+
+ at article{Berkeley2000,
+	Author = {Istv\'{a}n S. N. Berkeley},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Minds and Machines},
+	Keywords = {connectionism},
+	Pages = {1--13},
+	Summary = {Plots hidden unit activities, notes regularities in these and interprets them as rules needed to perform the task at hand.},
+	Title = {What the \#\$\*\% ! is a subsymbol?},
+	Volume = {10},
+	Year = 2000}
+
+ at book{Berry1993,
+	Address = {Mahwah (NJ), London},
+	Author = {Dianne C. Berry and Zoltan Dienes},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Keywords = {implicit learning, theory},
+	Publisher = {Lawrence Erlbaum Associates},
+	Series = {Essays in cognitive psychology},
+	Title = {Implicit learning: {T}heoretical and empirical issues},
+	Year = 1993}
+
+ at book{Berry1997,
+	Booktitle = {How implicit is implicit learning?},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Editor = {Dianne C. Berry},
+	Keywords = {implicit learning, theory},
+	Publisher = {Oxford University Press},
+	Title = {How implicit is implicit learning?},
+	Year = 1997}
+
+ at book{Bijleveld1998,
+	Address = {London, Thousand Oaks, New Delhi},
+	Author = {Catrien C. J. Bijleveld and Leo J. Th. van der Kamp and Ab Mooijaart and Willem A. van der Kloot and Rien van der Leeden and Eeke van der Burg},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Keywords = {longitudinal models},
+	Publisher = {Sage},
+	Title = {Longitudinal Data Analysis},
+	Year = 1998}
+
+ at book{Billingsley19??,
+	Author = {Patrick Billingsley},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Keywords = {markov models},
+	Publisher = {The University of Chicago Press},
+	Summary = {Parameter estimation techniques for Markov models. Hypothesis testing by means of the Neyman-Pearson criterion.},
+	Title = {Statistical inference for Markov processes},
+	Year = {19??}}
+
+ at book{Black1972,
+	Booktitle = {Classical conditioning II: current research and theory},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Editor = {Abraham H. Black and William F. Prokasy},
+	Keywords = {conditioning},
+	Publisher = {New York, N.Y. : Appleton-Century-Crofts},
+	Title = {Classical conditioning II: current research and theory},
+	Year = 1972}
+
+ at article{Blanton2006,
+	Author = {Hart Blanton and James Jaccard and Patricia M. Gonzales and Charlene Christie},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Journal of Experimental Social Psychology},
+	Keywords = {implicit association test},
+	Title = {Decoding the implicit association test: {I}mplications for criterion prediction},
+	Year = {in press}}
+
+ at article{Bockenholt1999,
+	Author = {Ulf B\"{o}ckenholt},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {British Journal of Mathematical and Statistical Psychology},
+	Keywords = {hidden markov model},
+	Pages = {125--136},
+	Title = {Measuring change: Mixed {M}arkov models for ordinal panel data},
+	Volume = {52},
+	Year = 1999}
+
+ at article{Bockenholt2005,
+	Author = {Ulf B\"{o}ckenholt},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Psychological Methods},
+	Number = {1},
+	Pages = {65-83},
+	Title = {A Latent Markov Model for the Analysis of Longitudinal Data Collected in Continuous Time: States, Durations, and Transitions},
+	Volume = {10},
+	Year = {2005}}
+
+ at book{Boden1990,
+	Booktitle = {The Philosophy of Artificial Intelligence},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Editor = {Margaret A. Boden},
+	Publisher = {Cambridge: MIT Press},
+	Title = {The Philosophy of Artificial Intelligence},
+	Year = 1990}
+
+ at incollection{Bojadziev1997,
+	Author = {Damjan Bojadziev},
+	Booktitle = {Mind versus {C}omputer},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Editor = {M. Gams et al.},
+	Publisher = {IOS Press},
+	Title = {Mind versus {G}\"odel},
+	Year = {1997}}
+
+ at article{Bollen2002,
+	Author = {Kenneth A. Bollen},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Annual Review of Psychology},
+	Keywords = {latent variables},
+	Pages = {605--634},
+	Title = {Latent Variables in Psychology and the Social Sciences},
+	Volume = 53,
+	Year = 2002}
+
+ at article{Boom1991,
+	Author = {J. Boom},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Human Development},
+	Keywords = {learning paradox},
+	Pages = {273--287},
+	Title = {Collective development and the learning paradox},
+	Volume = 34,
+	Year = 1991}
+
+ at article{Booth1999,
+	Author = {James R. Booth and Charles A. Perfetti and Brian MacWhinney},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Developmental Psychology},
+	Keywords = {implicit learning; dyslexia},
+	Number = {1},
+	Pages = {3--19},
+	Title = {Quick, Automatic, and General Activation of Orthographic and Phonological Representations in Young Readers},
+	Volume = {35},
+	Year = {1999}}
+
+ at article{Borsboom2001,
+	Author = {Denny Borsboom and Gideon J. Mellenbergh and Jaap van Heerden},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Submitted for publication},
+	Keywords = {latent variables},
+	Title = {Philosophy of Science and Psychometrics: {R}eflections on the Theoretical Status of the Latent Variable},
+	Year = 2001}
+
+ at article{Boucher2003,
+	Author = {Luke Boucher and Zolt'an Dienes},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Cognitive Science},
+	Keywords = {implicit learning},
+	Pages = {807--842},
+	Title = {Two ways of learning associations},
+	Volume = 27,
+	Year = 2003}
+
+ at article{Bouwmeester2007,
+	Author = {Samantha Bouwmeester and Jeroen K. Vermunt and Klaas Sijtsma},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Developmental Review},
+	Keywords = {latent class model; fuzzy trace theory},
+	Pages = {41--74},
+	Title = {Development and individual differences in transitive reasoning: A fuzzy trace theory approach},
+	Volume = {27},
+	Year = {2007}}
+
+ at article{Bower1993,
+	Author = {James M. Bower},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Artificial Intelligence Review},
+	Number = 5,
+	Pages = {261--269},
+	Title = {The modulation of learning state in a biological associative memory: {A}n in vitro, in vivo, and in computo study of object recognition in mammalian olfactory cortex},
+	Volume = {7},
+	Year = 1993}
+
+ at article{Bozdogan1987,
+	Author = {Hamparsum Bozdogan},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Psychometrika},
+	Keywords = {model selection},
+	Number = 3,
+	Pages = {345--370},
+	Title = {Model selection and Akaike's information criterion (AIC): The general theory and its analytical extensions},
+	Volume = {52},
+	Year = 1987}
+
+ at article{Bozdogan2000,
+	Author = {Hamparsum Bozdogan},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Journal of Mathematical Psychology},
+	Keywords = {model selection},
+	Number = 1,
+	Pages = {62--91},
+	Summary = {AIC, BIC et cetera.},
+	Title = {Akaike's information criterion and recent developments in informational complexity},
+	Volume = {44},
+	Year = 2000}
+
+ at article{Brainderd1980,
+	Author = {Charles J. Brainerd},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Child Development},
+	Keywords = {associative learning},
+	Number = 2,
+	Pages = {349--363},
+	Title = {Developmental invariance in a mathematical model of associative learning},
+	Volume = {51},
+	Year = 1980}
+
+ at article{Brainerd1979,
+	Author = {Charles J. Brainerd},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Psychological Review},
+	Keywords = {conservation learning, markov models},
+	Number = 3,
+	Pages = {181--213},
+	Title = {Markovian interpretations of conservation learning},
+	Volume = {86},
+	Year = 1979}
+
+ at article{Brainerd1985,
+	Author = {Charles J. Brainerd},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Journal of Experimental Child Psychology},
+	Keywords = {markov models},
+	Pages = {375--394},
+	Title = {Three-state models of memory development: {A} review of advances in statistical methodology},
+	Volume = 40,
+	Year = 1985}
+
+ at article{Breznitz2003,
+	Author = {Zvia Breznitz and Lauren Berman},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Educational Psychology Review},
+	Keywords = {implicit learning; dyslexia},
+	Number = {3},
+	Pages = {247--265},
+	Title = {The Underlying Factors of Word Reading Rate},
+	Volume = {15},
+	Year = {2003}}
+
+ at article{Breznitz2003b,
+	Author = {Zvia Breznitz and M. Misra},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Brain and Language},
+	Keywords = {dyslexia},
+	Pages = {486-502},
+	Title = {Speed of processing of the visual-orthographic and auditory-phonological systems in adult dyslexics: The contribution of ``asynchrony'' to word recognition deficits},
+	Volume = {85},
+	Year = {2003}}
+
+ at article{Brown2008b,
+	Author = {Scott D. Brown and Andrew Heathcote},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Cognitive Psychology},
+	Pages = {153-178},
+	Title = {The simplest complete model of choice response time: Linear ballistic accumulation},
+	Volume = {57},
+	Year = {2008},
+	Bdsk-File-1 = {YnBsaXN0MDDUAQIDBAUGCQpYJHZlcnNpb25UJHRvcFkkYXJjaGl2ZXJYJG9iamVjdHMSAAGGoNEHCFRyb290gAFfEA9OU0tleWVkQXJjaGl2ZXKoCwwXGBkdJCVVJG51bGzTDQ4PEBEUViRjbGFzc1dOUy5rZXlzWk5TLm9iamVjdHOAB6ISE4ACgAOiFRaABIAGWWFsaWFzRGF0YVxyZWxhdGl2ZVBhdGjSDRobHFdOUy5kYXRhgAVPEQHcAAAAAAHcAAIAAApIRCBVMDE2OTYzAAAAAAAAAAAAAAAAAAAAAADFQKHgSCsAAAAc3kkOQnJvd24yMDA4Yi5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABzeTsWKKgkAAAAAAAAAAAAEAAYAAAkgAAAAAAAAAAAAAAAAAAAACmxpdGVyYXR1cmUAEAAIAADFQJPQAAAAEQAIAADFihv5AAAAAQAcABzeSQAc3kcAHJzwAByLHgAcixIAHHdIAA6KLwACAFtIRCBVMDE2OTYzOlVzZXJzOml2aXNzZXIxOkRvY3VtZW50czplZHVjYXRpb246d2Vya3N0dWtrZW46MjAwOXRvbTpsaXRlcmF0dXJlOkJyb3duMjAwOGIucGRmAAAOAB4ADgBCAHIAbwB3AG4AMgAwADAAOABiAC4AcABkAGYADwAWAAoASABEACAAVQAwADEANgA5ADYAMwASAFBVc2Vycy9pdmlzc2VyMS9Eb2N1bWVudHMvZWR1Y2F0aW9uL3dlcmtzdHVra2VuLzIwMDl0b20vbGl0ZXJhdHVyZS9Ccm93bjIwMDhiLnBkZgATAAEvAAAVAAIAD///AADSHh8gIVgkY2xhc3Nlc1okY2xhc3NuYW1loyEiI11OU011dGFibGVEYXRhVk5TRGF0YVhOU09iamVjdF8QTS4uLy4uLy4uLy4uL0RvY3VtZW50cy9lZHVjYXRpb24vd2Vya3N0dWtrZW4vMjAwOXRvbS9saXRlcmF0dXJlL0Jyb3duMjAwOGIucGRm0h4fJieiJyNcTlNEaWN0aW9uYXJ5AAgAEQAaAB8AKQAyADcAOgA/AEEAUwBcAGIAaQBwAHgAgwCFAIgAigCMAI8AkQCTAJ0AqgCvALcAuQKZAp4CpwKyArYCxALLAtQDJAMpAywAAAAAAAACAQAAAAAAAAAoAAAAAAAAAAAAAAAAAAADOQ==}}
+
+ at article{Buchner2000,
+	Author = {Axel Buchner and Werner Wippich},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Cognitive Psychology},
+	Keywords = {reliability},
+	Pages = {227--259},
+	Title = {On the Reliability fo Implicit and Explicit Memory Measures},
+	Volume = 40,
+	Year = 2000}
+
+ at incollection{Bullinaria1999,
+	Author = {John A. Bullinaria},
+	Chapter = 12,
+	Crossref = {Baddeley1999},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Keywords = {Information theory, connectionism},
+	Summary = {Argues that all kinds of adantageous properties of neural networks are due to informational properties of connectionist networks. He mentions: developmental burst (relatively fast learning at some stage during acquisition), frequency effects (regular verbs are learnt faster because they occur more frequently), graceful degration, noise tolerance et cetera. He then argues that it is useless to 'sell' a particular neural network on the basis of these properties because they all have them.},
+	Title = {Free gifts from connectionist modelling},
+	Year = 1999}
+
+ at article{Bureau2003,
+	Author = {Alexandre Bureau and Stephen Shiboski and James P. Hughes},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Statistics in Medicine},
+	Pages = {441-462},
+	Title = {Applications of continuous time hidden Markov models to the study of misclassi ed disease outcomes},
+	Volume = {22},
+	Year = {2003}}
+
+ at article{Burge1992,
+	Author = {Tyler Burge},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {The philosophical review},
+	Number = 1,
+	Pages = {3--51},
+	Title = {Philosophy of language and mind: 1950--1990},
+	Volume = {101},
+	Year = 1992}
+
+ at book{Burnham2002,
+	Author = {Kenneth P. Burnham and David R. Anderson},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Edition = 2,
+	Keywords = {AIC, model selection},
+	Publisher = {Springer},
+	Title = {Model selection and multimodel inference: A practical information-theoretic approach practical information-theoretic approach},
+	Year = 2002}
+
+ at article{Campbell1987,
+	Author = {Campbell, R.L. and Bickhard, M.H.},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Journal = {Human Development},
+	Keywords = {learning paradox},
+	Pages = {48--59},
+	Title = {A deconstruction of Fodor's anticonstructivism},
+	Volume = 30,
+	Year = 1987}
+
+ at book{Cappe2005,
+	Address = {New York},
+	Author = {Oliver Cappe and Eric Moulines and Tobias Ryden},
+	Date-Added = {2010-03-03 16:04:34 +0100},
+	Date-Modified = {2010-03-03 16:04:34 +0100},
+	Publisher = {Springer},
+	Series = {Springer Series in Statistics},
+	Title = {Inference in Hidden Markov Models},
+	Year = {2005}}
+
+ at article{Chambers1985,
+	Author = {Deborah Chambers and Daniel Reisberg},
[TRUNCATED]

To get the complete diff run:
    svnlook diff /svnroot/depmix -r 375


More information about the depmix-commits mailing list