Laplace Transforms pdf

Exam questions and solutions in PDF

Laplace Transforms

Exam questions and solutions in LaTex

Fluorescence tomographic imaging in turbid media using early-arriving photons and Laplace transforms

We present a multichannel tomographic technique to detect fluorescent objects embedded in thick (6.4 cm) tissue-like turbid media using early-arriving photons. The experiments use picosecond laser pulses and a streak camera with single photon counting capability to provide short time resolution and high signal-to-noise ratio. The tomographic algorithm is based on the Laplace transform of an analytical diffusion approximation of the photon migration process and provides excellent agreement between the actual positions of the fluorescent objects and the experimental estimates. Submillimeter localization accuracy and 4- to 5-mm resolution are demonstrated. Moreover, objects can be accurately localized when fluorescence background is present. The results show the feasibility of using early-arriving photons to image fluorescent objects embedded in a turbid medium and its potential in clinical applications such as breast tumor detection.

On q-Laplace Transforms of the q-Bessel Functions

Mathematics Subject Classification: 33D15, 44A10, 44A20

Laplace Tr ODE pdf

Exam questions and solutions in PDF

Laplace Tr ODE

Exam questions and solutions in LaTex

Fractional Calculus of P-transforms

MSC 2010: 44A20, 33C60, 44A10, 26A33, 33C20, 85A99

A coherent approach to non-integer order derivatives

Signal Processing, vol. 86, nº 10

Improved multiexponential transient spectroscopy by iterative deconvolution

The analysis of multiexponential decays is challenging because of their complex nature. When analyzing these signals, not only the parameters, but also the orders of the models, have to be estimated. We present an improved spectroscopic technique specially suited for this purpose. The proposed algorithm combines an iterative linear filter with an iterative deconvolution method. A thorough analysis of the noise effect is presented. The performance is tested with synthetic and experimental data.

The Effect of a threshold proportional reinsurance strategy on ruin probabilities

[spa] En un modelo de Poisson compuesto, definimos una estrategia de reaseguro proporcional de umbral : se aplica un nivel de retención k1 siempre que las reservas sean inferiores a un determinado umbral b, y un nivel de retención k2 en caso contrario. Obtenemos la ecuación íntegro-diferencial para la función Gerber-Shiu, definida en Gerber-Shiu -1998- en este modelo, que nos permite obtener las expresiones de la probabilidad de ruina y de la transformada de Laplace del momento de ruina para distintas distribuciones de la cuantía individual de los siniestros. Finalmente presentamos algunos resultados numéricos.

The Effect of a threshold proportional reinsurance strategy on ruin probabilities

[spa] En un modelo de Poisson compuesto, definimos una estrategia de reaseguro proporcional de umbral : se aplica un nivel de retención k1 siempre que las reservas sean inferiores a un determinado umbral b, y un nivel de retención k2 en caso contrario. Obtenemos la ecuación íntegro-diferencial para la función Gerber-Shiu, definida en Gerber-Shiu -1998- en este modelo, que nos permite obtener las expresiones de la probabilidad de ruina y de la transformada de Laplace del momento de ruina para distintas distribuciones de la cuantía individual de los siniestros. Finalmente presentamos algunos resultados numéricos.

Retrial Queues with Orbital Search

Queueing system in which arriving customers who find all servers and waiting positions (if any) occupied many retry for service after a period of time are retrial queues or queues with repeated attempts. This study deals with two objectives one is to introduce orbital search in retrial queueing models which allows to minimize the idle time of the server. If the holding costs and cost of using the search of customers will be introduced, the results we obtained can be used for the optimal tuning of the parameters of the search mechanism. The second one is to provide insight of the link between the corresponding retrial queue and the classical queue. At the end we observe that when the search probability Pj = 1 for all j, the model reduces to the classical queue and when Pj = 0 for all j, the model becomes the retrial queue. It discusses the performance evaluation of single-server retrial queue. It was determined by using Poisson process. Then it discuss the structure of the busy period and its analysis interms of Laplace transforms and also provides a direct method of evaluation for the first and second moments of the busy period. Then it discusses the M/ PH/1 retrial queue with disaster to the unit in service and orbital search, and a multi-server retrial queueing model (MAP/M/c) with search of customers from the orbit. MAP is convenient tool to model both renewal and non-renewal arrivals. Finally the present model deals with back and forth movement between classical queue and retrial queue. In this model when orbit size increases, retrial rate also correspondingly increases thereby reducing the idle time of the server between services

MA17xexam01

Exam questions and solutions in LaTex. Diagrams for the questions are all together in the support.zip file, as .eps files

MA17xexam00pdf

Exam questions and solutions in PDF

Exercise sheet 9 pdf

Exercises and solutions in PDF