http://hdl.handle.net/10057/538 Search the Channel s http://soar.wichita.edu:8080/dspace/simple-search http://hdl.handle.net/10057/1363 title: Extending the piecewise exponential estimator of the survival function authors: Malla, Ganesh B. <br>abstract: We propose a new way of extending the piecewise exponential estimator (PEXE) beyond the last observation, where the original PEXE and the Kaplan-Meier estimator (KME) of the true survival function (SF) are undefined. We propose additional exponential tail to the original PEXE so that the estimate of the true mean by our estimator, which we will call extended-PEXE (EPEXE), and the KME are equal. By simulations, with various survival functions, we have been able to show that EPEXE improves on both the original PEXE and the KME. <br>description: Paper presented to the 4th Annual Symposium on Graduate Research and Scholarly Projects (GRASP) held at the Hughes Metropolitan Complex, Wichita State University, April 25, 2008. <br> http://hdl.handle.net/10057/849 title: Uniqueness of inverse source problems for some semilinear elliptic equations authors: Myers, Joseph K. <br>abstract: Uniqueness of positive f is established in the inverse source problem − Δu + c(x,u) = f (x) under conditions on the known coefficient c. This inverse problem is significant in the areas of semiconductor manufacturing, and in the study of ion channels in biology and health care. <br>description: Paper presented to the 3rd Annual Symposium on Graduate Research and Scholarly Projects (GRASP) held at the Hughes Metropolitan Complex, Wichita State University, April 27, 2007. <br> http://hdl.handle.net/10057/848 title: Combinatorial input recognition algorithm Internet applications to HTTP web servers authors: Myers, Joseph K. <br>abstract: We introduce an algorithm for the classical recognition problem of identifying elements s within a class of strings S = {s1, s2, ..., sn}. Here it is assumed that struct s = { char *a; int z; }; and that for two strings s1, s2 if s1.z == s2.z then there is J = {j1, j2, ..., jl} with l(z) < z so that s1[J] == s2[J] ⇒ s1 == s2. The goal is to minimize Σ = n k i l si z 1 ( . ) and thus distinguish elements with the smallest number of comparisons. In general, this simply means that in a language system we face a nonoptimal set of keywords (n < sizeof(*s.a)z) and so we seek to reconstruct the language with a smaller set of k recognition vertices so that k ≈ logsizeof(*s.a) n. The algorithm is applied to increasing HTTP transmission and request processing speed. The result is an increase in web server performance from 20,000 to 35,000 or more hits per second. The input recognition algorithm produces the greatest improvement when interpreting HTTP request headers which are large in proportion to the response. This is the case when collecting data for statistical analysis of Internet traffic. <br>description: Paper presented to the 3rd Annual Symposium on Graduate Research and Scholarly Projects (GRASP) held at the Hughes Metropolitan Complex, Wichita State University, April 27, 2007. <br> http://hdl.handle.net/10057/598 title: Increased stability of solutions to the Helmholtz equation authors: Aralumallige, Deepak <br>description: Paper presented to the 2nd Annual Symposium on Graduate Research and Scholarly Projects (GRASP) held at the Rhatigan Student Center, Wichita State University, April 28, 2006. <br>