找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Visualization in Supercomputing; Raul H. Mendez Book 1990 Springer-Verlag New York, Inc. 1990 architecture.boundary element method.computa

[复制链接]
查看: 28247|回复: 45
发表于 2025-3-21 19:29:56 | 显示全部楼层 |阅读模式
书目名称Visualization in Supercomputing
编辑Raul H. Mendez
视频video
图书封面Titlebook: Visualization in Supercomputing;  Raul H. Mendez Book 1990 Springer-Verlag New York, Inc. 1990 architecture.boundary element method.computa
描述Massive amounts of numeric data are far more comprehensible when converted into graphical form. Hence visualization is becoming an integral part of many areas of research. The idea of visualization is not new, but techniques for visualization are still being developed, and visualization research is just beginning to be recognized as a cornerstone of future computer science. As scientists handle increasingly complex problems with computers, visualization will become an even more essential tool for extracting sense from numbers. This volume is a collection of the best papers selected from those presented at the August 1988 .Visualization in Supercomputing. Conference in Tokyo, Japan. It is divided into three parts: visualization applications, hardware and performance, and visualization theory. Subjects covered include visualization methods used in computational fluid dynamics research, time-to-solution aspects of visualization, the use of parallel/vector computers with finite element method systems, basic computational performance of two graphics supercomputers, and the applicability of the volume imaging concept in various fields.
出版日期Book 1990
关键词architecture; boundary element method; computation; computer science; evolution; graphics; hardware; integr
版次1
doihttps://doi.org/10.1007/978-1-4612-3338-1
isbn_softcover978-1-4612-7971-6
isbn_ebook978-1-4612-3338-1
copyrightSpringer-Verlag New York, Inc. 1990
The information of publication is updating

书目名称Visualization in Supercomputing影响因子(影响力)




书目名称Visualization in Supercomputing影响因子(影响力)学科排名




书目名称Visualization in Supercomputing网络公开度




书目名称Visualization in Supercomputing网络公开度学科排名




书目名称Visualization in Supercomputing被引频次




书目名称Visualization in Supercomputing被引频次学科排名




书目名称Visualization in Supercomputing年度引用




书目名称Visualization in Supercomputing年度引用学科排名




书目名称Visualization in Supercomputing读者反馈




书目名称Visualization in Supercomputing读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:44:36 | 显示全部楼层
r in the theory of the Hankel transformation. The spaces have been called Sonine spaces by James and Virginia Rovnyak because they are related to properties of the Hankel transformation, which were discovered in 1880 by N. Sonine. His contributions are often taken as motivation for the Riemann hypot
发表于 2025-3-22 01:18:10 | 显示全部楼层
Kozo Fujiiy is upper bounded by 0.622 in the case where the input loads are drawn from the uniform distribution..Motivated by [3], we present a general method for computing the optimal single-threshold protocol for . continuous distribution, and we apply this method to the case of the exponential distribution
发表于 2025-3-22 04:34:39 | 显示全部楼层
发表于 2025-3-22 08:57:32 | 显示全部楼层
发表于 2025-3-22 14:57:02 | 显示全部楼层
发表于 2025-3-22 20:03:59 | 显示全部楼层
发表于 2025-3-23 01:12:36 | 显示全部楼层
K. Lue,K. Miyaie use of our algorithm on two examples from the literature. The first shows how to make the speedup of the .-median on a line problem in an online settings. The second shows how to improve the running time for a DP used to reduce the amount of bandwidth needed when paging mobile wireless users.
发表于 2025-3-23 04:35:29 | 显示全部楼层
James Perduetitiveness with a moderate speedup in the general setting of arbitrary packet sizes. We also prove a lower bound of . on the speedup of any 1-competitive deterministic algorithm, showing that our algorithm is close to the optimum. Additionally, we formulate a general framework for analyzing our algo
发表于 2025-3-23 08:24:17 | 显示全部楼层
Hiroyuki Sato,Mitsuo Ishii,Morio Ikesaka,Kouichi Murakami,Hiroaki Ishihataemand ., i.e., that consecutive requests come from points in the Euclidean space with distance bounded by some constant .. We show constant lower bounds on the competitiveness in this setting (independent of ., but dependent on ., . and .)..On the positive side, we present a deterministic online alg
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-1 09:13
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表