E(FG)<Superscript>2</Superscript>: a new fixed-grid shape optimization method based on the element-free galerkin mesh-free analysis

We propose a shape optimization method over a fixed grid. Nodes at the intersection with the fixed grid lines track the domain’s boundary. These “floating” boundary nodes are the only ones that can move/appear/disappear in the optimization process. The element-free Galerkin (EFG) method, used for the analysis problem, provides a simple way to create these nodes. The fixed grid (FG) defines integration cells for EFG method. We project the physical domain onto the FG and numerical integration is performed over partially cut cells. The integration procedure converges quadratically. The performance of the method is shown with examples from shape optimization of thermal systems involving large shape changes between iterations. The method is applicable, without change, to shape optimization problems in elasticity, etc. and appears to eliminate non-differentiability of the objective noticed in finite element method (FEM)-based fictitious domain shape optimization methods. We give arguments to support this statement. A mathematical proof is needed.     

Variational method for hexahedral grid generation with control metric

A variational method of generating spatial structured (or regular) grids composed of hexahedral cells is considered. In the method it is minimized the functional, whose integrand is a dimensionless ratio of metric invariants. The functional depends on the metric elements of two metrics. One metric is induced by a curvilinear grid generated in the physical domain, while the other control metric given in a special way provides additional control of the cell shape such as condensing the coordinate surfaces and orthogonalizing the coordinate lines of the grid towards the domain boundary. Nondegeneracy conditions for the grid and the hexahedral cell are discussed. The method for redistributing nodes over the domain boundary is considered. Grid generation examples are given.     

Adaptive finite element methods for shape optimization of linearly elastic structures

Grid adaptive methods combined with means for automatic remeshing are applied to problems in shape optimal design of linearly elastic structures. The quantitative effect of element distortion near the design boundaries is identified in terms of interpolation error associated with the finite element discretization. The grid adaptation is itself formulated as a structural optimization problem, with an objective function that reflects the discretization error. A ‘necessary condition’ from this formulation provides the basis for a computational procedure to predict the modified grid.To avoid the sometimes drastic distortion of the FEM grid that might otherwise occur in conjunction with design change, remeshing must be performed at intermediate stages of the overall solution process. In order to produce results for the optimal shape design without interruption in this process, the computer program combines numerical grid generation and automatic remeshing with the grid adaptation and design change. Results for several shape design problems obtained with the use of grid adaptation are compared to computational results predicted from a fixed grid. Both ‘r-’ and ‘h-adaptation’ are tested.     

Shape sensitivity analysis using a fixed basis function finite element approach

An approach is presented for the determination of solution sensitivity to changes in problem domain or shape. A finite element displacement formulation is adopted and the point of view is taken that the finite element basis functions and grid are fixed during the sensitivity analysis; therefore, the method is referred to as a “fixed basis function” finite element shape sensitivity analysis. This approach avoids the requirement of explicit or approximate differentiation of finite element matrices and vectors and the difficulty or errors resulting from such calculations. Effectively, the sensitivity to boundary shape change is determined exactly; thus, the accuracy of the solution sensitivity is dictated only by the finite element mesh used. The evaluation of sensitivity matrices and force vectors requires only modest calculations beyond those of the reference problem finite element analysis; that is, certain boundary integrals and reaction forces on the reference location of the moving boundary are required. In addition, the formulation provides the unique family of element domain changes which completely eliminates the inclusion of grid sensitivity from the shape sensitivity calculation. The work is illustrated for some one-dimensional beam problems and is outlined for a two-dimensional C⁰ problem; the extension to three-dimensional problems is straight-forward. Received December 5, 1999?Revised mansucript received July 6, 2000     

2D structured grid generation method producing a mesh with prescribed properties near boundary

A variational method of generating a structured mesh on a two-dimensional domain is considered. To this end, a quasiconformal mapping of the parametric domain with a given Cartesian mesh onto the underlying physical domain is used. The functions implementing the mapping are sought by solving the Dirichlet problem for the system of elliptic second-order partial differential equations. An additional control for the cell shape is executed by introducing a local mapping which induces a control metric. In some particular cases, instead of an additional local mapping, a global mapping of the parametric domain onto the intermediate domain is used, where the curvilinear mesh is produced, and next this domain is mapped onto the underlying physical domain. The control metric allows to obtain a mesh with required properties: grid line orthogonality and prescribed mesh point clustering near the domain boundary. Examples of mesh in the annulus and near airfoil are presented.     

Prediction of dual agents as an activator of mutant p53 and inhibitor of Hsp90 by docking,molecular dynamic simulation and virtual screening

