找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 28427|回復(fù): 45
樓主
發(fā)表于 2025-3-21 19:29:56 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Visualization in Supercomputing
編輯Raul H. Mendez
視頻videohttp://file.papertrans.cn/984/983863/983863.mp4
圖書封面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
關(guān)鍵詞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影響因子(影響力)學(xué)科排名




書目名稱Visualization in Supercomputing網(wǎng)絡(luò)公開度




書目名稱Visualization in Supercomputing網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Visualization in Supercomputing被引頻次




書目名稱Visualization in Supercomputing被引頻次學(xué)科排名




書目名稱Visualization in Supercomputing年度引用




書目名稱Visualization in Supercomputing年度引用學(xué)科排名




書目名稱Visualization in Supercomputing讀者反饋




書目名稱Visualization in Supercomputing讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 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
板凳
發(fā)表于 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
地板
發(fā)表于 2025-3-22 04:34:39 | 只看該作者
5#
發(fā)表于 2025-3-22 08:57:32 | 只看該作者
6#
發(fā)表于 2025-3-22 14:57:02 | 只看該作者
7#
發(fā)表于 2025-3-22 20:03:59 | 只看該作者
8#
發(fā)表于 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.
9#
發(fā)表于 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
10#
發(fā)表于 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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-5 04:02
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
图们市| 平罗县| 洞口县| 长兴县| 澄迈县| 延吉市| 开封县| 虎林市| 澎湖县| 阿鲁科尔沁旗| 柳河县| 田东县| 加查县| 普兰店市| 新民市| 太谷县| 家居| 白水县| 中卫市| 潍坊市| 萝北县| 西安市| 大足县| 清流县| 顺平县| 惠州市| 黄龙县| 沧州市| 昆山市| 当阳市| 兰西县| 华蓥市| 扎鲁特旗| 眉山市| 通渭县| 长治县| 南涧| 大连市| 探索| 阿图什市| 阜新市|