发布求助
文献互助 智能选刊 最新文献

First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)最新文献

筛选
英文 中文
A General Framework for Parallel Planar Mesh Generation 并行平面网格生成的通用框架
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.7
Ligang Chen, Yi Liang, Jianjun Chen, Yao Zheng
{"title":"A General Framework for Parallel Planar Mesh Generation","authors":"Ligang Chen, Yi Liang, Jianjun Chen, Yao Zheng","doi":"10.1109/IMSCCS.2006.7","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.7","url":null,"abstract":"In this paper, we present a general framework for 2D parallel mesh generation. A prepartitioner for domain decomposition is integrated into the framework, which strives to make the resulting subdomains well-shaped and thus guarantees the high quality of resulting meshes. Moreover, the time-consuming prepartitioning stage is parallelized in two ways with various grained levels, and the finer grained one turns out preferable. The subdomain connections are stored as a subdomain graph (SDG), which helps prevent mapping disconnected subdomains into a single processor whenever static or dynamic load balancing strategies are adopted. Well partitioned meshes could be generated simultaneously with parallel mesh generation, and hence the cost of mesh repartitioning could be eliminated or reduced. The SDG construction is simplified and independent of domain decomposition by introducing the concept of the characteristic polygon set (CPS). Shared nodes between neighboring subdomains are duplicated, that ensures subdomain meshing be completed with little or without communications, and full code-reuse of serial meshing algorithms be achieved in this framework","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"281 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121265997","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
Phelogenetic Tree Construction using Self adaptive Ant Colony Algorithm 基于自适应蚁群算法的系统进化树构建
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.104
Ling Qin, Jianli Luo, Zhimin Chen, Jing Guo, Ling Chen, Yi Pan
{"title":"Phelogenetic Tree Construction using Self adaptive Ant Colony Algorithm","authors":"Ling Qin, Jianli Luo, Zhimin Chen, Jing Guo, Ling Chen, Yi Pan","doi":"10.1109/IMSCCS.2006.104","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.104","url":null,"abstract":"A new phylogenetic tree construction method from a given set of objects (proteins, species, etc) is presented. As an extension of ant colony optimization, this method proposes an adaptive heuristic phylogenetic clustering algorithm based on a digraph to find a tree-like structure that defines certain ancestral relationships between the given objects. In our method, the given objects are clustered by the ant colony, and these clusters are used to construct phylogenetic trees progressively. In the end of the algorithm, these phylogenetic trees are optimized by the ant colony to get the fittest to the given objects. Our phylogenetic tree constructing method is tested to compare its results with that of the GA method. Experimental results show that our algorithm is easier to implement and more efficient. It can convergence faster and obtain higher quality results than GA","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126874794","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 UDDI-based Two-Level Information Management System for Equipment Grid 基于uddi的设备网格两级信息管理系统
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.23
Jiguang Liu, Jianjun Jiang, Binbin Zhang
{"title":"A UDDI-based Two-Level Information Management System for Equipment Grid","authors":"Jiguang Liu, Jianjun Jiang, Binbin Zhang","doi":"10.1109/IMSCCS.2006.23","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.23","url":null,"abstract":"Equipment grid is a highlight of grid application for sharing a lot of science equipments and experiment instruments. But the diversity of equipments is a troublesome problem, which influences the development and management of gird. The classifications for equipments may help the grids resolve the diversity of equipments. This paper presents an UDDI-based two-level information management system for equipment grid, which combines the MDS4 of Globus Toolkits 4.0 with the UDDI from the technology of Web service. It builds up a valid classification mechanism in virtue of the UDDI registry, and keeps the flexibility of the MDS Index","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122350051","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
CoarseZ Buffer Bandwidth Model in 3D Rendering Pipeline 三维渲染管道中的CoarseZ缓冲带宽模型
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.44
Ke Yang, Ke Gao, Jiaoying Shi, Xiaohong Jiang, Hua Xiong
{"title":"CoarseZ Buffer Bandwidth Model in 3D Rendering Pipeline","authors":"Ke Yang, Ke Gao, Jiaoying Shi, Xiaohong Jiang, Hua Xiong","doi":"10.1109/IMSCCS.2006.44","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.44","url":null,"abstract":"Depth traffic occupies a major portion of 3D graphics memory bandwidth. In order to reduce depth reading, we propose employing a low-resolution depth buffer, namely CoarseZ buffer, for tile-level depth culling before per-pixel test. The maximum depth of a tile is stored in the corresponding entry of CoarseZ buffer. Simulation results show that a small CoarseZ buffer can achieve remarkably high culling rate and significantly reduce z-reading bandwidth. We build a model that quantifies the influence of the CoarseZ design parameters on its efficiency and bandwidth. Test results of industrial benchmarks show that CoarseZ with tile size of 4 and bit depth of 16 can be a best selection to reduce memory bandwidth","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116627043","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
An Interrupt Mechanism in Grid 网格中的中断机制
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.35
Jianjun Jiang, Jiguang Liu, Yun Yao
{"title":"An Interrupt Mechanism in Grid","authors":"Jianjun Jiang, Jiguang Liu, Yun Yao","doi":"10.1109/IMSCCS.2006.35","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.35","url":null,"abstract":"In recent years, the technology of grid is developed quickly, but it has to face some problems waiting for resolution, such as improving the real time of grid. And at present the researches focus on two related efforts, the development of protocols enabling negotiation for the QoS of resource use, and the development of resource management pertinence strategies and algorithms. Considering the requests of equipment grid, this paper proposes an interrupt mechanism in grid environment that implements interrupt trigger, interrupt priority management, interrupt handling, etc. This interrupt mechanism, adopting the method for hardware management in computer, improves the real time of resource discovery in the level of resource management for grid in order to enhance that of the whole system","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129954840","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
A Virtual Rhomb Grid-Based Movement-Assisted Sensor Deployment Algorithm in Wireless Sensor Networks 无线传感器网络中基于虚拟菱形网格的运动辅助传感器部署算法
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.26
Xueqing Wang, Yongtian Yang, Zhonglin Zhang
{"title":"A Virtual Rhomb Grid-Based Movement-Assisted Sensor Deployment Algorithm in Wireless Sensor Networks","authors":"Xueqing Wang, Yongtian Yang, Zhonglin Zhang","doi":"10.1109/IMSCCS.2006.26","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.26","url":null,"abstract":"Sensor deployment, to a large extent, affects the performance and effectiveness of wireless sensor networks (WSN). For the conservation of energy, selecting only a subset of nodes is active and others are sleep. The problem is represented by the connected dominating set (CDS) of the graph, and the minimum connected dominating set (MCDS) is NP-hard for arbitrary graphs. The deployment is either deterministic or self-organizing. By analyzing of the relationship between both of the deployment, a virtual rhomb grid-based movement-assisted sensor deployment algorithm (VRGMSD) is proposed, which integrates both deterministic and self-organizing deployment in a unified framework. The VRGMSD algorithm (1) can form a MCDS; (2) ensures that there is no \"holes\" in the sensor field; (3) can select different k (the degree of coverage or connectivity) according to the demand on different applications. This flexibility allows the network to self-configure for a wide range of applications","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124653102","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}
引用次数: 14
ODSG: An Architecture of Ontology-based Distributed Simulation on Grid 基于本体的网格分布式仿真体系结构
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.94
Yiyou Dong, Jianhua Yang, Zhaohui Wu
{"title":"ODSG: An Architecture of Ontology-based Distributed Simulation on Grid","authors":"Yiyou Dong, Jianhua Yang, Zhaohui Wu","doi":"10.1109/IMSCCS.2006.94","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.94","url":null,"abstract":"In this paper, we present an architecture of ontology-based distributed simulation on grid (ODSG) which facilitates life-cycle management of large-scale distributed interactive simulation on the grid computing environment. The architecture aims at some further solved key technologies for M&S (model and simulation) and new simulation pattern on open, complex, large-scale distributed grid environment. We accomplished a novel well-defined multi-layered architecture, which consists of grid infrastructure layer, simulation grid middleware layer, ontology-based GUI layer, simulation application layer and users layer. Under the architecture of ODSG, ontology-based simulation services integrate ontology and grid technologies to provide a semantic heterogeneous solution to describe simulation resources in distributed simulation environment. ODSG surmounts inherent shortcomings of traditional HLA-based distributed simulation on dynamical share, dynamical discovery, autonomy, fault tolerant, task migration, collaboration capability and security mechanism","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129593908","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
A Vortex Signal Processing Method Based on Wavelet Neural Network 基于小波神经网络的涡旋信号处理方法
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.27
Liying Zheng, Kai Tian
{"title":"A Vortex Signal Processing Method Based on Wavelet Neural Network","authors":"Liying Zheng, Kai Tian","doi":"10.1109/IMSCCS.2006.27","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.27","url":null,"abstract":"A vortex flowmeter has many advantages, such as high precision, good reliability, and proportionality of frequency of vortex signal with the liquid volume. However it is subjected to noise disturbances caused by pipe vibrations and fluid turbulence. The processing circuits with the vortex flowmeter are unable to ensure the measuring accuracy in industrials. This paper presents a vortex signal processing method based on wavelet neural network. The simulation results show that, the method can significantly de-noise","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123810453","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
Speech Stream Detection in Short-wave Channel Based on Cepstral of Auditory Wavelet Packets 基于听觉小波包倒谱的短波信道语音流检测
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.128
Liran Shen, Qingbo Yin, Xueyao Li, Huiqiang Wang
{"title":"Speech Stream Detection in Short-wave Channel Based on Cepstral of Auditory Wavelet Packets","authors":"Liran Shen, Qingbo Yin, Xueyao Li, Huiqiang Wang","doi":"10.1109/IMSCCS.2006.128","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.128","url":null,"abstract":"This paper is aimed at non-stationary characteristic of noise and speech signal in short-wave channel. A novel speech stream detection method based on the cepstral of auditory wavelet packet was proposed. The results of experiments show that this method is a good one for speech stream detection, with nice combat noise performance and adaptation","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124312060","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
A Fast Parallel Longest Common Subsequence Algorithm Based on Pruning Rules 基于剪枝规则的快速并行最长公共子序列算法
First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06) Pub Date : 2006-06-20 DOI: 10.1109/IMSCCS.2006.6
W. Liu, Yixin Chen, Ling Chen, Ling Qin
{"title":"A Fast Parallel Longest Common Subsequence Algorithm Based on Pruning Rules","authors":"W. Liu, Yixin Chen, Ling Chen, Ling Qin","doi":"10.1109/IMSCCS.2006.6","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.6","url":null,"abstract":"Searching for the longest common subsequence (LCS) of biosequences is one of the most important problems in bioinformatics. A fast algorithm for LCS problem FAST_LCS is presented. The algorithm first seeks the successors of the initial identical character pairs according to a successor table to obtain all the identical pairs and their levels. By tracing back from the identical character pair at the highest level, strong pruning rules are developed. For two sequences X and Y with length n and m, respectively, the memory required for FAST_LCS is max{4*(n+1)+4*(m+1), L}, where L is the number of identical character pairs. The time complexity of parallel computing is O(|LCS(X,Y)|), where |LCS(X,Y)| is the length of the LCS of X, Y. Experimental result on the gene sequences of tigr database using MPP parallel computer Shenteng 1800 shows that our algorithm can find the exact solutions significantly more efficiently than other LCS algorithms","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126564389","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}
引用次数: 5
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信