DE eng

Search in the Catalogues and Directories

Hits 1 – 13 of 13

1
Study of central exclusive [Image: see text] production in proton-proton collisions at [Formula: see text] and 13TeV
In: Eur Phys J C Part Fields (2020)
BASE
Show details
2
Search for dark matter produced in association with heavy-flavor quark pairs in proton-proton collisions at [Formula: see text]
Sirunyan, A. M.; Tumasyan, A.; Adam, W.. - : Springer Berlin Heidelberg, 2017
BASE
Show details
3
Association between anticholinergic medication use and cognition, brain metabolism, and brain atrophy in cognitively normal older adults
In: Risacher, SL; McDonald, BC; Tallman, EF; West, JD; Farlow, MR; Unverzagt, FW; et al.(2016). Association between anticholinergic medication use and cognition, brain metabolism, and brain atrophy in cognitively normal older adults. JAMA Neurology, 73(6), 721 - 732. doi:10.1001/jamaneurol.2016.0580. UC Berkeley: Retrieved from: http://www.escholarship.org/uc/item/84q824kc (2016)
BASE
Show details
4
The rise of a high transitivity marker dao in contemporary Chinese: Co-evolvement of language and society
In: Chen, K; & Tao, H. (2014). The rise of a high transitivity marker dao in contemporary Chinese: Co-evolvement of language and society. Chinese Language and Discourse, 5(1), 25 - 52. doi:10.1075/cld.5.1.02che. UCLA: Retrieved from: http://www.escholarship.org/uc/item/75t498qz (2014)
BASE
Show details
5
The rise of a high transitivity marker dao in contemporary Chinese: Co-evolvement of language and society
In: Chinese Language and Discourse, vol 5, iss 1 (2014)
BASE
Show details
6
Measurement of the muon reconstruction performance of the ATLAS detector using 2011 and 2012 LHC proton-proton collision data.
In: Symplectic Elements at Oxford ; Europe PubMed Central ; PubMed (http://www.ncbi.nlm.nih.gov/pubmed/) ; Web of Science (Lite) (http://apps.webofknowledge.com/summary.do) ; Scopus (http://www.scopus.com/home.url) ; CrossRef (2014)
BASE
Show details
7
Generative FDG-PET and MRI model of aging and disease progression in Alzheimer's disease.
In: PLOS Computational Biology, vol. 9, no. 4, pp. e1002987 (2013)
BASE
Show details
8
Speech Data Mining and Document Retrieval - Spoken Document Retrieval With Unsupervised Query Modeling Techniques
In: Institute of Electrical and Electronics Engineers. IEEE transactions on audio, speech and language processing. - New York, NY : Inst. 20 (2012) 9, 2602-2612
OLC Linguistik
Show details
9
Vocabulary-Independent Indexing of Spontaneous Speech
In: Institute of Electrical and Electronics Engineers. IEEE transactions on speech and audio processing. - New York, NY : Inst. 13 (2005) 5, 635-643
OLC Linguistik
Show details
10
Cerebral asymmetry in children when reading Chinese characters
In: Xue, G; Dong, Q; Chen, K; Jin, Z; Chen, C; Zeng, Y; et al.(2005). Cerebral asymmetry in children when reading Chinese characters. Cognitive Brain Research, 24(2), 206 - 214. doi:10.1016/j.cogbrainres.2005.01.022. UC Irvine: Retrieved from: http://www.escholarship.org/uc/item/59s883q0 (2005)
BASE
Show details
11
A Best-First Language Processing Model Integrating the Unification Grammar and Markov Language Model for Speech Recognition Applications
In: Institute of Electrical and Electronics Engineers. IEEE transactions on speech and audio processing. - New York, NY : Inst. 1 (1993) 2, 221-240
OLC Linguistik
Show details
12
A Decision Problem of Finite State Probabilistic Automata.
In: DTIC AND NTIS (1971)
Abstract: It is shown that nonregular languages can be accepted by finite state probabilistic automata. For many years it was not known whether a finite state probabilistic automaton existed which would accept a context sensitive language that is not context free. Such a finite state probabilistic automaton is constructed and the above question is clarified. It is known that the problem of determining for an arbitrary finite state probabilistic automaton whether the set of words accepted by the automaton is regular, is recursively unsolvable. However, a related problem, namely to determine for an arbitrary finite state probabilistic automaton whether the total number of distinct state transition matrices of the automaton is finite, is solvable. An algorithm for solving this problem is presented in this report. The equivalent problem in mathematics is to decide when a stochastic semigroup with a finite number of generators is finite. In the process of presenting the algorithm, the concept of generalized permutation matrices is introduced. The set of generalized permutation matrices for a given matrix forms a semigroup, but not a group. The concept of generalized permutation matrices gives insight into the reason why a finite state probabilistic automaton has a finite number of distinct state transition matrices. (Author)
Keyword: (*LINGUISTICS; *AUTOMATA; ALGORITHMS; AUTOMATA); Bionics; CONTEXT FREE GRAMMARS; CONTEXT SENSITIVE GRAMMARS; FINITE STATE MACHINES; GROUPS(MATHEMATICS); Linguistics; MARKOV CHAINS; MATRICES(MATHEMATICS); PERMUTATIONS; SEMIGROUP THEORY; SEQUENTIAL MACHINES; STOCHASTIC PROCESSES
URL: http://www.dtic.mil/docs/citations/AD0726102
http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=AD0726102
BASE
Hide details
13
Event generator tunes obtained from underlying event and multiparton scattering measurements.
BASE
Show details

Catalogues
0
0
3
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
10
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern