954 resultados para Shishkin mesh
Resumo:
In present paper, a new Micromegas detector is developed, and its time and energy signals are obtained in the figure form. The rising time of fast time signal is less than 2 ns due to the very fast collection of avalanche electrons, and the rising time of the energy pulse is about 100 ns, which is corresponding to the total collecting time of the electrons and ions in the avalanche process. The counter plateau, energy resolution and the gas gains of the detector have been compared with other groups' experimental results and the Garfield simulation result.
Resumo:
In this paper, a batch file which describes the detailed structure and the corresponding physical process of Micro-Mesh Gaseous Structure (Micromegas) detector, the macro commands and the control structures based on the Garfield program has been developed. And using the Garfield program controlled by this batch file, the detector's gain and spatial resolution have been investigated under different conditions. These results obtained by the simulation program not only exhibit the influences of the mesh and drift voltage, the mixture gas proportion, the distance between the mesh cathode and the printed circuit board readout anode, and the Lines Per Inch of the mesh cathode on the gain and spatial resolution of the detector, but also are very important to optimize the design, shorten the experimental period, and save cost during the detector development. Additionally, they also indicate that the Garfield program is a powerful tool for the Micromegas detector design and optimization.
Resumo:
The influences of different cations on plasmid DNA network structures on a mica substrate were investigated by atomic force microscopy (AFM). Interactions between the DNA strands and mica substrate, and between the DNA strands themselves were more strongly influenced by the complex cations (Fe(phen)(3)(2+), Ni(phen)(3)(2+), and Co(phen)(3)(3+)) than by the simple cations (Mg2+, Mn2+, Ni2+, Ca2+, Co3+). The mesh height of the plasmid DNA network was higher when the complex cations were added to DNA samples. The mesh size decreased with increasing DNA concentration and increased with decreasing DNA concentration in the same cation solution sample. Hence, plasmid DNA network height can be controlled by selecting different cations, and the mesh size can be controlled by adjusting plasmid DNA concentration.
Resumo:
The microregion approximation explicit finite difference method is used to simulate cyclic voltammetry of an electrochemical reversible system in a three-dimensional thin layer cell with minigrid platinum electrode. The simulated CV curve and potential scan-absorbance curve were in very good accordance with the experimental results, which differed from those at a plate electrode. The influences of sweep rate, thickness of the thin layer, and mesh size on the peak current and peak separation were also studied by numerical analysis, which give some instruction for choosing experimental conditions or designing a thin layer cell. The critical ratio (1.33) of the diffusion path inside the mesh hole and across the thin layer was also obtained. If the ratio is greater than 1.33 by means of reducing the thickness of a thin layer, the electrochemical property will be far away from the thin layer property.
Resumo:
The heterogeneous electron transfer reaction of hemeproteins including hemoglobin, myoglobin and cytochrome C at Pt mesh electrode adsorbed methylene blue has been investigated. Thin-layer spectroelectrochemical technique was used for observing the electron transfer processes of three kinds of proteins, and the corresponding electrode rate constants were measured.
Resumo:
Using a Biolistic PDS 1000/He system, healthy thalli of Gracilaria changii were bombarded with gold particles coated with plasmid DNA containing the lacZ reporter gene. Transient expression of lacZ was observed in bombarded thalli under the rupture-disc pressures of 4482, 6206, 7584 and 8963 KPa, two days after bombardment. Although G. changii exhibits a slight blue background, positive expression and the background colour can be clearly differentiated. The results indicate that lacZ could be a useful reporter gene and that SV40 promoter could be an effective promoter for Gracilaria transformation.
Resumo:
数字几何是图形学中三维物体的主要表示方法之一,相应的数字几何处理理论和技术是计算机图形学研究的热点,在曲面造型、工业制造以及影视娱乐等领域得到了广泛应用。近20年来,数字几何处理取得了很大的发展,特别是数字几何作为一种多媒体数据所取得的突破,使其有可能成为继数字音频、数字图像和数字视频之后的第四类多媒体数据。但是,目前针对数字几何的处理技术和能力非常有限,数字几何处理的理论还不够成熟,其应用范围还有待进一步扩展。围绕上述问题,本文对数字几何处理中的若干关键技术进行了深入的研究和探讨,主要研究内容和贡献如下: 1. 散乱点是数字几何数据的主要存在形式之一,这些通过测量得到的数据仅包含采样点的三维坐标,缺乏必要的拓扑信息。为便于后续数字几何处理,研究了散乱点集的网格曲面重建方法。 提出了用于散乱点网格曲面增量重建的外接球准则,将二维Delaunay三角剖分的空外接圆性质扩展到三维空间,利用该准则实现了一种高效的重建方法。并对因散乱点密度分布不均或具有严重噪声等原因造成的拓扑错误和孔洞,也给出了改正和修补的方法。与已有方法相比,本文方法重建出的网格模型具有Delaunay性质(孔洞修补区域除外),同时算法的时间复杂度低,提高了散乱点网格曲面重建的效率。 2. 针对网格模型包含噪声、数据量存在冗余、拓扑规则性和几何规则性不高等缺陷,详细讨论了数字几何处理中的多种优化技术,主要包括光顺、精简、细分和重新网格化。其中,为了满足交互式变形编辑和数值分析对模型规则性的要求,重点研究了网格模型的重新网格化技术。 提出了一种基于采样和松弛的重新网格化方法,主要分为采样、粒化、匀价、松弛和回映五个步骤,通过迭代完成。其中粒化过程对大的面片进行分割,对小的面片进行合并;匀价和松弛过程分别用来提高模型的拓扑规则性和几何规则性;模型的分辨率通过改变包围盒的分割数进行控制。算法还针对机械类零件模型,将模型的尖锐棱角作为特征对待,使其在重新网格化后得到保持。与已有基于参数化的方法相比,所提出的方法直接在网格模型上进行,避免了耗时的参数化过程,也无须对封闭模型进行分割,因此该方法效率高,具有良好的拓扑适应性。 3. 研究了网格模型的交互式变形编辑技术。给出了三角网格模型微分属性表示方法在微分几何学上的解释,并采用这种表示方法实现了网格模型的交互式变形编辑。 提出了一种通过修改侧影轮廓改变模型三维几何形状的交互式编辑方法。与已有变形方法相比,本文的交互方式更加灵活。由于所采用的微分属性表示反映了曲面的内蕴几何属性,因此在变形过程中能够保持模型的几何细节。经过变形编辑的模型既可以用于快速原型制造,也可以作为通用CAD系统的输入进行更复杂的造型编辑。 4. 详细讨论了参数化中度量扭曲的产生,并对多种平面参数化方法进行了比较。针对拓扑圆盘类网格曲面,研究了参数化方法在运动机构轨迹规划和动画制作中的应用。 提出了一种基于均值坐标映射的运动机构轨迹规划方法,并对封闭网格模型的整体运动轨迹规划进行了初步研究。该方法不仅适用于自由曲面类零件的数控加工,也可以用于激光熔覆、喷涂和抛光等场合,扩大了网格模型参数化技术的应用范围。 提出了一种基于平面参数化的二维和三维网格之间渐变的方法,通过关键帧插值实现了简单的动画制作。 5. 设计并实现了一个数字几何处理原型软件。作为实验平台,该系统集成了本文所取得的全部研究成果,同时也包括了多种常用的数字几何处理算法。
Resumo:
As the most spectacular and youngest case of continental collision on the Earth, to investigate the crust and mantle of Tibetan plateau, and then to reveal its characters of structure and deformation, are most important to understand its deformation mechanism and deep process. A great number of surface wave data were initially collected from events occurred between 1980 and 2002, which were recorded by 13 broadband digital stations in Eurasia and India. Up to 1,525 source-station Rayleigh waveforms and 1,464 Love wave trains were analysed to obtain group velocity dispersions, accompanying with the detail and quantitative assessment of the fitness of the classic Ray Theory, errors from focal and measurements. Assuming the model region covered by a mesh of 2ox2o-sized grid-cells, we have used the damped least-squares approach and the SVD to carry out tomographic inversion, SV- and SH-wave velocity images of the crust and upper mantle beneath the Tibetan Plateau and surroundings are obtained, and then the radial anisotropy is computed from the Love-Rayleigh discrepancy. The main results demonstrate that follows, a) The Moho beneath the Tibetan Plateau presents an undulating shape that lies between 65 and 74 km, and a clear correlation between the elevations of the plateau and the Moho topography suggests that at least a great part of the highly raised plateau is isostatically compensated. b) The lithospheric root presents a depth that can be substantiated at ~140 km (Qiangtang Block) and exceptionally at ~180 km (Lhasa Block), and exhibits laterally varying fast velocity between 4.6 and 4.7 km/s, even ~4.8 km/s under northern Lhasa Block and Qiangtang Block, which may be correlated with the presence of a shield-like upper mantle beneath the Tibetan Plateau and therefore looked as one of the geophysical tests confirming the underthrusting of India, whose leading edge might have exceeded the Bangong-Nujiang Suture, even the Jinsha Suture. c) The asthenosphere is depicted by a low velocity channel at depths between 140 and 220 km with negative velocity gradient and velocities as low as 4.2 km/s; d) Areas in which transverse radial anisotropy is in excess of ~4% and 6% on the average anisotropy are found in the crust and upper mantle underlying most of the Plateau, and up to 8% in some places. The strength, spatial configuration and sign of radial anisotropy seem to indicate the existence of a regime of horizontal compressive forces in the frame of the convergent orogen at the same time that laterally varying lithospheric rheology and a differential movement as regards the compressive driving forces. e) Slow-velocity anomalies of 12% or more in southern Tibet and the eastern edge of the Plateau support the idea of a mechanically weak middle-to-lower crust and the existence of crustal flow in Tibet.
Resumo:
This dissertation presents a series of irregular-grid based numerical technique for modeling seismic wave propagation in heterogeneous media. The study involves the generation of the irregular numerical mesh corresponding to the irregular grid scheme, the discretized version of motion equations under the unstructured mesh, and irregular-grid absorbing boundary conditions. The resulting numerical technique has been used in generating the synthetic data sets on the realistic complex geologic models that can examine the migration schemes. The motion equation discretization and modeling are based on Grid Method. The key idea is to use the integral equilibrium principle to replace the operator at each grid in Finite Difference scheme and variational formulation in Finite Element Method. The irregular grids of complex geologic model is generated by the Paving Method, which allow varying grid spacing according to meshing constraints. The grids have great quality at domain boundaries and contain equal quantities of nodes at interfaces, which avoids the interpolation of parameters and variables. The irregular grid absorbing boundary conditions is developed by extending the Perfectly Matched Layer method to the rotated local coordinates. The splitted PML equations of the first-order system is derived by using integral equilibrium principle. The proposed scheme can build PML boundary of arbitrary geometry in the computational domain, avoiding the special treatment at corners in a standard PML method and saving considerable memory and computation cost. The numerical implementation demonstrates the desired qualities of irregular grid based modeling technique. In particular, (1) smaller memory requirements and computational time are needed by changing the grid spacing according to local velocity; (2) Arbitrary surfaces and interface topographies are described accurately, thus removing the artificial reflection resulting from the stair approximation of the curved or dipping interfaces; (3) computational domain is significantly reduced by flexibly building the curved artificial boundaries using the irregular-grid absorbing boundary conditions. The proposed irregular grid approach is apply to reverse time migration as the extrapolation algorithm. It can discretize the smoothed velocity model by irregular grid of variable scale, which contributes to reduce the computation cost. The topography. It can also handle data set of arbitrary topography and no field correction is needed.
Resumo:
By seismic tomography, interesting results have been achieved not only in the research of the geosphere with a large scale but also in the exploration of resources and projects with a small scale since 80'. Compared with traditional inversion methods, seismic tomography can offer more and detailed information about subsurface and has been being paid attention by more and more geophysicists. Since inversion based on forward modeling, we have studied and improved the methods to calculate seismic traveltimes and raypaths in isotropic and anisotropic media, and applied the improved forward methods to traveltime tomography. There are three main kinds of methods to calculate seismic traveltime field and its ray path distribution, which are ray-tracing theory, eikonal equation by the finite-difference and minimum traveltime tree algorithm. In ray tracing, five methods are introduced in the paper, including analytic ray tracing, ray shooting, ray bending, grid ray tracing and rectangle grid ray perturbation with three points. Finite-difference solution of eikonal equation is very efficient in calculation of seismic first-break, but is awkward in calculation of reflection traveltimes. We have put forward a idea to calculate traveltimes of reflected waves using a combining way of eikonal equation method and other one in order to improve its capability of dealing with reflection waves. The minimum traveltime tree algorithm has been studied with emphases. Three improved algorithms are put forward on the basis of basic algorithm of the minimum traveltime tree. The first improved algorithm is called raypath tracing backward minimum traveltime algorithm, in which not only wavelets from the current source but also wavelets from upper source points are all calculated. The algorithm can obviously improve the speed of calculating traveltimes and raypaths in layered or blocked homogeneous media and keep good accuracy. The second improved algorithm is raypath key point minimum traveltime algorithm in which traveltimes and raypaths are calculated with a view of key points of raypaths (key points of raypths mean the pivotal points which determine raypaths). The raypath key point method is developed on the basis of the first improved algorithm, and has better applicability. For example, it is very efficient even for inhomogeneous media. Another improved algorithm, double grid minimum traveltime tree algorithm, bases upon raypath key point scheme, in which a model is divided with two kinds of grids so that the unnecessary calculation can be left out. Violent undulation of curved interface often results in the phenomenon that there are no reflection points on some parts of interfaces where there should be. One efficacious scheme that curved interfaces are divided into segments, and these segments are treated respectively is presented to solve the problem. In addition, the approximation to interfaces with discrete grids leads to large errors in calculation of traveltimes and raypaths. Noting the point, we have thought a new method to remove the negative effect of mesh and to improve calculation accuracy by correcting the traveltimes with a little of additional calculation, and obtained better results.
Resumo:
The M-Machine is an experimental multicomputer being developed to test architectural concepts motivated by the constraints of modern semiconductor technology and the demands of programming systems. The M- Machine computing nodes are connected with a 3-D mesh network; each node is a multithreaded processor incorporating 12 function units, on-chip cache, and local memory. The multiple function units are used to exploit both instruction-level and thread-level parallelism. A user accessible message passing system yields fast communication and synchronization between nodes. Rapid access to remote memory is provided transparently to the user with a combination of hardware and software mechanisms. This paper presents the architecture of the M-Machine and describes how its mechanisms maximize both single thread performance and overall system throughput.
Resumo:
This technical report describes a new protocol, the Unique Token Protocol, for reliable message communication. This protocol eliminates the need for end-to-end acknowledgments and minimizes the communication effort when no dynamic errors occur. Various properties of end-to-end protocols are presented. The unique token protocol solves the associated problems. It eliminates source buffering by maintaining in the network at least two copies of a message. A token is used to decide if a message was delivered to the destination exactly once. This technical report also presents a possible implementation of the protocol in a worm-hole routed, 3-D mesh network.
Resumo:
Reconstructing a surface from sparse sensory data is a well known problem in computer vision. Early vision modules typically supply sparse depth, orientation and discontinuity information. The surface reconstruction module incorporates these sparse and possibly conflicting measurements of a surface into a consistent, dense depth map. The coupled depth/slope model developed here provides a novel computational solution to the surface reconstruction problem. This method explicitly computes dense slope representation as well as dense depth representations. This marked change from previous surface reconstruction algorithms allows a natural integration of orientation constraints into the surface description, a feature not easily incorporated into earlier algorithms. In addition, the coupled depth/ slope model generalizes to allow for varying amounts of smoothness at different locations on the surface. This computational model helps conceptualize the problem and leads to two possible implementations- analog and digital. The model can be implemented as an electrical or biological analog network since the only computations required at each locally connected node are averages, additions and subtractions. A parallel digital algorithm can be derived by using finite difference approximations. The resulting system of coupled equations can be solved iteratively on a mesh-pf-processors computer, such as the Connection Machine. Furthermore, concurrent multi-grid methods are designed to speed the convergence of this digital algorithm.
Resumo:
Projeto de Pós-Graduação/Dissertação apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Medicina Dentária