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

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

筛选
英文 中文
Design and Implementation of Scenario-Based Collaborative Framework: XCREAM 基于场景的协同框架的设计与实现:XCREAM
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480304
Kyungeun Park, Jekuk Yun, Yanggon Kim, Juno Chang
{"title":"Design and Implementation of Scenario-Based Collaborative Framework: XCREAM","authors":"Kyungeun Park, Jekuk Yun, Yanggon Kim, Juno Chang","doi":"10.1109/ICISA.2010.5480304","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480304","url":null,"abstract":"The XCREAM (XLogic Collaborative RFID/USN-Enabled Adaptive Middleware), as a mediator between smart physical objects and collaborative cyber services, gathers massive events from a variety of event origins and distributes them to the appropriate service parties depending on the predefined business scenarios. Demand for collaboration among numerous business applications draws attention to this kind of middleware platform especially in the highly networked environment. The XCREAM platform, the scenario-based collaborative framework, integrates various kinds of RFID/USN enabled application services and provides more advanced services than the individual services. The goal of this research is to construct well-organized systematic RFID/USN prototyping framework, to which physical RFID readers or sensor devices are directly connected. Additionally, tag data and sensor signals from the devices are propagated to the proper services registered to the framework. The study encourages us to develop the XCREAM platform and build prototyping environment for presenting further comprehensive services. This approach makes it possible to integrate many heterogeneous services and to present collaborative service framework.","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":"124768753","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
Study on Prevention of the Leaking of Industrial Secret Based on LDAP 基于LDAP的防止工业秘密泄露的研究
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480303
Do Hyeong Kim
{"title":"Study on Prevention of the Leaking of Industrial Secret Based on LDAP","authors":"Do Hyeong Kim","doi":"10.1109/ICISA.2010.5480303","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480303","url":null,"abstract":"This study researched into the method that allows only the certified user and computational engineer to possibly use network resources and computing resources by implementing the system of the intensified certification and security based on LDAP(Lightweight Directory Access Protocol) directory service, that copes with incapacitation in security program due to making the security program forcibly installed, and that can correctly track down the industrial-secret exporter along with applying the user-based security policy through inter-working with the existing method for the protection of industrial secret. Through this study, the intensified method for the protection of industrial secret can be embodied by implementing the integrated infra system through strengthening the existing system of managing the protection of industrial secret, and through supplementing vulnerability to the method for the protection of industrial secret.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"16 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":"128468938","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
Semantic Remote Attestation for Security Policy 安全策略的语义远程认证
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480265
Qian Zhang, Yeping He, Ce Meng
{"title":"Semantic Remote Attestation for Security Policy","authors":"Qian Zhang, Yeping He, Ce Meng","doi":"10.1109/ICISA.2010.5480265","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480265","url":null,"abstract":"In the software environment with security policy enforced, the behavior of application depends on not only its binary code, but also the enforcing security policy. Therefore, remote attestation for security policy is as important as that for binary code. However, since the specialties of security policy, which include more mutable and mixture of semantics, it is not suitable to use integrity measurement as the evidence to verify trustworthy of security policy. In this paper, we propose a novel semantic approach to remote attest security policy. This approach utilizes policy analysis technique to extract semantics from security policy, and utilizes logical programming to query required semantics from the mixture of semantics in security policy. We design and implement this approach on SELinux policy in this paper and discuss the security of this implementation on the basis of verified trust of TCB.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"428 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":"131885727","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
Robust Hybrid Foreground Detection and Adaptive Background Model 鲁棒混合前景检测与自适应背景模型
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480276
Wessam Elhefnawy, G. Selim, S. Ghoniemy
{"title":"Robust Hybrid Foreground Detection and Adaptive Background Model","authors":"Wessam Elhefnawy, G. Selim, S. Ghoniemy","doi":"10.1109/ICISA.2010.5480276","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480276","url":null,"abstract":"Identifying moving objects in video sequence is fundamental and important task in visual tracking systems and computer vision applications. Background removal algorithms are usually used to separate the foreground from the background. Despite the existence of many background removal algorithms, they didn't solve some problems such as cast shadows, highlighting and ghost effect. In this paper we propose, a robust foreground detection and background maintenance algorithm based on hybrid background removal methods in well known color space (RGB) combined with motion information. Numerous experiments were performed with different scenes showing that our system is robust to various types of background scenarios. We compared our system with different background removal algorithms and a promising performance was achieved, especially in the efficiency in detection with respect to frame rate performance.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"4 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":"129197914","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
The Deployment Algorithm Based on Cutting a Triangle for Wireless Sensor Networks 基于三角切割的无线传感器网络部署算法
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480579
L. Shiu, Chao-Yang Lee, Chu-Sing Yang
{"title":"The Deployment Algorithm Based on Cutting a Triangle for Wireless Sensor Networks","authors":"L. Shiu, Chao-Yang Lee, Chu-Sing Yang","doi":"10.1109/ICISA.2010.5480579","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480579","url":null,"abstract":"In a large monitored area, the static sensors are deployed by random. It is obvious there are coverage holes and a coverage hole can be polygonal. Because a polygon can be decomposed into a piece of triangles, triangles are considered, and the three nodes of triangles are the static sensors deployed randomly. This paper presents an efficiently deployment algorithm which is based on the coverage hole is a triangle. The triangle is cut into small triangles which contains at least one interior angles is equal to 60°. These small triangles with 60° angle can be guaranteed full coverage, and the rest area of the triangle is still a triangle. Continue the cutting until the triangle is small enough that the sensors on the three nodes can fully cover the area. As a result, the coverage hole of triangle can be full coverage. Beside, the x-y coordinates of each deployed sensor can be deduced.","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":"125418202","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 Modified Delay Strategy for Dynamic Load Balancing in Cluster and Grid Environment 一种改进的集群与网格环境下动态负载均衡延迟策略
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480583
H. Mehta, M. Chandwani, P. Kanungo
{"title":"A Modified Delay Strategy for Dynamic Load Balancing in Cluster and Grid Environment","authors":"H. Mehta, M. Chandwani, P. Kanungo","doi":"10.1109/ICISA.2010.5480583","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480583","url":null,"abstract":"This paper considers a specific Cluster and Grid computing environment, where the workstations are under full load situation. In such situations, we delay the scheduling of new jobs instead of dispatching them to one of the overloaded workstations. We present a modified delay strategy mDELAY, to significantly enhance delay-based scheduling algorithm proposed by Hui & Chanson and named as DELAY. The proposed mDELAY algorithm produces better batch completion time and improved load balancing at workstations. The experiments are performed on a centralized scheduler. However to improve the performance a decentralized scheduling framework based on web service or Grid service is also proposed.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"315 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":"116634244","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
Identifying Rootkit Infections Using Data Mining 使用数据挖掘识别Rootkit感染
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480359
Desmond Lobo, P. Watters, Xin-Wen Wu
{"title":"Identifying Rootkit Infections Using Data Mining","authors":"Desmond Lobo, P. Watters, Xin-Wen Wu","doi":"10.1109/ICISA.2010.5480359","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480359","url":null,"abstract":"Rootkits refer to software that is used to hide the presence and activity of malware and permit an attacker to take control of a computer system. In our previous work, we focused strictly on identifying rootkits that use inline function hooking techniques to remain hidden. In this paper, we extend our previous work by including rootkits that use other types of hooking techniques, such as those that hook the IATs (Import Address Tables) and SSDTs (System Service Descriptor Tables). Unlike other malware identification techniques, our approach involved conducting dynamic analyses of various rootkits and then determining the family of each rootkit based on the hooks that had been created on the system. We demonstrated the effectiveness of this approach by first using the CLOPE (Clustering with sLOPE) algorithm to cluster a sample of rootkits into several families; next, the ID3 (Iterative Dichotomiser 3) algorithm was utilized to generate a decision tree for identifying the rootkit that had infected a machine.","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":"121587988","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
A Time Series Data Prediction Scheme Using Bilinear Recurrent Neural Network 基于双线性递归神经网络的时间序列数据预测方案
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480383
Dong-Chul Park
{"title":"A Time Series Data Prediction Scheme Using Bilinear Recurrent Neural Network","authors":"Dong-Chul Park","doi":"10.1109/ICISA.2010.5480383","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480383","url":null,"abstract":"A time series prediction method based on a BiLinear Recurrent Neural Network (BLRNN) is proposed in this paper. The proposed predictor is based on the BLRNN that has been proven to have robust abilities in modeling and predicting time series. The learning process is further improved by using a multiresolution-based learning algorithm for training the BLRNN so as to make it more robust for the prediction of time series data. The proposed multiresolution-based BLRNN predictor is applied to the long-term prediction of time series data sets. Experiments and results on the Mackey-Glass Series data and Sunspot Series data show that the proposed prediction scheme outperforms both the traditional MultiLayer Perceptron Type Neural Network (MLPNN) and the BLRNN in terms of the normalized mean square error (NMSE).","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"4175 4 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":"127571057","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}
引用次数: 30
A Reproducible Performance Evaluation Method for Forged Fingerprint Detection Algorithm 伪造指纹检测算法的可重复性能评价方法
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480344
YongNyuo Shin, Myung-Geun Chun, Woochang Shin
{"title":"A Reproducible Performance Evaluation Method for Forged Fingerprint Detection Algorithm","authors":"YongNyuo Shin, Myung-Geun Chun, Woochang Shin","doi":"10.1109/ICISA.2010.5480344","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480344","url":null,"abstract":"As biometric technologies such as fingerprint recognition technology become more widespread, the danger posed by security attacks using forged fingerprints is increasing. To counter this threat, diverse technologies are being developed to detect fingerprint forgery. However, thus far there has no method of evaluating the performance of forged fingerprint detection algorithms that has been confirmed to be reliable by achieving reproducible performance test results. This paper proposes a method for objective performance evaluation of forged fingerprint technology. Unlike previous methods of evaluating the performance of forged fingerprint detection algorithms, the proposed performance evaluation method can reproduce evaluation results, and can be used for technology evaluation. To eliminate the ambiguity of the method and express it in a formal manner, the Evaluation Model of Forged Fingerprint Detection (EMFFD) has been developed. In addition, various metrics have been defined to measure the performance evaluation of forged fingerprints.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"25 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":"133480595","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
Improved Opposition-Based PSO for Feedforward Neural Network Training 前馈神经网络训练改进的基于对立的粒子群算法
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480380
M. Rashid, A. R. Baig
{"title":"Improved Opposition-Based PSO for Feedforward Neural Network Training","authors":"M. Rashid, A. R. Baig","doi":"10.1109/ICISA.2010.5480380","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480380","url":null,"abstract":"In this study we present an improved opposition- based PSO and apply it to feedforward neural network training. The improved opposition-based PSO utilizes opposition-based initialization, opposition-based generation jumping and opposition-based velocity calculation. The opposition-based PSO is first tested on some unimodal and multimodal problems and its performance is compared with standard PSO. We then test the performance of the improved opposition-based PSO for training feedforward neural network and also present a comparison with standard PSO.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"65 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":"134518803","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}
引用次数: 22
首页 上一页 下一页 尾页
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学术官方微信