scholarly journals On transient regenerative processes

1986 ◽  
Vol 23 (1) ◽  
pp. 52-70 ◽  
Author(s):  
Emily Murphree ◽  
Walter L. Smith

A transient cumulative process based upon a sequence of possibly infinite lifetimes is defined, and examples of such a process are described. Given a mild condition on the improper lifetime distribution and given that all lifetimes observed by time t are finite, the expected value of this transient process at t is related to the expected value of a cumulative process based upon proper lifetimes. This relationship is exploited to show that the conditional behavior of the transient process is analogous to that of a proper process and, in particular, the transient process is asymptotically normal.

1986 ◽  
Vol 23 (01) ◽  
pp. 52-70 ◽  
Author(s):  
Emily Murphree ◽  
Walter L. Smith

A transient cumulative process based upon a sequence of possibly infinite lifetimes is defined, and examples of such a process are described. Given a mild condition on the improper lifetime distribution and given that all lifetimes observed by time t are finite, the expected value of this transient process at t is related to the expected value of a cumulative process based upon proper lifetimes. This relationship is exploited to show that the conditional behavior of the transient process is analogous to that of a proper process and, in particular, the transient process is asymptotically normal.


2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Manuel Bodirsky ◽  
Omer Gimenez ◽  
Mihyun Kang ◽  
Marc Noy

International audience We show that the number $g_n$ of labelled series-parallel graphs on $n$ vertices is asymptotically $g_n \sim g \cdot n^{-5/2} \gamma^n n!$, where $\gamma$ and $g$ are explicit computable constants. We show that the number of edges in random series-parallel graphs is asymptotically normal with linear mean and variance, and that the number of edges is sharply concentrated around its expected value. Similar results are proved for labelled outerplanar graphs.


CFA Digest ◽  
2008 ◽  
Vol 38 (3) ◽  
pp. 35-36
Author(s):  
Michael Kobal
Keyword(s):  

Author(s):  
Sean Maw ◽  
Janice Miller Young ◽  
Alexis Morris

Most Canadian engineering students take a computing course in their first year that introduces them to digital computation. The Canadian Engineering Accreditation Board does not specify the language(s) that can or should be used for instruction. As a result, a variety of languages are used across Canada. This study examines which languages are used in degree-granting institutions, currently and in the recent past. It also examines why institutions have chosen the languages that they currently use. In addition to the language used in instruction, the types and hours of instruction are also analyzed. Methods of instruction and evaluation are compared, as well as the pedagogical philosophies of the different programs with respect to introductory computing. Finally, a comparison of the expected value of this course to graduates is also presented. We found a more diverse landscape for introductory computing courses than anticipated, in most respects. The guiding ethos at most institutions is skill and knowledge development, especially around problem solving in an engineering context. The methods to achieve this are quite varied, and so are the languages employed in such courses. Most programs currently use C/C++, Matlab, VB and/or Python.


Sign in / Sign up

Export Citation Format

Share Document