Heat shock protein90s (Hsp90s) play a crucial role in the development of cancer, and their inhibitors are a main target for tumor suppression. P53 also is a tumor suppressor, but in cancer cells, mutations in the p53 gene lead to the inactivation and accumulation of protein. For instance, the ninth p53 cancer mutation, Y220C, destabilizes the p53 core domain. Small molecules have been assumed to bind to Y220C DNA-binding domain and reactivate cellular mutant p53 functions. In this study, one of the mutant p53 activators is suggested as an Hsp90 inhibitor according to a pyrazole scaffold. To confirm a new ligand as a dual agent, molecular docking and molecular dynamic simulations were performed on both proteins (p53 and Hsp90). Molecular dynamic simulations were also conducted to evaluate the obtained results on the other two pyrazole structures, one known as Hsp90 inhibitor and the other as the reported mutant p53 activator. The findings indicate that the new ligand was stable in the active site of both proteins. Finally, a virtual screening was performed on ZINC database, and a set of new dual agents was proposed according to the new ligand scaffold.     

Revisiting the Anatomy and Physiology of the Grid

A domain-specific software architecture (DSSA) represents an effective, generalized, reusable solution to constructing software systems within a given application domain. In this paper, we revisit the widely cited DSSA for the domain of grid computing. We have studied systems in this domain over the last ten years. During this time, we have repeatedly observed that, while individual grid systems are widely used and deemed successful, the grid DSSA is actually underspecified to the point where providing a precise answer regarding what makes a software system a grid system is nearly impossible. Moreover, every one of the existing purported grid technologies actually violates the published grid DSSA. In response to this, based on an analysis of the source code, documentation, and usage of eighteen of the most pervasive grid technologies, we have significantly refined the original grid DSSA. We demonstrate that this DSSA much more closely matches the grid technologies studied. Our refinements allow us to more definitively identify a software system as a grid technology, and distinguish it from software libraries, middleware, and frameworks.     

信息网格跨域访问权限控制的研究

信息网格中资源的共享通过访问控制对合法用户和信息服务请求进行授权来实现,访问控制机制的采用受到信息网格的复合管理域特点的影响。本文阐述了信息网格访问控制的关键问题,分析了信息网格的多管理域特点,进一步提出了一个可以动态更新信息的复合式授权和查验机制,从而解决跨域访问带来的困难、简化管理操作。     

Eulerian shape design sensitivity analysis and optimization with a fixed grid

Conventional shape optimization based on the finite element method uses Lagrangian representation in which the finite element mesh moves according to shape change, while modern topology optimization uses Eulerian representation. In this paper, an approach to shape optimization using Eulerian representation such that the mesh distortion problem in the conventional approach can be resolved is proposed. A continuum geometric model is defined on the fixed grid of finite elements. An active set of finite elements that defines the discrete domain is determined using a procedure similar to topology optimization, in which each element has a unique shape density. The shape design parameter that is defined on the geometric model is transformed into the corresponding shape density variation of the boundary elements. Using this transformation, it has been shown that the shape design problem can be treated as a parameter design problem, which is a much easier method than the former. A detailed derivation of how the shape design velocity field can be converted into the shape density variation is presented along with sensitivity calculation. Very efficient sensitivity coefficients are calculated by integrating only those elements that belong to the structural boundary. The accuracy of the sensitivity information is compared with that derived by the finite difference method with excellent agreement. Two design optimization problems are presented to show the feasibility of the proposed design approach.     

一种Data Matrix条码的快速识别方法*

为满足工业流水线对条码识别实时性的要求,提出了一种Data Matrix条码快速识别方法。采用形状参数、圆形性作为矩形特征,初步确定Data Matrix条码位置;采用距离为角度的函数对Data Matrix条码边界进行标记,将Data Matrix 的2D条码边界转换为1D波形函数进行分析,进行一次求导获取条码边界的位置及角度;利用边界角度作为仿射变换的角度,将条码旋转到规格化位置,采用网格法进行数据提取并进行条码解码。对像素大小为640×480的400幅含Data Matrix条码图片在PC机上进行测     

Efficient high-quality volume rendering of SPH data

High quality volume rendering of SPH data requires a complex order-dependent resampling of particle quantities along the view rays. In this paper we present an efficient approach to perform this task using a novel view-space discretization of the simulation domain. Our method draws upon recent work on GPU-based particle voxelization for the efficient resampling of particles into uniform grids. We propose a new technique that leverages a perspective grid to adaptively discretize the view-volume, giving rise to a continuous level-of-detail sampling structure and reducing memory requirements compared to a uniform grid. In combination with a level-of-detail representation of the particle set, the perspective grid allows effectively reducing the amount of primitives to be processed at run-time. We demonstrate the quality and performance of our method for the rendering of fluid and gas dynamics SPH simulations consisting of many millions of particles.     

Efficient and Adaptive Rendering of 2-D Continuous Scatterplots

We extend the rendering technique for continuous scatterplots to allow for a broad class of interpolation methods within the spatial grid instead of only linear interpolation. To do this, we propose an approach that projects the image of a cell from the spatial domain to the scatterplot domain. We approximate this image using either the convex hull or an axis-aligned rectangle that forms a tight fit of the projected points. In both cases, the approach relies on subdivision in the spatial domain to control the approximation error introduced in the scatterplot domain. Acceleration of this algorithm in homogeneous regions of the spatial domain is achieved using an octree hierarchy. The algorithm is scalable and adaptive since it allows us to balance computation time and scatterplot quality. We evaluate and discuss the results with respect to accuracy and computational speed. Our methods are applied to examples of 2-D transfer function design.     

