Transition Dipole, Charge Transfer, and Electron-hole Coherence in Two-photon Absorption： Visualizations with Two Dimensional Site and Three Dimensional Cube Representations

The developed visualization methods of two dimensional （2D） site and three dimensional （3D） cube representations have been performed to show the orientation of transition dipole, charge transfer, and electron-hole coherence in two-photon absorption （TPA）. The 3D cube representations of transition density can reveal visually the orientation and strength of transition dipole moment, and charge different density show the orientation of charge transfer in TPA. The 2D site representation can reveal visually the electron-hole coherence in TPA. The combination of 2D site and 3D cube representations provide clearly inspect into the charge transfer process and the contribution of excited molecular segments for TPA.

Screen for Coronary Artery Disease Specific Genetic Expression by Representational Differential Analysis

Objective To screen coronaryartery disease (CAD) specific expressions and clone their genes. Method Blood samples were collected from CAD and non - CAD patients at the end of coronary angiography. mRNA from samples was isolated and converted into cDNA. After ligated with specific linkers, the cDNA was amplified with complementary primers. PCR products from CAD samples were named as tester; the ones from non - CAD samples were named as driver. With different ratio of tester to driver (1 : 100,1: 1, 000, and 1: 10, 000), they were mixed, denatured, and renatured. Single strand cD-NA was eliminated by Mung bean nuclease. Double strand cDNA presented only in tester was amplified, ligated in vector pUC19 and pUC53, and transformed into E. coll DH5a. Strains with inserted cDNA fragments were picked up based on blue and white selection. Insertions were screened by endonuclease digestion and DNA sequencing. Results were compared with DNA sequences of GeneBank. Results: After the selection with representational differential analysis, CAD specific cDNA fragments with different sizes (about 1kb, 0. 75kb, and 0. 6kb) were cloned. Among them, two fragments from unknown genes were identified. One presented a 43. 3 % similarity with part of the rattus norvegicus lipocortin gene. Another presented a 45. 4 % similarity with part of the human polynucleotide kinase 3' - phosphatase gene. Conclusion There are at least two CAD specific - ex- pressions from unknown genes that were partially similar to lipocortin and polynucleotide kinase 3'- phos-phatase genes, respectively. Expression of these genes might affect the formation and progression of plaque within coronary artery.

A Numerical Calculation Algorithm of the Inclination Function Based on the Representation of SO(3) Group

In the determination of the Earth gravity field in satellite geodesy, the inclination functions represent the projection of data observed along the orbital plane of a satellite orbit into the sphere in the terrestial reference frame. The inclination functions in this work is studied from a group theoretical perspective. The inclination functions are proved to generate a representation of the SO(3) group. An orthogonal relation of the inclination functions is derived and some recurrence relations for the inclination functions are given, based on which an algorithm to calculate the inclination functions is proposed.

A ubiquitous knowledgeable data representation model(UKRM) for three-dimensional geographic information systems(3D GIS)

In the face of complicated, diversified three-dimensional world, the existing 3D GIS data models suffer from certain issues such as data incompatibility, insufficiency in data representation and representation types, among others. It is often hard to meet the requirements of multiple application purposes(users) related to GIS spatial data management and data query and analysis, especially in the case of massive spatial objects. In this study, according to the habits of human thinking and recognition, discrete expressions(such as discrete curved surface(DCS), and discrete body(DB)) were integrated and two novel representation types(including function structure and mapping structure) were put forward. A flexible and extensible ubiquitous knowledgeable data representation model(UKRM) was then constructed, in which structurally heterogeneous multiple expressions(including boundary representation(B-rep), constructive solid geometry(CSG), functional/parameter representation, etc.) were normalized. GIS's ability in representing the massive, complicated and diversified 3D world was thus greatly enhanced. In addition, data reuse was realized, and the bridge linking static GIS to dynamic GIS was built up. Primary experimental results illustrated that UKRM was overwhelmingly superior to the current data models(e.g. IFC, City GML) in describing both regular and irregular spatial objects.

A survey on deep geometry learning:From a representation perspective

Researchers have achieved great success in dealing with 2 D images using deep learning.In recent years,3 D computer vision and geometry deep learning have gained ever more attention.Many advanced techniques for 3 D shapes have been proposed for different applications.Unlike 2 D images,which can be uniformly represented by a regular grid of pixels,3 D shapes have various representations,such as depth images,multi-view images,voxels,point clouds,meshes,implicit surfaces,etc.The performance achieved in different applications largely depends on the representation used,and there is no unique representation that works well for all applications.Therefore,in this survey,we review recent developments in deep learning for 3 D geometry from a representation perspective,summarizing the advantages and disadvantages of different representations for different applications.We also present existing datasets in these representations and further discuss future research directions.

A survey of deep learning-based 3D shape generation

Deep learning has been successfully used for tasks in the 2D image domain.Research on 3D computer vision and deep geometry learning has also attracted attention.Considerable achievements have been made regarding feature extraction and discrimination of 3D shapes.Following recent advances in deep generative models such as generative adversarial networks,effective generation of 3D shapes has become an active research topic.Unlike 2D images with a regular grid structure,3D shapes have various representations,such as voxels,point clouds,meshes,and implicit functions.For deep learning of 3D shapes,shape representation has to be taken into account as there is no unified representation that can cover all tasks well.Factors such as the representativeness of geometry and topology often largely affect the quality of the generated 3D shapes.In this survey,we comprehensively review works on deep-learning-based 3D shape generation by classifying and discussing them in terms of the underlying shape representation and the architecture of the shape generator.The advantages and disadvantages of each class are further analyzed.We also consider the 3D shape datasets commonly used for shape generation.Finally,we present several potential research directions that hopefully can inspire future works on this topic.

