7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.最新文献_第6页

Approximation algorithms design for disk partial covering problem 磁盘部分覆盖问题的近似算法设计

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300466

Bin Xiao, Jiannong Cao, Qingfeng Zhuge, Yi He, E. Sha

引用次数: 19

Mobile agents based topology discovery algorithms and modelling 基于移动代理的拓扑发现算法及建模

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300528

Hui Tian, Hong Shen

引用次数: 9

Developing an XML schema of BWW ontologies for semantic Web 为语义Web开发BWW本体的XML模式

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300484

Liangbin Wang, G. Zhu

引用次数: 0

Parallel sorting by exact splitting 精确分割并行排序

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300464

Fan Dian, Tang Zhizhong

引用次数: 1

Multicast-based inference of network-internal loss 基于组播的网络内部损失推断

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300494

Hui Tian, Hong Shen

引用次数: 6

Efficient many-to-many real-time communication using an intelligent Ethernet switch 利用智能以太网交换机实现高效的多对多实时通信

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300493

Xing Fan, M. Jonsson, Hoai Hoang Bengtsson

引用次数: 9

Optimum traffic channel in GSM network by using alternative call routing (international roaming analytic) 基于备选呼叫路由的GSM网络流量通道优化(国际漫游分析)

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300513

Jatuporn Pliancharoen, Punyapat Chofabunthit, S. Noppanakeepong

引用次数: 2

Strategies for exploring large scale data 探索大规模数据的策略

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300447

J. JáJá

{"title":"Strategies for exploring large scale data","authors":"J. JáJá","doi":"10.1109/ISPAN.2004.1300447","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300447","url":null,"abstract":"Summary form only given. We consider the problem of querying large scale multidimensional time series data to discover events of interest, test and validate hypotheses, or to associate temporal patterns with specific events. This type of data currently dominates most other types of available data, and will very likely become even more prevalent in the future given the current trends in collecting time series of business, scientific, demographic, and simulation data. The ability to explore such collections interactively, even at a coarse level, will be critical in discovering the information and knowledge embedded in such collections. We develop indexing techniques and search algorithms to efficiently handle temporal range value querying of multidimensional time series data. Our indexing uses linear space data structures that enable the handling of queries in I/O time that is essentially the same as that of handling a single time slice, assuming the availability of a logarithmic number of processors as a function of the temporal window. A data structure with provably almost optimal asymptotic bounds is also presented for the case when the number of multidimensional objects is relatively small. These techniques improve significantly over standard techniques for either serial or parallel processing, and are evaluated by extensive experimental results that confirm their superior performance.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130163156","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}

引用次数: 0

Mining and knowledge discovery from the Web 从Web挖掘和发现知识

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300449

K. McCurley, A. Tomkins

引用次数: 13

Construct a grid computing environment for bioinformatics 构建生物信息学网格计算环境

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300502

Yu-Lun Kuo, Chao-Tung Yang, Chuan-Lin Lai, Tsai-Ming Tseng

{"title":"Construct a grid computing environment for bioinformatics","authors":"Yu-Lun Kuo, Chao-Tung Yang, Chuan-Lin Lai, Tsai-Ming Tseng","doi":"10.1109/ISPAN.2004.1300502","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300502","url":null,"abstract":"Internet computing and grid technologies promise to change the way we tackle complex problems. They will enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. And harnessing these new technologies effectively will transform scientific disciplines ranging from high-energy physics to the life sciences. The computational analysis of biological sequences is a kind of computation driven science. Cause the biology data growing quickly and these databases are heterogeneous. We can use the grid system sharing and integrating the heterogeneous biology database. As we know, bioinformatics tools can speed up analysis the large-scale sequence data, especially about sequence alignment. The FASTA is a tool for aligning multiple protein or nucleotide sequences. FASTA which we used is a distributed and parallel version. The software uses a message-passing library called MPl (Message Passing Interface) and runs on distributed workstation clusters as well as on traditional parallel computers. A grid computing environment is proposed and constructed on multiple Linux PC clusters by using Globus Toolkit (GT) and SUN Grid Engine (SGE). The experimental results and performances of the bioinformatics tool using on grid system are also presented in this paper.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127092046","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