A New Approach to Fully Automatic Mesh Generation
Institute of Scientific and Technical Information of China (English)
闵卫东; 张征明; 等
1995-01-01
Automatic mesh generation is one of the most important parts in CIMS (Computer Integrated Manufacturing System).A method based on mesh grading propagation which automatically produces a triangular mesh in a multiply connected planar region is presented in this paper.The method decomposes the planar region into convex subregions,using algorithms which run in linear time.For every subregion,an algorithm is used to generate shrinking polygons according to boundary gradings and form delaunay triangulation between two adjacent shrinking polygons,both in linear time.It automatically propagates boundary gradings into the interior of the region and produces satisfactory quasi-uniform mesh.
Procedure for the automatic mesh generation of innovative gear teeth
Directory of Open Access Journals (Sweden)
Radicella Andrea Chiaramonte
2016-01-01
Full Text Available After having described gear wheels with teeth having the two sides constituted by different involutes and their importance in engineering applications, we stress the need for an efficient procedure for the automatic mesh generation of innovative gear teeth. First, we describe the procedure for the subdivision of the tooth profile in the various possible cases, then we show the method for creating the subdivision mesh, defined by two series of curves called meridians and parallels. Finally, we describe how the above procedure for automatic mesh generation is able to solve specific cases that may arise when dealing with teeth having the two sides constituted by different involutes.
Automatic Mesh Generation on a Regular Background Grid
Institute of Scientific and Technical Information of China (English)
LO S.H; 刘剑飞
2002-01-01
This paper presents an automatic mesh generation procedure on a 2D domainbased on a regular background grid. The idea is to devise a robust mesh generation schemewith equal emphasis on quality and efficiency. Instead of using a traditional regular rectangulargrid, a mesh of equilateral triangles is employed to ensure triangular element of the best qualitywill be preserved in the interior of the domain.As for the boundary, it is to be generated by a node/segment insertion process. Nodes areinserted into the background mesh one by one following the sequence of the domain boundary.The local structure of the mesh is modified based on the Delaunay criterion with the introduc-tion of each node. Those boundary segments, which are not produced in the phase of nodeinsertion, will be recovered through a systematic element swap process. Two theorems will bepresented and proved to set up the theoretical basic of the boundary recovery part. Exampleswill be presented to demonstrate the robustness and the quality of the mesh generated by theproposed technique.
The mesh-matching algorithm: an automatic 3D mesh generator for Finite element structures
Couteau, B; Lavallee, S; Payan, Yohan; Lavallee, St\\'{e}phane
2000-01-01
Several authors have employed Finite Element Analysis (FEA) for stress and strain analysis in orthopaedic biomechanics. Unfortunately, the use of three-dimensional models is time consuming and consequently the number of analysis to be performed is limited. The authors have investigated a new method allowing automatically 3D mesh generation for structures as complex as bone for example. This method called Mesh-Matching (M-M) algorithm generated automatically customized 3D meshes of bones from an already existing model. The M-M algorithm has been used to generate FE models of ten proximal human femora from an initial one which had been experimentally validated. The new meshes seemed to demonstrate satisfying results.
AUTOMATIC MESH GENERATION OF 3-D GEOMETRIC MODELS
Institute of Scientific and Technical Information of China (English)
刘剑飞
2003-01-01
In this paper the presentation of the ball-packing method is reviewed,and a scheme to generate mesh for complex 3-D geometric models is given,which consists of 4 steps:(1)create nodes in 3-D models by ball-packing method,(2)connect nodes to generate mesh by 3-D Delaunay triangulation,(3)retrieve the boundary of the model after Delaunay triangulation,(4)improve the mesh.
Automatic Mesh Generation of Hybrid Mesh on Valves in Multiple Positions in Feedline Systems
Ross, Douglass H.; Ito, Yasushi; Dorothy, Fredric W.; Shih, Alan M.; Peugeot, John
2010-01-01
Fluid flow simulations through a valve often require evaluation of the valve in multiple opening positions. A mesh has to be generated for the valve for each position and compounding. The problem is the fact that the valve is typically part of a larger feedline system. In this paper, we propose to develop a system to create meshes for feedline systems with parametrically controlled valve openings. Herein we outline two approaches to generate the meshes for a valve in a feedline system at multiple positions. There are two issues that must be addressed. The first is the creation of the mesh on the valve for multiple positions. The second is the generation of the mesh for the total feedline system including the valve. For generation of the mesh on the valve, we will describe the use of topology matching and mesh generation parameter transfer. For generation of the total feedline system, we will describe two solutions that we have implemented. In both cases the valve is treated as a component in the feedline system. In the first method the geometry of the valve in the feedline system is replaced with a valve at a different opening position. Geometry is created to connect the valve to the feedline system. Then topology for the valve is created and the portion of the topology for the valve is topology matched to the standard valve in a different position. The mesh generation parameters are transferred and then the volume mesh for the whole feedline system is generated. The second method enables the user to generate the volume mesh on the valve in multiple open positions external to the feedline system, to insert it into the volume mesh of the feedline system, and to reduce the amount of computer time required for mesh generation because only two small volume meshes connecting the valve to the feedline mesh need to be updated.
Development of an Immersive Environment to Aid in Automatic Mesh Generation LDRD Final Report
Energy Technology Data Exchange (ETDEWEB)
Pavlakos, Constantine J.
1998-10-01
The purpose of this work was to explore the use of immersive technologies, such as those used in synthetic environments (commordy referred to as virtual realily, or VR), in enhancing the mesh- generation process for 3-dimensional (3D) engineering models. This work was motivated by the fact that automatic mesh generation systems are still imperfect - meshing algorithms, particularly in 3D, are sometimes unable to construct a mesh to completion, or they may produce anomalies or undesirable complexities in the resulting mesh. It is important that analysts and meshing code developers be able to study their meshes effectively in order to understand the topology and qualily of their meshes. We have implemented prototype capabilities that enable such exploration of meshes in a highly visual and intuitive manner. Since many applications are making use of increasingly large meshes, we have also investigated approaches to handle large meshes while maintaining interactive response. Ideally, it would also be possible to interact with the meshing process, allowing interactive feedback which corrects problems and/or somehow enables proper completion of the meshing process. We have implemented some functionality towards this end -- in doing so, we have explored software architectures that support such an interactive meshing process. This work has incorporated existing technologies developed at SandiaNational Laboratories, including the CUBIT mesh generation system, and the EIGEN/VR (previously known as MUSE) and FLIGHT systems, which allow applications to make use of immersive technologies and advanced human computer interfaces. 1
Automatic generation of endocardial surface meshes with 1-to-1 correspondence from cine-MR images
Su, Yi; Teo, S.-K.; Lim, C. W.; Zhong, L.; Tan, R. S.
2015-03-01
In this work, we develop an automatic method to generate a set of 4D 1-to-1 corresponding surface meshes of the left ventricle (LV) endocardial surface which are motion registered over the whole cardiac cycle. These 4D meshes have 1- to-1 point correspondence over the entire set, and is suitable for advanced computational processing, such as shape analysis, motion analysis and finite element modelling. The inputs to the method are the set of 3D LV endocardial surface meshes of the different frames/phases of the cardiac cycle. Each of these meshes is reconstructed independently from border-delineated MR images and they have no correspondence in terms of number of vertices/points and mesh connectivity. To generate point correspondence, the first frame of the LV mesh model is used as a template to be matched to the shape of the meshes in the subsequent phases. There are two stages in the mesh correspondence process: (1) a coarse matching phase, and (2) a fine matching phase. In the coarse matching phase, an initial rough matching between the template and the target is achieved using a radial basis function (RBF) morphing process. The feature points on the template and target meshes are automatically identified using a 16-segment nomenclature of the LV. In the fine matching phase, a progressive mesh projection process is used to conform the rough estimate to fit the exact shape of the target. In addition, an optimization-based smoothing process is used to achieve superior mesh quality and continuous point motion.
Bucki, M; Bucki, Marek; Payan, Yohan
2005-01-01
In this paper, we address the problem of automatic mesh generation for finite elements modeling of anatomical organs for which a volumetric data set is available. In the first step a set of characteristic outlines of the organ is defined manually or automatically within the volume. The outlines define the "key frames" that will guide the procedure of surface reconstruction. Then, based on this information, and along with organ surface curvature information extracted from the volume data, a 3D scalar field is generated. This field allows a 3D reconstruction of the organ: as an iso-surface model, using a marching cubes algorithm; or as a 3D mesh, using a grid "immersion" technique, the field value being used as the outside/inside test. The final reconstruction respects the various topological changes that occur within the organ, such as holes and branching elements.
Atlas-Based Automatic Generation of Subject-Specific Finite Element Tongue Meshes.
Bijar, Ahmad; Rohan, Pierre-Yves; Perrier, Pascal; Payan, Yohan
2016-01-01
Generation of subject-specific 3D finite element (FE) models requires the processing of numerous medical images in order to precisely extract geometrical information about subject-specific anatomy. This processing remains extremely challenging. To overcome this difficulty, we present an automatic atlas-based method that generates subject-specific FE meshes via a 3D registration guided by Magnetic Resonance images. The method extracts a 3D transformation by registering the atlas' volume image to the subject's one, and establishes a one-to-one correspondence between the two volumes. The 3D transformation field deforms the atlas' mesh to generate the subject-specific FE mesh. To preserve the quality of the subject-specific mesh, a diffeomorphic non-rigid registration based on B-spline free-form deformations is used, which guarantees a non-folding and one-to-one transformation. Two evaluations of the method are provided. First, a publicly available CT-database is used to assess the capability to accurately capture the complexity of each subject-specific Lung's geometry. Second, FE tongue meshes are generated for two healthy volunteers and two patients suffering from tongue cancer using MR images. It is shown that the method generates an appropriate representation of the subject-specific geometry while preserving the quality of the FE meshes for subsequent FE analysis. To demonstrate the importance of our method in a clinical context, a subject-specific mesh is used to simulate tongue's biomechanical response to the activation of an important tongue muscle, before and after cancer surgery.
Miyawaki, Shinjiro; Tawhai, Merryn H.; Hoffman, Eric A.; Lin, Ching-Long
2014-11-01
The authors have developed a method to automatically generate non-uniform CFD mesh for image-based human airway models. The sizes of generated tetrahedral elements vary in both radial and longitudinal directions to account for boundary layer and multiscale nature of pulmonary airflow. The proposed method takes advantage of our previously developed centerline-based geometry reconstruction method. In order to generate the mesh branch by branch in parallel, we used the open-source programs Gmsh and TetGen for surface and volume meshes, respectively. Both programs can specify element sizes by means of background mesh. The size of an arbitrary element in the domain is a function of wall distance, element size on the wall, and element size at the center of airway lumen. The element sizes on the wall are computed based on local flow rate and airway diameter. The total number of elements in the non-uniform mesh (10 M) was about half of that in the uniform mesh, although the computational time for the non-uniform mesh was about twice longer (170 min). The proposed method generates CFD meshes with fine elements near the wall and smooth variation of element size in longitudinal direction, which are required, e.g., for simulations with high flow rate. NIH Grants R01-HL094315, U01-HL114494, and S10-RR022421. Computer time provided by XSEDE.
Spherical geodesic mesh generation
Energy Technology Data Exchange (ETDEWEB)
Fung, Jimmy [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Kenamond, Mark Andrew [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Burton, Donald E. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Shashkov, Mikhail Jurievich [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-02-27
In ALE simulations with moving meshes, mesh topology has a direct influence on feature representation and code robustness. In three-dimensional simulations, modeling spherical volumes and features is particularly challenging for a hydrodynamics code. Calculations on traditional spherical meshes (such as spin meshes) often lead to errors and symmetry breaking. Although the underlying differencing scheme may be modified to rectify this, the differencing scheme may not be accessible. This work documents the use of spherical geodesic meshes to mitigate solution-mesh coupling. These meshes are generated notionally by connecting geodesic surface meshes to produce triangular-prismatic volume meshes. This mesh topology is fundamentally different from traditional mesh topologies and displays superior qualities such as topological symmetry. This work describes the geodesic mesh topology as well as motivating demonstrations with the FLAG hydrocode.
Finite element mesh generation
Lo, Daniel SH
2014-01-01
Highlights the Progression of Meshing Technologies and Their ApplicationsFinite Element Mesh Generation provides a concise and comprehensive guide to the application of finite element mesh generation over 2D domains, curved surfaces, and 3D space. Organised according to the geometry and dimension of the problem domains, it develops from the basic meshing algorithms to the most advanced schemes to deal with problems with specific requirements such as boundary conformity, adaptive and anisotropic elements, shape qualities, and mesh optimization. It sets out the fundamentals of popular techniques
Automated quadrilateral mesh generation for digital image structures
Institute of Scientific and Technical Information of China (English)
无
2011-01-01
With the development of advanced imaging technology, digital images are widely used. This paper proposes an automatic quadrilateral mesh generation algorithm for multi-colour imaged structures. It takes an original arbitrary digital image as an input for automatic quadrilateral mesh generation, this includes removing the noise, extracting and smoothing the boundary geometries between different colours, and automatic all-quad mesh generation with the above boundaries as constraints. An application example is...
Miyawaki, Shinjiro; Tawhai, Merryn H.; Hoffman, Eric A.; Lin, Ching-Long
2013-11-01
The authors propose a method to automatically generate three-dimensional subject-specific airway geometries and meshes for computational fluid dynamics (CFD) studies of aerosol delivery in the human lungs. The proposed method automatically expands computed tomography (CT)-based airway skeleton to generate the centerline (CL)-based model, and then fits it to the CT-segmented geometry to generate the hybrid CL-CT-based model. To produce a turbulent laryngeal jet known to affect aerosol transport, we developed a physiologically-consistent laryngeal model that can be attached to the trachea of the above models. We used Gmsh to automatically generate the mesh for the above models. To assess the quality of the models, we compared the regional aerosol distributions in a human lung predicted by the hybrid model and the manually generated CT-based model. The aerosol distribution predicted by the hybrid model was consistent with the prediction by the CT-based model. We applied the hybrid model to 8 healthy and 16 severe asthmatic subjects, and average geometric error was 3.8% of the branch radius. The proposed method can be potentially applied to the branch-by-branch analyses of a large population of healthy and diseased lungs. NIH Grants R01-HL-094315 and S10-RR-022421, CT data provided by SARP, and computer time provided by XSEDE.
System Supporting Automatic Generation of Finite Element Using Image Information
Institute of Scientific and Technical Information of China (English)
J; Fukuda
2002-01-01
A mesh generating system has been developed in orde r to prepare large amounts of input data which are needed for easy implementation of a finite element analysis. This system consists of a Pre-Mesh Generator, an Automatic Mesh Generator and a Mesh Modifier. Pre-Mesh Generator produces the shape and sub-block information as input data of Automatic Mesh Generator by c arrying out various image processing with respect to the image information of th e drawing input using scanner. Automatic Mesh Generato...
Nanowire mesh solar fuels generator
Energy Technology Data Exchange (ETDEWEB)
Yang, Peidong; Chan, Candace; Sun, Jianwei; Liu, Bin
2016-05-24
This disclosure provides systems, methods, and apparatus related to a nanowire mesh solar fuels generator. In one aspect, a nanowire mesh solar fuels generator includes (1) a photoanode configured to perform water oxidation and (2) a photocathode configured to perform water reduction. The photocathode is in electrical contact with the photoanode. The photoanode may include a high surface area network of photoanode nanowires. The photocathode may include a high surface area network of photocathode nanowires. In some embodiments, the nanowire mesh solar fuels generator may include an ion conductive polymer infiltrating the photoanode and the photocathode in the region where the photocathode is in electrical contact with the photoanode.
GENERATION OF IRREGULAR HEXAGONAL MESHES
Directory of Open Access Journals (Sweden)
Vlasov Aleksandr Nikolaevich
2012-07-01
Decomposition is performed in a constructive way and, as option, it involves meshless representation. Further, this mapping method is used to generate the calculation mesh. In this paper, the authors analyze different cases of mapping onto simply connected and bi-connected canonical domains. They represent forward and backward mapping techniques. Their potential application for generation of nonuniform meshes within the framework of the asymptotic homogenization theory is also performed to assess and project effective characteristics of heterogeneous materials (composites.
Documentation for MeshKit - Reactor Geometry (&mesh) Generator
Energy Technology Data Exchange (ETDEWEB)
Jain, Rajeev [Argonne National Lab. (ANL), Argonne, IL (United States); Mahadevan, Vijay [Argonne National Lab. (ANL), Argonne, IL (United States)
2015-09-30
This report gives documentation for using MeshKit’s Reactor Geometry (and mesh) Generator (RGG) GUI and also briefly documents other algorithms and tools available in MeshKit. RGG is a program designed to aid in modeling and meshing of complex/large hexagonal and rectilinear reactor cores. RGG uses Argonne’s SIGMA interfaces, Qt and VTK to produce an intuitive user interface. By integrating a 3D view of the reactor with the meshing tools and combining them into one user interface, RGG streamlines the task of preparing a simulation mesh and enables real-time feedback that reduces accidental scripting mistakes that could waste hours of meshing. RGG interfaces with MeshKit tools to consolidate the meshing process, meaning that going from model to mesh is as easy as a button click. This report is designed to explain RGG v 2.0 interface and provide users with the knowledge and skills to pilot RGG successfully. Brief documentation of MeshKit source code, tools and other algorithms available are also presented for developers to extend and add new algorithms to MeshKit. RGG tools work in serial and parallel and have been used to model complex reactor core models consisting of conical pins, load pads, several thousands of axially varying material properties of instrumentation pins and other interstices meshes.
GENERATION AND APPLICATION OF UNSTRUCTURED ADAPTIVE MESHES WITH MOVING BOUNDARIES
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
This paper presents a method to generate unstructured adaptive meshes with moving boundaries and its application to CFD. Delaunay triangulation criterion in conjunction with the automatic point creation is used to generate 2-D and 3-D unstructured grids. A local grid regeneration method is proposed to cope with moving boundaries. Numerical examples include the interactions of shock waves with movable bodies and the movement of a projectile within a ram accelerator, illustrating an efficient and robust mesh generation method developed.``
Gaussian curvature analysis allows for automatic block placement in multi-block hexahedral meshing.
Ramme, Austin J; Shivanna, Kiran H; Magnotta, Vincent A; Grosland, Nicole M
2011-10-01
Musculoskeletal finite element analysis (FEA) has been essential to research in orthopaedic biomechanics. The generation of a volumetric mesh is often the most challenging step in a FEA. Hexahedral meshing tools that are based on a multi-block approach rely on the manual placement of building blocks for their mesh generation scheme. We hypothesise that Gaussian curvature analysis could be used to automatically develop a building block structure for multi-block hexahedral mesh generation. The Automated Building Block Algorithm incorporates principles from differential geometry, combinatorics, statistical analysis and computer science to automatically generate a building block structure to represent a given surface without prior information. We have applied this algorithm to 29 bones of varying geometries and successfully generated a usable mesh in all cases. This work represents a significant advancement in automating the definition of building blocks.
SHARP/PRONGHORN Interoperability: Mesh Generation
Energy Technology Data Exchange (ETDEWEB)
Avery Bingham; Javier Ortensi
2012-09-01
Progress toward collaboration between the SHARP and MOOSE computational frameworks has been demonstrated through sharing of mesh generation and ensuring mesh compatibility of both tools with MeshKit. MeshKit was used to build a three-dimensional, full-core very high temperature reactor (VHTR) reactor geometry with 120-degree symmetry, which was used to solve a neutron diffusion critical eigenvalue problem in PRONGHORN. PRONGHORN is an application of MOOSE that is capable of solving coupled neutron diffusion, heat conduction, and homogenized flow problems. The results were compared to a solution found on a 120-degree, reflected, three-dimensional VHTR mesh geometry generated by PRONGHORN. The ability to exchange compatible mesh geometries between the two codes is instrumental for future collaboration and interoperability. The results were found to be in good agreement between the two meshes, thus demonstrating the compatibility of the SHARP and MOOSE frameworks. This outcome makes future collaboration possible.
Institute of Scientific and Technical Information of China (English)
于长华; 熊敏; 方维; 郑澎; 张先红
2016-01-01
Because of the complicated boundary geometric features of multi-solid models, the algorithm for grid-based hexahedral mesh generation had very weak stability and generated some poor boundary elements. Ac-cording to these problems, an algorithm for the automated generation of grid based all-hexahedral element meshes is developed. In the surface matching process, a surface matching algorithm combining the embedding technique is proposed, establishing the corresponding the boundary element relation between solid models and core mesh, and making the hexahedral mesh accurately describe the geometric features of multi-solid models. In the topological optimization process, an optimization technique eliminating the hexahedral elements with bad topological connection is proposed. The effectiveness and robustness of the algorithm in this paper are tested by means of some solid model examples.%基于栅格法的六面体网格生成算法由于多体模型复杂的边界几何特征，导致稳定性较差和产生一些质量较差的边界六面体单元。针对这一问题，提出一套以栅格法为基础的全六面体网格自动生成算法。在边界拟合环节，利用 Embedding 技术提出一种边界拟合算法，建立了实体模型边界元素和核心网格外围边界元素的对应关系，使得六面体网格很好地描述实体模型的几何特征；在拓扑优化环节，利用 Pillowing 技术给出一种消除网格中拓扑连接关系较差的六面体单元的方法。若干实体模型算例结果表明，该算法实用性强，效果良好。
Generation of Triangular Meshes for Complex Domains on the Plane
Directory of Open Access Journals (Sweden)
Barbara Glut
2001-01-01
Full Text Available Many physical phenomena can be modeled by partial differential equations. The development of numerical methods based on the spatial subdivision of a domain into finite elements immediately extended interests to the tasks of generating a mesh. With the availability of versatile field solvers and powerful computers, the simulations of ever incrcasing geometrical and physical complexity are attempted. At some point the main bottleneck becomes the mesh generation itself. The paper presents a detailed description of the triangular mesh generation scheme on the plane based upon the Delaunay triangulation. A mesh generator should be fully automatic and simplify input data as much as possible. It should offer rapid gradation from small to large sizes of elements. The generated mesh must be always valid and of good quality. All these requirements were taken into account during the selection and elaboration of utilized algorithms. Successive chapters describe procedures connected with the specification of a modeled domain, generation and triangulation of boundary vertices, introducing inner nodes, improving the quality of the created mesh, and renumbering of vertices.
Adaptive mesh generation for image registration and segmentation
DEFF Research Database (Denmark)
Fogtmann, Mads; Larsen, Rasmus
2013-01-01
This paper deals with the problem of generating quality tetrahedral meshes for image registration. From an initial coarse mesh the approach matches the mesh to the image volume by combining red-green subdivision and mesh evolution through mesh-to-image matching regularized with a mesh quality...
Mesh Generation and Adaption for High Reynolds Number RANS Computations Project
National Aeronautics and Space Administration — This proposal offers to provide NASA with an automatic mesh generator for the simulation of aerodynamic flows using Reynolds-Averages Navier-Stokes (RANS) models....
Mesh Generation and Adaption for High Reynolds Number RANS Computations Project
National Aeronautics and Space Administration — The innovation of our Phase II STTR program is to develop and provide to NASA automatic mesh generation software for the simulation of fluid flows using...
An Adaptive Mesh Algorithm: Mesh Structure and Generation
Energy Technology Data Exchange (ETDEWEB)
Scannapieco, Anthony J. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2016-06-21
The purpose of Adaptive Mesh Refinement is to minimize spatial errors over the computational space not to minimize the number of computational elements. The additional result of the technique is that it may reduce the number of computational elements needed to retain a given level of spatial accuracy. Adaptive mesh refinement is a computational technique used to dynamically select, over a region of space, a set of computational elements designed to minimize spatial error in the computational model of a physical process. The fundamental idea is to increase the mesh resolution in regions where the physical variables are represented by a broad spectrum of modes in k-space, hence increasing the effective global spectral coverage of those physical variables. In addition, the selection of the spatially distributed elements is done dynamically by cyclically adjusting the mesh to follow the spectral evolution of the system. Over the years three types of AMR schemes have evolved; block, patch and locally refined AMR. In block and patch AMR logical blocks of various grid sizes are overlaid to span the physical space of interest, whereas in locally refined AMR no logical blocks are employed but locally nested mesh levels are used to span the physical space. The distinction between block and patch AMR is that in block AMR the original blocks refine and coarsen entirely in time, whereas in patch AMR the patches change location and zone size with time. The type of AMR described herein is a locally refi ned AMR. In the algorithm described, at any point in physical space only one zone exists at whatever level of mesh that is appropriate for that physical location. The dynamic creation of a locally refi ned computational mesh is made practical by a judicious selection of mesh rules. With these rules the mesh is evolved via a mesh potential designed to concentrate the nest mesh in regions where the physics is modally dense, and coarsen zones in regions where the physics is modally
Automatic Tooth Segmentation of Dental Mesh Based on Harmonic Fields
Directory of Open Access Journals (Sweden)
Sheng-hui Liao
2015-01-01
Full Text Available An important preprocess in computer-aided orthodontics is to segment teeth from the dental models accurately, which should involve manual interactions as few as possible. But fully automatic partition of all teeth is not a trivial task, since teeth occur in different shapes and their arrangements vary substantially from one individual to another. The difficulty is exacerbated when severe teeth malocclusion and crowding problems occur, which is a common occurrence in clinical cases. Most published methods in this area either are inaccurate or require lots of manual interactions. Motivated by the state-of-the-art general mesh segmentation methods that adopted the theory of harmonic field to detect partition boundaries, this paper proposes a novel, dental-targeted segmentation framework for dental meshes. With a specially designed weighting scheme and a strategy of a priori knowledge to guide the assignment of harmonic constraints, this method can identify teeth partition boundaries effectively. Extensive experiments and quantitative analysis demonstrate that the proposed method is able to partition high-quality teeth automatically with robustness and efficiency.
Automatic Tooth Segmentation of Dental Mesh Based on Harmonic Fields.
Liao, Sheng-hui; Liu, Shi-jian; Zou, Bei-ji; Ding, Xi; Liang, Ye; Huang, Jun-hui
2015-01-01
An important preprocess in computer-aided orthodontics is to segment teeth from the dental models accurately, which should involve manual interactions as few as possible. But fully automatic partition of all teeth is not a trivial task, since teeth occur in different shapes and their arrangements vary substantially from one individual to another. The difficulty is exacerbated when severe teeth malocclusion and crowding problems occur, which is a common occurrence in clinical cases. Most published methods in this area either are inaccurate or require lots of manual interactions. Motivated by the state-of-the-art general mesh segmentation methods that adopted the theory of harmonic field to detect partition boundaries, this paper proposes a novel, dental-targeted segmentation framework for dental meshes. With a specially designed weighting scheme and a strategy of a priori knowledge to guide the assignment of harmonic constraints, this method can identify teeth partition boundaries effectively. Extensive experiments and quantitative analysis demonstrate that the proposed method is able to partition high-quality teeth automatically with robustness and efficiency.
Zhang, Bo; Peng, Bo; Huang, Jingfang; Pitsianis, Nikos P.; Sun, Xiaobai; Lu, Benzhuo
2015-05-01
We present PAFMPB, an updated and parallel version of the AFMPB software package for fast calculation of molecular solvation-free energy. The new version has the following new features: (1) The adaptive fast multipole method and the boundary element methods are parallelized; (2) A tool is embedded for automatic molecular VDW/SAS surface mesh generation, leaving the requirement for a mesh file at input optional; (3) The package provides fast calculation of the total solvation-free energy, including the PB electrostatic and nonpolar interaction contributions. PAFMPB is implemented in C and Fortran programming languages, with the Cilk Plus extension to harness the computing power of both multicore and vector processing. Computational experiments demonstrate the successful application of PAFMPB to the calculation of the PB potential on a dengue virus system with more than one million atoms and a mesh with approximately 20 million triangles.
CUBIT mesh generation environment. Volume 1: Users manual
Energy Technology Data Exchange (ETDEWEB)
Blacker, T.D.; Bohnhoff, W.J.; Edwards, T.L. [and others
1994-05-01
The CUBIT mesh generation environment is a two- and three-dimensional finite element mesh generation tool which is being developed to pursue the goal of robust and unattended mesh generation--effectively automating the generation of quadrilateral and hexahedral elements. It is a solid-modeler based preprocessor that meshes volume and surface solid models for finite element analysis. A combination of techniques including paving, mapping, sweeping, and various other algorithms being developed are available for discretizing the geometry into a finite element mesh. CUBIT also features boundary layer meshing specifically designed for fluid flow problems. Boundary conditions can be applied to the mesh through the geometry and appropriate files for analysis generated. CUBIT is specifically designed to reduce the time required to create all-quadrilateral and all-hexahedral meshes. This manual is designed to serve as a reference and guide to creating finite element models in the CUBIT environment.
Update on Development of Mesh Generation Algorithms in MeshKit
Energy Technology Data Exchange (ETDEWEB)
Jain, Rajeev [Argonne National Lab. (ANL), Argonne, IL (United States); Vanderzee, Evan [Argonne National Lab. (ANL), Argonne, IL (United States); Mahadevan, Vijay [Argonne National Lab. (ANL), Argonne, IL (United States)
2015-09-30
MeshKit uses a graph-based design for coding all its meshing algorithms, which includes the Reactor Geometry (and mesh) Generation (RGG) algorithms. This report highlights the developmental updates of all the algorithms, results and future work. Parallel versions of algorithms, documentation and performance results are reported. RGG GUI design was updated to incorporate new features requested by the users; boundary layer generation and parallel RGG support were added to the GUI. Key contributions to the release, upgrade and maintenance of other SIGMA1 libraries (CGM and MOAB) were made. Several fundamental meshing algorithms for creating a robust parallel meshing pipeline in MeshKit are under development. Results and current status of automated, open-source and high quality nuclear reactor assembly mesh generation algorithms such as trimesher, quadmesher, interval matching and multi-sweeper are reported.
Removal of line artifacts on mesh boundary in computer generated hologram by mesh phase matching.
Park, Jae-Hyeung; Yeom, Han-Ju; Kim, Hee-Jae; Zhang, HuiJun; Li, BoNi; Ji, Yeong-Min; Kim, Sang-Hoo
2015-03-23
Mesh-based computer generated hologram enables realistic and efficient representation of three-dimensional scene. However, the dark line artifacts on the boundary between neighboring meshes are frequently observed, degrading the quality of the reconstruction. In this paper, we propose a simple technique to remove the dark line artifacts by matching the phase on the boundary of neighboring meshes. The feasibility of the proposed method is confirmed by the numerical and optical reconstruction of the generated hologram.
A tetrahedral mesh generation approach for 3D marine controlled-source electromagnetic modeling
Um, Evan Schankee; Kim, Seung-Sep; Fu, Haohuan
2017-03-01
3D finite-element (FE) mesh generation is a major hurdle for marine controlled-source electromagnetic (CSEM) modeling. In this paper, we present a FE discretization operator (FEDO) that automatically converts a 3D finite-difference (FD) model into reliable and efficient tetrahedral FE meshes for CSEM modeling. FEDO sets up wireframes of a background seabed model that precisely honors the seafloor topography. The wireframes are then partitioned into multiple regions. Outer regions of the wireframes are discretized with coarse tetrahedral elements whose maximum size is as large as a skin depth of the regions. We demonstrate that such coarse meshes can produce accurate FE solutions because numerical dispersion errors of tetrahedral meshes do not accumulate but oscillates. In contrast, central regions of the wireframes are discretized with fine tetrahedral elements to describe complex geology in detail. The conductivity distribution is mapped from FD to FE meshes in a volume-averaged sense. To avoid excessive mesh refinement around receivers, we introduce an effective receiver size. Major advantages of FEDO are summarized as follow. First, FEDO automatically generates reliable and economic tetrahedral FE meshes without adaptive meshing or interactive CAD workflows. Second, FEDO produces FE meshes that precisely honor the boundaries of the seafloor topography. Third, FEDO derives multiple sets of FE meshes from a given FD model. Each FE mesh is optimized for a different set of sources and receivers and is fed to a subgroup of processors on a parallel computer. This divide and conquer approach improves the parallel scalability of the FE solution. Both accuracy and effectiveness of FEDO are demonstrated with various CSEM examples.
HypGrid2D. A 2-d mesh generator
Energy Technology Data Exchange (ETDEWEB)
Soerensen, N.N.
1998-03-01
The implementation of a hyperbolic mesh generation procedure, based on an equation for orthogonality and an equation for the cell face area is described. The method is fast, robust and gives meshes with good smoothness and orthogonality. The procedure is implemented in a program called HypGrid2D. The HypGrid2D program is capable of generating C-, O- and `H`-meshes for use in connection with the EllipSys2D Navier-Stokes solver. To illustrate the capabilities of the program, some test examples are shown. First a series of C-meshes are generated around a NACA-0012 airfoil. Secondly a series of O-meshes are generated around a NACA-65-418 airfoil. Finally `H`-meshes are generated over a Gaussian hill and a linear escarpment. (au)
Image-Based Geometric Modeling and Mesh Generation
2013-01-01
As a new interdisciplinary research area, “image-based geometric modeling and mesh generation” integrates image processing, geometric modeling and mesh generation with finite element method (FEM) to solve problems in computational biomedicine, materials sciences and engineering. It is well known that FEM is currently well-developed and efficient, but mesh generation for complex geometries (e.g., the human body) still takes about 80% of the total analysis time and is the major obstacle to reduce the total computation time. It is mainly because none of the traditional approaches is sufficient to effectively construct finite element meshes for arbitrarily complicated domains, and generally a great deal of manual interaction is involved in mesh generation. This contributed volume, the first for such an interdisciplinary topic, collects the latest research by experts in this area. These papers cover a broad range of topics, including medical imaging, image alignment and segmentation, image-to-mesh conversion,...
Energy Technology Data Exchange (ETDEWEB)
Balaven-Clermidy, S.
2001-12-01
Oil reservoir simulations study multiphase flows in porous media. These flows are described and evaluated through numerical schemes on a discretization of the reservoir domain. In this thesis, we were interested in this spatial discretization and a new kind of hybrid mesh has been proposed where the radial nature of flows in the vicinity of wells is directly taken into account in the geometry. Our modular approach described wells and their drainage area through radial circular meshes. These well meshes are inserted in a structured reservoir mesh (a Corner Point Geometry mesh) made up with hexahedral cells. Finally, in order to generate a global conforming mesh, proper connections are realized between the different kinds of meshes through unstructured transition ones. To compute these transition meshes that we want acceptable in terms of finite volume methods, an automatic method based on power diagrams has been developed. Our approach can deal with a homogeneous anisotropic medium and allows the user to insert vertical or horizontal wells as well as secondary faults in the reservoir mesh. Our work has been implemented, tested and validated in 2D and 2D1/2. It can also be extended in 3D when the geometrical constraints are simplicial ones: points, segments and triangles. (author)
METHOD FOR ADAPTIVE MESH GENERATION BASED ON GEOMETRICAL FEATURES OF 3D SOLID
Institute of Scientific and Technical Information of China (English)
HUANG Xiaodong; DU Qungui; YE Bangyan
2006-01-01
In order to provide a guidance to specify the element size dynamically during adaptive finite element mesh generation, adaptive criteria are firstly defined according to the relationships between the geometrical features and the elements of 3D solid. Various modes based on different datum geometrical elements, such as vertex, curve, surface, and so on, are then designed for generating local refmed mesh. With the guidance of the defined criteria, different modes are automatically selected to apply on the appropriate datum objects to program the element size in the local special areas. As a result, the control information of element size is successfully programmed coveting the entire domain based on the geometrical features of 3D solid. A new algorithm based on Delaunay triangulation is then developed for generating 3D adaptive fmite element mesh, in which the element size is dynamically specified to catch the geometrical features and suitable tetrahedron facets are selected to locate interior nodes continuously. As a result, adaptive mesh with good-quality elements is generated. Examples show that the proposed method can be successfully applied to adaptive finite element mesh automatic generation based on the geometrical features of 3D solid.
A 3D Tetrahedral Mesh Generator for Seismic Problems
Kononov, A.; Minisini, S.; Zhebel, E.; Mulder, W.A.
2012-01-01
Finite-element modelling of seismic wave propagation on tetrahedra requires meshes that accurately follow interfaces between impedance contrasts or surface topography and have element sizes proportional to the local velocity. We explain a mesh generation approach by example. Starting from a finite-d
Deformable mesh registration for the validation of automatic target localization algorithms
Robertson, Scott; Weiss, Elisabeth; Hugo, Geoffrey D.
2013-01-01
Purpose: To evaluate deformable mesh registration (DMR) as a tool for validating automatic target registration algorithms used during image-guided radiation therapy. Methods: DMR was implemented in a hierarchical model, with rigid, affine, and B-spline transforms optimized in succession to register a pair of surface meshes. The gross tumor volumes (primary tumor and involved lymph nodes) were contoured by a physician on weekly CT scans in a cohort of lung cancer patients and converted to surface meshes. The meshes from weekly CT images were registered to the mesh from the planning CT, and the resulting registered meshes were compared with the delineated surfaces. Known deformations were also applied to the meshes, followed by mesh registration to recover the known deformation. Mesh registration accuracy was assessed at the mesh surface by computing the symmetric surface distance (SSD) between vertices of each registered mesh pair. Mesh registration quality in regions within 5 mm of the mesh surface was evaluated with respect to a high quality deformable image registration. Results: For 18 patients presenting with a total of 19 primary lung tumors and 24 lymph node targets, the SSD averaged 1.3 ± 0.5 and 0.8 ± 0.2 mm, respectively. Vertex registration errors (VRE) relative to the applied known deformation were 0.8 ± 0.7 and 0.2 ± 0.3 mm for the primary tumor and lymph nodes, respectively. Inside the mesh surface, corresponding average VRE ranged from 0.6 to 0.9 and 0.2 to 0.9 mm, respectively. Outside the mesh surface, average VRE ranged from 0.7 to 1.8 and 0.2 to 1.4 mm. The magnitude of errors generally increased with increasing distance away from the mesh. Conclusions: Provided that delineated surfaces are available, deformable mesh registration is an accurate and reliable method for obtaining a reference registration to validate automatic target registration algorithms for image-guided radiation therapy, specifically in regions on or near the target surfaces
Finite Element Meshes Auto-Generation for the Welted Bifurcation
Institute of Scientific and Technical Information of China (English)
YUANMei; LIYa-ping
2004-01-01
In this paper, firstly, a mathematical model for a specific kind of welted bifurcation is established, the parametric equation for the intersecting curve is resulted in. Secondly, a method for partitioning finite element meshes of the welted bifurcation is put forward, its main idea is that developing the main pipe surface and the branch pipe surface respectively, dividing meshes on each developing plane and obtaining meshes points, then transforming their plane coordinates into space coordinates. Finally, an applied program for finite element meshes auto-generation is simply introduced, which adopt ObjectARX technique and its running result can be shown in AutoCAD. The meshes generated in AutoCAD can be exported conveniently to most of finite element analysis soft wares, and the finite element computing result can satisfy the engineering precision requirement.
Hexahedral mesh generation via the dual arrangement of surfaces
Energy Technology Data Exchange (ETDEWEB)
Mitchell, S.A.; Tautges, T.J. [Sandia National Labs., Albuquerque, NM (United States)
1997-12-31
Given a general three-dimensional geometry with a prescribed quadrilateral surface mesh, the authors consider the problem of constructing a hexahedral mesh of the geometry whose boundary is exactly the prescribed surface mesh. Due to the specialized topology of hexahedra, this problem is more difficult than the analogous one for tetrahedra. Folklore has maintained that a surface mesh must have a constrained structure in order for there to exist a compatible hexahedral mesh. However, they have proof that a surface mesh need only satisfy mild parity conditions, depending on the topology of the three-dimensional geometry, for there to exist a compatible hexahedral mesh. The proof is based on the realization that a hexahedral mesh is dual to an arrangement of surfaces, and the quadrilateral surface mesh is dual to the arrangement of curves bounding these surfaces. The proof is constructive and they are currently developing an algorithm called Whisker Weaving (WW) that mirrors the proof steps. Given the bounding curves, WW builds the topological structure of an arrangement of surfaces having those curves as its boundary. WW progresses in an advancing front manner. Certain local rules are applied to avoid structures that lead to poor mesh quality. Also, after the arrangement is constructed, additional surfaces are inserted to separate features, so e.g., no two hexahedra share more than one quadrilateral face. The algorithm has generated meshes for certain non-trivial problems, but is currently unreliable. The authors are exploring strategies for consistently selecting which portion of the surface arrangement to advance based on the existence proof. This should lead us to a robust algorithm for arbitrary geometries and surface meshes.
Automatic generation of tourist brochures
Birsak, Michael
2014-05-01
We present a novel framework for the automatic generation of tourist brochures that include routing instructions and additional information presented in the form of so-called detail lenses. The first contribution of this paper is the automatic creation of layouts for the brochures. Our approach is based on the minimization of an energy function that combines multiple goals: positioning of the lenses as close as possible to the corresponding region shown in an overview map, keeping the number of lenses low, and an efficient numbering of the lenses. The second contribution is a route-aware simplification of the graph of streets used for traveling between the points of interest (POIs). This is done by reducing the graph consisting of all shortest paths through the minimization of an energy function. The output is a subset of street segments that enable traveling between all the POIs without considerable detours, while at the same time guaranteeing a clutter-free visualization. © 2014 The Author(s) Computer Graphics Forum © 2014 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd.
Generation of Triangular Meshes for Complex Domains on the Plane
Barbara Glut; Tomasz Jurczyk
2001-01-01
Many physical phenomena can be modeled by partial differential equations. The development of numerical methods based on the spatial subdivision of a domain into finite elements immediately extended interests to the tasks of generating a mesh. With the availability of versatile field solvers and powerful computers, the simulations of ever incrcasing geometrical and physical complexity are attempted. At some point the main bottleneck becomes the mesh generation itself. The paper presents a deta...
Medical Image Processing for Fully Integrated Subject Specific Whole Brain Mesh Generation
Directory of Open Access Journals (Sweden)
Chih-Yang Hsu
2015-05-01
Full Text Available Currently, anatomically consistent segmentation of vascular trees acquired with magnetic resonance imaging requires the use of multiple image processing steps, which, in turn, depend on manual intervention. In effect, segmentation of vascular trees from medical images is time consuming and error prone due to the tortuous geometry and weak signal in small blood vessels. To overcome errors and accelerate the image processing time, we introduce an automatic image processing pipeline for constructing subject specific computational meshes for entire cerebral vasculature, including segmentation of ancillary structures; the grey and white matter, cerebrospinal fluid space, skull, and scalp. To demonstrate the validity of the new pipeline, we segmented the entire intracranial compartment with special attention of the angioarchitecture from magnetic resonance imaging acquired for two healthy volunteers. The raw images were processed through our pipeline for automatic segmentation and mesh generation. Due to partial volume effect and finite resolution, the computational meshes intersect with each other at respective interfaces. To eliminate anatomically inconsistent overlap, we utilized morphological operations to separate the structures with a physiologically sound gap spaces. The resulting meshes exhibit anatomically correct spatial extent and relative positions without intersections. For validation, we computed critical biometrics of the angioarchitecture, the cortical surfaces, ventricular system, and cerebrospinal fluid (CSF spaces and compared against literature values. Volumina and surface areas of the computational mesh were found to be in physiological ranges. In conclusion, we present an automatic image processing pipeline to automate the segmentation of the main intracranial compartments including a subject-specific vascular trees. These computational meshes can be used in 3D immersive visualization for diagnosis, surgery planning with haptics
Directory of Open Access Journals (Sweden)
Chi Wan Lim
Full Text Available We propose an automatic algorithm for the reconstruction of patient-specific cardiac mesh models with 1-to-1 vertex correspondence. In this framework, a series of 3D meshes depicting the endocardial surface of the heart at each time step is constructed, based on a set of border delineated magnetic resonance imaging (MRI data of the whole cardiac cycle. The key contribution in this work involves a novel reconstruction technique to generate a 4D (i.e., spatial-temporal model of the heart with 1-to-1 vertex mapping throughout the time frames. The reconstructed 3D model from the first time step is used as a base template model and then deformed to fit the segmented contours from the subsequent time steps. A method to determine a tree-based connectivity relationship is proposed to ensure robust mapping during mesh deformation. The novel feature is the ability to handle intra- and inter-frame 2D topology changes of the contours, which manifests as a series of merging and splitting of contours when the images are viewed either in a spatial or temporal sequence. Our algorithm has been tested on five acquisitions of cardiac MRI and can successfully reconstruct the full 4D heart model in around 30 minutes per subject. The generated 4D heart model conforms very well with the input segmented contours and the mesh element shape is of reasonably good quality. The work is important in the support of downstream computational simulation activities.
Development of unstructured mesh generator on parallel computers
Energy Technology Data Exchange (ETDEWEB)
Muramatsu, Kazuhiro [Japan Atomic Energy Research Inst., Tokyo (Japan); Shimada, Akio; Murakami, Hiroyuki; Higashida, Akihiro; Wakatsuki, Shigeto [Fuji Research Institute Corporation, Computational Engineering II, Tokyo (Japan)
2000-09-01
A general-purpose unstructured mesh generator, 'GRID3D/UNST', has been developed on parallel computers. High-speed operations and large-scale memory capacity of parallel computers enable the system to generate a large-scale mesh at high speed. As a matter of fact, the system generates large-scale mesh composed of 2,400,000 nodes and 14,000,000 elements about 1.5 hours on HITACHI SR2201, 64 PEs (Processing Elements) through 2.5 hours pre-process on SUN. Also the system is built on standard FORTRAN, C and Motif, and therefore has high portability. The system enables us to solve a large-scale problem that has been impossible to be solved, and to break new ground in the field of science and engineering. (author)
Robust Generation of Signed Distance Fields from Triangle Meshes
DEFF Research Database (Denmark)
Bærentzen, Jakob Andreas
2005-01-01
is then used to convert the binary volume into a distance field. The method is robust and handles holes, spurious triangles and ambiguities. Moreover, the method lends itself to Boolean operations between solids. Since a point cloud as well as a signed distance is generated, it is possible to extract an iso......-surface of the distance field and fit it to the point set. Using this method, one may recover sharp edge information. Examples are given where the method for generating distance fields coupled with mesh fitting is used to perform Boolean and morphological operations on triangle meshes....
Loft: An Automated Mesh Generator for Stiffened Shell Aerospace Vehicles
Eldred, Lloyd B.
2011-01-01
Loft is an automated mesh generation code that is designed for aerospace vehicle structures. From user input, Loft generates meshes for wings, noses, tanks, fuselage sections, thrust structures, and so on. As a mesh is generated, each element is assigned properties to mark the part of the vehicle with which it is associated. This property assignment is an extremely powerful feature that enables detailed analysis tasks, such as load application and structural sizing. This report is presented in two parts. The first part is an overview of the code and its applications. The modeling approach that was used to create the finite element meshes is described. Several applications of the code are demonstrated, including a Next Generation Launch Technology (NGLT) wing-sizing study, a lunar lander stage study, a launch vehicle shroud shape study, and a two-stage-to-orbit (TSTO) orbiter. Part two of the report is the program user manual. The manual includes in-depth tutorials and a complete command reference.
Automatic quiz generation for elderly people
Samuelsen, Jeanette
2016-01-01
Studies have indicated that games can be beneficial for the elderly, in areas such as cognitive functioning and well-being. Taking part in social activities, such as playing a game with others, could also be beneficial. One type of game is a computer-based quiz. One can create quiz questions manually; however, this can be time-consuming. Another approach is to generate quiz questions automatically. This project has examined how quizzes for Norwegian elderly can be automatically generated usin...
Automatic code generation in practice
DEFF Research Database (Denmark)
Adam, Marian Sorin; Kuhrmann, Marco; Schultz, Ulrik Pagh
2016-01-01
-specific language to specify those requirements and to allow for generating a safety-enforcing layer of code, which is deployed to the robot. The paper at hand reports experiences in practically applying code generation to mobile robots. For two cases, we discuss how we addressed challenges, e.g., regarding weaving...... code generation into proprietary development environments and testing of manually written code. We find that a DSL based on the same conceptual model can be used across different kinds of hardware modules, but a significant adaptation effort is required in practical scenarios involving different kinds...
A Novel Coarsening Method for Scalable and Efficient Mesh Generation
Energy Technology Data Exchange (ETDEWEB)
Yoo, A; Hysom, D; Gunney, B
2010-12-02
matrix-vector multiplication can be performed locally on each processor and hence to minimize communication. Furthermore, a good graph partitioning scheme ensures the equal amount of computation performed on each processor. Graph partitioning is a well known NP-complete problem, and thus the most commonly used graph partitioning algorithms employ some forms of heuristics. These algorithms vary in terms of their complexity, partition generation time, and the quality of partitions, and they tend to trade off these factors. A significant challenge we are currently facing at the Lawrence Livermore National Laboratory is how to partition very large meshes on massive-size distributed memory machines like IBM BlueGene/P, where scalability becomes a big issue. For example, we have found that the ParMetis, a very popular graph partitioning tool, can only scale to 16K processors. An ideal graph partitioning method on such an environment should be fast and scale to very large meshes, while producing high quality partitions. This is an extremely challenging task, as to scale to that level, the partitioning algorithm should be simple and be able to produce partitions that minimize inter-processor communications and balance the load imposed on the processors. Our goals in this work are two-fold: (1) To develop a new scalable graph partitioning method with good load balancing and communication reduction capability. (2) To study the performance of the proposed partitioning method on very large parallel machines using actual data sets and compare the performance to that of existing methods. The proposed method achieves the desired scalability by reducing the mesh size. For this, it coarsens an input mesh into a smaller size mesh by coalescing the vertices and edges of the original mesh into a set of mega-vertices and mega-edges. A new coarsening method called brick algorithm is developed in this research. In the brick algorithm, the zones in a given mesh are first grouped into fixed size
Automatic generation of multilingual sports summaries
Hasan, Fahim Muhammad
2011-01-01
Natural Language Generation is a subfield of Natural Language Processing, which is concerned with automatically creating human readable text from non-linguistic forms of information. A template-based approach to Natural Language Generation utilizes base formats for different types of sentences, which are subsequently transformed to create the final readable forms of the output. In this thesis, we investigate the suitability of a template-based approach to multilingual Natural Language Generat...
MESH2D GRID GENERATOR DESIGN AND USE
Energy Technology Data Exchange (ETDEWEB)
Flach, G.; Smith, F.
2012-01-20
Mesh2d is a Fortran90 program designed to generate two-dimensional structured grids of the form [x(i),y(i,j)] where [x,y] are grid coordinates identified by indices (i,j). The x(i) coordinates alone can be used to specify a one-dimensional grid. Because the x-coordinates vary only with the i index, a two-dimensional grid is composed in part of straight vertical lines. However, the nominally horizontal y(i,j{sub 0}) coordinates along index i are permitted to undulate or otherwise vary. Mesh2d also assigns an integer material type to each grid cell, mtyp(i,j), in a user-specified manner. The complete grid is specified through three separate input files defining the x(i), y(i,j), and mtyp(i,j) variations. The overall mesh is constructed from grid zones that are typically then subdivided into a collection of smaller grid cells. The grid zones usually correspond to distinct materials or larger-scale geometric shapes. The structured grid zones are identified through uppercase indices (I,J). Subdivision of zonal regions into grid cells can be done uniformly, or nonuniformly using either a polynomial or geometric skewing algorithm. Grid cells may be concentrated backward, forward, or toward both ends. Figure 1 illustrates the above concepts in the context of a simple four zone grid.
Automatic approach for generating ETL operators
Bakari, Wided; Ali, Mouez; Ben-Abdallah, Hanene
2012-01-01
This article addresses the generation of the ETL operators(Extract-Transform-Load) for supplying a Data Warehouse from a relational data source. As a first step, we add new rules to those proposed by the authors of [1], these rules deal with the combination of ETL operators. In a second step, we propose an automatic approach based on model transformations to generate the ETL operations needed for loading a data warehouse. This approach offers the possibility to set some designer requirements ...
Terrain-driven unstructured mesh development through semi-automatic vertical feature extraction
Bilskie, Matthew V.; Coggin, David; Hagen, Scott C.; Medeiros, Stephen C.
2015-12-01
validation techniques are necessary for state-of-the-art flood inundation models. In addition, the semi-automated, unstructured mesh generation process presented herein increases the overall accuracy of simulated storm surge across the floodplain without reliance on hand digitization or sacrificing computational cost.
A GENERATIVE CAD MODEL OF A WORM GEAR MESHING
Directory of Open Access Journals (Sweden)
Angelika WRONKOWICZ
2014-03-01
Full Text Available This article introduces the term of a generative CAD model, its origins and, thus, a need of creating such a type of models. A process of generative model creation as well as specific forms of knowledge recording applied in the implementation phase in various CAD systems are briefly discussed. The example of a worm gear meshing realized by the CATIA software encapsulates the methodology of generative model construction. Sources and types of knowledge for design and construction required for development of the aforementioned model as well as the UML language as a method of formal knowledge recording are presented. The concept of model creation, i.e. assumptions and the structure as well as logic of the model operation are described. Also, the paper addresses selected elements of the project that present the manner in which the model was constructed.
Unstructured Mesh Movement and Viscous Mesh Generation for CFD-Based Design Optimization Project
National Aeronautics and Space Administration — The innovations proposed are twofold: 1) a robust unstructured mesh movement method able to handle isotropic (Euler), anisotropic (viscous), mixed element (hybrid)...
Institute of Scientific and Technical Information of China (English)
郑旖; 张为民
2012-01-01
Based on the mathematical expression is the 3D Model of the gear surface established in MAT-LAB.The method of object -oriented programming is applied to the establishment .The average distributed knots of the finite elements are generated at the curve of the tooth surface , which is based on the modular model .And the knots are the Basis of the generation of triangle elements of the tooth surface .% 在 MATLAB 中根据数学解析式建立齿轮齿面的三维模型，并且将面向对象的编程方法运用到数学模型的建立中。在模块化的齿面模型基础上，在齿面曲线上生成平均分布的有限元网格节点，并以生成的节点为基础建立齿面的三角形网格单元。
Moving mesh generation with a sequential approach for solving PDEs
DEFF Research Database (Denmark)
of physical and mesh equations suffers typically from long computation time due to highly nonlinear coupling between the two equations. Moreover, the extended system (physical and mesh equations) may be sensitive to the tuning parameters such as a temporal relaxation factor. It is therefore useful to design...... adaptive grid method (local refinement by adding/deleting the meshes at a discrete time level) as well as of efficiency for the dynamic adaptive grid method (or moving mesh method) where the number of meshes is not changed. For illustration, a phase change problem is solved with the decomposition algorithm.......In moving mesh methods, physical PDEs and a mesh equation derived from equidistribution of an error metrics (so-called the monitor function) are simultaneously solved and meshes are dynamically concentrated on steep regions (Lim et al., 2001). However, the simultaneous solution procedure...
Automatic generation of tree level helicity amplitudes
Stelzer, T
1994-01-01
The program MadGraph is presented which automatically generates postscript Feynman diagrams and Fortran code to calculate arbitrary tree level helicity amplitudes by calling HELAS[1] subroutines. The program is written in Fortran and is available in Unix and VMS versions. MadGraph currently includes standard model interactions of QCD and QFD, but is easily modified to include additional models such as supersymmetry.
Automatic Caption Generation for Electronics Textbooks
Directory of Open Access Journals (Sweden)
Veena Thakur
2014-12-01
Full Text Available Automatic or semi-automatic approaches for developing Technology Supported Learning Systems (TSLS are required to lighten their development cost. The main objective of this paper is to automate the generation of a caption module; it aims at reproducing the way teachers prepare their lessons and the learning material they will use throughout the course. Teachers tend to choose one or more textbooks that cover the contents of their subjects, determine the topics to be addressed, and identify the parts of the textbooks which may be helpful for the students it describes the entities, attributes, role and their relationship plus the constraints that govern the problem domain. The caption model is created in order to represent the vocabulary and key concepts of the problem domain. The caption model also identifies the relationships among all the entities within the scope of the problem domain, and commonly identifies their attributes. It defines a vocabulary and is helpful as a communication tool. DOM-Sortze, a framework that enables the semi-automatic generation of the Caption Module for technology supported learning system (TSLS from electronic textbooks. The semiautomatic generation of the Caption Module entails the identification and elicitation of knowledge from the documents to which end Natural Language Processing (NLP techniques are combined with ontologies and heuristic reasoning.
Automatic generation of combinatorial test data
Zhang, Jian; Ma, Feifei
2014-01-01
This book reviews the state-of-the-art in combinatorial testing, with particular emphasis on the automatic generation of test data. It describes the most commonly used approaches in this area - including algebraic construction, greedy methods, evolutionary computation, constraint solving and optimization - and explains major algorithms with examples. In addition, the book lists a number of test generation tools, as well as benchmarks and applications. Addressing a multidisciplinary topic, it will be of particular interest to researchers and professionals in the areas of software testing, combi
Optimal tetrahedral mesh generation for three-dimensional point set
Institute of Scientific and Technical Information of China (English)
秦开怀; 吴边; 关右江; 葛振州
1997-01-01
Three-dimensional (3D) tnangulation is a basic topic in computer graphics. It is considered very difficult to obtain the global optimal 3D triangulatlon, such as the triangulation which satisfies the max-min solid angle criterion A new method called genetic tetrahedral mesh generation algorithm (GTMGA for short) is presented. GT-MGA is based on the principle of genetic algorithm and aims at the global optimal triangulation. With a multi-objective fitness function, GTMGA is able to perform optimizations for different requirements. New crossover operator and mutation operator, polyhedron crossover and polyhedron mutation, are used in GTMGA. It is shown by the experimental results that GTMGA works better than both the 3D Delaunay triangulation and the algorithm based on local transformations.
Efficient computation of clipped Voronoi diagram for mesh generation
Yan, Dongming
2013-04-01
The Voronoi diagram is a fundamental geometric structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact domain (i.e. a bounded and closed 2D region or a 3D volume), some Voronoi cells of their Voronoi diagram are infinite or partially outside of the domain, but in practice only the parts of the cells inside the domain are needed, as when computing the centroidal Voronoi tessellation. Such a Voronoi diagram confined to a compact domain is called a clipped Voronoi diagram. We present an efficient algorithm to compute the clipped Voronoi diagram for a set of sites with respect to a compact 2D region or a 3D volume. We also apply the proposed method to optimal mesh generation based on the centroidal Voronoi tessellation. Crown Copyright © 2011 Published by Elsevier Ltd. All rights reserved.
Advances in Parallelization for Large Scale Oct-Tree Mesh Generation
O'Connell, Matthew; Karman, Steve L.
2015-01-01
Despite great advancements in the parallelization of numerical simulation codes over the last 20 years, it is still common to perform grid generation in serial. Generating large scale grids in serial often requires using special "grid generation" compute machines that can have more than ten times the memory of average machines. While some parallel mesh generation techniques have been proposed, generating very large meshes for LES or aeroacoustic simulations is still a challenging problem. An automated method for the parallel generation of very large scale off-body hierarchical meshes is presented here. This work enables large scale parallel generation of off-body meshes by using a novel combination of parallel grid generation techniques and a hybrid "top down" and "bottom up" oct-tree method. Meshes are generated using hardware commonly found in parallel compute clusters. The capability to generate very large meshes is demonstrated by the generation of off-body meshes surrounding complex aerospace geometries. Results are shown including a one billion cell mesh generated around a Predator Unmanned Aerial Vehicle geometry, which was generated on 64 processors in under 45 minutes.
Towards automatic planning for manufacturing generative processes
Energy Technology Data Exchange (ETDEWEB)
CALTON,TERRI L.
2000-05-24
Generative process planning describes methods process engineers use to modify manufacturing/process plans after designs are complete. A completed design may be the result from the introduction of a new product based on an old design, an assembly upgrade, or modified product designs used for a family of similar products. An engineer designs an assembly and then creates plans capturing manufacturing processes, including assembly sequences, component joining methods, part costs, labor costs, etc. When new products originate as a result of an upgrade, component geometry may change, and/or additional components and subassemblies may be added to or are omitted from the original design. As a result process engineers are forced to create new plans. This is further complicated by the fact that the process engineer is forced to manually generate these plans for each product upgrade. To generate new assembly plans for product upgrades, engineers must manually re-specify the manufacturing plan selection criteria and re-run the planners. To remedy this problem, special-purpose assembly planning algorithms have been developed to automatically recognize design modifications and automatically apply previously defined manufacturing plan selection criteria and constraints.
Multiblock grid generation with automatic zoning
Eiseman, Peter R.
1995-01-01
An overview will be given for multiblock grid generation with automatic zoning. We shall explore the many advantages and benefits of this exciting technology and will also see how to apply it to a number of interesting cases. The technology is available in the form of a commercial code, GridPro(registered trademark)/az3000. This code takes surface geometry definitions and patterns of points as its primary input and produces high quality grids as its output. Before we embark upon our exploration, we shall first give a brief background of the environment in which this technology fits.
Pamgen, a library for parallel generation of simple finite element meshes.
Energy Technology Data Exchange (ETDEWEB)
Foucar, James G.; Drake, Richard Roy; Hensinger, David M.; Gardiner, Thomas Anthony
2008-04-01
Generating finite-element meshes is a serious bottleneck for large parallel simulations. When mesh generation is limited to serial machines and element counts approach a billion, this bottleneck becomes a roadblock. Pamgen is a parallel mesh generation library that allows on-the-fly scalable generation of hexahedral and quadrilateral finite element meshes for several simple geometries. It has been used to generate more that 1.1 billion elements on 17,576 processors. Pamgen generates an unstructured finite element mesh on each processor at the start of a simulation. The mesh is specified by commands passed to the library as a 'C'-programming language string. The resulting mesh geometry, topology, and communication information can then be queried through an API. pamgen allows specification of boundary condition application regions using sidesets (element faces) and nodesets (collections of nodes). It supports several simple geometry types. It has multiple alternatives for mesh grading. It has several alternatives for the initial domain decomposition. Pamgen makes it easy to change details of the finite element mesh and is very useful for performance studies and scoping calculations.
Challenges in Second-Generation Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Pescapé Antonio
2008-01-01
Full Text Available Wireless mesh networks have the potential to provide ubiquitous high-speed Internet access at low costs. The good news is that initial deployments of WiFi meshes show the feasibility of providing ubiquitous Internet connectivity. However, their performance is far below the necessary and achievable limit. Moreover, users' subscription in the existing meshes is dismal even though the technical challenges to get connectivity are low. This paper provides an overview of the current status of mesh networks' deployment, and highlights the technical, economical, and social challenges that need to be addressed in the next years. As a proof-of-principle study, we discuss the above-mentioned challenges with reference to three real networks: (i MagNets, an operator-driven planned two-tier mesh network; (ii Berlin Freifunk network as a pure community-driven single-tier network; (iii Weimar Freifunk network, also a community-driven but two-tier network.
Challenges in Second-Generation Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Thomas Huehn
2008-10-01
Full Text Available Wireless mesh networks have the potential to provide ubiquitous high-speed Internet access at low costs. The good news is that initial deployments of WiFi meshes show the feasibility of providing ubiquitous Internet connectivity. However, their performance is far below the necessary and achievable limit. Moreover, users' subscription in the existing meshes is dismal even though the technical challenges to get connectivity are low. This paper provides an overview of the current status of mesh networks' deployment, and highlights the technical, economical, and social challenges that need to be addressed in the next years. As a proof-of-principle study, we discuss the above-mentioned challenges with reference to three real networks: (i MagNets, an operator-driven planned two-tier mesh network; (ii Berlin Freifunk network as a pure community-driven single-tier network; (iii Weimar Freifunk network, also a community-driven but two-tier network.
2015-01-07
Mesh Generation. Lecture Notes in Computational Vision and Biomechanics , Volume 3. Springer Publisher. Editor: Yongjie (Jessica) Zhang. ISBN-10...Modeling and Mesh Generation. Lecture Notes in Computational Vision and Biomechanics , Volume 3. Springer Publisher. Editor: Yongjie (Jessica) Zhang... Biomechanics , Volume 3. Springer Publisher. Editor: Yongjie (Jessica) Zhang. ISBN-10: 9400742541, ISBN-13: 978-9400742543. 2013. 3. Y. Zhang. Challenges
An automatic grid generation approach over free-form surface for architectural design
Institute of Scientific and Technical Information of China (English)
苏亮; 祝顺来; 肖南; 高博青
2014-01-01
An essential step for the realization of free-form surface structures is to create an efficient structural gird that satisfies not only the architectural aesthetics, but also the structural performance. Employing the main stress trajectories as the representation of force flows on a free-form surface, an automatic grid generation approach is proposed for the architectural design. The algorithm automatically plots the main stress trajectories on a 3D free-form surface, and adopts a modified advancing front meshing technique to generate the structural grid. Based on the proposed algorithm, an automatic grid generator named “St-Surmesh” is developed for the practical architectural design of free-form surface structure. The surface geometry of one of the Sun Valleys in Expo Axis for the Expo Shanghai 2010 is selected as a numerical example for validating the proposed approach. Comparative studies are performed to demonstrate how different structural grids affect the design of a free-form surface structure.
Hex-dominant mesh generation using 3D constrained triangulation
Energy Technology Data Exchange (ETDEWEB)
OWEN,STEVEN J.
2000-05-30
A method for decomposing a volume with a prescribed quadrilateral surface mesh, into a hexahedral-dominated mesh is proposed. With this method, known as Hex-Morphing (H-Morph), an initial tetrahedral mesh is provided. Tetrahedral are transformed and combined starting from the boundary and working towards the interior of the volume. The quadrilateral faces of the hexahedra are treated as internal surfaces, which can be recovered using constrained triangulation techniques. Implementation details of the edge and face recovery process are included. Examples and performance of the H-Morph algorithm are also presented.
Unstructured Mesh Movement and Viscous Mesh Generation for CFD-Based Design Optimization Project
National Aeronautics and Space Administration — The innovations proposed by ResearchSouth are: 1) a robust method to automatically insert high quality anisotropic prismatic (viscous boundary layer) cells into any...
A tuned mesh-generation strategy for image representation based on data-dependent triangulation.
Li, Ping; Adams, Michael D
2013-05-01
A mesh-generation framework for image representation based on data-dependent triangulation is proposed. The proposed framework is a modified version of the frameworks of Rippa and Garland and Heckbert that facilitates the development of more effective mesh-generation methods. As the proposed framework has several free parameters, the effects of different choices of these parameters on mesh quality are studied, leading to the recommendation of a particular set of choices for these parameters. A mesh-generation method is then introduced that employs the proposed framework with these best parameter choices. This method is demonstrated to produce meshes of higher quality (both in terms of squared error and subjectively) than those generated by several competing approaches, at a relatively modest computational and memory cost.
Energy Technology Data Exchange (ETDEWEB)
Lober, R.R.; Tautges, T.J.; Vaughan, C.T.
1997-03-01
Paving is an automated mesh generation algorithm which produces all-quadrilateral elements. It can additionally generate these elements in varying sizes such that the resulting mesh adapts to a function distribution, such as an error function. While powerful, conventional paving is a very serial algorithm in its operation. Parallel paving is the extension of serial paving into parallel environments to perform the same meshing functions as conventional paving only on distributed, discretized models. This extension allows large, adaptive, parallel finite element simulations to take advantage of paving`s meshing capabilities for h-remap remeshing. A significantly modified version of the CUBIT mesh generation code has been developed to host the parallel paving algorithm and demonstrate its capabilities on both two dimensional and three dimensional surface geometries and compare the resulting parallel produced meshes to conventionally paved meshes for mesh quality and algorithm performance. Sandia`s {open_quotes}tiling{close_quotes} dynamic load balancing code has also been extended to work with the paving algorithm to retain parallel efficiency as subdomains undergo iterative mesh refinement.
Danilov, A. A.; Salamatova, V. Yu; Vassilevski, Yu V.
2012-12-01
Here, a workflow for high-resolution efficient numerical modeling of bioimpedance measurements is suggested that includes 3D image segmentation, adaptive mesh generation, finite-element discretization, and the analysis of simulation results. Using the adaptive unstructured tetrahedral meshes enables to decrease significantly a number of mesh elements while keeping model accuracy. The numerical results illustrate current, potential, and sensitivity field distributions for a conventional Kubicek-like scheme of bioimpedance measurements using segmented geometric model of human torso based on Visible Human Project data. The whole body VHP man computational mesh is constructed that contains 574 thousand vertices and 3.3 million tetrahedrons.
Automatic Generation of Validated Specific Epitope Sets
Directory of Open Access Journals (Sweden)
Sebastian Carrasco Pro
2015-01-01
Full Text Available Accurate measurement of B and T cell responses is a valuable tool to study autoimmunity, allergies, immunity to pathogens, and host-pathogen interactions and assist in the design and evaluation of T cell vaccines and immunotherapies. In this context, it is desirable to elucidate a method to select validated reference sets of epitopes to allow detection of T and B cells. However, the ever-growing information contained in the Immune Epitope Database (IEDB and the differences in quality and subjects studied between epitope assays make this task complicated. In this study, we develop a novel method to automatically select reference epitope sets according to a categorization system employed by the IEDB. From the sets generated, three epitope sets (EBV, mycobacteria and dengue were experimentally validated by detection of T cell reactivity ex vivo from human donors. Furthermore, a web application that will potentially be implemented in the IEDB was created to allow users the capacity to generate customized epitope sets.
Automatic Generation of Minimal Cut Sets
Directory of Open Access Journals (Sweden)
Sentot Kromodimoeljo
2015-06-01
Full Text Available A cut set is a collection of component failure modes that could lead to a system failure. Cut Set Analysis (CSA is applied to critical systems to identify and rank system vulnerabilities at design time. Model checking tools have been used to automate the generation of minimal cut sets but are generally based on checking reachability of system failure states. This paper describes a new approach to CSA using a Linear Temporal Logic (LTL model checker called BT Analyser that supports the generation of multiple counterexamples. The approach enables a broader class of system failures to be analysed, by generalising from failure state formulae to failure behaviours expressed in LTL. The traditional approach to CSA using model checking requires the model or system failure to be modified, usually by hand, to eliminate already-discovered cut sets, and the model checker to be rerun, at each step. By contrast, the new approach works incrementally and fully automatically, thereby removing the tedious and error-prone manual process and resulting in significantly reduced computation time. This in turn enables larger models to be checked. Two different strategies for using BT Analyser for CSA are presented. There is generally no single best strategy for model checking: their relative efficiency depends on the model and property being analysed. Comparative results are given for the A320 hydraulics case study in the Behavior Tree modelling language.
Generation of Delaunay meshes in implicit domains with edge sharpening
Belokrys-Fedotov, A. I.; Garanzha, V. A.; Kudryavtseva, L. N.
2016-11-01
A variational algorithm for the construction of 3D Delaunay meshes in implicit domains with a nonsmooth boundary is proposed. The algorithm is based on the self-organization of an elastic network in which each Delaunay edge is interpreted as an elastic strut. The elastic potential is constructed as a combination of the repulsion potential and the sharpening potential. The sharpening potential is applied only on the boundary and is used to minimize the deviation of the outward normals to the boundary faces from the direction of the gradient of the implicit function. Numerical experiments showed that in the case when the implicit function specifying the domain is considerably different from the signed distance function, the use of the sharpening potential proposed by Belyaev and Ohtake in 2002 leads to the mesh instability. A stable version of the sharpening potential is proposed. The numerical experiments showed that acceptable Delaunay meshes for complex shaped domains with sharp curved boundary edges can be constructed.
An arbitrary boundary triangle mesh generation method for multi-modality imaging
Zhang, Xuanxuan; Deng, Yong; Gong, Hui; Meng, Yuanzheng; Yang, Xiaoquan; Luo, Qingming
2012-03-01
Low-resolution and ill-posedness are the major challenges in diffuse optical tomography(DOT)/fluorescence molecular tomography(FMT). Recently, the multi-modality imaging technology that combines micro-computed tomography (micro-CT) with DOT/FMT is developed to improve resolution and ill-posedness. To take advantage of the fine priori anatomical maps obtained from micro-CT, we present an arbitrary boundary triangle mesh generation method for FMT/DOT/micro-CT multi-modality imaging. A planar straight line graph (PSLG) based on the image of micro-CT is obtained by an adaptive boundary sampling algorithm. The subregions of mesh are accurately matched with anatomical structures by a two-step solution, firstly, the triangles and nodes during mesh refinement are labeled respectively, and then a revising algorithm is used to modifying meshes of each subregion. The triangle meshes based on a regular model and a micro-CT image are generated respectively. The results show that the subregions of triangle meshes can match with anatomical structures accurately and triangle meshes have good quality. This provides an arbitrary boundaries triangle mesh generation method with the ability to incorporate the fine priori anatomical information into DOT/FMT reconstructions.
ESCHER: An interactive mesh-generating editor for preparing finite-element input
Oakes, W. R., Jr.
1984-01-01
ESCHER is an interactive mesh generation and editing program designed to help the user create a finite-element mesh, create additional input for finite-element analysis, including initial conditions, boundary conditions, and slidelines, and generate a NEUTRAL FILE that can be postprocessed for input into several finite-element codes, including ADINA, ADINAT, DYNA, NIKE, TSAAS, and ABUQUS. Two important ESCHER capabilities, interactive geometry creation and mesh archival storge are described in detail. Also described is the interactive command language and the use of interactive graphics. The archival storage and restart file is a modular, entity-based mesh data file. Modules of this file correspond to separate editing modes in the mesh editor, with data definition syntax preserved between the interactive commands and the archival storage file. Because ESCHER was expected to be highly interactive, extensive user documentation was provided in the form of an interactive HELP package.
DEFF Research Database (Denmark)
2015-01-01
Mesh generation and visualization software based on the CGAL library. Folder content: drawmesh Visualize slices of the mesh (surface/volumetric) as wireframe on top of an image (3D). drawsurf Visualize surfaces of the mesh (surface/volumetric). img2mesh Convert isosurface in image to volumetric...
Generating IDS Attack Pattern Automatically Based on Attack Tree
Institute of Scientific and Technical Information of China (English)
向尕; 曹元大
2003-01-01
Generating attack pattern automatically based on attack tree is studied. The extending definition of attack tree is proposed. And the algorithm of generating attack tree is presented. The method of generating attack pattern automatically based on attack tree is shown, which is tested by concrete attack instances. The results show that the algorithm is effective and efficient. In doing so, the efficiency of generating attack pattern is improved and the attack trees can be reused.
A multilevel adaptive mesh generation scheme using Kd-trees
Directory of Open Access Journals (Sweden)
Alfonso Limon
2009-04-01
Full Text Available We introduce a mesh refinement strategy for PDE based simulations that benefits from a multilevel decomposition. Using Harten's MRA in terms of Schroder-Pander linear multiresolution analysis [20], we are able to bound discontinuities in $mathbb{R}$. This MRA is extended to $mathbb{R}^n$ in terms of n-orthogonal linear transforms and utilized to identify cells that contain a codimension-one discontinuity. These refinement cells become leaf nodes in a balanced Kd-tree such that a local dyadic MRA is produced in $mathbb{R}^n$, while maintaining a minimal computational footprint. The nodes in the tree form an adaptive mesh whose density increases in the vicinity of a discontinuity.
Automated hexahedral mesh generation from biomedical image data: applications in limb prosthetics.
Zachariah, S G; Sanders, J E; Turkiyyah, G M
1996-06-01
A general method to generate hexahedral meshes for finite element analysis of residual limbs and similar biomedical geometries is presented. The method utilizes skeleton-based subdivision of cross-sectional domains to produce simple subdomains in which structured meshes are easily generated. Application to a below-knee residual limb and external prosthetic socket is described. The residual limb was modeled as consisting of bones, soft tissue, and skin. The prosthetic socket model comprised a socket wall with an inner liner. The geometries of these structures were defined using axial cross-sectional contour data from X-ray computed tomography, optical scanning, and mechanical surface digitization. A tubular surface representation, using B-splines to define the directrix and generator, is shown to be convenient for definition of the structure geometries. Conversion of cross-sectional data to the compact tubular surface representation is direct, and the analytical representation simplifies geometric querying and numerical optimization within the mesh generation algorithms. The element meshes remain geometrically accurate since boundary nodes are constrained to lie on the tubular surfaces. Several element meshes of increasing mesh density were generated for two residual limbs and prosthetic sockets. Convergence testing demonstrated that approximately 19 elements are required along a circumference of the residual limb surface for a simple linear elastic model. A model with the fibula absent compared with the same geometry with the fibula present showed differences suggesting higher distal stresses in the absence of the fibula. Automated hexahedral mesh generation algorithms for sliced data represent an advancement in prosthetic stress analysis since they allow rapid modeling of any given residual limb and optimization of mesh parameters.
Design of computer-generated beam-shaping holograms by iterative finite-element mesh adaption.
Dresel, T; Beyerlein, M; Schwider, J
1996-12-10
Computer-generated phase-only holograms can be used for laser beam shaping, i.e., for focusing a given aperture with intensity and phase distributions into a pregiven intensity pattern in their focal planes. A numerical approach based on iterative finite-element mesh adaption permits the design of appropriate phase functions for the task of focusing into two-dimensional reconstruction patterns. Both the hologram aperture and the reconstruction pattern are covered by mesh mappings. An iterative procedure delivers meshes with intensities equally distributed over the constituting elements. This design algorithm adds new elementary focuser functions to what we call object-oriented hologram design. Some design examples are discussed.
System for Automatic Generation of Examination Papers in Discrete Mathematics
Fridenfalk, Mikael
2013-01-01
A system was developed for automatic generation of problems and solutions for examinations in a university distance course in discrete mathematics and tested in a pilot experiment involving 200 students. Considering the success of such systems in the past, particularly including automatic assessment, it should not take long before such systems are…
Automatic program generation: future of software engineering
Energy Technology Data Exchange (ETDEWEB)
Robinson, J.H.
1979-01-01
At this moment software development is still more of an art than an engineering discipline. Each piece of software is lovingly engineered, nurtured, and presented to the world as a tribute to the writer's skill. When will this change. When will the craftsmanship be removed and the programs be turned out like so many automobiles from an assembly line. Sooner or later it will happen: economic necessities will demand it. With the advent of cheap microcomputers and ever more powerful supercomputers doubling capacity, much more software must be produced. The choices are to double the number of programers, double the efficiency of each programer, or find a way to produce the needed software automatically. Producing software automatically is the only logical choice. How will automatic programing come about. Some of the preliminary actions which need to be done and are being done are to encourage programer plagiarism of existing software through public library mechanisms, produce well understood packages such as compiler automatically, develop languages capable of producing software as output, and learn enough about the whole process of programing to be able to automate it. Clearly, the emphasis must not be on efficiency or size, since ever larger and faster hardware is coming.
ZONE: a finite element mesh generator. [In FORTRAN IV for CDC 7600
Energy Technology Data Exchange (ETDEWEB)
Burger, M. J.
1976-05-01
The ZONE computer program is a finite-element mesh generator which produces the nodes and element description of any two-dimensional geometry. The geometry is subdivided into a mesh of quadrilateral and triangular zones arranged sequentially in an ordered march through the geometry. The order of march can be chosen so that the minimum bandwidth is obtained. The node points are defined in terms of the x and y coordinates in a global rectangular coordinate system. The zones generated are quadrilaterals or triangles defined by four node points in a counterclockwise sequence. Node points defining the outside boundary are generated to describe pressure boundary conditions. The mesh that is generated can be used as input to any two-dimensional as well as any axisymmetrical structure program. The output from ZONE is essentially the input file to NAOS, HONDO, and other axisymmetric finite element programs. 14 figures. (RWR)
Automatic Structure-Based Code Generation from Coloured Petri Nets
DEFF Research Database (Denmark)
Kristensen, Lars Michael; Westergaard, Michael
2010-01-01
Automatic code generation based on Coloured Petri Net (CPN) models is challenging because CPNs allow for the construction of abstract models that intermix control flow and data processing, making translation into conventional programming constructs difficult. We introduce Process-Partitioned CPNs....... The viability of our approach is demonstrated by applying it to automatically generate an Erlang implementation of the Dynamic MANET On-demand (DYMO) routing protocol specified by the Internet Engineering Task Force (IETF)....
Mobility Models for Next Generation Wireless Networks Ad Hoc, Vehicular and Mesh Networks
Santi, Paolo
2012-01-01
Mobility Models for Next Generation Wireless Networks: Ad Hoc, Vehicular and Mesh Networks provides the reader with an overview of mobility modelling, encompassing both theoretical and practical aspects related to the challenging mobility modelling task. It also: Provides up-to-date coverage of mobility models for next generation wireless networksOffers an in-depth discussion of the most representative mobility models for major next generation wireless network application scenarios, including WLAN/mesh networks, vehicular networks, wireless sensor networks, and
Image analysis techniques associated with automatic data base generation.
Bond, A. D.; Ramapriyan, H. K.; Atkinson, R. J.; Hodges, B. C.; Thomas, D. T.
1973-01-01
This paper considers some basic problems relating to automatic data base generation from imagery, the primary emphasis being on fast and efficient automatic extraction of relevant pictorial information. Among the techniques discussed are recursive implementations of some particular types of filters which are much faster than FFT implementations, a 'sequential similarity detection' technique of implementing matched filters, and sequential linear classification of multispectral imagery. Several applications of the above techniques are presented including enhancement of underwater, aerial and radiographic imagery, detection and reconstruction of particular types of features in images, automatic picture registration and classification of multiband aerial photographs to generate thematic land use maps.
Jansen, Gunnar; Sohrabi, Reza; Miller, Stephen A.
2017-02-01
Short for Hexahedra from Unique Location in (K)convex Polyhedra - HULK is a simple and efficient algorithm to generate hexahedral meshes from generic STL files describing a geological model to be used in simulation tools based on the finite element, finite volume or finite difference methods. Using binary space partitioning of the input geometry and octree refinement on the grid, a successive increase in accuracy of the mesh is achieved. We present the theoretical basis as well as the implementation procedure with three geological models with varying complexity, providing the basis on which the algorithm is evaluated. HULK generates high accuracy discretizations with cell counts suitable for state-of-the-art subsurface simulators and provides a new method for hexahedral mesh generation in geological settings.
Automatic Grasp Generation and Improvement for Industrial Bin-Picking
DEFF Research Database (Denmark)
Kraft, Dirk; Ellekilde, Lars-Peter; Rytz, Jimmy Alison
2014-01-01
This paper presents work on automatic grasp generation and grasp learning for reducing the manual setup time and increase grasp success rates within bin-picking applications. We propose an approach that is able to generate good grasps automatically using a dynamic grasp simulator, a newly developed...... and achieve comparable results and that our learning approach can improve system performance significantly. Automatic bin-picking is an important industrial process that can lead to significant savings and potentially keep production in countries with high labour cost rather than outsourcing it. The presented...... work allows to minimize cycle time as well as setup cost, which are essential factors in automatic bin-picking. It therefore leads to a wider applicability of bin-picking in industry....
Park, Jae-Hyeung; Kim, Seong-Bok; Yeom, Han-Ju; Kim, Hee-Jae; Zhang, HuiJun; Li, BoNi; Ji, Yeong-Min; Kim, Sang-Hoo; Ko, Seok-Bum
2015-12-28
Fully analytic mesh-based computer generated hologram enables efficient and precise representation of three-dimensional scene. Conventional method assigns uniform amplitude inside individual mesh, resulting in reconstruction of the three-dimensional scene of flat shading. In this paper, we report an extension of the conventional method to achieve the continuous shading where the amplitude in each mesh is continuously varying. The proposed method enables the continuous shading, while maintaining fully analytic framework of the conventional method without any sacrifice in the precision. The proposed method can also be extended to enable fast update of the shading for different illumination directions and the ambient-diffuse reflection ratio based on Phong reflection model. The feasibility of the proposed method is confirmed by the numerical and optical reconstruction of the generated hologram.
Automatic Test Case Generation of C Program Using CFG
Directory of Open Access Journals (Sweden)
Sangeeta Tanwer
2010-07-01
Full Text Available Software quality and assurance in a software company is the only way to gain the customer confidence by removing all possible errors. It can be done by automatic test case generation. Taking popularly C programs as tests object, this paper explores how to create CFG of a C program and generate automatic Test Cases. It explores the feasibility and nonfeasibility of path basis upon no. of iteration. First C is code converted to instrumented code. Then test cases are generated by using Symbolic Testing and random Testing. System is developed by using C#.net in Visual Studio 2008. In addition some future research directions are also explored.
Automatic generation of matter-of-opinion video documentaries
Bocconi, S.; Nack, F.-M.; Hardman, L.
2008-01-01
In this paper we describe a model for automatically generating video documentaries. This allows viewers to specify the subject and the point of view of the documentary to be generated. The domain is matter-of-opinion documentaries based on interviews. The model combines rhetorical presentation patte
Algorithms for the automatic generation of 2-D structured multi-block grids
Schoenfeld, Thilo; Weinerfelt, Per; Jenssen, Carl B.
1995-01-01
Two different approaches to the fully automatic generation of structured multi-block grids in two dimensions are presented. The work aims to simplify the user interactivity necessary for the definition of a multiple block grid topology. The first approach is based on an advancing front method commonly used for the generation of unstructured grids. The original algorithm has been modified toward the generation of large quadrilateral elements. The second method is based on the divide-and-conquer paradigm with the global domain recursively partitioned into sub-domains. For either method each of the resulting blocks is then meshed using transfinite interpolation and elliptic smoothing. The applicability of these methods to practical problems is demonstrated for typical geometries of fluid dynamics.
6th International Meshing Roundtable '97
Energy Technology Data Exchange (ETDEWEB)
White, D.
1997-09-01
The goal of the 6th International Meshing Roundtable is to bring together researchers and developers from industry, academia, and government labs in a stimulating, open environment for the exchange of technical information related to the meshing process. In the pas~ the Roundtable has enjoyed significant participation born each of these groups from a wide variety of countries. The Roundtable will consist of technical presentations from contributed papers and abstracts, two invited speakers, and two invited panels of experts discussing topics related to the development and use of automatic mesh generation tools. In addition, this year we will feature a "Bring Your Best Mesh" competition and poster session to encourage discussion and participation from a wide variety of mesh generation tool users. The schedule and evening social events are designed to provide numerous opportunities for informal dialog. A proceedings will be published by Sandia National Laboratories and distributed at the Roundtable. In addition, papers of exceptionally high quaIity will be submitted to a special issue of the International Journal of Computational Geometry and Applications. Papers and one page abstracts were sought that present original results on the meshing process. Potential topics include but are got limited to: Unstructured triangular and tetrahedral mesh generation Unstructured quadrilateral and hexahedral mesh generation Automated blocking and structured mesh generation Mixed element meshing Surface mesh generation Geometry decomposition and clean-up techniques Geometry modification techniques related to meshing Adaptive mesh refinement and mesh quality control Mesh visualization Special purpose meshing algorithms for particular applications Theoretical or novel ideas with practical potential Technical presentations from industrial researchers.
Automatic Melody Generation System with Extraction Feature
Ida, Kenichi; Kozuki, Shinichi
In this paper, we propose the melody generation system with the analysis result of an existing melody. In addition, we introduce the device that takes user's favor in the system. The melody generation is done by pitch's being arranged best on the given rhythm. The best standard is decided by using the feature element extracted from existing music by proposed method. Moreover, user's favor is reflected in the best standard by operating some of the feature element in users. And, GA optimizes the pitch array based on the standard, and achieves the system.
Formal Specification Based Automatic Test Generation for Embedded Network Systems
Directory of Open Access Journals (Sweden)
Eun Hye Choi
2014-01-01
Full Text Available Embedded systems have become increasingly connected and communicate with each other, forming large-scaled and complicated network systems. To make their design and testing more reliable and robust, this paper proposes a formal specification language called SENS and a SENS-based automatic test generation tool called TGSENS. Our approach is summarized as follows: (1 A user describes requirements of target embedded network systems by logical property-based constraints using SENS. (2 Given SENS specifications, test cases are automatically generated using a SAT-based solver. Filtering mechanisms to select efficient test cases are also available in our tool. (3 In addition, given a testing goal by the user, test sequences are automatically extracted from exhaustive test cases. We’ve implemented our approach and conducted several experiments on practical case studies. Through the experiments, we confirmed the efficiency of our approach in design and test generation of real embedded air-conditioning network systems.
Automatic generation of Web mining environments
Cibelli, Maurizio; Costagliola, Gennaro
1999-02-01
The main problem related to the retrieval of information from the world wide web is the enormous number of unstructured documents and resources, i.e., the difficulty of locating and tracking appropriate sources. This paper presents a web mining environment (WME), which is capable of finding, extracting and structuring information related to a particular domain from web documents, using general purpose indices. The WME architecture includes a web engine filter (WEF), to sort and reduce the answer set returned by a web engine, a data source pre-processor (DSP), which processes html layout cues in order to collect and qualify page segments, and a heuristic-based information extraction system (HIES), to finally retrieve the required data. Furthermore, we present a web mining environment generator, WMEG, that allows naive users to generate a WME specific to a given domain by providing a set of specifications.
Automatically generated code for relativistic inhomogeneous cosmologies
Bentivegna, Eloisa
2017-02-01
The applications of numerical relativity to cosmology are on the rise, contributing insight into such cosmological problems as structure formation, primordial phase transitions, gravitational-wave generation, and inflation. In this paper, I present the infrastructure for the computation of inhomogeneous dust cosmologies which was used recently to measure the effect of nonlinear inhomogeneity on the cosmic expansion rate. I illustrate the code's architecture, provide evidence for its correctness in a number of familiar cosmological settings, and evaluate its parallel performance for grids of up to several billion points. The code, which is available as free software, is based on the Einstein Toolkit infrastructure, and in particular leverages the automated code generation capabilities provided by its component Kranc.
Automatic Building Information Model Query Generation
Energy Technology Data Exchange (ETDEWEB)
Jiang, Yufei; Yu, Nan; Ming, Jiang; Lee, Sanghoon; DeGraw, Jason; Yen, John; Messner, John I.; Wu, Dinghao
2015-12-01
Energy efficient building design and construction calls for extensive collaboration between different subfields of the Architecture, Engineering and Construction (AEC) community. Performing building design and construction engineering raises challenges on data integration and software interoperability. Using Building Information Modeling (BIM) data hub to host and integrate building models is a promising solution to address those challenges, which can ease building design information management. However, the partial model query mechanism of current BIM data hub collaboration model has several limitations, which prevents designers and engineers to take advantage of BIM. To address this problem, we propose a general and effective approach to generate query code based on a Model View Definition (MVD). This approach is demonstrated through a software prototype called QueryGenerator. By demonstrating a case study using multi-zone air flow analysis, we show how our approach and tool can help domain experts to use BIM to drive building design with less labour and lower overhead cost.
Algorithm for Automatic Generation of Curved and Compound Twills
Institute of Scientific and Technical Information of China (English)
WANG Mei-zhen; WANG Fu-mei; WANG Shan-yuan
2005-01-01
A new arithmetic using matrix left-shift functions for the quicker generation of curved and compound twills is introduced in this paper. A matrix model for the generation of regular, curved and compound twill structures is established and its computing simulation realization are elaborated. Examples of the algorithm applying in the simulation and the automatic generation of curved and compound twills in fabric CAD are obtained.
An efficient method for parallel CRC automatic generation
Institute of Scientific and Technical Information of China (English)
陈红胜; 张继承; 王勇; 陈抗生
2003-01-01
The State Transition Equation (STE) based method to automatically generate the parallel CRC circuits for any generator polynomial or required amount of parallelism is presented. The parallel CRC circuit so generated is partially optimized before being fed to synthesis tools and works properly in our LAN transceiv-er. Compared with the cascading method, the proposed method gives better timing results and significantly re-duces the synthesis time, in particular.
Parallel octree-based hexahedral mesh generation for eulerian to lagrangian conversion.
Energy Technology Data Exchange (ETDEWEB)
Staten, Matthew L.; Owen, Steven James
2010-09-01
Computational simulation must often be performed on domains where materials are represented as scalar quantities or volume fractions at cell centers of an octree-based grid. Common examples include bio-medical, geotechnical or shock physics calculations where interface boundaries are represented only as discrete statistical approximations. In this work, we introduce new methods for generating Lagrangian computational meshes from Eulerian-based data. We focus specifically on shock physics problems that are relevant to ASC codes such as CTH and Alegra. New procedures for generating all-hexahedral finite element meshes from volume fraction data are introduced. A new primal-contouring approach is introduced for defining a geometric domain. New methods for refinement, node smoothing, resolving non-manifold conditions and defining geometry are also introduced as well as an extension of the algorithm to handle tetrahedral meshes. We also describe new scalable MPI-based implementations of these procedures. We describe a new software module, Sculptor, which has been developed for use as an embedded component of CTH. We also describe its interface and its use within the mesh generation code, CUBIT. Several examples are shown to illustrate the capabilities of Sculptor.
A unified approach for a posteriori high-order curved mesh generation using solid mechanics
Poya, Roman; Sevilla, Ruben; Gil, Antonio J.
2016-09-01
The paper presents a unified approach for the a posteriori generation of arbitrary high-order curvilinear meshes via a solid mechanics analogy. The approach encompasses a variety of methodologies, ranging from the popular incremental linear elastic approach to very sophisticated non-linear elasticity. In addition, an intermediate consistent incrementally linearised approach is also presented and applied for the first time in this context. Utilising a consistent derivation from energy principles, a theoretical comparison of the various approaches is presented which enables a detailed discussion regarding the material characterisation (calibration) employed for the different solid mechanics formulations. Five independent quality measures are proposed and their relations with existing quality indicators, used in the context of a posteriori mesh generation, are discussed. Finally, a comprehensive range of numerical examples, both in two and three dimensions, including challenging geometries of interest to the solids, fluids and electromagnetics communities, are shown in order to illustrate and thoroughly compare the performance of the different methodologies. This comparison considers the influence of material parameters and number of load increments on the quality of the generated high-order mesh, overall computational cost and, crucially, the approximation properties of the resulting mesh when considering an isoparametric finite element formulation.
MEMOPS: data modelling and automatic code generation.
Fogh, Rasmus H; Boucher, Wayne; Ionides, John M C; Vranken, Wim F; Stevens, Tim J; Laue, Ernest D
2010-03-25
In recent years the amount of biological data has exploded to the point where much useful information can only be extracted by complex computational analyses. Such analyses are greatly facilitated by metadata standards, both in terms of the ability to compare data originating from different sources, and in terms of exchanging data in standard forms, e.g. when running processes on a distributed computing infrastructure. However, standards thrive on stability whereas science tends to constantly move, with new methods being developed and old ones modified. Therefore maintaining both metadata standards, and all the code that is required to make them useful, is a non-trivial problem. Memops is a framework that uses an abstract definition of the metadata (described in UML) to generate internal data structures and subroutine libraries for data access (application programming interfaces--APIs--currently in Python, C and Java) and data storage (in XML files or databases). For the individual project these libraries obviate the need for writing code for input parsing, validity checking or output. Memops also ensures that the code is always internally consistent, massively reducing the need for code reorganisation. Across a scientific domain a Memops-supported data model makes it easier to support complex standards that can capture all the data produced in a scientific area, share them among all programs in a complex software pipeline, and carry them forward to deposition in an archive. The principles behind the Memops generation code will be presented, along with example applications in Nuclear Magnetic Resonance (NMR) spectroscopy and structural biology.
Ishikawa, Takeo; Matsunami, Michio
This paper proposes a method to generate adaptively 2D and 3D finite element meshes taking into account the continuity requirements of the magnetic field at the interface between two neighboring elements. First, this paper proposes a new error estimator that includes the Zienkiewicz and Zhu error norm estimator and the boundary rules in the electromagnetic field. Using a 2D simple model, this paper decides two parameters of the proposed estimator. Next, this paper presents a 3D mesh generation method based on the Voronoi-Delaunay theory, which ensures that the bounding surface of the domain is contained in the triangulation. The method has the capability to decrease the amount of information on the connectivity of boundary nodes by generating nodes not only in the interior of the domain but also on its surface. Two simple magnetostatic field problems are provided to illustrate the usefulness of the proposed method.
Towards Automatic Personalized Content Generation for Platform Games
DEFF Research Database (Denmark)
Shaker, Noor; Yannakakis, Georgios N.; Togelius, Julian
2010-01-01
In this paper, we show that personalized levels can be automatically generated for platform games. We build on previous work, where models were derived that predicted player experience based on features of level design and on playing styles. These models are constructed using preference learning...
Mppsocgen: A framework for automatic generation of mppsoc architecture
Kallel, Emna; Baklouti, Mouna; Abid, Mohamed
2012-01-01
Automatic code generation is a standard method in software engineering since it improves the code consistency and reduces the overall development time. In this context, this paper presents a design flow for automatic VHDL code generation of mppSoC (massively parallel processing System-on-Chip) configuration. Indeed, depending on the application requirements, a framework of Netbeans Platform Software Tool named MppSoCGEN was developed in order to accelerate the design process of complex mppSoC. Starting from an architecture parameters design, VHDL code will be automatically generated using parsing method. Configuration rules are proposed to have a correct and valid VHDL syntax configuration. Finally, an automatic generation of Processor Elements and network topologies models of mppSoC architecture will be done for Stratix II device family. Our framework improves its flexibility on Netbeans 5.5 version and centrino duo Core 2GHz with 22 Kbytes and 3 seconds average runtime. Experimental results for reduction al...
Automatic Generation and Ranking of Questions for Critical Review
Liu, Ming; Calvo, Rafael A.; Rus, Vasile
2014-01-01
Critical review skill is one important aspect of academic writing. Generic trigger questions have been widely used to support this activity. When students have a concrete topic in mind, trigger questions are less effective if they are too general. This article presents a learning-to-rank based system which automatically generates specific trigger…
Automatic Generation of Tests from Domain and Multimedia Ontologies
Papasalouros, Andreas; Kotis, Konstantinos; Kanaris, Konstantinos
2011-01-01
The aim of this article is to present an approach for generating tests in an automatic way. Although other methods have been already reported in the literature, the proposed approach is based on ontologies, representing both domain and multimedia knowledge. The article also reports on a prototype implementation of this approach, which…
Automatic generation of gene finders for eukaryotic species
DEFF Research Database (Denmark)
Terkelsen, Kasper Munch; Krogh, A.
2006-01-01
Background The number of sequenced eukaryotic genomes is rapidly increasing. This means that over time it will be hard to keep supplying customised gene finders for each genome. This calls for procedures to automatically generate species-specific gene finders and to re-train them as the quantity...
A quick scan on possibilities for automatic metadata generation
Benneker, Frank
2006-01-01
The Quick Scan is a report on research into useable solutions for automatic generation of metadata or parts of metadata. The aim of this study is to explore possibilities for facilitating the process of attaching metadata to learning objects. This document is aimed at developers of digital learning
Automatic generation of matter-of-opinion video documentaries
Bocconi, S.; Nack, Frank; Hardman, Hazel Lynda
2008-01-01
In this paper we describe a model for automatically generating video documentaries. This allows viewers to specify the subject and the point of view of the documentary to be generated. The domain is matter-of-opinion documentaries based on interviews. The model combines rhetorical presentation patterns used by documentary makers with a data-driven approach. Rhetorical presentation patterns provide the viewer with an engaging viewing experience, while a data-driven approach can be applied to g...
Kainmueller, Dagmar
2014-01-01
? Segmentation of anatomical structures in medical image data is an essential task in clinical practice. Dagmar Kainmueller introduces methods for accurate fully automatic segmentation of anatomical structures in 3D medical image data. The author's core methodological contribution is a novel deformation model that overcomes limitations of state-of-the-art Deformable Surface approaches, hence allowing for accurate segmentation of tip- and ridge-shaped features of anatomical structures. As for practical contributions, she proposes application-specific segmentation pipelines for a range of anatom
Extending a CAD-Based Cartesian Mesh Generator for the Lattice Boltzmann Method
Energy Technology Data Exchange (ETDEWEB)
Cantrell, J Nathan [ORNL; Inclan, Eric J [ORNL; Joshi, Abhijit S [ORNL; Popov, Emilian L [ORNL; Jain, Prashant K [ORNL
2012-01-01
This paper describes the development of a custom preprocessor for the PaRAllel Thermal Hydraulics simulations using Advanced Mesoscopic methods (PRATHAM) code based on an open-source mesh generator, CartGen [1]. PRATHAM is a three-dimensional (3D) lattice Boltzmann method (LBM) based parallel flow simulation software currently under development at the Oak Ridge National Laboratory. The LBM algorithm in PRATHAM requires a uniform, coordinate system-aligned, non-body-fitted structured mesh for its computational domain. CartGen [1], which is a GNU-licensed open source code, already comes with some of the above needed functionalities. However, it needs to be further extended to fully support the LBM specific preprocessing requirements. Therefore, CartGen is being modified to (i) be compiler independent while converting a neutral-format STL (Stereolithography) CAD geometry to a uniform structured Cartesian mesh, (ii) provide a mechanism for PRATHAM to import the mesh and identify the fluid/solid domains, and (iii) provide a mechanism to visually identify and tag the domain boundaries on which to apply different boundary conditions.
Institute of Scientific and Technical Information of China (English)
ZHOU Guoxiang; CHEN Yinchao; SHEN Guoqiang
2001-01-01
The paper presents an efficient andfast non-uniform, orthogonal mesh generation algo-rithm for the analysis and design of cylindrical mi-crowave devices and integrated circuits using thecylindrical finite-difference time-domain (CFDTD)methods. By using this algorithm, we can easily gen-erate a suitable CFDTD grid fitting for the devel-oped CFDTD Maxwell's solver. In the paper, wewill introduce in detail the algorithm and the graph-ical functions of the corresponding software package,CylinMesh. In addition, we will illustrate the algo-rithm by demonstrating various one, two, and three-dimensional grid patterns for a double-layered cylin-drical microstrip stepped-impedance low pass filter.
Mesh convergence study for hydraulic turbine draft-tube
Devals, C.; Vu, T. C.; Zhang, Y.; Dompierre, J.; Guibault, F.
2016-11-01
Computational flow analysis is an essential tool for hydraulic turbine designers. Grid generation is the first step in the flow analysis process. Grid quality and solution accuracy are strongly linked. Even though many studies have addressed the issue of mesh independence, there is still no definitive consensus on mesh best practices, and research on that topic is still needed. This paper presents a mesh convergence study for turbulence flow in hydraulic turbine draft- tubes which represents the most challenging turbine component for CFD predictions. The findings from this parametric study will be incorporated as mesh control rules in an in-house automatic mesh generator for turbine components.
Shepherd, Jason; Mitchell, Scott A.; Jankovich, Steven R.; Benzley, Steven E.
2007-05-15
The present invention provides a meshing method, called grafting, that lifts the prior art constraint on abutting surfaces, including surfaces that are linking, source/target, or other types of surfaces of the trunk volume. The grafting method locally modifies the structured mesh of the linking surfaces allowing the mesh to conform to additional surface features. Thus, the grafting method can provide a transition between multiple sweep directions extending sweeping algorithms to 23/4-D solids. The method is also suitable for use with non-sweepable volumes; the method provides a transition between meshes generated by methods other than sweeping as well.
Directory of Open Access Journals (Sweden)
Mauro Massayoshi Sakamoto
2008-01-01
Full Text Available In this work, a software package based on the Delaunay´s algorithm is described. The main feature of this package is the capability in applying discretization in geometric domains of teeth taking into account their complex inner structures and the materials with different hardness. Usually, the mesh generators reported in literature treat molars and other teeth by using simplified geometric models, or even considering the teeth as homogeneous structures.
Automatic control system generation for robot design validation
Bacon, James A. (Inventor); English, James D. (Inventor)
2012-01-01
The specification and drawings present a new method, system and software product for and apparatus for generating a robotic validation system for a robot design. The robotic validation system for the robot design of a robotic system is automatically generated by converting a robot design into a generic robotic description using a predetermined format, then generating a control system from the generic robotic description and finally updating robot design parameters of the robotic system with an analysis tool using both the generic robot description and the control system.
Automatically generating procedure code and database maintenance scripts
Energy Technology Data Exchange (ETDEWEB)
Hatley, J.W. [Sandia National Labs., Albuquerque, NM (United States). Information Technologies and Methodologies Dept.
1994-10-01
Over the past couple of years the Information Technology Department at Sandia Laboratories has developed software to automatically generate database/4gl procedure code and database maintenance scripts based on database table information. With this software developers simply enter table and referential integrity information and the software generates code and scripts as required. The generated procedure code includes simple insert/delete/update procedures, transaction logging procedures as well as referential integrity procedures. The generated database maintenance scripts include scripts to modify structures, update remote databases, create views, and create indexes. Additionally, the software can generate EPSI representations of Binder diagrams for the tables. This paper will discuss the software application and use of it in real world applications. The automated generation of procedure code and maintenance scripts allows the developers to concentrate on the development of user interface code. The technique involves generating database/4 gl procedure code and maintenance scripts automatically from the database table information. The database/4gl procedure code provides standard insert/update/delete interfaces for upper level code as well as enforces the data constraints defined in the information model. The maintenance scripts provide maintenance scripts and migration scripts. This has resulted in fully updated database applications with complete rules enforcement and database maintenance scripts within days of a database modification.
An Application of the Mesh Generation and Refinement Tool to Mobile Bay, Alabama, USA
Aziz, Wali; Alarcon, Vladimir J.; McAnally, William; Martin, James; Cartwright, John
2009-08-01
A grid generation tool, called the Mesh Generation and Refinement Tool (MGRT), has been developed using Qt4. Qt4 is a comprehensive C++ application framework which includes GUI and container class-libraries and tools for cross-platform development. MGRT is capable of using several types of algorithms for grid generation. This paper presents an application of the MGRT grid generation tool for creating an unstructured grid of Mobile Bay (Alabama, USA) that will be used for hydrodynamics modeling. The algorithm used in this particular application is the Advancing-Front/Local-Reconnection (AFLR) [1] [2]. This research shows results of grids created with MGRT and compares them to grids (for the same geographical container) created using other grid generation tools. The superior quality of the grids generated by MGRT is shown.
Large scale generation of micro-droplet array by vapor condensation on mesh screen piece
Xie, Jian; Xu, Jinliang; He, Xiaotian; Liu, Qi
2017-01-01
We developed a novel micro-droplet array system, which is based on the distinct three dimensional mesh screen structure and sintering and oxidation induced thermal-fluid performance. Mesh screen was sintered on a copper substrate by bonding the two components. Non-uniform residue stress is generated along weft wires, with larger stress on weft wire top location than elsewhere. Oxidation of the sintered package forms micro pits with few nanograsses on weft wire top location, due to the stress corrosion mechanism. Nanograsses grow elsewhere to show hydrophobic behavior. Thus, surface-energy-gradient weft wires are formed. Cooling the structure in a wet air environment nucleates water droplets on weft wire top location, which is more “hydrophilic” than elsewhere. Droplet size is well controlled by substrate temperature, air humidity and cooling time. Because warp wires do not contact copper substrate and there is a larger conductive thermal resistance between warp wire and weft wire, warp wires contribute less to condensation but function as supporting structure. The surface energy analysis of drops along weft wires explains why droplet array can be generated on the mesh screen piece. Because the commercial material is used, the droplet system is cost effective and can be used for large scale utilization.
Energy Technology Data Exchange (ETDEWEB)
Wilson, B G; Sonnad, V
2011-02-14
Precise electronic structure calculations of ions in plasmas benefit from optimized numerical radial meshes. A new closed form expression for obtaining non-linear parameters for the efficient generation of analytic log-linear radial meshes is presented. In conjunction with the (very simple) algorithm for the rapid high precision evaluation of Lambert's W-function, the above identity allows the precise construction of generalized log-linear radial meshes adapted to various constraints.
Optimum siting and sizing of a large distributed generator in a mesh connected system
Energy Technology Data Exchange (ETDEWEB)
Elnashar, Mohab M.; El Shatshat, Ramadan; Salama, Magdy M.A. [Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario (Canada)
2010-06-15
This paper proposes a new approach to optimally determine the appropriate size and location of the distributed generator (DG) in a large mesh connected system. This paper presents a visual optimization approach in which the planner plays an important role in determining the optimal siting and sizing of the DG through the choice of the appropriate weight factors of the parameters included in the optimization technique according to the system deficiencies. Losses, voltage profile and short circuit level are used in the algorithm to determine the optimum sizes and locations of the DG. The short circuit level parameter is introduced to represent the protective device requirements in the selection of the size and location of the DG. The proposed technique has been tested on the IEEE 24 - bus mesh connected test system. The obtained results showed clearly that the optimal size and location can be simply determined through the proposed approach. (author)
Progressive Concept Evaluation Method for Automatically Generated Concept Variants
Directory of Open Access Journals (Sweden)
Woldemichael Dereje Engida
2014-07-01
Full Text Available Conceptual design is one of the most critical and important phases of design process with least computer support system. Conceptual design support tool (CDST is a conceptual design support system developed to automatically generate concepts for each subfunction in functional structure. The automated concept generation process results in large number of concept variants which require a thorough evaluation process to select the best design. To address this, a progressive concept evaluation technique consisting of absolute comparison, concept screening and weighted decision matrix using analytical hierarchy process (AHP is proposed to eliminate infeasible concepts at each stage. The software implementation of the proposed method is demonstrated.
Energy Technology Data Exchange (ETDEWEB)
Kleinstreuer, C.; Patterson, M.R.
1980-05-01
A two- or three-dimensional finite difference mesh generator capable of discretizing subrectangular flow regions (planar coordinates) with arbitrarily shaped bottom contours (vertical dimension) was developed. This economical, interactive computer code, written in FORTRAN IV and employing DISSPLA software together with graphics terminal, generates first a planar rectangular grid of variable element density according to the geometry and local kinematic flow patterns of a given fluid flow problem. Then subrectangular areas are deleted to produce canals, tributaries, bays, and the like. For three-dimensional problems, arbitrary bathymetric profiles (river beds, channel cross section, ocean shoreline profiles, etc.) are approximated with grid lines forming steps of variable spacing. Furthermore, the code works as a preprocessor numbering the discrete elements and the nodal points. Prescribed values for the principal variables can be automatically assigned to solid as well as kinematic boundaries. Cabinet drawings aid in visualizing the complete flow domain. Input data requirements are necessary only to specify the spacing between grid lines, determine land regions that have to be excluded, and to identify boundary nodes. 15 figures, 2 tables.
[Automatic analysis pipeline of next-generation sequencing data].
Wenke, Li; Fengyu, Li; Siyao, Zhang; Bin, Cai; Na, Zheng; Yu, Nie; Dao, Zhou; Qian, Zhao
2014-06-01
The development of next-generation sequencing has generated high demand for data processing and analysis. Although there are a lot of software for analyzing next-generation sequencing data, most of them are designed for one specific function (e.g., alignment, variant calling or annotation). Therefore, it is necessary to combine them together for data analysis and to generate interpretable results for biologists. This study designed a pipeline to process Illumina sequencing data based on Perl programming language and SGE system. The pipeline takes original sequence data (fastq format) as input, calls the standard data processing software (e.g., BWA, Samtools, GATK, and Annovar), and finally outputs a list of annotated variants that researchers can further analyze. The pipeline simplifies the manual operation and improves the efficiency by automatization and parallel computation. Users can easily run the pipeline by editing the configuration file or clicking the graphical interface. Our work will facilitate the research projects using the sequencing technology.
Automatic Item Generation via Frame Semantics: Natural Language Generation of Math Word Problems.
Deane, Paul; Sheehan, Kathleen
This paper is an exploration of the conceptual issues that have arisen in the course of building a natural language generation (NLG) system for automatic test item generation. While natural language processing techniques are applicable to general verbal items, mathematics word problems are particularly tractable targets for natural language…
Definition And Interpolation Of Discrete Metric For Mesh Generation On 3d Surfaces
Barbara Głut; Tomasz Jurczyk
2005-01-01
The article concerns the problem of a deﬁnition of the control space from a set of discretedata (metric description gathered from diﬀerent sources) and its inﬂuence on the eﬃciency ofthe generation process with respect to 2D and 3D surface meshes. Several methods of metricinterpolation between these discrete points are inspected, including an automated selectionof proper method. Some aspects of the procedures of creation and employment of the meshcontrol space based on the discrete set of poi...
Definition And Interpolation Of Discrete Metric For Mesh Generation On 3d Surfaces
Directory of Open Access Journals (Sweden)
Barbara Głut
2005-01-01
Full Text Available The article concerns the problem of a deﬁnition of the control space from a set of discretedata (metric description gathered from diﬀerent sources and its inﬂuence on the eﬃciency ofthe generation process with respect to 2D and 3D surface meshes. Several methods of metricinterpolation between these discrete points are inspected, including an automated selectionof proper method. Some aspects of the procedures of creation and employment of the meshcontrol space based on the discrete set of points are presented. The results of using diﬀerentvariations of these methods are also included.
Comment on "A note on generalized radial mesh generation for plasma electronic structure"
Pain, Jean-Christophe
2011-01-01
In a recent note [High Energy Density Phys. 7, 161 (2011)], B.G. Wilson and V. Sonnad proposed a very useful closed form expression for the efficient generation of analytic log-linear radial meshes. The central point of the note is an implicit equation for the parameter h, involving Lambert's function W[x]. The authors mention that they are unaware of any direct proof of this equation (they obtained it by re-summing the Taylor expansion of h using high-order coefficients obtained by analytic differentiation of the implicit definition using symbolic manipulation). In the present comment, we present a direct proof of that equation.
Automatic generation of executable communication specifications from parallel applications
Energy Technology Data Exchange (ETDEWEB)
Pakin, Scott [Los Alamos National Laboratory; Wu, Xing [NCSU; Mueller, Frank [NCSU
2011-01-19
Portable parallel benchmarks are widely used and highly effective for (a) the evaluation, analysis and procurement of high-performance computing (HPC) systems and (b) quantifying the potential benefits of porting applications for new hardware platforms. Yet, past techniques to synthetically parameterized hand-coded HPC benchmarks prove insufficient for today's rapidly-evolving scientific codes particularly when subject to multi-scale science modeling or when utilizing domain-specific libraries. To address these problems, this work contributes novel methods to automatically generate highly portable and customizable communication benchmarks from HPC applications. We utilize ScalaTrace, a lossless, yet scalable, parallel application tracing framework to collect selected aspects of the run-time behavior of HPC applications, including communication operations and execution time, while abstracting away the details of the computation proper. We subsequently generate benchmarks with identical run-time behavior from the collected traces. A unique feature of our approach is that we generate benchmarks in CONCEPTUAL, a domain-specific language that enables the expression of sophisticated communication patterns using a rich and easily understandable grammar yet compiles to ordinary C + MPI. Experimental results demonstrate that the generated benchmarks are able to preserve the run-time behavior - including both the communication pattern and the execution time - of the original applications. Such automated benchmark generation is particularly valuable for proprietary, export-controlled, or classified application codes: when supplied to a third party. Our auto-generated benchmarks ensure performance fidelity but without the risks associated with releasing the original code. This ability to automatically generate performance-accurate benchmarks from parallel applications is novel and without any precedence, to our knowledge.
Visual definition of procedures for automatic virtual scene generation
Lucanin, Drazen
2012-01-01
With more and more digital media, especially in the field of virtual reality where detailed and convincing scenes are much required, procedural scene generation is a big helping tool for artists. A problem is that defining scene descriptions through these procedures usually requires a knowledge in formal language grammars, programming theory and manually editing textual files using a strict syntax, making it less intuitive to use. Luckily, graphical user interfaces has made a lot of tasks on computers easier to perform and out of the belief that creating computer programs can also be one of them, visual programming languages (VPLs) have emerged. The goal in VPLs is to shift more work from the programmer to the integrated development environment (IDE), making programming an user-friendlier task. In this thesis, an approach of using a VPL for defining procedures that automatically generate virtual scenes is presented. The methods required to build a VPL are presented, including a novel method of generating read...
Automatic Generation of 3D Building Models with Multiple Roofs
Institute of Scientific and Technical Information of China (English)
Kenichi Sugihara; Yoshitugu Hayashi
2008-01-01
Based on building footprints (building polygons) on digital maps, we are proposing the GIS and CG integrated system that automatically generates 3D building models with multiple roofs. Most building polygons' edges meet at right angles (orthogonal polygon). The integrated system partitions orthogonal building polygons into a set of rectangles and places rectangular roofs and box-shaped building bodies on these rectangles. In order to partition an orthogonal polygon, we proposed a useful polygon expression in deciding from which vertex a dividing line is drawn. In this paper, we propose a new scheme for partitioning building polygons and show the process of creating 3D roof models.
Automatic structures and growth functions for finitely generated abelian groups
Kamei, Satoshi
2011-01-01
In this paper, we consider the formal power series whose n-th coefficient is the number of copies of a given finite graph in the ball of radius n centred at the identity element in the Cayley graph of a finitely generated group and call it the growth function. Epstein, Iano-Fletcher and Uri Zwick proved that the growth function is a rational function if the group has a geodesic automatic structure. We compute the growth function in the case where the group is abelian and see that the denominator of the rational function is determined from the rank of the group.
On combining Laplacian and optimization-based mesh smoothing techniques
Energy Technology Data Exchange (ETDEWEB)
Freitag, L.A.
1997-07-01
Local mesh smoothing algorithms have been shown to be effective in repairing distorted elements in automatically generated meshes. The simplest such algorithm is Laplacian smoothing, which moves grid points to the geometric center of incident vertices. Unfortunately, this method operates heuristically and can create invalid meshes or elements of worse quality than those contained in the original mesh. In contrast, optimization-based methods are designed to maximize some measure of mesh quality and are very effective at eliminating extremal angles in the mesh. These improvements come at a higher computational cost, however. In this article the author proposes three smoothing techniques that combine a smart variant of Laplacian smoothing with an optimization-based approach. Several numerical experiments are performed that compare the mesh quality and computational cost for each of the methods in two and three dimensions. The author finds that the combined approaches are very cost effective and yield high-quality meshes.
Sarkis, C.; Silva, L.; Gandin, Ch-A.; Plapp, M.
2016-03-01
Dendritic growth is computed with automatic adaptation of an anisotropic and unstructured finite element mesh. The energy conservation equation is formulated for solid and liquid phases considering an interface balance that includes the Gibbs-Thomson effect. An equation for a diffuse interface is also developed by considering a phase field function with constant negative value in the liquid and constant positive value in the solid. Unknowns are the phase field function and a dimensionless temperature, as proposed by [1]. Linear finite element interpolation is used for both variables, and discretization stabilization techniques ensure convergence towards a correct non-oscillating solution. In order to perform quantitative computations of dendritic growth on a large domain, two additional numerical ingredients are necessary: automatic anisotropic unstructured adaptive meshing [2,[3] and parallel implementations [4], both made available with the numerical platform used (CimLib) based on C++ developments. Mesh adaptation is found to greatly reduce the number of degrees of freedom. Results of phase field simulations for dendritic solidification of a pure material in two and three dimensions are shown and compared with reference work [1]. Discussion on algorithm details and the CPU time will be outlined.
Automatic Tamil lyric generation based on ontological interpretation for semantics
Indian Academy of Sciences (India)
Rajeswari Sridhar; D Jalin Gladis; Kameswaran Ganga; G Dhivya Prabha
2014-02-01
This system proposes an -gram based approach to automatic Tamil lyric generation, by the ontological semantic interpretation of the input scene. The approach is based on identifying the semantics conveyed in the scenario, thereby making the system understand the situation and generate lyrics accordingly. The heart of the system includes the ontological interpretation of the scenario, and the selection of the appropriate tri-grams for generating the lyrics. To fulfill this, we have designed a new ontology with weighted edges, where the edges correspond to a set of sentences, which indicate a relationship, and are represented as a tri-gram. Once the appropriate tri-grams are selected, the root words from these tri-grams are sent to the morphological generator, to form words in their packed form. These words are then assembled to form the final lyrics. Parameters of poetry like rhyme, alliteration, simile, vocative words, etc., are also taken care of by the system. Using this approach, we achieved an average accuracy of 77.3% with respect to the exact semantic details being conveyed in the generated lyrics.
Optical breast shape capture and finite-element mesh generation for electrical impedance tomography.
Forsyth, J; Borsic, A; Halter, R J; Hartov, A; Paulsen, K D
2011-07-01
X-ray mammography is the standard for breast cancer screening. The development of alternative imaging modalities is desirable because mammograms expose patients to ionizing radiation. Electrical impedance tomography (EIT) may be used to determine tissue conductivity, a property which is an indicator of cancer presence. EIT is also a low-cost imaging solution and does not involve ionizing radiation. In breast EIT, impedance measurements are made using electrodes placed on the surface of the patient's breast. The complex conductivity of the volume of the breast is estimated by a reconstruction algorithm. EIT reconstruction is a severely ill-posed inverse problem. As a result, noisy instrumentation and incorrect modelling of the electrodes and domain shape produce significant image artefacts. In this paper, we propose a method that has the potential to reduce these errors by accurately modelling the patient breast shape. A 3D hand-held optical scanner is used to acquire the breast geometry and electrode positions. We develop methods for processing the data from the scanner and producing volume meshes accurately matching the breast surface and electrode locations, which can be used for image reconstruction. We demonstrate this method for a plaster breast phantom and a human subject. Using this approach will allow patient-specific finite-element meshes to be generated which has the potential to improve the clinical value of EIT for breast cancer diagnosis.
Generating quality word sense disambiguation test sets based on MeSH indexing.
Fan, Jung-Wei; Friedman, Carol
2009-11-14
Word sense disambiguation (WSD) determines the correct meaning of a word that has more than one meaning, and is a critical step in biomedical natural language processing, as interpretation of information in text can be correct only if the meanings of their component terms are correctly identified first. Quality evaluation sets are important to WSD because they can be used as representative samples for developing automatic programs and as referees for comparing different WSD programs. To help create quality test sets for WSD, we developed a MeSH-based automatic sense-tagging method that preferentially annotates terms being topical of the text. Preliminary results were promising and revealed important issues to be addressed in biomedical WSD research. We also suggest that, by cross-validating with 2 or 3 annotators, the method should be able to efficiently generate quality WSD test sets. Online supplement is available at: http://www.dbmi.columbia.edu/~juf7002/AMIA09.
Energy Technology Data Exchange (ETDEWEB)
Ricard, L.
2005-12-15
The high level geo-statistic description of the subsurface are often far too detailed for use in routine flow simulators. To make flow simulations tractable, the number of grid blocks has to be reduced: an approximation, still relevant with flow description, is necessary. In this work, we place the emphasis on the scaling procedure from the fine scale model to the multi-scale reservoir model. Two main problems appear: Near wells, faults and channels, the volume of flexible cells may be less than fine ones, so we need to solve a down-scaling problem; Far from these regions, the volume of cells are bigger than fine ones so we need to solve an up-scaling problem. In this work, research has been done on each of these three areas: down-scaling, up-scaling and fluid flow simulation. For each of these subjects, a review, some news improvements and comparative study are proposed. The proposed down-scaling method is build to be compatible with existing data integration methods. The comparative study shows that empirical methods are not enough accurate to solve the problem. Concerning the up-scaling step, the proposed approach is based on an existing method: the perturbed boundary conditions. An extension to unstructured mesh is developed for the inter-cell permeability tensor. The comparative study shows that numerical methods are not always as accurate as expected and the empirical model can be sufficient in lot of cases. A new approach to single-phase fluid flow simulation is developed. This approach can handle with full tensorial permeability fields with source or sink terms.(author)
Automatic Generation of Symbolic Model for Parameterized Synchronous Systems
Institute of Scientific and Technical Information of China (English)
Wei-Wen Xu
2004-01-01
With the purpose of making the verification of parameterized system more general and easier, in this paper, a new and intuitive language PSL (Parameterized-system Specification Language) is proposed to specify a class of parameterized synchronous systems. From a PSL script, an automatic method is proposed to generate a constraint-based symbolic model. The model can concisely symbolically represent the collections of global states by counting the number of processes in a given state. Moreover, a theorem has been proved that there is a simulation relation between the original system and its symbolic model. Since the abstract and symbolic techniques are exploited in the symbolic model, state-explosion problem in traditional verification methods is efficiently avoided. Based on the proposed symbolic model, a reachability analysis procedure is implemented using ANSI C++ on UNIX platform. Thus, a complete tool for verifying the parameterized synchronous systems is obtained and tested for some cases. The experimental results show that the method is satisfactory.
Hybrid Generative/Discriminative Learning for Automatic Image Annotation
Yang, Shuang Hong; Zha, Hongyuan
2012-01-01
Automatic image annotation (AIA) raises tremendous challenges to machine learning as it requires modeling of data that are both ambiguous in input and output, e.g., images containing multiple objects and labeled with multiple semantic tags. Even more challenging is that the number of candidate tags is usually huge (as large as the vocabulary size) yet each image is only related to a few of them. This paper presents a hybrid generative-discriminative classifier to simultaneously address the extreme data-ambiguity and overfitting-vulnerability issues in tasks such as AIA. Particularly: (1) an Exponential-Multinomial Mixture (EMM) model is established to capture both the input and output ambiguity and in the meanwhile to encourage prediction sparsity; and (2) the prediction ability of the EMM model is explicitly maximized through discriminative learning that integrates variational inference of graphical models and the pairwise formulation of ordinal regression. Experiments show that our approach achieves both su...
Automatic Generation of OWL Ontology from XML Data Source
Yahia, Nora; Ahmed, AbdelWahab
2012-01-01
The eXtensible Markup Language (XML) can be used as data exchange format in different domains. It allows different parties to exchange data by providing common understanding of the basic concepts in the domain. XML covers the syntactic level, but lacks support for reasoning. Ontology can provide a semantic representation of domain knowledge which supports efficient reasoning and expressive power. One of the most popular ontology languages is the Web Ontology Language (OWL). It can represent domain knowledge using classes, properties, axioms and instances for the use in a distributed environment such as the World Wide Web. This paper presents a new method for automatic generation of OWL ontology from XML data sources.
Spline-based automatic path generation of welding robot
Institute of Scientific and Technical Information of China (English)
Niu Xuejuan; Li Liangyu
2007-01-01
This paper presents a flexible method for the representation of welded seam based on spline interpolation. In this method, the tool path of welding robot can be generated automatically from a 3D CAD model. This technique has been implemented and demonstrated in the FANUC Arc Welding Robot Workstation. According to the method, a software system is developed using VBA of SolidWorks 2006. It offers an interface between SolidWorks and ROBOGUIDE, the off-line programming software of FANUC robot. It combines the strong modeling function of the former and the simulating function of the latter. It also has the capability of communication with on-line robot. The result data have shown its high accuracy and strong reliability in experiments. This method will improve the intelligence and the flexibility of the welding robot workstation.
Automatic generation of matrix element derivatives for tight binding models
Elena, Alin M.; Meister, Matthias
2005-10-01
Tight binding (TB) models are one approach to the quantum mechanical many-particle problem. An important role in TB models is played by hopping and overlap matrix elements between the orbitals on two atoms, which of course depend on the relative positions of the atoms involved. This dependence can be expressed with the help of Slater-Koster parameters, which are usually taken from tables. Recently, a way to generate these tables automatically was published. If TB approaches are applied to simulations of the dynamics of a system, also derivatives of matrix elements can appear. In this work we give general expressions for first and second derivatives of such matrix elements. Implemented in a tight binding computer program, like, for instance, DINAMO, they obviate the need to type all the required derivatives of all occurring matrix elements by hand.
Intelligent control schemes applied to Automatic Generation Control
Directory of Open Access Journals (Sweden)
Dingguo Chen
2016-04-01
Full Text Available Integrating ever increasing amount of renewable generating resources to interconnected power systems has created new challenges to the safety and reliability of today‟s power grids and posed new questions to be answered in the power system modeling, analysis and control. Automatic Generation Control (AGC must be extended to be able to accommodate the control of renewable generating assets. In addition, AGC is mandated to operate in accordance with the NERC‟s Control Performance Standard (CPS criteria, which represent a greater flexibility in relaxing the control of generating resources and yet assuring the stability and reliability of interconnected power systems when each balancing authority operates in full compliance. Enhancements in several aspects to the traditional AGC must be made in order to meet the aforementioned challenges. It is the intention of this paper to provide a systematic, mathematical formulation for AGC as a first attempt in the context of meeting the NERC CPS requirements and integrating renewable generating assets, which has not been seen reported in the literature to the best knowledge of the authors. Furthermore, this paper proposes neural network based predictive control schemes for AGC. The proposed controller is capable of handling complicated nonlinear dynamics in comparison with the conventional Proportional Integral (PI controller which is typically most effective to handle linear dynamics. The neural controller is designed in such a way that it has the capability of controlling the system generation in the relaxed manner so the ACE is controlled to a desired range instead of driving it to zero which would otherwise increase the control effort and cost; and most importantly the resulting system control performance meets the NERC CPS requirements and/or the NERC Balancing Authority’s ACE Limit (BAAL compliance requirements whichever are applicable.
Provenance-Powered Automatic Workflow Generation and Composition
Zhang, J.; Lee, S.; Pan, L.; Lee, T. J.
2015-12-01
In recent years, scientists have learned how to codify tools into reusable software modules that can be chained into multi-step executable workflows. Existing scientific workflow tools, created by computer scientists, require domain scientists to meticulously design their multi-step experiments before analyzing data. However, this is oftentimes contradictory to a domain scientist's daily routine of conducting research and exploration. We hope to resolve this dispute. Imagine this: An Earth scientist starts her day applying NASA Jet Propulsion Laboratory (JPL) published climate data processing algorithms over ARGO deep ocean temperature and AMSRE sea surface temperature datasets. Throughout the day, she tunes the algorithm parameters to study various aspects of the data. Suddenly, she notices some interesting results. She then turns to a computer scientist and asks, "can you reproduce my results?" By tracking and reverse engineering her activities, the computer scientist creates a workflow. The Earth scientist can now rerun the workflow to validate her findings, modify the workflow to discover further variations, or publish the workflow to share the knowledge. In this way, we aim to revolutionize computer-supported Earth science. We have developed a prototyping system to realize the aforementioned vision, in the context of service-oriented science. We have studied how Earth scientists conduct service-oriented data analytics research in their daily work, developed a provenance model to record their activities, and developed a technology to automatically generate workflow starting from user behavior and adaptability and reuse of these workflows for replicating/improving scientific studies. A data-centric repository infrastructure is established to catch richer provenance to further facilitate collaboration in the science community. We have also established a Petri nets-based verification instrument for provenance-based automatic workflow generation and recommendation.
A GPU implementation of adaptive mesh refinement to simulate tsunamis generated by landslides
de la Asunción, Marc; Castro, Manuel J.
2016-04-01
In this work we propose a CUDA implementation for the simulation of landslide-generated tsunamis using a two-layer Savage-Hutter type model and adaptive mesh refinement (AMR). The AMR method consists of dynamically increasing the spatial resolution of the regions of interest of the domain while keeping the rest of the domain at low resolution, thus obtaining better runtimes and similar results compared to increasing the spatial resolution of the entire domain. Our AMR implementation uses a patch-based approach, it supports up to three levels, power-of-two ratios of refinement, different refinement criteria and also several user parameters to control the refinement and clustering behaviour. A strategy based on the variation of the cell values during the simulation is used to interpolate and propagate the values of the fine cells. Several numerical experiments using artificial and realistic scenarios are presented.
Energy Technology Data Exchange (ETDEWEB)
Flandrin, N.
2005-09-15
During the exploitation of an oil reservoir, it is important to predict the recovery of hydrocarbons and to optimize its production. A better comprehension of the physical phenomena requires to simulate 3D multiphase flows in increasingly complex geological structures. In this thesis, we are interested in this spatial discretization and we propose to extend in 3D the 2D hybrid model proposed by IFP in 1998 that allows to take directly into account in the geometry the radial characteristics of the flows. In these hybrid meshes, the wells and their drainage areas are described by structured radial circular meshes and the reservoirs are represented by structured meshes that can be a non uniform Cartesian grid or a Corner Point Geometry grids. In order to generate a global conforming mesh, unstructured transition meshes based on power diagrams and satisfying finite volume properties are used to connect the structured meshes together. Two methods have been implemented to generate these transition meshes: the first one is based on a Delaunay triangulation, the other one uses a frontal approach. Finally, some criteria are introduced to measure the quality of the transition meshes and optimization procedures are proposed to increase this quality under finite volume properties constraints. (author)
Reaction Mechanism Generator: Automatic construction of chemical kinetic mechanisms
Gao, Connie W.; Allen, Joshua W.; Green, William H.; West, Richard H.
2016-06-01
Reaction Mechanism Generator (RMG) constructs kinetic models composed of elementary chemical reaction steps using a general understanding of how molecules react. Species thermochemistry is estimated through Benson group additivity and reaction rate coefficients are estimated using a database of known rate rules and reaction templates. At its core, RMG relies on two fundamental data structures: graphs and trees. Graphs are used to represent chemical structures, and trees are used to represent thermodynamic and kinetic data. Models are generated using a rate-based algorithm which excludes species from the model based on reaction fluxes. RMG can generate reaction mechanisms for species involving carbon, hydrogen, oxygen, sulfur, and nitrogen. It also has capabilities for estimating transport and solvation properties, and it automatically computes pressure-dependent rate coefficients and identifies chemically-activated reaction paths. RMG is an object-oriented program written in Python, which provides a stable, robust programming architecture for developing an extensible and modular code base with a large suite of unit tests. Computationally intensive functions are cythonized for speed improvements.
A comparison of tetrahedral mesh improvement techniques
Energy Technology Data Exchange (ETDEWEB)
Freitag, L.A.; Ollivier-Gooch, C. [Argonne National Lab., IL (United States). Mathematics and Computer Science Div.
1996-12-01
Automatic mesh generation and adaptive refinement methods for complex three-dimensional domains have proven to be very successful tools for the efficient solution of complex applications problems. These methods can, however, produce poorly shaped elements that cause the numerical solution to be less accurate and more difficult to compute. Fortunately, the shape of the elements can be improved through several mechanisms, including face-swapping techniques that change local connectivity and optimization-based mesh smoothing methods that adjust grid point location. The authors consider several criteria for each of these two methods and compare the quality of several meshes obtained by using different combinations of swapping and smoothing. Computational experiments show that swapping is critical to the improvement of general mesh quality and that optimization-based smoothing is highly effective in eliminating very small and very large angles. The highest quality meshes are obtained by using a combination of swapping and smoothing techniques.
Reinforcement-Based Fuzzy Neural Network ontrol with Automatic Rule Generation
Institute of Scientific and Technical Information of China (English)
无
1999-01-01
A reinforcemen-based fuzzy neural network control with automatic rule generation RBFNNC) is pro-posed. A set of optimized fuzzy control rules can be automatically generated through reinforcement learning based onthe state variables of object system. RBFNNC was applied to a cart-pole balancing system and simulation resultshows significant improvements on the rule generation.
An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations.
Melckenbeeck, Ine; Audenaert, Pieter; Michoel, Tom; Colle, Didier; Pickavet, Mario
2016-01-01
Graphlets are small subgraphs, usually containing up to five vertices, that can be found in a larger graph. Identification of the graphlets that a vertex in an explored graph touches can provide useful information about the local structure of the graph around that vertex. Actually finding all graphlets in a large graph can be time-consuming, however. As the graphlets grow in size, more different graphlets emerge and the time needed to find each graphlet also scales up. If it is not needed to find each instance of each graphlet, but knowing the number of graphlets touching each node of the graph suffices, the problem is less hard. Previous research shows a way to simplify counting the graphlets: instead of looking for the graphlets needed, smaller graphlets are searched, as well as the number of common neighbors of vertices. Solving a system of equations then gives the number of times a vertex is part of each graphlet of the desired size. However, until now, equations only exist to count graphlets with 4 or 5 nodes. In this paper, two new techniques are presented. The first allows to generate the equations needed in an automatic way. This eliminates the tedious work needed to do so manually each time an extra node is added to the graphlets. The technique is independent on the number of nodes in the graphlets and can thus be used to count larger graphlets than previously possible. The second technique gives all graphlets a unique ordering which is easily extended to name graphlets of any size. Both techniques were used to generate equations to count graphlets with 4, 5 and 6 vertices, which extends all previous results. Code can be found at https://github.com/IneMelckenbeeck/equation-generator and https://github.com/IneMelckenbeeck/graphlet-naming.
Castro-Mateos, Isaac; Pozo, Jose M.; Lazary, Aron; Frangi, Alejandro F.
2016-03-01
Computational medicine aims at developing patient-specific models to help physicians in the diagnosis and treatment selection for patients. The spine, and other skeletal structures, is an articulated object, composed of rigid bones (vertebrae) and non-rigid parts (intervertebral discs (IVD), ligaments and muscles). These components are usually extracted from different image modalities, involving patient repositioning. In the case of the spine, these models require the segmentation of IVDs from MR and vertebrae from CT. In the literature, there exists a vast selection of segmentations methods, but there is a lack of approaches to align the vertebrae and IVDs. This paper presents a method to create patient-specific finite element meshes for biomechanical simulations, integrating rigid and non-rigid parts of articulated objects. First, the different parts are aligned in a complete surface model. Vertebrae extracted from CT are rigidly repositioned in between the IVDs, initially using the IVDs location and then refining the alignment using the MR image with a rigid active shape model algorithm. Finally, a mesh morphing algorithm, based on B-splines, is employed to map a template finite-element (volumetric) mesh to the patient-specific surface mesh. This morphing reduces possible misalignments and guarantees the convexity of the model elements. Results show that the accuracy of the method to align vertebrae into MR, together with IVDs, is similar to that of the human observers. Thus, this method is a step forward towards the automation of patient-specific finite element models for biomechanical simulations.
On A Semi-Automatic Method for Generating Composition Tables
Liu, Weiming
2011-01-01
Originating from Allen's Interval Algebra, composition-based reasoning has been widely acknowledged as the most popular reasoning technique in qualitative spatial and temporal reasoning. Given a qualitative calculus (i.e. a relation model), the first thing we should do is to establish its composition table (CT). In the past three decades, such work is usually done manually. This is undesirable and error-prone, given that the calculus may contain tens or hundreds of basic relations. Computing the correct CT has been identified by Tony Cohn as a challenge for computer scientists in 1995. This paper addresses this problem and introduces a semi-automatic method to compute the CT by randomly generating triples of elements. For several important qualitative calculi, our method can establish the correct CT in a reasonable short time. This is illustrated by applications to the Interval Algebra, the Region Connection Calculus RCC-8, the INDU calculus, and the Oriented Point Relation Algebras. Our method can also be us...
Learning Techniques for Automatic Test Pattern Generation using Boolean Satisfiability
Directory of Open Access Journals (Sweden)
Liu Xin
2013-07-01
Full Text Available Automatic Test Pattern Generation (ATPG is one of the core problems in testing of digital circuits. ATPG algorithms based on Boolean Satisfiability (SAT turned out to be very powerful, due to great advances in the performance of satisfiability solvers for propositional logic in the last two decades. SAT-based ATPG clearly outperforms classical approaches especially for hard-to-detect faults. But its inaccessibility of structural information and don’t care, there exists the over-specification problem of input patterns. In this paper we present techniques to delve into an additional layer to make use of structural properties of the circuit and value justification relations to a generic SAT algorithm. It joins binary decision graphs (BDD and SAT techniques to improve the efficiency of ATPG. It makes a study of inexpensive reconvergent fanout analysis of circuit to gather information on the local signal correlation by using BDD learning, then uses the above learned information to restrict and focus the overall search space of SAT-based ATPG. The learning technique is effective and lightweight. Experimental results show the effectiveness of the approach.
Development of tools for automatic generation of PLC code
Koutli, Maria; Rochez, Jacques
This Master thesis was performed at CERN and more specifically in the EN-ICE-PLC section. The Thesis describes the integration of two PLC platforms, that are based on CODESYS development tool, to the CERN defined industrial framework, UNICOS. CODESYS is a development tool for PLC programming, based on IEC 61131-3 standard, and is adopted by many PLC manufacturers. The two PLC development environments are, the SoMachine from Schneider and the TwinCAT from Beckhoff. The two CODESYS compatible PLCs, should be controlled by the SCADA system of Siemens, WinCC OA. The framework includes a library of Function Blocks (objects) for the PLC programs and a software for automatic generation of the PLC code based on this library, called UAB. The integration aimed to give a solution that is shared by both PLC platforms and was based on the PLCOpen XML scheme. The developed tools were demonstrated by creating a control application for both PLC environments and testing of the behavior of the code of the library.
Audio watermarking technologies for automatic cue sheet generation systems
Caccia, Giuseppe; Lancini, Rosa C.; Pascarella, Annalisa; Tubaro, Stefano; Vicario, Elena
2001-08-01
Usually watermark is used as a way for hiding information on digital media. The watermarked information may be used to allow copyright protection or user and media identification. In this paper we propose a watermarking scheme for digital audio signals that allow automatic identification of musical pieces transmitted in TV broadcasting programs. In our application the watermark must be, obviously, imperceptible to the users, should be robust to standard TV and radio editing and have a very low complexity. This last item is essential to allow a software real-time implementation of the insertion and detection of watermarks using only a minimum amount of the computation power of a modern PC. In the proposed method the input audio sequence is subdivided in frames. For each frame a watermark spread spectrum sequence is added to the original data. A two steps filtering procedure is used to generate the watermark from a Pseudo-Noise (PN) sequence. The filters approximate respectively the threshold and the frequency masking of the Human Auditory System (HAS). In the paper we discuss first the watermark embedding system then the detection approach. The results of a large set of subjective tests are also presented to demonstrate the quality and robustness of the proposed approach.
Automatic generation of digital anthropomorphic phantoms from simulated MRI acquisitions
Lindsay, C.; Gennert, M. A.; KÓ§nik, A.; Dasari, P. K.; King, M. A.
2013-03-01
In SPECT imaging, motion from patient respiration and body motion can introduce image artifacts that may reduce the diagnostic quality of the images. Simulation studies using numerical phantoms with precisely known motion can help to develop and evaluate motion correction algorithms. Previous methods for evaluating motion correction algorithms used either manual or semi-automated segmentation of MRI studies to produce patient models in the form of XCAT Phantoms, from which one calculates the transformation and deformation between MRI study and patient model. Both manual and semi-automated methods of XCAT Phantom generation require expertise in human anatomy, with the semiautomated method requiring up to 30 minutes and the manual method requiring up to eight hours. Although faster than manual segmentation, the semi-automated method still requires a significant amount of time, is not replicable, and is subject to errors due to the difficulty of aligning and deforming anatomical shapes in 3D. We propose a new method for matching patient models to MRI that extends the previous semi-automated method by eliminating the manual non-rigid transformation. Our method requires no user supervision and therefore does not require expert knowledge of human anatomy to align the NURBs to anatomical structures in the MR image. Our contribution is employing the SIMRI MRI simulator to convert the XCAT NURBs to a voxel-based representation that is amenable to automatic non-rigid registration. Then registration is used to transform and deform the NURBs to match the anatomy in the MR image. We show that our automated method generates XCAT Phantoms more robustly and significantly faster than the previous semi-automated method.
Power generation using carbon mesh cathodes with different diffusion layers in microbial fuel cells
Luo, Yong
2011-11-01
An inexpensive carbon material, carbon mesh, was examined to replace the more expensive carbon cloth usually used to make cathodes in air-cathode microbial fuel cells (MFCs). Three different diffusion layers were tested using carbon mesh: poly(dimethylsiloxane) (PDMS), polytetrafluoroethylene (PTFE), and Goretex cloth. Carbon mesh with a mixture of PDMS and carbon black as a diffusion layer produced a maximum power density of 1355 ± 62 mW m -2 (normalized to the projected cathode area), which was similar to that obtained with a carbon cloth cathode (1390 ± 72 mW m-2). Carbon mesh with a PTFE diffusion layer produced only a slightly lower (6.6%) maximum power density (1303 ± 48 mW m-2). The Coulombic efficiencies were a function of current density, with the highest value for the carbon mesh and PDMS (79%) larger than that for carbon cloth (63%). The cost of the carbon mesh cathode with PDMS/Carbon or PTFE (excluding catalyst and binder costs) is only 2.5% of the cost of the carbon cloth cathode. These results show that low cost carbon materials such as carbon mesh can be used as the cathode in an MFC without reducing the performance compared to more expensive carbon cloth. © 2011 Elsevier B.V.
PUS Services Software Building Block Automatic Generation for Space Missions
Candia, S.; Sgaramella, F.; Mele, G.
2008-08-01
The Packet Utilization Standard (PUS) has been specified by the European Committee for Space Standardization (ECSS) and issued as ECSS-E-70-41A to define the application-level interface between Ground Segments and Space Segments. The ECSS-E- 70-41A complements the ECSS-E-50 and the Consultative Committee for Space Data Systems (CCSDS) recommendations for packet telemetry and telecommand. The ECSS-E-70-41A characterizes the identified PUS Services from a functional point of view and the ECSS-E-70-31 standard specifies the rules for their mission-specific tailoring. The current on-board software design for a space mission implies the production of several PUS terminals, each providing a specific tailoring of the PUS services. The associated on-board software building blocks are developed independently, leading to very different design choices and implementations even when the mission tailoring requires very similar services (from the Ground operative perspective). In this scenario, the automatic production of the PUS services building blocks for a mission would be a way to optimize the overall mission economy and improve the robusteness and reliability of the on-board software and of the Ground-Space interactions. This paper presents the Space Software Italia (SSI) activities for the development of an integrated environment to support: the PUS services tailoring activity for a specific mission. the mission-specific PUS services configuration. the generation the UML model of the software building block implementing the mission-specific PUS services and the related source code, support documentation (software requirements, software architecture, test plans/procedures, operational manuals), and the TM/TC database. The paper deals with: (a) the project objectives, (b) the tailoring, configuration, and generation process, (c) the description of the environments supporting the process phases, (d) the characterization of the meta-model used for the generation, (e) the
Triangle geometry processing for surface modeling and cartesian grid generation
Aftosmis, Michael J [San Mateo, CA; Melton, John E [Hollister, CA; Berger, Marsha J [New York, NY
2002-09-03
Cartesian mesh generation is accomplished for component based geometries, by intersecting components subject to mesh generation to extract wetted surfaces with a geometry engine using adaptive precision arithmetic in a system which automatically breaks ties with respect to geometric degeneracies. During volume mesh generation, intersected surface triangulations are received to enable mesh generation with cell division of an initially coarse grid. The hexagonal cells are resolved, preserving the ability to directionally divide cells which are locally well aligned.
Wojenski, Andrzej; Kasprowicz, Grzegorz; Pozniak, Krzysztof T.; Romaniuk, Ryszard
2013-10-01
The paper describes a concept of automatic firmware generation for reconfigurable measurement systems, which uses FPGA devices and measurement cards in FMC standard. Following sections are described in details: automatic HDL code generation for FPGA devices, automatic communication interfaces implementation, HDL drivers for measurement cards, automatic serial connection between multiple measurement backplane boards, automatic build of memory map (address space), automatic generated firmware management. Presented solutions are required in many advanced measurement systems, like Beam Position Monitors or GEM detectors. This work is a part of a wider project for automatic firmware generation and management of reconfigurable systems. Solutions presented in this paper are based on previous publication in SPIE.
An Efficient Mesh Generation Method for Fractured Network System Based on Dynamic Grid Deformation
Directory of Open Access Journals (Sweden)
Shuli Sun
2013-01-01
Full Text Available Meshing quality of the discrete model influences the accuracy, convergence, and efficiency of the solution for fractured network system in geological problem. However, modeling and meshing of such a fractured network system are usually tedious and difficult due to geometric complexity of the computational domain induced by existence and extension of fractures. The traditional meshing method to deal with fractures usually involves boundary recovery operation based on topological transformation, which relies on many complicated techniques and skills. This paper presents an alternative and efficient approach for meshing fractured network system. The method firstly presets points on fractures and then performs Delaunay triangulation to obtain preliminary mesh by point-by-point centroid insertion algorithm. Then the fractures are exactly recovered by local correction with revised dynamic grid deformation approach. Smoothing algorithm is finally applied to improve the quality of mesh. The proposed approach is efficient, easy to implement, and applicable to the cases of initial existing fractures and extension of fractures. The method is successfully applied to modeling of two- and three-dimensional discrete fractured network (DFN system in geological problems to demonstrate its effectiveness and high efficiency.
Efficient Simplification Methods for Generating High Quality LODs of 3D Meshes
Institute of Scientific and Technical Information of China (English)
Muhammad Hussain
2009-01-01
Two simplification algorithms are proposed for automatic decimation of polygonal models, and for generating their LODs. Each algorithm orders vertices according to their priority values and then removes them iteratively. For setting the priority value of each vertex, exploiting normal field of its one-ring neighborhood, we introduce a new measure of geometric fidelity that reflects well the local geometric features of the vertex. After a vertex is selected, using other measures of geometric distortion that are based on normal field deviation and distance measure, it is decided which of the edges incident on the vertex is to be collapsed for removing it. The collapsed edge is substituted with a new vertex whose position is found by minimizing the local quadric error measure. A comparison with the state-of-the-art algorithms reveals that the proposed algorithms are simple to implement, are computationally more efficient, generate LODs with better quality, and preserve salient features even after drastic simplification. The methods are useful for applications such as 3D computer games, virtual reality, where focus is on fast running time, reduced memory overhead, and high quality LODs.
Tracking Next Generation Automatic Identification Technology into 2035
2010-12-01
architectures (LF, HF, UHF, very high frequency [VH], etc.) and net- work architectures (Wi-Fi, Zigbee , ultra-wide band, mesh, ad hoc, cloud computing...Technology Concept of Operations, 4-4. 109. Silberglitt and Wong, Global Technology Revolution China, 77. 110. ZigBee Alliance, “Awarepoint with ZigBee ...2001. http://www .transcore.com/pdf/AIM%20shrouds_of_time.pdf. Legg, Gary. “ ZigBee : Wireless Technology for Low-Power Sensor Networks.” CommsDesign
S, Kyriacou; E, Kontoleontos; S, Weissenberger; L, Mangani; E, Casartelli; I, Skouteropoulou; M, Gattringer; A, Gehrer; M, Buchmayr
2014-03-01
An efficient hydraulic optimization procedure, suitable for industrial use, requires an advanced optimization tool (EASY software), a fast solver (block coupled CFD) and a flexible geometry generation tool. EASY optimization software is a PCA-driven metamodel-assisted Evolutionary Algorithm (MAEA (PCA)) that can be used in both single- (SOO) and multiobjective optimization (MOO) problems. In MAEAs, low cost surrogate evaluation models are used to screen out non-promising individuals during the evolution and exclude them from the expensive, problem specific evaluation, here the solution of Navier-Stokes equations. For additional reduction of the optimization CPU cost, the PCA technique is used to identify dependences among the design variables and to exploit them in order to efficiently drive the application of the evolution operators. To further enhance the hydraulic optimization procedure, a very robust and fast Navier-Stokes solver has been developed. This incompressible CFD solver employs a pressure-based block-coupled approach, solving the governing equations simultaneously. This method, apart from being robust and fast, also provides a big gain in terms of computational cost. In order to optimize the geometry of hydraulic machines, an automatic geometry and mesh generation tool is necessary. The geometry generation tool used in this work is entirely based on b-spline curves and surfaces. In what follows, the components of the tool chain are outlined in some detail and the optimization results of hydraulic machine components are shown in order to demonstrate the performance of the presented optimization procedure.
National Aeronautics and Space Administration — The following background technology is described in Part 5: Run-time Verification (RV), White Box Automatic Test Generation (WBATG). Part 5 also describes how WBATG...
Computer program for automatic generation of BWR control rod patterns
Energy Technology Data Exchange (ETDEWEB)
Taner, M.S.; Levine, S.H.; Hsia, M.Y. (Pennsylvania State Univ., University Park (United States))
1990-01-01
A computer program named OCTOPUS has been developed to automatically determine a control rod pattern that approximates some desired target power distribution as closely as possible without violating any thermal safety or reactor criticality constraints. The program OCTOPUS performs a semi-optimization task based on the method of approximation programming (MAP) to develop control rod patterns. The SIMULATE-E code is used to determine the nucleonic characteristics of the reactor core state.
Technical Note: Automatic river network generation for a physically-based river catchment model
2010-01-01
SHETRAN is a physically-based distributed modelling system that gives detailed simulations in time and space of water flow and sediment and solute transport in river catchments. Standard algorithms for the automatic generation of river channel networks from digital elevation data are impossible to apply in SHETRAN and other similar models because the river channels are assumed to run along the edges of grid cells. In this work a new algorithm for the automatic generation of a river cha...
Technical Note: Automatic river network generation for a physically-based river catchment model
2010-01-01
SHETRAN is a physically-based distributed modelling system that gives detailed simulations in time and space of water flow and sediment and solute transport in river catchments. Standard algorithms for the automatic generation of river channel networks from digital elevation data are impossible to apply in SHETRAN and other similar models because the river channels are assumed to run along the edges of grid cells. In this work a new algorithm for the automatic generation of a river channel ne...
Wujian Yang; Yining Cheng; Jie He; Wenqiong Hu; Xiaojia Lin
2016-01-01
As there are many researches about traditional Tang poetry, among which automatically generated Tang poetry has arouse great concern in recent years. This study presents a community-based competition and adaptive genetic algorithm for automatically generating Tang poetry. The improved algorithm with community-based competition that has been added aims to maintain the diversity of genes during evolution; meanwhile, the adaptation means that the probabilities of crossover and mutation are varie...
Institute of Scientific and Technical Information of China (English)
梁松新; 张景中
1999-01-01
By establishing a complete discrimination system for polynomials, the problem of complete root classification for polynomials with complex coefficients is utterly solved, furthermore, the algorithm obtained is made into a general program in Maple, which enables the complete discrimination system and complete root classification of a polynomial to be automatically generated by computer, without any human intervention. Besides, by using the automatic generation of root classification, a method to determine the positive definiteness of a polynomial in one or two indeterminates is automatically presented.
Isotropic 2D quadrangle meshing with size and orientation control
Pellenard, Bertrand
2011-12-01
We propose an approach for automatically generating isotropic 2D quadrangle meshes from arbitrary domains with a fine control over sizing and orientation of the elements. At the heart of our algorithm is an optimization procedure that, from a coarse initial tiling of the 2D domain, enforces each of the desirable mesh quality criteria (size, shape, orientation, degree, regularity) one at a time, in an order designed not to undo previous enhancements. Our experiments demonstrate how well our resulting quadrangle meshes conform to a wide range of input sizing and orientation fields.
Automatic Generation Control Strategy Based on Balance of Daily Electric Energy
Institute of Scientific and Technical Information of China (English)
无
2005-01-01
An automatic generation control strategy based on balance of daily total electric energy is put forward. It makes the balance between actual total generated energy controlled by automatic generation system and planned total energy on base of area control error, and makes the actual 24-hour active power load curve to approach the planned load curve. The generated energy is corrected by velocity weighting factor so that it conducts dynamic regulation and reaches the speed of response. Homologous strategy is used according to the real-time data in the operation of automatic generation control. Results of simulation are perfect and power energy compensation control with ideal effect can be achieved in the particular duration.
Improving Statistical Language Model Performance with Automatically Generated Word Hierarchies
McMahon, J; Mahon, John Mc
1995-01-01
An automatic word classification system has been designed which processes word unigram and bigram frequency statistics extracted from a corpus of natural language utterances. The system implements a binary top-down form of word clustering which employs an average class mutual information metric. Resulting classifications are hierarchical, allowing variable class granularity. Words are represented as structural tags --- unique $n$-bit numbers the most significant bit-patterns of which incorporate class information. Access to a structural tag immediately provides access to all classification levels for the corresponding word. The classification system has successfully revealed some of the structure of English, from the phonemic to the semantic level. The system has been compared --- directly and indirectly --- with other recent word classification systems. Class based interpolated language models have been constructed to exploit the extra information supplied by the classifications and some experiments have sho...
AROMA: Automatic Generation of Radio Maps for Localization Systems
Eleryan, Ahmed; Youssef, Moustafa
2010-01-01
WLAN localization has become an active research field recently. Due to the wide WLAN deployment, WLAN localization provides ubiquitous coverage and adds to the value of the wireless network by providing the location of its users without using any additional hardware. However, WLAN localization systems usually require constructing a radio map, which is a major barrier of WLAN localization systems' deployment. The radio map stores information about the signal strength from different signal strength streams at selected locations in the site of interest. Typical construction of a radio map involves measurements and calibrations making it a tedious and time-consuming operation. In this paper, we present the AROMA system that automatically constructs accurate active and passive radio maps for both device-based and device-free WLAN localization systems. AROMA has three main goals: high accuracy, low computational requirements, and minimum user overhead. To achieve high accuracy, AROMA uses 3D ray tracing enhanced wi...
Kinetic Solvers with Adaptive Mesh in Phase Space
Arslanbekov, Robert R; Frolova, Anna A
2013-01-01
An Adaptive Mesh in Phase Space (AMPS) methodology has been developed for solving multi-dimensional kinetic equations by the discrete velocity method. A Cartesian mesh for both configuration (r) and velocity (v) spaces is produced using a tree of trees data structure. The mesh in r-space is automatically generated around embedded boundaries and dynamically adapted to local solution properties. The mesh in v-space is created on-the-fly for each cell in r-space. Mappings between neighboring v-space trees implemented for the advection operator in configuration space. We have developed new algorithms for solving the full Boltzmann and linear Boltzmann equations with AMPS. Several recent innovations were used to calculate the full Boltzmann collision integral with dynamically adaptive mesh in velocity space: importance sampling, multi-point projection method, and the variance reduction method. We have developed an efficient algorithm for calculating the linear Boltzmann collision integral for elastic and inelastic...
Generation of the 30 M-Mesh Global Digital Surface Model by Alos Prism
Tadono, T.; Nagai, H.; Ishida, H.; Oda, F.; Naito, S.; Minakawa, K.; Iwamoto, H.
2016-06-01
Topographical information is fundamental to many geo-spatial related information and applications on Earth. Remote sensing satellites have the advantage in such fields because they are capable of global observation and repeatedly. Several satellite-based digital elevation datasets were provided to examine global terrains with medium resolutions e.g. the Shuttle Radar Topography Mission (SRTM), the global digital elevation model by the Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER GDEM). A new global digital surface model (DSM) dataset using the archived data of the Panchromatic Remote-sensing Instrument for Stereo Mapping (PRISM) onboard the Advanced Land Observing Satellite (ALOS, nicknamed "Daichi") has been completed on March 2016 by Japan Aerospace Exploration Agency (JAXA) collaborating with NTT DATA Corp. and Remote Sensing Technology Center, Japan. This project is called "ALOS World 3D" (AW3D), and its dataset consists of the global DSM dataset with 0.15 arcsec. pixel spacing (approx. 5 m mesh) and ortho-rectified PRISM image with 2.5 m resolution. JAXA is also processing the global DSM with 1 arcsec. spacing (approx. 30 m mesh) based on the AW3D DSM dataset, and partially releasing it free of charge, which calls "ALOS World 3D 30 m mesh" (AW3D30). The global AW3D30 dataset will be released on May 2016. This paper describes the processing status, a preliminary validation result of the AW3D30 DSM dataset, and its public release status. As a summary of the preliminary validation of AW3D30 DSM, 4.40 m (RMSE) of the height accuracy of the dataset was confirmed using 5,121 independent check points distributed in the world.
An approach of optimal sensitivity applied in the tertiary loop of the automatic generation control
Energy Technology Data Exchange (ETDEWEB)
Belati, Edmarcio A. [CIMATEC - SENAI, Salvador, BA (Brazil); Alves, Dilson A. [Electrical Engineering Department, FEIS, UNESP - Sao Paulo State University (Brazil); da Costa, Geraldo R.M. [Electrical Engineering Department, EESC, USP - Sao Paulo University (Brazil)
2008-09-15
This paper proposes an approach of optimal sensitivity applied in the tertiary loop of the automatic generation control. The approach is based on the theorem of non-linear perturbation. From an optimal operation point obtained by an optimal power flow a new optimal operation point is directly determined after a perturbation, i.e., without the necessity of an iterative process. This new optimal operation point satisfies the constraints of the problem for small perturbation in the loads. The participation factors and the voltage set point of the automatic voltage regulators (AVR) of the generators are determined by the technique of optimal sensitivity, considering the effects of the active power losses minimization and the network constraints. The participation factors and voltage set point of the generators are supplied directly to a computational program of dynamic simulation of the automatic generation control, named by power sensitivity mode. Test results are presented to show the good performance of this approach. (author)
Institute of Scientific and Technical Information of China (English)
李园园; 张跃明; 卜凡华; 官文
2012-01-01
In automatic tool changer the globoidal indexing cam and the roller of rotating disc may transfer big load during meshing motion,which magnitude and direction are changing constantly.By taking the rollers in meshing motion as investigated subject a mathematical model of their force analysis is estab-lished.Then the knowledge of meshing principles and differential geometry is utilized to solve each parameter in mathematical model,and programming and solving for the actual example by VC++ software as a tool is done so that the transformation law graph between cam angle rotation and normal load for roller supported is educed,and data file of load magnitude is generated.Through analyzing the transformation law graph, the main influence factor of force roller supported is found,which provides theory foundation for roller type selection in design globoidal indexing cam.%自动换刀装置中弧面分度凸轮和转动盘的滚子在啮合运动中传递较大的载荷,其大小和方向在不断发生变化,以啮合运动时转动盘的滚子为研究对象建立其受力分析的数学模型.用啮合原理及微分几何知识对数学模型中各个参数进行求解,并用VC++软件为工具对实际算例进行编程求解.得出凸轮转角与滚子所受法向载荷的变化规律曲线图,并生成载荷大小的数据文件,通过对变化规律曲线图进行分析,找出影响滚子所受法向力大小的主要因素,为设计弧面分度凸轮时转动盘滚子的选型提供理论依据.
Validating EHR documents: automatic schematron generation using archetypes.
Pfeiffer, Klaus; Duftschmid, Georg; Rinner, Christoph
2014-01-01
The goal of this study was to examine whether Schematron schemas can be generated from archetypes. The openEHR Java reference API was used to transform an archetype into an object model, which was then extended with context elements. The model was processed and the constraints were transformed into corresponding Schematron assertions. A prototype of the generator for the reference model HL7 v3 CDA R2 was developed and successfully tested. Preconditions for its reusability with other reference models were set. Our results indicate that an automated generation of Schematron schemas is possible with some limitations.
Automatic Model-Based Generation of Parameterized Test Cases Using Data Abstraction
Calamé, Jens R.; Ioustinova, Natalia; Pol, van de Jaco; Romijn, J.M.T.; Smith, G.; Pol, van de J.C.
2007-01-01
Developing test suites is a costly and error-prone process. Model-based test generation tools facilitate this process by automatically generating test cases from system models. The applicability of these tools, however, depends on the size of the target systems. Here, we propose an approach to gener
Unidirectional high fiber content composites: Automatic 3D FE model generation and damage simulation
DEFF Research Database (Denmark)
Qing, Hai; Mishnaevsky, Leon
2009-01-01
A new method and a software code for the automatic generation of 3D micromechanical FE models of unidirectional long-fiber-reinforced composite (LFRC) with high fiber volume fraction with random fiber arrangement are presented. The fiber arrangement in the cross-section is generated through random...
Impact of automatic threshold capture on pulse generator longevity
Institute of Scientific and Technical Information of China (English)
CHEN Ruo-han; CHEN Ke-ping; WANG Fang-zheng; HUA Wei; ZHANG Shu
2006-01-01
Background The automatic, threshold tracking, pacing algorithm developed by St. Jude Medical, verifies ventricular capture beat by beat by recognizing the evoked response following each pacemaker stimulus. This function was assumed to be not only energy saving but safe. This study estimated the extension in longevity obtained by AutoCapture (AC) compared with pacemakers programmed to manually optimized, nominal output.Methods Thirty-four patients who received the St. Jude Affinity series pacemaker were included in the study.The following measurements were taken: stimulation and sensing threshold, impedance of leads, evoked response and polarization signals by 3501 programmer during followup, battery current and battery impedance under different conditions. For longevity comparison, ventricular output was programmed under three different conditions: (1) AC on; (2) AC off with nominal output, and (3) AC off with pacing output set at twice the pacing threshold with a minimum of 2.0 V. Patients were divided into two groups: chronic threshold is higher or lower than 1 V. The efficacy of AC was evaluated.Results Current drain in the AC on group, AC off with optimized programming or nominal output was (14.33±2.84) mA, (16.74±2.75) mA and (18.4±2.44) mA, respectively (AC on or AC off with optimized programming vs. nominal output, P ＜ 0.01). Estimated longevity was significantly extended by AC on when compared with nominal setting [(103 ± 27) months, (80 ± 24) months, P ＜ 0.01). Furthermore, compared with the optimized programming, AC extends the longevity when the pacing threshold is higher than 1 V.Conclusion AC could significantly prolong pacemaker longevity; especially in the patient with high pacing threshold.
AN ALGORITHM FOR AUTOMATICALLY GENERATING BLACK－BOX TEST CASES
Institute of Scientific and Technical Information of China (English)
XuBaowen; NieChanghai; 等
2003-01-01
Selection of test cases plays a key role in improving testing efficiency.Black-box testing is an important way of testing,and is validity lies on the secection of test cases in some sense.A reasonable and effective method about the selection and generation of test cascs is urgently needed.This letter first introduces some usual methods on black-box test case generation,then proposes a new glgorithm based on interface parameters and discusses its properties,finally shows the effectiveness of the algorithm.
AN ALGORITHM FOR AUTOMATICALLY GENERATING BLACK-BOX TEST CASES
Institute of Scientific and Technical Information of China (English)
Xu Baowen; Nie Changhai; Shi Qunfeng; Lu Hong
2003-01-01
Selection of test cases plays a key role in improving testing efficiency. Black-box testing is an important way of testing, and its validity lies on the selection of test cases in some sense. A reasonable and effective method about the selection and generation of test cases is urgently needed. This letter first introduces some usualmethods on black-box test case generation,then proposes a new algorithm based on interface parameters and discusses its properties, finally shows the effectiveness of the algorithm.
Automatic generation of computable implementation guides from clinical information models.
Boscá, Diego; Maldonado, José Alberto; Moner, David; Robles, Montserrat
2015-06-01
Clinical information models are increasingly used to describe the contents of Electronic Health Records. Implementation guides are a common specification mechanism used to define such models. They contain, among other reference materials, all the constraints and rules that clinical information must obey. However, these implementation guides typically are oriented to human-readability, and thus cannot be processed by computers. As a consequence, they must be reinterpreted and transformed manually into an executable language such as Schematron or Object Constraint Language (OCL). This task can be difficult and error prone due to the big gap between both representations. The challenge is to develop a methodology for the specification of implementation guides in such a way that humans can read and understand easily and at the same time can be processed by computers. In this paper, we propose and describe a novel methodology that uses archetypes as basis for generation of implementation guides. We use archetypes to generate formal rules expressed in Natural Rule Language (NRL) and other reference materials usually included in implementation guides such as sample XML instances. We also generate Schematron rules from NRL rules to be used for the validation of data instances. We have implemented these methods in LinkEHR, an archetype editing platform, and exemplify our approach by generating NRL rules and implementation guides from EN ISO 13606, openEHR, and HL7 CDA archetypes.
Template Authoring Environment for the Automatic Generation of Narrative Content
Caropreso, Maria Fernanda; Inkpen, Diana; Keshtkar, Fazel; Khan, Shahzad
2012-01-01
Natural Language Generation (NLG) systems can make data accessible in an easily digestible textual form; but using such systems requires sophisticated linguistic and sometimes even programming knowledge. We have designed and implemented an environment for creating and modifying NLG templates that requires no programming knowledge, and can operate…
Designing a story database for use in automatic story generation
Oinonen, K.M.; Theune, M.; Nijholt, A.; Uijlings, J.R.R.; Harper, R.; Rauterberg, M.; Combetto, M.
2006-01-01
In this paper we propose a model for the representation of stories in a story database. The use of such a database will enable computational story generation systems to learn from previous stories and associated user feedback, in order to create believable stories with dramatic plots that invoke an
Power generation using an activated carbon and metal mesh cathode in a microbial fuel cell
Zhang, Fang
2009-11-01
An inexpensive activated carbon (AC) air cathode was developed as an alternative to a platinum-catalyzed electrode for oxygen reduction in a microbial fuel cell (MFC). AC was cold-pressed with a polytetrafluoroethylene (PTFE) binder to form the cathode around a Ni mesh current collector. This cathode construction avoided the need for carbon cloth or a metal catalyst, and produced a cathode with high activity for oxygen reduction at typical MFC current densities. Tests with the AC cathode produced a maximum power density of 1220 mW/m2 (normalized to cathode projected surface area; 36 W/m3 based on liquid volume) compared to 1060 mW/m2 obtained by Pt catalyzed carbon cloth cathode. The Coulombic efficiency ranged from 15% to 55%. These findings show that AC is a cost-effective material for achieving useful rates of oxygen reduction in air cathode MFCs. © 2009 Elsevier B.V. All rights reserved.
Shoreline and Bathymetry Approximation in Mesh Generation for Tidal Renewable Simulations
Avdis, Alexandros; Hill, Jon; Piggott, Matthew D; Gorman, Gerard J
2015-01-01
Due to the fractal nature of the domain geometry in geophysical flow simulations, a completely accurate description of the domain in terms of a computational mesh is frequently deemed infeasible. Shoreline and bathymetry simplification methods are used to remove small scale details in the geometry, particularly in areas away from the region of interest. To that end, a novel method for shoreline and bathymetry simplification is presented. Existing shoreline simplification methods typically remove points if the resultant geometry satisfies particular geometric criteria. Bathymetry is usually simplified using traditional filtering techniques, that remove unwanted Fourier modes. Principal Component Analysis (PCA) has been used in other fields to isolate small-scale structures from larger scale coherent features in a robust way, underpinned by a rigorous but simple mathematical framework. Here we present a method based on principal component analysis aimed towards simplification of shorelines and bathymetry. We pr...
Facilitate generation connections on Orkney by automatic distribution network management
Energy Technology Data Exchange (ETDEWEB)
NONE
2004-07-01
This report summarises the results of a study assessing the capability and limitations of the Orkney Network under a variety of conditions of demand, generation connections, network configuration, and reactive compensation). A conceptual active management scheme (AMS) suitable for the conditions on Orkney is developed and evaluated. Details are given of a proposed framework for the design and evaluation of future active management schemes, logic control sequences for managed generation units, and a proposed evaluation method for the active management scheme. Implications of introducing the proposed AMS are examined, and the commercial aspects of an AMS and system security are considered. The existing Orkney network is described; and an overview of the SHEPDL (Scottish Hydro Electric Power Distribution Ltd.) SCADA system is presented with a discussion of AMS identification, selection, and development.
Semantic annotation of requirements for automatic UML class diagram generation
Amdouni, Soumaya; Bouabid, Sondes
2011-01-01
The increasing complexity of software engineering requires effective methods and tools to support requirements analysts' activities. While much of a company's knowledge can be found in text repositories, current content management systems have limited capabilities for structuring and interpreting documents. In this context, we propose a tool for transforming text documents describing users' requirements to an UML model. The presented tool uses Natural Language Processing (NLP) and semantic rules to generate an UML class diagram. The main contribution of our tool is to provide assistance to designers facilitating the transition from a textual description of user requirements to their UML diagrams based on GATE (General Architecture of Text) by formulating necessary rules that generate new semantic annotations.
An automatically generated code for relativistic inhomogeneous cosmologies
Bentivegna, Eloisa
2016-01-01
The applications of numerical relativity to cosmology are on the rise, contributing insight into such cosmological problems as structure formation, primordial phase transitions, gravitational-wave generation, and inflation. In this paper, I present the infrastructure for the computation of inhomogeneous dust cosmologies which was used recently to measure the effect of nonlinear inhomogeneity on the cosmic expansion rate. I illustrate the code's architecture, provide evidence for its correctness in a number of familiar cosmological settings, and evaluate its parallel performance for grids of up to several billion points. The code, which is available as free software, is based on the Einstein Toolkit infrastructure, and in particular leverages the automated-code-generation capabilities provided by its component Kranc.
An Aid to Independent Study through Automatic Question Generation (AUTOQUEST)
1975-10-01
natural language analysis and generation tackles a difficult class of anaphoric inference problems (finding th correct referent for an English pronoun...overall principle of xsemantic preference’ used to set up the original meaning representation, of which these anaphoric inference procedures are a...templates has been considered in detail elsewhere, so this report concentrates on the second phase of analysis, which binds templates together into a
SABATPG-A Structural Analysis Based Automatic Test Generation System
Institute of Scientific and Technical Information of China (English)
李忠诚; 潘榆奇; 闵应骅
1994-01-01
A TPG system, SABATPG, is given based on a generic structural model of large circuits. Three techniques of partial implication, aftereffect of identified undetectable faults and shared sensitization with new concepts of localization and aftereffect are employed in the system to improve FAN algorithm. Experiments for the 10 ISCAS benchmark circuits show that the computing time of SABATPG for test generation is 19.42% less than that of FAN algorithm.
Technical Note: Automatic river network generation for a physically-based river catchment model
Directory of Open Access Journals (Sweden)
S. J. Birkinshaw
2010-05-01
Full Text Available SHETRAN is a physically-based distributed modelling system that gives detailed simulations in time and space of water flow and sediment and solute transport in river catchments. Standard algorithms for the automatic generation of river channel networks from digital elevation data are impossible to apply in SHETRAN and other similar models because the river channels are assumed to run along the edges of grid cells. In this work a new algorithm for the automatic generation of a river channel network in SHETRAN is described and its use in an example catchment demonstrated.
Semi-automatic simulation model generation of virtual dynamic networks for production flow planning
Krenczyk, D.; Skolud, B.; Olender, M.
2016-08-01
Computer modelling, simulation and visualization of production flow allowing to increase the efficiency of production planning process in dynamic manufacturing networks. The use of the semi-automatic model generation concept based on parametric approach supporting processes of production planning is presented. The presented approach allows the use of simulation and visualization for verification of production plans and alternative topologies of manufacturing network configurations as well as with automatic generation of a series of production flow scenarios. Computational examples with the application of Enterprise Dynamics simulation software comprising the steps of production planning and control for manufacturing network have been also presented.
Technical Note: Automatic river network generation for a physically-based river catchment model
Directory of Open Access Journals (Sweden)
S. J. Birkinshaw
2010-09-01
Full Text Available SHETRAN is a physically-based distributed modelling system that gives detailed simulations in time and space of water flow and sediment and solute transport in river catchments. Standard algorithms for the automatic generation of river channel networks from digital elevation data are impossible to apply in SHETRAN and other similar models because the river channels are assumed to run along the edges of grid cells. In this work a new algorithm for the automatic generation of a river channel network in SHETRAN is described and its use in an example catchment demonstrated.
Technical Note: Automatic river network generation for a physically-based river catchment model
Birkinshaw, S. J.
2010-09-01
SHETRAN is a physically-based distributed modelling system that gives detailed simulations in time and space of water flow and sediment and solute transport in river catchments. Standard algorithms for the automatic generation of river channel networks from digital elevation data are impossible to apply in SHETRAN and other similar models because the river channels are assumed to run along the edges of grid cells. In this work a new algorithm for the automatic generation of a river channel network in SHETRAN is described and its use in an example catchment demonstrated.
On the Support of Multimedia Applications over Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Chemseddine BEMMOUSSAT
2013-05-01
Full Text Available For next generation wireless networks, supporting quality of service (QoS in multimedia application likevideo, streaming and voice over IP is a necessary and critical requirement. Wireless Mesh Networking isenvisioned as a solution for next networks generation and a promising technology for supportingmultimedia application.With decreasing the numbers of mesh clients, QoS will increase automatically. Several research arefocused to improve QoS in Wireless Mesh networks (WMNs, they try to improve a basics algorithm, likerouting protocols or one of example of canal access, but in moments it no sufficient to ensure a robustsolution to transport multimedia application over WMNs.In this paper we propose an efficient routing algorithm for multimedia transmission in the mesh networkand an approach of QoS in the MAC layer for facilitated transport video over the network studied.
Automatic generation of fuzzy rules for the sensor-based navigation of a mobile robot
Energy Technology Data Exchange (ETDEWEB)
Pin, F.G.; Watanabe, Y.
1994-10-01
A system for automatic generation of fuzzy rules is proposed which is based on a new approach, called {open_quotes}Fuzzy Behaviorist,{close_quotes} and on its associated formalism for rule base development in behavior-based robot control systems. The automated generator of fuzzy rules automatically constructs the set of rules and the associated membership functions that implement reasoning schemes that have been expressed in qualitative terms. The system also checks for completeness of the rule base and independence and/or redundancy of the rules to ensure that the requirements of the formalism are satisfied. Examples of the automatic generation of fuzzy rules for cases involving suppression and/or inhibition of fuzzy behaviors are given and discussed. Experimental results obtained with the automated fuzzy rule generator applied to the domain of sensor-based navigation in a priori unknown environments using one of our autonomous test-bed robots are then presented and discussed to illustrate the feasibility of large-scale automatic fuzzy rule generation using our proposed {open_quotes}Fuzzy Behaviorist{close_quotes} approach.
Automatic Tool Path Generation for Robot Integrated Surface Sculpturing System
Zhu, Jiang; Suzuki, Ryo; Tanaka, Tomohisa; Saito, Yoshio
In this paper, a surface sculpturing system based on 8-axis robot is proposed, the CAD/CAM software and tool path generation algorithm for this sculpturing system are presented. The 8-axis robot is composed of a 6-axis manipulator and a 2-axis worktable, it carves block of polystyrene foams by heated cutting tools. Multi-DOF (Degree of Freedom) robot benefits from the faster fashion than traditional RP (Rapid Prototyping) methods and more flexibility than CNC machining. With its flexibility driven from an 8-axis configuration, as well as efficient custom-developed software for rough cutting and finish cutting, this surface sculpturing system can carve sculptured surface accurately and efficiently.
Automatic Generation of Network Protocol Gateways
DEFF Research Database (Denmark)
Bromberg, Yérom-David; Réveillère, Laurent; Lawall, Julia
2009-01-01
for describing protocol behaviors, message structures, and the gateway logic. Z2z includes a compiler that checks essential correctness properties and produces efficient code. We have used z2z to develop a number of gateways, including SIP to RTSP, SLP to UPnP, and SMTP to SMTP via HTTP, involving a range......The emergence of networked devices in the home has made it possible to develop applications that control a variety of household functions. However, current devices communicate via a multitude of incompatible protocols, and thus gateways are needed to translate between them. Gateway construction......, however, requires an intimate knowledge of the relevant protocols and a substantial understanding of low-level network programming, which can be a challenge for many application programmers. This paper presents a generative approach to gateway construction, z2z, based on a domain-specific language...
Contribution of supraspinal systems to generation of automatic postural responses
Directory of Open Access Journals (Sweden)
Tatiana G Deliagina
2014-10-01
Full Text Available Different species maintain a particular body orientation in space due to activity of the closed-loop postural control system. In this review we discuss the role of neurons of descending pathways in operation of this system as revealed in animal models of differing complexity: lower vertebrate (lamprey and higher vertebrates (rabbit and cat.In the lamprey and quadruped mammals, the role of spinal and supraspinal mechanisms in the control of posture is different. In the lamprey, the system contains one closed-loop mechanism consisting of supraspino-spinal networks. Reticulospinal (RS neurons play a key role in generation of postural corrections. Due to vestibular input, any deviation from the stabilized body orientation leads to activation of a specific population of RS neurons. Each of the neurons activates a specific motor synergy. Collectively, these neurons evoke the motor output necessary for the postural correction. In contrast to lampreys, postural corrections in quadrupeds are primarily based not on the vestibular input but on the somatosensory input from limb mechanoreceptors. The system contains two closed-loop mechanisms – spinal and spino-supraspinal networks, which supplement each other. Spinal networks receive somatosensory input from the limb signaling postural perturbations, and generate spinal postural limb reflexes. These reflexes are relatively weak, but in intact animals they are enhanced due to both tonic supraspinal drive and phasic supraspinal commands. Recent studies of these supraspinal influences are considered in this review. A hypothesis suggesting common principles of operation of the postural systems stabilizing body orientation in a particular plane in the lamprey and quadrupeds, that is interaction of antagonistic postural reflexes, is discussed.
Automatic, context-specific generation of Gene Ontology slims
Directory of Open Access Journals (Sweden)
Sehgal Muhammad
2010-10-01
Full Text Available Abstract Background The use of ontologies to control vocabulary and structure annotation has added value to genome-scale data, and contributed to the capture and re-use of knowledge across research domains. Gene Ontology (GO is widely used to capture detailed expert knowledge in genomic-scale datasets and as a consequence has grown to contain many terms, making it unwieldy for many applications. To increase its ease of manipulation and efficiency of use, subsets called GO slims are often created by collapsing terms upward into more general, high-level terms relevant to a particular context. Creation of a GO slim currently requires manipulation and editing of GO by an expert (or community familiar with both the ontology and the biological context. Decisions about which terms to include are necessarily subjective, and the creation process itself and subsequent curation are time-consuming and largely manual. Results Here we present an objective framework for generating customised ontology slims for specific annotated datasets, exploiting information latent in the structure of the ontology graph and in the annotation data. This framework combines ontology engineering approaches, and a data-driven algorithm that draws on graph and information theory. We illustrate this method by application to GO, generating GO slims at different information thresholds, characterising their depth of semantics and demonstrating the resulting gains in statistical power. Conclusions Our GO slim creation pipeline is available for use in conjunction with any GO-annotated dataset, and creates dataset-specific, objectively defined slims. This method is fast and scalable for application to other biomedical ontologies.
Automatic Generation of Setup for CNC Spring Coiler Based on Case-based Reasoning
Institute of Scientific and Technical Information of China (English)
KU Xiangchen; WANG Runxiao; LI Jishun; WANG Dongbo
2006-01-01
When producing special-shape spring in CNC spring coiler, the setup of the coiler is often a manual work using a trial-and-error method. As a result, the setup of coiler consumes so much time and becomes the bottleneck of the spring production process. In order to cope with this situation, this paper proposes an automatic generation system of setup for CNC spring coiler using case-based reasoning (CBR). The core of the study contains: (1) integrated reasoning model of CBR system;(2) spatial shape describe of special-shape spring based on feature;(3) coiling case representation using shape feature matrix; and (4) case similarity measure algorithm. The automatic generation system has implemented with C++ Builder 6.0 and is helpful in improving the automaticity and efficiency of spring coiler.
Automatic Generation of Printed Catalogs: An Initial Attempt
Directory of Open Access Journals (Sweden)
Jared Camins-Esakov
2010-06-01
Full Text Available Printed catalogs are useful in a variety of contexts. In special collections, they are often used as reference tools and to commemorate exhibits. They are useful in settings, such as in developing countries, where reliable access to the Internet—or even electricity—is not available. In addition, many private collectors like to have printed catalogs of their collections. All the information needed for creating printed catalogs is readily available in the MARC bibliographic records used by most libraries, but there are no turnkey solutions available for the conversion from MARC to printed catalog. This article describes the development of a system, available on github, that uses XSLT, Perl, and LaTeX to produce press-ready PDFs from MARCXML files. The article particularly focuses on the two XSLT stylesheets which comprise the core of the system, and do the "heavy lifting" of sorting and indexing the entries in the catalog. The author also highlights points where the data stored in MARC bibliographic records requires particular "massaging," and suggests improvements for future attempts at automated printed catalog generation.
Automatic Generation of Proof Tactics for Finite-Valued Logics
Directory of Open Access Journals (Sweden)
João Marcos
2010-03-01
Full Text Available A number of flexible tactic-based logical frameworks are nowadays available that can implement a wide range of mathematical theories using a common higher-order metalanguage. Used as proof assistants, one of the advantages of such powerful systems resides in their responsiveness to extensibility of their reasoning capabilities, being designed over rule-based programming languages that allow the user to build her own `programs to construct proofs' - the so-called proof tactics. The present contribution discusses the implementation of an algorithm that generates sound and complete tableau systems for a very inclusive class of sufficiently expressive finite-valued propositional logics, and then illustrates some of the challenges and difficulties related to the algorithmic formation of automated theorem proving tactics for such logics. The procedure on whose implementation we will report is based on a generalized notion of analyticity of proof systems that is intended to guarantee termination of the corresponding automated tactics on what concerns theoremhood in our targeted logics.
Bayerlein, Leopold
2014-01-01
This study assesses whether or not undergraduate and postgraduate accounting students at an Australian university differentiate between timely feedback and extremely timely feedback, and whether or not the replacement of manually written formal assessment feedback with automatically generated feedback influences students' perception of…
Using Automatic Code Generation in the Attitude Control Flight Software Engineering Process
McComas, David; O'Donnell, James R., Jr.; Andrews, Stephen F.
1999-01-01
This paper presents an overview of the attitude control subsystem flight software development process, identifies how the process has changed due to automatic code generation, analyzes each software development phase in detail, and concludes with a summary of our lessons learned.
Bayerlein, Leopold
2014-01-01
This study assesses whether or not undergraduate and postgraduate accounting students at an Australian university differentiate between timely feedback and extremely timely feedback, and whether or not the replacement of manually written formal assessment feedback with automatically generated feedback influences students' perception of feedback…
Accuracy assessment of building point clouds automatically generated from iphone images
Sirmacek, B.; Lindenbergh, R.
2014-06-01
Low-cost sensor generated 3D models can be useful for quick 3D urban model updating, yet the quality of the models is questionable. In this article, we evaluate the reliability of an automatic point cloud generation method using multi-view iPhone images or an iPhone video file as an input. We register such automatically generated point cloud on a TLS point cloud of the same object to discuss accuracy, advantages and limitations of the iPhone generated point clouds. For the chosen example showcase, we have classified 1.23% of the iPhone point cloud points as outliers, and calculated the mean of the point to point distances to the TLS point cloud as 0.11 m. Since a TLS point cloud might also include measurement errors and noise, we computed local noise values for the point clouds from both sources. Mean (μ) and standard deviation (σ) of roughness histograms are calculated as (μ1 = 0.44 m., σ1 = 0.071 m.) and (μ2 = 0.025 m., σ2 = 0.037 m.) for the iPhone and TLS point clouds respectively. Our experimental results indicate possible usage of the proposed automatic 3D model generation framework for 3D urban map updating, fusion and detail enhancing, quick and real-time change detection purposes. However, further insights should be obtained first on the circumstances that are needed to guarantee a successful point cloud generation from smartphone images.
Litvin, Faydor L.; Nava, Alessandro; Fan, Qi; Fuentes, Alfonso
2002-01-01
New geometry of face worm gear drives with conical and cylindrical worms is proposed. The generation of the face worm-gear is based on application of a tilted head-cutter (grinding tool) instead of application of a hob applied at present. The generation of a conjugated worm is based on application of a tilted head-cutter (grinding tool) as well. The bearing contact of the gear drive is localized and is oriented longitudinally. A predesigned parabolic function of transmission errors for reduction of noise and vibration is provided. The stress analysis of the gear drive is performed using a three-dimensional finite element analysis. The contacting model is automatically generated. The developed theory is illustrated with numerical examples.
Development of a system of automatic gap-adjusted electrodes for shock wave generators
Manousakas, Ioannis; Liang, Shen-Min; Wan, Long-Ray; Wang, Chia-Hui
2004-11-01
In this study, a system of automatic gap-adjusted electrodes is developed for electrohydraulic shock wave generators that can be used both for extracorporeal shock wave lithotripsy (treatment of renal calculi) and for the extracorporeal shock wave therapy for musculo-skeletal disorders. This system is composed of three main components: (1) two electrodes and their bases; (2) servo motors and control software; (3) a high sensitivity CCD camera and image processing program. To verify system performance, in vitro fragmentation tests have been conducted using kidney stone phantoms. Results indicate that the efficiency of stone fragmentation using automatic gap adjustment can be increased up to 55.2%, which is twice more than without automatic gap adjustment (26.7%). This system can be applied to any commercial electrohydraulic extracorporeal shock wave lithotriptor or orthotriptor without difficulty.
Directory of Open Access Journals (Sweden)
Wujian Yang
2016-01-01
Full Text Available As there are many researches about traditional Tang poetry, among which automatically generated Tang poetry has arouse great concern in recent years. This study presents a community-based competition and adaptive genetic algorithm for automatically generating Tang poetry. The improved algorithm with community-based competition that has been added aims to maintain the diversity of genes during evolution; meanwhile, the adaptation means that the probabilities of crossover and mutation are varied from the fitness values of the Tang poetry to prevent premature convergence and generate better poems more quickly. According to the analysis of experimental results, it has been found that the improved algorithm is superior to the conventional method.
Planet-disc interaction on a freely moving mesh
Munoz, Diego J; Springel, Volker; Hernquist, Lars
2014-01-01
General-purpose, moving-mesh schemes for hydrodynamics have opened the possibility of combining the accuracy of grid-based numerical methods with the flexibility and automatic resolution adaptivity of particle-based methods. Due to their supersonic nature, Keplerian accretion discs are in principle a very attractive system for applying such freely moving mesh techniques. However, the high degree of symmetry of simple accretion disc models can be difficult to capture accurately by these methods, due to the generation of geometric grid noise and associated numerical diffusion, which is absent in polar grids. To explore these and other issues, in this work we study the idealized problem of two-dimensional planet-disc interaction with the moving-mesh code AREPO. We explore the hydrodynamic evolution of discs with planets through a series of numerical experiments that vary the planet mass, the disc viscosity and the mesh resolution, and compare the resulting surface density, vortensity field and tidal torque with ...
Hwang, Taejin; Kim, Yong Nam; Kim, Soo Kon; Kang, Sei-Kwon; Cheong, Kwang-Ho; Park, Soah; Yoon, Jai-Woong; Han, Taejin; Kim, Haeyoung; Lee, Meyeon; Kim, Kyoung-Joo; Bae, Hoonsik; Suh, Tae-Suk
2015-06-01
The dose constraint during prostate intensity-modulated radiation therapy (IMRT) optimization should be patient-specific for better rectum sparing. The aims of this study are to suggest a novel method for automatically generating a patient-specific dose constraint by using an experience-based dose volume histogram (DVH) of the rectum and to evaluate the potential of such a dose constraint qualitatively. The normal tissue complication probabilities (NTCPs) of the rectum with respect to V %ratio in our study were divided into three groups, where V %ratio was defined as the percent ratio of the rectal volume overlapping the planning target volume (PTV) to the rectal volume: (1) the rectal NTCPs in the previous study (clinical data), (2) those statistically generated by using the standard normal distribution (calculated data), and (3) those generated by combining the calculated data and the clinical data (mixed data). In the calculated data, a random number whose mean value was on the fitted curve described in the clinical data and whose standard deviation was 1% was generated by using the `randn' function in the MATLAB program and was used. For each group, we validated whether the probability density function (PDF) of the rectal NTCP could be automatically generated with the density estimation method by using a Gaussian kernel. The results revealed that the rectal NTCP probability increased in proportion to V %ratio , that the predictive rectal NTCP was patient-specific, and that the starting point of IMRT optimization for the given patient might be different. The PDF of the rectal NTCP was obtained automatically for each group except that the smoothness of the probability distribution increased with increasing number of data and with increasing window width. We showed that during the prostate IMRT optimization, the patient-specific dose constraints could be automatically generated and that our method could reduce the IMRT optimization time as well as maintain the
Generating Quality Guaranteed Quadrilateral Mesh on ann-sided Region%平面n边域上高品质四边网格生成方法
Institute of Scientific and Technical Information of China (English)
简群; 蔺宏伟; 曹琦; 卢兴江
2016-01-01
In finite element analysis, the generation of quadrilateral (quad) meshes is harder than that of triangular meshes, especially on planar regions with complicated shape and topology structure. In this paper, we developed an iterative method to produce quad meshes onn-sided connected planar regions with complicated geometric shape and high genus, and the generated quad mesh is guaranteed to be non-self-overlapping. Starting with an ini-tial quad mesh, which is constructed by adaptive pixelization, the boundary of the quad mesh is iteratively fitted to the boundary of the given planar region. After each iteration of the boundary, the positions of inner vertices are changed by the layered Laplace operation. Finally, the quad mesh is generated by further optimizations. In the it-erations, the movements of the mesh vertices are restricted so that the produced quad mesh is guaranteed to be strictly non-self-overlapping. Lots of examples presented in this paper show the efficiency and effectiveness of the developed method.%在有限元分析中，四边网格比三角网格更难以生成，特别是在具有复杂形状和拓扑结构的平面域上。为此，基于几何迭代算法，提出一种在形状复杂和高亏格的 n 边平面域上生成高质量四边网格的方法，并保证生成的四边网格不自交。该方法以自适应像素化离散技术生成的四边网格作为初始网格，网格边界迭代拟合至给定的平面区域边界，其中每次边界迭代后，通过分层的 Laplace 算子改变内部顶点的位置；在迭代过程中，网格顶点的移动都受到限制，保证生成的网格严格不自交。最后通过实验验证了文中算法的效率和有效性。
Automatic WSDL-guided Test Case Generation for PropEr Testing of Web Services
Directory of Open Access Journals (Sweden)
Konstantinos Sagonas
2012-10-01
Full Text Available With web services already being key ingredients of modern web systems, automatic and easy-to-use but at the same time powerful and expressive testing frameworks for web services are increasingly important. Our work aims at fully automatic testing of web services: ideally the user only specifies properties that the web service is expected to satisfy, in the form of input-output relations, and the system handles all the rest. In this paper we present in detail the component which lies at the heart of this system: how the WSDL specification of a web service is used to automatically create test case generators that can be fed to PropEr, a property-based testing tool, to create structurally valid random test cases for its operations and check its responses. Although the process is fully automatic, our tool optionally allows the user to easily modify its output to either add semantic information to the generators or write properties that test for more involved functionality of the web services.
Energy Technology Data Exchange (ETDEWEB)
Kolobov, Vladimir [CFD Research Corporation, Huntsville, AL 35805, USA and The University of Alabama in Huntsville, Huntsville, AL 35805 (United States); Arslanbekov, Robert [CFD Research Corporation, Huntsville, AL 35805 (United States); Frolova, Anna [Computing Center of the Russian Academy of Sciences, Moscow, 119333 (Russian Federation)
2014-12-09
The paper describes an Adaptive Mesh in Phase Space (AMPS) technique for solving kinetic equations with deterministic mesh-based methods. The AMPS technique allows automatic generation of adaptive Cartesian mesh in both physical and velocity spaces using a Tree-of-Trees data structure. We illustrate advantages of AMPS for simulations of rarefied gas dynamics and electron kinetics on low temperature plasmas. In particular, we consider formation of the velocity distribution functions in hypersonic flows, particle kinetics near oscillating boundaries, and electron kinetics in a radio-frequency sheath. AMPS provide substantial savings in computational cost and increased efficiency of the mesh-based kinetic solvers.
Bols, Joris; Taelman, L; De Santis, G; Degroote, J; Verhegghe, B; Segers, P; Vierendeels, J
2016-01-01
The trend towards realistic numerical models of (pathologic) patient-specific vascular structures brings along larger computational domains and more complex geometries, increasing both the computation time and the operator time. Hexahedral grids effectively lower the computational run time and the required computational infrastructure, but at high cost in terms of operator time and minimal cell quality, especially when the computational analyses are targeting complex geometries such as aneurysm necks, severe stenoses and bifurcations. Moreover, such grids generally do not allow local refinements. As an attempt to overcome these limitations, a novel approach to hexahedral meshing is proposed in this paper, which combines the automated generation of multi-block structures with a grid-based method. The robustness of the novel approach is tested on common complex geometries, such as tree-like structures (including trifurcations), stenoses, and aneurysms. Additionally, the performance of the generated grid is assessed using two numerical examples. In the first example, a grid sensitivity analysis is performed for blood flow simulated in an abdominal mouse aorta and compared to tetrahedral grids with a prismatic boundary layer. In the second example, the fluid-structure interaction in a model of an aorta with aortic coarctation is simulated and the effect of local grid refinement is analyzed.
Towards automatically generating graphical user interfaces from openEHR archetypes.
Schuler, Thilo; Garde, Sebastian; Heard, Sam; Beale, Thomas
2006-01-01
One of the main challenges in the field of Electronic Health Records (EHRs) is semantic interoperability. To utilise the full potential of interoperable EHR systems they have to be accepted by their users, the health care providers. Good Graphical User Interfaces (GUIs) that support customisation and data validation play a decisive role for user acceptance and data quality. This study investigates the use of openEHR archetypes to automatically generate coherent, customizable, data-validating GUIs. Using the Mozilla XML User Interface Language (XUL) a series of prototypes has been developed. The results show that the automatic generation of GUIs from openEHR archetypes is feasible in principle. Although XUL revealed some problems, the advantages of XML-based GUI languages are evident.
Final Report for LDRD Project on Rapid Problem Setup for Mesh-Based Simulation (Rapsodi)
Energy Technology Data Exchange (ETDEWEB)
Brown, D L; Henshaw, W; Petersson, N A; Fast, P; Chand, K
2003-02-07
Under LLNL Exploratory Research LDRD funding, the Rapsodi project developed rapid setup technology for computational physics and engineering problems that require computational representations of complex geometry. Many simulation projects at LLNL involve the solution of partial differential equations in complex 3-D geometries. A significant bottleneck in carrying out these simulations arises in converting some specification of a geometry, such as a computer-aided design (CAD) drawing to a computationally appropriate 3-D mesh that can be used for simulation and analysis. Even using state-of-the-art mesh generation software, this problem setup step typically has required weeks or months, which is often much longer than required to carry out the computational simulation itself. The Rapsodi project built computational tools and designed algorithms that help to significantly reduce this setup time to less than a day for many realistic problems. The project targeted rapid setup technology for computational physics and engineering problems that use mixed-element unstructured meshes, overset meshes or Cartesian-embedded boundary (EB) meshes to represent complex geometry. It also built tools that aid in constructing computational representations of geometry for problems that do not require a mesh. While completely automatic mesh generation is extremely difficult, the amount of manual labor required can be significantly reduced. By developing novel, automated, component-based mesh construction procedures and automated CAD geometry repair and cleanup tools, Rapsodi has significantly reduced the amount of hand crafting required to generate geometry and meshes for scientific simulation codes.
Mesh Generation from Dense 3D Scattered Data Using Neural Network
Institute of Scientific and Technical Information of China (English)
ZHANGWei; JIANGXian-feng; CHENLi-neng; MAYa-liang
2004-01-01
An improved self-organizing feature map (SOFM) neural network is presented to generate rectangular and hexagonal lattic with normal vector attached to each vertex. After the neural network was trained, the whole scattered data were divided into sub-regions where classified core were represented by the weight vectors of neurons at the output layer of neural network. The weight vectors of the neurons were used to approximate the dense 3-D scattered points, so the dense scattered points could be reduced to a reasonable scale, while the topological feature of the whole scattered points were remained.
OntoDiagram: Automatic Diagram Generation for Congenital Heart Defects in Pediatric Cardiology
Vishwanath, Kartik; Viswanath, Venkatesh; Drake, William; Lee, Yugyung
2005-01-01
In pediatric cardiology as well as many other medical specialties, the accurate portrayal of a large volume of patient information is crucial to providing good patient care. Our research aims at utilizing clinical and spatial ontologies representing the human heart, to automatically generate a Mullins-like diagram [6] based on a patient's information in the cardiology databases. Our ontology allows an intuitive way of modeling congenital defects with the structure of the hum...
基于图像频谱分析三维网格模型数字浮雕生成算法%Frequency Domain Approach to Generating Bas-relief from 3D Mesh
Institute of Scientific and Technical Information of China (English)
江嘉晋; 刘胜兰; 李博
2011-01-01
由3维模型生成2.5维数字浮雕曲面是最近国内外数字浮雕研究的热点,通过对三维网格模型频率域的能量进行压缩来得到几何高度被压缩的浮雕模型.算法通过对三维模型进行重新采样,获得视线方向上的规则化深度图,然后利用图像傅里叶变换对深度图进行频谱分析,最后将模型高度的压缩转换为频谱域能量系数的压缩来得到浮雕曲面模型.在压缩过程中,应用高通滤波器工具对低频能量进行压缩、应用对数压缩函数对高频边缘压缩,从而使得生成的浮雕达到较好的效果.实例表明在频率域对三维模型的能量进行压缩来生成浮雕是可行的,算法对细节不太丰富的模型同样具有较好的效果.%Automatic generation of 2.5D digital bas-relief from 3D model recently becomes a hot spot in relief design. This paper proposes the algorithm for semi-automatic generation of bas-relief from 3D triangle mesh,and compresses the 3D model through non-linear decreasing geometric energy in the frequency domain. In order to meet the image spectral analysis,the triangle mesh of original models is changed into range image by resampling. In the compression process, the low frequency energy is compressed through high pass filter tools and application of methods such as logarithmic compression function on edge of mesh models to achieve better results. Examples show that generating the bas-relief in frequency domain is feasible,and the model without rich details is used to produce the same better digital bas-relief.
Automatic Generation of English-Japanese Translation Pattern Utilizing Genetic Programming Technique
Matsumura, Koki; Tamekuni, Yuji; Kimura, Shuhei
There are a lot of constructional differences in an English-Japanese phrase template, and that often makes the act of translation difficult. Moreover, there exist various and tremendous phrase templates and sentence to be refered to. It is not easy to prepare the corpus that covers the all. Therefore, it is very significant to generate the translation pattern of the sentence pattern automatically from a viewpoint of the translation success rate and the capacity of the pattern dictionary. Then, for the purpose of realizing the automatic generation of the translation pattern, this paper proposed the new method for the generation of the translation pattern by using the genetic programming technique (GP). The technique tries to generate the translation pattern of various sentences which are not registered in the phrase template dictionary automatically by giving the genetic operation to the parsing tree of a basic pattern. The tree consists of the pair of the English-Japanese sentence generated as the first stage population. The analysis tree data base with 50,100,150,200 pairs was prepared as the first stage population. And this system was applied and executed for an English input of 1,555 sentences. As a result, the analysis tree increases from 200 to 517, and the accuracy rate of the translation pattern has improved from 42.57% to 70.10%. And, 86.71% of the generated translations was successfully done, whose meanings are enough acceptable and understandable. It seemed that this proposal technique became a clue to raise the translation success rate, and to find the possibility of the reduction of the analysis tree data base.
Automatic generation of stop word lists for information retrieval and analysis
Energy Technology Data Exchange (ETDEWEB)
Rose, Stuart J
2013-01-08
Methods and systems for automatically generating lists of stop words for information retrieval and analysis. Generation of the stop words can include providing a corpus of documents and a plurality of keywords. From the corpus of documents, a term list of all terms is constructed and both a keyword adjacency frequency and a keyword frequency are determined. If a ratio of the keyword adjacency frequency to the keyword frequency for a particular term on the term list is less than a predetermined value, then that term is excluded from the term list. The resulting term list is truncated based on predetermined criteria to form a stop word list.
Energy Technology Data Exchange (ETDEWEB)
Cahn, Frederick [Biomedical Strategies Inc., San Diego, CA (United States); Kyriakides, Themis R [Vascular Biology and Therapeutics, Yale University, New Haven, CT 06536-9812 (United States)], E-mail: themis.kyriakides@yale.edu
2008-09-01
Generation of a stable interface between soft tissues and biomaterials could improve the function of transcutaneous prostheses, primarily by minimizing chronic infections. We hypothesized that inclusion of non-biodegradable biomaterials in an artificial skin substrate would improve integration of the neodermis. In the present study, we compared the biocompatibility of an experimental substrate, consisting of collagen and glycosylaminoglycans, with commercially available artificial skin of similar composition. By utilizing a mouse excisional wound model, we found that the source of collagen (bovine tendon versus hide), extent of injury and wound contraction were critical determinants of inflammation and neodermis formation. Reducing the extent of injury to underlying muscle reduced inflammation and improved remodeling; the improved conditions allowed the detection of a pro-inflammatory effect of hide-derived collagen. To eliminate the complication of wound contraction, subsequent grafts were performed in guinea pigs and showed that inclusion of carbon fibers or non-degradable sutures resulted in increased foreign body response (FBR) and altered remodeling. On the other hand, inclusion of a polyester multi-stranded mesh induced a mild FBR and allowed normal neodermis formation. Taken together, our observations suggest that non-degradable biomaterials can be embedded in an artificial skin construct without compromising its ability to induce neodermis formation.
Design of an Intelligent Interlocking System Based on Automatically Generated Interlocking Table
Energy Technology Data Exchange (ETDEWEB)
Ko, Y.S. [Namseoul University, Chonan (Korea)
2002-03-01
In this paper, we propose an expert system for electronic interlocking which enhances the safety, efficiency and expanability of the existing system by designing real-time interlocking control based on the interlocking table automatically generated using artificial intelligence approach. The expert system consists of two parts; an interlocking table generation part and a real-time interlocking control part. The former generates automatically the interlocking relationship of all possible routes by searching dynamically the station topology which is obtained from station database. On the other hand, the latter controls the status of station facilities in real-time by applying the generated interlocking relationship to the signal facilities such as signal devices, points, track circuits for a given route. The expert system is implemented in C language which is suitable to implement the interlocking table generation part using the dynamic memory allocation technique. Finally, the effectiveness of the expert system is proved by simulating for the typical station model. (author). 11 refs., 9 figs., 2 tabs.
Efficient Packet Forwarding in Mesh Network
Kanrar, Soumen
2012-01-01
Wireless Mesh Network (WMN) is a multi hop low cost, with easy maintenance robust network providing reliable service coverage. WMNs consist of mesh routers and mesh clients. In this architecture, while static mesh routers form the wireless backbone, mesh clients access the network through mesh routers as well as directly meshing with each other. Different from traditional wireless networks, WMN is dynamically self-organized and self-configured. In other words, the nodes in the mesh network automatically establish and maintain network connectivity. Over the years researchers have worked, to reduce the redundancy in broadcasting packet in the mesh network in the wireless domain for providing reliable service coverage, the source node deserves to broadcast or flood the control packets. The redundant control packet consumes the bandwidth of the wireless medium and significantly reduces the average throughput and consequently reduces the overall system performance. In this paper I study the optimization problem in...
A Method of Generating Indoor Map Spatial Data Automatically from Architectural Plans
Directory of Open Access Journals (Sweden)
SUN Weixin
2016-06-01
Full Text Available Taking architectural plans as data source, we proposed a method which can automatically generate indoor map spatial data. Firstly, referring to the spatial data demands of indoor map, we analyzed the basic characteristics of architectural plans, and introduced concepts of wall segment, adjoining node and adjoining wall segment, based on which basic flow of indoor map spatial data automatic generation was further established. Then, according to the adjoining relation between wall lines at the intersection with column, we constructed a repair method for wall connectivity in relation to the column. Utilizing the method of gradual expansibility and graphic reasoning to judge wall symbol local feature type at both sides of door or window, through update the enclosing rectangle of door or window, we developed a repair method for wall connectivity in relation to the door or window and a method for transform door or window into indoor map point feature. Finally, on the basis of geometric relation between adjoining wall segment median lines, a wall center-line extraction algorithm was presented. Taking one exhibition hall's architectural plan as example, we performed experiment and results show that the proposed methods have preferable applicability to deal with various complex situations, and realized indoor map spatial data automatic extraction effectively.
Evaluating the Potential of Imaging Rover for Automatic Point Cloud Generation
Cera, V.; Campi, M.
2017-02-01
The paper presents a phase of an on-going interdisciplinary research concerning the medieval site of Casertavecchia (Italy). The project aims to develop a multi-technique approach for the semantic - enriched 3D modeling starting from the automatic acquisition of several data. In particular, the paper reports the results of the first stage about the Cathedral square of the medieval village. The work is focused on evaluating the potential of an imaging rover for automatic point cloud generation. Each of survey techniques has its own advantages and disadvantages so the ideal approach is an integrated methodology in order to maximize single instrument performance. The experimentation was conducted on the Cathedral square of the ancient site of Casertavecchia, in Campania, Italy.
Development of ANJOYMC Program for Automatic Generation of Monte Carlo Cross Section Libraries
Energy Technology Data Exchange (ETDEWEB)
Kim, Kang Seog; Lee, Chung Chan
2007-03-15
The NJOY code developed at Los Alamos National Laboratory is to generate the cross section libraries in ACE format for the Monte Carlo codes such as MCNP and McCARD by processing the evaluated nuclear data in ENDF/B format. It takes long time to prepare all the NJOY input files for hundreds of nuclides with various temperatures, and there can be some errors in the input files. In order to solve these problems, ANJOYMC program has been developed. By using a simple user input deck, this program is not only to generate all the NJOY input files automatically, but also to generate a batch file to perform all the NJOY calculations. The ANJOYMC program is written in Fortran90 and can be executed under the WINDOWS and LINUX operating systems in Personal Computer. Cross section libraries in ACE format can be generated in a short time and without an error by using a simple user input deck.
Directory of Open Access Journals (Sweden)
Preeti Hooda,
2014-06-01
Full Text Available The load-frequency control (LFC is used to restore the balance between load and generation in each control area by means of speed control. In power system, the main goal of load frequency control (LFC or automatic generation control (AGC is to maintain the frequency of each area and tie- line power flow within specified tolerance by adjusting the MW outputs of LFC generators so as to accommodate fluctuating load demands. In this paper, attempt is made to make a scheme for automatic generation control within a restructured environment considering effects of contracts between DISCOs and GENCOs to make power system network in normal state where, GENCO used are hydro plants as well as thermal plants. The bacterial foraging optimization technique is being developed, which is applied to AGC in an interconnected four area system.The performance of the system is obtained by MATLAB Simulink tool. The results are shown in frequency and power response for four area AGC system. In this paper we have shown practical work by using thermal and hydro both system at Genco’s side.As reheated system transfer function is being used.
Automatic Generation of Data Types for Classification of Deep Web Sources
Energy Technology Data Exchange (ETDEWEB)
Ngu, A H; Buttler, D J; Critchlow, T J
2005-02-14
A Service Class Description (SCD) is an effective meta-data based approach for discovering Deep Web sources whose data exhibit some regular patterns. However, it is tedious and error prone to create an SCD description manually. Moreover, a manually created SCD is not adaptive to the frequent changes of Web sources. It requires its creator to identify all the possible input and output types of a service a priori. In many domains, it is impossible to exhaustively list all the possible input and output data types of a source in advance. In this paper, we describe machine learning approaches for automatic generation of the data types of an SCD. We propose two different approaches for learning data types of a class of Web sources. The Brute-Force Learner is able to generate data types that can achieve high recall, but with low precision. The Clustering-based Learner generates data types that have a high precision rate, but with a lower recall rate. We demonstrate the feasibility of these two learning-based solutions for automatic generation of data types for citation Web sources and presented a quantitative evaluation of these two solutions.
Three-dimensional elliptic grid generation with fully automatic boundary constraints
Kaul, Upender K.
2010-08-01
A new procedure for generating smooth uniformly clustered three-dimensional structured elliptic grids is presented here which formulates three-dimensional boundary constraints by extending the two-dimensional counterpart presented by the author earlier. This fully automatic procedure obviates the need for manual specification of decay parameters over the six bounding surfaces of a given volume grid. The procedure has been demonstrated here for the Mars Science Laboratory (MSL) geometries such as aeroshell and canopy, as well as the Inflatable Aerodynamic Decelerator (IAD) geometry and a 3D analytically defined geometry. The new procedure also enables generation of single-block grids for such geometries because the automatic boundary constraints permit the decay parameters to evolve as part of the solution to the elliptic grid system of equations. These decay parameters are no longer just constants, as specified in the conventional approach, but functions of generalized coordinate variables over a given bounding surface. Since these decay functions vary over a given boundary, orthogonal grids around any arbitrary simply-connected boundary can be clustered automatically without having to break up the boundaries and the corresponding interior or exterior domains into various blocks for grid generation. The new boundary constraints are not limited to the simply-connected regions only, but can also be formulated around multiply-connected and isolated regions in the interior. The proposed method is superior to other methods of grid generation such as algebraic and hyperbolic techniques in that the grids obtained here are C2 continuous, whereas simple elliptic smoothing of algebraic or hyperbolic grids to enforce C2 continuity destroys the grid clustering near the boundaries. US patent 7231329.
Research on Parallel Unstructured Mesh Generation Technology Based on GPU%基于GPU的并行非结构网格生成技术研究
Institute of Scientific and Technical Information of China (English)
齐龙; 肖素梅; 刘云楚; 廖玲玲; 蔡云龙
2013-01-01
In order to solve the problems of unstructured mesh generation technology in time and memory, the parallel generation method of unstructured grid is researched, and the GPU unstructured mesh generation technology based on the framework of CUDA is put forward. In CUDA programming framework, unstructured mesh generation technology is applied to GPU parallel environment, Combining the high-speed parallel GPU with parallel delaunay generation technology. Its performance is evaluated by the analysis of the speedup rate and efficiency. According to the experimental results, the suggested method is of high efficiency. Compared with traditional methods, it greatly reduces the time consumption in the same mesh quality.%为了解决非结构网格生成在时间和内存上的问题,研究了非结构网格的并行生成方法,提出了一种基于CUDA架构的GPU并行非结构网格生成技术.该技术结合了GPU的高速并行性和并行Delaunay网格生成技术的优点,在CUDA编程框架下,将非结构网格生成的技术应用到GPU并行环境中.通过分析此方法的加速比和效率,对其性能进行了评估.实验结果表明,所提出的方法具备有高效性,与传统方法相比,在保证网格质量的同时,大幅度减少了其时间消耗.
Energy Technology Data Exchange (ETDEWEB)
Krishnan, Venkat; Das, Trishna
2016-05-01
Increasing variable generation penetration and the consequent increase in short-term variability makes energy storage technologies look attractive, especially in the ancillary market for providing frequency regulation services. This paper presents slow dynamics model for compressed air energy storage and battery storage technologies that can be used in automatic generation control studies to assess the system frequency response and quantify the benefits from storage technologies in providing regulation service. The paper also represents the slow dynamics model of the power system integrated with storage technologies in a complete state space form. The storage technologies have been integrated to the IEEE 24 bus system with single area, and a comparative study of various solution strategies including transmission enhancement and combustion turbine have been performed in terms of generation cycling and frequency response performance metrics.
Automatic test pattern generation for logic circuits using the Boolean tree
Energy Technology Data Exchange (ETDEWEB)
Jeong Taegwon.
1991-01-01
The goal of this study was to develop an algorithm that can generate test patterns for combinational circuits and sequential logic circuits automatically. The new proposed algorithm generates a test pattern by using a special tree called a modified Boolean tree. In this algorithm, the construction of a modified Boolean tree is the most time-consuming step. Following the construction of a modified Boolean tree, a test pattern can be found by simply assigning a logic value 1 for even primary inputs and a logic value 0 for odd primary inputs of the constructed modified Boolean tree. The algorithm is applied to several benchmark circuits. The results showed the following: (1) for combinational circuits, the algorithm can generate test patterns 10-15% faster than the FAN algorithm, which is known as one of the most efficient algorithms to-date; (2) for sequential circuits, the algorithm shows more fault coverage than the nine valued algorithm.
Z Specification Automatic Generator%Z规格说明自动生成器
Institute of Scientific and Technical Information of China (English)
赵正旭; 温晋杰
2016-01-01
The formalized Z language can improve the reliability and robustness of the software via using complex mathematical theories. However, only a few people can understand these theories and compile with Z specification. At present, the main research of Z language focuses on the theoretical research. There is no corresponding tools support the automatic generation of Z specification. The research of Z specification automatic generator introduced in this article can help with the compilation of the Z specification and cut the cost of formal development. This automatic generator has great significance for the large-scale promotion of the Z language.%形式化Z语言采用严格的数学理论可以有效提高软件的可靠性和鲁棒性,但是由于其包含的数学理论使得只有少数人能够熟练应用Z语言进行形式化规格说明书的编写.目前,多数对于Z语言的研究集中在理论阶段,还没有相应的工具支持Z规格说明的自动生成.本文中对于Z规格说明自动生成器的研究有助于降低Z规格说明书的编写难度,降低了形式化开发的难度及成本,对于形式化Z语言的推广具有重要的意义.
Directory of Open Access Journals (Sweden)
Luo Hanwu
2016-01-01
Full Text Available This paper presents a novel method to solve the initial lightning breakdown current by combing ATP and MATLAB simulation software effectively, with the aims to evaluate the lightning protection performance of transmission line. Firstly, the executable ATP simulation model is generated automatically according to the required information such as power source parameters, tower parameters, overhead line parameters, grounding resistance and lightning current parameters, etc. through an interface program coded by MATLAB. Then, the data are extracted from the generated LIS files which can be obtained by executing the ATP simulation model, the occurrence of transmission lie breakdown can be determined by the relative data in LIS file. The lightning current amplitude should be reduced when the breakdown occurs, and vice the verse. Thus the initial lightning breakdown current of a transmission line with given parameters can be determined accurately by continuously changing the lightning current amplitude, which is realized by a loop computing algorithm that is coded by MATLAB software. The method proposed in this paper can generate the ATP simulation program automatically, and facilitates the lightning protection performance assessment of transmission line.
An Automatic Code Generator Expert System Using Proprietary Language for Wider Business Application
Directory of Open Access Journals (Sweden)
Aurangzeb Khan
2014-05-01
Full Text Available The proposed System is an automatic front-end Code Generator Expert System (CGES for ensuring wider business application for the generation of GUI with a source code for Databases. Safe keeping of data for smooth transaction in business has always been a matter of concern. With the help of the proposed CGES, with economy of effort and time, a customizable database application may be produced with a simple wizard. The CGES requires a database as a pre-requisite input. Once the normalized database is featured with a diagram, the CGES shall apply techniques according to the pre-defined algorithm; the complete application with source code in various modules shall automatically produce. By selecting the CGES solutions, an N-tier application shall give rise to a product, comprising of SQL server queries, Object Oriented features and modules. The results prove on a test working principles of the system are written in MS SQL Server and on the Visual Basic.NET source code generated by CGES.
Energy Technology Data Exchange (ETDEWEB)
Golpira, H., E-mail: hemin.golpira@uok.ac.i [Department of Electrical and Computer Engineering, University of Kurdistan, Sanandaj, PO Box 416, Kurdistan (Iran, Islamic Republic of); Bevrani, H. [Department of Electrical and Computer Engineering, University of Kurdistan, Sanandaj, PO Box 416, Kurdistan (Iran, Islamic Republic of); Golpira, H. [Department of Industrial Engineering, Islamic Azad University, Sanandaj Branch, PO Box 618, Kurdistan (Iran, Islamic Republic of)
2011-05-15
Highlights: {yields} A realistic model for automatic generation control (AGC) design is proposed. {yields} The model considers GRC, Speed governor dead band, filters and time delay. {yields} The model provides an accurate model for the digital simulations. -- Abstract: This paper addresses a realistic model for automatic generation control (AGC) design in an interconnected power system. The proposed scheme considers generation rate constraint (GRC), dead band, and time delay imposed to the power system by governor-turbine, filters, thermodynamic process, and communication channels. Simplicity of structure and acceptable response of the well-known integral controller make it attractive for the power system AGC design problem. The Genetic algorithm (GA) is used to compute the decentralized control parameters to achieve an optimum operating point. A 3-control area power system is considered as a test system, and the closed-loop performance is examined in the presence of various constraints scenarios. It is shown that neglecting above physical constraints simultaneously or in part, leads to impractical and invalid results and may affect the system security, reliability and integrity. Taking to account the advantages of GA besides considering a more complete dynamic model provides a flexible and more realistic AGC system in comparison of existing conventional schemes.
Automatic Data Extraction from Websites for Generating Aquatic Product Market Information
Institute of Scientific and Technical Information of China (English)
YUAN Hong-chun; CHEN Ying; SUN Yue-fu
2006-01-01
The massive web-based information resources have led to an increasing demand for effective automatic retrieval of target information for web applications. This paper introduces a web-based data extraction tool that deploys various algorithms to locate, extract and filter tabular data from HTML pages and to transform them into new web-based representations. The tool has been applied in an aquaculture web application platform for extracting and generating aquatic product market information.Results prove that this tool is very effective in extracting the required data from web pages.
LanHEP - a package for automatic generation of Feynman rules in gauge models
Semenov, A Yu
1996-01-01
We consider the general problem of derivation of the Feynman rules for the matrix elements in momentum representation from the given Lagrangian in coordinate space invariant under the transformation of some gauge group. LanHEP package presented in this paper allows to define in a convenient way the gauge model Lagrangian in canonical form and then to generate automatically the Feynman rules that can be used in the following calculation of the physical processes by means of CompHEP package. The detailed description of LanHEP commands is given and several examples of LanHEP applications (QED, QCD, Standard Model in the t'Hooft-Feynman gauge) are presented.
Automatic Generation of CFD-Ready Surface Triangulations from CAD Geometry
Aftosmis, M. J.; Delanaye, M.; Haimes, R.; Nixon, David (Technical Monitor)
1998-01-01
This paper presents an approach for the generation of closed manifold surface triangulations from CAD geometry. CAD parts and assemblies are used in their native format, without translation, and a part's native geometry engine is accessed through a modeler-independent application programming interface (API). In seeking a robust and fully automated procedure, the algorithm is based on a new physical space manifold triangulation technique which was developed to avoid robustness issues associated with poorly conditioned mappings. In addition, this approach avoids the usual ambiguities associated with floating-point predicate evaluation on constructed coordinate geometry in a mapped space, The technique is incremental, so that each new site improves the triangulation by some well defined quality measure. Sites are inserted using a variety of priority queues to ensure that new insertions will address the worst triangles first, As a result of this strategy, the algorithm will return its 'best' mesh for a given (prespecified) number of sites. Alternatively, the algorithm may be allowed to terminate naturally after achieving a prespecified measure of mesh quality. The resulting triangulations are 'CFD-ready' in that: (1) Edges match the underlying part model to within a specified tolerance. (2) Triangles on disjoint surfaces in close proximity have matching length-scales. (3) The algorithm produces a triangulation such that no angle is less than a given angle bound, alpha, or greater than Pi - 2alpha This result also sets bounds on the maximum vertex degree, triangle aspect-ratio and maximum stretching rate for the triangulation. In addition to tile output triangulations for a variety of CAD parts, tile discussion presents related theoretical results which assert the existence of such all angle bound, and demonstrate that maximum bounds of between 25 deg and 30 deg may be achieved in practice.
Directory of Open Access Journals (Sweden)
Qi Chen
2014-12-01
Full Text Available Intelligent seamline selection for image mosaicking is an area of active research in the fields of massive data processing, computer vision, photogrammetry and remote sensing. In mosaicking applications for digital orthophoto maps (DOMs, the visual transition in mosaics is mainly caused by differences in positioning accuracy, image tone and relief displacement of high ground objects between overlapping DOMs. Among these three factors, relief displacement, which prevents the seamless mosaicking of images, is relatively more difficult to address. To minimize visual discontinuities, many optimization algorithms have been studied for the automatic selection of seamlines to avoid high ground objects. Thus, a new automatic seamline selection algorithm using a digital surface model (DSM is proposed. The main idea of this algorithm is to guide a seamline toward a low area on the basis of the elevation information in a DSM. Given that the elevation of a DSM is not completely synchronous with a DOM, a new model, called the orthoimage elevation synchronous model (OESM, is derived and introduced. OESM can accurately reflect the elevation information for each DOM unit. Through the morphological processing of the OESM data in the overlapping area, an initial path network is obtained for seamline selection. Subsequently, a cost function is defined on the basis of several measurements, and Dijkstra’s algorithm is adopted to determine the least-cost path from the initial network. Finally, the proposed algorithm is employed for automatic seamline network construction; the effective mosaic polygon of each image is determined, and a seamless mosaic is generated. The experiments with three different datasets indicate that the proposed method meets the requirements for seamline network construction. In comparative trials, the generated seamlines pass through fewer ground objects with low time consumption.
Institute of Scientific and Technical Information of China (English)
薛倩
2015-01-01
According to the basic idea and the applications of grid ,a kind of quick and accurate algebraic method which is developed by Fortran development system is formulated and used for interpolating coordinates of turbo‐machinery blade section points .The numerical examples show that the new algorithm has rapid convergence ,that the grids generated by pres‐ent method have adjustable density and good orthogonality near the boundary ,the grid generated is practical and mesh quality is good .The method is very useful for generating complicated grids automatically for CFD researchers ,and can be general‐ized for point interpolating of all kinds of 3‐dimensional curves .%论文根据网格法的基本思想和应用，用 Fortran 语言建立了一种快速而精确的代数算法，用于插值计算叶片截面空间点坐标，并给出了相应算例。算例表明生成的网格边界间距可以调节，正交性好，非常实用，质量令人满意。适用于计算流体力学工作者构造各种复杂的计算网格，并可以推广到各种复杂的空间曲线点的插值计算。
Automatic Generation Control in Multi Area Interconnected Power System by using HVDC Links
Directory of Open Access Journals (Sweden)
Yogendra Arya
2012-01-01
Full Text Available This paper investigates the effects of HVDC link in parallel with HVAC link on automatic generation control (AGC problem for a multi-area power system taking into consideration system parameter variations. A fuzzy logic controller is proposed for four area power system interconnected via parallel HVAC/HVDC transmission link which is also referred as asynchronous tie-lines. The linear model of HVAC/HVDC link is developed and the system responses to sudden load change are studied. The simulation studies are carried out for a four area interconnected thermal power system. Suitable solution for automatic generation control problem of four area electrical power system is obtained by means of improving the dynamic performance of power system under study. Robustness of controller is also checked by varying parameters. Simulation results indicate that the scheme works well. The dynamic analyses have been done with and without HVDC link using fuzzy logic controller in Matlab-Simulink. Further a comparison between the two is presented and it has been shown that the performance of the proposed scheme is superior in terms of overshoot and settling time.
Automatic Generation of the Axial Lines of Urban Environments to Capture What We Perceive
Jiang, Bin
2008-01-01
Based on the concepts of isovists and medial axes, we developed a set of algorithms that can automatically generate the axial lines for representing individual linearly stretched parts of open space of an urban environment. Open space is the space between buildings, where people can freely move around. The generation of the axial lines has been a key aspect of space syntax research, conventionally relying on hand-drawn axial lines of an urban environment, often called the axial map, for urban morphological analysis. Although various attempts have been made towards an automatic solution, few of them can produce the axial map that is identical to the hand-drawn one, and none of them really works for different urban environments. Our algorithms are proved to provide a better solution than existing ones. Throughout this paper, we have also argued and demonstrated that the axial lines constitute a true skeleton, superior to the medial axes, in capturing what we perceive about the urban environment. Keywords: Visib...
Automatic code generation in SPARK: Applications of computer algebra and compiler-compilers
Energy Technology Data Exchange (ETDEWEB)
Nataf, J.M.; Winkelmann, F.
1992-09-01
We show how computer algebra and compiler-compilers are used for automatic code generation in the Simulation Problem Analysis and Research Kernel (SPARK), an object oriented environment for modeling complex physical systems that can be described by differential-algebraic equations. After a brief overview of SPARK, we describe the use of computer algebra in SPARK`s symbolic interface, which generates solution code for equations that are entered in symbolic form. We also describe how the Lex/Yacc compiler-compiler is used to achieve important extensions to the SPARK simulation language, including parametrized macro objects and steady-state resetting of a dynamic simulation. The application of these methods to solving the partial differential equations for two-dimensional heat flow is illustrated.
Automatic code generation in SPARK: Applications of computer algebra and compiler-compilers
Energy Technology Data Exchange (ETDEWEB)
Nataf, J.M.; Winkelmann, F.
1992-09-01
We show how computer algebra and compiler-compilers are used for automatic code generation in the Simulation Problem Analysis and Research Kernel (SPARK), an object oriented environment for modeling complex physical systems that can be described by differential-algebraic equations. After a brief overview of SPARK, we describe the use of computer algebra in SPARK's symbolic interface, which generates solution code for equations that are entered in symbolic form. We also describe how the Lex/Yacc compiler-compiler is used to achieve important extensions to the SPARK simulation language, including parametrized macro objects and steady-state resetting of a dynamic simulation. The application of these methods to solving the partial differential equations for two-dimensional heat flow is illustrated.
Semi-automatic identification photo generation with facial pose and illumination normalization
Jiang, Bo; Liu, Sijiang; Wu, Song
2016-07-01
Identification photo is a category of facial image that has strict requirements on image quality like size, illumination, user expression, dressing, etc. Traditionally, these photos are taken in professional studios. With the rapid popularity of mobile devices, how to conveniently take identification photo at any time and anywhere with such devices is an interesting problem. In this paper, we propose a novel semi-automatic identification photo generation approach. Given a user image, facial pose and expression are first normalized to meet the basic requirements. To correct uneven lighting condition in photo, an facial illumination normalization approach is adopted to further improve the image quality. Finally, foreground user is extracted and re-targeted to a specific photo size. Besides, background can also be changed as required. Preliminary experimental results show that the proposed method is efficient and effective in identification photo generation compared to commercial software based manual tunning.
The application of ANN technique to automatic generation control for multi-area power system
Energy Technology Data Exchange (ETDEWEB)
Zeynelgil, H.L.; Demiroren, A.; Sengor, N.S. [Istanbul Technical Univ., Maslak (Turkey). Electrical and Electronic Faculty
2002-06-01
This paper presents an application of layered artificial neural network controller (ANN) to study automatic generation control (AGC) problem in a four-area interconnected power system that three areas include steam turbines and the other area includes a hydro turbine. Each area of steam turbine in the system contains the reheat effect non-linearity of the steam turbine and the area of hydro turbine contains upper and lower constraints for generation rate. Only one ANN controller, which controls the inputs of each area in the power system together, is considered. In the study, back propagation-through-time algorithm is used as ANN learning rule. By comparing the results for both cases, the performance of ANN controller is better than conventional controllers. (author)
Punzalan, Florencio Rusty; Kunieda, Yoshitoshi; Amano, Akira
2015-01-01
Clinical and experimental studies involving human hearts can have certain limitations. Methods such as computer simulations can be an important alternative or supplemental tool. Physiological simulation at the tissue or organ level typically involves the handling of partial differential equations (PDEs). Boundary conditions and distributed parameters, such as those used in pharmacokinetics simulation, add to the complexity of the PDE solution. These factors can tailor PDE solutions and their corresponding program code to specific problems. Boundary condition and parameter changes in the customized code are usually prone to errors and time-consuming. We propose a general approach for handling PDEs and boundary conditions in computational models using a replacement scheme for discretization. This study is an extension of a program generator that we introduced in a previous publication. The program generator can generate code for multi-cell simulations of cardiac electrophysiology. Improvements to the system allow it to handle simultaneous equations in the biological function model as well as implicit PDE numerical schemes. The replacement scheme involves substituting all partial differential terms with numerical solution equations. Once the model and boundary equations are discretized with the numerical solution scheme, instances of the equations are generated to undergo dependency analysis. The result of the dependency analysis is then used to generate the program code. The resulting program code are in Java or C programming language. To validate the automatic handling of boundary conditions in the program code generator, we generated simulation code using the FHN, Luo-Rudy 1, and Hund-Rudy cell models and run cell-to-cell coupling and action potential propagation simulations. One of the simulations is based on a published experiment and simulation results are compared with the experimental data. We conclude that the proposed program code generator can be used to
Directory of Open Access Journals (Sweden)
Florencio Rusty Punzalan
Full Text Available Clinical and experimental studies involving human hearts can have certain limitations. Methods such as computer simulations can be an important alternative or supplemental tool. Physiological simulation at the tissue or organ level typically involves the handling of partial differential equations (PDEs. Boundary conditions and distributed parameters, such as those used in pharmacokinetics simulation, add to the complexity of the PDE solution. These factors can tailor PDE solutions and their corresponding program code to specific problems. Boundary condition and parameter changes in the customized code are usually prone to errors and time-consuming. We propose a general approach for handling PDEs and boundary conditions in computational models using a replacement scheme for discretization. This study is an extension of a program generator that we introduced in a previous publication. The program generator can generate code for multi-cell simulations of cardiac electrophysiology. Improvements to the system allow it to handle simultaneous equations in the biological function model as well as implicit PDE numerical schemes. The replacement scheme involves substituting all partial differential terms with numerical solution equations. Once the model and boundary equations are discretized with the numerical solution scheme, instances of the equations are generated to undergo dependency analysis. The result of the dependency analysis is then used to generate the program code. The resulting program code are in Java or C programming language. To validate the automatic handling of boundary conditions in the program code generator, we generated simulation code using the FHN, Luo-Rudy 1, and Hund-Rudy cell models and run cell-to-cell coupling and action potential propagation simulations. One of the simulations is based on a published experiment and simulation results are compared with the experimental data. We conclude that the proposed program code
Tarjuelo-Gutierrez, J; Rodriguez-Vila, B; Pierce, D M; Fastl, T E; Verbrugghe, P; Fourneau, I; Maleux, G; Herijgers, P; Holzapfel, G A; Gomez, E J
2014-02-01
In order to perform finite element (FE) analyses of patient-specific abdominal aortic aneurysms, geometries derived from medical images must be meshed with suitable elements. We propose a semi-automatic method for generating conforming hexahedral meshes directly from contours segmented from medical images. Magnetic resonance images are generated using a protocol developed to give the abdominal aorta high contrast against the surrounding soft tissue. These data allow us to distinguish between the different structures of interest. We build novel quadrilateral meshes for each surface of the sectioned geometry and generate conforming hexahedral meshes by combining the quadrilateral meshes. The three-layered morphology of both the arterial wall and thrombus is incorporated using parameters determined from experiments. We demonstrate the quality of our patient-specific meshes using the element Scaled Jacobian. The method efficiently generates high-quality elements suitable for FE analysis, even in the bifurcation region of the aorta into the iliac arteries. For example, hexahedral meshes of up to 125,000 elements are generated in less than 130 s, with 94.8 % of elements well suited for FE analysis. We provide novel input for simulations by independently meshing both the arterial wall and intraluminal thrombus of the aneurysm, and their respective layered morphologies.
Directory of Open Access Journals (Sweden)
Yu. Petrusha
2013-01-01
Full Text Available Possible risks pertaining to transition of electric-power industry to market relations have been considered in the paper. The paper presents an integrated ACS for generation and sale of electric power as an improvement of methodology for organizational and technical management. The given system is based on integration of operating Automatic Dispatch Control System (ADCS and developing Automatic Electricity Meter Reading System (AEMRS. The paper proposes to form an inter-branch sector of ACS PLC (Automatic Control System for Prolongation of Life Cycle users which is oriented on provision of development strategy.
Automatic evaluation and data generation for analytical chemistry instrumental analysis exercises
Directory of Open Access Journals (Sweden)
Arsenio Muñoz de la Peña
2014-01-01
Full Text Available In general, laboratory activities are costly in terms of time, space, and money. As such, the ability to provide realistically simulated laboratory data that enables students to practice data analysis techniques as a complementary activity would be expected to reduce these costs while opening up very interesting possibilities. In the present work, a novel methodology is presented for design of analytical chemistry instrumental analysis exercises that can be automatically personalized for each student and the results evaluated immediately. The proposed system provides each student with a different set of experimental data generated randomly while satisfying a set of constraints, rather than using data obtained from actual laboratory work. This allows the instructor to provide students with a set of practical problems to complement their regular laboratory work along with the corresponding feedback provided by the system's automatic evaluation process. To this end, the Goodle Grading Management System (GMS, an innovative web-based educational tool for automating the collection and assessment of practical exercises for engineering and scientific courses, was developed. The proposed methodology takes full advantage of the Goodle GMS fusion code architecture. The design of a particular exercise is provided ad hoc by the instructor and requires basic Matlab knowledge. The system has been employed with satisfactory results in several university courses. To demonstrate the automatic evaluation process, three exercises are presented in detail. The first exercise involves a linear regression analysis of data and the calculation of the quality parameters of an instrumental analysis method. The second and third exercises address two different comparison tests, a comparison test of the mean and a t-paired test.
Quadrilateral mesh fitting that preserves sharp features based on multi-normals for Laplacian energy
Directory of Open Access Journals (Sweden)
Yusuke Imai
2014-04-01
Full Text Available Because the cost of performance testing using actual products is expensive, manufacturers use lower-cost computer-aided design simulations for this function. In this paper, we propose using hexahedral meshes, which are more accurate than tetrahedral meshes, for finite element analysis. We propose automatic hexahedral mesh generation with sharp features to precisely represent the corresponding features of a target shape. Our hexahedral mesh is generated using a voxel-based algorithm. In our previous works, we fit the surface of the voxels to the target surface using Laplacian energy minimization. We used normal vectors in the fitting to preserve sharp features. However, this method could not represent concave sharp features precisely. In this proposal, we improve our previous Laplacian energy minimization by adding a term that depends on multi-normal vectors instead of using normal vectors. Furthermore, we accentuate a convex/concave surface subset to represent concave sharp features.
User Manual for the PROTEUS Mesh Tools
Energy Technology Data Exchange (ETDEWEB)
Smith, Micheal A. [Argonne National Lab. (ANL), Argonne, IL (United States); Shemon, Emily R. [Argonne National Lab. (ANL), Argonne, IL (United States)
2015-06-01
This report describes the various mesh tools that are provided with the PROTEUS code giving both descriptions of the input and output. In many cases the examples are provided with a regression test of the mesh tools. The most important mesh tools for any user to consider using are the MT_MeshToMesh.x and the MT_RadialLattice.x codes. The former allows the conversion between most mesh types handled by PROTEUS while the second allows the merging of multiple (assembly) meshes into a radial structured grid. Note that the mesh generation process is recursive in nature and that each input specific for a given mesh tool (such as .axial or .merge) can be used as “mesh” input for any of the mesh tools discussed in this manual.
Automatic generation of 3D motifs for classification of protein binding sites
Directory of Open Access Journals (Sweden)
Herzyk Pawel
2007-08-01
Full Text Available Abstract Background Since many of the new protein structures delivered by high-throughput processes do not have any known function, there is a need for structure-based prediction of protein function. Protein 3D structures can be clustered according to their fold or secondary structures to produce classes of some functional significance. A recent alternative has been to detect specific 3D motifs which are often associated to active sites. Unfortunately, there are very few known 3D motifs, which are usually the result of a manual process, compared to the number of sequential motifs already known. In this paper, we report a method to automatically generate 3D motifs of protein structure binding sites based on consensus atom positions and evaluate it on a set of adenine based ligands. Results Our new approach was validated by generating automatically 3D patterns for the main adenine based ligands, i.e. AMP, ADP and ATP. Out of the 18 detected patterns, only one, the ADP4 pattern, is not associated with well defined structural patterns. Moreover, most of the patterns could be classified as binding site 3D motifs. Literature research revealed that the ADP4 pattern actually corresponds to structural features which show complex evolutionary links between ligases and transferases. Therefore, all of the generated patterns prove to be meaningful. Each pattern was used to query all PDB proteins which bind either purine based or guanine based ligands, in order to evaluate the classification and annotation properties of the pattern. Overall, our 3D patterns matched 31% of proteins with adenine based ligands and 95.5% of them were classified correctly. Conclusion A new metric has been introduced allowing the classification of proteins according to the similarity of atomic environment of binding sites, and a methodology has been developed to automatically produce 3D patterns from that classification. A study of proteins binding adenine based ligands showed that
Directory of Open Access Journals (Sweden)
Banaja Mohanty
2014-09-01
Full Text Available This paper presents the design and performance analysis of Differential Evolution (DE algorithm based Proportional–Integral (PI and Proportional–Integral–Derivative (PID controllers for Automatic Generation Control (AGC of an interconnected power system. Initially, a two area thermal system with governor dead-band nonlinearity is considered for the design and analysis purpose. In the proposed approach, the design problem is formulated as an optimization problem control and DE is employed to search for optimal controller parameters. Three different objective functions are used for the design purpose. The superiority of the proposed approach has been shown by comparing the results with a recently published Craziness based Particle Swarm Optimization (CPSO technique for the same interconnected power system. It is noticed that, the dynamic performance of DE optimized PI controller is better than CPSO optimized PI controllers. Additionally, controller parameters are tuned at different loading conditions so that an adaptive gain scheduling control strategy can be employed. The study is further extended to a more realistic network of two-area six unit system with different power generating units such as thermal, hydro, wind and diesel generating units considering boiler dynamics for thermal plants, Generation Rate Constraint (GRC and Governor Dead Band (GDB non-linearity.
Automatic Generation of combination of Values for Functional Testing Using Metaheuristics
Directory of Open Access Journals (Sweden)
Arloys Macias Rojas
2016-11-01
Full Text Available Several authors agree with the importance of the tests like element of quality control of the software and in the impossibility of their realization of exhaustive way. This opinion defends that, the necessary quan-tity of stages and test values to achieve the maximum coverage is too big, what converts the test-case design, and in particular the generation of its values, in a combinatorial problem. That´s why, in many instances, in front of the impossibility of covering all the stages, testers leave out of the design some inter-esting values, which can discover inconsistencies with the specified requirements.This work presents a proposal for the automatic generation of values of functional test cases, by means of the use of meta-heu-ristic algorithms and maximizing the coverage of the stages. Furthermore, the algorithms implemented for the generation of initial values and for the generation of combinations are detailed. Additionally a set of good practices to use the component and the comparison of the obtained results with other existing solutions are described.
Automatic Generation of the Planning Tunnel High Speed Craft Hull Form
Institute of Scientific and Technical Information of China (English)
Morteza Ghassabzadeh; Hassan Ghassemi
2012-01-01
The creation of geometric model of a ship to determine the characteristics of hydrostatic and hydrodynamic,and also for structural design and equipments arrangement are so important in the ship design process.Planning tunnel high speed craft is one of the crafts in which,achievement to their top speed is more important.These crafts with the use of tunnel have the aero-hydrodynamics properties to diminish the resistance,good sea-keeping behavior,reduce slamming and avoid porpoising.Because of the existence of the tunnel,the hull form generation of these crafts is more complex and difficult.In this paper,it has attempted to provide a method based on geometry creation guidelines and with an entry of the least control and hull form adjustment parameters,to generate automatically the hull form of planning tunnel craft.At first,the equations of mathematical model are described and subsequent,three different models generated based on present method are compared and analyzed.Obviously,the generated model has more application in the early stages of design.
Salo, Zoryana; Beek, Maarten; Wright, David; Whyne, Cari Marisa
2015-04-13
Current methods for the development of pelvic finite element (FE) models generally are based upon specimen specific computed tomography (CT) data. This approach has traditionally required segmentation of CT data sets, which is time consuming and necessitates high levels of user intervention due to the complex pelvic anatomy. The purpose of this research was to develop and assess CT landmark-based semi-automated mesh morphing and mapping techniques to aid the generation and mechanical analysis of specimen-specific FE models of the pelvis without the need for segmentation. A specimen-specific pelvic FE model (source) was created using traditional segmentation methods and morphed onto a CT scan of a different (target) pelvis using a landmark-based method. The morphed model was then refined through mesh mapping by moving the nodes to the bone boundary. A second target model was created using traditional segmentation techniques. CT intensity based material properties were assigned to the morphed/mapped model and to the traditionally segmented target models. Models were analyzed to evaluate their geometric concurrency and strain patterns. Strains generated in a double-leg stance configuration were compared to experimental strain gauge data generated from the same target cadaver pelvis. CT landmark-based morphing and mapping techniques were efficiently applied to create a geometrically multifaceted specimen-specific pelvic FE model, which was similar to the traditionally segmented target model and better replicated the experimental strain results (R(2)=0.873). This study has shown that mesh morphing and mapping represents an efficient validated approach for pelvic FE model generation without the need for segmentation.
Automatic Generation of 3D Caricatures Based on Artistic Deformation Styles.
Clarke, Lyndsey; Chen, Min; Mora, Benjamin
2011-06-01
Caricatures are a form of humorous visual art, usually created by skilled artists for the intention of amusement and entertainment. In this paper, we present a novel approach for automatic generation of digital caricatures from facial photographs, which capture artistic deformation styles from hand-drawn caricatures. We introduced a pseudo stress-strain model to encode the parameters of an artistic deformation style using "virtual" physical and material properties. We have also developed a software system for performing the caricaturistic deformation in 3D which eliminates the undesirable artifacts in 2D caricaturization. We employed a Multilevel Free-Form Deformation (MFFD) technique to optimize a 3D head model reconstructed from an input facial photograph, and for controlling the caricaturistic deformation. Our results demonstrated the effectiveness and usability of the proposed approach, which allows ordinary users to apply the captured and stored deformation styles to a variety of facial photographs.
Automatic Generation of Building Models with Levels of Detail 1-3
Nguatem, W.; Drauschke, M.; Mayer, H.
2016-06-01
We present a workflow for the automatic generation of building models with levels of detail (LOD) 1 to 3 according to the CityGML standard (Gröger et al., 2012). We start with orienting unsorted image sets employing (Mayer et al., 2012), we compute depth maps using semi-global matching (SGM) (Hirschmüller, 2008), and fuse these depth maps to reconstruct dense 3D point clouds (Kuhn et al., 2014). Based on planes segmented from these point clouds, we have developed a stochastic method for roof model selection (Nguatem et al., 2013) and window model selection (Nguatem et al., 2014). We demonstrate our workflow up to the export into CityGML.
A new PID controller design for automatic generation control of hydro power systems
Energy Technology Data Exchange (ETDEWEB)
Khodabakhshian, A.; Hooshmand, R. [Electrical Engineering Department, University of Isfahan (Iran)
2010-06-15
This paper presents a new robust PID controller for automatic generation control (AGC) of hydro turbine power systems. The method is mainly based on a maximum peak resonance specification that is graphically supported by the Nichols chart. The open-loop frequency response curve is tangent to a specified ellipse and this makes the method to be efficient for controlling the overshoot, the stability and the dynamics of the system. Comparative results of this new load frequency controller with a conventional PI one and also with another PID controller design tested on a multimachine power system show the improvement in system damping remarkably. The region of acceptable performance of the new PID controller covers a wide range of operating and system conditions. (author)
Directory of Open Access Journals (Sweden)
Yunsik Son
2017-01-01
Full Text Available Several location-based services (LBSs have been recently developed for smartphones. Among these are proactive LBSs, which provide services to smartphone users by periodically collecting background logs. However, because they consume considerable battery power, they are not widely used for various LBS-based services. Battery consumption, in particular, is a significant issue on account of the characteristics of mobile systems. This problem involves a greater service restriction when performing complex operations. Therefore, to successfully enable various services based on location, this problem must be solved. In this paper, we introduce a technique to automatically generate a customized service optimizer for each application, service type, and platform using location and situation information. By using the proposed technique, energy and computing resources can be more efficiently employed for each service. Thus, users should receive more effective LBSs on mobile devices, such as smartphones.
Directory of Open Access Journals (Sweden)
Adrian ALEXANDRESCU
2008-01-01
Full Text Available This paper contains some ideas concerning the Enterprise Information Systems (EIS development. It combines known elements from the software engineering domain, with original elements, which the author has conceived and experimented. The author has followed two major objectives: to use a simple description for the concepts of an EIS, and to achieve a rapid and reliable EIS development process with minimal cost. The first goal was achieved defining some models, which describes the conceptual elements of the EIS domain: entities, events, actions, states and attribute-domain. The second goal is based on a predefined architectural model for the EIS, on predefined analyze and design models for the elements of the domain and finally on the automatic generation of the system components. The proposed methods do not depend on a special programming language or a data base management system. They are general and may be applied to any combination of such technologies.
HELAC-Onia: an automatic matrix element generator for heavy quarkonium physics
Shao, Hua-Sheng
2013-01-01
By the virtues of the Dyson-Schwinger equations, we upgrade the published code \\mtt{HELAC} to be capable to calculate the heavy quarkonium helicity amplitudes in the framework of NRQCD factorization, which we dub \\mtt{HELAC-Onia}. We rewrote the original \\mtt{HELAC} to make the new program be able to calculate helicity amplitudes of multi P-wave quarkonium states production at hadron colliders and electron-positron colliders by including new P-wave off-shell currents. Therefore, besides the high efficiencies in computation of multi-leg processes within the Standard Model, \\mtt{HELAC-Onia} is also sufficiently numerical stable in dealing with P-wave quarkonia (e.g. $h_{c,b},\\chi_{c,b}$) and P-wave color-octet intermediate states. To the best of our knowledge, it is a first general-purpose automatic quarkonium matrix elements generator based on recursion relations on the market.
Ibraheem; Hasan, Naimul; Hussein, Arkan Ahmed
2014-01-01
This Paper presents the design of decentralized automatic generation controller for an interconnected power system using PID, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). The designed controllers are tested on identical two-area interconnected power systems consisting of thermal power plants. The area interconnections between two areas are considered as (i) AC tie-line only (ii) Asynchronous tie-line. The dynamic response analysis is carried out for 1% load perturbation. The performance of the intelligent controllers based on GA and PSO has been compared with the conventional PID controller. The investigations of the system dynamic responses reveal that PSO has the better dynamic response result as compared with PID and GA controller for both type of area interconnection.
Automatic Generation of OpenMP Directives and Its Application to Computational Fluid Dynamics Codes
Yan, Jerry; Jin, Haoqiang; Frumkin, Michael; Yan, Jerry (Technical Monitor)
2000-01-01
The shared-memory programming model is a very effective way to achieve parallelism on shared memory parallel computers. As great progress was made in hardware and software technologies, performance of parallel programs with compiler directives has demonstrated large improvement. The introduction of OpenMP directives, the industrial standard for shared-memory programming, has minimized the issue of portability. In this study, we have extended CAPTools, a computer-aided parallelization toolkit, to automatically generate OpenMP-based parallel programs with nominal user assistance. We outline techniques used in the implementation of the tool and discuss the application of this tool on the NAS Parallel Benchmarks and several computational fluid dynamics codes. This work demonstrates the great potential of using the tool to quickly port parallel programs and also achieve good performance that exceeds some of the commercial tools.
Automatic Motion Generation for Robotic Milling Optimizing Stiffness with Sample-Based Planning
Directory of Open Access Journals (Sweden)
Julian Ricardo Diaz Posada
2017-01-01
Full Text Available Optimal and intuitive robotic machining is still a challenge. One of the main reasons for this is the lack of robot stiffness, which is also dependent on the robot positioning in the Cartesian space. To make up for this deficiency and with the aim of increasing robot machining accuracy, this contribution describes a solution approach for optimizing the stiffness over a desired milling path using the free degree of freedom of the machining process. The optimal motion is computed based on the semantic and mathematical interpretation of the manufacturing process modeled on its components: product, process and resource; and by configuring automatically a sample-based motion problem and the transition-based rapid-random tree algorithm for computing an optimal motion. The approach is simulated on a CAM software for a machining path revealing its functionality and outlining future potentials for the optimal motion generation for robotic machining processes.
Institute of Scientific and Technical Information of China (English)
Deepak KAPUR
2006-01-01
A method using quantifier-elimination is proposed for automatically generating program invariants/inductive assertions. Given a program, inductive assertions, hypothesized as parameterized formulas in a theory, are associated with program locations. Parameters in inductive assertions are discovered by generating constraints on parameters by ensuring that an inductive assertion is indeed preserved by all execution paths leading to the associated location of the program. The method can be used to discover loop invariants-properties of variables that remain invariant at the entry of a loop. The parameterized formula can be successively refined by considering execution paths one by one; heuristics can be developed for determining the order in which the paths are considered. Initialization of program variables as well as the precondition and postcondition, if available, can also be used to further refine the hypothesized invariant. The method does not depend on the availability of the precondition and postcondition of a program. Constraints on parameters generated in this way are solved for possible values of parameters. If no solution is possible, this means that an invariant of the hypothesized form is not likely to exist for the loop under the assumptions/approximations made to generate the associated verification condition. Otherwise, if the parametric constraints are solvable, then under certain conditions on methods for generating these constraints, the strongest possible invariant of the hypothesized form can be generated from most general solutions of the parametric constraints. The approach is illustrated using the logical languages of conjunction of polynomial equations as well as Presburger arithmetic for expressing assertions.
Huang, Hai; Brenner, Claus; Sester, Monika
2013-05-01
This paper presents a generative statistical approach to automatic 3D building roof reconstruction from airborne laser scanning point clouds. In previous works, bottom-up methods, e.g., points clustering, plane detection, and contour extraction, are widely used. Due to the data artefacts caused by tree clutter, reflection from windows, water features, etc., the bottom-up reconstruction in urban areas may suffer from a number of incomplete or irregular roof parts. Manually given geometric constraints are usually needed to ensure plausible results. In this work we propose an automatic process with emphasis on top-down approaches. The input point cloud is firstly pre-segmented into subzones containing a limited number of buildings to reduce the computational complexity for large urban scenes. For the building extraction and reconstruction in the subzones we propose a pure top-down statistical scheme, in which the bottom-up efforts or additional data like building footprints are no more required. Based on a predefined primitive library we conduct a generative modeling to reconstruct roof models that fit the data. Primitives are assembled into an entire roof with given rules of combination and merging. Overlaps of primitives are allowed in the assembly. The selection of roof primitives, as well as the sampling of their parameters, is driven by a variant of Markov Chain Monte Carlo technique with specified jump mechanism. Experiments are performed on data-sets of different building types (from simple houses, high-rise buildings to combined building groups) and resolutions. The results show robustness despite the data artefacts mentioned above and plausibility in reconstruction.
Finite element meshing approached as a global minimization process
Energy Technology Data Exchange (ETDEWEB)
WITKOWSKI,WALTER R.; JUNG,JOSEPH; DOHRMANN,CLARK R.; LEUNG,VITUS J.
2000-03-01
The ability to generate a suitable finite element mesh in an automatic fashion is becoming the key to being able to automate the entire engineering analysis process. However, placing an all-hexahedron mesh in a general three-dimensional body continues to be an elusive goal. The approach investigated in this research is fundamentally different from any other that is known of by the authors. A physical analogy viewpoint is used to formulate the actual meshing problem which constructs a global mathematical description of the problem. The analogy used was that of minimizing the electrical potential of a system charged particles within a charged domain. The particles in the presented analogy represent duals to mesh elements (i.e., quads or hexes). Particle movement is governed by a mathematical functional which accounts for inter-particles repulsive, attractive and alignment forces. This functional is minimized to find the optimal location and orientation of each particle. After the particles are connected a mesh can be easily resolved. The mathematical description for this problem is as easy to formulate in three-dimensions as it is in two- or one-dimensions. The meshing algorithm was developed within CoMeT. It can solve the two-dimensional meshing problem for convex and concave geometries in a purely automated fashion. Investigation of the robustness of the technique has shown a success rate of approximately 99% for the two-dimensional geometries tested. Run times to mesh a 100 element complex geometry were typically in the 10 minute range. Efficiency of the technique is still an issue that needs to be addressed. Performance is an issue that is critical for most engineers generating meshes. It was not for this project. The primary focus of this work was to investigate and evaluate a meshing algorithm/philosophy with efficiency issues being secondary. The algorithm was also extended to mesh three-dimensional geometries. Unfortunately, only simple geometries were tested
Institute of Scientific and Technical Information of China (English)
寇淑清; 杨慎华; 黄良驹; 傅沛福
2001-01-01
The 3-D tool surface description together with the automatic 3-D meshing methods and the contact search is carried out for the FEM numerical simulation of complicated massive forming based on the cubic B-spline. The complex geometry for die-cavity and forging surface is described; the spline technique for 3-D mesh generation as well as piecewise mesh generation is proposed and the region-section search algo rithm is done for the advantages of B-spline such as visualization, localization, generalization, flexibility and adaptation for graphic model.%以三次B样条曲面描述为基础，对体成形数值模拟中的复杂模具型腔、锻件三维网格自动划分、锻件与模具接触的状态进行了一体化研究。利用B样条曲面的直观性、局部性、通用性和造型灵活性，构造了复杂模具型腔及锻件边界，提出了三维网格样条生成法、改进的分块样条生成法及接触判断区域层次搜索技术。
Automatic generation of large ensembles for air quality forecasting using the Polyphemus system
Directory of Open Access Journals (Sweden)
D. Garaud
2009-07-01
Full Text Available This paper describes a method to automatically generate a large ensemble of air quality simulations. This is achieved using the Polyphemus system, which is flexible enough to build various different models. The system offers a wide range of options in the construction of a model: many physical parameterizations, several numerical schemes and different input data can be combined. In addition, input data can be perturbed. In this paper, some 30 alternatives are available for the generation of a model. For each alternative, the options are given a probability, based on how reliable they are supposed to be. Each model of the ensemble is defined by randomly selecting one option per alternative. In order to decrease the computational load, as many computations as possible are shared by the models of the ensemble. As an example, an ensemble of 101 photochemical models is generated and run for the year 2001 over Europe. The models' performance is quickly reviewed, and the ensemble structure is analyzed. We found a strong diversity in the results of the models and a wide spread of the ensemble. It is noteworthy that many models turn out to be the best model in some regions and some dates.
Tra-la-Lyrics 2.0: Automatic Generation of Song Lyrics on a Semantic Domain
Gonçalo Oliveira, Hugo
2015-12-01
Tra-la-Lyrics is a system that generates song lyrics automatically. In its original version, the main focus was to produce text where stresses matched the rhythm of given melodies. There were no concerns on whether the text made sense or if the selected words shared some kind of semantic association. In this article, we describe the development of a new version of Tra-la-Lyrics, where text is generated on a semantic domain, defined by one or more seed words. This effort involved the integration of the original rhythm module of Tra-la-Lyrics in PoeTryMe, a generic platform that generates poetry with semantically coherent sentences. To measure our progress, the rhythm, the rhymes, and the semantic coherence in lyrics produced by the original Tra-la-Lyrics were analysed and compared with lyrics produced by the new instantiation of this system, dubbed Tra-la-Lyrics 2.0. The analysis showed that, in the lyrics by the new system, words have higher semantic association among them and with the given seeds, while the rhythm is still matched and rhymes are present. The previous analysis was complemented with a crowdsourced evaluation, where contributors answered a survey about relevant features of lyrics produced by the previous and the current versions of Tra-la-Lyrics. Though tight, the survey results confirmed the improvements of the lyrics by Tra-la-Lyrics 2.0.
AbouEisha, Hassan M.
2014-01-01
In this paper we present a dynamic programming algorithm for finding optimal elimination trees for the multi-frontal direct solver algorithm executed over two dimensional meshes with point singularities. The elimination tree found by the optimization algorithm results in a linear computational cost of sequential direct solver. Based on the optimal elimination tree found by the optimization algorithm we construct heuristic sequential multi-frontal direct solver algorithm resulting in a linear computational cost as well as heuristic parallel multi-frontal direct solver algorithm resulting in a logarithmic computational cost. The resulting parallel algorithm is implemented on NVIDIA CUDA GPU architecture based on our graph-grammar approach. © 2014 Springer-Verlag.
Haeseler, Friedrich
2003-01-01
Automatic sequences are sequences which are produced by a finite automaton. Although they are not random they may look as being random. They are complicated, in the sense of not being not ultimately periodic, they may look rather complicated, in the sense that it may not be easy to name the rule by which the sequence is generated, however there exists a rule which generates the sequence. The concept automatic sequences has special applications in algebra, number theory, finite automata and formal languages, combinatorics on words. The text deals with different aspects of automatic sequences, in particular:· a general introduction to automatic sequences· the basic (combinatorial) properties of automatic sequences· the algebraic approach to automatic sequences· geometric objects related to automatic sequences.
On Linear Spaces of Polyhedral Meshes.
Poranne, Roi; Chen, Renjie; Gotsman, Craig
2015-05-01
Polyhedral meshes (PM)-meshes having planar faces-have enjoyed a rise in popularity in recent years due to their importance in architectural and industrial design. However, they are also notoriously difficult to generate and manipulate. Previous methods start with a smooth surface and then apply elaborate meshing schemes to create polyhedral meshes approximating the surface. In this paper, we describe a reverse approach: given the topology of a mesh, we explore the space of possible planar meshes having that topology. Our approach is based on a complete characterization of the maximal linear spaces of polyhedral meshes contained in the curved manifold of polyhedral meshes with a given topology. We show that these linear spaces can be described as nullspaces of differential operators, much like harmonic functions are nullspaces of the Laplacian operator. An analysis of this operator provides tools for global and local design of a polyhedral mesh, which fully expose the geometric possibilities and limitations of the given topology.
Debbarma, Sanjoy; Saikia, Lalit Chandra; Sinha, Nidul
2014-03-01
Present work focused on automatic generation control (AGC) of a three unequal area thermal systems considering reheat turbines and appropriate generation rate constraints (GRC). A fractional order (FO) controller named as I(λ)D(µ) controller based on crone approximation is proposed for the first time as an appropriate technique to solve the multi-area AGC problem in power systems. A recently developed metaheuristic algorithm known as firefly algorithm (FA) is used for the simultaneous optimization of the gains and other parameters such as order of integrator (λ) and differentiator (μ) of I(λ)D(µ) controller and governor speed regulation parameters (R). The dynamic responses corresponding to optimized I(λ)D(µ) controller gains, λ, μ, and R are compared with that of classical integer order (IO) controllers such as I, PI and PID controllers. Simulation results show that the proposed I(λ)D(µ) controller provides more improved dynamic responses and outperforms the IO based classical controllers. Further, sensitivity analysis confirms the robustness of the so optimized I(λ)D(µ) controller to wide changes in system loading conditions and size and position of SLP. Proposed controller is also found to have performed well as compared to IO based controllers when SLP takes place simultaneously in any two areas or all the areas. Robustness of the proposed I(λ)D(µ) controller is also tested against system parameter variations.
Bonne, François; Alamir, Mazen; Hoa, Christine; Bonnay, Patrick; Bon-Mardion, Michel; Monteiro, Lionel
2015-12-01
In this article, we present a new Simulink library of cryogenics components (such as valve, phase separator, mixer, heat exchanger...) to assemble to generate model-based control schemes. Every component is described by its algebraic or differential equation and can be assembled with others to build the dynamical model of a complete refrigerator or the model of a subpart of it. The obtained model can be used to automatically design advanced model based control scheme. It also can be used to design a model based PI controller. Advanced control schemes aim to replace classical user experience designed approaches usually based on many independent PI controllers. This is particularly useful in the case where cryoplants are submitted to large pulsed thermal loads, expected to take place in future fusion reactors such as those expected in the cryogenic cooling systems of the International Thermonuclear Experimental Reactor (ITER) or the Japan Torus-60 Super Advanced Fusion Experiment (JT- 60SA). The paper gives the example of the generation of the dynamical model of the 400W@1.8K refrigerator and shows how to build a Constrained Model Predictive Control for it. Based on the scheme, experimental results will be given. This work is being supported by the French national research agency (ANR) through the ANR-13-SEED-0005 CRYOGREEN program.
A review of metaphase chromosome image selection techniques for automatic karyotype generation.
Arora, Tanvi; Dhir, Renu
2016-08-01
The karyotype is analyzed to detect the genetic abnormalities. It is generated by arranging the chromosomes after extracting them from the metaphase chromosome images. The chromosomes are non-rigid bodies that contain the genetic information of an individual. The metaphase chromosome image spread contains the chromosomes, but these chromosomes are not distinct bodies; they can either be individual chromosomes or be touching one another; they may be bent or even may be overlapping and thus forming a cluster of chromosomes. The extraction of chromosomes from these touching and overlapping chromosomes is a very tedious process. The segmentation of a random metaphase chromosome image may not give us correct and accurate results. Therefore, before taking up a metaphase chromosome image for analysis, it must be analyzed for the orientation of the chromosomes it contains. The various reported methods for metaphase chromosome image selection for automatic karyotype generation are compared in this paper. After analysis, it has been concluded that each metaphase chromosome image selection method has its advantages and disadvantages.
Directory of Open Access Journals (Sweden)
Khaled Jerbi
2012-01-01
Full Text Available In this paper, we introduce the Reconfigurable Video Coding (RVC standard based on the idea that video processing algorithms can be defined as a library of components that can be updated and standardized separately. MPEG RVC framework aims at providing a unified high-level specification of current MPEG coding technologies using a dataflow language called Cal Actor Language (CAL. CAL is associated with a set of tools to design dataflow applications and to generate hardware and software implementations. Before this work, the existing CAL hardware compilers did not support high-level features of the CAL. After presenting the main notions of the RVC standard, this paper introduces an automatic transformation process that analyses the non-compliant features and makes the required changes in the intermediate representation of the compiler while keeping the same behavior. Finally, the implementation results of the transformation on video and still image decoders are summarized. We show that the obtained results can largely satisfy the real time constraints for an embedded design on FPGA as we obtain a throughput of 73 FPS for MPEG 4 decoder and 34 FPS for coding and decoding process of the LAR coder using a video of CIF image size. This work resolves the main limitation of hardware generation from CAL designs.
Generating Algorithm of Progressive Mesh Model Based on Edge Collapse%基于边收缩的渐进网格模型生成算法
Institute of Scientific and Technical Information of China (English)
侯宝明; 鄂旭; 毕嘉娜
2013-01-01
为了实现3D模型的渐进式网格模型表示,改进基于边收缩方式模型简化的收缩代价计算方法.本算法首先从SMF数据文件中读取模型数据信息,然后在内存中快速建立起3D模型,重新设计Garland算法中QEM的权值计算方法.以顶点相邻三角平面法向量最大偏差的平方作为顶点的重要程度并将其加入到误差测度公式中,通过简化最终生成渐进式网格模型.实验结果表明,本算法简练,网格模型生成速度快,模型轮廓信息保持完整.%In order to implement progressive mesh representation of 3D model,the calculation method of collapse cost of model simplification based on edge collapse mode is improved.Firstly,model data from SMF data file is obtained,and the 3D model in the memory is established rapidly,and the weight calculation method of Garland's EM algorithm is redesigned.The square of the largest deviation of triangular plane normal adjacent to the vertex is used as the importance degree of vertex,and bring it into error metric formula,by simplifying progressive mesh is generated.The following experiment shows that the algorithm is succinct,and the generating speed of mesh and the contour information of model are completely preserved.
Surface meshing with curvature convergence
Li, Huibin
2014-06-01
Surface meshing plays a fundamental role in graphics and visualization. Many geometric processing tasks involve solving geometric PDEs on meshes. The numerical stability, convergence rates and approximation errors are largely determined by the mesh qualities. In practice, Delaunay refinement algorithms offer satisfactory solutions to high quality mesh generations. The theoretical proofs for volume based and surface based Delaunay refinement algorithms have been established, but those for conformal parameterization based ones remain wide open. This work focuses on the curvature measure convergence for the conformal parameterization based Delaunay refinement algorithms. Given a metric surface, the proposed approach triangulates its conformal uniformization domain by the planar Delaunay refinement algorithms, and produces a high quality mesh. We give explicit estimates for the Hausdorff distance, the normal deviation, and the differences in curvature measures between the surface and the mesh. In contrast to the conventional results based on volumetric Delaunay refinement, our stronger estimates are independent of the mesh structure and directly guarantee the convergence of curvature measures. Meanwhile, our result on Gaussian curvature measure is intrinsic to the Riemannian metric and independent of the embedding. In practice, our meshing algorithm is much easier to implement and much more efficient. The experimental results verified our theoretical results and demonstrated the efficiency of the meshing algorithm. © 2014 IEEE.
Automatic Generation of Algorithms for the Statistical Analysis of Planetary Nebulae Images
Fischer, Bernd
2004-01-01
Analyzing data sets collected in experiments or by observations is a Core scientific activity. Typically, experimentd and observational data are &aught with uncertainty, and the analysis is based on a statistical model of the conjectured underlying processes, The large data volumes collected by modern instruments make computer support indispensible for this. Consequently, scientists spend significant amounts of their time with the development and refinement of the data analysis programs. AutoBayes [GF+02, FS03] is a fully automatic synthesis system for generating statistical data analysis programs. Externally, it looks like a compiler: it takes an abstract problem specification and translates it into executable code. Its input is a concise description of a data analysis problem in the form of a statistical model as shown in Figure 1; its output is optimized and fully documented C/C++ code which can be linked dynamically into the Matlab and Octave environments. Internally, however, it is quite different: AutoBayes derives a customized algorithm implementing the given model using a schema-based process, and then further refines and optimizes the algorithm into code. A schema is a parameterized code template with associated semantic constraints which define and restrict the template s applicability. The schema parameters are instantiated in a problem-specific way during synthesis as AutoBayes checks the constraints against the original model or, recursively, against emerging sub-problems. AutoBayes schema library contains problem decomposition operators (which are justified by theorems in a formal logic in the domain of Bayesian networks) as well as machine learning algorithms (e.g., EM, k-Means) and nu- meric optimization methods (e.g., Nelder-Mead simplex, conjugate gradient). AutoBayes augments this schema-based approach by symbolic computation to derive closed-form solutions whenever possible. This is a major advantage over other statistical data analysis systems
Energy Technology Data Exchange (ETDEWEB)
Etmektzoglou, A; Mishra, P; Svatos, M [Varian Medical Systems, Palo Alto, CA (United States)
2015-06-15
Purpose: To automate creation and delivery of robotic linac trajectories with TrueBeam Developer Mode, an open source spreadsheet-based trajectory generation tool has been developed, tested and made freely available. The computing power inherent in a spreadsheet environment plus additional functions programmed into the tool insulate users from the underlying schema tedium and allow easy calculation, parameterization, graphical visualization, validation and finally automatic generation of Developer Mode XML scripts which are directly loadable on a TrueBeam linac. Methods: The robotic control system platform that allows total coordination of potentially all linac moving axes with beam (continuous, step-and-shoot, or combination thereof) becomes available in TrueBeam Developer Mode. Many complex trajectories are either geometric or can be described in analytical form, making the computational power, graphing and programmability available in a spreadsheet environment an easy and ideal vehicle for automatic trajectory generation. The spreadsheet environment allows also for parameterization of trajectories thus enabling the creation of entire families of trajectories using only a few variables. Standard spreadsheet functionality has been extended for powerful movie-like dynamic graphic visualization of the gantry, table, MLC, room, lasers, 3D observer placement and beam centerline all as a function of MU or time, for analysis of the motions before requiring actual linac time. Results: We used the tool to generate and deliver extended SAD “virtual isocenter” trajectories of various shapes such as parameterized circles and ellipses. We also demonstrated use of the tool in generating linac couch motions that simulate respiratory motion using analytical parameterized functions. Conclusion: The SAGE tool is a valuable resource to experiment with families of complex geometric trajectories for a TrueBeam Linac. It makes Developer Mode more accessible as a vehicle to quickly
Chen, Liang; Tokuda, N
2002-01-01
By exploiting the Fourier series expansion, we have developed a new constructive method of automatically generating a multivariable fuzzy inference system from any given sample set with the resulting multivariable function being constructed within any specified precision to the original sample set. The given sample sets are first decomposed into a cluster of simpler sample sets such that a single input fuzzy system is constructed readily for a sample set extracted directly from the cluster independent of the other variables. Once the relevant fuzzy rules and membership functions are constructed for each of the variables completely independent of the other variables, the resulting decomposed fuzzy rules and membership functions are integrated back into the fuzzy system appropriate for the original sample set requiring only a moderate cost of computation in the required decomposition and composition processes. After proving two basic theorems which we need to ensure the validity of the decomposition and composition processes of the system construction, we have demonstrated a constructive algorithm of a multivariable fuzzy system. Exploiting an implicit error bound analysis available at each of the construction steps, the present Fourier method is capable of implementing a more stable fuzzy system than the power series expansion method of ParNeuFuz and PolyNeuFuz, covering and implementing a wider range of more robust applications.
3D-2D Deformable Image Registration Using Feature-Based Nonuniform Meshes.
Zhong, Zichun; Guo, Xiaohu; Cai, Yiqi; Yang, Yin; Wang, Jing; Jia, Xun; Mao, Weihua
2016-01-01
By using prior information of planning CT images and feature-based nonuniform meshes, this paper demonstrates that volumetric images can be efficiently registered with a very small portion of 2D projection images of a Cone-Beam Computed Tomography (CBCT) scan. After a density field is computed based on the extracted feature edges from planning CT images, nonuniform tetrahedral meshes will be automatically generated to better characterize the image features according to the density field; that is, finer meshes are generated for features. The displacement vector fields (DVFs) are specified at the mesh vertices to drive the deformation of original CT images. Digitally reconstructed radiographs (DRRs) of the deformed anatomy are generated and compared with corresponding 2D projections. DVFs are optimized to minimize the objective function including differences between DRRs and projections and the regularity. To further accelerate the above 3D-2D registration, a procedure to obtain good initial deformations by deforming the volume surface to match 2D body boundary on projections has been developed. This complete method is evaluated quantitatively by using several digital phantoms and data from head and neck cancer patients. The feature-based nonuniform meshing method leads to better results than either uniform orthogonal grid or uniform tetrahedral meshes.
3D-2D Deformable Image Registration Using Feature-Based Nonuniform Meshes
Directory of Open Access Journals (Sweden)
Zichun Zhong
2016-01-01
Full Text Available By using prior information of planning CT images and feature-based nonuniform meshes, this paper demonstrates that volumetric images can be efficiently registered with a very small portion of 2D projection images of a Cone-Beam Computed Tomography (CBCT scan. After a density field is computed based on the extracted feature edges from planning CT images, nonuniform tetrahedral meshes will be automatically generated to better characterize the image features according to the density field; that is, finer meshes are generated for features. The displacement vector fields (DVFs are specified at the mesh vertices to drive the deformation of original CT images. Digitally reconstructed radiographs (DRRs of the deformed anatomy are generated and compared with corresponding 2D projections. DVFs are optimized to minimize the objective function including differences between DRRs and projections and the regularity. To further accelerate the above 3D-2D registration, a procedure to obtain good initial deformations by deforming the volume surface to match 2D body boundary on projections has been developed. This complete method is evaluated quantitatively by using several digital phantoms and data from head and neck cancer patients. The feature-based nonuniform meshing method leads to better results than either uniform orthogonal grid or uniform tetrahedral meshes.
Toolkits for Automatic Service Generation: WATT and Kill-A-WATT
Qu, Y.; Bollig, E. F.; Erlebacher, G.
2007-12-01
As part of the NSF funded VLab consortium [1], we have been involved in the automatic generation of visualization web services using the Web Automation and Translation Toolkit (WATT) compiler. The WATT compiler converts VTK Tcl input scripts into equivalent yet more efficient C++ web services by interpreting code structure, translating and then integrating bindings to the gSOAP library. WATT seeks to completely automate code distribution, integration of transport protocols and interface generation. Ideally, developers should concentrate on writing core applications, and let WATT transform them into web services in the background. Currently, the WATT compiler is limited to converting known Tcl commands and types to C++. For VTK a simple one to one mapping between Tcl and C++ is enforced, but Tcl commands without direct mappings slow the compilation process and require new mappings to be created. Loops and conditional statements are not yet implemented. In an effort to move forward with automation and not get caught up in the details of cross-language compilation, we developed a new application: Kill-A-WATT (KWATT). KWATT is a C++ application that utilizes the C++/Tcl library [2] to evaluate Tcl input scripts using the official Tcl interpreter. During evaluation of the input script, KWATT interprets code structure, integrating communication details via a Tcl-specific SOAP library [3]. Since KWATT drives the Tcl interpreter, the application has access to the full Tcl command base plus the ability to load new commands from other packages. KWATT is not a compiler; instead, it is a stand-alone application that is itself a web service. When KWATT consumes Tcl input, the generated web methods extend the list of previously available commands. This implies that C++ web methods statically defined in KWATT provide a set of standard methods available to every service. Also, since KWATT uses the Tcl interpreter, it has the potential to accept additional Tcl at any time while
Directory of Open Access Journals (Sweden)
M. Varchola
2009-12-01
Full Text Available This paper deals with an evaluation platform for cryptographic True Random Number Generators (TRNGs based on the hardware implementation of statistical tests for FPGAs. It was developed in order to provide an automatic tool that helps to speed up the TRNG design process and can provide new insights on the TRNG behavior as it will be shown on a particular example in the paper. It enables to test sufﬁcient statistical properties of various TRNG designs under various working conditions on the ﬂy. Moreover, the tests are suitable to be embedded into cryptographic hardware products in order to recognize TRNG output of weak quality and thus increase its robustness and reliability. Tests are fully compatible with the FIPS 140 standard and are implemented by the VHDL language as an IP-Core for vendor independent FPGAs. A recent Flash based Actel Fusion FPGA was chosen for preliminary experiments. The Actel version of the tests possesses an interface to the Actel’s CoreMP7 softcore processor that is fully compatible with the industry standard ARM7TDMI. Moreover, identical tests suite was implemented to the Xilinx Virtex 2 and 5 in order to compare the performance of the proposed solution with the performance of already published one based on the same FPGAs. It was achieved 25% and 65% greater clock frequency respectively while consuming almost equal resources of the Xilinx FPGAs. On the top of it, the proposed FIPS 140 architecture is capable of processing one random bit per one clock cycle which results in 311.5 Mbps throughput for Virtex 5 FPGA.
Directory of Open Access Journals (Sweden)
Ole Green
2011-03-01
Full Text Available Progress is constantly being made and new applications are constantly coming out in the area of field robotics. In this paper, a promising application of field robotics in football playing fields is introduced. An algorithmic approach for generating the way points required for the guidance of a GPS-based field robotic through a football playing field to automatically carry out periodical tasks such as cutting the grass field, pitch and line marking illustrations and lawn striping is represented. The manual operation of these tasks requires very skilful personnel able to work for long hours with very high concentration for the football yard to be compatible with standards of Federation Internationale de Football Association (FIFA. In the other side, a GPS-based guided vehicle or robot with three implements; grass mower, lawn stripping roller and track marking illustrator is capable of working 24 h a day, in most weather and in harsh soil conditions without loss of quality. The proposed approach for the automatic operation of football playing fields requires no or very limited human intervention and therefore it saves numerous working hours and free a worker to focus on other tasks. An economic feasibility study showed that the proposed method is economically superimposing the current manual practices.
Dynamic mesh for TCAD modeling with ECORCE
Michez, A.; Boch, J.; Touboul, A.; Saigné, F.
2016-08-01
Mesh generation for TCAD modeling is challenging. Because densities of carriers can change by several orders of magnitude in thin areas, a significant change of the solution can be observed for two very similar meshes. The mesh must be defined at best to minimize this change. To address this issue, a criterion based on polynomial interpolation on adjacent nodes is proposed that adjusts accurately the mesh to the gradients of Degrees of Freedom. Furthermore, a dynamic mesh that follows changes of DF in DC and transient mode is a powerful tool for TCAD users. But, in transient modeling, adding nodes to a mesh induces oscillations in the solution that appears as spikes at the current collected at the contacts. This paper proposes two schemes that solve this problem. Examples show that using these techniques, the dynamic mesh generator of the TCAD tool ECORCE handle semiconductors devices in DC and transient mode.
Directory of Open Access Journals (Sweden)
Dmitry N. Bolotov
2013-01-01
Full Text Available The article deals with the main form of international payment - bank transfer and features when it is charging by banks correspondent fees for transit funds in their correspondent accounts. In order to optimize the cost of expenses for international money transfers there is a need to develop models and toolkit of automatic generation of the total amount of commissions in international interbank settlements. Accordingly, based on graph theory, approach to the construction of the model was developed.
An Automatic Generation System for Examination ID Cards%考场考证自动生成系统
Institute of Scientific and Technical Information of China (English)
杨姝
2001-01-01
The paper describes the feature of the automatic generation system for examination ID cards,the strategy of random scheduling and the main algorithm for creating examination ID cards.%论述了考场考证自动生成系统的特点,随机生成考证的策略及考证生成的主要算法.
AUTOMATIC GENERATION OF SQL TEST CASE SETS%SQL测试用例集的自动生成
Institute of Scientific and Technical Information of China (English)
丁祥武; 张钦; 韩朱忠
2012-01-01
Compiling SQL sentences is an import part for test database management system. Automatic generation of SQL sentences can effectively reduce the workload of the tester. There is almost no automatic tool supporting the direct generation of SQL sentences at present. By simulating the direct derivation process of generative formals the SQL sentences which are generated in accordance with the grammar based on SQL grammars are presented, this is used as the approach for test cases. In the paper we study on the automatic progress from BNF files which are the representation of the grammar to generating SQL test case sets. The process has several stages; Each non-terminals of SQL grammar is converted to a corresponding parse function and the set of all these parse functions forms the rules library. The generative formals of the grammar are traversed to generate SQL test cases automatically. The use of weight arrays in conjunction with stochastic numbers increases the flexibility of test cases generation. Maximum calling times of the non-terminals are employed to terminate the generation of SQL test cases. Through the tool prototype introduced, the SQL test cases in conformity with SQL grammar can be derived.%编写SQL语句是测试数据库管理系统的一个重要部分.自动生成SQL语句可以有效减少测试人员的工作量,而目前没有直接生成SQL语句的自动化工具.通过模拟产生式的直接推导过程,根据SQL文法,给出生成符合该文法的SQL语句,用作测试用例的方法;研究从表示文法的BNF文件生成SQL测试用例集合的自动化过程.这个过程包括几个阶段:将SQL文法的每一个非终结符转换成一个对应的解析函数,所有解析函数的集合构成规则库;遍历文法的产生式自动生成SQL测试用例;使用权值数组结合随机数,加大生成测试用例的灵活性;使用非终结符的最大调用次数来终止SQL测试用例的生成.通过介绍的工具原型,可以得到符合SQL语法的SQL测试用例.
... Prosthetics Hernia Surgical Mesh Implants Hernia Surgical Mesh Implants Share Tweet Linkedin Pin it More sharing options ... majority of tissue used to produce these mesh implants are from a pig (porcine) or cow (bovine) ...
Urogynecologic Surgical Mesh Implants
... Prosthetics Urogynecologic Surgical Mesh Implants Urogynecologic Surgical Mesh Implants Share Tweet Linkedin Pin it More sharing options ... majority of tissue used to produce these mesh implants are from a pig (porcine) or cow (bovine). ...
A semi-automatic multiple view texture mapping for the surface model extracted by laser scanning
Zhang, Zhichao; Huang, Xianfeng; Zhang, Fan; Chang, Yongmin; Li, Deren
2008-12-01
Laser scanning is an effective way to acquire geometry data of the cultural heritage with complex architecture. After generating the 3D model of the object, it's difficult to do the exactly texture mapping for the real object. we take effort to create seamless texture maps for a virtual heritage of arbitrary topology. Texture detail is acquired directly from the real object in a light condition as uniform as we can make. After preprocessing, images are then registered on the 3D mesh by a semi-automatic way. Then we divide the mesh into mesh patches overlapped with each other according to the valid texture area of each image. An optimal correspondence between mesh patches and sections of the acquired images is built. Then, a smoothing approach is proposed to erase the seam between different images that map on adjacent mesh patches, based on texture blending. The obtained result with a Buddha of Dunhuang Mogao Grottoes is presented and discussed.
An automatic method to generate domain-specific investigator networks using PubMed abstracts
Directory of Open Access Journals (Sweden)
Gwinn Marta
2007-06-01
Full Text Available Abstract Background Collaboration among investigators has become critical to scientific research. This includes ad hoc collaboration established through personal contacts as well as formal consortia established by funding agencies. Continued growth in online resources for scientific research and communication has promoted the development of highly networked research communities. Extending these networks globally requires identifying additional investigators in a given domain, profiling their research interests, and collecting current contact information. We present a novel strategy for building investigator networks dynamically and producing detailed investigator profiles using data available in PubMed abstracts. Results We developed a novel strategy to obtain detailed investigator information by automatically parsing the affiliation string in PubMed records. We illustrated the results by using a published literature database in human genome epidemiology (HuGE Pub Lit as a test case. Our parsing strategy extracted country information from 92.1% of the affiliation strings in a random sample of PubMed records and in 97.0% of HuGE records, with accuracies of 94.0% and 91.0%, respectively. Institution information was parsed from 91.3% of the general PubMed records (accuracy 86.8% and from 94.2% of HuGE PubMed records (accuracy 87.0. We demonstrated the application of our approach to dynamic creation of investigator networks by creating a prototype information system containing a large database of PubMed abstracts relevant to human genome epidemiology (HuGE Pub Lit, indexed using PubMed medical subject headings converted to Unified Medical Language System concepts. Our method was able to identify 70–90% of the investigators/collaborators in three different human genetics fields; it also successfully identified 9 of 10 genetics investigators within the PREBIC network, an existing preterm birth research network. Conclusion We successfully created a
Energy Technology Data Exchange (ETDEWEB)
Leal, L.C.; Hermann, O.W.; Bowman, S.M.; Parks, C.V.
1998-04-01
In this report, a methodology is described which serves as an alternative to the SAS2H path of the SCALE system to generate cross sections for point-depletion calculations with the ORIGEN-S code. ARP, Automatic Rapid Processing, is an algorithm that allows the generation of cross-section libraries suitable to the ORIGEN-S code by interpolation over pregenerated SAS2H libraries. The interpolations are carried out on the following variables: burnup, enrichment, and water density. The adequacy of the methodology is evaluated by comparing measured and computed spent fuel isotopic compositions for PWR and BWR systems.
Automatic SAR/optical cross-matching for GCP monograph generation
Nutricato, Raffaele; Morea, Alberto; Nitti, Davide Oscar; La Mantia, Claudio; Agrimano, Luigi; Samarelli, Sergio; Chiaradia, Maria Teresa
2016-10-01
Ground Control Points (GCP), automatically extracted from Synthetic Aperture Radar (SAR) images through 3D stereo analysis, can be effectively exploited for an automatic orthorectification of optical imagery if they can be robustly located in the basic optical images. The present study outlines a SAR/Optical cross-matching procedure that allows a robust alignment of radar and optical images, and consequently to derive automatically the corresponding sub-pixel position of the GCPs in the optical image in input, expressed as fractional pixel/line image coordinates. The cross-matching in performed in two subsequent steps, in order to gradually gather a better precision. The first step is based on the Mutual Information (MI) maximization between optical and SAR chips while the last one uses the Normalized Cross-Correlation as similarity metric. This work outlines the designed algorithmic solution and discusses the results derived over the urban area of Pisa (Italy), where more than ten COSMO-SkyMed Enhanced Spotlight stereo images with different beams and passes are available. The experimental analysis involves different satellite images, in order to evaluate the performances of the algorithm w.r.t. the optical spatial resolution. An assessment of the performances of the algorithm has been carried out, and errors are computed by measuring the distance between the GCP pixel/line position in the optical image, automatically estimated by the tool, and the "true" position of the GCP, visually identified by an expert user in the optical images.
Development of an Automatic Gain Controller Card or Next Generation EDFAs
Institute of Scientific and Technical Information of China (English)
C. Y. Liaw; T. H. Cheng; C. Lu; M.Akiyama; T.Sakai; A.Wada
2003-01-01
This paper describes a low cost automatic gain controller card that provides fast transient gain control to maintain the power of the surviving channels when the number of input channels to an erbium-doped fiber amplifier (EDFA)changes rapidly.
Model-based automatic 3d building model generation by integrating LiDAR and aerial images
Habib, A.; Kwak, E.; Al-Durgham, M.
2011-12-01
Accurate, detailed, and up-to-date 3D building models are important for several applications such as telecommunication network planning, urban planning, and military simulation. Existing building reconstruction approaches can be classified according to the data sources they use (i.e., single versus multi-sensor approaches), the processing strategy (i.e., data-driven, model-driven, or hybrid), or the amount of user interaction (i.e., manual, semiautomatic, or fully automated). While it is obvious that 3D building models are important components for many applications, they still lack the economical and automatic techniques for their generation while taking advantage of the available multi-sensory data and combining processing strategies. In this research, an automatic methodology for building modelling by integrating multiple images and LiDAR data is proposed. The objective of this research work is to establish a framework for automatic building generation by integrating data driven and model-driven approaches while combining the advantages of image and LiDAR datasets.
Meshing Highly Regular Structures: The Case of Super Carbon Nanotubes of Arbitrary Order
Directory of Open Access Journals (Sweden)
Christian Schröppel
2015-01-01
Full Text Available Mesh generation is an important step in many numerical methods. We present the “Hierarchical Graph Meshing” (HGM method as a novel approach to mesh generation, based on algebraic graph theory. The HGM method can be used to systematically construct configurations exhibiting multiple hierarchies and complex symmetry characteristics. The hierarchical description of structures provided by the HGM method can be exploited to increase the efficiency of multiscale and multigrid methods. In this paper, the HGM method is employed for the systematic construction of super carbon nanotubes of arbitrary order, which present a pertinent example of structurally and geometrically complex, yet highly regular, structures. The HGM algorithm is computationally efficient and exhibits good scaling characteristics. In particular, it scales linearly for super carbon nanotube structures and is working much faster than geometry-based methods employing neighborhood search algorithms. Its modular character makes it conducive to automatization. For the generation of a mesh, the information about the geometry of the structure in a given configuration is added in a way that relates geometric symmetries to structural symmetries. The intrinsically hierarchic description of the resulting mesh greatly reduces the effort of determining mesh hierarchies for multigrid and multiscale applications and helps to exploit symmetry-related methods in the mechanical analysis of complex structures.
Chęciński, Jakub; Frankowski, Marek
2016-10-01
We present a tool for fully-automated generation of both simulations configuration files (Mif) and Matlab scripts for automated data analysis, dedicated for Object Oriented Micromagnetic Framework (OOMMF). We introduce extended graphical user interface (GUI) that allows for fast, error-proof and easy creation of Mifs, without any programming skills usually required for manual Mif writing necessary. With MAGE we provide OOMMF extensions for complementing it by mangetoresistance and spin-transfer-torque calculations, as well as local magnetization data selection for output. Our software allows for creation of advanced simulations conditions like simultaneous parameters sweeps and synchronic excitation application. Furthermore, since output of such simulation could be long and complicated we provide another GUI allowing for automated creation of Matlab scripts suitable for analysis of such data with Fourier and wavelet transforms as well as user-defined operations.
Unstructured Polyhedral Mesh Thermal Radiation Diffusion
Energy Technology Data Exchange (ETDEWEB)
Palmer, T.S.; Zika, M.R.; Madsen, N.K.
2000-07-27
Unstructured mesh particle transport and diffusion methods are gaining wider acceptance as mesh generation, scientific visualization and linear solvers improve. This paper describes an algorithm that is currently being used in the KULL code at Lawrence Livermore National Laboratory to solve the radiative transfer equations. The algorithm employs a point-centered diffusion discretization on arbitrary polyhedral meshes in 3D. We present the results of a few test problems to illustrate the capabilities of the radiation diffusion module.
Delaunay triangulation and computational fluid dynamics meshes
Posenau, Mary-Anne K.; Mount, David M.
1992-01-01
In aerospace computational fluid dynamics (CFD) calculations, the Delaunay triangulation of suitable quadrilateral meshes can lead to unsuitable triangulated meshes. Here, we present case studies which illustrate the limitations of using structured grid generation methods which produce points in a curvilinear coordinate system for subsequent triangulations for CFD applications. We discuss conditions under which meshes of quadrilateral elements may not produce a Delaunay triangulation suitable for CFD calculations, particularly with regard to high aspect ratio, skewed quadrilateral elements.
Directory of Open Access Journals (Sweden)
CARVALHO, J. S. C.
2008-12-01
Full Text Available During the development of software one of the most visible risks and perhaps the biggest implementation obstacle relates to the time management. All delivery deadlines software versions must be followed, but it is not always possible, sometimes due to delay in coding. This paper presents a metamodel for software implementation, which will rise to a development tool for automatic generation of source code, in order to make any development pattern transparent to the programmer, significantly reducing the time spent in coding artifacts that make up the software.
Automatic Texture Reconstruction of 3d City Model from Oblique Images
Kang, Junhua; Deng, Fei; Li, Xinwei; Wan, Fang
2016-06-01
In recent years, the photorealistic 3D city models are increasingly important in various geospatial applications related to virtual city tourism, 3D GIS, urban planning, real-estate management. Besides the acquisition of high-precision 3D geometric data, texture reconstruction is also a crucial step for generating high-quality and visually realistic 3D models. However, most of the texture reconstruction approaches are probably leading to texture fragmentation and memory inefficiency. In this paper, we introduce an automatic framework of texture reconstruction to generate textures from oblique images for photorealistic visualization. Our approach include three major steps as follows: mesh parameterization, texture atlas generation and texture blending. Firstly, mesh parameterization procedure referring to mesh segmentation and mesh unfolding is performed to reduce geometric distortion in the process of mapping 2D texture to 3D model. Secondly, in the texture atlas generation step, the texture of each segmented region in texture domain is reconstructed from all visible images with exterior orientation and interior orientation parameters. Thirdly, to avoid color discontinuities at boundaries between texture regions, the final texture map is generated by blending texture maps from several corresponding images. We evaluated our texture reconstruction framework on a dataset of a city. The resulting mesh model can get textured by created texture without resampling. Experiment results show that our method can effectively mitigate the occurrence of texture fragmentation. It is demonstrated that the proposed framework is effective and useful for automatic texture reconstruction of 3D city model.
Automatic generation of the index of productive syntax for child language transcripts.
Hassanali, Khairun-nisa; Liu, Yang; Iglesias, Aquiles; Solorio, Thamar; Dollaghan, Christine
2014-03-01
The index of productive syntax (IPSyn; Scarborough (Applied Psycholinguistics 11:1-22, 1990) is a measure of syntactic development in child language that has been used in research and clinical settings to investigate the grammatical development of various groups of children. However, IPSyn is mostly calculated manually, which is an extremely laborious process. In this article, we describe the AC-IPSyn system, which automatically calculates the IPSyn score for child language transcripts using natural language processing techniques. Our results show that the AC-IPSyn system performs at levels comparable to scores computed manually. The AC-IPSyn system can be downloaded from www.hlt.utdallas.edu/~nisa/ipsyn.html .
Institute of Scientific and Technical Information of China (English)
XU Benzhu; ZHU Jiman; LIU Xiaoping
2012-01-01
Identifying each process and their constraint relations from the complex wiring harness drawings quickly and accurately is the basis for formulating process routes. According to the knowledge of automotive wiring harness and the characteristics of wiring harness components, we established the model of wiring harness graph. Then we research the algorithm of identifying technology processes automatically, finally we describe the relationships between processes by introducing the constraint matrix, which is in or- der to lay a good foundation for harness process planning and production scheduling.
DEFF Research Database (Denmark)
Franz, Michael; Gal, Andreas; Probst, Christian
2006-01-01
As older mainframe architectures become obsolete, the corresponding le- gacy software is increasingly executed via platform emulators running on top of more modern commodity hardware. These emulators are virtual machines that often include a combination of interpreters and just-in-time compilers....... Implementing interpreters and compilers for each combination of emulated and target platform independently of each other is a redundant and error-prone task. We describe an alternative approach that automatically synthesizes specialized virtual-machine interpreters and just-in-time compilers, which...
Automatic Generation of Structural Building Descriptions from 3D Point Cloud Scans
DEFF Research Database (Denmark)
Ochmann, Sebastian; Vock, Richard; Wessel, Raoul
2013-01-01
scans to derive high-level architectural entities like rooms and doors. Starting with a registered 3D point cloud, we probabilistically model the afﬁliation of each measured point to a certain room in the building. We solve the resulting clustering problem using an iterative algorithm that relies......We present a new method for automatic semantic structuring of 3D point clouds representing buildings. In contrast to existing approaches which either target the outside appearance like the facade structure or rather low-level geometric structures, we focus on the building’s interior using indoor...
A Prototype Expert System for Automatic Generation of Image Processing Programs
Institute of Scientific and Technical Information of China (English)
宋茂强; FelixGrimm; 等
1991-01-01
A prototype expert system for generating image processing programs using the subroutine package SPIDER is described in this paper.Based on an interactive dialog,the system can generate a complete application program using SPIDER routines.
Directory of Open Access Journals (Sweden)
Mukta Majumder
2014-12-01
Full Text Available Traditional education cannot meet the expectation and requirement of a Smart City; it require more advance forms like active learning, ICT education etc. Multiple choice questions (MCQs play an important role in educational assessment and active learning which has a key role in Smart City education. MCQs are effective to assess the understanding of well-defined concepts. A fraction of all the sentences of a text contain well-defined concepts or information that can be asked as a MCQ. These informative sentences are required to be identified first for preparing multiple choice questions manually or automatically. In this paper we propose a technique for automatic identification of such informative sentences that can act as the basis of MCQ. The technique is based on parse structure similarity. A reference set of parse structures is compiled with the help of existing MCQs. The parse structure of a new sentence is compared with the reference structures and if similarity is found then the sentence is considered as a potential candidate. Next a rule-based post-processing module works on these potential candidates to select the final set of informative sentences. The proposed approach is tested in sports domain, where many MCQs are easily available for preparing the reference set of structures. The quality of the system selected sentences is evaluated manually. The experimental result shows that the proposed technique is quite promising.
Automatic Extraction of Destinations, Origins and Route Parts from Human Generated Route Directions
Zhang, Xiao; Mitra, Prasenjit; Klippel, Alexander; Maceachren, Alan
Researchers from the cognitive and spatial sciences are studying text descriptions of movement patterns in order to examine how humans communicate and understand spatial information. In particular, route directions offer a rich source of information on how cognitive systems conceptualize movement patterns by segmenting them into meaningful parts. Route directions are composed using a plethora of cognitive spatial organization principles: changing levels of granularity, hierarchical organization, incorporation of cognitively and perceptually salient elements, and so forth. Identifying such information in text documents automatically is crucial for enabling machine-understanding of human spatial language. The benefits are: a) creating opportunities for large-scale studies of human linguistic behavior; b) extracting and georeferencing salient entities (landmarks) that are used by human route direction providers; c) developing methods to translate route directions to sketches and maps; and d) enabling queries on large corpora of crawled/analyzed movement data. In this paper, we introduce our approach and implementations that bring us closer to the goal of automatically processing linguistic route directions. We report on research directed at one part of the larger problem, that is, extracting the three most critical parts of route directions and movement patterns in general: origin, destination, and route parts. We use machine-learning based algorithms to extract these parts of routes, including, for example, destination names and types. We prove the effectiveness of our approach in several experiments using hand-tagged corpora.
DEFF Research Database (Denmark)
Basit, Abdul; Hansen, Anca Daniela; Altin, Müfit
2014-01-01
Transmission system operators have an increased interest in the active participation of wind power plants (WPP) in the power balance control of power systems with large wind power penetration. The emphasis in this study is on the integration of WPPs into the automatic generation control (AGC......) of the power system. The present paper proposes a coordinated control strategy for the AGC between combined heat and power plants (CHPs) and WPPs to enhance the security and the reliability of a power system operation in the case of a large wind power penetration. The proposed strategy, described...... and exemplified for the future Danish power system, takes the hour-ahead regulating power plan for generation and power exchange with neighbouring power systems into account. The performance of the proposed strategy for coordinated secondary control is assessed and discussed by means of simulations for different...
A Solar Automatic Tracking System that Generates Power for Lighting Greenhouses
Directory of Open Access Journals (Sweden)
Qi-Xun Zhang
2015-07-01
Full Text Available In this study we design and test a novel solar tracking generation system. Moreover, we show that this system could be successfully used as an advanced solar power source to generate power in greenhouses. The system was developed after taking into consideration the geography, climate, and other environmental factors of northeast China. The experimental design of this study included the following steps: (i the novel solar tracking generation system was measured, and its performance was analyzed; (ii the system configuration and operation principles were evaluated; (iii the performance of this power generation system and the solar irradiance were measured according to local time and conditions; (iv the main factors affecting system performance were analyzed; and (v the amount of power generated by the solar tracking system was compared with the power generated by fixed solar panels. The experimental results indicated that compared to the power generated by fixed solar panels, the solar tracking system generated about 20% to 25% more power. In addition, the performance of this novel power generating system was found to be closely associated with solar irradiance. Therefore, the solar tracking system provides a new approach to power generation in greenhouses.
MeshEZW: an image coder using mesh and finite elements
Landais, Thomas; Bonnaud, Laurent; Chassery, Jean-Marc
2003-08-01
In this paper, we present a new method to compress the information in an image, called MeshEZW. The proposed approach is based on the finite elements method, a mesh construction and a zerotree method. The zerotree method is an adaptive of the EZW algorithm with two new symbols for increasing the performance. These steps allow a progressive representation of the image by the automatic construction of a bitstream. The mesh structure is adapted to the image compression domain and is defined to allow video comrpession. The coder is described and some preliminary results are discussed.
Margraf, Johannes T; Ranasinghe, Duminda S; Bartlett, Rodney J
2017-03-31
In this contribution, we discuss how reaction energy benchmark sets can automatically be created from arbitrary atomization energy databases. As an example, over 11 000 reaction energies derived from the W4-11 database, as well as some relevant subsets are reported. Importantly, there is only very modest computational overhead involved in computing >11 000 reaction energies compared to 140 atomization energies, since the rate-determining step for either benchmark is performing the same 140 quantum chemical calculations. The performance of commonly used electronic structure methods for the new database is analyzed. This allows investigating the relationship between the performances for atomization and reaction energy benchmarks based on an identical set of molecules. The atomization energy is found to be a weak predictor for the overall usefulness of a method. The performance of density functional approximations in light of the number of empirically optimized parameters used in their design is also discussed.
Curwin, J H; Roelke, M; Ruskin, J N
1996-01-01
The diagnostic accuracy of implantable cardioverter defibrillators may be improved by automatically adjusting gain algorithms, which in general reduce the likelihood of oversensing while maintaining the ability to detect the low amplitude signals associated with ventricular fibrillation. We present a patient with a third-generation device who developed prolonged ventricular asystole arising as a complication of the automatic gain feature. During asystole the device automatically increased sensitivity in order to prevent undersensing of ventricular fibrillation, which in this case resulted in far-field sensing of atrial activity and inhibition of ventricular pacing.
Altyntsev, M. A.; Arbuzov, S. A.; Popov, R. A.; Tsoi, G. V.; Gromov, M. O.
2016-06-01
A dense digital surface model is one of the products generated by using UAV aerial survey data. Today more and more specialized software are supplied with modules for generating such kind of models. The procedure for dense digital model generation can be completely or partly automated. Due to the lack of reliable criterion of accuracy estimation it is rather complicated to judge the generation validity of such models. One of such criterion can be mobile laser scanning data as a source for the detailed accuracy estimation of the dense digital surface model generation. These data may be also used to estimate the accuracy of digital orthophoto plans created by using UAV aerial survey data. The results of accuracy estimation for both kinds of products are presented in the paper.
Pei Ping; YURY N. PETRENKO
2015-01-01
A Mesh network simulation framework which provides a powerful and concise modeling chain for a network structure will be introduce in this report. Mesh networks has a special topologic structure. The paper investigates a message transfer in wireless mesh network simulation and how does it works in cellular network simulation. Finally the experimental result gave us the information that mesh networks have different principle in transmission way with cellular networks in transmission, and multi...
Connectivity editing for quadrilateral meshes
Peng, Chihan
2011-12-01
We propose new connectivity editing operations for quadrilateral meshes with the unique ability to explicitly control the location, orientation, type, and number of the irregular vertices (valence not equal to four) in the mesh while preserving sharp edges. We provide theoretical analysis on what editing operations are possible and impossible and introduce three fundamental operations to move and re-orient a pair of irregular vertices. We argue that our editing operations are fundamental, because they only change the quad mesh in the smallest possible region and involve the fewest irregular vertices (i.e., two). The irregular vertex movement operations are supplemented by operations for the splitting, merging, canceling, and aligning of irregular vertices. We explain how the proposed high-level operations are realized through graph-level editing operations such as quad collapses, edge flips, and edge splits. The utility of these mesh editing operations are demonstrated by improving the connectivity of quad meshes generated from state-of-art quadrangulation techniques.
Connectivity editing for quadrilateral meshes
Peng, Chihan
2011-12-12
We propose new connectivity editing operations for quadrilateral meshes with the unique ability to explicitly control the location, orientation, type, and number of the irregular vertices (valence not equal to four) in the mesh while preserving sharp edges. We provide theoretical analysis on what editing operations are possible and impossible and introduce three fundamental operations to move and re-orient a pair of irregular vertices. We argue that our editing operations are fundamental, because they only change the quad mesh in the smallest possible region and involve the fewest irregular vertices (i.e., two). The irregular vertex movement operations are supplemented by operations for the splitting, merging, canceling, and aligning of irregular vertices. We explain how the proposed highlevel operations are realized through graph-level editing operations such as quad collapses, edge flips, and edge splits. The utility of these mesh editing operations are demonstrated by improving the connectivity of quad meshes generated from state-of-art quadrangulation techniques. © 2011 ACM.
Akilan, A.; Nagasubramanian, V.; Chaudhry, A.; Reddy, D. Rajesh; Sudheer Reddy, D.; Usha Devi, R.; Tirupati, T.; Radhadevi, P. V.; Varadan, G.
2014-11-01
Block Adjustment is a technique for large area mapping for images obtained from different remote sensingsatellites.The challenge in this process is to handle huge number of satellite imageries from different sources with different resolution and accuracies at the system level. This paper explains a system with various tools and techniques to effectively handle the end-to-end chain in large area mapping and production with good level of automation and the provisions for intuitive analysis of final results in 3D and 2D environment. In addition, the interface for using open source ortho and DEM references viz., ETM, SRTM etc. and displaying ESRI shapes for the image foot-prints are explained. Rigorous theory, mathematical modelling, workflow automation and sophisticated software engineering tools are included to ensure high photogrammetric accuracy and productivity. Major building blocks like Georeferencing, Geo-capturing and Geo-Modelling tools included in the block adjustment solution are explained in this paper. To provide optimal bundle block adjustment solution with high precision results, the system has been optimized in many stages to exploit the full utilization of hardware resources. The robustness of the system is ensured by handling failure in automatic procedure and saving the process state in every stage for subsequent restoration from the point of interruption. The results obtained from various stages of the system are presented in the paper.
Directory of Open Access Journals (Sweden)
Sabita Chaine
2015-05-01
Full Text Available This work presents a methodology adopted in order to tune the controller parameters of superconducting magnetic energy storage (SMES system in the automatic generation control (AGC of a two-area thermal power system. The gains of integral controllers of AGC loop, proportional controller of SMES loop and gains of the current feedback loop of the inductor in SMES are optimized simultaneously in order to achieve a desired performance. Recently proposed intelligent technique based algorithm known as Cuckoo search algorithm (CSA is applied for optimization. Sensitivity and robustness of the tuned gains tested at different operating conditions prove the effectiveness of fast acting energy storage devices like SMES in damping out oscillations in power system when their controllers are properly tuned.
Automatic landmark generation for deformable image registration evaluation for 4D CT images of lung
Vickress, J.; Battista, J.; Barnett, R.; Morgan, J.; Yartsev, S.
2016-10-01
Deformable image registration (DIR) has become a common tool in medical imaging across both diagnostic and treatment specialties, but the methods used offer varying levels of accuracy. Evaluation of DIR is commonly performed using manually selected landmarks, which is subjective, tedious and time consuming. We propose a semi-automated method that saves time and provides accuracy comparable to manual selection. Three landmarking methods including manual (with two independent observers), scale invariant feature transform (SIFT), and SIFT with manual editing (SIFT-M) were tested on 10 thoracic 4DCT image studies corresponding to the 0% and 50% phases of respiration. Results of each method were evaluated against a gold standard (GS) landmark set comparing both mean and proximal landmark displacements. The proximal method compares the local deformation magnitude between a test landmark pair and the closest GS pair. Statistical analysis was done using an intra class correlation (ICC) between test and GS displacement values. The creation time per landmark pair was 22, 34, 2.3, and 4.3 s for observers 1 and 2, SIFT, and SIFT-M methods respectively. Across 20 lungs from the 10 CT studies, the ICC values between the GS and observer 1 and 2, SIFT, and SIFT-M methods were 0.85, 0.85, 0.84, and 0.82 for mean lung deformation, and 0.97, 0.98, 0.91, and 0.96 for proximal landmark deformation, respectively. SIFT and SIFT-M methods have an accuracy that is comparable to manual methods when tested against a GS landmark set while saving 90% of the time. The number and distribution of landmarks significantly affected the analysis as manifested by the different results for mean deformation and proximal landmark deformation methods. Automatic landmark methods offer a promising alternative to manual landmarking, if the quantity, quality and distribution of landmarks can be optimized for the intended application.
Institute of Scientific and Technical Information of China (English)
WANG Yu-xin; LI Yu-tong
2014-01-01
The development of new products of high quality, low unit cost, and short lead time to market are the key elements required for any enterprise to obtain a competitive advantage. For shorting the lead time to market and improving the creativity and performances of the product, a rule-based conceptual design approach and a methodology to simulate the conceptual design results generated in conceptual design process in automatical virtual entity form are presented in this paper. This part of paper presents a rule-based conceptual design method for generating creative conceptual design schemes of mechanisms based on Yan’s kinematic chain regeneration creative design method. The design rules are adopted to describe the design requirements of the functional characteristics, the connection relationships and topological characteristics among mechanisms. Through the graphs-based reasoning process, the conceptual design space is expanded extremely, and the potential creative conceptual design results are then dug out. By refining the design rules, the solution exploration problem is avioded, and the tendentious conceptual design schemes are generated. Since mechanical, electrical and hydraulic subsystems can be transformed into general mechansims, the conceptual design method presented in this paper can also be applied in the conceptual design problem of complex mechatronic systems. And then the method to identify conceptual design schemes is given.
MacLeod, Matthew K
2015-01-01
Analytical nuclear gradients for fully internally contracted complete active space second-order perturbation theory (CASPT2) are reported. This implementation has been realized by an automated code generator that can handle spin-free formulas for the CASPT2 energy and its derivatives with respect to variations of molecular orbitals and reference coefficients. The underlying complete active space self-consistent field and the so-called Z-vector equations are solved using density fitting. With full internal contraction the size of first-order wave functions scales polynomially with the number of active orbitals. The CASPT2 gradient program and the code generator are both publicly available. This work enables the CASPT2 geometry optimization of molecules as complex as those investigated by respective single-point calculations.
Extending a User Interface Prototyping Tool with Automatic MISRA C Code Generation
Directory of Open Access Journals (Sweden)
Gioacchino Mauro
2017-01-01
Full Text Available We are concerned with systems, particularly safety-critical systems, that involve interaction between users and devices, such as the user interface of medical devices. We therefore developed a MISRA C code generator for formal models expressed in the PVSio-web prototyping toolkit. PVSio-web allows developers to rapidly generate realistic interactive prototypes for verifying usability and safety requirements in human-machine interfaces. The visual appearance of the prototypes is based on a picture of a physical device, and the behaviour of the prototype is defined by an executable formal model. Our approach transforms the PVSio-web prototyping tool into a model-based engineering toolkit that, starting from a formally verified user interface design model, will produce MISRA C code that can be compiled and linked into a final product. An initial validation of our tool is presented for the data entry system of an actual medical device.
A tool for automatic generation of RTL-level VHDL description of RNS FIR filters
DEFF Research Database (Denmark)
Re, Andrea Del; Nannarelli, Alberto; Re, Marco
2004-01-01
Although digital filters based on the Residue Number System (RNS) show high performance and low power dissipation, RNS filters are not widely used in DSP systems, because of the complexity of the algorithms involved. We present a tool to design RNS FIR filters which hides the RNS algorithms to th...... to the designer, and generates a synthesizable VHDL description of the filter taking into account several design constraints such as: delay, area and energy....
GUDM: Automatic Generation of Unified Datasets for Learning and Reasoning in Healthcare.
Ali, Rahman; Siddiqi, Muhammad Hameed; Idris, Muhammad; Ali, Taqdir; Hussain, Shujaat; Huh, Eui-Nam; Kang, Byeong Ho; Lee, Sungyoung
2015-07-02
A wide array of biomedical data are generated and made available to healthcare experts. However, due to the diverse nature of data, it is difficult to predict outcomes from it. It is therefore necessary to combine these diverse data sources into a single unified dataset. This paper proposes a global unified data model (GUDM) to provide a global unified data structure for all data sources and generate a unified dataset by a "data modeler" tool. The proposed tool implements user-centric priority based approach which can easily resolve the problems of unified data modeling and overlapping attributes across multiple datasets. The tool is illustrated using sample diabetes mellitus data. The diverse data sources to generate the unified dataset for diabetes mellitus include clinical trial information, a social media interaction dataset and physical activity data collected using different sensors. To realize the significance of the unified dataset, we adopted a well-known rough set theory based rules creation process to create rules from the unified dataset. The evaluation of the tool on six different sets of locally created diverse datasets shows that the tool, on average, reduces 94.1% time efforts of the experts and knowledge engineer while creating unified datasets.
GUDM: Automatic Generation of Unified Datasets for Learning and Reasoning in Healthcare
Directory of Open Access Journals (Sweden)
Rahman Ali
2015-07-01
Full Text Available A wide array of biomedical data are generated and made available to healthcare experts. However, due to the diverse nature of data, it is difficult to predict outcomes from it. It is therefore necessary to combine these diverse data sources into a single unified dataset. This paper proposes a global unified data model (GUDM to provide a global unified data structure for all data sources and generate a unified dataset by a “data modeler” tool. The proposed tool implements user-centric priority based approach which can easily resolve the problems of unified data modeling and overlapping attributes across multiple datasets. The tool is illustrated using sample diabetes mellitus data. The diverse data sources to generate the unified dataset for diabetes mellitus include clinical trial information, a social media interaction dataset and physical activity data collected using different sensors. To realize the significance of the unified dataset, we adopted a well-known rough set theory based rules creation process to create rules from the unified dataset. The evaluation of the tool on six different sets of locally created diverse datasets shows that the tool, on average, reduces 94.1% time efforts of the experts and knowledge engineer while creating unified datasets.
DEFF Research Database (Denmark)
Gilpin, Andrew G.; Sandholm, Tuomas; Sørensen, Troels Bjerre
2008-01-01
choices in the game. Second, we employ potential-aware automated abstraction algorithms for identifying strategically similar situations in order to decrease the size of the game tree. Third, we develop a new technique for automatically generating the source code of an equilibrium-finding algorithm from...... an XML-based description of a game. This automatically generated program is more efficient than what would be possible with a general-purpose equilibrium-finding program. Finally, we present results from the AAAI-07 Computer Poker Competition, in which Tartanian placed second out of ten entries....
Office OperationTest Generation and Automatic Judgment of C# Language%Office操作题生成与自动判分的C#语言实现
Institute of Scientific and Technical Information of China (English)
高上雄
2014-01-01
Through the paperless examination of Office operation test generation and automatic judgment analysis, this paper uses the test operation test generation C/S architecture for Word and Excelland automatic judgment realization are discussed using C# language.%通过针对无纸化考试中Office操作题生成与自动判分的分析，该文采用C#语言采用C/S构架对Word及Excel的操作考试试题生成与自动判分的实现进行探讨。
Energy Technology Data Exchange (ETDEWEB)
MacLeod, Matthew K.; Shiozaki, Toru [Department of Chemistry, Northwestern University, 2145 Sheridan Rd., Evanston, Illinois 60208 (United States)
2015-02-07
Analytical nuclear gradients for fully internally contracted complete active space second-order perturbation theory (CASPT2) are reported. This implementation has been realized by an automated code generator that can handle spin-free formulas for the CASPT2 energy and its derivatives with respect to variations of molecular orbitals and reference coefficients. The underlying complete active space self-consistent field and the so-called Z-vector equations are solved using density fitting. The implementation has been applied to the vertical and adiabatic ionization potentials of the porphin molecule to illustrate its capability.
Automatically Augmenting Lifelog Events Using Pervasively Generated Content from Millions of People
Directory of Open Access Journals (Sweden)
Alan F. Smeaton
2010-02-01
Full Text Available In sensor research we take advantage of additional contextual sensor information to disambiguate potentially erroneous sensor readings or to make better informed decisions on a single sensor’s output. This use of additional information reinforces, validates, semantically enriches, and augments sensed data. Lifelog data is challenging to augment, as it tracks one’s life with many images including the places they go, making it non-trivial to find associated sources of information. We investigate realising the goal of pervasive user-generated content based on sensors, by augmenting passive visual lifelogs with “Web 2.0” content collected by millions of other individuals.
Energy Technology Data Exchange (ETDEWEB)
Coimbra, Carlos F. M. [Univ. of California, San Diego, CA (United States
2016-02-25
In this project we address multiple resource integration challenges associated with increasing levels of solar penetration that arise from the variability and uncertainty in solar irradiance. We will model the SMUD service region as its own balancing region, and develop an integrated, real-time operational tool that takes solar-load forecast uncertainties into consideration and commits optimal energy resources and reserves for intra-hour and intra-day decisions. The primary objectives of this effort are to reduce power system operation cost by committing appropriate amount of energy resources and reserves, as well as to provide operators a prediction of the generation fleet’s behavior in real time for realistic PV penetration scenarios. The proposed methodology includes the following steps: clustering analysis on the expected solar variability per region for the SMUD system, Day-ahead (DA) and real-time (RT) load forecasts for the entire service areas, 1-year of intra-hour CPR forecasts for cluster centers, 1-year of smart re-forecasting CPR forecasts in real-time for determination of irreducible errors, and uncertainty quantification for integrated solar-load for both distributed and central stations (selected locations within service region) PV generation.
Automatic Generation of High Quality DSM Based on IRS-P5 Cartosat-1 Stereo Data
d'Angelo, Pablo; Uttenthaler, Andreas; Carl, Sebastian; Barner, Frithjof; Reinartz, Peter
2010-12-01
IRS-P5 Cartosat-1 high resolution stereo satellite imagery is well suited for the creation of digital surface models (DSM). A system for highly automated and operational DSM and orthoimage generation based on IRS-P5 Cartosat-1 imagery is presented, with an emphasis on automated processing and product quality. The proposed system processes IRS-P5 level-1 stereo scenes using the rational polynomial coefficients (RPC) universal sensor model. The described method uses an RPC correction based on DSM alignment instead of using reference images with a lower lateral accuracy, this results in improved geolocation of the DSMs and orthoimages. Following RPC correction, highly detailed DSMs with 5 m grid spacing are derived using Semiglobal Matching. The proposed method is part of an operational Cartosat-1 processor for the generation of a high resolution DSM. Evaluation of 18 scenes against independent ground truth measurements indicates a mean lateral error (CE90) of 6.7 meters and a mean vertical accuracy (LE90) of 5.1 meters.
Directory of Open Access Journals (Sweden)
Abdul Basit
2014-10-01
Full Text Available Transmission system operators have an increased interest in the active participation of wind power plants (WPP in the power balance control of power systems with large wind power penetration. The emphasis in this study is on the integration of WPPs into the automatic generation control (AGC of the power system. The present paper proposes a coordinated control strategy for the AGC between combined heat and power plants (CHPs and WPPs to enhance the security and the reliability of a power system operation in the case of a large wind power penetration. The proposed strategy, described and exemplified for the future Danish power system, takes the hour-ahead regulating power plan for generation and power exchange with neighbouring power systems into account. The performance of the proposed strategy for coordinated secondary control is assessed and discussed by means of simulations for different possible future scenarios, when wind power production in the power system is high and conventional production from CHPs is at a minimum level. The investigation results of the proposed control strategy have shown that the WPPs can actively help the AGC, and reduce the real-time power imbalance in the power system, by down regulating their production when CHPs are unable to provide the required response.
Design of a variable width pulse generator feasible for manual or automatic control
Vegas, I.; Antoranz, P.; Miranda, J. M.; Franco, F. J.
2017-01-01
A variable width pulse generator featuring more than 4-V peak amplitude and less than 10-ns FWHM is described. In this design the width of the pulses is controlled by means of the control signal slope. Thus, a variable transition time control circuit (TTCC) is also developed, based on the charge and discharge of a capacitor by means of two tunable current sources. Additionally, it is possible to activate/deactivate the pulses when required, therefore allowing the creation of any desired pulse pattern. Furthermore, the implementation presented here can be electronically controlled. In conclusion, due to its versatility, compactness and low cost it can be used in a wide variety of applications.
Optimization of automatically generated multi-core code for the LTE RACH-PD algorithm
Pelcat, Maxime; Nezan, Jean François
2008-01-01
Embedded real-time applications in communication systems require high processing power. Manual scheduling devel-oped for single-processor applications is not suited to multi-core architectures. The Algorithm Architecture Matching (AAM) methodology optimizes static application implementation on multi-core architectures. The Random Access Channel Preamble Detection (RACH-PD) is an algorithm for non-synchronized access of Long Term Evolu-tion (LTE) wireless networks. LTE aims to improve the spectral efficiency of the next generation cellular system. This paper de-scribes a complete methodology for implementing the RACH-PD. AAM prototyping is applied to the RACH-PD which is modelled as a Synchronous DataFlow graph (SDF). An efficient implemen-tation of the algorithm onto a multi-core DSP, the TI C6487, is then explained. Benchmarks for the solution are given.
2015-01-01
With the advances in mobile computing technologies and the growth of the Net, mobile mesh networks are going through a set of important evolutionary steps. In this paper, we survey architectural aspects of mobile mesh networks and their use cases and deployment models. Also, we survey challenging areas of mobile mesh networks and describe our vision of promising mobile services. This paper presents a basic introductory material for Masters of Open Information Technologies Lab, interested in m...
Safdari, Reza; Mokhtaran, Mehrshad; Tahmasebian, Shahram
2016-01-01
Introduction: Electronic medical records as one of major parts of electronic health records is an important application of Medical Informatics. EMR includes different types of data, Graphical items being one of these data types. To this end, a standard structure for storing and recovering and finally exchanging this data type is required. In order to standardize information items in this research, UMLS standard is used. In this research, graphical information from fondues designing in retina surgery forms is used for the task of implementation. Implementation: Three-layer software architecture is used for implementation of this system, which includes user interface, data base access and business logic. XML database is used for storing and exchanging of data. User interface is designed by the means of Adobe Flash. Also in the user interface for eye examinations, appropriate icons compatible with current pathologies in retina examinations are considered and UMLS codes are used for standardizations purposes. Results: As this project is independently implemented in Adobe Flash, it can be run in most of electronic patient records software. For evaluation purposes of this research, an EMR system for eye clinics is used. Tree structure is used for data entry and finally a text report based on the entered data will be generated. By storing graphical items in this software editing and searching in medical concepts and also comparing features will be available. Conclusion: One of the data items that we encounter in various medical records is graphical data. In order to cover the patient’s complete electronic medical records, the Electronic Implementation of this information is important. For this purpose, graphical items in retina surgery forms were used and finally a software application for drawing retina picture was developed. Also, XML files were used for the purpose of storing valuable medical data from the pictures, and also UMLS were applied for the standardization
Directory of Open Access Journals (Sweden)
Rabindra Kumar Sahu
2016-03-01
Full Text Available This paper presents the design and analysis of Proportional-Integral-Double Derivative (PIDD controller for Automatic Generation Control (AGC of multi-area power systems with diverse energy sources using Teaching Learning Based Optimization (TLBO algorithm. At first, a two-area reheat thermal power system with appropriate Generation Rate Constraint (GRC is considered. The design problem is formulated as an optimization problem and TLBO is employed to optimize the parameters of the PIDD controller. The superiority of the proposed TLBO based PIDD controller has been demonstrated by comparing the results with recently published optimization technique such as hybrid Firefly Algorithm and Pattern Search (hFA-PS, Firefly Algorithm (FA, Bacteria Foraging Optimization Algorithm (BFOA, Genetic Algorithm (GA and conventional Ziegler Nichols (ZN for the same interconnected power system. Also, the proposed approach has been extended to two-area power system with diverse sources of generation like thermal, hydro, wind and diesel units. The system model includes boiler dynamics, GRC and Governor Dead Band (GDB non-linearity. It is observed from simulation results that the performance of the proposed approach provides better dynamic responses by comparing the results with recently published in the literature. Further, the study is extended to a three unequal-area thermal power system with different controllers in each area and the results are compared with published FA optimized PID controller for the same system under study. Finally, sensitivity analysis is performed by varying the system parameters and operating load conditions in the range of ±25% from their nominal values to test the robustness.
Aydın, Ferhat; Hüsünbeyi, Zehra Melce; Özgür, Arzucan
2017-01-01
Information regarding the physical interactions among proteins is crucial, since protein–protein interactions (PPIs) are central for many biological processes. The experimental techniques used to verify PPIs are vital for characterizing and assessing the reliability of the identified PPIs. A lot of information about PPIs and the experimental methods are only available in the text of the scientific publications that report them. In this study, we approach the problem of identifying passages with experimental methods for physical interactions between proteins as an information retrieval search task. The baseline system is based on query matching, where the queries are generated by utilizing the names (including synonyms) of the experimental methods in the Proteomics Standard Initiative–Molecular Interactions (PSI-MI) ontology. We propose two methods, where the baseline queries are expanded by including additional relevant terms. The first method is a supervised approach, where the most salient terms for each experimental method are obtained by using the term frequency–relevance frequency (tf.rf) metric over 13 articles from our manually annotated data set of 30 full text articles, which is made publicly available. On the other hand, the second method is an unsupervised approach, where the queries for each experimental method are expanded by using the word embeddings of the names of the experimental methods in the PSI-MI ontology. The word embeddings are obtained by utilizing a large unlabeled full text corpus. The proposed methods are evaluated on the test set consisting of 17 articles. Both methods obtain higher recall scores compared with the baseline, with a loss in precision. Besides higher recall, the word embeddings based approach achieves higher F-measure than the baseline and the tf.rf based methods. We also show that incorporating gene name and interaction keyword identification leads to improved precision and F-measure scores for all three evaluated
一种实用的输电网潮流图自动生成算法%A Practical Automatic Generation Algorithm of Power Flow Diagram
Institute of Scientific and Technical Information of China (English)
徐丽燕; 陈文静; 苏运光; 孙云枫
2015-01-01
Based on the general characteristics of the electricity transmission grid trend diagram ,this paper comprehensively studies a variety of automatic layout and wiring method ,proposes a practical electricity transmission grid trend chart automatic generation algorithm ,and has set up an experiment to verify its effectiveness.%文章针对输电网潮流图的一般特点,综合研究了多种自动布局与布线方法,提出了一种实用性较强的输电网潮流图自动生成算法,并已通过实验验证其有效性.
Kasagi, M; Fujita, K; Tsuji, M; Takewaki, I
2016-02-01
A base-isolated building may sometimes exhibit an undesirable large response to a long-duration, long-period earthquake ground motion and a connected building system without base-isolation may show a large response to a near-fault (rather high-frequency) earthquake ground motion. To overcome both deficiencies, a new hybrid control system of base-isolation and building-connection is proposed and investigated. In this new hybrid building system, a base-isolated building is connected to a stiffer free wall with oil dampers. It has been demonstrated in a preliminary research that the proposed hybrid system is effective both for near-fault (rather high-frequency) and long-duration, long-period earthquake ground motions and has sufficient redundancy and robustness for a broad range of earthquake ground motions.An automatic generation algorithm of this kind of smart structures of base-isolation and building-connection hybrid systems is presented in this paper. It is shown that, while the proposed algorithm does not work well in a building without the connecting-damper system, it works well in the proposed smart hybrid system with the connecting damper system.
Directory of Open Access Journals (Sweden)
M. Kasagi
2016-02-01
Full Text Available A base-isolated building may sometimes exhibit an undesirable large response to a long-duration, long-period earthquake ground motion and a connected building system without base-isolation may show a large response to a near-fault (rather high-frequency earthquake ground motion. To overcome both deficiencies, a new hybrid control system of base-isolation and building-connection is proposed and investigated. In this new hybrid building system, a base-isolated building is connected to a stiffer free wall with oil dampers. It has been demonstrated in a preliminary research that the proposed hybrid system is effective both for near-fault (rather high-frequency and long-duration, long-period earthquake ground motions and has sufficient redundancy and robustness for a broad range of earthquake ground motions.An automatic generation algorithm of this kind of smart structures of base-isolation and building-connection hybrid systems is presented in this paper. It is shown that, while the proposed algorithm does not work well in a building without the connecting-damper system, it works well in the proposed smart hybrid system with the connecting damper system.
CAV_KO: a Simple 1-D Langrangian Hydrocode for MS EXCEL™ with Automatic Generation of X-T Diagrams
Tsembelis, K.; Ramsden, B.; Proud, W. G.; Borg, J.
2007-12-01
Hydrocodes are widely used to predict or simulate highly dynamic and transient events such as blast and impact. Codes such as GRIM, CTH or AUTODYN are well developed and involve complex numerical methods and in many cases require a large computing infrastructure. In this paper we present a simple 1-D Langrangian hydrocode developed at the University of Cambridge, called CAV_KO written in Visual Basic. The motivation being to produce a code which, while being relatively simple, is useful for both experimental planning and teaching. The code has been adapted from the original KO code written in FORTRAN by J. Borg, which, in turn, is based on the algorithm developed by Wilkins [1]. The developed GUI within MS Excel™ and the automatic generation of x-t diagrams allow CAV_KO to be a useful tool for quick calculations of plate impact events and teaching purposes. The VB code is licensed under the GNU General Public License and a MS Excel™ spreadsheet containing the code can be downloaded from www.shockphysics.com together with a copy of the user guide.
Robust moving mesh algorithms for hybrid stretched meshes: Application to moving boundaries problems
Landry, Jonathan; Soulaïmani, Azzeddine; Luke, Edward; Ben Haj Ali, Amine
2016-12-01
A robust Mesh-Mover Algorithm (MMA) approach is designed to adapt meshes of moving boundaries problems. A new methodology is developed from the best combination of well-known algorithms in order to preserve the quality of initial meshes. In most situations, MMAs distribute mesh deformation while preserving a good mesh quality. However, invalid meshes are generated when the motion is complex and/or involves multiple bodies. After studying a few MMA limitations, we propose the following approach: use the Inverse Distance Weighting (IDW) function to produce the displacement field, then apply the Geometric Element Transformation Method (GETMe) smoothing algorithms to improve the resulting mesh quality, and use an untangler to revert negative elements. The proposed approach has been proven efficient to adapt meshes for various realistic aerodynamic motions: a symmetric wing that has suffered large tip bending and twisting and the high-lift components of a swept wing that has moved to different flight stages. Finally, the fluid flow problem has been solved on meshes that have moved and they have produced results close to experimental ones. However, for situations where moving boundaries are too close to each other, more improvements need to be made or other approaches should be taken, such as an overset grid method.
LOAD AWARE ADAPTIVE BACKBONE SYNTHESIS IN WIRELESS MESH NETWORKS
Institute of Scientific and Technical Information of China (English)
Yuan Yuan; Zheng Baoyu
2009-01-01
Wireless Mesh Networks (WMNs) are envisioned to support the wired backbone with a wireless Backbone Networks (BNet) for providing internet connectivity to large-scale areas.With a wide range of internet-oriented applications with different Quality of Service (QoS) requirement,the large-scale WMNs should have good scalability and large bandwidth.In this paper,a Load Aware Adaptive Backbone Synthesis (LAABS) algorithm is proposed to automatically balance the traffic flow in the WMNs.The BNet will dynamically split into smaller size or merge into bigger one according to statistic load information of Backbone Nodes (BNs).Simulation results show LAABS generates moderate BNet size and converges quickly,thus providing scalable and stable BNet to facilitate traffic flow.
2011-11-01
triangles in two dimensions and tetrahedra ( tets ) in three dimensions. There are many other ways to discretize a region using unstructured meshes, but this...The boundary points associated with the airfoil surface were moved, but all of the interior points remained stationary , which resulted in a mesh
An Adaptive Mesh Algorithm: Mapping the Mesh Variables
Energy Technology Data Exchange (ETDEWEB)
Scannapieco, Anthony J. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2016-07-25
Both thermodynamic and kinematic variables must be mapped. The kinematic variables are defined on a separate kinematic mesh; it is the duel mesh to the thermodynamic mesh. The map of the kinematic variables is done by calculating the contributions of kinematic variables on the old thermodynamic mesh, mapping the kinematic variable contributions onto the new thermodynamic mesh and then synthesizing the mapped kinematic variables on the new kinematic mesh. In this document the map of the thermodynamic variables will be described.
21st International Meshing Roundtable
Weill, Jean-Christophe
2013-01-01
This volume contains the articles presented at the 21st International Meshing Roundtable (IMR) organized, in part, by Sandia National Laboratories and was held on October 7–10, 2012 in San Jose, CA, USA. The first IMR was held in 1992, and the conference series has been held annually since. Each year the IMR brings together researchers, developers, and application experts in a variety of disciplines, from all over the world, to present and discuss ideas on mesh generation and related topics. The technical papers in this volume present theoretical and novel ideas and algorithms with practical potential, as well as technical applications in science and engineering, geometric modeling, computer graphics, and visualization.
Numerical modeling of seismic waves using frequency-adaptive meshes
Hu, Jinyin; Jia, Xiaofeng
2016-08-01
An improved modeling algorithm using frequency-adaptive meshes is applied to meet the computational requirements of all seismic frequency components. It automatically adopts coarse meshes for low-frequency computations and fine meshes for high-frequency computations. The grid intervals are adaptively calculated based on a smooth inversely proportional function of grid size with respect to the frequency. In regular grid-based methods, the uniform mesh or non-uniform mesh is used for frequency-domain wave propagators and it is fixed for all frequencies. A too coarse mesh results in inaccurate high-frequency wavefields and unacceptable numerical dispersion; on the other hand, an overly fine mesh may cause storage and computational overburdens as well as invalid propagation angles of low-frequency wavefields. Experiments on the Padé generalized screen propagator indicate that the Adaptive mesh effectively solves these drawbacks of regular fixed-mesh methods, thus accurately computing the wavefield and its propagation angle in a wide frequency band. Several synthetic examples also demonstrate its feasibility for seismic modeling and migration.
Android event code automatic generation method based on object relevance%基于对象关联的Android事件代码自动生成方法
Institute of Scientific and Technical Information of China (English)
李杨; 胡文
2012-01-01
为解决Android事件代码自动生成问题,结合对象关联理论,论述了控件对象关联关系,并给出控件对象关联关系定义并实现其构建过程,最终建立控件对象关联关系树COARTree,将其应用于Android事件代码生成过程中,解决了Android事件代码自动生成问题,并取得了良好的应用价值.以简易电话簿为实例,验证了Android事件代码自动生成的方法.%In order to solve the problem of Android event code automatically generated, this paper combined with the object of relevance theory (OAR) , discussed on the control object relationship, and gave the control object relationships theory ( COAR) defining and achieve their build process, and ultimately establish control object relationship tree(COARTree) applied to Android event code generation process to solve the problem of Android event code automatically generated, and have achieved good application value. Simple phone book, for instance, to verify the Android event code automatically generated.
Effects of mesh style and grid convergence on numerical simulation accuracy of centrifugal pump
Institute of Scientific and Technical Information of China (English)
刘厚林; 刘明明; 白羽; 董亮
2015-01-01
In order to evaluate the effects of mesh generation techniques and grid convergence on pump performance in centrifugal pump model, three widely used mesh styles including structured hexahedral, unstructured tetrahedral and hybrid prismatic/tetrahedral meshes were generated for a centrifugal pump model. And quantitative grid convergence was assessed based on a grid convergence index (GCI), which accounts for the degree of grid refinement. The structured, unstructured or hybrid meshes are found to have certain difference for velocity distributions in impeller with the change of grid cell number. And the simulation results have errors to different degrees compared with experimental data. The GCI-value for structured meshes calculated is lower than that for the unstructured and hybrid meshes. Meanwhile, the structured meshes are observed to get more vortexes in impeller passage. Nevertheless, the hybrid meshes are found to have larger low-velocity area at outlet and more secondary vortexes at a specified location than structured meshes and unstructured meshes.
Held, Gilbert
2005-01-01
Wireless mesh networking is a new technology that has the potential to revolutionize how we access the Internet and communicate with co-workers and friends. Wireless Mesh Networks examines the concept and explores its advantages over existing technologies. This book explores existing and future applications, and examines how some of the networking protocols operate.The text offers a detailed analysis of the significant problems affecting wireless mesh networking, including network scale issues, security, and radio frequency interference, and suggests actual and potential solutions for each pro
A mesh deformation technique based on two-step solution of the elasticity equations
Huang, Guo; Huang, Haiming; Guo, Jin
2016-12-01
In the computation of fluid mechanics problems with moving boundaries, including fluid-structure interaction, fluid mesh deformation is a common problem to be solved. An automatic mesh deformation technique for large deformations of the fluid mesh is presented on the basis of a pseudo-solid method in which the fluid mesh motion is governed by the equations of elasticity. A two-dimensional mathematical model of a linear elastic body is built by using the finite element method. The numerical result shows that the proposed method has a better performance in moving the fluid mesh without producing distorted elements than that of the classic one-step methods.
A mesh deformation technique based on two-step solution of the elasticity equations
Huang, Guo; Huang, Haiming; Guo, Jin
2017-04-01
In the computation of fluid mechanics problems with moving boundaries, including fluid-structure interaction, fluid mesh deformation is a common problem to be solved. An automatic mesh deformation technique for large deformations of the fluid mesh is presented on the basis of a pseudo-solid method in which the fluid mesh motion is governed by the equations of elasticity. A two-dimensional mathematical model of a linear elastic body is built by using the finite element method. The numerical result shows that the proposed method has a better performance in moving the fluid mesh without producing distorted elements than that of the classic one-step methods.
Energy Technology Data Exchange (ETDEWEB)
Caballero Ortiz, Ezequiel
2002-12-01
This work is devoted to the analysis of the Automatic Control of Electrical Systems Generation of power, as of the information that generates the loop with Load-Frequency Control and the Automatic Voltage Regulator loop. To accomplish the analysis, the control classical theory and feedback control systems concepts are applied. Thus also, the modern theory concepts are employed. The studies are accomplished in the digital computer through the MATLAB program and the available simulation technique in the SIMULINK tool. In this thesis the theoretical and physical concepts of the automatic control of generation are established; dividing it in load frequency control and automatic voltage regulator loops. The mathematical models of the two control loops are established. Later, the models of the elements are interconnected in order to integrate the loop with load frequency control and the digital simulation of the system is carried out. In first instance, the function of the primary control in are - machine, area - multi machine and multi area - multi machine power systems, is analyzed. Then, the automatic control of generation of the area and multi area power systems is studied. The economic dispatch concept is established and with this plan the power system multi area is simulated, there in after the energy exchange among areas in stationary stage is studied. The mathematical models of the component elements of the control loop of the automatic voltage regulator are interconnected. Data according to the nature of each component are generated and their behavior is simulated to analyze the system response. The two control loops are interconnected and a simulation is carry out with data generated previously, examining the performance of the automatic control of generation and the interaction between the two control loops. Finally, the Poles Positioning and the Optimum Control techniques of the modern control theory are applied to the automatic control of an area generation
Mesh implants: An overview of crucial mesh parameters
Institute of Scientific and Technical Information of China (English)
Lei-Ming; Zhu; Philipp; Schuster; Uwe; Klinge
2015-01-01
Hernia repair is one of the most frequently performed surgical interventions that use mesh implants. This article evaluates crucial mesh parameters to facilitate selection of the most appropriate mesh implant, considering raw materials, mesh composition, structure parameters and mechanical parameters. A literature review was performed using the Pub Med database. The most important mesh parameters in the selection of a mesh implant are the raw material, structural parameters and mechanical parameters, which should match the physiological conditions. The structural parameters, especially the porosity, are the most important predictors of the biocompatibility performance of synthetic meshes. Meshes with large pores exhibit less inflammatory infiltrate, connective tissue and scar bridging, which allows increased soft tissue ingrowth. The raw material and combination of raw materials of the used mesh, including potential coatings and textile design, strongly impact the inflammatory reaction to the mesh. Synthetic meshes made from innovative polymers combined with surface coating have been demonstrated to exhibit advantageous behavior in specialized fields. Monofilament, largepore synthetic meshes exhibit advantages. The value of mesh classification based on mesh weight seems to be overestimated. Mechanical properties of meshes, such as anisotropy/isotropy, elasticity and tensile strength, are crucial parameters for predicting mesh performance after implantation.
Geometrically Consistent Mesh Modification
Bonito, A.
2010-01-01
A new paradigm of adaptivity is to execute refinement, coarsening, and smoothing of meshes on manifolds with incomplete information about their geometry and yet preserve position and curvature accuracy. We refer to this collectively as geometrically consistent (GC) mesh modification. We discuss the concept of discrete GC, show the failure of naive approaches, and propose and analyze a simple algorithm that is GC and accuracy preserving. © 2010 Society for Industrial and Applied Mathematics.
Botsch, Mario; Pauly, Mark; Alliez, Pierre; Levy, Bruno
2010-01-01
Geometry processing, or mesh processing, is a fast-growing area of research that uses concepts from applied mathematics, computer science, and engineering to design efficient algorithms for the acquisition, reconstruction, analysis, manipulation, simulation, and transmission of complex 3D models. Applications of geometry processing algorithms already cover a wide range of areas from multimedia, entertainment, and classical computer-aided design, to biomedical computing, reverse engineering, and scientific computing. Over the last several years, triangle meshes have become increasingly popular,
Wang, Yibing; Breedveld, Sebastiaan; Heijmen, Ben; Petit, Steven F.
2016-06-01
IMRT planning with commercial Treatment Planning Systems (TPSs) is a trial-and-error process. Consequently, the quality of treatment plans may not be consistent among patients, planners and institutions. Recently, different plan quality assurance (QA) models have been proposed, that could flag and guide improvement of suboptimal treatment plans. However, the performance of these models was validated using plans that were created using the conventional trail-and-error treatment planning process. Consequently, it is challenging to assess and compare quantitatively the accuracy of different treatment planning QA models. Therefore, we created a golden standard dataset of consistently planned Pareto-optimal IMRT plans for 115 prostate patients. Next, the dataset was used to assess the performance of a treatment planning QA model that uses the overlap volume histogram (OVH). 115 prostate IMRT plans were fully automatically planned using our in-house developed TPS Erasmus-iCycle. An existing OVH model was trained on the plans of 58 of the patients. Next it was applied to predict DVHs of the rectum, bladder and anus of the remaining 57 patients. The predictions were compared with the achieved values of the golden standard plans for the rectum D mean, V 65, and V 75, and D mean of the anus and the bladder. For the rectum, the prediction errors (predicted-achieved) were only -0.2 ± 0.9 Gy (mean ± 1 SD) for D mean,-1.0 ± 1.6% for V 65, and -0.4 ± 1.1% for V 75. For D mean of the anus and the bladder, the prediction error was 0.1 ± 1.6 Gy and 4.8 ± 4.1 Gy, respectively. Increasing the training cohort to 114 patients only led to minor improvements. A dataset of consistently planned Pareto-optimal prostate IMRT plans was generated. This dataset can be used to train new, and validate and compare existing treatment planning QA models, and has been made publicly available. The OVH model was highly accurate
A mass-redistributed finite element method (MR-FEM) for acoustic problems using triangular mesh
He, Z. C.; Li, Eric; Liu, G. R.; Li, G. Y.; Cheng, A. G.
2016-10-01
The accuracy of numerical results using standard finite element method (FEM) in acoustic problems will deteriorate with increasing frequency due to the "dispersion error". Such dispersion error depends on the balance between the "stiffness" and "mass" of discretization equation systems. This paper reports an improved finite element method (FEM) for solving acoustic problems by re-distributing the mass in the mass matrix to "tune" the balance, aiming to minimize the dispersion errors. This is done by shifting the integration point locations when computing the entries of the mass matrix, while ensuring the mass conservation. The new method is verified through the detailed numerical error analysis, and a strategy is also proposed for the best mass redistribution in terms of minimizing dispersion error. The relative dispersion error of present mass-redistributed finite element method (MR-FEM) is found to be much smaller than the FEM solution, in both theoretical prediction and numerical examination. The present MR-FEM works well by using the linear triangular elements that can be generated automatically, which enables automation in computation and saving computational cost in mesh generation. Numerical examples demonstrate the advantages of MR-FEM, in comparison with the standard FEM using the same triangular meshes and quadrilateral meshes.
Garrett, S. J.; Bowers, J. C.; Oreilly, J. E., Jr.
1978-01-01
A computer program, PROSE, that produces nonlinear state equations from a simple topological description of an electrical or mechanical network is described. Unnecessary states are also automatically eliminated, so that a simplified terminal circuit model is obtained. The program also prints out the eigenvalues of a linearized system and the sensitivities of the eigenvalue of largest magnitude.
VC++ PROGRAMMING AUTOMATIC GENERATING WITH NATURAL LANGUAGE INTERFACE%以自然语言为界面实现VC++程序的自动生成
Institute of Scientific and Technical Information of China (English)
周玉龙; 辛运帏; 谷大勇; 陈有祺
2001-01-01
本文提出以自然语言为界面实现程序自动生成的研究成果.该研究系统使用面向对象的方法与技术，以自然语言为输入界面，使用扩充的格语法进行语法语义分析，将用户描述的VC++期望程序功能的汉语篇章依次进行自动切词处理、语法处理、语义分析理解、目标程序的自动生成，最终形成满足用户要求且符合Visual C++语法的结果程序.%The study of realizing programming automatic generation with natural language interface by combined two important fields of natural language processing and software automation is reported in this paper. Using object-oriented technology and method, with chinese character text input interface, regarding case grammar as the theory foundaton, after doing automatic word segmenting and syntactic and semantic analyzing, as a final output results, the correct executable visual C++ programs with functions described by user in chinese character texts are automatically generated by the researched system.
Visualization of semantic indexing similarity over MeSH.
Du, Haixia; Yoo, Terry S
2007-10-11
We present an interactive visualization system for the evaluation of indexing results of the MEDLINE data-base over the Medical Subject Headings (MeSH) structure in a graphical radial-tree layout. It displays indexing similarity measurements with 2D color coding and a 3D height field permitting the evaluation of the automatic Medical Text Indexer (MTI), compared with human indexers.
Research on DSP automatic code generation technology with Matlab platform%Matlab平台DSP自动代码生成技术研究
Institute of Scientific and Technical Information of China (English)
王巧明; 李中健; 姜达郁
2012-01-01
Since it is difficult and time-consuming to programm for DSP, a method that synthetically uses Matlab, code, composer studio (CCS), and their embedded tools and connection softwares to generate code automatically is proposed. The research mainly focuses on the method of automatic code generation with DM642 EVM board. The edge detection experiment is taken to verify the performability and reliability of the method. The results show that the code generation method is not only efficient, but also flexible. The generated code can be executed smoothly in the DSP board with a good processing result.%针对DSP编程难度大,耗时长的问题,给出了一种综合运用Matlab软件、Code Composer Studio(CCS)软件及其内嵌工具和连接软件进行自动代码生成的方法.重点研究DM642 EVM板的自动代码生成方法,并以边缘检测实验为例,验证自动生成代码的可执行性.实验结果表明,该代码生成方法不仅具有极高的生成效率,而且灵活易用；生成的可执行代码可以在DSP板上顺利运行,并可取得非常好的处理结果.
Locking paralleled GPU-based method research for unstructured mesh generation%基于GPU的加锁并行化非结构网格生成方法研究
Institute of Scientific and Technical Information of China (English)
蔡云龙; 肖素梅; 齐龙
2014-01-01
Defects of consuming time and memory consist in unstructured mesh generation. This paper proposes a novel approach, terming GPU-PDMG, which is GPU parallel unstructured mesh generation based on the framework of CUDA. The technology combines the high-speed parallel GPU and advantages of Delaunay triangulation. It develops a method of locking parallel area dividing, using the CUDA programming model on nVidia GPUs. By analyzing the tested examples’ speedup rate and efficiency, it has evaluated their computing performance. This result is identified in NACA0012 and multi-element airfoil experiment with both the analysis of speedup rate and efficiency and GPU-PDMG is better than any existing GPU algorithms.%非结构网格的生成在时间和内存上有一定的缺陷，这里提出了一种新的方法，命名为GPU-PDMG，是基于CUDA架构的GPU并行非结构网格生成技术。该技术结合了GPU的高速并行计算能力与Delaunay三角化的优点，在英伟达GPU模块下采用CUDA程序模型，开发出了加锁并行区划分技术，通过对NACA0012翼型、多段翼型等算例进行测试，分析此方法的加速比和效率，对其计算性能展开评估。实验结果表明，GPU-PDMG优于现存在的CPU算法的速度，在保证网格质量的同时，提高了效率。
Gill, S P D; Gibson, B K; Flynn, C; Ibata, R A; Lewis, G F; Gill, Stuart P.D.; Knebe, Alexander; Gibson, Brad K.; Flynn, Chris; Ibata, Rodrigo A.; Lewis, Geraint F.
2002-01-01
An adaptive multi grid approach to simulating the formation of structure from collisionless dark matter is described. MLAPM (Multi-Level Adaptive Particle Mesh) is one of the most efficient serial codes available on the cosmological 'market' today. As part of Swinburne University's role in the development of the Square Kilometer Array, we are implementing hydrodynamics, feedback, and radiative transfer within the MLAPM adaptive mesh, in order to simulate baryonic processes relevant to the interstellar and intergalactic media at high redshift. We will outline our progress to date in applying the existing MLAPM to a study of the decay of satellite galaxies within massive host potentials.
Isotopic Implicit Surface Meshing
Boissonnat, Jean-Daniel; Cohen-Steiner, David; Vegter, Gert
2004-01-01
This paper addresses the problem of piecewise linear approximation of implicit surfaces. We first give a criterion ensuring that the zero-set of a smooth function and the one of a piecewise linear approximation of it are isotopic. Then, we deduce from this criterion an implicit surface meshing algor
MeshVoro: A Three-Dimensional Voronoi Mesh Building Tool for the TOUGH Family of Codes
Energy Technology Data Exchange (ETDEWEB)
Freeman, C. M.; Boyle, K. L.; Reagan, M.; Johnson, J.; Rycroft, C.; Moridis, G. J.
2013-09-30
Few tools exist for creating and visualizing complex three-dimensional simulation meshes, and these have limitations that restrict their application to particular geometries and circumstances. Mesh generation needs to trend toward ever more general applications. To that end, we have developed MeshVoro, a tool that is based on the Voro (Rycroft 2009) library and is capable of generating complex threedimensional Voronoi tessellation-based (unstructured) meshes for the solution of problems of flow and transport in subsurface geologic media that are addressed by the TOUGH (Pruess et al. 1999) family of codes. MeshVoro, which includes built-in data visualization routines, is a particularly useful tool because it extends the applicability of the TOUGH family of codes by enabling the scientifically robust and relatively easy discretization of systems with challenging 3D geometries. We describe several applications of MeshVoro. We illustrate the ability of the tool to straightforwardly transform a complex geological grid into a simulation mesh that conforms to the specifications of the TOUGH family of codes. We demonstrate how MeshVoro can describe complex system geometries with a relatively small number of grid blocks, and we construct meshes for geometries that would have been practically intractable with a standard Cartesian grid approach. We also discuss the limitations and appropriate applications of this new technology.
Directory of Open Access Journals (Sweden)
William Barragán Zaque
2015-06-01
Full Text Available The aim of this paper is to generate photogrammetrie products and to automatically map buildings in the area of interest in vector format. The research was conducted Bogotá using high resolution digital vertical aerial photographs and point clouds obtained using LIDAR technology. Image segmentation was also used, alongside radiometric and geometric digital processes. The process took into account aspects including building height, segmentation algorithms, and spectral band combination. The results had an effectiveness of 97.2 % validated through ground-truthing.
Finite Macro-Element Mesh Deformation in a Structured Multi-Block Navier-Stokes Code
Bartels, Robert E.
2005-01-01
A mesh deformation scheme is developed for a structured multi-block Navier-Stokes code consisting of two steps. The first step is a finite element solution of either user defined or automatically generated macro-elements. Macro-elements are hexagonal finite elements created from a subset of points from the full mesh. When assembled, the finite element system spans the complete flow domain. Macro-element moduli vary according to the distance to the nearest surface, resulting in extremely stiff elements near a moving surface and very pliable elements away from boundaries. Solution of the finite element system for the imposed boundary deflections generally produces smoothly varying nodal deflections. The manner in which distance to the nearest surface has been found to critically influence the quality of the element deformation. The second step is a transfinite interpolation which distributes the macro-element nodal deflections to the remaining fluid mesh points. The scheme is demonstrated for several two-dimensional applications.
NASA Lewis Meshed VSAT Workshop meeting summary
Ivancic, William
1993-11-01
NASA Lewis Research Center's Space Electronics Division (SED) hosted a workshop to address specific topics related to future meshed very small-aperture terminal (VSAT) satellite communications networks. The ideas generated by this workshop will help to identify potential markets and focus technology development within the commercial satellite communications industry and NASA. The workshop resulted in recommendations concerning these principal points of interest: the window of opportunity for a meshed VSAT system; system availability; ground terminal antenna sizes; recommended multifrequency for time division multiple access (TDMA) uplink; a packet switch design concept for narrowband; and fault tolerance design concepts. This report presents a summary of group presentations and discussion associated with the technological, economic, and operational issues of meshed VSAT architectures that utilize processing satellites.
GRChombo: Numerical relativity with adaptive mesh refinement
Clough, Katy; Figueras, Pau; Finkel, Hal; Kunesch, Markus; Lim, Eugene A.; Tunyasuvunakool, Saran
2015-12-01
In this work, we introduce {\\mathtt{GRChombo}}: a new numerical relativity code which incorporates full adaptive mesh refinement (AMR) using block structured Berger-Rigoutsos grid generation. The code supports non-trivial ‘many-boxes-in-many-boxes’ mesh hierarchies and massive parallelism through the message passing interface. {\\mathtt{GRChombo}} evolves the Einstein equation using the standard BSSN formalism, with an option to turn on CCZ4 constraint damping if required. The AMR capability permits the study of a range of new physics which has previously been computationally infeasible in a full 3 + 1 setting, while also significantly simplifying the process of setting up the mesh for these problems. We show that {\\mathtt{GRChombo}} can stably and accurately evolve standard spacetimes such as binary black hole mergers and scalar collapses into black holes, demonstrate the performance characteristics of our code, and discuss various physics problems which stand to benefit from the AMR technique.
The Numerical Simulation of Ship Waves Using Cartesian Grid Methods with Adaptive Mesh Refinement
Dommermuth, Douglas G; Beck, Robert F; O'Shea, Thomas T; Wyatt, Donald C; Olson, Kevin; MacNeice, Peter
2014-01-01
Cartesian-grid methods with Adaptive Mesh Refinement (AMR) are ideally suited for simulating the breaking of waves, the formation of spray, and the entrainment of air around ships. As a result of the cartesian-grid formulation, minimal input is required to describe the ships geometry. A surface panelization of the ship hull is used as input to automatically generate a three-dimensional model. No three-dimensional gridding is required. The AMR portion of the numerical algorithm automatically clusters grid points near the ship in regions where wave breaking, spray formation, and air entrainment occur. Away from the ship, where the flow is less turbulent, the mesh is coarser. The numerical computations are implemented using parallel algorithms. Together, the ease of input and usage, the ability to resolve complex free-surface phenomena, and the speed of the numerical algorithms provide a robust capability for simulating the free-surface disturbances near a ship. Here, numerical predictions, with and without AMR,...
Zollo, Aldo
2016-04-01
RISS S.r.l. is a Spin-off company recently born from the initiative of the research group constituting the Seismology Laboratory of the Department of Physics of the University of Naples Federico II. RISS is an innovative start-up, based on the decade-long experience in earthquake monitoring systems and seismic data analysis of its members and has the major goal to transform the most recent innovations of the scientific research into technological products and prototypes. With this aim, RISS has recently started the development of a new software, which is an elegant solution to manage and analyse seismic data and to create automatic earthquake bulletins. The software has been initially developed to manage data recorded at the ISNet network (Irpinia Seismic Network), which is a network of seismic stations deployed in Southern Apennines along the active fault system responsible for the 1980, November 23, MS 6.9 Irpinia earthquake. The software, however, is fully exportable and can be used to manage data from different networks, with any kind of station geometry or network configuration and is able to provide reliable estimates of earthquake source parameters, whichever is the background seismicity level of the area of interest. Here we present the real-time automated procedures and the analyses performed by the software package, which is essentially a chain of different modules, each of them aimed at the automatic computation of a specific source parameter. The P-wave arrival times are first detected on the real-time streaming of data and then the software performs the phase association and earthquake binding. As soon as an event is automatically detected by the binder, the earthquake location coordinates and the origin time are rapidly estimated, using a probabilistic, non-linear, exploration algorithm. Then, the software is able to automatically provide three different magnitude estimates. First, the local magnitude (Ml) is computed, using the peak-to-peak amplitude
Energy Technology Data Exchange (ETDEWEB)
Yang, D; Li, X; Li, H; Wooten, H; Green, O; Rodriguez, V; Mutic, S [Washington University School of Medicine, St. Louis, MO (United States)
2014-06-15
Purpose: Two aims of this work were to develop a method to automatically verify treatment delivery accuracy immediately after patient treatment and to develop a comprehensive daily treatment report to provide all required information for daily MR-IGRT review. Methods: After systematically analyzing the requirements for treatment delivery verification and understanding the available information from a novel MR-IGRT treatment machine, we designed a method to use 1) treatment plan files, 2) delivery log files, and 3) dosimetric calibration information to verify the accuracy and completeness of daily treatment deliveries. The method verifies the correctness of delivered treatment plans and beams, beam segments, and for each segment, the beam-on time and MLC leaf positions. Composite primary fluence maps are calculated from the MLC leaf positions and the beam-on time. Error statistics are calculated on the fluence difference maps between the plan and the delivery. We also designed the daily treatment delivery report by including all required information for MR-IGRT and physics weekly review - the plan and treatment fraction information, dose verification information, daily patient setup screen captures, and the treatment delivery verification results. Results: The parameters in the log files (e.g. MLC positions) were independently verified and deemed accurate and trustable. A computer program was developed to implement the automatic delivery verification and daily report generation. The program was tested and clinically commissioned with sufficient IMRT and 3D treatment delivery data. The final version has been integrated into a commercial MR-IGRT treatment delivery system. Conclusion: A method was developed to automatically verify MR-IGRT treatment deliveries and generate daily treatment reports. Already in clinical use since December 2013, the system is able to facilitate delivery error detection, and expedite physician daily IGRT review and physicist weekly chart
Gloger, Oliver; Tönnies, Klaus; Mensel, Birger; Völzke, Henry
2015-11-01
In epidemiological studies as well as in clinical practice the amount of produced medical image data strongly increased in the last decade. In this context organ segmentation in MR volume data gained increasing attention for medical applications. Especially in large-scale population-based studies organ volumetry is highly relevant requiring exact organ segmentation. Since manual segmentation is time-consuming and prone to reader variability, large-scale studies need automatized methods to perform organ segmentation. Fully automatic organ segmentation in native MR image data has proven to be a very challenging task. Imaging artifacts as well as inter- and intrasubject MR-intensity differences complicate the application of supervised learning strategies. Thus, we propose a modularized framework of a two-stepped probabilistic approach that generates subject-specific probability maps for renal parenchyma tissue, which are refined subsequently by using several, extended segmentation strategies. We present a three class-based support vector machine recognition system that incorporates Fourier descriptors as shape features to recognize and segment characteristic parenchyma parts. Probabilistic methods use the segmented characteristic parenchyma parts to generate high quality subject-specific parenchyma probability maps. Several refinement strategies including a final shape-based 3D level set segmentation technique are used in subsequent processing modules to segment renal parenchyma. Furthermore, our framework recognizes and excludes renal cysts from parenchymal volume, which is important to analyze renal functions. Volume errors and Dice coefficients show that our presented framework outperforms existing approaches.
Model Driven Automatic Generation of Web Application Systems%模型驱动下的Web应用系统自动生成
Institute of Scientific and Technical Information of China (English)
王海林
2012-01-01
In order to promote software development efficiency,it proposes an approach of model driven automatic generation of Web applications. The approach takes MetaEdit+ as a meta-modeling tool. The first step the approach suggests is to build Web application meta -models and to customize DSL. The further step is to build Web application domain models by DSL. Then by using generator definition language MERL which MetaEdit+ provides,the software developers can design conveniently JSP generator,Servlet generator,Javabeans generator and database generator that Web application systems need. These generators can produce the whole Web application system directly from the Web application graph models. Finally, the approach of model driven automatic generation of Web applications will be introduced in detail through an instance named WebShopping. The test result indicates that the generated Web application can run correctly on the Web application server in the Windows operating system environment.%为了提高Web应用系统开发效率,提出了模型驱动下的Web应用系统自动生成方法.这种生成方法是以MetaEdit+作为元建模工具,首先创建Web应用系统元模型、定制DSL,进而建立Web应用系统领域模型,然后通过MetaEdit+提供的生成器定义语言MERL,软件开发人员可以很方便地设计出Web应用系统所需的JSP生成器、Servlet生成器、Jay -abeans生成器和数据库生成器,从Web应用系统图形模型直接生成整个Web应用系统.最后通过一个WebShopping实例详细介绍了模型驱动下的Web应用系统生成方法及生成过程.经测试,所生成的Web应用系统可以在Windows操作系统中的Web应用服务器上正确运行.
Tang, Zhao; Wei, Qingshan; Wei, Alexander
2011-12-01
Metal-mesh lithography (MML) is a practical hybrid of microcontact printing and capillary force lithography that can be applied over millimeter-sized areas with a high level of uniformity. MML can be achieved by blotting various inks onto substrates through thin copper grids, relying on preferential wetting and capillary interactions between template and substrate for pattern replication. The resulting mesh patterns, which are inverted relative to those produced by stenciling or serigraphy, can be reproduced with low micrometer resolution. MML can be combined with other surface chemistry and lift-off methods to create functional microarrays for diverse applications, such as periodic islands of gold nanorods and patterned corrals for fibroblast cell cultures.
Efficient Packet Forwarding in Mesh Network
Soumen Kanrar
2012-01-01
Wireless Mesh Network (WMN) is a multi hop low cost, with easy maintenance robust network providing reliable service coverage. WMNs consist of mesh routers and mesh clients. In this architecture, while static mesh routers form the wireless backbone, mesh clients access the network through mesh routers as well as directly meshing with each other. Different from traditional wireless networks, WMN is dynamically self-organized and self-configured. In other words, the nodes in the mesh network au...
Coupling of non-conforming meshes in a component mode synthesis method
Akcay-Perdahcioglu, D.; Doreille, M.; Boer, de A.; Ludwig, T.
2013-01-01
A common mesh refinement-based coupling technique is embedded into a component mode synthesis method, Craig–Bampton. More specifically, a common mesh is generated between the non-conforming interfaces of the coupled structures, and the compatibility constraints are enforced on that mesh via L2-minim
Parallel Adaptive Mesh Refinement
Energy Technology Data Exchange (ETDEWEB)
Diachin, L; Hornung, R; Plassmann, P; WIssink, A
2005-03-04
As large-scale, parallel computers have become more widely available and numerical models and algorithms have advanced, the range of physical phenomena that can be simulated has expanded dramatically. Many important science and engineering problems exhibit solutions with localized behavior where highly-detailed salient features or large gradients appear in certain regions which are separated by much larger regions where the solution is smooth. Examples include chemically-reacting flows with radiative heat transfer, high Reynolds number flows interacting with solid objects, and combustion problems where the flame front is essentially a two-dimensional sheet occupying a small part of a three-dimensional domain. Modeling such problems numerically requires approximating the governing partial differential equations on a discrete domain, or grid. Grid spacing is an important factor in determining the accuracy and cost of a computation. A fine grid may be needed to resolve key local features while a much coarser grid may suffice elsewhere. Employing a fine grid everywhere may be inefficient at best and, at worst, may make an adequately resolved simulation impractical. Moreover, the location and resolution of fine grid required for an accurate solution is a dynamic property of a problem's transient features and may not be known a priori. Adaptive mesh refinement (AMR) is a technique that can be used with both structured and unstructured meshes to adjust local grid spacing dynamically to capture solution features with an appropriate degree of resolution. Thus, computational resources can be focused where and when they are needed most to efficiently achieve an accurate solution without incurring the cost of a globally-fine grid. Figure 1.1 shows two example computations using AMR; on the left is a structured mesh calculation of a impulsively-sheared contact surface and on the right is the fuselage and volume discretization of an RAH-66 Comanche helicopter [35]. Note the
Lattice Cleaving: Conforming Tetrahedral Meshes of Multimaterial Domains with Bounded Quality.
Bronson, Jonathan R; Levine, Joshua A; Whitaker, Ross T
2013-01-01
We introduce a new algorithm for generating tetrahedral meshes that conform to physical boundaries in volumetric domains consisting of multiple materials. The proposed method allows for an arbitrary number of materials, produces high-quality tetrahedral meshes with upper and lower bounds on dihedral angles, and guarantees geometric fidelity. Moreover, the method is combinatoric so its implementation enables rapid mesh construction. These meshes are structured in a way that also allows grading, in order to reduce element counts in regions of homogeneity.
Institute of Scientific and Technical Information of China (English)
高伟; 耿建华
2013-01-01
介绍一种基于离散粒子理论地震波传播数值模拟的网格剖分计算方法.根据离散粒子理论,将研究区域划分为由一系列相互作用的粒子组成的正六边形网格,这些粒子在它们的接触点处发生相互作用,并用Hooke定律和Newton定律描述.为解决六边形网格带来的网格交错而难以计算以及波场输出问题,将横向网格进行加密,加密处赋予假想的粒子,输出波场时选取偶数行偶数列点或奇数行奇数列点的波场值.均匀介质和层状介质模型的数值模拟结果表明,该网格剖分计算方法能够将离散粒子理论用于模拟弹性波在非均匀各向同性介质中地震波的传播.%A mesh generation calculation method based on discrete particle scheme for numerical modeling seismic waves is presented.According to the discrete particle theory,the study area can be divided into regular hexagon grid composed of a series of interacting particles.These particles interact at their contact points and the motion of particles in space is described by Hook's Law and Newton's Law.To solve the problem of the grid crisscross brought by hexagon grids which may lead to difficulty in calculation and output wave field's value,we encrypt the imaginary particles at the horizontal grids and output the wave field value of the even lines＇ points in the even column or odd lines＇ points in odd column.The numerical simulation results of homogeneous model and layer model proved that this mesh generation calculation method based on discrete particle theory is capable of modeling the propagation of elastic waves through heterogeneous isotropic media.
Mesh Algorithms for PDE with Sieve I: Mesh Distribution
Directory of Open Access Journals (Sweden)
Matthew G. Knepley
2009-01-01
Full Text Available We have developed a new programming framework, called Sieve, to support parallel numerical partial differential equation(s (PDE algorithms operating over distributed meshes. We have also developed a reference implementation of Sieve in C++ as a library of generic algorithms operating on distributed containers conforming to the Sieve interface. Sieve makes instances of the incidence relation, or arrows, the conceptual first-class objects represented in the containers. Further, generic algorithms acting on this arrow container are systematically used to provide natural geometric operations on the topology and also, through duality, on the data. Finally, coverings and duality are used to encode not only individual meshes, but all types of hierarchies underlying PDE data structures, including multigrid and mesh partitions. In order to demonstrate the usefulness of the framework, we show how the mesh partition data can be represented and manipulated using the same fundamental mechanisms used to represent meshes. We present the complete description of an algorithm to encode a mesh partition and then distribute a mesh, which is independent of the mesh dimension, element shape, or embedding. Moreover, data associated with the mesh can be similarly distributed with exactly the same algorithm. The use of a high level of abstraction within the Sieve leads to several benefits in terms of code reuse, simplicity, and extensibility. We discuss these benefits and compare our approach to other existing mesh libraries.
Unsupervised Spectral Mesh Segmentation Driven by Heterogeneous Graphs.
Theologou, Panagiotis; Pratikakis, Ioannis; Theoharis, Theoharis
2017-02-01
A fully automatic mesh segmentation scheme using heterogeneous graphs is presented. We introduce a spectral framework where local geometry affinities are coupled with surface patch affinities. A heterogeneous graph is constructed combining two distinct graphs: a weighted graph based on adjacency of patches of an initial over-segmentation, and the weighted dual mesh graph. The partitioning relies on processing each eigenvector of the heterogeneous graph Laplacian individually, taking into account the nodal set and nodal domain theory. Experiments on standard datasets show that the proposed unsupervised approach outperforms the state-of-the-art unsupervised methodologies and is comparable to the best supervised approaches.
Adaptive-mesh algorithms for computational fluid dynamics
Powell, Kenneth G.; Roe, Philip L.; Quirk, James
1993-01-01
The basic goal of adaptive-mesh algorithms is to distribute computational resources wisely by increasing the resolution of 'important' regions of the flow and decreasing the resolution of regions that are less important. While this goal is one that is worthwhile, implementing schemes that have this degree of sophistication remains more of an art than a science. In this paper, the basic pieces of adaptive-mesh algorithms are described and some of the possible ways to implement them are discussed and compared. These basic pieces are the data structure to be used, the generation of an initial mesh, the criterion to be used to adapt the mesh to the solution, and the flow-solver algorithm on the resulting mesh. Each of these is discussed, with particular emphasis on methods suitable for the computation of compressible flows.
Research on Automatic Generation Technology of General Crystal Report%通用水晶报表自动生成技术研究
Institute of Scientific and Technical Information of China (English)
丛凤侠; 杨玉强
2013-01-01
针对水晶报表制作周期长、维护困难，难已满足用户个性化和不断变化需求的现状，文中研究自动生成技术，设计思路是由大型数据库支持前端程序运行，将报表的外观、结构、程序等信息存储在数据库中，运行时根据这些信息自动生成报表。首先进行界面设计，包括报表页眉节、页眉节、详细资料节、页脚节、报表页脚节；然后进行数据库设计，包括概念结构设计和逻辑结构设计；最后进行关键程序设计，包括主程序设计、设置字段设计、设置统计值设计。运用自动生成技术，提高了软件开发劳动生产率，改变了传统的软件开发模式。%For the current situation about long production cycle,difficult to maintain,difficult to meet users’ individual and changing needs of crystal reports,study automatic generation technology,the design idea is run by the large database front-end programs,and the report appearance,structure,procedures are stored in database,running to automatically generate reports based on this information. First conduct interface design,including the report header segment,header segment,details segment,page footer segment,report footer seg-ment;second,carry on database design,including conceptual structure design and logic structure design;finally,conduct key program de-sign,including main program design,set field design,set statistics design. Using the automatic generation technology,improve the labor productivity of software development,and has changed the traditional mode of software development.
A Survey of Solver-Related Geometry and Meshing Issues
Masters, James; Daniel, Derick; Gudenkauf, Jared; Hine, David; Sideroff, Chris
2016-01-01
There is a concern in the computational fluid dynamics community that mesh generation is a significant bottleneck in the CFD workflow. This is one of several papers that will help set the stage for a moderated panel discussion addressing this issue. Although certain general "rules of thumb" and a priori mesh metrics can be used to ensure that some base level of mesh quality is achieved, inadequate consideration is often given to the type of solver or particular flow regime on which the mesh will be utilized. This paper explores how an analyst may want to think differently about a mesh based on considerations such as if a flow is compressible vs. incompressible or hypersonic vs. subsonic or if the solver is node-centered vs. cell-centered. This paper is a high-level investigation intended to provide general insight into how considering the nature of the solver or flow when performing mesh generation has the potential to increase the accuracy and/or robustness of the solution and drive the mesh generation process to a state where it is no longer a hindrance to the analysis process.
Development of an Unstructured Mesh Code for Flows About Complete Vehicles
Peraire, Jaime; Gupta, K. K. (Technical Monitor)
2001-01-01
This report describes the research work undertaken at the Massachusetts Institute of Technology, under NASA Research Grant NAG4-157. The aim of this research is to identify effective algorithms and methodologies for the efficient and routine solution of flow simulations about complete vehicle configurations. For over ten years we have received support from NASA to develop unstructured mesh methods for Computational Fluid Dynamics. As a result of this effort a methodology based on the use of unstructured adapted meshes of tetrahedra and finite volume flow solvers has been developed. A number of gridding algorithms, flow solvers, and adaptive strategies have been proposed. The most successful algorithms developed from the basis of the unstructured mesh system FELISA. The FELISA system has been extensively for the analysis of transonic and hypersonic flows about complete vehicle configurations. The system is highly automatic and allows for the routine aerodynamic analysis of complex configurations starting from CAD data. The code has been parallelized and utilizes efficient solution algorithms. For hypersonic flows, a version of the code which incorporates real gas effects, has been produced. The FELISA system is also a component of the STARS aeroservoelastic system developed at NASA Dryden. One of the latest developments before the start of this grant was to extend the system to include viscous effects. This required the development of viscous generators, capable of generating the anisotropic grids required to represent boundary layers, and viscous flow solvers. We show some sample hypersonic viscous computations using the developed viscous generators and solvers. Although this initial results were encouraging it became apparent that in order to develop a fully functional capability for viscous flows, several advances in solution accuracy, robustness and efficiency were required. In this grant we set out to investigate some novel methodologies that could lead to the
数据驱动的NC代码自动生成方法研究%Study in NC code generating automatically based on data driving
Institute of Scientific and Technical Information of China (English)
李克天; 何汉武; 王志坚; 郑德涛; 陈统坚
2001-01-01
提出了以数据驱动方式来代替常规的人机交互方式对制造模型进行处理，最终可自动生成NC代码。论述了数据驱动文件原理、表达规则、运行方式以及生成NC代码的过程。%It was presented that data driving method used in manufacturing model instead of the method of manually, and NC code could be generated automatically. Its principle, expressing rules, and NC code creating of the data driving file were discussed step by step.
利用ArcIMS自动生成震中分布图%Automatic generation of epicenter image with ArcIMS
Institute of Scientific and Technical Information of China (English)
董星宏; 贾宁
2011-01-01
Using the function of the ArcIMS website publishing, we implement automatic generation of static epicenter image, and integrate it into the portal website′s management, enrich the content of the rapid earthquake information report, save the time for manually drawing the Epicenter figure.%利用ArcIMS的地图发布功能,较好地实现自动生成静态震中分布图的功能,并将该功能与门户网站集成起来,可丰富地震速报信息的内容,节约应急时期人工绘图的时间.
Sibeyn, J.; Rao, P; Juurlink, B.
1996-01-01
Algorithms for performing gossiping on one- and higher dimensional meshes are presented. As a routing model, we assume the practically important worm-hole routing. For one-dimensional arrays and rings, we give a novel lower bound and an asymptotically optimal gossiping algorithm for all choices of the parameters involved. For two-dimensional meshes and tori, several simple algorithms composed of one-dimensional phases are presented. For an important range of packet and mesh sizes it gives cle...
Synthesized Optimization of Triangular Mesh
Institute of Scientific and Technical Information of China (English)
HU Wenqiang; YANG Wenyu
2006-01-01
Triangular mesh is often used to describe geometric object as computed model in digital manufacture, thus the mesh model with both uniform triangular shape and excellent geometric shape is expected. But in fact, the optimization of triangular shape often is contrary with that of geometric shape. In this paper, one synthesized optimizing algorithm is presented through subdividing triangles to achieve the trade-off solution between the geometric and triangular shape optimization of mesh model. The result mesh with uniform triangular shape and excellent topology are obtained.
Institute of Scientific and Technical Information of China (English)
何新英; 潘夕琪
2012-01-01
在FDM工艺中,基于其成型特点,在加工过程中需要添加支撑.支撑结构的合理性对成型件的精度和加工效率都有很大的影响.提出的基于扫描线的支撑自动生成技术生成支撑的速度快且无遗漏,在此基础上还能快速完成路径优化,实际应用效果较好.%According to the essential principle, the support must be generated in FDM prototyping. The reasonability of support structure has a great impact on the quality of these processes and the efficiency of prototyping. A new algorithm was described, in which support was automatically generated base on the linescan. It is proved the velocity of generating support is very fast and nowhere is missed. And optimization of the scanning road is very easy. The algorithm is robust and very efficient.
Contract Automatic Generation Method Based on TASC Model%基于TASC模型的合同自动生成方法
Institute of Scientific and Technical Information of China (English)
张恒; 李自臣
2011-01-01
通过可信自治服务协同模型解决因自治个体行为难以预测和控制而导致的协同可信危机.在该模型下,Agent之间通过服务合同建立协同关系.提出一种有效的服务合同生成方法,利用服务分类体系、基于适用情景的服务发现机制和服务合同协议模板进行求解,以一种快速查找、可重用的方式生成合同,从而提高服务组合的自动化程度,并给出可信自治式服务协同过程和服务合同自动生成过程.%TASC model can solve the cooperation trust crisis result from the phenomenon that it is difficult to predict and control the autonomy individual behavior. Under this model, service contract establishes cooperation relations between Agents. This paper proposes an effective service contract generation method. It uses service classification system, service discovery mechanism for scenario and service contract protocol template,generates contract in a fast and reusable way, thus improve the level of automation, and gives the process of trust autonomy service cooperation and service contract automatic generation.
基于MATLAB的SVPWM算法自动代码生成技术研究%Search on Generating Code Automatically of SVPWM Based on MATLAB
Institute of Scientific and Technical Information of China (English)
杨蕊; 张建军; 马昭; 路瑜
2015-01-01
Because of DSP’s complicated programming,long developing term,a method is given by using MAT⁃LAB,CCS and its auxiliary software to generate SVPWM code automatically. MATLAB/Simulink is used to build a corresponding algorithmic model. After testifying the correct of this model,it generats codes,compilies automatical⁃ly and downloads them to DSP system to operate. The wave is identical with that of the theoretical result. Compared with manuel code,this method is easy to do,and has a short developing term and high efficiency of generating codes.%针对DSP编程复杂，开发周期长的问题，给出了一种运用MATLAB软件、Code Composer Studio（CCS）软件及其内嵌工具和链接软件自动生成SVPWM代码的方法。利用MATLAB/Simulink仿真软件建立了相应的算法模型，验证模型的正确性之后，自动生成代码，并编译、下载到DSP平台中运行，产生的波形与理论相吻合。与手工编写代码的方法相比较，该方法简单易行，开发周期短，生成代码效率高。
Monroy-Guzman, F; Rivero Gutiérrez, T; López Malpica, I Z; Hernández Cortes, S; Rojas Nava, P; Vazquez Maldonado, J C; Vazquez, A
2012-01-01
DISIGEG is a synthesis installation of zirconium (99)Mo-molybdate gels for (99)Mo/(99m)Tc generator production, which has been designed, built and installed at the ININ. The device consists of a synthesis reactor and five systems controlled via keyboard: (1) raw material access, (2) chemical air stirring, (3) gel dried by air and infrared heating, (4) moisture removal and (5) gel extraction. DISIGEG operation is described and dried condition effects of zirconium (99)Mo- molybdate gels on (99)Mo/(99m)Tc generator performance were evaluated as well as some physical-chemical properties of these gels. The results reveal that temperature, time and air flow applied during the drying process directly affects zirconium (99)Mo-molybdate gel generator performance. All gels prepared have a similar chemical structure probably constituted by three-dimensional network, based on zirconium pentagonal bipyramids and molybdenum octahedral. Basic structural variations cause a change in gel porosity and permeability, favouring or inhibiting (99m)TcO(4)(-) diffusion into the matrix. The (99m)TcO(4)(-) eluates produced by (99)Mo/(99m)Tc zirconium (99)Mo-molybdate gel generators prepared in DISIGEG, air dried at 80°C for 5h and using an air flow of 90mm, satisfied all the Pharmacopoeias regulations: (99m)Tc yield between 70-75%, (99)Mo breakthrough less than 3×10(-3)%, radiochemical purities about 97% sterile and pyrogen-free eluates with a pH of 6.
Mesh Algorithms for PDE with Sieve I: Mesh Distribution
Knepley, Matthew G
2009-01-01
We have developed a new programming framework, called Sieve, to support parallel numerical PDE algorithms operating over distributed meshes. We have also developed a reference implementation of Sieve in C++ as a library of generic algorithms operating on distributed containers conforming to the Sieve interface. Sieve makes instances of the incidence relation, or \\emph{arrows}, the conceptual first-class objects represented in the containers. Further, generic algorithms acting on this arrow container are systematically used to provide natural geometric operations on the topology and also, through duality, on the data. Finally, coverings and duality are used to encode not only individual meshes, but all types of hierarchies underlying PDE data structures, including multigrid and mesh partitions. In order to demonstrate the usefulness of the framework, we show how the mesh partition data can be represented and manipulated using the same fundamental mechanisms used to represent meshes. We present the complete des...
Risk Factors for Mesh Exposure after Transvaginal Mesh Surgery
Institute of Scientific and Technical Information of China (English)
Ke Niu; Yong-Xian Lu; Wen-Jie Shen; Ying-Hui Zhang; Wen-Ying Wang
2016-01-01
Background:Mesh exposure after surgery continues to be a clinical challenge for urogynecological surgeons.The purpose of this study was to explore the risk factors for polypropylene (PP) mesh exposure after transvaginal mesh (TVM) surgery.Methods:This study included 195 patients with advanced pelvic organ prolapse (POP),who underwent TVM from January 2004to December 2012 at the First Affiliated Hospital of Chinese PLA General Hospital.Clinical data were evaluated including patient's demography,TVM type,concomitant procedures,operation time,blood loss,postoperative morbidity,and mesh exposure.Mesh exposure was identified through postoperative vaginal examination.Statistical analysis was performed to identify risk factors for mesh exposure.Results:Two-hundred and nine transvaginal PP meshes were placed,including 194 in the anterior wall and 15 in the posterior wall.Concomitant tension-free vaginal tape was performed in 61 cases.The mean follow-up time was 35.1 ± 23.6 months.PP mesh exposure was identified in 32 cases (16.4％),with 31 in the anterior wall and 1 in the posterior wall.Significant difference was found in operating time and concomitant procedures between exposed and nonexposed groups (F =7.443,P =0.007;F =4.307,P =0.039,respectively).Binary logistic regression revealed that the number of concomitant procedures and operation time were risk factors for mesh exposure (P =0.001,P =0.043).Conclusion:Concomitant procedures and increased operating time increase the risk for postoperative mesh exposure in patients undergoing TVM surgery for POP.
LanHEP—a package for the automatic generation of Feynman rules in field theory. Version 3.0
Semenov, A. V.
2009-03-01
The LanHEP program version 3.0 for Feynman rules generation from the Lagrangian is described. It reads the Lagrangian written in a compact form, close to the one used in publications. It means that Lagrangian terms can be written with summation over indices of broken symmetries and using special symbols for complicated expressions, such as covariant derivative and strength tensor for gauge fields. Supersymmetric theories can be described using the superpotential formalism and the 2-component fermion notation. The output is Feynman rules in terms of physical fields and independent parameters in the form of CompHEP model files, which allows one to start calculations of processes in the new physical model. Alternatively, Feynman rules can be generated in FeynArts format or as LaTeX table. One-loop counterterms can be generated in FeynArts format. Program summaryProgram title: LanHEP Catalogue identifier: ADZV_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AECH_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 83 041 No. of bytes in distributed program, including test data, etc.: 1 090 931 Distribution format: tar.gz Programming language: C Computer: PC Operating system: Linux RAM: 2 MB (SM), 12 MB (MSSM), 120 MB (MSSM with counterterms) Classification: 4.4 Nature of problem: Deriving Feynman rules from the Lagrangian Solution method: The program reads the Lagrangian written in a compact form, close to the one used in publications. It means that Lagrangian terms can be written with summation over indices of broken symmetries and using special symbols for complicated expressions, such as covariant derivative and strength tensor for gauge fields. Tools for checking the correctness of the model, and for simplifying the output expressions are provided. The output is
模型驱动下的数据库自动生成%Automatic Generation of Database Based on Model Driven
Institute of Scientific and Technical Information of China (English)
王海林
2011-01-01
为提高软件开发效率,提出模型驱动下的数据库自动生成方法.该方法以MetaEdit+作为元建模工具,由领域专家建立领域元模型和模型,通过生成器定义语言MERL,软件开发人员可以很方便地设计代码生成器,直接从领域专家所建立的图形领域模型生成Java程序代码,并运行已生成的程序代码进而生成数据库.通过一个实例详细介绍了数据库概念模型元模型设计、E-R模型设计并给出从E-R模型到Java代码的生成器设计.经测试,所生成的Java程序代码可以在Windows操作系统环境的Java平台上运行,并能正确生成Oracle 10g数据库实例.%In order to promote software's development efficiency, is proposes an approach of database, automatic generation based on model driven. This approach takes MetaEdit-t- as a meta-modeling tool. Domain meta-models and models are established by domain experts. By using generator definition language MERL, the software developers can design code generators very conveniently. From the graph domain models which are established by domain experts, code generators can generate Java codes directly and then the generated codes can produce database. It introduces in detail design of database conceptual meta-model, E-R model and generators for Java code through an instance. The test result indicates that the generated Java codes can run correctly on Java platforms in Windows operating system environment and then can produce a database instance in Oracle lOg.
Parameterization for fitting triangular mesh
Institute of Scientific and Technical Information of China (English)
LIN Hongwei; WANG Guojin; LIU Ligang; BAO Hujun
2006-01-01
In recent years, with the development of 3D data acquisition equipments, the study on reverse engineering has become more and more important. However, the existing methods for parameterization can hardly ensure that the parametric domain is rectangular, and the parametric curve grid is regular. In order to overcome these limitations, we present a novel method for parameterization of triangular meshes in this paper. The basic idea is twofold: first, because the isotherms in the steady temperature do not intersect with each other, and are distributed uniformly, no singularity (fold-over) exists in the parameterization; second, a 3D harmonic equation is solved by the finite element method to obtain the steady temperature field on a 2D triangular mesh surface with four boundaries. Therefore, our proposed method avoids the embarrassment that it is impossible to solve the 2D quasi-harmonic equation on the 2D triangular mesh without the parametric values at mesh vertices. Furthermore, the isotherms on the temperature field are taken as a set of iso-parametric curves on the triangular mesh surface. The other set of iso-parametric curves can be obtained by connecting the points with the same chord-length on the isotherms sequentially. The obtained parametric curve grid is regular, and distributed uniformly, and can map the triangular mesh surface to the unit square domain with boundaries of mesh surface to boundaries of parametric domain, which ensures that the triangular mesh surface or point cloud can be fitted with the NURBS surface.
An Improved Moving Mesh Algorithm
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
we consider an iterative algorithm of mesh optimization for finite element solution, and give an improved moving mesh strategy that reduces rapidly the complexity and cost of solving variational problems.A numerical result is presented for a 2-dimensional problem by the improved algorithm.
Energy Technology Data Exchange (ETDEWEB)
Schadewaldt, N; Schulz, H; Helle, M; Renisch, S [Philips Research Laboratories Hamburg, Hamburg (Germany); Frantzen-Steneker, M; Heide, U [The Netherlands Cancer Institute, Amsterdam (Netherlands)
2014-06-01
Purpose: To analyze the effect of computing radiation dose on automatically generated MR-based simulated CT images compared to true patient CTs. Methods: Six prostate cancer patients received a regular planning CT for RT planning as well as a conventional 3D fast-field dual-echo scan on a Philips 3.0T Achieva, adding approximately 2 min of scan time to the clinical protocol. Simulated CTs (simCT) where synthesized by assigning known average CT values to the tissue classes air, water, fat, cortical and cancellous bone. For this, Dixon reconstruction of the nearly out-of-phase (echo 1) and in-phase images (echo 2) allowed for water and fat classification. Model based bone segmentation was performed on a combination of the DIXON images. A subsequent automatic threshold divides into cortical and cancellous bone. For validation, the simCT was registered to the true CT and clinical treatment plans were re-computed on the simCT in pinnacle{sup 3}. To differentiate effects related to the 5 tissue classes and changes in the patient anatomy not compensated by rigid registration, we also calculate the dose on a stratified CT, where HU values are sorted in to the same 5 tissue classes as the simCT. Results: Dose and volume parameters on PTV and risk organs as used for the clinical approval were compared. All deviations are below 1.1%, except the anal sphincter mean dose, which is at most 2.2%, but well below clinical acceptance threshold. Average deviations are below 0.4% for PTV and risk organs and 1.3% for the anal sphincter. The deviations of the stratifiedCT are in the same range as for the simCT. All plans would have passed clinical acceptance thresholds on the simulated CT images. Conclusion: This study demonstrated the clinical usability of MR based dose calculation with the presented Dixon acquisition and subsequent fully automatic image processing. N. Schadewaldt, H. Schulz, M. Helle and S. Renisch are employed by Phlips Technologie Innovative Techonologies, a
Design of Automatic Solar Photovoltaic Power Generation Device%全自动光伏发电装置的设计
Institute of Scientific and Technical Information of China (English)
周天沛
2011-01-01
This paper introduces an automatic following system which takes DS 1302 and AT89S51 as the core. The stepper motor is controlled by using the method of the comparison of photoresistors, and by using the stepper motor to drive the biaxial mechanical tracking system to assure the solar panels vertical to the solar incident angle, thus improve the conversion efficiency of the solar energy. Everyday the device can return the initial sitting after tracking, and in the second day,it will continue track automatically to remove the accumulative error. The results show that the device generates more electricity than the fixed photovoltaic system continuously during the period of the experiment and its total power production is approximately 3.12 times of the latter. The anticipative targets is reached. It has widespread applicable potentialities.%设计了一套以DS1302和AT89S51单片机为核心的全自动跟踪光伏发电装置,采用光敏电阻比较法对步进电机进行控制,并利用步进电机驱动双轴机械驱动定位系统,使太阳能电池板始终垂直于太阳入射角,从而提高太阳能的转换效率.该装置能够在每天跟踪结束后自动回到初始位置,第二天继续自动跟踪,从而消除积累误差.实验证明,该装置在测量时段内的发电量始终明显大于固定光伏系统,是后者的3.12倍,达到预期的性能指标,具有广泛的应用潜力.
Design of Controller for Automatic Tracking Solar Power Generation%全天候太阳能自动跟踪系统装置的研究
Institute of Scientific and Technical Information of China (English)
郑锋; 王炜灵; 陈健强; 陈泽群; 张晓薇
2014-01-01
本文提出了一种全天候太阳能自动跟踪系统。在检测系统上，硬件方面使用实际的光电跟踪模型，软件上设置视日运动轨迹跟踪程序；在控制系统上，采用双轴跟踪的机械传动机构，通过驱动直流电机调整太阳能板的最佳位置，并通过传功装置实现单台电机带动整排太阳能电池板的联动；针对阴雨天和狂风天气控制系统做出一系列的预防措施。本装置旨在全天采光发电，结构简单、能耗低、效率高。%The principle and structure of an intelligent automatic solar tracker are proposed. For testing system, a modelofphotoelectric tracing as hardware is used to track light while the device sets up a program to analysis the movement of the light as software. For controlling system, the controller has a two-axis tracker for mechanical design,and promote the whole row of solar panel linked by linkage. The controller drives the stepping motor to adjust the position of the solar panel to follow the sunlight,and. Other actions are taken to avoid the rain and strong wind. And the intelligent energy-saving design is involved. The simple-designed and energy-saving automatic tracking solar power generation is expected to work in days with highly efficiency.
DEFF Research Database (Denmark)
Burelli, Paolo; Preuss, Mike
2014-01-01
Automatically generating computer animations is a challenging and complex problem with applications in games and film production. In this paper, we investigate howto translate a shot list for a virtual scene into a series of virtual camera configurations — i.e automatically controlling the virtual...... camera. We approach this problem by modelling it as a dynamic multi-objective optimisation problem and show how this metaphor allows a much richer expressiveness than a classical single objective approach. Finally, we showcase the application of a multi-objective evolutionary algorithm to generate a shot...
Kuzma, H. A.; Arehart, E.; Louie, J. N.; Witzleben, J. L.
2012-04-01
Listening to the waveforms generated by earthquakes is not new. The recordings of seismometers have been sped up and played to generations of introductory seismology students, published on educational websites and even included in the occasional symphony. The modern twist on earthquakes as music is an interest in using state-of-the-art computer algorithms for seismic data processing and evaluation. Algorithms such as such as Hidden Markov Models, Bayesian Network models and Support Vector Machines have been highly developed for applications in speech recognition, and might also be adapted for automatic seismic data analysis. Over the last three years, the International Data Centre (IDC) of the Comprehensive Test Ban Treaty Organization (CTBTO) has supported an effort to apply computer learning and data mining algorithms to IDC data processing, particularly to the problem of weeding through automatically generated event bulletins to find events which are non-physical and would otherwise have to be eliminated by the hand of highly trained human analysts. Analysts are able to evaluate events, distinguish between phases, pick new phases and build new events by looking at waveforms displayed on a computer screen. Human ears, however, are much better suited to waveform processing than are the eyes. Our hypothesis is that combining an auditory representation of seismic events with visual waveforms would reduce the time it takes to train an analyst and the time they need to evaluate an event. Since it takes almost two years for a person of extraordinary diligence to become a professional analyst and IDC contracts are limited to seven years by Treaty, faster training would significantly improve IDC operations. Furthermore, once a person learns to distinguish between true and false events by ear, various forms of audio compression can be applied to the data. The compression scheme which yields the smallest data set in which relevant signals can still be heard is likely an
改进的蠕虫特征自动提取模型及算法设计%Improved Automatic Generation Model of Worm Signatures
Institute of Scientific and Technical Information of China (English)
汪颖; 康松林
2012-01-01
This paper presents an worm signatures automatic generation model based on sequence aligment, it uses unified tilting and clustering processing to enhance the suspicious traffic sample＇s purtity, and with the modified T-Coffe multiple sequence alignment algorithm to generate worms signature. For comparative analysis of the signature generation model, this paper use two popular kinds of algorithms---Apache-Knacker algorithm and Hamsa algorithnr--to capture the signature of Apache-Knacker and TSIG worms virus. According to the experiment result, the signature generation model which are proposed in this paper is superior to the other two kinds of technology.%文章提出了一种基于序列比对的蠕虫特征自动提取模型，该模型针对现有蠕虫特征自动提取系统的可疑蠕虫样本流量单来源和粗预处理等问题，提出了对网络边界可疑流量和蜜罐捕获网络流量统一的聚类预处理，并使用改进的T-Coffee多序列比对算法进行蠕虫特征提取。实验分别对Apache-Knacker和TSIG这两种蠕虫病毒进行特征提取，从实验结果可以看出文章提出的模型产生的特征质量优于比较流行的Polygraph、Hamsa两种技术。
Adaptive and Unstructured Mesh Cleaving
Bronson, Jonathan R.; Sastry, Shankar P.; Levine, Joshua A.; Whitaker, Ross T.
2015-01-01
We propose a new strategy for boundary conforming meshing that decouples the problem of building tetrahedra of proper size and shape from the problem of conforming to complex, non-manifold boundaries. This approach is motivated by the observation that while several methods exist for adaptive tetrahedral meshing, they typically have difficulty at geometric boundaries. The proposed strategy avoids this conflict by extracting the boundary conforming constraint into a secondary step. We first build a background mesh having a desired set of tetrahedral properties, and then use a generalized stenciling method to divide, or “cleave”, these elements to get a set of conforming tetrahedra, while limiting the impacts cleaving has on element quality. In developing this new framework, we make several technical contributions including a new method for building graded tetrahedral meshes as well as a generalization of the isosurface stuffing and lattice cleaving algorithms to unstructured background meshes. PMID:26137171
一个XML文档自动生成器模型设计%DESIGN OF A MODEL OF XML DOCUMENTS' AUTOMATIC GENERATOR
Institute of Scientific and Technical Information of China (English)
孙煜飞; 马良荔; 吴清怡
2013-01-01
XML作为交互性电子技术手册创作中技术数据的描述方法,是实现技术信息共享和交换的关键技术.基于相应的XML-Schema约束,设计一个选择数据模块类别、提交数据文档,输出相应的XML文档的自动生成器模型.有效解决了XML编辑过程中的繁琐录入过程,为开发类似的数据模块编辑器提供思路.%As the description way of technical data in compiling Interactive Electronic Technical Manuals (IETM) , XML is the key technology to realise the sharing and exchange of technical information. Based on corresponding XML-Schema constraints, we design an automatic generator model, which can select data module category and submit data files, as well as export relevant XML documents. This generator effectively solves the complicated inputting process in XML documents editing, and provides an idea for the development of similar data module editors.
Pheiffer, Thomas S.; Ou, Jao J.; Miga, Michael I.
2010-02-01
Modality-independent elastography (MIE) is a method of elastography that reconstructs the elastic properties of tissue using images acquired under different loading conditions and a biomechanical model. Boundary conditions are a critical input to the algorithm, and are often determined by time-consuming point correspondence methods requiring manual user input. Unfortunately, generation of accurate boundary conditions for the biomechanical model is often difficult due to the challenge of accurately matching points between the source and target surfaces and consequently necessitates the use of large numbers of fiducial markers. This study presents a novel method of automatically generating boundary conditions by non-rigidly registering two image sets with a Demons diffusion-based registration algorithm. The use of this method was successfully performed in silico using magnetic resonance and X-ray computed tomography image data with known boundary conditions. These preliminary results have produced boundary conditions with accuracy of up to 80% compared to the known conditions. Finally, these boundary conditions were utilized within a 3D MIE reconstruction to determine an elasticity contrast ratio between tumor and normal tissue. Preliminary results show a reasonable characterization of the material properties on this first attempt and a significant improvement in the automation level and viability of the method.
Automatic generation of attack vectors for stored-XSS%存储型XSS攻击向量自动化生成技术
Institute of Scientific and Technical Information of China (English)
陈景峰; 王一丁; 张玉清; 刘奇旭
2012-01-01
针对危害性最为严重的存储型XSS漏洞的特点及其触发方式,设计并实现了一款自动生成存储型XSS攻击向量的工具.使用该工具对中国2个大型视频分享网站的日志发布系统进行测试,发现6类导致存储型XSS漏洞的攻击向量.实验结果验证了该方法及测试工具的有效性,并说明中国视频网站仍存在着较大安全隐患.%The stored-XSS (cross-site scripting) is generally more serious than the other modalities of XSS. We study the characteristics and trigger mechanism of stored-XSS, propose an generation method of attack vectors for stored-XSS, and accomplish a tool which can generate the attack vectors automatically. After we used this tool in testing the blog systems of two popular video-sharing sites in China, we found 6 types of attcak vectors which can trigger stored-XSS. The results of the testing experiments show the effectiveness of our method and also show the potential security risk in the video-sharing sites.
基于Matlab模糊控制器HDL代码的自动生成%Fuzzy Controller HDL Code Automatically Generated Based on Matlab
Institute of Scientific and Technical Information of China (English)
诸葛俊贵
2012-01-01
This article, taking the Water Level Control in a Tank as an example, proposes a fuzzy controller automatic HDL code generation method based on Matlab. The generated code can be ported to the FPGA control system. The method is divided into four steps ： （ 1 ） The fuzzy controller is designed using Fuzzy Logic Toolbox in the Matlab. （2） The fuzzy controller is transformed into the form of Lookup Table. （3） The controller Lookup table is implemented with the state machine. （4） The fuzzy controller implementation with state machine was translated into HDL code by HDL Coder.%以水箱液位控制为例，提出了一种基于Maflab的模糊控制器HDL代码自动生成方法，生成的代码可以移植到FPGA控制系统上。该方法分4个步骤：（1）利用Maflab的FuzzyLogic工具箱设计模糊控制器。（2）将模糊控制器转换为LookupTable的形式。（3）将制作好的控制器查找表用状态机实现。（4）用HDLCoder将状态机实现的模糊控制器翻译成HDL代码。
Institute of Scientific and Technical Information of China (English)
赵明洁; 徐岩
2012-01-01
结合标准件自动绘图系统的具体要求及不同标准件的数据特点,在AutoCAD环境下,使用AutoLISP语言开发了参数化标准件图形自动生成系统.该系统采用交互式输入、程序化处理和数据文件管理等方式处理数据,可以自动生成各种标准件图形.%Combined the specific requirements of automatic drawing system of standard parts with the data characteristics of different standard parts, the parameterized standard graphics automatic generating system is developed in AutoLISP language under AutoCAD environment. By the way of interactive input, procedure processing and data file management, the system can generate the graphics of various standard parts automatically.
Energy Technology Data Exchange (ETDEWEB)
Monroy-Guzman, F., E-mail: fabiola.monroy@inin.gob.mx [Instituto Nacional de Investigaciones Nucleares, Carretera Mexico-Toluca S/N, La Marquesa, Ocoyoacac, 52750, Estado de Mexico (Mexico); Rivero Gutierrez, T., E-mail: tonatiuh.rivero@inin.gob.mx [Instituto Nacional de Investigaciones Nucleares, Carretera Mexico-Toluca S/N, La Marquesa, Ocoyoacac, 52750, Estado de Mexico (Mexico); Lopez Malpica, I.Z.; Hernandez Cortes, S.; Rojas Nava, P.; Vazquez Maldonado, J.C. [Instituto Nacional de Investigaciones Nucleares, Carretera Mexico-Toluca S/N, La Marquesa, Ocoyoacac, 52750, Estado de Mexico (Mexico); Vazquez, A. [Instituto Mexicano del Petroleo, Eje Central Norte Lazaro Cardenas 152, Col. San Bartolo Atepehuacan, 07730, Mexico D.F. (Mexico)
2012-01-15
DISIGEG is a synthesis installation of zirconium {sup 99}Mo-molybdate gels for {sup 99}Mo/{sup 99m}Tc generator production, which has been designed, built and installed at the ININ. The device consists of a synthesis reactor and five systems controlled via keyboard: (1) raw material access, (2) chemical air stirring, (3) gel dried by air and infrared heating, (4) moisture removal and (5) gel extraction. DISIGEG operation is described and dried condition effects of zirconium {sup 99}Mo- molybdate gels on {sup 99}Mo/{sup 99m}Tc generator performance were evaluated as well as some physical-chemical properties of these gels. The results reveal that temperature, time and air flow applied during the drying process directly affects zirconium {sup 99}Mo-molybdate gel generator performance. All gels prepared have a similar chemical structure probably constituted by three-dimensional network, based on zirconium pentagonal bipyramids and molybdenum octahedral. Basic structural variations cause a change in gel porosity and permeability, favouring or inhibiting {sup 99m}TcO{sub 4}{sup -} diffusion into the matrix. The {sup 99m}TcO{sub 4}{sup -} eluates produced by {sup 99}Mo/{sup 99m}Tc zirconium {sup 99}Mo-molybdate gel generators prepared in DISIGEG, air dried at 80 Degree-Sign C for 5 h and using an air flow of 90 mm, satisfied all the Pharmacopoeias regulations: {sup 99m}Tc yield between 70-75%, {sup 99}Mo breakthrough less than 3 Multiplication-Sign 10{sup -3}%, radiochemical purities about 97% sterile and pyrogen-free eluates with a pH of 6. - Highlights: Black-Right-Pointing-Pointer {sup 99}Mo/{sup 99m}Tc generators based on {sup 99}Mo-molybdate gels were synthesized at a semi-automatic device. Black-Right-Pointing-Pointer Generator performances depend on synthesis conditions of the zirconium {sup 99}Mo-molybdate gel. Black-Right-Pointing-Pointer {sup 99m}TcO{sub 4}{sup -} diffusion and yield into generator depends on gel porosity and permeability. Black
Semi-structured meshes for axial turbomachinery blades
Sbardella, L.; Sayma, A. I.; Imregun, M.
2000-03-01
This paper describes the development and application of a novel mesh generator for the flow analysis of turbomachinery blades. The proposed method uses a combination of structured and unstructured meshes, the former in the radial direction and the latter in the axial and tangential directions, in order to exploit the fact that blade-like structures are not strongly three-dimensional since the radial variation is usually small. The proposed semi-structured mesh formulation was found to have a number of advantages over its structured counterparts. There is a significant improvement in the smoothness of the grid spacing and also in capturing particular aspects of the blade passage geometry. It was also found that the leading- and trailing-edge regions could be discretized without generating superfluous points in the far field, and that further refinements of the mesh to capture wake and shock effects were relatively easy to implement. The capability of the method is demonstrated in the case of a transonic fan blade for which the steady state flow is predicted using both structured and semi-structured meshes. A totally unstructured mesh is also generated for the same geometry to illustrate the disadvantages of using such an approach for turbomachinery blades. Copyright
Energy Technology Data Exchange (ETDEWEB)
Greene, Patrick T. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Schofield, Samuel P. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Nourgaliev, Robert [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-06-21
A new mesh smoothing method designed to cluster mesh cells near a dynamically evolving interface is presented. The method is based on weighted condition number mesh relaxation with the weight function being computed from a level set representation of the interface. The weight function is expressed as a Taylor series based discontinuous Galerkin projection, which makes the computation of the derivatives of the weight function needed during the condition number optimization process a trivial matter. For cases when a level set is not available, a fast method for generating a low-order level set from discrete cell-centered elds, such as a volume fraction or index function, is provided. Results show that the low-order level set works equally well for the weight function as the actual level set. Meshes generated for a number of interface geometries are presented, including cases with multiple level sets. Dynamic cases for moving interfaces are presented to demonstrate the method's potential usefulness to arbitrary Lagrangian Eulerian (ALE) methods.
Directory of Open Access Journals (Sweden)
Priti Srinivas Sajja
2015-04-01
Full Text Available This paper illustrates architecture for a multi agent system in healthcare domain. The architecture is generic and designed in form of multiple layers. One of the layers of the architecture contains many proactive, co-operative and intelligent agents such as resource management agent, query agent, pattern detection agent and patient management agent. Another layer of the architecture is a collection of libraries to auto-generate code for agents using soft computing techniques. At this stage, codes for artificial neural network and fuzzy logic are developed and encompassed in this layer. The agents use these codes for development of neural network, fuzzy logic or hybrid solutions such as neuro-fuzzy solution. Third layer encompasses knowledge base, metadata and other local databases. The multi layer architecture is supported by personalized user interfaces for friendly interaction with its users. The framework is generic, flexible, and designed for a distributed environment like the Web; with minor modifications it can be employed on grid or cloud platform. The paper also discusses detail design issues, suitable applications and future enhancement of the work.
Gamra: Simple Meshes for Complex Earthquakes
Landry, Walter
2016-01-01
The static offsets caused by earthquakes are well described by elastostatic models with a discontinuity in the displacement along the fault. A traditional approach to model this discontinuity is to align the numerical mesh with the fault and solve the equations using finite elements. However, this distorted mesh can be difficult to generate and update. We present a new numerical method, inspired by the Immersed Interface Method, for solving the elastostatic equations with embedded discontinuities. This method has been carefully designed so that it can be used on parallel machines on an adapted finite difference grid. We have implemented this method in Gamra, a new code for earth modelling. We demonstrate the correctness of the method with analytic tests, and we demonstrate its practical performance by solving a realistic earthquake model to extremely high precision.
Energy Technology Data Exchange (ETDEWEB)
Brito Filho, Pedro Rodrigues de; Nascimento Garcez, Jurandyr do [Para Univ., Belem, PA (Brazil). Centro Tecnologico; Charone Junior, Wady [Centrais Eletricas do Nordeste do Brasil S.A. (ELETRONORTE), Belem, PA (Brazil)
1994-12-31
This work presents an application of artificial neural network as a support to decision making in the automatic generation control (AGC) of the ELETRONORTE. It uses a software to auxiliary in the decisions in real time of the AGC. (author) 2 refs., 6 figs., 1 tab.
Evaluating the Potential of Rtk-Uav for Automatic Point Cloud Generation in 3d Rapid Mapping
Fazeli, H.; Samadzadegan, F.; Dadrasjavan, F.
2016-06-01
During disaster and emergency situations, 3D geospatial data can provide essential information for decision support systems. The utilization of geospatial data using digital surface models as a basic reference is mandatory to provide accurate quick emergency response in so called rapid mapping activities. The recipe between accuracy requirements and time restriction is considered critical in this situations. UAVs as alternative platforms for 3D point cloud acquisition offer potentials because of their flexibility and practicability combined with low cost implementations. Moreover, the high resolution data collected from UAV platforms have the capabilities to provide a quick overview of the disaster area. The target of this paper is to experiment and to evaluate a low-cost system for generation of point clouds using imagery collected from a low altitude small autonomous UAV equipped with customized single frequency RTK module. The customized multi-rotor platform is used in this study. Moreover, electronic hardware is used to simplify user interaction with the UAV as RTK-GPS/Camera synchronization, and beside the synchronization, lever arm calibration is done. The platform is equipped with a Sony NEX-5N, 16.1-megapixel camera as imaging sensor. The lens attached to camera is ZEISS optics, prime lens with F1.8 maximum aperture and 24 mm focal length to deliver outstanding images. All necessary calibrations are performed and flight is implemented over the area of interest at flight height of 120 m above the ground level resulted in 2.38 cm GSD. Earlier to image acquisition, 12 signalized GCPs and 20 check points were distributed in the study area and measured with dualfrequency GPS via RTK technique with horizontal accuracy of σ = 1.5 cm and vertical accuracy of σ = 2.3 cm. results of direct georeferencing are compared to these points and experimental results show that decimeter accuracy level for 3D points cloud with proposed system is achievable, that is suitable
软件测试数据自动生成算法的仿真研究%Simulation Research on Automatically Generate Software Test Data Algorithm
Institute of Scientific and Technical Information of China (English)
黄丽芬
2012-01-01
Testing data is the most crucial part in software testing software, and it is important for the software test automation degree to improve the automatic software test data generation method. Aiming at the defects of genetic algorithm and ant colony algorithm, a new software test data generation algorithm was proposed in this paper based on genetic and ant colony algorithm. Firstly, genetic algorithm which has the global searching ability was used to find the optimal solution, and then the optimal solution was converted into the initial pheromone of ant colony algorithm. Finally, the best test data were found by ant colony algorithm positive feedback mechanism quickly. The experimental results show that the proposed method improves the efficiency of software test data generation and has very important using value.%研究软件质量优化问题,传统遗传算法存在局部最优、收敛速度慢,使软件测试数据自动生成效率低.为提高软件测试数据生成效率,对传统遗传算法进行改进,提出一种遗传-蚁群算法的软件测试数据生成算法.针对测试数据自动生成的特点,充分发挥遗传算法的全局搜索和蚁群算法的局部搜索优势,提高了测试数据的生成能力.实验结果表明,遗传-蚁群算法提高了软件测试数据生成效率,是一种较为理想的软件测试数据生成算法.
Directory of Open Access Journals (Sweden)
G. Lucas
2015-08-01
Full Text Available This paper introduces research done on the automatic preparation of remediation plans and navigation data for the precise guidance of heavy machinery in clean-up work after an industrial disaster. The input test data consists of a pollution extent shapefile derived from the processing of hyperspectral aerial survey data from the Kolontár red mud disaster. Three algorithms were developed and the respective scripts were written in Python. The first model aims at drawing a parcel clean-up plan. The model tests four different parcel orientations (0, 90, 45 and 135 degree and keeps the plan where clean-up parcels are less numerous considering it is an optimal spatial configuration. The second model drifts the clean-up parcel of a work plan both vertically and horizontally following a grid pattern with sampling distance of a fifth of a parcel width and keep the most optimal drifted version; here also with the belief to reduce the final number of parcel features. The last model aims at drawing a navigation line in the middle of each clean-up parcel. The models work efficiently and achieve automatic optimized plan generation (parcels and navigation lines. Applying the first model we demonstrated that depending on the size and geometry of the features of the contaminated area layer, the number of clean-up parcels generated by the model varies in a range of 4% to 38% from plan to plan. Such a significant variation with the resulting feature numbers shows that the optimal orientation identification can result in saving work, time and money in remediation. The various tests demonstrated that the model gains efficiency when 1/ the individual features of contaminated area present a significant orientation with their geometry (features are long, 2/ the size of pollution extent features becomes closer to the size of the parcels (scale effect. The second model shows only 1% difference with the variation of feature number; so this last is less interesting for
Streaming Compression of Hexahedral Meshes
Energy Technology Data Exchange (ETDEWEB)
Isenburg, M; Courbet, C
2010-02-03
We describe a method for streaming compression of hexahedral meshes. Given an interleaved stream of vertices and hexahedral our coder incrementally compresses the mesh in the presented order. Our coder is extremely memory efficient when the input stream documents when vertices are referenced for the last time (i.e. when it contains topological finalization tags). Our coder then continuously releases and reuses data structures that no longer contribute to compressing the remainder of the stream. This means in practice that our coder has only a small fraction of the whole mesh in memory at any time. We can therefore compress very large meshes - even meshes that do not file in memory. Compared to traditional, non-streaming approaches that load the entire mesh and globally reorder it during compression, our algorithm trades a less compact compressed representation for significant gains in speed, memory, and I/O efficiency. For example, on the 456k hexahedra 'blade' mesh, our coder is twice as fast and uses 88 times less memory (only 3.1 MB) with the compressed file increasing about 3% in size. We also present the first scheme for predictive compression of properties associated with hexahedral cells.
Finite element simulation of stretch forging using a mesh condensation method
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
In order to reduce the computation time of finite element simulations of stretch forging process,a mesh condensation method is presented and applied to a three-dimensional rigid-viscoplastic finite element program.In this method,a conventional mesh for the whole zone of a workpiece is condensed to a computational mesh for the active deformation zone.Two vital problems are solved,which are automatic construction of the computational mesh and treatment of interfaces between the deformation zone and the rigid zone.The mesh condensation method is compared with conventional finite element method by simulations of a six-bite stretch forging process.Some simulation results including forging load,temperature distribution and effective strain distribution are illustrated.The efficiency and accuracy of this method are verified.
Mesh Adaptation and Shape Optimization on Unstructured Meshes Project
National Aeronautics and Space Administration — In this SBIR CRM proposes to implement the entropy adjoint method for solution adaptive mesh refinement into the Loci/CHEM unstructured flow solver. The scheme will...
Calculating the vertex unknowns of nine point scheme on quadrilateral meshes for diffusion equation
Institute of Scientific and Technical Information of China (English)
YUAN GuangWei; SHENG ZhiQiang
2008-01-01
In the construction of nine point scheme, both vertex unknowns and cell-centered unknowns are introduced, and the vertex unknowns are usually eliminated by using the interpolation of neighboring cell-centered unknowns, which often leads to lose accuracy. Instead of using interpolation,here we propose a different method of calculating the vertex unknowns of nine point scheme, which are solved independently on a new generated mesh. This new mesh is a Voronoi mesh based on the vertexes of primary mesh and some additional points on the interface. The advantage of this method is that it is particularly suitable for solving diffusion problems with discontinuous coefficients on highly distorted meshes, and it leads to a symmetric positive definite matrix. We prove that the method has first-order convergence on distorted meshes. Numerical experiments show that the method obtains nearly second-order accuracy on distorted meshes.
Calculating the vertex unknowns of nine point scheme on quadrilateral meshes for diffusion equation
Institute of Scientific and Technical Information of China (English)
2008-01-01
In the construction of nine point scheme,both vertex unknowns and cell-centered unknowns are introduced,and the vertex unknowns are usually eliminated by using the interpolation of neighboring cell-centered unknowns,which often leads to lose accuracy.Instead of using interpolation,here we propose a different method of calculating the vertex unknowns of nine point scheme,which are solved independently on a new generated mesh.This new mesh is a Vorono¨i mesh based on the vertexes of primary mesh and some additional points on the interface.The advantage of this method is that it is particularly suitable for solving diffusion problems with discontinuous coeffcients on highly distorted meshes,and it leads to a symmetric positive definite matrix.We prove that the method has first-order convergence on distorted meshes.Numerical experiments show that the method obtains nearly second-order accuracy on distorted meshes.
Institute of Scientific and Technical Information of China (English)
谢朝; 骆科林; 邹炼; 胡金有
2016-01-01
目的：自动快速计算治疗计划的剂量体积直方图（DVH），并与医生处方要求相比较。方法使用AutoHotkey热键脚本语言和高级程序设计语言C#，开发了适合于Eclipse11.0计划系统的DVH自动生成比较软件ShowDVH，该软件由处方文档生成、C#中DVH操作函数、软件可视化及DVH比较报告生成模块构成。结果在临床上选取不同病种各10例，调用ShowDVH在计划系统下运行，ShowDVH不仅能生成DVH报告，还能准确判断治疗计划是否满足医生处方要求，为调强优化参数设置给予方向指导。结论该软件界面友好，功能强大，能快速计算生成比较DVH，大大节约计划设计时间，提高放射治疗物理师工作效率。%Objective This study is to automaticaly calculatethe dose volume histogram(DVH) for the treatment plan, then to compare it with requirements of doctor's prescriptions.Methods The scripting language Autohotkey and programming language C# were used to develop a compared software for automatically generated DVH in Eclipse TPS. This software is named Show Dose Volume Histogram (ShowDVH), which is composed of prescription documents generation, operation functions of DVH, software visualization and DVH compared report generation.Results Ten cases in different cancers have been separately selected, in Eclipse TPS 11.0 ShowDVH could not only automaticaly generate DVH reports but also accurately determine whether treatment plans meet the requirements of doctor’s prescriptions, then reports gave direction for setting optimization parameters of intensity modulated radiated therapy. Conclusions The ShowDVH is an user-friendly and powerful software, and can automaticaly generated compared DVH reports fast in Eclipse TPS 11.0. With the help of ShowDVH, it greatly saves plan designing time and improves working effi ciency of radiation therapy physicists.
Dephi中基于ADO技术实现定制报表的生成%ADO technology based automatic generation of customized report forms in Dephi
Institute of Scientific and Technical Information of China (English)
丁风海; 夏伟; 邱斌; 王琳娜
2012-01-01
ADO (active data objects) is OLE DB technology developed by Microsoft Corporation. It is based on the data access rules and API access, and provides a consistent, high-performance and high compatibility data access interface. The application of ADO technological development application program allows the program developers to control database access easily, thus can produce database access procedures which meet client requirements. The access mechanism and method of the databases which use ADO technology in Dephi is introduced emphatically. Through a simple example, the highly specialized customized report forms automatically generated by combining OLE Automation technology are described in detail.%ADO是Microsoft发展的OLE DB技术,它基于COM数据访问规则和API访问,并提供一个一致、高性能、高兼容性的数据访问接口.使用ADO技术开发应用程序可以使程序开发者更容易地控制对数据库的访问,从而产生符合用户需求的数据库访问程序.着重介绍了在Dephi中应用ADO技术的数据库的访问机制和实现方法,并通过简单实例详述结合OLE自动化技术自动生成专业性较强的定制报表.
Automatic Generation of the Reconfigurable Robot Forward and Inverse Kinematics%可重组机器人运动学正逆解的自动生成
Institute of Scientific and Technical Information of China (English)
费燕琼; 冯光涛; 赵锡芳; 徐卫良
2000-01-01
When the configuration of reconfigurable modular robot is finalized, the link module and joint module are gained. The PME method is adopted. So the forward kinematics is generated automatically. As for the inverse kinematics, this paper transferred the body coordinate system to the fixed coordinate system and found the rules, then divided them into 4 sub-problems. With the PME method, the inverse kinematics algorithm (PMEI method) was got. Under Windows environment some examples were given.%可重组模块机器人构形确定后，找出依序的连杆、关节模块，采用指数积(PME)法，自动生 成运动学正方程．把运动学正方程转换成相对于固定坐标系的方程，找出规律，分成4个子问题，成 功地运用PME法得到自动求模块机器人逆解的算法—逆运动学指数积(PMEI)法．windows环 境下正逆解的自动生成说明了该方法的可行性．
Mersiline mesh in premaxillary augmentation.
Foda, Hossam M T
2005-01-01
Premaxillary retrusion may distort the aesthetic appearance of the columella, lip, and nasal tip. This defect is characteristically seen in, but not limited to, patients with cleft lip nasal deformity. This study investigated 60 patients presenting with premaxillary deficiencies in which Mersiline mesh was used to augment the premaxilla. All the cases had surgery using the external rhinoplasty technique. Two methods of augmentation with Mersiline mesh were used: the Mersiline roll technique, for the cases with central symmetric deficiencies, and the Mersiline packing technique, for the cases with asymmetric deficiencies. Premaxillary augmentation with Mersiline mesh proved to be simple technically, easy to perform, and not associated with any complications. Periodic follow-up evaluation for a mean period of 32 months (range, 12-98 months) showed that an adequate degree of premaxillary augmentation was maintained with no clinically detectable resorption of the mesh implant.
Energy Technology Data Exchange (ETDEWEB)
Valenzuela Gutierrez, L.
2008-07-01
The main objective of this dissertation has been the contributions to the operation in automatic mode of a new generation of direct steam generation solar plants with parabolic-trough collectors. The dissertation starts introducing the parabolic-trough collectors solar thermal technology for the generation of process steam or steam for a Rankine cycle in the case of power generation generation, which is currently the most developed and commercialized technology. Presently, the parabolic-trough collectors technology is based on the configuration known as heat-exchanger system, based in the use of a heat transfer fluid in the solar field which is heated during the recirculation through the absorber tubes of the solar collectors, transferring later on the that thermal energy to a heat-exchanger for steam generation. Direct steam generation in the absorber tubes has always been shown as an ideal pathway to reduce generation cost by 15% and increase conversion efficiency by 20% (DISS, 1999). (Author)
Directory of Open Access Journals (Sweden)
Abdulnaser M. Alshoaibi
2009-01-01
Full Text Available The purpose of this study is on the determination of 2D crack paths and surfaces as well as on the evaluation of the stress intensity factors as a part of the damage tolerant assessment. Problem statement: The evaluation of SIFs and crack tip singular stresses for arbitrary fracture structure are a challenging problem, involving the calculation of the crack path and the crack propagation rates at each step especially under mixed mode loading. Approach: This study was provided a finite element code which produces results comparable to the current available commercial software. Throughout the simulation of crack propagation an automatic adaptive mesh was carried out in the vicinity of the crack front nodes and in the elements which represent the higher stresses distribution. The finite element mesh was generated using the advancing front method. The adaptive remising process carried out based on the posteriori stress error norm scheme to obtain an optimal mesh. The onset criterion of crack propagation was based on the stress intensity factors which provide as the most important parameter that must be accurately estimated. Facilitated by the singular elements, the displacement extrapolation technique is employed to calculate the stress intensity factor. Crack direction is predicted using the maximum circumferential stress theory. The fracture was modeled by the splitting node approach and the trajectory follows the successive linear extensions of each crack increment. The propagation process is driven by Linear Elastic Fracture Mechanics (LEFM approach with minimum user interaction. Results: In evaluating the accuracy of the estimated stress intensity factors and the crack path predictions, the results were compared with sets of experimental data, benchmark analytical solutions as well as numerical results of other researchers. Conclusion/Recommendations: The assessment indicated that the program was highly reliable to evaluate the stress intensity
Gradient Domain Mesh Deformation - A Survey
Institute of Scientific and Technical Information of China (English)
Wei-Wei Xu; Kun Zhou
2009-01-01
This survey reviews the recent development of gradient domain mesh deformation method. Different to other deformation methods, the gradient domain deformation method is a surface-based, variational optimization method. It directly encodes the geometric details in differential coordinates, which are also called Laplacian coordinates in literature. By preserving the Laplacian coordinates, the mesh details can be well preserved during deformation. Due to the locality of the Laplacian coordinates, the variational optimization problem can be casted into a sparse linear system. Fast sparse linear solver can be adopted to generate deformation result interactively, or even in real-time. The nonlinear nature of gradient domain mesh deformation leads to the development of two categories of deformation methods: linearization methods and nonlinear optimization methods. Basically, the linearization methods only need to solve the linear least-squares system once. They are fast, easy to understand and control, while the deformation result might be suboptimal. Nonlinear optimization methods can reach optimal solution of deformation energy function by iterative updating. Since the computation of nonlinear methods is expensive, reduced deformable models should be adopted to achieve interactive performance. The nonlinear optimization methods avoid the user burden to input transformation at deformation handles, and they can be extended to incorporate various nonlinear constraints, like volume constraint, skeleton constraint, and so on. We review representative methods and related approaches of each category comparatively and hope to help the user understand the motivation behind the algorithms. Finally, we discuss the relation between physical simulation and gradient domain mesh deformation to reveal why it can achieve physically plausible deformation result.
Institute of Scientific and Technical Information of China (English)
李磊; 杨峰; 何耀
2012-01-01
In order to automatically printout the detection results and judgment conclusion from certain composite detector that is developed based on LabVIEW platform for radar receiver in accordance with designated template format and sequence, the global variable technology and Word document report generation technology have been researched. By adopting Report Generation Toolkit and LabVIEW programming technology, the automatic report generation program for composite detection report is designed. Various detection results and judgment conclusion can be recorded in real time; and the report based on the format of designated Word template can be generated automatically with this program.%为了将检测结果和判别结论按照给定的模版格式和顺序自动地打印出来,研究了LabVIEW中的全局变量技术和Word文档检测报告生成技术.利用Report Generation Toolkit 工具包和LabVIEW编程技术,设计了组合检测报告自动生成程序.该程序能够实时记录各种检测结果和判别结论,并自动生成基于指定Word模板格式的检测报告.
Method and system for mesh network embedded devices
Wang, Ray (Inventor)
2009-01-01
A method and system for managing mesh network devices. A mesh network device with integrated features creates an N-way mesh network with a full mesh network topology or a partial mesh network topology.
Mesh refinement strategy for optimal control problems
Paiva, Luis Tiago; Fontes, Fernando,
2013-01-01
International audience; Direct methods are becoming the most used technique to solve nonlinear optimal control problems. Regular time meshes having equidistant spacing are frequently used. However, in some cases these meshes cannot cope accurately with nonlinear behavior. One way to improve the solution is to select a new mesh with a greater number of nodes. Another way, involves adaptive mesh refinement. In this case, the mesh nodes have non equidistant spacing which allow a non uniform node...
3D Mesh Compression and Transmission for Mobile Robotic Applications
Directory of Open Access Journals (Sweden)
Bailin Yang
2016-01-01
Full Text Available Mobile robots are useful for environment exploration and rescue operations. In such applications, it is crucial to accurately analyse and represent an environment, providing appropriate inputs for motion planning in order to support robot navigation and operations. 2D mapping methods are simple but cannot handle multilevel or multistory environments. To address this problem, 3D mapping methods generate structural 3D representations of the robot operating environment and its objects by 3D mesh reconstruction. However, they face the challenge of efficiently transmitting those 3D representations to system modules for 3D mapping, motion planning, and robot operation visualization. This paper proposes a quality-driven mesh compression and transmission method to address this. Our method is efficient, as it compresses a mesh by quantizing its transformed vertices without the need to spend time constructing an a-priori structure over the mesh. A visual distortion function is developed to govern the level of quantization, allowing mesh transmission to be controlled under different network conditions or time constraints. Our experiments demonstrate how the visual quality of a mesh can be manipulated by the visual distortion function.
Automatic Control System for Neutron Laboratory Safety
Institute of Scientific and Technical Information of China (English)
ZHAO; Xiao; ZHANG; Guo-guang; FENG; Shu-qiang; SU; Dan; YANG; Guo-zhao; ZHANG; Shuai
2015-01-01
In order to cooperate with the experiment of neutron generator,and realize the automatic control in the experiment,a set of automatic control system for the safety of the neutron laboratory is designed.The system block diagram is shown as Fig.1.Automatic control device is for processing switch signal,so PLC is selected as the core component
Unbiased sampling and meshing of isosurfaces
Yan, Dongming
2014-11-01
In this paper, we present a new technique to generate unbiased samples on isosurfaces. An isosurface, F(x,y,z) = c , of a function, F , is implicitly defined by trilinear interpolation of background grid points. The key idea of our approach is that of treating the isosurface within a grid cell as a graph (height) function in one of the three coordinate axis directions, restricted to where the slope is not too high, and integrating / sampling from each of these three. We use this unbiased sampling algorithm for applications in Monte Carlo integration, Poisson-disk sampling, and isosurface meshing.
Tangle-Free Mesh Motion for Ablation Simulations
Droba, Justin
2016-01-01
Problems involving mesh motion-which should not be mistakenly associated with moving mesh methods, a class of adaptive mesh redistribution techniques-are of critical importance in numerical simulations of the thermal response of melting and ablative materials. Ablation is the process by which material vaporizes or otherwise erodes due to strong heating. Accurate modeling of such materials is of the utmost importance in design of passive thermal protection systems ("heatshields") for spacecraft, the layer of the vehicle that ensures survival of crew and craft during re-entry. In an explicit mesh motion approach, a complete thermal solve is first performed. Afterwards, the thermal response is used to determine surface recession rates. These values are then used to generate boundary conditions for an a posteriori correction designed to update the location of the mesh nodes. Most often, linear elastic or biharmonic equations are used to model this material response, traditionally in a finite element framework so that complex geometries can be simulated. A simple scheme for moving the boundary nodes involves receding along the surface normals. However, for all but the simplest problem geometries, evolution in time following such a scheme will eventually bring the mesh to intersect and "tangle" with itself, inducing failure. This presentation demonstrates a comprehensive and sophisticated scheme that analyzes the local geometry of each node with help from user-provided clues to eliminate the tangle and enable simulations on a wide-class of difficult problem geometries. The method developed is demonstrated for linear elastic equations but is general enough that it may be adapted to other modeling equations. The presentation will explicate the inner workings of the tangle-free mesh motion algorithm for both two and three-dimensional meshes. It will show abstract examples of the method's success, including a verification problem that demonstrates its accuracy and
Trinocular stereo vision method based on mesh candidates
Liu, Bin; Xu, Gang; Li, Haibin
2010-10-01
One of the most interesting goals of machine vision is 3D structure recovery of the scenes. This recovery has many applications, such as object recognition, reverse engineering, automatic cartography, autonomous robot navigation, etc. To meet the demand of measuring the complex prototypes in reverse engineering, a trinocular stereo vision method based on mesh candidates was proposed. After calibration of the cameras, the joint field of view can be defined in the world coordinate system. Mesh grid is established along the coordinate axes, and the mesh nodes are considered as potential depth data of the object surface. By similarity measure of the correspondence pairs which are projected from a certain group of candidates, the depth data can be obtained readily. With mesh nodes optimization, the interval between the neighboring nodes in depth direction could be designed reasonably. The potential ambiguity can be eliminated efficiently in correspondence matching with the constraint of a third camera. The cameras can be treated as two independent pairs, left-right and left-centre. Due to multiple peaks of the correlation values, the binocular method may not satisfy the accuracy of the measurement. Another image pair is involved if the confidence coefficient is less than the preset threshold. The depth is determined by the highest sum of correlation of both camera pairs. The measurement system was simulated using 3DS MAX and Matlab software for reconstructing the surface of the object. The experimental result proved that the trinocular vision system has good performance in depth measurement.
Tetrahedral meshing via maximal Poisson-disk sampling
Guo, Jianwei
2016-02-15
In this paper, we propose a simple yet effective method to generate 3D-conforming tetrahedral meshes from closed 2-manifold surfaces. Our approach is inspired by recent work on maximal Poisson-disk sampling (MPS), which can generate well-distributed point sets in arbitrary domains. We first perform MPS on the boundary of the input domain, we then sample the interior of the domain, and we finally extract the tetrahedral mesh from the samples by using 3D Delaunay or regular triangulation for uniform or adaptive sampling, respectively. We also propose an efficient optimization strategy to protect the domain boundaries and to remove slivers to improve the meshing quality. We present various experimental results to illustrate the efficiency and the robustness of our proposed approach. We demonstrate that the performance and quality (e.g., minimal dihedral angle) of our approach are superior to current state-of-the-art optimization-based approaches.
Dynamic protected lightpath provisioning in mesh WDM networks
Institute of Scientific and Technical Information of China (English)
Guolong Zhu; Qingji Zeng; Tian Xu; Tong Ye; Junjie Yang
2005-01-01
This paper investigates the problem of dynamic protected lightpath services provisioning in optical mesh networks employing wavelength division multiplexing (WDM). A variety of schemes for dynamic protected services provisioning have been proposed, supporting a range of tradeoffs among restoration speed, capacity efficiency, and scalability. In this paper, we propose a novel scheme, called p-cycles-based maximum protected working capacity envelope (PC-MPWCE), which can offer an attractive combination of fea-tures: ring-like speed, mesh-like capacity efficiency, and good scalability. To evaluate the performance of PC-MPWCE, we compare it via simulation with 1 + 1 automatic protection switching (APS) and two well-known shared backup path protection (SBPP) on NSFNET. Our simulation results show that PCMPWCE can achieve much better blocking performance than 1 + 1 APS, and perform the similar blocking performance and capacity efficiency as SBPP.
Efficient Surface Mesh Reconstruction from Unorganized Points Using Neural Network
Institute of Scientific and Technical Information of China (English)
YUANYouwei; YANLamei; GUOQingping
2005-01-01
In this paper, a new approach for the automatic reconstruction from unorganized points is presented,where first an artificial neural network is used to order the data and form a grid of control vertices with triangle topology. Then, we present a general scheme for mesh simplification and optimization that allows to control the geometric approximation as well as the element shape and size quality (required for numerical simulations). The new approach makes possible the construction of adapted geometric meshes for surfaces by specifying the element sizes(and directions) so as to bound the error below a usergiven threshold value. The experimental results show that our methods are accurate and simple to implement.
Automatic Construction of Finite Algebras
Institute of Scientific and Technical Information of China (English)
张健
1995-01-01
This paper deals with model generation for equational theories,i.e.,automatically generating (finite)models of a given set of (logical) equations.Our method of finite model generation and a tool for automatic construction of finite algebras is described.Some examples are given to show the applications of our program.We argue that,the combination of model generators and theorem provers enables us to get a better understanding of logical theories.A brief comparison betwween our tool and other similar tools is also presented.
A REGIONAL REFINEMENT FOR FINITE ELEMENT MESH DESIGN USING COLLAPSIBLE ELEMENT
Directory of Open Access Journals (Sweden)
Priyo Suprobo
2000-01-01
Full Text Available A practical algorithm for automated mesh design in finite element analysis is developed. A regional mixed mesh improvement procedure is introduced. The error control%2C algorithm implementation%2C code development%2C and the solution accuracy are discussed. Numerical example includes automated mesh designs for plane elastic media with singularities. The efficiency of the procedure is demonstrated. Abstract in Bahasa Indonesia : regional+refinement%2C+mesh+generation%2C+isoparametric+element%2C+collapsible+element
E pur si muove: Galiliean-invariant cosmological hydrodynamical simulations on a moving mesh
Springel, Volker
2009-01-01
Hydrodynamic cosmological simulations at present usually employ either the Lagrangian SPH technique, or Eulerian hydrodynamics on a Cartesian mesh with adaptive mesh refinement. Both of these methods have disadvantages that negatively impact their accuracy in certain situations. We here propose a novel scheme which largely eliminates these weaknesses. It is based on a moving unstructured mesh defined by the Voronoi tessellation of a set of discrete points. The mesh is used to solve the hyperbolic conservation laws of ideal hydrodynamics with a finite volume approach, based on a second-order unsplit Godunov scheme with an exact Riemann solver. The mesh-generating points can in principle be moved arbitrarily. If they are chosen to be stationary, the scheme is equivalent to an ordinary Eulerian method with second order accuracy. If they instead move with the velocity of the local flow, one obtains a Lagrangian formulation of hydrodynamics that does not suffer from the mesh distortion limitations inherent in othe...
Dahlgaard, Katja; Raposo, Alexandre A S F; Niccoli, Teresa; St Johnston, Daniel
2007-10-01
Mutants in the actin nucleators Cappuccino and Spire disrupt the polarized microtubule network in the Drosophila oocyte that defines the anterior-posterior axis, suggesting that microtubule organization depends on actin. Here, we show that Cappuccino and Spire organize an isotropic mesh of actin filaments in the oocyte cytoplasm. capu and spire mutants lack this mesh, whereas overexpressed truncated Cappuccino stabilizes the mesh in the presence of Latrunculin A and partially rescues spire mutants. Spire overexpression cannot rescue capu mutants, but prevents actin mesh disassembly at stage 10B and blocks late cytoplasmic streaming. We also show that the actin mesh regulates microtubules indirectly, by inhibiting kinesin-dependent cytoplasmic flows. Thus, the Capu pathway controls alternative states of the oocyte cytoplasm: when active, it assembles an actin mesh that suppresses kinesin motility to maintain a polarized microtubule cytoskeleton. When inactive, unrestrained kinesin movement generates flows that wash microtubules to the cortex.
Institute of Scientific and Technical Information of China (English)
胡迪
2007-01-01
<正>Reading is the key to school success and,like any skill,it takes practice.A child learns to walk by practising until he no longer has to think about how to put one foot in front of the other.The great athlete practises until he can play quickly,accurately and without thinking.Ed- ucators call it automaticity.
Load Balancing in Wireless Mesh Network: a Survey
Directory of Open Access Journals (Sweden)
Maryam Asgari
Full Text Available Wireless Mesh network (WMN is a state of the art networking standard for next generation of wireless network. The construction of these networks is basis of a network of wireless routers witch forwarding each other`s packets in a multi-hop manner. All us ...
All inorganic semiconductor nanowire mesh for direct solar water splitting.
Liu, Bin; Wu, Cheng-Hao; Miao, Jianwei; Yang, Peidong
2014-11-25
The generation of chemical fuels via direct solar-to-fuel conversion from a fully integrated artificial photosynthetic system is an attractive approach for clean and sustainable energy, but so far there has yet to be a system that would have the acceptable efficiency, durability and can be manufactured at a reasonable cost. Here, we show that a semiconductor mesh made from all inorganic nanowires can achieve unassisted solar-driven, overall water-splitting without using any electron mediators. Free-standing nanowire mesh networks could be made in large scales using solution synthesis and vacuum filtration, making this approach attractive for low cost implementation.
Institute of Scientific and Technical Information of China (English)
徐小力; 刘秋爽; 见浪護
2012-01-01
A method which can forecast generating capacity of automatic tracking power system on inflatable membrane greenhouse attached photovoltaic was proposed based on the self-adaptive variation particle swarm neural network by adding with weather information. Firstly, through combining historical data of electricity production and meteorological data, the main factors of the impact on generating capacity of power generation system on inflatable membrane greenhouse attached photovoltaic was analyzed. Then, the neural network forecasting model was established by combining the weather forecast. The self-adaptive variation particle swarm algorithm was introduced to improve the training effect by tackling the problems of slowly converging, easily falling into local optimum, and difficultly converging existed in traditional neural network forecasting model based on gradient-descent BP algorithm. The neural network was optimized with adaptable mutation particle swarm optimization ( AMPSO) algorithm. The mutation was put into particle swarm optimization(PSO) algorithm to find local optimal value. Experimental results showed that the entire convergence performance was significantly improved by adopting AMPSO and the premature convergence problem can be effectively avoided in PSO.%针对光伏充气膜温室自跟踪发电系统提出了一种加入天气预报信息的自适应变异粒子群神经网络的发电量预测算法.首先结合历史发电量数据和气象数据分析了影响光伏充气膜温室自跟踪发电系统发电量的主要因素,建立了加入天气预报的神经网络预测模型,并针对传统神经网络预测模型中基于梯度下降的BP算法收敛慢、易陷入局部最优、训练难收敛等问题,通过自适应变异粒子群算法改进了神经网络.该算法通过将变异环节引入粒子群优化算法,进行隔代进化找到局部最优解.实验结果表明所采用的自适应变异粒子群的神经网络预测算法的全
Geometric and Meshing Properties of Conjugate Curves for Gear Transmission
Directory of Open Access Journals (Sweden)
Dong Liang
2014-01-01
Full Text Available Conjugate curves have been put forward previously by authors for gear transmission. Compared with traditional conjugate surfaces, the conjugate curves have more flexibility and diversity in aspects of gear design and generation. To further extend its application in power transmission, the geometric and meshing properties of conjugate curves are discussed in this paper. Firstly, general principle descriptions of conjugate curves for arbitrary axial position are introduced. Secondly, geometric analysis of conjugate curves is carried out based on differential geometry including tangent and normal in arbitrary contact direction, characteristic point, and curvature relationships. Then, meshing properties of conjugate curves are further revealed. According to a given plane or spatial curve, the uniqueness of conjugated curve under different contact angle conditions is discussed. Meshing commonality of conjugate curves is also demonstrated in terms of a class of spiral curves contacting in the given direction for various gear axes. Finally, a conclusive summary of this study is given.
Connectivity-Based Segmentation for GPU-Accelerated Mesh Decompression
Institute of Scientific and Technical Information of China (English)
Jie-Yi Zhao; Min Tang; Ruo-Feng Tong
2012-01-01
We present a novel algorithm to partition large 3D meshes for GPU-accelerated decompression.Our formulation focuses on minimizing the replicated vertices between patches,and balancing the numbers of faces of patches for efficient parallel computing.First we generate a topology model of the original mesh and remove vertex positions.Then we assign the centers of patches using geodesic farthest point sampling and cluster the faces according to the geodesic distance to the centers.After the segmentation we swap boundary faces to fix jagged boundaries and store the boundary vertices for whole-mesh preservation.The decompression of each patch runs on a thread of GPU,and we evaluate its performance on various large benchmarks.In practice,the GPU-based decompression algorithm runs more than 48x faster on NVIDIA GeForce GTX 580 GPU compared with that on the CPU using single core.
Mesh Resolution Effect on 3D RANS Turbomachinery Flow Simulations
Yershov, Sergiy
2016-01-01
The paper presents the study of the effect of a mesh refinement on numerical results of 3D RANS computations of turbomachinery flows. The CFD solver F, which based on the second-order accurate ENO scheme, is used in this study. The simplified multigrid algorithm and local time stepping permit decreasing computational time. The flow computations are performed for a number of turbine and compressor cascades and stages. In all flow cases, the successively refined meshes of H-type with an approximate orthogonalization near the solid walls were generated. The results obtained are compared in order to estimate their both mesh convergence and ability to resolve the transonic flow pattern. It is concluded that for thorough studying the fine phenomena of the 3D turbomachinery flows, it makes sense to use the computational meshes with the number of cells from several millions up to several hundred millions per a single turbomachinery blade channel, while for industrial computations, a mesh of about or less than one mil...
Zimkowski, Michael M.
About 600,000 hernia repair surgeries are performed each year. The use of laparoscopic minimally invasive techniques has become increasingly popular in these operations. Use of surgical mesh in hernia repair has shown lower recurrence rates compared to other repair methods. However in many procedures, placement of surgical mesh can be challenging and even complicate the procedure, potentially leading to lengthy operating times. Various techniques have been attempted to improve mesh placement, including use of specialized systems to orient the mesh into a specific shape, with limited success and acceptance. In this work, a programmed novel Shape Memory Polymer (SMP) was integrated into commercially available polyester surgical meshes to add automatic unrolling and tissue conforming functionalities, while preserving the intrinsic structural properties of the original surgical mesh. Tensile testing and Dynamic Mechanical Analysis was performed on four different SMP formulas to identify appropriate mechanical properties for surgical mesh integration. In vitro testing involved monitoring the time required for a modified surgical mesh to deploy in a 37°C water bath. An acute porcine model was used to test the in vivo unrolling of SMP integrated surgical meshes. The SMP-integrated surgical meshes produced an automated, temperature activated, controlled deployment of surgical mesh on the order of several seconds, via laparoscopy in the animal model. A 30 day chronic rat model was used to test initial in vivo subcutaneous biocompatibility. To produce large more clinical relevant sizes of mesh, a mold was developed to facilitate manufacturing of SMP-integrated surgical mesh. The mold is capable of manufacturing mesh up to 361 cm2, which is believed to accommodate the majority of clinical cases. Results indicate surgical mesh modified with SMP is capable of laparoscopic deployment in vivo, activated by body temperature, and possesses the necessary strength and
Energy Technology Data Exchange (ETDEWEB)
Alves, Alceu F.; Cagnon, Odivaldo Jose [Universidade Estadual Paulista (DEE/FEB/UNESP), Bauru, SP (Brazil). Fac. de Engenharia. Dept. de Engenharia Eletrica; Seraphin, Odivaldo Jose [Universidade Estadual Paulista (DER/FCA/UNESP), Botucatu, SP (Brazil). Fac. de Ciencias Agronomicas. Dept. de Engenharia Rural
2008-07-01
This work presents an automatic positioning system for photovoltaic panels, in order to improve the conversion of solar energy to electric energy. A prototype with automatic movement was developed, and its efficiency in generating electric energy was compared to another one with the same characteristics, but fixed in space. Preliminary results point to a significant increase in efficiency, obtained from a simplified process of movement, in which sensors are not used to determine the apparent sun's position, but instead of it, the relative Sun-Earth's position equations are used. An innovative movement mechanical system is also presented, using two stepper motors to move the panel along two-axis, but with independent movement, contributing, this way, to save energy during the positioning times. The use of this proposed system in rural areas is suggested. (author)
Mesh network achieve its fuction on Linux
Pei Ping; PETRENKO Y.N.
2015-01-01
In this paper, we introduce a Mesh network protocol evaluation and development. It has a special protocol. We could easily understand the Linux operation principles which are in use in mesh network. In addition to our comprehension, we describe the graph which shows package routing way. At last according to testing we prove that Mesh protocol AODV satisfy Linux platform performance requirements.
The mesh network protocol evaluation and development
Pei Ping; PETRENKO Y.N.
2015-01-01
In this paper, we introduce a Mesh network protocol evaluation and development. It has a special protocol. We could easily to understand that how different protocols are used in mesh network. In addition to our comprehension, Multi – hop routing protocol could provide robustness and load balancing to communication in wireless mesh networks.
Practical implementation of tetrahedral mesh reconstruction in emission tomography
Boutchko, R.; Sitek, A.; Gullberg, G. T.
2013-05-01
This paper presents a practical implementation of image reconstruction on tetrahedral meshes optimized for emission computed tomography with parallel beam geometry. Tetrahedral mesh built on a point cloud is a convenient image representation method, intrinsically three-dimensional and with a multi-level resolution property. Image intensities are defined at the mesh nodes and linearly interpolated inside each tetrahedron. For the given mesh geometry, the intensities can be computed directly from tomographic projections using iterative reconstruction algorithms with a system matrix calculated using an exact analytical formula. The mesh geometry is optimized for a specific patient using a two stage process. First, a noisy image is reconstructed on a finely-spaced uniform cloud. Then, the geometry of the representation is adaptively transformed through boundary-preserving node motion and elimination. Nodes are removed in constant intensity regions, merged along the boundaries, and moved in the direction of the mean local intensity gradient in order to provide higher node density in the boundary regions. Attenuation correction and detector geometric response are included in the system matrix. Once the mesh geometry is optimized, it is used to generate the final system matrix for ML-EM reconstruction of node intensities and for visualization of the reconstructed images. In dynamic PET or SPECT imaging, the system matrix generation procedure is performed using a quasi-static sinogram, generated by summing projection data from multiple time frames. This system matrix is then used to reconstruct the individual time frame projections. Performance of the new method is evaluated by reconstructing simulated projections of the NCAT phantom and the method is then applied to dynamic SPECT phantom and patient studies and to a dynamic microPET rat study. Tetrahedral mesh-based images are compared to the standard voxel-based reconstruction for both high and low signal-to-noise ratio
GRChombo : Numerical Relativity with Adaptive Mesh Refinement
Clough, Katy; Finkel, Hal; Kunesch, Markus; Lim, Eugene A; Tunyasuvunakool, Saran
2015-01-01
Numerical relativity has undergone a revolution in the past decade. With a well-understood mathematical formalism, and full control over the gauge modes, it is now entering an era in which the science can be properly explored. In this work, we introduce GRChombo, a new numerical relativity code written to take full advantage of modern parallel computing techniques. GRChombo's features include full adaptive mesh refinement with block structured Berger-Rigoutsos grid generation which supports non-trivial "many-boxes-in-many-boxes" meshing hierarchies, and massive parallelism through the Message Passing Interface (MPI). GRChombo evolves the Einstein equation with the standard BSSN formalism, with an option to turn on CCZ4 constraint damping if required. We show that GRChombo passes all the standard "Apples-to-Apples" code comparison tests. We also show that it can stably and accurately evolve vacuum black hole spacetimes such as binary black hole mergers, and non-vacuum spacetimes such as scalar collapses into b...
Duchateau, Julien; Maquignon, Nicolas; Roussel, Gilles; Renaud, Christophe
2015-01-01
In this paper, a new progressive mesh algorithm is introduced in order to perform fast physical simulations by the use of a lattice Boltzmann method (LBM) on a single-node multi-GPU architecture. This algorithm is able to mesh automatically the simulation domain according to the propagation of fluids. This method can also be useful in order to perform various types of simulations on complex geometries. The use of this algorithm combined with the massive parallelism of GPUs allows to obtain very good performance in comparison with the static mesh method used in literature. Several simulations are shown in order to evaluate the algorithm.
基于攻击模式的完备攻击图自动生成方法%Complete Attack Graph Automatic Generation Method Based on Attack Pattern
Institute of Scientific and Technical Information of China (English)
刘龙; 陈秀真; 李建华
2013-01-01
无圈攻击图结构简单，但在构建过程中会导致部分路径缺失。为此，给出完备攻击图的概念，提出基于攻击模式的完备攻击图自动生成方法。通过分析网络防火墙的配置文件，自动获取网络连通性。完善攻击模式知识库以优化攻击者能力建模，并在此基础上设计广度优先前向搜索的攻击图生成算法，实现自动生成完备攻击图的原型。实验结果表明，该方法的自动化程度高、时间消耗少，可应用于大型网络。%As the generation of attack graph without loops leads to missing of attack paths, this paper puts forward the concept of complete attack graph and builds its automatic generation method. It obtains the network connectivity automatically by analyzing the firewall configuration files, to get rid of tedious manual input. Then the attack patterns are enriched to cover almost all network attack types and based on them, an efficient approach to complete attack graph generation is built. In the end, a model to generate complete attack graph automatically using the algorithm is built. Experimental result shows that this method has less time consumption, high degree of automation, and it can be applied to large networks.
Boxlib with tiling: an adaptive mesh refinement software framework
Unat, Didem; Zhang, W.; Almgren, A.; Day, M.; Nguyen, T.; Shalf, J.
2016-01-01
In this paper we introduce a block-structured adaptive mesh refinement software framework that incorporates tiling, a well-known loop transformation. Because the multiscale, multiphysics codes built in boxlib are designed to solve complex systems at high resolution, performance on current and next generation architectures is essential. With the expectation of many more cores per node on next generation architectures, the ability to effectively utilize threads within a node is essential, and t...
Mamy, Laurent; Letouzey, Vincent; Lavigne, Jean-Philippe; Garric, Xavier; Gondry, Jean; Mares, Pierre; De Tayrac, Renaud
2010-01-01
International audience; INTRODUCTION AND HYPOTHESIS: The aim of this study was to evaluate a link between mesh infection and shrinkage. METHODS: Twenty-eight Wistar rats were implanted with synthetic meshes that were either non-absorbable (polypropylene (PP), n = 14) or absorbable (poly (D: ,L: -lactic acid) (PLA94), n = 14). A validated animal incisionnal abdominal hernia model of mesh infection was used. Fourteen meshes (n = 7 PLA94 and n = 7 PP meshes) were infected intraoperatively with 1...
The moving mesh code Shadowfax
Vandenbroucke, Bert
2016-01-01
We introduce the moving mesh code Shadowfax, which can be used to evolve a mixture of gas, subject to the laws of hydrodynamics and gravity, and any collisionless fluid only subject to gravity, such as cold dark matter or stars. The code is written in C++ and its source code is made available to the scientific community under the GNU Affero General Public License. We outline the algorithm and the design of our implementation, and demonstrate its validity through the results of a set of basic test problems, which are also part of the public version. We also compare Shadowfax with a number of other publicly available codes using different hydrodynamical integration schemes, illustrating the advantages and disadvantages of the moving mesh technique.
The moving mesh code SHADOWFAX
Vandenbroucke, B.; De Rijcke, S.
2016-07-01
We introduce the moving mesh code SHADOWFAX, which can be used to evolve a mixture of gas, subject to the laws of hydrodynamics and gravity, and any collisionless fluid only subject to gravity, such as cold dark matter or stars. The code is written in C++ and its source code is made available to the scientific community under the GNU Affero General Public Licence. We outline the algorithm and the design of our implementation, and demonstrate its validity through the results of a set of basic test problems, which are also part of the public version. We also compare SHADOWFAX with a number of other publicly available codes using different hydrodynamical integration schemes, illustrating the advantages and disadvantages of the moving mesh technique.
Confined helium on Lagrange meshes
Baye, Daniel
2015-01-01
The Lagrange-mesh method has the simplicity of a calculation on a mesh and can have the accuracy of a variational method. It is applied to the study of a confined helium atom. Two types of confinement are considered. Soft confinements by potentials are studied in perimetric coordinates. Hard confinement in impenetrable spherical cavities is studied in a system of rescaled perimetric coordinates varying in [0,1] intervals. Energies and mean values of the distances between electrons and between an electron and the helium nucleus are calculated. A high accuracy of 11 to 15 significant figures is obtained with small computing times. Pressures acting on the confined atom are also computed. For sphere radii smaller than 1, their relative accuracies are better than $10^{-10}$. For larger radii up to 10, they progressively decrease to $10^{-3}$, still improving the best literature results.
Vamos¸, C˘alin
2013-01-01
Our book introduces a method to evaluate the accuracy of trend estimation algorithms under conditions similar to those encountered in real time series processing. This method is based on Monte Carlo experiments with artificial time series numerically generated by an original algorithm. The second part of the book contains several automatic algorithms for trend estimation and time series partitioning. The source codes of the computer programs implementing these original automatic algorithms are given in the appendix and will be freely available on the web. The book contains clear statement of the conditions and the approximations under which the algorithms work, as well as the proper interpretation of their results. We illustrate the functioning of the analyzed algorithms by processing time series from astrophysics, finance, biophysics, and paleoclimatology. The numerical experiment method extensively used in our book is already in common use in computational and statistical physics.
Image meshing via hierarchical optimization
Institute of Scientific and Technical Information of China (English)
Hao XIE; Ruo-feng TONG‡
2016-01-01
Vector graphic, as a kind of geometric representation of raster images, has many advantages, e.g., defi nition independence and editing facility. A popular way to convert raster images into vector graphics is image meshing, the aim of which is to fi nd a mesh to represent an image as faithfully as possible. For traditional meshing algorithms, the crux of the problem resides mainly in the high non-linearity and non-smoothness of the objective, which makes it diﬃcult to fi nd a desirable optimal solution. To ameliorate this situation, we present a hierarchical optimization algorithm solving the problem from coarser levels to fi ner ones, providing initialization for each level with its coarser ascent. To further simplify the problem, the original non-convex problem is converted to a linear least squares one, and thus becomes convex, which makes the problem much easier to solve. A dictionary learning framework is used to combine geometry and topology elegantly. Then an alternating scheme is employed to solve both parts. Experiments show that our algorithm runs fast and achieves better results than existing ones for most images.