THz Plasma Waves in Field-Effect-Transistors: A Monte Carlo Study

Sensing with electromagnetic waves having frequencies in the Terahertz-range is a very attractive investigative method with applications in fundamental research and industrial settings. Up to now, a lot of sources and detectors are available. However, most of these systems are bulky and have to be used in controllable environments such as laboratories. In 1993 Dyakonov and Shur suggested that plasma waves developing in field-effect-transistors can be used to emit and detect THz-radiation. Later on, it was shown that these plasma waves lead to rectification and allows for building efficient detectors. In contrast to the prediction that these plasma waves lead to new promising solid-state sources, only a few weak sources are known up to now. This work studies THz plasma waves in semiconductor devices using the Monte Carlo method in order to resolve this issue. A fast Monte Carlo solver was developed implementing a nonparabolic bandstructure representation of the used semiconductors. By investigating simplified field-effect-transistors it was found that the plasma frequency follows under equilibrium conditions the analytical predictions. However, no current oscillations were found at room temperature or with a current flowing in the channel. For more complex structures, consisting of ungated and gated regions, it was found that the plasma frequency does not follow the value predicted by the dispersion relation of the gated nor the ungated device.

A Monte Carlo-Based Fiber Tracking Algorithm using Diffusion Tensor MRI

Diffusion tensor magnetic resonance imaging, which measures directional information of water diffusion in the brain, has emerged as a powerful tool for human brain studies. In this paper, we introduce a new Monte Carlo-based fiber tracking approach to estimate brain connectivity. One of the main characteristics of this approach is that all parameters of the algorithm are automatically determined at each point using the entropy of the eigenvalues of the diffusion tensor. Experimental results show the good performance of the proposed approach

Error and complexity of random walk Monte Carlo radiosity

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

Parallel Monte Carlo approach for integration of the rendering equation

This paper is addressed to the numerical solving of the rendering equation in realistic image creation. The rendering equation is integral equation describing the light propagation in a scene accordingly to a given illumination model. The used illumination model determines the kernel of the equation under consideration. Nowadays, widely used are the Monte Carlo methods for solving the rendering equation in order to create photorealistic images. In this work we consider the Monte Carlo solving of the rendering equation in the context of the parallel sampling scheme for hemisphere. Our aim is to apply this sampling scheme to stratified Monte Carlo integration method for parallel solving of the rendering equation. The domain for integration of the rendering equation is a hemisphere. We divide the hemispherical domain into a number of equal sub-domains of orthogonal spherical triangles. This domain partitioning allows to solve the rendering equation in parallel. It is known that the Neumann series represent the solution of the integral equation as a infinity sum of integrals. We approximate this sum with a desired truncation error (systematic error) receiving the fixed number of iteration. Then the rendering equation is solved iteratively using Monte Carlo approach. At each iteration we solve multi-dimensional integrals using uniform hemisphere partitioning scheme. An estimate of the rate of convergence is obtained using the stratified Monte Carlo method. This domain partitioning allows easy parallel realization and leads to convergence improvement of the Monte Carlo method. The high performance and Grid computing of the corresponding Monte Carlo scheme are discussed.

Parallel Monte Carlo algorithms for information retrieval

In any data mining applications, automated text and text and image retrieval of information is needed. This becomes essential with the growth of the Internet and digital libraries. Our approach is based on the latent semantic indexing (LSI) and the corresponding term-by-document matrix suggested by Berry and his co-authors. Instead of using deterministic methods to find the required number of first "k" singular triplets, we propose a stochastic approach. First, we use Monte Carlo method to sample and to build much smaller size term-by-document matrix (e.g. we build k x k matrix) from where we then find the first "k" triplets using standard deterministic methods. Second, we investigate how we can reduce the problem to finding the "k"-largest eigenvalues using parallel Monte Carlo methods. We apply these methods to the initial matrix and also to the reduced one. The algorithms are running on a cluster of workstations under MPI and results of the experiments arising in textual retrieval of Web documents as well as comparison of the stochastic methods proposed are presented. (C) 2003 IMACS. Published by Elsevier Science B.V. All rights reserved.

Monte Carlo methods for matrix computations on the grid

Many scientific and engineering applications involve inverting large matrices or solving systems of linear algebraic equations. Solving these problems with proven algorithms for direct methods can take very long to compute, as they depend on the size of the matrix. The computational complexity of the stochastic Monte Carlo methods depends only on the number of chains and the length of those chains. The computing power needed by inherently parallel Monte Carlo methods can be satisfied very efficiently by distributed computing technologies such as Grid computing. In this paper we show how a load balanced Monte Carlo method for computing the inverse of a dense matrix can be constructed, show how the method can be implemented on the Grid, and demonstrate how efficiently the method scales on multiple processors. (C) 2007 Elsevier B.V. All rights reserved.

Credit risk of interest rate swaps : a comparative study of CIR and Monte Carlo simulation approach

