915 resultados para Pseudo-random
Resumo:
We analyze an infinite horizon, single product, periodic review model in which pricing and production/inventory decisions are made simultaneously. Demands in different periods are identically distributed random variables that are independent of each other and their distributions depend on the product price. Pricing and ordering decisions are made at the beginning of each period and all shortages are backlogged. Ordering cost includes both a fixed cost and a variable cost proportional to the amount ordered. The objective is to maximize expected discounted, or expected average profit over the infinite planning horizon. We show that a stationary (s,S,p) policy is optimal for both the discounted and average profit models with general demand functions. In such a policy, the period inventory is managed based on the classical (s,S) policy and price is determined based on the inventory position at the beginning of each period.
Resumo:
We generalize a previous model of time-delayed reaction–diffusion fronts (Fort and Méndez 1999 Phys. Rev. Lett. 82 867) to allow for a bias in the microscopic random walk of particles or individuals. We also present a second model which takes the time order of events (diffusion and reproduction) into account. As an example, we apply them to the human invasion front across the USA in the 19th century. The corrections relative to the previous model are substantial. Our results are relevant to physical and biological systems with anisotropic fronts, including particle diffusion in disordered lattices, population invasions, the spread of epidemics, etc
Resumo:
Resumen tomado de la publicaci??n
Resumo:
A branching random motion on a line, with abrupt changes of direction, is studied. The branching mechanism, being independient of random motion, and intensities of reverses are defined by a particle's current direction. A soluton of a certain hyperbolic system of coupled non-linear equations (Kolmogorov type backward equation) have a so-called McKean representation via such processes. Commonly this system possesses traveling-wave solutions. The convergence of solutions with Heaviside terminal data to the travelling waves is discussed.This Paper realizes the McKean programme for the Kolmogorov-Petrovskii-Piskunov equation in this case. The Feynman-Kac formula plays a key role.
Resumo:
La exposición de las distintas situaciones que pueden dar origen a los trastornos del niño y que pueden llevar a calificarlo de débil mental.. Se han entrevistado ciento cincuenta maestros de seis Colegios nacionales, en cincuenta y cuatro cursos desde primero hasta octavo de Educación General Básica. La distribución ha sido la siguiente: Por sexos, 20 cursos de niños, 15 de niñas y 19 mixtos. Por cursos: 7 cursos de primero de EGB., 11 de segundo, 8 de tercero, 7 de cuarto, 8 de quinto, 5 de sexto, 5 de séptimo y 2 de octavo. Por edad: la edad de los niños oscila entre 6 y 16 años.. En el apartado teórico se han utilizado fuentes bibliográficas mientras que en el apartado práctico se ha pasado a los profesores una encuesta sobre los niños débiles mentales.. En el apartado teórico se ha utilizado la técnica descriptiva mientras que en el capítulo práctico se ha empleado la estadística.. El número de niños considerados débiles mentales corresponde a un 11'37 del total. Todos estos niños no pueden seguir el ritmo normal de la clase, con lo cual su nivel escolar puede considerarse bajo. Por otro lado, todos los profesores han interpretado el retraso mental con la debilidad mental. También podemos señalar que la mayoría de estos niños viven en un medio rural, con un ambiente sociocultural bajo. A su vez, son los niños comprendidos entre seis y catorce años los que alcanzan un porcentaje más alto de debilidad mental frente a sus compañeros de mayor edad, sin embargo, a medida que avanzan en edad el número de débiles mentales disminuye..
Resumo:
Se especula una nueva teor??a sobre el parentesco que une a Cervantes con Isabel de Saavedra, su supuesta hija. En contraposici??n a la teor??a de Fran??ois Maret y otros bi??grafos de Cervantes, que aceptan la injuriosa teor??a de que Cervantes vendi?? su hija a Juan de Urbina, Miguel Herrero aboga por la hip??tesis de que Isabel no era su hija, sino su sobrina, de una relaci??n entre su hermana soltera Magdalena y Juan de Urbina, casado con otra mujer, lo que explicar??a las relaciones entre todos los personajes, y concuerda con el car??cter quijotesco de Cervantes.
Resumo:
One of the key aspects in 3D-image registration is the computation of the joint intensity histogram. We propose a new approach to compute this histogram using uniformly distributed random lines to sample stochastically the overlapping volume between two 3D-images. The intensity values are captured from the lines at evenly spaced positions, taking an initial random offset different for each line. This method provides us with an accurate, robust and fast mutual information-based registration. The interpolation effects are drastically reduced, due to the stochastic nature of the line generation, and the alignment process is also accelerated. The results obtained show a better performance of the introduced method than the classic computation of the joint histogram
Resumo:
The author studies random walk estimators for radiosity with generalized absorption probabilities. That is, a path will either die or survive on a patch according to an arbitrary probability. The estimators studied so far, the infinite path length estimator and finite path length one, can be considered as particular cases. Practical applications of the random walks with generalized probabilities are given. A necessary and sufficient condition for the existence of the variance is given, together with heuristics to be used in practical cases. The optimal probabilities are also found for the case when one is interested in the whole scene, and are equal to the reflectivities
Resumo:
The author studies the error and complexity of the discrete random walk Monte Carlo technique for radiosity, using both the shooting and gathering methods. The author shows that the shooting method exhibits a lower complexity than the gathering one, and under some constraints, it has a linear complexity. This is an improvement over a previous result that pointed to an O(n log n) complexity. The author gives and compares three unbiased estimators for each method, and obtains closed forms and bounds for their variances. The author also bounds the expected value of the mean square error (MSE). Some of the results obtained are also shown
Resumo:
La present tesi proposa una metodología per a la simulació probabilística de la fallada de la matriu en materials compòsits reforçats amb fibres de carboni, basant-se en l'anàlisi de la distribució aleatòria de les fibres. En els primers capítols es revisa l'estat de l'art sobre modelització matemàtica de materials aleatoris, càlcul de propietats efectives i criteris de fallada transversal en materials compòsits. El primer pas en la metodologia proposada és la definició de la determinació del tamany mínim d'un Element de Volum Representatiu Estadístic (SRVE) . Aquesta determinació es du a terme analitzant el volum de fibra, les propietats elàstiques efectives, la condició de Hill, els estadístics de les components de tensió i defromació, la funció de densitat de probabilitat i les funcions estadístiques de distància entre fibres de models d'elements de la microestructura, de diferent tamany. Un cop s'ha determinat aquest tamany mínim, es comparen un model periòdic i un model aleatori, per constatar la magnitud de les diferències que s'hi observen. Es defineix, també, una metodologia per a l'anàlisi estadístic de la distribució de la fibra en el compòsit, a partir d'imatges digitals de la secció transversal. Aquest anàlisi s'aplica a quatre materials diferents. Finalment, es proposa un mètode computacional de dues escales per a simular la fallada transversal de làmines unidireccionals, que permet obtenir funcions de densitat de probabilitat per a les variables mecàniques. Es descriuen algunes aplicacions i possibilitats d'aquest mètode i es comparen els resultats obtinguts de la simulació amb valors experimentals.
Resumo:
[1] Cloud cover is conventionally estimated from satellite images as the observed fraction of cloudy pixels. Active instruments such as radar and Lidar observe in narrow transects that sample only a small percentage of the area over which the cloud fraction is estimated. As a consequence, the fraction estimate has an associated sampling uncertainty, which usually remains unspecified. This paper extends a Bayesian method of cloud fraction estimation, which also provides an analytical estimate of the sampling error. This method is applied to test the sensitivity of this error to sampling characteristics, such as the number of observed transects and the variability of the underlying cloud field. The dependence of the uncertainty on these characteristics is investigated using synthetic data simulated to have properties closely resembling observations of the spaceborne Lidar NASA-LITE mission. Results suggest that the variance of the cloud fraction is greatest for medium cloud cover and least when conditions are mostly cloudy or clear. However, there is a bias in the estimation, which is greatest around 25% and 75% cloud cover. The sampling uncertainty is also affected by the mean lengths of clouds and of clear intervals; shorter lengths decrease uncertainty, primarily because there are more cloud observations in a transect of a given length. Uncertainty also falls with increasing number of transects. Therefore a sampling strategy aimed at minimizing the uncertainty in transect derived cloud fraction will have to take into account both the cloud and clear sky length distributions as well as the cloud fraction of the observed field. These conclusions have implications for the design of future satellite missions. This paper describes the first integrated methodology for the analytical assessment of sampling uncertainty in cloud fraction observations from forthcoming spaceborne radar and Lidar missions such as NASA's Calipso and CloudSat.