检索结果-内蒙古大学图书馆

International Research and Training Group 1131 Workshop on visualization of Large and Unstructured data Sets: Applications in Geospatial Planning, Modeling and Engineering, VLUDS 2011

作者： Westerteiger, Rolf Gerndt, Andreas Hamann, Bernd Braunschweig Germany CS Department Institute for Data Analysis and Visualization University of California Davis United States Computer Graphics and HCI Group University of Kaiserslautern Germany

ISBN: (纸本)9783939897460

We present an interactive spherical terrain rendering system employing a hierarchical subdivision of the HEALPix coordinate system using quadtrees. Compared to other parameterizations, the scheme avoids singularities and allows for efficient fusion of mixed-resolution digital elevation models and imagery. A Level-of-Detail heuristic is used to guarantee both high performance and visual fidelity. Unified treatment of DEM and imagery data is achieved by performing the HEALPix projection within a GPU shader. The system is applied to the exploration of Mars, using both MOLA (NASA) and HRSC (German Aerospace Center) data sets.

关键词： NASA

来源：评论

学校读者我要写书评

暂无评论

CFD simulation of liquid-liquid extraction columns and visualization of eulerian datasets

CFD simulation of liquid-liquid extraction columns and visua...

引用

International Research and Training Group 1131 Workshop on visualization of Large and Unstructured data Sets: Applications in Geospatial Planning, Modeling and Engineering, VLUDS 2011

作者： Hlawitschka, Mark W. Chen, Fang Bart, Hans-Jörg Hamann, Bernd Department of Separation Science and Technology University of Kaiserslautern Germany Computer Graphics and HCI Group University of Kaiserslautern Germany CS Department Institute for Data Analysis and Visualization University of California Davis United States 2 University of Kaiserslautern Germany

ISBN: (纸本)9783939897460

In this joint work, a complete framework for modeling, simulating and visualizing multiphase fluid flow within an extraction column is presented. We first present a volume-of-fluid simulation, which is able to predict the surface of the droplets during coalescence. However, a fast and efficient model is needed for the simulation of a liquid-liquid extraction column due to the high number of occurring droplets. To simulate the velocity and droplet size in a DN32 extraction column, a coupled computational fluid dynamic-population balance model solver is used. The simulation is analyzed using path-line based visualization techniques. A novel semi-automatic re-seeding technique for droplet path-line integration is proposed. With our technique, path-lines of fluid droplets can be re-initialized after contact with the stirring devices. The droplet breakage is captured, allowing the engineer to improve the design of liquid-liquid columns layout.

关键词： Computational fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

Preface 2nd

Preface

引用

2nd International Workshop on visualization in Medicine and Life sciences, VMLS 2009

作者： Linsen, Lars Hagen, Hans Hamann, Bernd Hege, Hans-Christian Jacobs University Bremen School of Engineering and Science Postfach 75 05 61 Bremen28725 Germany Universität Kaiserslautern FB Informatik Postfach 30 49 Kaiserslautern67653 Germany Institute for Data Analysis and Visualization Department of Computer Science University of California Davis One Shields Avenue DavisCA95616-8562 United States Visualization and Data Analysis Takustr. 7 Berlin14195 Germany

来源：评论

学校读者我要写书评

暂无评论

Sketch-based 3D model retrieval using keyshapes for global and local representation

Sketch-based 3D model retrieval using keyshapes for global a...

引用

5th Eurographics Workshop on 3D Object Retrieval, EG 3DOR 2012

作者： Saavedra, J.M. Bustos, B. Schreck, T. Yoon, S. Scherer, M. KDW-PRISMA Research Group Department of Computer Science University of Chile Chile Data Analysis and Visualization Group University of Konstanz Germany Yonsei Institute of Convergence Technology Yonsei University Korea Republic of GRIS TU Darmstadt Germany

ISBN: (纸本)9783905674361

Since 3D models are becoming more popular, the need for effective methods capable of retrieving 3D models is becoming crucial. Current methods require an example 3D model as query. However, in many cases, such a query is not easy to get. An alternative is using a hand-drawn sketch as query. In this work, we present a new keyshape based approach named HKO-KASD for retrieving 3D models using rough sketches as queries. Our approach comprises two general steps. First, a global descriptor is used to determine the appropriate viewpoint for each model. Second, we apply a local matching process to determine the final ranking for an input sketch. To this end, we present a local descriptor capable of working with sketch representations. The global descriptors as well as the local descriptors rely on a set of keyshapes precomputed from 2D representations of 3D models and from the query sketch as well. We evaluate our method using the first-tier precision and compare it with current approaches (HELO, STELA). Our results show a significant increase in precision for many classes of 3D models. © The Eurographics Association 2012.