A novel hybrid algorithm based on FDTD and WCS‐FDTD methods

In this article, a hybrid algorithm based on traditional finite‐difference time‐domain (FDTD) and weakly conditionally stable finite‐difference time‐domain (WCS‐FDTD) algorithm is proposed. In this algorithm, the calculation domain is divided into fine‐grid region and coarse‐grid region. The traditional FDTD method is used to calculate the field value in the coarse‐grid region, while the WCS‐FDTD method is used in the fine‐grid region. The spatial interpolation scheme is applied to the interface of the coarse grid region and fine grid region to insure the stability and precision of the presented hybrid algorithm. As a result, a relatively large time step size, which is only determined by the spatial cell sizes in the coarse grid region, is applied to the entire calculation domain. This scheme yields a significant reduction both of computation time and memory requirement in comparison with the conventional FDTD method and WCS‐FDTD method, which are validated by using numerical results.     

A microcomputer-based program for video analysis of chemotaxis under agarose

We have developed a computerized system for the quantification of video images of cell migration patterns obtained in the chemotaxis under agarose assay. This system allows either manual or automatic measurement of standard parameters of chemotaxis, as well as quantification of three new parameters which reflect mean cell movement and chemokinesis. The parameters of mean cell population movement are not obtainable by the traditional analysis of the chemotaxis under agarose assay. Our system operates on an inexpensive microcomputer, is easy to use and provides data output in a format that is directly transferable to standard statistical packages.     

网格环境下基于Bayesian网络的信任模型研究

在开放的网格中,为不同管理域之间建立信任关系并以此实现他们之间的协同工作是当前网格所面临的一个主要安全问题。为了提高网格的安全性和可扩展性,论文提出了一个网格环境下基于Bayesian网络的分层信任模型,用以解决处于不同管理域的实体之间协同工作的安全问题。模型上层建立和维护具有不同安全策略管理域之间的推荐信任关系,下层负责处理管理者对域内实体的信任评估问题。同时考虑了影响实体之间直接信任值的不同因素,以及他们之间复杂的依赖关系,利用Bayesian网络和领域层次结构相结合的方法有效合理地将各方面因素整合起来,形成能够反映实体在不同方面的直接信任值。     

基于格网划分的城市区域土地利用景观格局时空变化遥感监测

城市化引起的土地利用变化已成为城市问题研究热点。多时相遥感变化检测能够监测到土地利用变化的数量,被广泛地用来进行城市扩张研究。对于城市化引起的城市空间结构变化,最新研究引入景观格局分析法,大量涌现的景观指标为景观格局定量化表达提供了基础。目前对于城市化过程中景观格局时空变化的描述过于笼统,一般是对整个研究区域提取全局景观格局及其时间变化。通过提出一种基于网格划分的景观格局提取与时空变化检测方法,并运用此方法研究了北京市城市化进程中景观格局的时空变化。结果表明:基于网格划分的景观格局变化检测方法能够检测出城市空间结构变化的数量、位置和模式,为理解城市扩张行为以及城市扩张建模提供了相比较于遥感土地利用变化检测之外的另一种知识。     

A local cell quality metric and variational grid smoothing algorithm

A local cell quality metric is introduced and used to construct a variational functional for a grid smoothing algorithm. A maximum principle is proved and the properties of the local quality measure, which combines element shape and size control metrics, are investigated. Level set contours are displayed to indicate the effect of cell distortion. The approach is demonstrated for meshes of triangles and quadrilaterals in 2D and a test case with hexahedral cells in 3D. Issues such as the use of a penalty for folded meshes and the effect of valence change in the mesh patches are considered.     

Global shape reconstruction of nano grid with singly fixed camera

Depth from defocus(DFD),as a typical shape reconstruction method,has been widely researched in most recent years.However,all the existing DFD algorithms require at least two defocused images with different camera parameters.Unfortunately,in micro/nano manipulation,any change on visual sensor's parameters is absolutely forbidden.Therefore,a novel DFD method to reconstruct the shape of a nano grid on micro/nano scale is researched in this paper.First,the blurring imaging model is constructed with the relative...     

Oppositional target domain estimation using grid-based simulation

In this paper we address the problem of estimating the target domain for search and navigation problems. We propose oppositional target domain estimation by modeling the search and navigation environment as a grid. Typically real-world applications exhibit an environment that is extremely large, dramatically diminishing the usability of intelligent agents for search and navigation. The reduction of the size of environment, hence, can help to increase the efficiency and applicability of the agents. We address this issue by modeling the environment as a grid and estimating the target domain inside the environment. The target domain is a reduced space which includes the target. The proposed technique is specifically concerned with reducing the environment using the concept of opposition. Experimental results show significant reduction of the environment size resulting in a shorter search time.