Proceedings 15th International Conference on Information Networking最新文献_第10页

A 3D modeling system for creative design 一个用于创意设计的3D建模系统

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905468

Hiroaki Nishino, H. Takagi, Sung-Bae Cho, K. Utsumiya

引用次数: 58

New interconnection networks: Fibonacci cube and extended Fibonacci cubes based hierarchic networks 新的互连网络:基于层次网络的斐波那契立方体和扩展斐波那契立方体

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905621

A. Karcı

引用次数: 12

Jini-enabled high performance computing 支持jini的高性能计算

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905422

Rong Ye, W. Hsu, Zehua Liu, Voon-Yee Vee

{"title":"Jini-enabled high performance computing","authors":"Rong Ye, W. Hsu, Zehua Liu, Voon-Yee Vee","doi":"10.1109/ICOIN.2001.905422","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905422","url":null,"abstract":"The vision of computational grids promises an exciting future for high performance computing (HPC). In the project presented we make a small but practical step toward the grand vision of pervasive HPC by using some of the prevailing Internet technologies to enable access of HPC anytime and anywhere. Specifically, the project focuses on HPC that could be accessed by using the World Wide Web. We have conducted experiments based on engineering/scientific applications. Examples include simulations of automated guided vehicles (hereafter AGVs for short) in container port operations, N-body and molecular simulations. We initially build systems based on an ad-hoc approach, whose merits and demerits are identified. Then, we employ Jini technology to reconstruct the system architecture and present a more efficient and robust model. Performance studies are also presented. The objectives are to explore and address relevant issues, evaluate various approaches, demonstrate a workable version and conduct experiments with actual Web-enabled applications. The result is that now we are able to partially realize the dream of using the HPCs anytime and anywhere through devices such as a wireless/mobile computer, as long as they are armed with a common Web browser.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117126495","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Random early blocking routing in VP-based ATM networks 基于虚拟网关的ATM网络中的随机早期阻塞路由

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905466

Shun-Ping Chung, Chi-Ming Tsai

{"title":"Random early blocking routing in VP-based ATM networks","authors":"Shun-Ping Chung, Chi-Ming Tsai","doi":"10.1109/ICOIN.2001.905466","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905466","url":null,"abstract":"With the advent of stored program control and common channel signaling, more network state information is available in a real-time fashion, and dynamically choosing route with real-time network state information becomes a popular topic. We focus on dynamic routing of virtual path (VP)-based ATM networks. First, the effective bandwidth is used to simplify call admission control (CAC) of VP-based ATM networks, while maintaining a certain level of multiplexing gain. We propose a novel dynamic routing random early blocking routing (REBR) as CAC for virtual connections. Further we derive approximation methods to calculate the call-level related performance measures, e.g., call blocking probability and expected revenue loss. It is shown that approximation results are close to simulation results for most cases considered. It is shown via approximation and/or simulation that REBR performs better than least loaded routing (LLR) under light and moderate traffic loads, while performs similar to LLR under heavy traffic loads. We also compare REBR and other routing schemes, and similar conclusions can be drawn. We consider 2-rate heterogeneous traffic cases. Last but not least, various dynamic routing schemes are compared under non-stationary traffic.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124219315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

A study on reduction of traffic burstiness using window based segment spacing 基于窗口的路段间隔减少交通突发性的研究

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905323

Hyoungwoo Park, Jin-Wook Chung

{"title":"A study on reduction of traffic burstiness using window based segment spacing","authors":"Hyoungwoo Park, Jin-Wook Chung","doi":"10.1109/ICOIN.2001.905323","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905323","url":null,"abstract":"It has been frequently reported that the well-known problems in congestion control are caused by burstiness and unpredictability of traffic, and that burstiness and unpredictability of traffic are concerned with the characteristics of multimedia traffic itself. Therefore much research on traffic engineering has been focused on building traffic models to efficiently adapt multimedia traffic to the Internet. But, we find that lack of traffic shaping in conventional congestion control algorithms also makes traffic more bursty because conventional congestion control algorithms just only restrict the upper limit of the sending capability of TCP sessions during a RTT. As a result, TCP sessions can send the allowed maximum data at once without considering network congestion. This pattern of traffic generation can enlarge problems of burstiness and unpredictability of traffic. This paper suggests a new traffic generation algorithm for alleviating burstiness of traffic by introducing a traffic shaping concept into congestion control. The proposed method is \"window based segment spacing\", it can control data to be spaced evenly between segments during a RTT before sending. We present the improved result by using network simulator, ns2. The suggested algorithm can reduce packet loss to less than a half of that of conventional algorithms.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126364029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

A weighted distribution of residual failure data using Weibull model 基于威布尔模型的残余失效数据加权分布

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905438

Soo-Jong Lee, Kyeong-ho Lee

引用次数: 2

Distributed fractal image compression on PVM for million-pixel images 百万像素图像的PVM分布式分形图像压缩

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905457

P. Wu

{"title":"Distributed fractal image compression on PVM for million-pixel images","authors":"P. Wu","doi":"10.1109/ICOIN.2001.905457","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905457","url":null,"abstract":"We propose the distributed fractal image compression and decompression on a parallel virtual machine (PVM) system. We apply a regional search for the fractal image compression to reduce the communication cost on the distributed system PVM. The regional search is a partitioned iterated function system search from a region of the image instead of over the whole image. Because the area surrounding a partitioned block is similar to this block possibly, finding the fractal codes by regional search has a higher compression ratio and less compression time. When implemented on the PVM, the fractal image compression using regional search reduces the compression time with lower compression loss. When we compress the image Lena with an image size of 1024/spl times/1024 using a region size of 512/spl times/512 on the PVM with 4 Pentium II-300 PCs, the compression time is 13.6 seconds, the compression ratio is 6.34 and the PSNR is 38.59. However, it takes 176 seconds, have a compression ratio of 6.30 and have a PSNR of 39.68 by the conventional fractal image compression. In addition, when the region size is 128/spl times/128, the compression time is 7.8 seconds, the compression ratio is 7.53 and the PSNR is 36.67. In the future, we can apply this method to the fractal image compression using neural networks.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114735787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

On the delay and quality of DV transmission systems using ATM networks 基于ATM网络的DV传输系统的时延与质量研究

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905550

A. Machizawa, Kazunori Sugiura, T. Komine, H. Okazawa, S. Nakagawa

引用次数: 3

Method of visualizing homepages using certain quantifiers and its verification 使用某些量词可视化主页的方法及其验证

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905414

Osamu Yamagata, N. Kataoka, K. Tsuda, M. Morisue

{"title":"Method of visualizing homepages using certain quantifiers and its verification","authors":"Osamu Yamagata, N. Kataoka, K. Tsuda, M. Morisue","doi":"10.1109/ICOIN.2001.905414","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905414","url":null,"abstract":"The paper proposes the concept of \"page-interest-index\", which is an extraction of the characteristics of homepage information according to the degree to which the user's interest is satisfied. The proposed page-interest-index is a value that correlates such characteristics of homepage information with the degree of satisfaction of the user's interest. The concepts of \"homepage-character\" and \"browsing-character\" are also defined. They are the values consisting of a sequence of page-interest-indices in the order of pages browsed by the user. They are useful for getting an overview of the homepage. We have developed a verification system and applied it to homepages of consumer products. It has been observed that the homepage-character calculated from the Web documents takes an \"upward convex\" shape. Meanwhile, we have analyzed the probability of transition between pages, which were obtained from the Web access log, as a hidden Markov model (HMM). We confirmed that the page-interest-index, homepage-character and browsing-character proposed in the paper are useful quantifiers of homepages for making a visual representation of homepage information.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129318972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

A design of a Kansei retrieval system for distributed multimedia databases 面向分布式多媒体数据库的感性检索系统设计

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905441

T. Mitsuishi, Jun Sasaki, Y. Funyu

引用次数: 1