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

2010 International Conference on Information Science and Applications最新文献

筛选
英文 中文
Classification of Audio Data Using a Centroid Neural Network 基于质心神经网络的音频数据分类
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480533
Dong-Chul Park
{"title":"Classification of Audio Data Using a Centroid Neural Network","authors":"Dong-Chul Park","doi":"10.1109/ICISA.2010.5480533","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480533","url":null,"abstract":"The automatic classification of audio data is an effective way to organize a large-scale audio data files. In this paper, an automatic content-based audio classification model using Centroid Neural Networks (CNN) with a Divergence Measure is proposed. The Divergence-based Centroid Neural Network (DCNN) algorithm, which employs the divergence measure as its distance measure, is used for clustering of Gaussian Probability Distribution Function (GPDF) data. In comparison with other conventional algorithms, the D-CNN designed for probability data has the robustness advantages of utilizing a audio data representation method in which each audio data is represented by a Gaussian distribution feature vector. Experiments and results show that the proposed classification model very compatible classification accuracy with classical models employing the conventional k-means and CNN algorithms.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128995854","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
Efficient Web Service Composition and Intelligent Search Based on Relational Database 基于关系数据库的高效Web服务组合与智能搜索
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480567
Cheng Zeng, Weijie Ou, Yi Zheng, Dong-il Han
{"title":"Efficient Web Service Composition and Intelligent Search Based on Relational Database","authors":"Cheng Zeng, Weijie Ou, Yi Zheng, Dong-il Han","doi":"10.1109/ICISA.2010.5480567","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480567","url":null,"abstract":"As the applications become more and more complicated, the requirement of Web service composition will be more urgent. In this paper, we put forward a new storage strategy for web services which can be flexibly extended in relational database. We also present a matching algorithm SMA between web services of multiple input/output parameters, which considers the semantic similarity of concepts in parameters based on WordNet. Moreover, a service composition algorithm Fast-EP based on the above storage strategy is presented. Because utilizing the characteristic and using index mechanism in relational database, we obtain highly efficient web service composition. We extract the feature vector of each web service or composite service, and create dynamic linear hash index on these vectors so that the results of each search could be hierarchical classified. QoS and service price are utilized to rank the result set. At last, we develop a Web services search engine WSIS and show through experiment that our approach in this system has better efficiency of service composition and higher recall ratio of service search than traditional approaches.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126849024","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
Extended k-dominant Skyline in High Dimensional Space 高维空间中的扩展k-显性天际线
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480364
Md. Anisuzzaman Siddique, Y. Morimoto
{"title":"Extended k-dominant Skyline in High Dimensional Space","authors":"Md. Anisuzzaman Siddique, Y. Morimoto","doi":"10.1109/ICISA.2010.5480364","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480364","url":null,"abstract":"Skyline queries have recently attracted a lot of attention for its intuitive query formulation. However, it retrieves too many objects, especially for high-dimensional data. To solve this problem, k-dominant skyline queries have been introduced recently, which can reduce the number of retrieved objects by relaxing the definition of dominance. However, sometimes, a k- dominant skyline query retrieves too few objects to analyze. In this paper, we extend the notion of k-domination by defining extended k-dominant skyline, which retrieves neither too many nor too few objects. We then develop a novel algorithm for extended k-dominant skyline computation. Our extensive evaluation results validate the effectiveness and efficiency of the proposed algorithm on both real-life and synthetic datasets.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125098580","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
Image Encryption Design Based on Multi-Dimensional Matrix Map and Partitioning Substitution and Diffusion-Integration Substitution Network Structure 基于多维矩阵映射和分区替代与扩散集成替代网络结构的图像加密设计
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480269
Liang Zhao, D. Xiao, K. Sakurai
{"title":"Image Encryption Design Based on Multi-Dimensional Matrix Map and Partitioning Substitution and Diffusion-Integration Substitution Network Structure","authors":"Liang Zhao, D. Xiao, K. Sakurai","doi":"10.1109/ICISA.2010.5480269","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480269","url":null,"abstract":"Multimedia security is already one of the most crucial problems in information science. Specially, as the character of digital image, the traditional cipher such as DES and RSA are not suitable for being applied to encrypt the digital image. Therefore, the study of image encryption scheme attracts the interest of large researchers. Nowadays, a variety of image encryption methods have been proposed with several kinds of structures. Many of them can finish the encryption process effectively. However, most of them are only based on encryption of two phases: substitution and diffusion, which is a traditional framework. In order to achieve an exceptional encryption effect, this paper presents a novel encryption structure named as PSD-IS network(Partitioning Substitution and Diffusion-Integration Substitution network). Based on this structure, a corresponding encryption algorithm is designed utilizing the generalized multidimensional Arnold cat map and PSD-IS network structure. The experimental results and their analyses demonstrate that the proposed scheme is secure and meets the requirement of image encryption.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130301379","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
Reliable Cooperative MAC Protocol in Ad Hoc Networks under Bad Wireless Channel Environments 恶劣无线信道环境下Ad Hoc网络的可靠协同MAC协议
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480544
Jaeshin Jang, S. Kim
{"title":"Reliable Cooperative MAC Protocol in Ad Hoc Networks under Bad Wireless Channel Environments","authors":"Jaeshin Jang, S. Kim","doi":"10.1109/ICISA.2010.5480544","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480544","url":null,"abstract":"In this paper, a new reliable cooperative MAC protocol, which can enhance the system throughput under bad wireless channel environments, is proposed, and the protocol's performance is evaluated with a computer simulation. The system throughput and average delay, except queuing delay, are used as performance metrics. The numerical results show that the scheme proposed in this paper provides 24 more system throughput than the rDCF scheme. On the other hand, the proposed scheme has a higher system performance in the average delay when the number of terminals is small but provides slightly worse system performance when the number of terminals increases. That is because the system performance is mostly dominated by channel contention when the number of terminals becomes large and because retransmission timers after transmissions of CRTS and DATA frames are set with a greater value than the rDCF scheme.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131990899","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
Software Maintenance Prediction Using Weighted Scenarios: An Architecture Perspective 使用加权场景的软件维护预测:一个体系结构视角
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480420
S. Anwar, M. Ramzan, Abdul Rauf, A. A. Shahid
{"title":"Software Maintenance Prediction Using Weighted Scenarios: An Architecture Perspective","authors":"S. Anwar, M. Ramzan, Abdul Rauf, A. A. Shahid","doi":"10.1109/ICISA.2010.5480420","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480420","url":null,"abstract":"Software maintenance is considered one of the most important issues in software engineering which has some serious implications in term of cost and effort. It consumes enormous amount of organization's overall resources. On the other hand, software architecture of an application has considerable effect on quality factors such as maintainability, performance, reliability and flexibility etc. Using software architecture for quantification of certain quality factor will help organizations to plan resources accordingly. This paper is an attempt to predict software maintenance effort at architecture level. The method takes requirements, domain knowledge and general software engineering knowledge as input in order to prescribe application architecture. Once application architecture is prescribed, then weighted scenarios and certain factors (i.e. system novelty, turnover and maintenance staff ability, documentation quality, testing quality etc) that affect software maintenance are applied to application architecture to quantify maintenance effort. The technique is illustrated and evaluated using web content extraction application architecture.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114235910","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
A Novel Image Retrieval Scheme Using DCT Filter-Bank of Weighted Color Components 一种基于加权颜色分量DCT滤波器组的图像检索方法
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480275
Yong-Ho Kim, Seok-Han Lee, SangKeun Lee, Tae-eun Kim, Jongsoo Choi
{"title":"A Novel Image Retrieval Scheme Using DCT Filter-Bank of Weighted Color Components","authors":"Yong-Ho Kim, Seok-Han Lee, SangKeun Lee, Tae-eun Kim, Jongsoo Choi","doi":"10.1109/ICISA.2010.5480275","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480275","url":null,"abstract":"In this paper, we present a novel approach for improving retrieval accuracy based on DCT (discrete cosine transform) Filter-bank. First, we perform DCT on a given image, and generate a Filter-bank using the DCT coefficients for each color channel. In this step, DC and the limited number of AC coefficients are used. Next, a feature vector is obtained from the histogram of the quantized DC coefficients. Then, AC coefficients in the Filter-bank are separated into three main groups indicating horizontal, vertical, and diagonal edge directions, respectively, according to their spatial-frequency properties. Each directional group creates its histogram after employing Otsu binarization technique. Finally, we project each histogram on the horizontal and vertical axes, and generate a feature vector for each group. The computed DC and AC feature vectors are concatenated, and it is used in the similarity checking procedure. In order to evaluate the proposed scheme, state-of-art approaches including DC-based and DC and AC energy-based retrieval systems are implemented and compared in terms of retrieval accuracy. Experimental results show that the proposed algorithm outperforms the other approaches.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114299433","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
Improved Related-Key Boomerang Cryptanalysis of AES-256 改进的AES-256的相关密钥回旋镖密码分析
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480302
H. Soleimany, Alireza Sharifi, Mohammadreza Aref
{"title":"Improved Related-Key Boomerang Cryptanalysis of AES-256","authors":"H. Soleimany, Alireza Sharifi, Mohammadreza Aref","doi":"10.1109/ICISA.2010.5480302","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480302","url":null,"abstract":"A specific class of differential cryptanalytic approach, known as Related Key Boomerang Attack, has been successfully applied to several symmetric cryptographic primitives in particular encryption schemes such as Advanced Encryption Standard (AES). In this paper, we propose a new related-key boomerang attack on 8-round AES-256, a couple of ones on 9-round following the work of Gorski et al. In the first one, we attacked 8-round AES-256 with the time complexity of $2^{79}$ and the data complexity of $2^{59}$. The extended 8-round attack on 9-round AES-256 is more efficient than previous attacks from both time and data complexity perspectives.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114469994","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}
引用次数: 7
K-Neigh Backbone Tree Based Topology Control for Tactical Mobile Ad-Hoc Networks 基于K-Neigh骨干树的战术移动自组网拓扑控制
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480576
Sung-Won Lee, A. Ranjitkar, Young-Bae Ko
{"title":"K-Neigh Backbone Tree Based Topology Control for Tactical Mobile Ad-Hoc Networks","authors":"Sung-Won Lee, A. Ranjitkar, Young-Bae Ko","doi":"10.1109/ICISA.2010.5480576","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480576","url":null,"abstract":"Topology control and maintenance of network connectivity are two important issues that need to be addressed in wireless networks in tactical scenarios. Topology control is more prominent with multi-interface multi-channel (MIMC) tactical mobile ad hoc networks (MANETs) due to mobility of wireless nodes. The nodes in tactical mobile ad hoc networks within non-uniform transmission range require proper management, preservation and maintenance in terms of network connectivity. In this paper, we propose a K-Neigh Backbone Tree based topology control for MIMC Tactical MANETs that consists of K-Neigh Backbone Tree topology control algorithm, Backbone Tree Association algorithm, and Topology Maintenance algorithm in decentralized management mechanism. The performance and efficiency of the proposed scheme is evaluated with the QualNet simulator.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134415366","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
Load Distribution Algorithm Based on Transcoding Time Estimation for Distributed Transcoding Servers 分布式转码服务器中基于转码时间估计的负载分配算法
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480586
Dongmahn Seo, Jong-Woo Kim, Inbum Jung
{"title":"Load Distribution Algorithm Based on Transcoding Time Estimation for Distributed Transcoding Servers","authors":"Dongmahn Seo, Jong-Woo Kim, Inbum Jung","doi":"10.1109/ICISA.2010.5480586","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480586","url":null,"abstract":"As a result of improvements in wireless communication technologies, a multimedia data streaming service can be provided for mobile clients such as PDAs and cellular phones. Because mobile devices have low computing power and work on a low network bandwidth, a transcoding technology is needed to adapt the original streaming media for mobile environments. To provide quality of service, original encoded media are transcoded within limited time and transmitted to clients without ceasing and jittering phenomena. In particular, when large-scale mobile clients demand streaming services, load distribution methods among distributed transcoding servers have a tremendous impact on the total number of quality of service streams. In this paper, a new load distribution method is proposed based on transcoding time estimation with transcoding servers' information, movie information and target transcoding bit-rate. In experiments, the proposed method produces the best performance scalability according to the increase of transcoding servers.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133100827","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
首页 上一页 下一页 尾页
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学术官方微信