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

2009 International Symposium on Intelligent Ubiquitous Computing and Education最新文献

筛选
英文 中文
State of the Art in Cross-Layer Design for Cognitive Radio Wireless Networks 认知无线电无线网络跨层设计的研究进展
2009 International Symposium on Intelligent Ubiquitous Computing and Education Pub Date : 2009-05-15 DOI: 10.1109/IUCE.2009.127
Yan-bing Liu, Qin Zhou
{"title":"State of the Art in Cross-Layer Design for Cognitive Radio Wireless Networks","authors":"Yan-bing Liu, Qin Zhou","doi":"10.1109/IUCE.2009.127","DOIUrl":"https://doi.org/10.1109/IUCE.2009.127","url":null,"abstract":"Cognitive radio is a revolutionary technology, which can significantly improve the utilization of limited radio spectrum resources. The limited ability of conventional layered protocol architectures has motivated the introduction of cross-layer design solutions that allow optimized operation. In this paper, we extensively and exclusively present an overview and discussion of the general methodology for cross-layer design and investigate cross-layer optimization schemes and algorithms between different layers. In addition, we conclude the paper and provide highlight trends in cross-layer design and identify areas for future work.","PeriodicalId":153560,"journal":{"name":"2009 International Symposium on Intelligent Ubiquitous Computing and Education","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117074278","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}
引用次数: 11
A Symplectic Scheme of Gross-Pitaevskii Equation Gross-Pitaevskii方程的辛格式
2009 International Symposium on Intelligent Ubiquitous Computing and Education Pub Date : 2009-05-15 DOI: 10.1109/IUCE.2009.124
YiMin Tian
{"title":"A Symplectic Scheme of Gross-Pitaevskii Equation","authors":"YiMin Tian","doi":"10.1109/IUCE.2009.124","DOIUrl":"https://doi.org/10.1109/IUCE.2009.124","url":null,"abstract":"For a Bose-Einstein Condensate placed in a rotating trap and confined in the z axis, a kind of symplectic difference schemes was constructed, which is second order in time and arbitrary order in space to investigate the evolution of vortices of BEC in this paper. First, we look for a steady state solution of the imaginary time G-P equation. Then, we numerically study the vortices's development in real time, starting with the solution in imaginary time as initial value.","PeriodicalId":153560,"journal":{"name":"2009 International Symposium on Intelligent Ubiquitous Computing and Education","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128624528","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 Multiple Secrets Sharing Scheme with General Access Structure 具有通用访问结构的多秘密共享方案
2009 International Symposium on Intelligent Ubiquitous Computing and Education Pub Date : 2009-05-15 DOI: 10.1109/IUCE.2009.65
Saizhi Ye, Guo-xiang Yao, Quanlong Guan
{"title":"A Multiple Secrets Sharing Scheme with General Access Structure","authors":"Saizhi Ye, Guo-xiang Yao, Quanlong Guan","doi":"10.1109/IUCE.2009.65","DOIUrl":"https://doi.org/10.1109/IUCE.2009.65","url":null,"abstract":"A dynamic and verifiable multiple secrets sharing scheme with general access structure, is proposed in this paper. The scheme only needs to construct  degree Lagrange interpolation polynomial and  secrets can be shared in each sharing process without secure channel. That allows each participant to choose his secret shadow by himself and cheating is verifiable. In addition, it can dynamically change the participant set, the qualified subset and even the number of the shared secrets without refreshing any participant’s secret shadow. Furthermore because the scheme is based on general access structure, it will be more flexible and easier to implement than the threshold one. The security of the proposed scheme is based on the Shamir’s secret sharing scheme and the intractability of the discrete logarithm. In a word, the scheme is secure, efficient and could provide great capabilities for many applications, such as in multi-user work.","PeriodicalId":153560,"journal":{"name":"2009 International Symposium on Intelligent Ubiquitous Computing and Education","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130637616","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
Study on a New Structural Join Algorithm for XML Query 一种新的XML查询结构连接算法研究
2009 International Symposium on Intelligent Ubiquitous Computing and Education Pub Date : 2009-05-15 DOI: 10.1109/IUCE.2009.75
Shaofei Wu, Yuan Huang
{"title":"Study on a New Structural Join Algorithm for XML Query","authors":"Shaofei Wu, Yuan Huang","doi":"10.1109/IUCE.2009.75","DOIUrl":"https://doi.org/10.1109/IUCE.2009.75","url":null,"abstract":"With the problem that the cost is too much for temporary sorting or creating index aimed for there is no index or the index is out-of-order of input data sets in most XML structural join methods, the classical Stack-Tree-Desc algorithm and B+ tree index optimization algorithm are analyzed. A new strategy that isn’t limited to any external index is proposed and implemented. The experiment results indicate that it out performs Stack-Tree-Desc algorithm.","PeriodicalId":153560,"journal":{"name":"2009 International Symposium on Intelligent Ubiquitous Computing and Education","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124176648","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
Prediction of Hydrophobic Core Residues Based on Network Analysis 基于网络分析的疏水核残基预测
2009 International Symposium on Intelligent Ubiquitous Computing and Education Pub Date : 2009-05-15 DOI: 10.1109/IUCE.2009.70
Haiyan Li
{"title":"Prediction of Hydrophobic Core Residues Based on Network Analysis","authors":"Haiyan Li","doi":"10.1109/IUCE.2009.70","DOIUrl":"https://doi.org/10.1109/IUCE.2009.70","url":null,"abstract":"In recent years, Protein folding kinetics studies performed the hydrophobic core residues play a key role not only in stabilizing the native state, but also in driving the folding reaction itself. In this work, the protein structure is modeled as an undirected network with the amino acids the vertexes and the contacts between them the edges. We find that the core residues have mainly high degree and low clustering coefficient compared with the surface residues. The four different centrality measurements have been proposed to predict hydrophobic core residues from four well-characterized proteins. We show that the four network-based centrality measurements (degree, clustering coefficient, closeness centrality, betweenness) accurately detect the hydrophobic core residues and there is strong functional relationship between any two different network-based centrality measurements. Additionally, we plot four network centrality measurements versus the Conseq value, the results show that all hydrophobic core residues have high conseq values and this means that the hydrophobic core residues are conserved in proteins.","PeriodicalId":153560,"journal":{"name":"2009 International Symposium on Intelligent Ubiquitous Computing and Education","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124201285","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 New Web Service Model Based on QoS 一种基于QoS的Web服务模型
2009 International Symposium on Intelligent Ubiquitous Computing and Education Pub Date : 2009-05-15 DOI: 10.1109/IUCE.2009.45
Guoqi Liu, Zhiliang Zhu, Yi-qiang Li, Dan-cheng Li, Jun-chang Cui
{"title":"A New Web Service Model Based on QoS","authors":"Guoqi Liu, Zhiliang Zhu, Yi-qiang Li, Dan-cheng Li, Jun-chang Cui","doi":"10.1109/IUCE.2009.45","DOIUrl":"https://doi.org/10.1109/IUCE.2009.45","url":null,"abstract":"With the development of SOA(Service-Oriented Architecture) and SOC(Service-Oriented Computing), the Quality of Service(QoS) was more and more important than before. How to access, store and measure the QoS in complex network has been a key work for the SOA. An expanded service model supporting QoS is proposed in this paper, and the model supports service publishing, selection based on QoS. In the model, QoS information is collected from different roles like service provider, service user and service monitor, then saved as publish QoS, experience QoS and monitor QoS. QoS measure is based on weighted the different QoS information above. So it takes account of all kinds of aspects that affect the QoS driven service selection. Finally, it describes a real case study of applying this model in a project of IBM SUR program.","PeriodicalId":153560,"journal":{"name":"2009 International Symposium on Intelligent Ubiquitous Computing and Education","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114081786","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}
引用次数: 12
SCQR - A P2P Query Routing Algorithm Based on Semantic Cluster 基于语义聚类的P2P查询路由算法
2009 International Symposium on Intelligent Ubiquitous Computing and Education Pub Date : 2009-05-15 DOI: 10.1109/IUCE.2009.60
Shiyao Jin, Guiming Zhu
{"title":"SCQR - A P2P Query Routing Algorithm Based on Semantic Cluster","authors":"Shiyao Jin, Guiming Zhu","doi":"10.1109/IUCE.2009.60","DOIUrl":"https://doi.org/10.1109/IUCE.2009.60","url":null,"abstract":"The low efficiency and uncertainty routing is correct is a problem for resource location of an unstructured p2p network [1]. It is hard to achieve high query hit with small cost and low latency for such kind of network. In this paper, we present a p2p Query Routing algorithm which is based on Semantic Cluster (SCQR). SCQR makes nodes clustered according to their semantic, and each cluster elects a super-node as cluster computing node which is responsible for computing cluster semantic and establishing links with all neighbor cluster computing nodes. Query is routed among cluster computing nodes. SCQR achieves high query hit with small routing latency and query cost in both analytical theoretical and experimental studies.","PeriodicalId":153560,"journal":{"name":"2009 International Symposium on Intelligent Ubiquitous Computing and Education","volume":"236 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114208803","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
Research of a Class of Multimedia Systems 一类多媒体系统的研究
2009 International Symposium on Intelligent Ubiquitous Computing and Education Pub Date : 2009-05-15 DOI: 10.1109/IUCE.2009.85
Jiemin Zhao
{"title":"Research of a Class of Multimedia Systems","authors":"Jiemin Zhao","doi":"10.1109/IUCE.2009.85","DOIUrl":"https://doi.org/10.1109/IUCE.2009.85","url":null,"abstract":"A result of global asymptotic stability of a class of multimedia systems is given by means of the analysis and computing method.","PeriodicalId":153560,"journal":{"name":"2009 International Symposium on Intelligent Ubiquitous Computing and Education","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125987034","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
Design and Implement of Common Network Security Scanning System 通用网络安全扫描系统的设计与实现
2009 International Symposium on Intelligent Ubiquitous Computing and Education Pub Date : 2009-05-15 DOI: 10.1109/IUCE.2009.24
Wentao Liu
{"title":"Design and Implement of Common Network Security Scanning System","authors":"Wentao Liu","doi":"10.1109/IUCE.2009.24","DOIUrl":"https://doi.org/10.1109/IUCE.2009.24","url":null,"abstract":"This paper discusses the network security scanning and some scanning methods which contain port scanning, vulnerability scanning and remote operating system detection are studied. In order to reduce the complexity and get high performance, the architecture of a common network security scanning system based on Libnet and Libpcap is provided and the every module of system is designed and implemented. The key modules include packet constructing, packet sending, packet capture, packet analyzing module and information log analysis module. The methods of packet injection based on Libnet and the packet capture based on Libpcap are presented and it can improve scanning performance and enhance the scalability and expansibility of system.","PeriodicalId":153560,"journal":{"name":"2009 International Symposium on Intelligent Ubiquitous Computing and Education","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129404167","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}
引用次数: 8
An Improved Clonal Selection Algorithm for Job Shop Scheduling 一种改进的作业车间调度克隆选择算法
2009 International Symposium on Intelligent Ubiquitous Computing and Education Pub Date : 2009-05-15 DOI: 10.1109/IUCE.2009.26
Hong Lu, Jing Yang
{"title":"An Improved Clonal Selection Algorithm for Job Shop Scheduling","authors":"Hong Lu, Jing Yang","doi":"10.1109/IUCE.2009.26","DOIUrl":"https://doi.org/10.1109/IUCE.2009.26","url":null,"abstract":"The job shop scheduling problem (JSSP) is a notoriously difficult problem in combinatorial optimization. Extensive investigation has been devoted to developing efficient algorithms to find optimal or near-optimal solutions. This paper proposes an improved immune clonal selection algorithm, called improved clonal selection algorithm for the JSSP. The new algorithm has the advantage of preventing from prematurity and fast convergence speed. Numerous well-studied benchmark examples in job-shop scheduling problems were utilized to evaluate the proposed approach. The computational results show that the proposed algorithm could obtain the high-quality solutions within reasonable computing times, and the results indicate the effectiveness and flexibility of the immune memory clonal selection algorithm.","PeriodicalId":153560,"journal":{"name":"2009 International Symposium on Intelligent Ubiquitous Computing and Education","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131908914","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}
引用次数: 9
首页 上一页 下一页 尾页
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学术官方微信