Exploring the reasons for the seasons using Google Earth, 3D models, and plots

Public understanding of climate and climate change is of broad societal importance.However,misconceptions regarding reasons for the seasons abound amongst students,teachers,and the public,many of whom believe that seasonality is caused by large variations in Earth’s distance from the Sun.Misconceptions may be reinforced by textbook illustrations that exaggerate eccentricity or show an inclined view of Earth’s near-circular orbit.Textbook explanations that omit multiple factors influencing seasons,that do not mesh with students’experiences,or that are erroneous,hinder scientifically valid reasoning.Studies show that many teachers share their students’misconceptions,and even when they understand basic concepts,teachers may fail to appreciate the range of factors contributing to seasonal change,or their relative importance.We have therefore developed a learning resource using Google Earth,a virtual globe with other useful,weather-and climate-related visualizations.A classroom test of 27 undergraduates in a public research university showed that 15 improved their test scores after the Google Earth-based laboratory class,whereas 5 disimproved.Mean correct answers rose from 4.7/10 to 6/10,giving a paired t-test value of 0.21.After using Google Earth,students are helped to segue to a heliocentric view.

Neural 3D reconstruction from sparse views using geometric priors

Sparse view 3D reconstruction has attracted increasing attention with the development of neural implicit 3D representation.Existing methods usually only make use of 2D views,requiring a dense set of input views for accurate 3D reconstruction.In this paper,we show that accurate 3D reconstruction can be achieved by incorporating geometric priors into neural implicit 3D reconstruction.Our method adopts the signed distance function as the 3D representation,and learns a generalizable 3D surface reconstruction model from sparse views.Specifically,we build a more effective and sparse feature volume from the input views by using corresponding depth maps,which can be provided by depth sensors or directly predicted from the input views.We recover better geometric details by imposing both depth and surface normal constraints in addition to the color loss when training the neural implicit 3D representation.Experiments demonstrate that our method both outperforms state-of-the-art approaches,and achieves good generalizability.

Parallel algorithm for viewshed analysis on a modern GPU

Spatial analysis,including viewshed analysis,is an important aspect of the Digital Earth system.Viewshed analysis is usually performed on a large scale,so efficiency is important in any Digital Earth application making these calculations.In this paper,a real-time algorithm for viewshed analysis in 3D scenes is presented by using the parallel computing capabilities of a graphics processing unit(GPU).In contrast to traditional algorithms based on line-of-sight,this algorithm runs completely within the programmable 3D visualization pipeline to render 3D terrains with viewshed analysis.The most important difference is its integration of the viewshed calculation with the rendering module.Invisible areas are rendered as shadows in the 3D scene.The algorithm process is paralleled by rasterizer units in the graphics card and by vertex and pixel shaders executed on the GPU.We have implemented this method in our 3D Digital Earth system with the DirectX 9.0c API and tested on some consumer-level PC platforms with interactive framerates and high image quality.Our algorithm has been widely used in related systems based on Digital Earth.

Toward optimizing the design of virtual environments for route learning:empirically assessing the effects of changing levels of realism on memory

Broadly,this paper is about designing memorable 3D geovisualizations for spatial knowledge acquisition during(virtual)navigation.Navigation is a fundamentally important task,and even though most people navigate every day,many find it difficult in unfamiliar environments.When people get lost in an unfamiliar environment,or are unable to remember a route that they took,they might feel anxiety,disappointment and frustration;and in real world,such incidents can be costly,and at times,life-threatening.Therefore,in this paper,we study the design decisions in terms of visual realism in a city model,propose a visualization design optimized for route learning,implement and empirically evaluate this design.The evaluation features a navigational route learning task,where we measure shortand long-term recall accuracy of 42 participants with varying spatial abilities and memory capacity.Our findings provide unique empirical evidence on how design choices affect memory in route learning with geovirtual environments,contributing toward empirically verified design guidelines for digital cities.

Analysis of the factors affecting LiDAR DTM accuracy in a steep shrub area

The creation of a quality Digital Terrain Model(DTM)is essential for representing and analyzing the Earth in a digital form.The continuous improvements in the acquisition and the potential of airborne Light Detection and Ranging(LiDAR)data are increasing the range of applications of this technique to the study of the Earth surface.The aim of this study was to determine the optimal parameters for calculating a DTM by using an iterative algorithm to select minimum elevations from LiDAR data in a steep mountain area with shrub vegetation.The parameters were:input data type,analysis window size,and height thresholds.The effects of slope,point density,and vegetation on DTM accuracy were also analyzed.The results showed that the lowest root mean square error(RMSE)was obtained with an analysis window size of 10 m,5 m,and 2.5 m,rasterized data as input data,and height thresholds equal to or greater than 1.5 m.These parameters showed a RMSE of 0.19 m.When terrain slope varied from 0
10%to 50
60%,the RMSE increased by 0.11 m.The RMSE decreased by 0.06 m when point density was increased from 4 to 8 points/m2,and increased by 0.05 m in dense vegetation areas.