Big Data possesses profound information of our society, and therefore, it impacts numerous aspects of human society, with a large amount of data from large-scale heterogeneous network environments, we should analyze some special issues of network security monitoring on Big Data environments. This paper propose data cleaning for various types of data sources and analysis Big Data on network security through security event on multiple associations rules. This study provides some ideas for network security monitoring on Big Data environments.
{"title":"Some Special Issues of Network Security Monitoring on Big Data Environments","authors":"Langzhou Liu, Jun Lin","doi":"10.1109/DASC.2013.30","DOIUrl":"https://doi.org/10.1109/DASC.2013.30","url":null,"abstract":"Big Data possesses profound information of our society, and therefore, it impacts numerous aspects of human society, with a large amount of data from large-scale heterogeneous network environments, we should analyze some special issues of network security monitoring on Big Data environments. This paper propose data cleaning for various types of data sources and analysis Big Data on network security through security event on multiple associations rules. This study provides some ideas for network security monitoring on Big Data environments.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122789192","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}
Multi-hop broadcasts are more difficult in duty-cycled wireless sensor networks where each node stays awake only for a fraction of a time interval and neighborhood nodes are not simultaneously awake to receive data. In this paper, we exploit the problem of multi-hop broadcasts in low duty-cycled wireless sensor networks, and propose a delay aware broadcast forwarding protocol called DCEB. DCEB neither assumes time synchronization for sleep scheduling, which requires all neighboring nodes to wake up at the same time, nor assumes duty-cycled awareness, which makes the protocol difficult to use in low duty-cycled operations. The decision conditions of broadcast forwarding time with or without delay constraint are deduced. Experimental results prove that DCEB cuts the energy consumption of a multi-hop broadcast by reducing broadcast costs under the decision conditions.
{"title":"Delay Aware Broadcast Forwarding Protocol for Asynchronous Duty-Cycled WSNs","authors":"Peizhong Shi, Yun Wang","doi":"10.1109/DASC.2013.72","DOIUrl":"https://doi.org/10.1109/DASC.2013.72","url":null,"abstract":"Multi-hop broadcasts are more difficult in duty-cycled wireless sensor networks where each node stays awake only for a fraction of a time interval and neighborhood nodes are not simultaneously awake to receive data. In this paper, we exploit the problem of multi-hop broadcasts in low duty-cycled wireless sensor networks, and propose a delay aware broadcast forwarding protocol called DCEB. DCEB neither assumes time synchronization for sleep scheduling, which requires all neighboring nodes to wake up at the same time, nor assumes duty-cycled awareness, which makes the protocol difficult to use in low duty-cycled operations. The decision conditions of broadcast forwarding time with or without delay constraint are deduced. Experimental results prove that DCEB cuts the energy consumption of a multi-hop broadcast by reducing broadcast costs under the decision conditions.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128999687","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}
Laser range finder is one of the effective and automatic methods for distance measurement, making distance measurement much easier and safer in the places where people can't reach. Laser range finder helps to measure the distance accurately by finding the difference of phase which brings by modulated wave through the distance. Through the analysis of existing laser ranging technologies as well as the comparison of the different technological performance, phase-shift laser ranging method is proposed. This thesis aims to study some key technologies on phase-shift laser ranging for short-distance laser range finding sensor.
{"title":"Research on Key Technology for Phase-Shift Laser Range Finder","authors":"Su Xianbo, Tan Jianjun, Xu Jian, Huan ShaoJun","doi":"10.1109/DASC.2013.68","DOIUrl":"https://doi.org/10.1109/DASC.2013.68","url":null,"abstract":"Laser range finder is one of the effective and automatic methods for distance measurement, making distance measurement much easier and safer in the places where people can't reach. Laser range finder helps to measure the distance accurately by finding the difference of phase which brings by modulated wave through the distance. Through the analysis of existing laser ranging technologies as well as the comparison of the different technological performance, phase-shift laser ranging method is proposed. This thesis aims to study some key technologies on phase-shift laser ranging for short-distance laser range finding sensor.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124112311","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}
Nowadays SIMD extensions became ubiquitous for computational platform, being widely used in signal processing, multimedia, and scientific applications. However, compilers still have difficult in vectorizing some applications, such as computations on non-contiguous and especially interleaved data, and loop nest for which inner loops that carry all the dependencies and external loops with strided memory accesses. In order to solve these problems, we adopt Isomorphic Statements Grouping (ISG) after extending group following UD and DU chains, which group isomorphic computation statements that perform the same operation. And correspondingly, we generate vector permutation instructions according to the target ISA SIMD instructions at the SIMD code generation phase. This approach has been implemented in a compiler based on Open64 which translate C source program to C source program with SIMD intrinsic functions. Experiments with this compiler show that ISG Super Level Parallelism(ISG-SLP) can be used to compile a number of real-world kernels, achieving up to 3.11 speedup.
目前SIMD扩展在计算平台中无处不在，被广泛应用于信号处理、多媒体和科学应用中。然而，编译器在向量化一些应用程序方面仍然存在困难，例如对不连续和特别是交错数据的计算，以及携带所有依赖关系的内部循环和具有跨行内存访问的外部循环的循环巢。为了解决这些问题，我们在扩展了UD链和DU链之后的组后采用ISG (Isomorphic Statements Grouping)，将执行相同操作的同构计算语句分组。相应地，我们在SIMD代码生成阶段根据目标ISA SIMD指令生成向量置换指令。该方法已在基于Open64的编译器中实现，该编译器将C源程序转换为具有SIMD固有函数的C源程序。使用该编译器进行的实验表明，ISG Super Level Parallelism(ISG- slp)可用于编译许多真实的内核，实现高达3.11的加速。
{"title":"A New Algorithm to Exploit Superword Level Parallelism","authors":"Peng Liu, Rongcai Zhao, Wei Gao, Shuai Wei","doi":"10.1109/DASC.2013.118","DOIUrl":"https://doi.org/10.1109/DASC.2013.118","url":null,"abstract":"Nowadays SIMD extensions became ubiquitous for computational platform, being widely used in signal processing, multimedia, and scientific applications. However, compilers still have difficult in vectorizing some applications, such as computations on non-contiguous and especially interleaved data, and loop nest for which inner loops that carry all the dependencies and external loops with strided memory accesses. In order to solve these problems, we adopt Isomorphic Statements Grouping (ISG) after extending group following UD and DU chains, which group isomorphic computation statements that perform the same operation. And correspondingly, we generate vector permutation instructions according to the target ISA SIMD instructions at the SIMD code generation phase. This approach has been implemented in a compiler based on Open64 which translate C source program to C source program with SIMD intrinsic functions. Experiments with this compiler show that ISG Super Level Parallelism(ISG-SLP) can be used to compile a number of real-world kernels, achieving up to 3.11 speedup.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115419392","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}
Xiangfei Li, Xuzhi Wang, W. Wan, Xiaoqiang Zhu, Xiaoqing Yu
Particle systems' greatest advantage is well suited for modeling complex fuzzy phenomena, such as explosions, fountain, tornado and fireworks, etc. in 3D graphics. With the increasing requirements on the number of particles and particle-particle interactions, the computational complexity of simulation in particle systems has increased rapidly. Particle systems are traditionally implemented on a general-purpose CPU, and the computational complexity of particle systems limits the number of particles that can be computed at interactive rates. This paper focuses on real-time simulation of large-scale particle systems. We discuss optional integration algorithms based on CUDA (Compute Unified Device Architecture) for both graphic and scientific simulation. The speed of particle systems has been greatly improved, with parallel-core GPUs working in tandem with multi-core CPUs. In order to provide a scalable and portable API library, the object-oriented programming method is adopted to encapsulate the functions of parallel particle system. Results show that our proposed APIs are user-friendly and the parallel implementations are significantly efficient.
{"title":"Parallel Simulation of Large-Scale Universal Particle Systems Using CUDA","authors":"Xiangfei Li, Xuzhi Wang, W. Wan, Xiaoqiang Zhu, Xiaoqing Yu","doi":"10.1109/DASC.2013.128","DOIUrl":"https://doi.org/10.1109/DASC.2013.128","url":null,"abstract":"Particle systems' greatest advantage is well suited for modeling complex fuzzy phenomena, such as explosions, fountain, tornado and fireworks, etc. in 3D graphics. With the increasing requirements on the number of particles and particle-particle interactions, the computational complexity of simulation in particle systems has increased rapidly. Particle systems are traditionally implemented on a general-purpose CPU, and the computational complexity of particle systems limits the number of particles that can be computed at interactive rates. This paper focuses on real-time simulation of large-scale particle systems. We discuss optional integration algorithms based on CUDA (Compute Unified Device Architecture) for both graphic and scientific simulation. The speed of particle systems has been greatly improved, with parallel-core GPUs working in tandem with multi-core CPUs. In order to provide a scalable and portable API library, the object-oriented programming method is adopted to encapsulate the functions of parallel particle system. Results show that our proposed APIs are user-friendly and the parallel implementations are significantly efficient.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121309288","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}
Now in the field of embedded system, high-speed interconnection based on parallel or serial LVDS technology is becoming increasingly important. Because of this the first RapidIO offerings available in the market were FPGA based, RapidIO interconnection had been identified as significant emerging technologies for FPGAs to support. At the same time, as the FPGAs increase in size, they are being large enough to accommodate both the static RapidIO interface and the reconfigurable logic. So, a consistent I/O interface is provided to support Reconfigurable Partition. This paper presents a new system interconnection architecture based on RapidIO to achieve the FPGA run-time Reconfigurable Partition.
{"title":"A New System Interconnection Architecture Based on RapidIO Using Partial Reconfiguration","authors":"Zhan Xu, Xiao Wu, Yi Wu","doi":"10.1109/DASC.2013.75","DOIUrl":"https://doi.org/10.1109/DASC.2013.75","url":null,"abstract":"Now in the field of embedded system, high-speed interconnection based on parallel or serial LVDS technology is becoming increasingly important. Because of this the first RapidIO offerings available in the market were FPGA based, RapidIO interconnection had been identified as significant emerging technologies for FPGAs to support. At the same time, as the FPGAs increase in size, they are being large enough to accommodate both the static RapidIO interface and the reconfigurable logic. So, a consistent I/O interface is provided to support Reconfigurable Partition. This paper presents a new system interconnection architecture based on RapidIO to achieve the FPGA run-time Reconfigurable Partition.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125764343","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}
Hanzeng Wang, Xiaoxiang Wang, Dongyu Wang, Yulong Wang
A wireless resources allocation method for Device-to-Multi-Device (D2MD) communication under the control of base station is proposed. In the premise of ensuring quality of services (QoS) of all D2MD groups, the method can allocate wireless resources for D2MD groups through three steps: mode selection, spectrum allocation and power control. Simulation results show that the method can select the high-spectrum-efficiency mode which reuses the spectrum of cellular users for most D2MD communications, and does not affect cellular communications, the interference to cellular uplink of proposed suboptimal LCH algorithm which allocates cellular spectrums for D2MD groups to reuse can achieve the same level as the optimal algorithm, in addition, the calculating complexity is lower therefore shortening the response time of the base station.
{"title":"A Wireless Resources Allocation Method for D2MD Communication under IMT-A System","authors":"Hanzeng Wang, Xiaoxiang Wang, Dongyu Wang, Yulong Wang","doi":"10.1109/DASC.2013.121","DOIUrl":"https://doi.org/10.1109/DASC.2013.121","url":null,"abstract":"A wireless resources allocation method for Device-to-Multi-Device (D2MD) communication under the control of base station is proposed. In the premise of ensuring quality of services (QoS) of all D2MD groups, the method can allocate wireless resources for D2MD groups through three steps: mode selection, spectrum allocation and power control. Simulation results show that the method can select the high-spectrum-efficiency mode which reuses the spectrum of cellular users for most D2MD communications, and does not affect cellular communications, the interference to cellular uplink of proposed suboptimal LCH algorithm which allocates cellular spectrums for D2MD groups to reuse can achieve the same level as the optimal algorithm, in addition, the calculating complexity is lower therefore shortening the response time of the base station.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131842539","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}
Zhe Jiang, Yi Luo, Naihu Wu, Chunjiang He, Pingpeng Yuan, Hai Jin
With the rapid development of information technology, the needs of unstructured data storage and processing is growing rapidly, which develops a new requirement for the database storage. Traditional row-oriented relational databases appear to be inadequate for the data query and analysis. In this paper, we propose a novel approach to store the unstructured data in a relational database. By splitting the VALUE property of the unstructured KEY/VALUE data and recreating the two-dimensional data, the original data can be stored in relational databases. The system introduced in this paper is designed to handle this task. In addition, this system rebuilds the SQL as its query language, which makes it compatible with relational databases. In experiments of the query for unstructured data, the outcomes show that the system is good at decomposing the SQL statement submitted by users, and generating the corrected sub-query statements. The results of the experiments show that the performance of this system is good.
{"title":"Managing Large Scale Unstructured Data with RDBMS","authors":"Zhe Jiang, Yi Luo, Naihu Wu, Chunjiang He, Pingpeng Yuan, Hai Jin","doi":"10.1109/DASC.2013.135","DOIUrl":"https://doi.org/10.1109/DASC.2013.135","url":null,"abstract":"With the rapid development of information technology, the needs of unstructured data storage and processing is growing rapidly, which develops a new requirement for the database storage. Traditional row-oriented relational databases appear to be inadequate for the data query and analysis. In this paper, we propose a novel approach to store the unstructured data in a relational database. By splitting the VALUE property of the unstructured KEY/VALUE data and recreating the two-dimensional data, the original data can be stored in relational databases. The system introduced in this paper is designed to handle this task. In addition, this system rebuilds the SQL as its query language, which makes it compatible with relational databases. In experiments of the query for unstructured data, the outcomes show that the system is good at decomposing the SQL statement submitted by users, and generating the corrected sub-query statements. The results of the experiments show that the performance of this system is good.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133490950","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}
Limin Xiao, Chunjie Xu, Jin Qin, Guangjun Qin, Mingfa Zhu, Li Ruan, Zhiyao Wang, Mingquan Li, D. Tan
Recently, big data becomes more and more widespread on the Internet, as various P2P protocols, especially BitTorrent, make great contribution. Accompanied with BitTorrent spreading, however, malicious activities, divulging sensitive data and other security problems arise. Relative researches and analyses indicate that existing means of protecting P2P network are sophisticated but intricate when distributing big data, leading inefficiency of implementation. In this paper, a scheme to distribute big data securely and efficiently on BitTorrent network is proposed, which can be implemented in server, authorizing peers' admittances and actions, hence protecting sensitive data in the network. To achieve this goal, identity verification and cipher system are embedded into BitTorrent protocol, enabling the server to regulate and keep trace of peers' behaviors and sensitive data. The experimental results show the functional effectiveness of this scheme, as well as acceptable overhead on server.
{"title":"Secure Distribution of Big Data Based on BitTorrent","authors":"Limin Xiao, Chunjie Xu, Jin Qin, Guangjun Qin, Mingfa Zhu, Li Ruan, Zhiyao Wang, Mingquan Li, D. Tan","doi":"10.1109/DASC.2013.42","DOIUrl":"https://doi.org/10.1109/DASC.2013.42","url":null,"abstract":"Recently, big data becomes more and more widespread on the Internet, as various P2P protocols, especially BitTorrent, make great contribution. Accompanied with BitTorrent spreading, however, malicious activities, divulging sensitive data and other security problems arise. Relative researches and analyses indicate that existing means of protecting P2P network are sophisticated but intricate when distributing big data, leading inefficiency of implementation. In this paper, a scheme to distribute big data securely and efficiently on BitTorrent network is proposed, which can be implemented in server, authorizing peers' admittances and actions, hence protecting sensitive data in the network. To achieve this goal, identity verification and cipher system are embedded into BitTorrent protocol, enabling the server to regulate and keep trace of peers' behaviors and sensitive data. The experimental results show the functional effectiveness of this scheme, as well as acceptable overhead on server.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129549552","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}
In order to solve the problem of conversions among workflow management system models, and improve the efficiency of the development of workflow management systems. Based on model driven architecture(MDA), the paper gives the workflow model, and utilizes transformation languages to generate source model. In the actual process of software development, the method is conducive to improve the efficiency of development. In this paper, the method can adapt to the diversities of external environment, and improve the workflow management system robustness which has a certain application significance.
{"title":"Workflow Management Systems Meet Model Drive Architecture","authors":"Chao Zhang, Ping Gu, Yan Li","doi":"10.1109/DASC.2013.44","DOIUrl":"https://doi.org/10.1109/DASC.2013.44","url":null,"abstract":"In order to solve the problem of conversions among workflow management system models, and improve the efficiency of the development of workflow management systems. Based on model driven architecture(MDA), the paper gives the workflow model, and utilizes transformation languages to generate source model. In the actual process of software development, the method is conducive to improve the efficiency of development. In this paper, the method can adapt to the diversities of external environment, and improve the workflow management system robustness which has a certain application significance.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115377656","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：