关键词： Self organizing maps

来源：评论

学校读者我要写书评

暂无评论

Graph-based combinations of fragment descriptors for improved 3D object retrieval 12

Graph-based combinations of fragment descriptors for improve...

引用

3rd ACM Multimedia Systems Conference, MMSys'12

作者： Schreck, Tobias Scherer, Maximilian Walter, Michael Bustos, Benjamin Yoon, Sang Min Kuijper, Arjan Data Analysis and Visualization Group University of Konstanz Germany Interactive Graphics Systems Technische Universität Darmstadt Germany KDW+PRISMA Department of Computer Science University of Chile Chile Yonsei Institute of Convergence Technology Yonsei University Korea Republic of Fraunhofer Institute for Computer Graphics Research Darmstadt Germany

ISBN: (纸本)9781450311311

3D Object Retrieval is an important field of research with many application possibilities. One of the main goals in this research is the development of discriminative methods for similarity search. The descriptor-based approach to date has seen a lot of research attention, with many different extraction algorithms proposed. In previous work, we have introduced a simple but effective scheme for 3D model retrieval based on a spatially fixed combination of 3D object fragment descriptors. In this work, we propose a novel flexible combination scheme based on finding the best matching fragment descriptors to use in the combination. By an exhaustive experimental evaluation on established benchmark data we show the capability of the new combination scheme to provide improved retrieval effectiveness. The method is proposed as a versatile and inexpensive method to enhance the effectiveness of a given global 3D descriptor approach. © 2012 ACM.

关键词： Self organizing maps

来源：评论

学校读者我要写书评

暂无评论

Liquidlike correlations in single-crystalline Y2Mo2O7: An unconventional spin glass

引用

Physical Review B 2014年第5期89卷 054433-054433页

作者： H. J. Silverstein K. Fritsch F. Flicker A. M. Hallas J. S. Gardner Y. Qiu G. Ehlers A. T. Savici Z. Yamani K. A. Ross B. D. Gaulin M. J. P. Gingras J. A. M. Paddison K. Foyevtsova R. Valenti F. Hawthorne C. R. Wiebe H. D. Zhou Department of Chemistry University of Manitoba Winnipeg Manitoba R3T 2N2 Canada Department of Physics and Astronomy McMaster University Hamilton Ontario L8S 4M1 Canada Department of Physics and Astronomy University of Waterloo Waterloo Ontario N2L 3G1 Canada Perimeter Institute for Theoretical Physics 31 Caroline Street North Waterloo Ontario N2L 2Y5 Canada School of Physics HH Wills Physics Laboratory University of Bristol Bristol BS8 1TL United Kingdom Indiana University 2401 Milo B. Sampson Lane Bloomington Indiana 47408 USA NIST Center for Neutron Research National Institute of Standards and Technology Gaithersburg Maryland 20899-6102 USA Department of Materials Science and Engineering University of Maryland College Park Maryland 20742 USA Quantum Condensed Matter Division Neutron Sciences Directorate Oak Ridge National Laboratory Oak Ridge Tennessee 37831 USA Neutron Data Analysis and Visualization Division Neutron Sciences Directorate Oak Ridge National Laboratory Oak Ridge Tennessee 37831 USA Canadian Neutron Beam Centre Chalk River Ontario K0J 1P0 Canada Canadian Institute for Advanced Research 180 Dundas St. W. Toronto Ontario M5G 1Z8 Canada Brockhouse Institute for Materials Research McMaster University Hamilton Ontario L8S 4M1 Canada Department of Chemistry University of Oxford Inorganic Chemistry Laboratory South Parks Road Oxford OX1 3QR United Kingdom ISIS Facility Rutherford Appleton Laboratory Chilton Didcot Oxfordshire OX11 0QX United Kingdom Institut für Theoretische Physik Goethe-Universität Frankfurt Frankfurt am Main 60438 Germany Department of Geological Sciences University of Manitoba Winnipeg Manitoba R3T 2N2 Canada Department of Chemistry University of Winnipeg 515 Portage Ave. Winnipeg Manitoba R3B 2E9 Canada Department of Physics and Astronomy University of Tennessee Knoxville Tennessee 37996-1200 USA National High Magnetic Field Laboratory Florida State University Tallahassee Florida 32306-4005 USA

