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

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

筛选
英文 中文
Performance Study of Parallel Programming on Cloud Computing Environments Using MapReduce 基于MapReduce的云计算环境下并行编程性能研究
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480515
Wen-Chung Shih, S. Tseng, Chao-Tung Yang
{"title":"Performance Study of Parallel Programming on Cloud Computing Environments Using MapReduce","authors":"Wen-Chung Shih, S. Tseng, Chao-Tung Yang","doi":"10.1109/ICISA.2010.5480515","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480515","url":null,"abstract":"Divisible load applications have such a rich source of parallelism that their parallelization can significantly reduce their total completion time on cloud computing environments. However, it is a challenge for cloud users, probably scientists and engineers, to develop their applications which can exploit the computing power of the cloud. Using MapReduce, novice cloud programmers can easily develop a high performance cloud application. To examine the performance of programs developed by this approach, we apply this pattern to implement three kinds of applications and conduct experiments on our cloud test-bed. Experimental results show that MapReduce programming is suitable for regular workload applications.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"8 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":"122208324","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}
引用次数: 23
A Hybrid Method to Predict Angina Pectoris through Mining Emergency Data 利用突发事件数据挖掘预测心绞痛的混合方法
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480410
Sung-ho Ha, Zhen Zhang, Eun Kyoung Kwon
{"title":"A Hybrid Method to Predict Angina Pectoris through Mining Emergency Data","authors":"Sung-ho Ha, Zhen Zhang, Eun Kyoung Kwon","doi":"10.1109/ICISA.2010.5480410","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480410","url":null,"abstract":"The Emergency Department (ED) has been frustrated by the problems of overcrowding, long waiting times and high costs over decades. With the development of computer techniques, various kinds of information systems have appeared and make people work more effectively, the Emergency Department Information System (EDIS) has been heralded as a \"must\" for the modern ED. This paper tries to build a hybrid method to predict angina pectoris in the form of EDIS. Based on the frameworks of patients flow in ED, real-world data were collected from the electronic medical records at the ED: more than 210000 records of 842 registered chest pain patients in total. By utilizing the data mining techniques, an expert system was proposed to help physicians with faster and more accurate decision making of diagnosis and lab test selections when they are diagnosing with angina pectoris patients.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"13 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":"128034658","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
BitApriori: An Apriori-Based Frequent Itemsets Mining Using Bit Streams BitApriori:基于apriori的使用比特流的频繁项集挖掘
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480373
Thi Thanh Nhan Le, Thi Thanh Thuy Nguyen, Tae-Choong Chung
{"title":"BitApriori: An Apriori-Based Frequent Itemsets Mining Using Bit Streams","authors":"Thi Thanh Nhan Le, Thi Thanh Thuy Nguyen, Tae-Choong Chung","doi":"10.1109/ICISA.2010.5480373","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480373","url":null,"abstract":"Generating, pruning and counting itemset candidates are important steps in Apriori frequent itemset mining. Unfortunately, their computation time are too expensive. In this paper, we propose a new method using Bit Stream to improve their speed. At the begining, the 1-itemsets are found out and sorted according to the decline of count. By that way, a map of all attributes would be created. After that, each attribute will be presented by 1 bit. At last, the generating and pruning itemset candidates are processed by LOGIC operations which are not cost much of computation time. For experiments we compare our method with some Apriori-based state of the arts.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"34 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":"128882432","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
Dynamic Thread Management for Scalable RFID Middleware 可扩展RFID中间件的动态线程管理
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480319
Sungwoo Ahn, W. Ryu, B. Hong, H. Chae, Junho Lee
{"title":"Dynamic Thread Management for Scalable RFID Middleware","authors":"Sungwoo Ahn, W. Ryu, B. Hong, H. Chae, Junho Lee","doi":"10.1109/ICISA.2010.5480319","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480319","url":null,"abstract":"An RFID middleware should filter and collect huge amount of tag's information gathered continuously by many RFID readers as the complexity of RFID environments increase. To do this, the middleware needs to control multiple adaptor threads which connect readers to the middleware and process the requests from readers. However, the use of multiple threads can deteriorate the performance of the middleware due to the overhead for excessive threads management. To build scalable RFID middleware regardless of the number of readers, the adaptor manager should decrease adaptor threads' overhead which can adversely affect middleware's performance. In this paper, we propose three dynamic thread management schemes to solve this problem: Group Merging, Group Splitting, and Adaptor Reallocation. To reduce the overhead of thread management, group merging and group splitting try to maintain the number of threads at an appropriate level. Adaptor reallocation reduces the overhead by exchanging adaptor threads between groups. Our experiments show that the proposed management scheme can improve the scalability of RFID middleware, compared with the single and the multiple thread managements.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"29 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":"126864909","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
Gabor Feature Selection and Improved Radial Basis Function Networks for Facial Expression Recognition 基于Gabor特征选择和改进径向基函数网络的面部表情识别
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480540
Chien-Cheng Lee, Cheng-Yuan Shih
{"title":"Gabor Feature Selection and Improved Radial Basis Function Networks for Facial Expression Recognition","authors":"Chien-Cheng Lee, Cheng-Yuan Shih","doi":"10.1109/ICISA.2010.5480540","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480540","url":null,"abstract":"This paper presents an improved radial basis function neural network with effective Gabor features for recognizing the seven basic facial expressions (anger, disgust, fear, happiness, sadness, surprise and neutral) from static images. The proposed improved RBF networks adopt a sigmoid function as their kernel due to its flexible decision boundary over the conventional Gaussian kernel. This study uses an M-estimator instead of the least-mean square criterion in the network updating procedure to enhance the network robustness. A growing and pruning algorithm adjusts the network size dynamically according to the neuron significance. Additionally, entropy criterion selects informative and non-redundant Gabor features. This feature selection reduces the feature dimension without losing much information and also decreases computation and storage requirements. The proposed improved RBF networks have demonstrated superior performance compared to conventional RBF networks. Experiment results show that our approach can accurately and robustly recognize facial expressions.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"10 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":"126114380","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
Hiding Frequent Patterns in the Updated Database 在更新的数据库中隐藏频繁的模式
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480385
Bi-Ru Dai, Li-hsiang Chiang
{"title":"Hiding Frequent Patterns in the Updated Database","authors":"Bi-Ru Dai, Li-hsiang Chiang","doi":"10.1109/ICISA.2010.5480385","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480385","url":null,"abstract":"Sensitive frequent pattern hiding is an important issue in privacy preserving data mining. In this era of information explosion and rapid development of the Internet, the data stored in the database is usually continuously updated. Existing frequent pattern hiding algorithms gradually become inadequate because those algorithms are originally designed for static database and thus they cannot handle incremental datasets effectively and efficiently. In order to solve this problem, we propose an incremental mechanism and design a data structure in this paper to hide sensitive frequent patterns in the incremental environment. In this mechanism, the transaction data and sensitive patterns are stored in two types of trees. The proposed algorithm can efficiently find related transactions by links between these two types of trees. Experiment results show that the proposed method can efficiently hide sensitive frequent patterns in the incremental environment.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"26 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":"116674799","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}
引用次数: 13
Multi Objective GUI Testing and Coverage Analysis 多目标GUI测试和覆盖率分析
2010 International Conference on Information Science and Applications Pub Date : 1900-01-01 DOI: 10.1109/ICISA.2010.5480409
Abdul Rauf, S. Réhman, M. Jaffer, S. Anwar, A. A. Shahid
{"title":"Multi Objective GUI Testing and Coverage Analysis","authors":"Abdul Rauf, S. Réhman, M. Jaffer, S. Anwar, A. A. Shahid","doi":"10.1109/ICISA.2010.5480409","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480409","url":null,"abstract":"","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"32 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":"121925014","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
首页 上一页
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学术官方微信