This paper compares the credit risk profile for two types of model, the Monte Carlo model used in the existing literature, and the Cox, Ingersoll and Ross (CIR) model. Each of the profiles has a concave or hump-backed shape, reflecting the amortisation and diffusion effects. However, the CIR model generates significantly different results. In addition, we consider the sensitivity of these models of credit risk to initial interest rates, volatility, maturity, kappa and delta. The results show that the sensitivities vary across the models, and we explore the meaning of that variation.

MONTE-CARLO SIMULATION OF POLYAMPHOLYTE CHAINS

Polyampholyte copolymers containing both positive and negative monomers regularly dispersed along the chain were studied. The Monte Carlo method was used to simulate chains with charged monomers interacting by screened Coulomb potential. The neutral polyampholyte chains collapse due to the attractive electrostatic interactions. The nonneutral chains are in extended conformations due to the repulsive polyelectrolyte effects that dominate the attractive polyampholyte interactions. The results are in good agreement with experiment.

Monte Carlo simulation applied in total reflection X-ray fluorescence: Preliminary results

The X-ray Fluorescence (XRF) analysis is a technique for the qualitative and quantitative determination of chemical constituents in a sample. This method is based on detection of the characteristic radiation intensities emitted by the elements of the sample, when properly excited. A variant of this technique is the Total Reflection X-ray Fluorescence (TXRF) that utilizes electromagnetic radiation as excitation source. In total reflection of X-ray, the angle of refraction of the incident beam tends to zero and the refracted beam is tangent to the sample support interface. Thus, there is a minimum angle of incidence at which no refracted beam exists and all incident radiation undergoes total reflection. In this study, we evaluated the influence of the energy variation of the beam of incident x-rays, using the MCNPX code (Monte Carlo NParticle) based on Monte Carlo method. © 2013 AIP Publishing LLC.

Teoria quântica do campo escalar real com autoacoplamento quártico - simulações de Monte Carlo na rede com um algoritmo worm

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Cálculo das funções de anisotropia e radial de dose para braquiterapia com semente de 192Ir em diferentes materiais de interesse em radiologia com o auxílio do programa baseado no método de Monte Carlo MCNPX

The brachytherapy braquiterapia is an x-ray modality radiotherapy in which stamped or halfstamped radioactive sources in format of seeds are used, wires or to one short distance, in contact or implanted to the fabric to be treated. All the treatment modalities require a previous planning. The formalism recommended for calculation of dose was considered by the AAPM for the first TG-43 Report. In it distributions of dose of isolated seeds measured and calculated by Monte Carlo method in water instead of with models half-empiricists. In this work we in accordance with present some preliminary results of the calculation of functions of radial anisotropy and of dose in the distance for seed of 192Ir, wide used in brachytherapy treatments of high tax of dose (HDR), with the aid of the program based on the Monte Carlo method MCNPX v2.50 (Mount Carlo N ParticleeXtended). The materials chosen in the simulation beyond water, had been MS20 and estriado muscle

Uso do método de Monte Carlo para simulação e detecção do espectro de raios-X gerado com feixes de elétrons em alvo de Molibdênio, utilizando o Geant4

The huge demand for procedures involving ionizing radiation promotes the need for safe methods of experimentation considering the danger of their biological e ects with consequent risk to humans. Brazilian's legislation prohibits experiments involving this type of radiation in humans through Decree 453 of Ministry of Health with determines that such procedures comply with the principles of justi cation, optimization and dose limitation. In this line, concurrently with the advancement of available computer processing power, computing simulations have become relevant in those situations where experimental procedures are too cost or impractical. The Monte Carlo method, created along the Manhattan Project duringWorldWar II, is a powerful strategy to simulations in computational physics. In medical physics, this technique has been extensively used with applications in diagnostics and cancer treatment. The objective of this work is to simulate the production and detection of X-rays for the energy range of diagnostic radiology, for molybdenum target, using the Geant4 toolkit. X-ray tubes with this kind of target material are used in diagnostic radiology, speci cally in mammography, one of the most used techniques for screening of breast cancer in women. During the simulations, we used di erent models for bremsstrahlung available in physical models for low energy, in situations already covered by the literature in earlier versions of Geant4. Our results show that although the physical situations seems qualitatively adequate, quantitative comparisons to available analytical data shows aws in the code of Geant4 Low Energy source

Estudo do método Monte Carlo e sua aplicação no modelo SIR

In this work we present a discussion and the results of the simulation of disease spread using the Monte Carlo method. The dissemination model is the SIR model and presents as main characteristic the disease evolution among individuals of the population subdivided into three groups: susceptible (S), infected (I) and recovered (R). The technique used is based on the introduction of transition probabilities S-> I and I->R to do the spread of the disease, they are governed by a Poisson distribution. The simulation of the spread of disease was based on the randomness introduced, taking into account two basic parameters of the model, the power of infection and average time of the disease. Considering appropriate values of these parameters, the results are presented graphically and analysis of these results gives information on a group of individuals react to the changes of these parameters and what are the chances of a disease becoming a pandemic