The spin-glass behavior of Y2Mo2O7 has remained a puzzle for nearly three decades. Free of bulk disorder within the resolution of powder diffraction methods, it is thought that this material is a rare realization of a spin glass resulting from weak disorder such as bond disorder or local lattice distortions. Here we report on the single-crystal growth of Y2Mo2O7. Using neutron scattering, we present isotropic magnetic diffuse scattering occurring below the spin-glass transition. Our attempts to model the diffuse scattering using a computationally exhaustive search of a class of simple spin Hamiltonians show no agreement with the experimentally observed energy-integrated (diffuse) neutron scattering. This suggests that spin degrees of freedom are insufficient to describe this system. Indeed, a T2 temperature dependence in the heat capacity and density functional theory calculations hint at the presence of a significant frozen degeneracy in both the spin and orbital degrees of freedom resulting from spin-orbital coupling (Kugel-Khomskii type) and random fluctuations in the Mo environment at the local level.

关键词： SPIN glasses SINGLE crystals X-ray powder diffraction LATTICE theory NEUTRON scattering ISOTROPIC properties HAMILTONIAN systems

来源：评论

学校读者我要写书评

暂无评论

Diverse subgroup set discovery

Diverse subgroup set discovery

引用

作者： Van Leeuwen, Matthijs Knobbe, Arno Machine Learning Department of Computer Science Katholieke Universiteit Leuven Leuven Belgium Algorithmic Data Analysis Department of Information and Computer Sciences Universiteit Utrecht Utrecht Netherlands Leiden Institute of Advanced Computer Science Universiteit Leiden Leiden Netherlands

Large data is challenging for most existing discovery algorithms, for several reasons. First of all, such data leads to enormous hypothesis spaces, making exhaustive search infeasible. Second, many variants of essentially the same pattern exist, due to (numeric) attributes of high cardinality, correlated attributes, and so on. This causes top-k mining algorithms to return highly redundant result sets, while ignoring many potentially interesting results. These problems are particularly apparent with subgroup discovery (SD) and its generalisation, exceptional model mining. To address this, we introduce subgroup set discovery: one should not consider individual subgroups, but sets of subgroups. We consider three degrees of redundancy, and propose corresponding heuristic selection strategies in order to eliminate redundancy. By incorporating these (generic) subgroup selection methods in a beam search, the aim is to improve the balance between exploration and exploitation. The proposed algorithm, dubbed DSSD for diverse subgroup set discovery, is experimentally evaluated and compared to existing approaches. For this, a variety of target types with corresponding datasets and quality measures is used. The subgroup sets that are discovered by the competing methods are evaluated primarily on the following three criteria: (1) diversity in the subgroup covers (exploration), (2) the maximum quality found (exploitation), and (3) runtime. The results show that DSSD outperforms each traditional SD method on all or a (non-empty) subset of these criteria, depending on the specific setting. The more complex the task, the larger the benefit of using our diverse heuristic search turns out to be. © The Author(s) 2012.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

A tale of two systems: Flexibility of usage of Kraken and Nautilus at the National institute for Computational sciences

A tale of two systems: Flexibility of usage of Kraken and Na...

引用

1st Conference of the Extreme science and Engineering Discovery Environment: Bridging from the eXtreme to the Campus and Beyond, XSEDE12

作者： Szczepański, Amy F. Huang, Jian Ahern, Sean Fahey, Mark R. Remote Data Analysis and Visualization Center Electrical Engineering and Computer Science University of Tennessee 1520 Middle Drive Knoxville TN 37996-2250 United States Remote Data Analysis and Visualization Center National Institute for Computational Sciences University of Tennessee PO Box 2008 Oak Ridge TN 37831-6173 United States National Institute for Computational Sciences Industrial and Information Engineering University of Tennessee PO Box 2008 Oak Ridge TN 37831-6173 United States

ISBN: (纸本)9781450316026

The National institute for Computational sciences (NICS) at the University of Tennessee currently operates two computational resources for the eXtreme science and Engineering Discovery Environment (XSEDE), Kraken, a 112,896-core Cray XT5 for general purpose computation, and Nautilus, a 1,024-core SGI Altix UV 1000 for data analysis and visualization. We analyze a year's worth of accounting logs for Kraken and Nautilus to understand how users take advantage of these two systems and how analysis jobs differ from general HPC computation We find that researchers take advantage of the flexibility offered by these systems, running a wide variety of jobs at many scales and using the full range of core counts and available memory for their jobs. The jobs on Nautilus tend to use less walltime and more memory per core than the jobs run on Kraken. Additionally, researchers are more likely to run interactive jobs on Nautilus than on Kraken. Small jobs experience a good quality of service on both systems. This information can be used for the management and allocation of time on existing HPC and analysis systems as well as for planning for deploying future HPC and analysis systems. © 2012 ACM.

