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

International Multi-Symposium of Computer and Computational Sciences最新文献

筛选
英文 中文
A Parallel Algorithm for Binary-Tree-Based String Re-writing inthe L-System l系统中基于二叉树的字符串重写并行算法
International Multi-Symposium of Computer and Computational Sciences Pub Date : 2007-08-13 DOI: 10.1109/IMSCCS.2007.96
Ting-Jyun Yang, Zhengge Huang, Xingsheng Lin, Jianjun Chen, Jun Ni
{"title":"A Parallel Algorithm for Binary-Tree-Based String Re-writing inthe L-System","authors":"Ting-Jyun Yang, Zhengge Huang, Xingsheng Lin, Jianjun Chen, Jun Ni","doi":"10.1109/IMSCCS.2007.96","DOIUrl":"https://doi.org/10.1109/IMSCCS.2007.96","url":null,"abstract":"Monte Carlo method has been widely used in many fields in the past few years. Currently, for mobile object localizing and tracking, Monte Carlo method has been practically proved a successful solution to solve these non-Gaussian, non-nonlinear and multi-dimensional systems. Recently, several Monte Carlo localization algorithms have been proposed for mobile sensor networks which point out a new direction for localization in sensor networks. However, these previous literatures generally use a fixed sample number in their Monte Carlo localization algorithms which is very inefficient and inappropriate to the low energy low computational capability sensors. In this paper, we introduce a sample adaptive Monte Carlo Localization algorithm (SAMCL) to improve the localization efficiency. Simulation results demonstrate that our method produces good localization accuracy as well as low computational cost compared with the previous Monte Carlo localization algorithms.","PeriodicalId":427564,"journal":{"name":"International Multi-Symposium of Computer and Computational Sciences","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127720919","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}
引用次数: 4
ArrayWiki: Liberating Microarray Data from Non-collaborative Public Repositories ArrayWiki:从非协作公共存储库中解放微阵列数据
International Multi-Symposium of Computer and Computational Sciences Pub Date : 2007-08-13 DOI: 10.1109/IMSCCS.2007.88
T. Stokes, J. Torrance, N. L. Goasduff, Henry Li, May D. Wang
{"title":"ArrayWiki: Liberating Microarray Data from Non-collaborative Public Repositories","authors":"T. Stokes, J. Torrance, N. L. Goasduff, Henry Li, May D. Wang","doi":"10.1109/IMSCCS.2007.88","DOIUrl":"https://doi.org/10.1109/IMSCCS.2007.88","url":null,"abstract":"Speech-stream detection plays an important role in short-wave communication. It is tiring for a person to listen something for a long time, especially in adverse environments. An algorithm for speech-stream detection in noisy environments, based on the empirical mode decomposition (EMD) and the statistical properties of higher-order cumulants of speech signals is presented. With the EMD, the noise signals can be decomposed into different numbers of IMFs. Then, the fourth-order cumulant (FOC) can be used to extract the desired feature of statistical properties for IMF components. Since the higher-order cumulants are blind for Gaussian signals, the proposed method is especially effective regarding the problem of speech-stream detection, where the speech signal is distorted, by Gaussian noise. Besides that, with the self-adaptive decomposition by the EMD, the proposed method can also work well for non-Gaussian noise. The experiments show that the proposed algorithm can suppress different noise types with different SNR, and the algorithm is robust in the real signal tests.","PeriodicalId":427564,"journal":{"name":"International Multi-Symposium of Computer and Computational Sciences","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131419160","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
Performance Study of a DHT based Grid Information Service with Data Caching 基于DHT的数据缓存网格信息服务性能研究
International Multi-Symposium of Computer and Computational Sciences Pub Date : 2007-08-13 DOI: 10.1109/IMSCCS.2007.75
W. Jie, Zhenghong Huang, Lianggui Tang, Sheng Lu
{"title":"Performance Study of a DHT based Grid Information Service with Data Caching","authors":"W. Jie, Zhenghong Huang, Lianggui Tang, Sheng Lu","doi":"10.1109/IMSCCS.2007.75","DOIUrl":"https://doi.org/10.1109/IMSCCS.2007.75","url":null,"abstract":"Grid information service (GIS) provides data about distributed resources within a Grid. A comprehensive performance investigation of a GIS can aid in detecting potential bottlenecks, advice in deployment, and help improve future system development. Targeting the proposed DHT-based GIS architecture with data caching, we designed a set of experiments addressing performance issues and conducted tests against the GIS deployed in a small scaled testbed. By analyzing the performance data collected from the experiments, we obtained a quantitative view of the behaviour of the GIS. It will help further the optimization and enhancement of the GIS architecture.","PeriodicalId":427564,"journal":{"name":"International Multi-Symposium of Computer and Computational Sciences","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121911835","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
Markov-Based Analytical Model for TCP Unfairness over Wireless Mesh Networks 基于markov的无线Mesh网络TCP不公平性分析模型
International Multi-Symposium of Computer and Computational Sciences Pub Date : 2006-04-20 DOI: 10.1109/IMSCCS.2006.238
Lei Zhang, Shoubao Yang, Weifeng Sun, Dapeng Wang
{"title":"Markov-Based Analytical Model for TCP Unfairness over Wireless Mesh Networks","authors":"Lei Zhang, Shoubao Yang, Weifeng Sun, Dapeng Wang","doi":"10.1109/IMSCCS.2006.238","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.238","url":null,"abstract":"TCP unfairness is a widely existent problem over wireless mesh networks. The characters of shared wireless medium and location dependency conduce to the phenomenon. A Markov-based analytical model is proposed to analyze the influence factors of this problem in this paper. The unfairness issue over typical IEEE 802.11 based wireless mesh network was analyzed. Markov technique is adopted in analyzing the behavior of MAC layer and TCP transportation. The probabilities of transitions, transition times and transition rewards were analyzed. Finally, the influence factors were found through this model and some advice were proposed to improve TCP fairness. Simulation results prove that the model exactly represents the influence factors on TCP fairness, and it can be the theoretical foundation for researches on TCP fairness over wireless mesh network.","PeriodicalId":427564,"journal":{"name":"International Multi-Symposium of Computer and Computational Sciences","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124814153","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
E-NORS: A Repair Scheme for Energy-Efficient Network Organization in Wireless Sensor Networks E-NORS:一种无线传感器网络中节能网络组织的修复方案
International Multi-Symposium of Computer and Computational Sciences Pub Date : 1900-01-01 DOI: 10.1109/IMSCCS.2008.15
Ming Xia, Yabo Dong, Dongming Lu
{"title":"E-NORS: A Repair Scheme for Energy-Efficient Network Organization in Wireless Sensor Networks","authors":"Ming Xia, Yabo Dong, Dongming Lu","doi":"10.1109/IMSCCS.2008.15","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.15","url":null,"abstract":"The unstable nature of wireless communication makes it hard to maintain a reliable network organization in Wireless Sensor Networks (WSNs). Therefore, network organization repair scheme is highly required for reliability. Because of the high energy efficiency requirement, the network organization repair scheme for WSNs differs from that for traditional networks. However, existing WSN network organization repair schemes are not energy efficient due to persistent listening, and may cause sensor nodes to fail to recover from network organization error situations. This paper proposes E-NORS, Energy-efficient Network Organization Repair Scheme, to overcome the high power consumption problem. E-NORS tries to restore the network organization on a duty cycle for energy conservation. A dynamic duty cycle adjustment mechanism is further presented in E-NORS to boost the repair speed in short time network organization error conditions. Evaluation results show that E-NORS can greatly prolong the lifetime of nodes in repairing the network organization, while maintaining a considerable repair speed.","PeriodicalId":427564,"journal":{"name":"International Multi-Symposium of Computer and Computational Sciences","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123405627","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 Resource Allocation Control for Wireless Ad Hoc Networks 无线自组织网络的资源分配控制
International Multi-Symposium of Computer and Computational Sciences Pub Date : 1900-01-01 DOI: 10.1109/IMSCCS.2007.59
Yi Chen, Hao Liu, Ge Gao, Ruimin Hu
{"title":"A Resource Allocation Control for Wireless Ad Hoc Networks","authors":"Yi Chen, Hao Liu, Ge Gao, Ruimin Hu","doi":"10.1109/IMSCCS.2007.59","DOIUrl":"https://doi.org/10.1109/IMSCCS.2007.59","url":null,"abstract":"Quality of Service (QoS) of ad hoc network has become a very important research issue in the wireless networks. The ability to adjust the allocated bandwidth of ongoing flows is becoming increasingly significant. In this paper, we describe a fuzzy price-based bandwidth controller for traffic provisioning in ad-hoc network. The transmission rate of source is fuzzily adjusted based on the accumulated price acquired from the network. The control scheme leads to smooth response of the buffer occupancy as well as of the transmission rate. Therefore, better utilization in the wireless ad hoc environment can be achieved.","PeriodicalId":427564,"journal":{"name":"International Multi-Symposium of Computer and Computational Sciences","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125230872","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
Design and Implementation of Digital Right Management in a Collaborative Peer-To-Peer Network 协同对等网络中数字版权管理的设计与实现
International Multi-Symposium of Computer and Computational Sciences Pub Date : 1900-01-01 DOI: 10.1109/IMSCCS.2007.10
Hao Shi, Yanchun Zhang, Jingyuan Zhang, E. Beal, N. Moustakas
{"title":"Design and Implementation of Digital Right Management in a Collaborative Peer-To-Peer Network","authors":"Hao Shi, Yanchun Zhang, Jingyuan Zhang, E. Beal, N. Moustakas","doi":"10.1109/IMSCCS.2007.10","DOIUrl":"https://doi.org/10.1109/IMSCCS.2007.10","url":null,"abstract":"","PeriodicalId":427564,"journal":{"name":"International Multi-Symposium of Computer and Computational Sciences","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128549332","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
Towards a Better Solution to the Shortest Common Supersequence Problem: A Post 关于最短公上序问题的一个更好的解:一篇文章
International Multi-Symposium of Computer and Computational Sciences Pub Date : 1900-01-01 DOI: 10.1109/IMSCCS.2006.136
K. Ning, H. Leong
{"title":"Towards a Better Solution to the Shortest Common Supersequence Problem: A Post","authors":"K. Ning, H. Leong","doi":"10.1109/IMSCCS.2006.136","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.136","url":null,"abstract":"","PeriodicalId":427564,"journal":{"name":"International Multi-Symposium of Computer and Computational Sciences","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126437379","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}
引用次数: 4
Improved Contour-Based Object Detection and Segmentation 改进的基于轮廓的目标检测和分割
International Multi-Symposium of Computer and Computational Sciences Pub Date : 1900-01-01 DOI: 10.1109/IMSCCS.2008.48
Kezheng Lin, Xinyuan Li
{"title":"Improved Contour-Based Object Detection and Segmentation","authors":"Kezheng Lin, Xinyuan Li","doi":"10.1109/IMSCCS.2008.48","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.48","url":null,"abstract":"The objective of this work is the detection of object classes. An improved method is used for object detection and segmentation in real-world multiple-object scenes. It has two stages. In the first stage this method develops a novel technique to extract class-discriminative boundary fragments, and then boosting is used to select discriminative boundary fragments (weak detectors) toform a strong \"boundary-fragment-model\" (BFM) detector. A boundary fragment dictionary is built with those entire detectors. In the second stage, after edge detection, length filter is used to improve the match degree. To the end, a new fast cluster algorithm is used to deal with the centroid image. The generative aspect of the model is used to determine an approximate segmentation. In addition, we present an extensive evaluation of our method on a standard dataset and compare its performance to existing methods from the literature. As is shown in the experiment, our method outperforms previously published methods with the overlap part of the object in multiple-object scene.","PeriodicalId":427564,"journal":{"name":"International Multi-Symposium of Computer and Computational Sciences","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115218137","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
Network Traffic Classification Using K-means Clustering 基于k -均值聚类的网络流量分类
International Multi-Symposium of Computer and Computational Sciences Pub Date : 1900-01-01 DOI: 10.1109/IMSCCS.2007.52
Yingqiu Liu, Wei Li, Yunchun Li
{"title":"Network Traffic Classification Using K-means Clustering","authors":"Yingqiu Liu, Wei Li, Yunchun Li","doi":"10.1109/IMSCCS.2007.52","DOIUrl":"https://doi.org/10.1109/IMSCCS.2007.52","url":null,"abstract":"","PeriodicalId":427564,"journal":{"name":"International Multi-Symposium of Computer and Computational Sciences","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131340718","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
下一页 尾页
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学术官方微信