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

IEEE Conference Anthology最新文献

筛选
英文 中文
A performance improvement of OLSR for wireless mesh networks 无线网状网络中OLSR的性能改进
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784728
Jia Liu, Ting-lei Huang
{"title":"A performance improvement of OLSR for wireless mesh networks","authors":"Jia Liu, Ting-lei Huang","doi":"10.1109/ANTHOLOGY.2013.6784728","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784728","url":null,"abstract":"Based on studying the characteristics of topology and business model of wireless mesh networks, depth analysis of the suitable routing protocol type for WMN was given out which shows that proactive hop-by-hop routing is most suitable for WMN. On the basis of Optimized Link State Routing which is a typical proactive hop-by-hop routing protocol. A routing protocol P-OLSR of perceptive 1inks is proposed based on OLSR routing protocol. The protocol detects and analyzes the node load, and link delivery ratio, and link availability, and collects the quality evaluation of path links among the nodes on the network to achieve the selection of routing enhance the throughput of the network, and improve the load balance. The simulation results show that P-OLSR can improve the packet delivery rate of wireless Mesh networks and reduce the average end-to-end delay.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"9 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":"127984815","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
Generating capacity analysis of 0–3 piezoelectric composite cantilever piezoelectric-vibrator 0-3压电复合悬臂式压电振子发电能力分析
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784790
He Xuewen, Huang Guoping, Cheng Long, Huang Wenqian
{"title":"Generating capacity analysis of 0–3 piezoelectric composite cantilever piezoelectric-vibrator","authors":"He Xuewen, Huang Guoping, Cheng Long, Huang Wenqian","doi":"10.1109/ANTHOLOGY.2013.6784790","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784790","url":null,"abstract":"The piezoelectric vibrator constituted by 0–3 piezoelectric composite and medal cantilever transform the vibration energy into the electrical power to supply the power energy to the wireless sensor nodes. In this paper, the generating capacity analysis of the piezoelectric vibrator has been done by the way of combining the computer simulation and experiment research. The results show that the generating capacity is concerned with the structure size. The generating capacity is proportion to the length, inverse proportion to the width and thickness and there exist the best length specific value and thickness specific value (0.65). The double piezoelectric vibrator with the size of 60×20×0.6(mm) (free length 53) can generate 6.588V electric power. The generating capacity of piezoelectric vibrator can be the best when it works at its nature frequency. The mass bonded on the free end can reduce the nature frequency effectively.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","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":"130256243","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
Top-down mining of top-k frequent closed patterns from microarray datasets 微阵列数据集top-k频繁闭合模式的自顶向下挖掘
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784864
HaiPing Huang, YuQing Miao, JianJun Shi
{"title":"Top-down mining of top-k frequent closed patterns from microarray datasets","authors":"HaiPing Huang, YuQing Miao, JianJun Shi","doi":"10.1109/ANTHOLOGY.2013.6784864","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784864","url":null,"abstract":"Mining frequent closed patterns from microarray datasets has attracted more attention. However, most previous studies needed users to specify a minimum support threshold. In practice, it is not easy for users to set an appropriate minimum support threshold and discover the interesting patterns from huge frequent closed patterns. In this paper, we proposed an alternative mining task that mines top-k frequent closed patterns of length no less than min_l from microarray datasets, where k is the desired number of frequent closed patterns to be mined. An efficient algorithm TBtop is developed adopting top-down breadth-first search strategy. Our performance study showed that the strategy was effective in pruning search space. And in most cases, the algorithm TBtop outperformed the algorithm CARPENTER.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"20 2 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":"134078947","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 new hybrid algorithm for optimization based on Artificial Bee Colony and Extremal Optimization 一种新的基于人工蜂群和极限优化的混合优化算法
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784720
Vahid Azadehgan, Nafiseh Jafarian, Farshad Jafarieh
{"title":"A new hybrid algorithm for optimization based on Artificial Bee Colony and Extremal Optimization","authors":"Vahid Azadehgan, Nafiseh Jafarian, Farshad Jafarieh","doi":"10.1109/ANTHOLOGY.2013.6784720","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784720","url":null,"abstract":"Artificial Bee Colony (ABC) Algorithm is an optimization algorithm based on the intelligent behavior of honey bee swarm. ABC has gained increasing attention in tackling optimization problems. Its further superiority when hybridized with other techniques is also shown. In this paper a novel hybrid artificial bee colony is proposed in order to solve optimization problems more efficiently, accurately and reliably. During the course of evolvement Extremal Optimization is used to improve the search performance and this makes proposed algorithms have more powerful exploitation capabilities. Simulation and comparisons based on several well-studied benchmarks demonstrate the effectiveness, efficiency and robustness of the proposed algorithms","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"110 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":"134246417","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-oriented model for identity provisioning and its application 用于身份提供及其应用的面向资源的模型
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784895
Lianzhong Liu, Xuanyu Liu, Xiaomei Tang
{"title":"A resource-oriented model for identity provisioning and its application","authors":"Lianzhong Liu, Xuanyu Liu, Xiaomei Tang","doi":"10.1109/ANTHOLOGY.2013.6784895","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784895","url":null,"abstract":"Existing identity provisioning models are generally user-oriented or service provider-oriented, which can hardly meet the requirements of integration for heterogeneous resources of enterprise. This paper presents a unified identity provisioning model for accessing of heterogeneous resources: providing resource identity, offering provisioning operation of unified identity through identity mapping, and also providing SPML-based identity provisioning interface. Unified identity shields differences of identity information among resources in heterogeneous environment, which makes users get the ability to access resources with one unified identity.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"44 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":"133884893","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
Deployment issues for robust time synchronization in WSN WSN中鲁棒时间同步的部署问题
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784935
Jin Cui, Hao Wang, Shining Li, Zhigang Li
{"title":"Deployment issues for robust time synchronization in WSN","authors":"Jin Cui, Hao Wang, Shining Li, Zhigang Li","doi":"10.1109/ANTHOLOGY.2013.6784935","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784935","url":null,"abstract":"The practical applications of wireless sensor networks require robust time synchronization. In this paper we describe the Flooding Time Synchronization Protocol (FTSP) that provides time synchronization service in such networks. We found there are Key nodes and Non-key nodes when using FTSP in the case of temperature interference. This protocol was designed to utilize low communication bandwidth, scale well for medium sized multi-hop networks, and be robust against temperature interference when temperature impact on the Non-key nodes. The data from a controlled experiment shows the average network-wide synchronization error under temperature interference to be in the microsecond ranges. This paper proposes the deployment issues against temperature interference in WSN for robust time synchronization.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"14 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":"130826622","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
Open-refreshing verifiable secret sharing scheme in asynchronous system 异步系统中的开放刷新可验证秘密共享方案
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784974
Lin Nie, Xing-lan Zhang
{"title":"Open-refreshing verifiable secret sharing scheme in asynchronous system","authors":"Lin Nie, Xing-lan Zhang","doi":"10.1109/ANTHOLOGY.2013.6784974","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784974","url":null,"abstract":"Verifiable secret-sharing scheme is a basic primitive in cryptography, it has found numerous application to secure multi-party computation and threshold cryptosystems. However, the threshold may be corrupted in a longer operating period, refreshing shares are the main methods used to deal with this problem. Many proposed schemes have less efficient in computation and communication, and are affected also by the communication model. In this paper, a new verifiable secret sharing is proposed via a public refreshing phrase. Contract to the other proposed schemes, it achieves both forward and backward security, and it has high computational efficiency and can be applied to asynchronous communication model.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"7 6 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":"130846268","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 fuzzy brsowing patterns from web log 从网络日志中挖掘模糊浏览模式
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784964
Zhuang Xiong, Huijun Liu
{"title":"Mining fuzzy brsowing patterns from web log","authors":"Zhuang Xiong, Huijun Liu","doi":"10.1109/ANTHOLOGY.2013.6784964","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784964","url":null,"abstract":"Web applications have made a significant impact on computer system.Among them mining useful information from web logs is is important and challenging research topics. In this paper, the time durations of the paged browsed. are computed from web logs. Since the time durations are numeric, fuzzy concepts are used here to process them and to form linguistic terms. Besides different pages in web sites may have different interest to users, and some factors (i.e. the design of web pages) may affect users' browsing interest. So interest measures of web pages are evaluated by managers according to the judgment factors, and comprehensive fuzzy evaluation methods are used to evaluate the interest measure of each page. Then a new fuzzy web-mining algorithm is proposed, which can process to mine fuzzy browsing interest patterns with linguistic variables from web logs effectively. An example is given to clearly illustrate the proposed approach.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"63 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":"130933312","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
Group decision support system based on web services for emergency redeployment of relief supplies 基于网络服务的群体决策支持系统，用于紧急重新部署救济物资
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6785036
Xuan-hua Xu, Jinxin Liu
{"title":"Group decision support system based on web services for emergency redeployment of relief supplies","authors":"Xuan-hua Xu, Jinxin Liu","doi":"10.1109/ANTHOLOGY.2013.6785036","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6785036","url":null,"abstract":"Emergency resource deployment decision-making is a multi-stage dynamic process of interaction with complexity, uncertainty, dynamic and timeliness characteristics. Emergency resources deployment of disaster involved in many departments, with complexity of the associated factors, in fact, they have constituted a complex large group. For the allocation of resources in such a state of emergency, this paper proposes a new architecture Group Decision Support System (GDSS) for the deployment of resources, to reflect the solving tasks and decision-making model, coordinate interests of all parties, resolute conflict between the expert groups and achieve the purpose of generating a resource deployment scheme quickly and efficiently, which will provide strong decision support for the deployment of emergency resources operations.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"4 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":"132430448","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
Elementary algebra proof exercies using a theorem proving system 初等代数证明练习使用定理证明系统
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784786
Bing Li, Wei-Hsin Su, Yi Yang, Lian Li
{"title":"Elementary algebra proof exercies using a theorem proving system","authors":"Bing Li, Wei-Hsin Su, Yi Yang, Lian Li","doi":"10.1109/ANTHOLOGY.2013.6784786","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784786","url":null,"abstract":"This paper presents the architecture of a system for automatically assessing the answers of elementary algebra proving problems. The system parses the answer given by the student, which is written in Chinese, and constructs its corresponding formal proof in a theorem proving system. Then the correctness of the formal proof, which is the semantic of the original answer, can be verified in the theorem proving system automatically.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"14 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":"128859355","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信