scholarly journals Overcoming HMM Time and Parameter Independence Assumptions for ASR

10.5772/6379 ◽  
2008 ◽  
Author(s):  
Marta Casar ◽  
Jos A. R. Fonollos

2018 ◽  
Vol 52 (4) ◽  
pp. 39
Author(s):  
Jan Czerniawski

Dowód twierdzenia Bella sprowadza się do wyprowadzenia którejś z nierówności Bella. W ich standardowych wyprowadzeniach jednak kluczową rolę odgrywa warunek faktoryzowalności łącznego prawdopodobieństwa warunkowego, który można uzyskać jako konsekwencję dwóch innych warunków, znanych jako parameter independence i outcome independence. Pierwszy z nich jest dość oczywistym wyrazem warunku lokalności, natomiast drugi budzi wątpliwości. Ponieważ jednak jest on uszczegółowieniem warunku screening off zasady wspólnej przyczyny, jego podważenie wymagałoby zakwestionowania również tego warunku. Gdyby się to powiodło, efektywny dowód twierdzenia Bella wymagałby wyprowadzenia nierówności Bella nie wykorzystującego żadnego uszczegółowienia warunku screening off. Przestawiona zostanie sugestia kierunku, w jakim powinny iść poszukiwania modelu naruszającego ten warunek.



1985 ◽  
Vol 25 (1) ◽  
pp. 95-99 ◽  
Author(s):  
Clark Glymour


1969 ◽  
Vol 6 (02) ◽  
pp. 459-461 ◽  
Author(s):  
Duane C. Boes

Consider a queuing system that has c servers and d waiting positions. Assume that the input is Poisson with rate α and the service times are exponential with mean β –1. Further assume the following: (i) a customer arriving when all servers are busy and all waiting positions are occupied is “cleared” from the system; (ii) a customer arriving when all servers are busy and not all waiting positions are occupied waits with probability 1 – ζ and “balks” or “clears” with probability ζ; (iii) a customer arriving when not all servers are busy commences service immediately (never balks); and, (iv) a customer who is waiting for service may “defect”, the distribution of time until a waiting customer defects being given by an exponential distribution with mean γ–1. Also, the usual independence assumptions, which make the process that is described by the number in the system at time t Markov, are assumed. An “output” of this queuing system is defined to occur whenever a service completion occurs, or whenever an arrival “clears” or “balks”, or whenever a waiting customer “defects”. Thus the output is a pooling of service completion epochs, the epochs when arrivals are cleared, the epochs when arrivals balk, and the defection epochs.



1980 ◽  
Vol 17 (01) ◽  
pp. 243-247
Author(s):  
Thomas L. Corwin

A target is assumed to move according to a Wiener process in ℝ1. The probability of detecting the target is computed in terms of the search effort which accumulates along the target's path. Under certain independence assumptions this probability is given by the expectation of an exponential functional of the process. It is shown in this note that the failure probability in a search for a Wiener target is asymptotically proportional to , where T is the accumulated time spent searching. The asymptotic failure probability is also shown to be independent of the position of the search in ℝ1. In a similar fashion, it is shown that the failure probability in a search for a Wiener target in ℝ2 is independent of the position of the search and asymptotically proportional to (c log T + l)–1, c >0



1997 ◽  
Vol 42 (2) ◽  
pp. 14101J ◽  
Author(s):  
Bruce Budowle ◽  
Linda B. Jankowski ◽  
Harry W. Corey ◽  
Nancy T. Swec ◽  
Sharon Freck-Tootell ◽  
...  


1987 ◽  
Vol 41 (2) ◽  
pp. 123 ◽  
Author(s):  
Stephen M. Scariano ◽  
James M. Davenport




2011 ◽  
Vol 4 (11) ◽  
pp. 852-863 ◽  
Author(s):  
Kostas Tzoumas ◽  
Amol Deshpande ◽  
Christian S. Jensen


2019 ◽  
Vol 73 (3) ◽  
pp. 491-516 ◽  
Author(s):  
Zhenyu Yuan ◽  
Frederick P. Morgeson ◽  
James M. LeBreton


Sign in / Sign up

Export Citation Format

Share Document