关键词： data visualization

来源：评论

学校读者我要写书评

暂无评论

Clinical "MUTATOME" Of Myelodysplastic Syndrome;Comparison To Primary Acute Myelogenous Leukemia

引用

BLOOD 2013年第21期122卷 518-518页

作者： Makishima, Hideki LaFramboise, Thomas Przychodzen, Bartlomiej P. Yoshida, Kenichi Ruffalo, Matthew Gomez-Segui, Ines Husseinzadeh, Holleh D. Shiraishi, Yuichi Sanada, Masashi Nagata, Yasunobu Sato, Yusuke Sato-Otsubo, Aiko Chiba, Kenichi Tanaka, Hiroko Nakamaki, Tsuyoshi Hofmann, Wolf-Karsten Miyawaki, Shuichi Shih, Lee-Yung Chiba, Shigeru Miyano, Satoru Hosono, Naoko Polprasert, Chantana Thota, Swapna Dienes, Brittney Guinta, Kathryn M. Sauntharatajah, Yogen Sekeres, Mikkael A. Ogawa, Seishi Maciejewski, Jaroslaw P. Translational Hematology and Oncology Research Cleveland Clinic Taussig Cancer Institute Cleveland OH USA Department of Electrical Engineering and Computer Science Case Western Reserve University Cleveland OH USA Department of Pathology and Tumor biology Kyoto University Kyoto Japan Electrical Engineering and Computer Science Case Western Reserve University Cleveland OH USA Hematology Department University Hospital La Fe Valencia Spain Laboratory of DNA Information Analysis Human Genome Center Institute of Medical Science The University of Tokyo Tokyo Japan Department of Pathology and Tumor Biology Graduate School of Medicine Kyoto University Kyoto Japan Cancer Genomics Project Graduate School of Medicine The University of Tokyo Tokyo Japan Laboratory of Sequence Data Analysis Human Genome Center Institute of Medical Science The University of Tokyo Tokyo Japan Division of Hematology Department of Medicine Showa University School of Medicine Tokyo Japan Department of Hematology and Oncology University Hospital Mannheim Mannheim Germany Division of Hematology Department of Internal Medicine Tokyo Metropolitan Ohtsuka Hospital Tokyo Japan Chang Gung Memorial Hospital Taoyuan Taiwan Department of Hematology Faculty of Medicine University of Tsukuba Tsukuba Japan

518

关键词：

来源：评论

学校读者我要写书评

暂无评论

Topology exploration with hierarchical landscapes

Topology exploration with hierarchical landscapes

引用

Workshop at SIGGRAPH Asia 2012, WASA 2012

作者： Demir, Dogan Beketayev, Kenes Weber, Gunther H. Bremer, Peer-Timo Pascucci, Valerio Hamann, Bernd Scientific Computing and Imaging Institute School of Computing University of Utah United States Computational Research Divisition Lawrence Berkeley National Laboratory United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States Institute for Data Analysis and Visualization Computer Science Department University of California Davis CA United States

ISBN: (纸本)9781450318358

Topological landscapes have been proposed as a visual metaphor for contour trees that does not require an understanding of the theory involved in defining contour trees. The idea is to create a representative terrain with the same topological structure as a given contour tree. This representation exploits the natural human ability to interpret topography and results in an intuitive visualization of otherwise abstract information. However, topological landscapes still suffer from some of the same limitations as traditional contour tree visualization. Most notable is the fact that for complex functions landscapes can quickly become highly complex, exceeding the limits of human comprehension as well as the available computing resources. To address this challenge, we propose a new framework for the dynamic creation and visualization of hierarchical topological landscapes. Our system provides an interactive visualization of complex functions by utilizing a hierarchical decomposition of the contour tree as well as focus+context type interactions. For three dimensional data, we link the landscape display to flexible isosurface extraction in order to correlate terrain features with their corresponding three dimensional counterparts. We demonstrate the utility and versatility of our approach on a variety of both low and high dimensional data sets. © 2012 ACM.

关键词： visualization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：