{"title":"A Vision: RDB-Based XML Security Models Considering Data Levels","authors":"Jinhyung Kim, Dongwon Jeong, D. Baik","doi":"10.1109/FGCN.2008.77","DOIUrl":"https://doi.org/10.1109/FGCN.2008.77","url":null,"abstract":"In this paper, we take a rather different approach. We explore how to support security models for XML documents by leveraging on techniques developed for relational databases. More specifically, in our approach, (1) Users make XML queries against the given XML view/schema, (2) Access controls for XML data are specified in the relational database (3) Data are stored in relational databases, and (4) Security check and query evaluation are also done in relational databases.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121380868","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}
{"title":"SS-RBAC: Secure Query Processing Model for Semantic Sensor Networks","authors":"Dongwon Jeong, Hyejin Jeong, Y. Jeong","doi":"10.1109/FGCN.2008.192","DOIUrl":"https://doi.org/10.1109/FGCN.2008.192","url":null,"abstract":"This paper proposes a novel secure query processing model for semantic sensor networks. A semantic sensor network (SSN) is a sensor network which includes semantics of sensory data and context information, and relationships between the semantics. In brief, SSN is an extension of the current sensor network (SN) and realized by using semantic Web (SW) technologies. Although various researches have been activated on SSN, there is little activity on how to access data in semantic sensor networks in safe. This paper proposes a new access control model for secure query processing under semantic sensor networks. The proposed security model is based on RBAC (role-based access control) and enables secure access control of ontology for SSNs.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128385394","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}
{"title":"Extending the UbiMDR Supporting Situation-Aware Access Control","authors":"Jeong-Dong Kim, Dongwon Jeong, D. Baik","doi":"10.1109/FGCN.2008.219","DOIUrl":"https://doi.org/10.1109/FGCN.2008.219","url":null,"abstract":"Ubiquitous computing environment requirement needs information sharing of sensors based on sensor network technology, situation-aware and determination functions and other related technologies ranging to appropriate and effective action processing. The sensor field independent information access is most important issues in everywhere under the ubiquitous computing environment. We already proposed UbiMDR framework that is a supporting application-independent semantic interoperability for ubiquitous applications. However, the functions of the UbiMDR are limited only to identification and recognition of objects. The chief objective of our proposal is to let extending the UbiMDR supporting situation-aware access control about objects consistently and independently on various application fields (companies/ systems). This paper fist describes the current UbiMDR, and presents our proposed model for supporting situation-aware of UbiMDR. Also conceptual architectures of situation aware are shown.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130046333","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}
{"title":"A Detecting Superpoint Algorithm on Multiple Sampling Technology","authors":"Guang Cheng, J. Gong","doi":"10.1109/FGCN.2008.111","DOIUrl":"https://doi.org/10.1109/FGCN.2008.111","url":null,"abstract":"Super points are sources or destinations that connect to a larger number of distinct destinations or sources during a measurement time interval. High-speed monitoring of super points is a challenging problem with application to real-time attack detection using a limited memory space. In this paper, we propose a method for detecting super points, and prove guarantees on their accuracy and memory requirements. Our method is based on sampling and data streaming, and sampling technique can probabilistically assure to sample only large-flow sources or destinations. Data streaming technique sets an IP bitmap and flow bitmap to judge an existed IP. Our method are both theoretically and experimentally more efficient than previous approaches.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"72 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":"122317495","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}
{"title":"A Survey of Routing Protocols for Energy Constrained Ad Hoc Wireless Networks","authors":"Natalia Vesselinova-Vassileva, F. Barceló","doi":"10.1109/FGCN.2007.43","DOIUrl":"https://doi.org/10.1109/FGCN.2007.43","url":null,"abstract":"In this survey we review energy-aware routing protocols for wireless multihop ad hoc networks and critically discuss the main results in this area. The classification presented is in no case unique but summarizes the chief characteristics of the many published proposals for energy conservation. A common pitfall detected in most of the studies is the lack of unambiguous notion of network's lifetime and hence of clear objective of the designed algorithm. We, therefore, define first what operational lifetime for ad hoc networks means and then analyze the achievements from that angle. After getting insight into the different energy-aware routing protocols we point out another approach for extending network's operational lifespan, which has been overlooked in the relevant literature.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"43 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":"115279834","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}
{"title":"Designing Strategies on Frame Structure in the Rate Adaptive Communication","authors":"Jianxi Yang, Y. Wang, Liang Chu","doi":"10.1109/FGCN.2007.102","DOIUrl":"https://doi.org/10.1109/FGCN.2007.102","url":null,"abstract":"Firstly a rate adaptive communication technique is given in the paper. Taking example for HF communication, the designing strategies on frame structure are analyzed in detail from carrier synchronization, bit synchronization and frame synchronization. At last a burst frame structure is presented. The total duration of traffic data is 2 seconds.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"15 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":"122888309","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}
{"title":"Steganalysis of LSB Matching Based on Wavelet Denoising Estimation in Grayscale Image","authors":"Mankun Xu, Tianyun Li, X. Ping","doi":"10.1109/FGCN.2008.57","DOIUrl":"https://doi.org/10.1109/FGCN.2008.57","url":null,"abstract":"We consider the problem of LSB matching detection in grayscale images which is hard and hot in steganalysis. In this paper, we model the matching embedding as a kind of image degradation caused by some certain pulse additive noise, and use the restored image by wavelet denoising as an estimation of the cover image. The detectors we used are the 1D and 2D adjacency histogram characteristic function center of mass introduced in the literature [8]. We extract the features of the image before and after estimation and classify the cover and stego images with support vector machine. Experimental results show that our method is superior to Ker's calibrated estimation method, especially in low false positive probability.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"264 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":"115831543","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}
{"title":"A Practical Dynamic Frequency Scaling Scheduling Algorithm for General Purpose Embedded Operating System","authors":"Tianzhou Chen, Jiangwei Huang, Liangxiang Xiang, Zhenwei Zheng","doi":"10.1109/FGCN.2008.133","DOIUrl":"https://doi.org/10.1109/FGCN.2008.133","url":null,"abstract":"Dynamic frequency scaling (DFS) techniques for real-time embedded systems have been widely studied. However, most of the scheduling algorithms so far concern only special purpose real-time systems. In this paper we devise a power-aware parameter task model for time-sharing real-time systems of general purpose, as well as a scheduling algorithm that is based on the task model. We implement the model and corresponding algorithm on embedded Linux. With the energy consumption measurement method presented in this paper, the experiment shows that for real-time tasks in Linux, 31.7% power consumption can be saved compared with the circumstance under which the processor runs at highest frequency.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"7 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":"115065892","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}
{"title":"A New Weighted Association Rule Suitable for Causes and Effects Analysis","authors":"Zhefu Yu, Huibiao Lu, Chuanying Jia","doi":"10.1109/FGCN.2008.32","DOIUrl":"https://doi.org/10.1109/FGCN.2008.32","url":null,"abstract":"A new weighted association rule algorithm is discussed. It is based on the mining algorithms of minwal(0) and minwal(w). The new algorithm can effectively mine the association rules which define some attributes as antecedent partial, while others as consequent partial. The new algorithm also can effectively mine the association rules with low support and high confidence, and these association rules have greater significant in some application.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"30 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":"122177876","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}
{"title":"Extending the Verification of Multimedia Presentation Consistency to Resource Requirements","authors":"Abdelli Abdelkrim","doi":"10.1109/FGCN.2008.125","DOIUrl":"https://doi.org/10.1109/FGCN.2008.125","url":null,"abstract":"We propose in this paper to extend the consistency verification of multimedia presentations to environment resource constraints. These are characterized by the bandwidth rate and the buffer capacity available at the client side. The verification is performed by using a formal methodology that uses the TSPN model to specify the resource constraints as well as the time and the synchronization requirements of the presentation. A graph is then built from this specification, to check over its consistency. Hence, it becomes possible to manage more efficiently the resource availability, and to adapt the content of the presentation so that it can be performed consistently under a resource-limited environment.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"2014 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":"128027789","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}