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

21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)最新文献

筛选
英文 中文
Reduction in Dimensions and Clustering Using Risk and Return Model 风险与收益模型的降维与聚类
21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07) Pub Date : 2007-05-21 DOI: 10.1109/AINAW.2007.308
S. W. Qaiyumi, D. Stamate
{"title":"Reduction in Dimensions and Clustering Using Risk and Return Model","authors":"S. W. Qaiyumi, D. Stamate","doi":"10.1109/AINAW.2007.308","DOIUrl":"https://doi.org/10.1109/AINAW.2007.308","url":null,"abstract":"We introduce a new approach of reducing dimensions and clustering of a database, inspired from a computational model used to evaluate economical parameters. This computational model is based on two well known methods for the valuation of assets, namely the dividend valuation model (DVM) and the capital asset pricing model (CAPM). The model we introduce is called the Risk and return model (RRM), and the technique of dimensions reduction is based on calculating the highest risk or in other words the lowest return associated with each attribute/column in the database. The attributes with the highest risk or lowest return grades are reduced. We have applied a model similar to DVM to cluster the dimensionally reduced data.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"13 48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130994258","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
Using Social Network Theory Towards Development of Wireless Ad Hoc Network Trust 应用社会网络理论发展无线自组网信任
21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07) Pub Date : 2007-05-21 DOI: 10.1109/AINAW.2007.365
S. Pai, T. Roosta, S. Wicker, S. Sastry
{"title":"Using Social Network Theory Towards Development of Wireless Ad Hoc Network Trust","authors":"S. Pai, T. Roosta, S. Wicker, S. Sastry","doi":"10.1109/AINAW.2007.365","DOIUrl":"https://doi.org/10.1109/AINAW.2007.365","url":null,"abstract":"The evolution and existence of stable trust relations have been studied extensively in the context of social theory. However, reputation systems or trust schemes have only been recently used in the domain of wireless ad hoc net works. It has been shown that these schemes provide positive results as a self-policing mechanism for the routing of data in wireless ad hoc network security. This paper develops a relationship between the trust concepts in the social network theory and wireless ad hoc networks. In addition, the paper maps existing trust schemes in wireless ad hoc networks to a long-standing theory in social networks. Most importantly, a refined model of trust evaluation in social networks is constructed and mapped to a new trust scheme for ad hoc networks. The new trust scheme is analyzed and shown to outperform existing schemes using scenario and simulation analysis.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130216898","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}
引用次数: 18
Efficient Conjunctive Keyword-Searchable Encryption 高效的连接关键字可搜索加密
21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07) Pub Date : 2007-05-21 DOI: 10.1109/AINAW.2007.166
Eun-Kyung Ryu, T. Takagi
{"title":"Efficient Conjunctive Keyword-Searchable Encryption","authors":"Eun-Kyung Ryu, T. Takagi","doi":"10.1109/AINAW.2007.166","DOIUrl":"https://doi.org/10.1109/AINAW.2007.166","url":null,"abstract":"A keyword-searchable encryption scheme allows a user with a \"trapdoor\" for a keyword to efficiently retrieve some of encrypted data containing the specific keyword over a remote server. The scheme for keyword-searchable encryption is considered as one of crucial building blocks that solves the security problems of privacy and data confidentiality in many settings, such as outsourced database systems and mail (or file) servers. However, most existing schemes support only a single keyword for searching, but do not allow for boolean combinations of keywords. It makes the use of schemes impractical in real applications. To address this problem, we propose an efficient construction for conjunctive keyword-searchable encryption, in which the size of trapdoors is almost same as that for searching a single keyword. Our construction is proven secure against adaptive chosen-keyword attacks in the random oracle model under the external co-Diffie-Hellman assumption. Compared to previous works, our construction has much better performance in terms of both computational and communication cost.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125495682","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}
引用次数: 50
Asynchronous CVE Support System by Continuous VR Space Archiver 基于连续VR空间归档器的异步CVE支持系统
21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07) Pub Date : 2007-05-21 DOI: 10.1109/AINAW.2007.102
Hiroki Ogasawara, Y. Shibata
{"title":"Asynchronous CVE Support System by Continuous VR Space Archiver","authors":"Hiroki Ogasawara, Y. Shibata","doi":"10.1109/AINAW.2007.102","DOIUrl":"https://doi.org/10.1109/AINAW.2007.102","url":null,"abstract":"In this paper, we introduce a new idea of revision tree which can provide a flexible mechanism to store the current collaborative virtual environments (CVE) space, replay the past recorded CVE space and replace the current CVE by other past CVE space. The revision tree with hierarchical 3D structure is visualized in space and operated by users to refer the past space information using replay, revert, clone and merge functions. Those functions provide effective and flexible collaborative work in CVE to support communication among many users over computer network. Using this method, the users as group members can progress collaborative work and confirm the past CVE without prior communication even if some of the group members do not participate in the space. Thus, asynchronous collaborative work can be attained and applied to efficiently more creative CVE applications.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123260861","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
Effective Caching in Wireless Sensor Network 无线传感器网络中的有效缓存
21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07) Pub Date : 2007-05-21 DOI: 10.1109/AINAW.2007.161
Md. Ashiqur Rahman, S. Hussain
{"title":"Effective Caching in Wireless Sensor Network","authors":"Md. Ashiqur Rahman, S. Hussain","doi":"10.1109/AINAW.2007.161","DOIUrl":"https://doi.org/10.1109/AINAW.2007.161","url":null,"abstract":"This paper proposes few ways of improving a WSN's energy efficiency that already uses an energy efficient data routing protocol for continuous monitoring application. The proposed improvements are (i) data negotiation, (ii) development of data change expectancy, and (iii) data vanishing. In data negotiation, an active sensor sends its sensed data only when the data changes. In expectancy development, a sensor develops the expectancy of when its sensed data might change. It then adjusts its sensing frequency accordingly to avoid unnecessary sensing. In data vanishing, duplicate sensed data from multiple sensors are discarded while routed to the BS. Together, the proposed improvements can be viewed as an emulated cache where latest sensed data are always known without requiring the sensors to sense and report continuously. Our simulation results also show significant WSN lifetime increase from this emulated caching.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123267624","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}
引用次数: 38
A Spatial Indexing Approach for Protein Structure Modeling 蛋白质结构建模的空间索引方法
21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07) Pub Date : 2007-05-21 DOI: 10.1109/AINAW.2007.58
W. Osborn
{"title":"A Spatial Indexing Approach for Protein Structure Modeling","authors":"W. Osborn","doi":"10.1109/AINAW.2007.58","DOIUrl":"https://doi.org/10.1109/AINAW.2007.58","url":null,"abstract":"This paper explores the use of spatial indices for the modeling and retrieval of protein structures. With two existing spatial indices, a preliminary framework for protein structure modeling that uses a spatial index is proposed. It provides a novel technique for modeling. In addition, it provides additional flexibility with respect to modeling granularity and structure manipulation. It is expected that this modeling approach will lead to new ways of analyzing protein structures.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126543753","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 Identity-Based Key Management Framework for Personal Networks 基于身份的个人网络密钥管理框架
21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07) Pub Date : 2007-05-21 DOI: 10.1109/AINAW.2007.82
K. Masmoudi, H. Afifi
{"title":"An Identity-Based Key Management Framework for Personal Networks","authors":"K. Masmoudi, H. Afifi","doi":"10.1109/AINAW.2007.82","DOIUrl":"https://doi.org/10.1109/AINAW.2007.82","url":null,"abstract":"Personal networks and PN federations are new networking paradigms that merge concepts from ad hoc, P2P and wireless networks, built around user's needs. Even though they are a promise of a practical achievement of ubiquitous computing, managing security associations in these frameworks proves to be a challenge. We present in this paper a security architecture, including a uniform personal namespace using crypto-based identifiers and a key management scheme based on identity-based cryptography. We also provide an evaluation of our scheme, in terms of computation complexity, communication cost and security.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121414606","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
A Robust Error Concealment Algorithm in Wireless Networks 无线网络中的鲁棒错误隐藏算法
21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07) Pub Date : 2007-05-21 DOI: 10.1109/AINAW.2007.47
J. Niu, Congying Wei, Rui He, Jian Ma
{"title":"A Robust Error Concealment Algorithm in Wireless Networks","authors":"J. Niu, Congying Wei, Rui He, Jian Ma","doi":"10.1109/AINAW.2007.47","DOIUrl":"https://doi.org/10.1109/AINAW.2007.47","url":null,"abstract":"Compressed video sequences are very vulnerable to channel disturbances when transmitted through the burst-packet-loss wireless channels. Transmission errors not only corrupt the current frame, but may also propagate to succeeding frames. We find that a number of current proposed post-processing error concealment methods exploit the spatial/temporal redundancy in the video stream can not actually conceal the transmission errors effectively, because they ignored the fact that the neighboring blocks can be easily lost by the burst packet losses and the correlation was considered only in the current frame, which all limited the ability to obtain an optimal recovery. In this paper, a novel error concealment algorithm is proposed for video transmissions in a wireless environment. Simulation proves that the proposed algorithm can be chosen as good trade-off between video quality and computational load in wireless networks.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121503396","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
TMBT: An Efficient Index Allocation Method for Multi-Channel Data Broadcast TMBT:一种有效的多通道数据广播索引分配方法
21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07) Pub Date : 2007-05-21 DOI: 10.1109/AINAW.2007.354
Shuoi Wang, Hsing-Lung Chen
{"title":"TMBT: An Efficient Index Allocation Method for Multi-Channel Data Broadcast","authors":"Shuoi Wang, Hsing-Lung Chen","doi":"10.1109/AINAW.2007.354","DOIUrl":"https://doi.org/10.1109/AINAW.2007.354","url":null,"abstract":"Broadcast is an attractive data dissemination means over multiple wireless channels due to its scalability. Since mobile clients have limited battery power and broadcast data have different popularities, how these data are fast accessed becomes an important issue. Our solution consists of first allocating data among channels near-optimally, and adopting flat broadcast per channel. Then, a binary tree indexing structure is built for each channel and nodes of all index trees are multiplexed onto a well-known physical channel, named as TMBT (time-multiplexed multiple binary trees) Our method organizes data and index into a popularity hierarchy which results in a skewed transmission of data and index. Skewed transmission has been shown to reduce the average access time effectively. Simulation results show that the reduction of access time is on average about 48% over previous work with little tuning time overhead.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114063022","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}
引用次数: 17
Comparative Study of Reactive and Proactive Routing Protocols Performance in Mobile Ad Hoc Networks 移动Ad Hoc网络中被动和主动路由协议性能比较研究
21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07) Pub Date : 2007-05-21 DOI: 10.1109/AINAW.2007.123
C. Mbarushimana, A. Shahrabi
{"title":"Comparative Study of Reactive and Proactive Routing Protocols Performance in Mobile Ad Hoc Networks","authors":"C. Mbarushimana, A. Shahrabi","doi":"10.1109/AINAW.2007.123","DOIUrl":"https://doi.org/10.1109/AINAW.2007.123","url":null,"abstract":"The mobility of nodes in mobile ad hoc networks (MANETs) results in frequent changes of network topology making routing in MANETs a challenging task. Some studies have been reported in the literature to evaluate the performance of the proposed routing algorithms. However, since the publication of experimental standards for some routing protocols by IETF, little activity has been done to contrast the performance of reactive against proactive protocols. This paper evaluates the performance of reactive (AODV, DSR) and proactive (OLSR) routing protocols in MANETs under CBR traffic with different network conditions. Our results, contrarily to previously reported studies conducted on the same routing protocols, show the superiority of proactive over reactive protocols in routing such traffic at the cost of a higher routing load.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115637793","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}
引用次数: 310
首页 上一页 下一页 尾页
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学术官方微信