Pub Date : 2018-10-01DOI: 10.1109/CYBERC.2018.00090
Shanhong Zhu, Hai Qin, Bo Liu, Jun Yang
A Coarse-Grained Reconfigurable Architecture called RASP2.0 is proposed in this paper for communication baseband signal processing. Based on the pipeline bubbles theory, the reconfigurable data path is divided into the data flow between processing elements and the data interaction between reconfigurable arrays and memory structure. To reduce the data transmission delay, the data flow features are summarized based on the locality and lifetime of data. By employing a parallel memory structure combined with the DLT-based data updating strategy, the access performance is improved by 33% on average compared with RASP1.0. As a result, the reconfigurable system presents more performance advantages and flexibility than other similar platforms.
{"title":"Design and Optimization of Reconfigurable Data Path for Communication Baseband Signal Processing","authors":"Shanhong Zhu, Hai Qin, Bo Liu, Jun Yang","doi":"10.1109/CYBERC.2018.00090","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00090","url":null,"abstract":"A Coarse-Grained Reconfigurable Architecture called RASP2.0 is proposed in this paper for communication baseband signal processing. Based on the pipeline bubbles theory, the reconfigurable data path is divided into the data flow between processing elements and the data interaction between reconfigurable arrays and memory structure. To reduce the data transmission delay, the data flow features are summarized based on the locality and lifetime of data. By employing a parallel memory structure combined with the DLT-based data updating strategy, the access performance is improved by 33% on average compared with RASP1.0. As a result, the reconfigurable system presents more performance advantages and flexibility than other similar platforms.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132263085","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}
Pub Date : 2018-10-01DOI: 10.1109/CYBERC.2018.00018
L. Qi, Tie Yun, Chengwu Liang, Zizhe Wang
The single sample per person(SSPP) face recognition is one of the most essential problems of face recognition. Moreover, the testing samples are typically corrupted by nuisance variables such as expression, illumination and glasses. To address this problem, plenty of methods have been proposed to surmount the adverse effect of variances to testing samples in complex surroundings, but they are not robust. Therefor we proposed the Single sample per person face recognition based on sparse representation with extended generic set (SRGES). First, a set of general sample set were introduced, and the variation information of generic face samples set was extracted and extended to the single training sample set. Then, reconstruction error of testing sample is generated on training samples set by sparse representation model. Finally, the recognition is achieved depending on this sparse reconstruction error. The experimental results on the AR database, Extended Yale B database, CAS-PEAL database and LFW database displayed that the proposed algorithm is robust to variation feature for SSPP face recognition, and outperforms the state-of-art methods.
{"title":"Single Sample Per Person Face Recognition Based on Sparse Representation with Extended Generic Set","authors":"L. Qi, Tie Yun, Chengwu Liang, Zizhe Wang","doi":"10.1109/CYBERC.2018.00018","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00018","url":null,"abstract":"The single sample per person(SSPP) face recognition is one of the most essential problems of face recognition. Moreover, the testing samples are typically corrupted by nuisance variables such as expression, illumination and glasses. To address this problem, plenty of methods have been proposed to surmount the adverse effect of variances to testing samples in complex surroundings, but they are not robust. Therefor we proposed the Single sample per person face recognition based on sparse representation with extended generic set (SRGES). First, a set of general sample set were introduced, and the variation information of generic face samples set was extracted and extended to the single training sample set. Then, reconstruction error of testing sample is generated on training samples set by sparse representation model. Finally, the recognition is achieved depending on this sparse reconstruction error. The experimental results on the AR database, Extended Yale B database, CAS-PEAL database and LFW database displayed that the proposed algorithm is robust to variation feature for SSPP face recognition, and outperforms the state-of-art methods.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132610271","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}
Pub Date : 2018-10-01DOI: 10.1109/CYBERC.2018.00088
Yuewei Jia, D. Qi, Yan Shi, Jianghua Li, Zhuyun Chen, Xiaokai Zhang
In this letter, we investigate the loading analysis of digital channelized satellite communication (SATCOM) system operating in frequency-division multiple access (FDMA) mode, multi-frequency time-division multiple access (MF-TDMA) mode and overlay combined multiple access (OCMA) mode. In an effort to enhance link stability of these systems, a max-min optimization objective for link-margin degree (LMD) is firstly established under the constraint that all loading links are supportable. Basing on fully using the power of transmitting terminals and directly reducing the difference among all LMDs to enhance the minimum LMD as much as possible, an effective maximum value back-off searching (MVBS) algorithm is proposed for the optimization model. Finally, numerical simulations reveal that, under the constraint of link supportability, the proposed algorithm brings about considerable improvement of the minimum LMD for enhancing link stability, which effectively demonstrates the correctness of our scheme.
{"title":"Loading Analysis of Channelized SATCOM System with Link-Margin Degree Optimization","authors":"Yuewei Jia, D. Qi, Yan Shi, Jianghua Li, Zhuyun Chen, Xiaokai Zhang","doi":"10.1109/CYBERC.2018.00088","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00088","url":null,"abstract":"In this letter, we investigate the loading analysis of digital channelized satellite communication (SATCOM) system operating in frequency-division multiple access (FDMA) mode, multi-frequency time-division multiple access (MF-TDMA) mode and overlay combined multiple access (OCMA) mode. In an effort to enhance link stability of these systems, a max-min optimization objective for link-margin degree (LMD) is firstly established under the constraint that all loading links are supportable. Basing on fully using the power of transmitting terminals and directly reducing the difference among all LMDs to enhance the minimum LMD as much as possible, an effective maximum value back-off searching (MVBS) algorithm is proposed for the optimization model. Finally, numerical simulations reveal that, under the constraint of link supportability, the proposed algorithm brings about considerable improvement of the minimum LMD for enhancing link stability, which effectively demonstrates the correctness of our scheme.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129092905","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 multi-sensor systems, data fusion is one of the key technologies for solving information diversification in wireless sensor networks. Data fusion is a process of information processing to automatically analyze and synthesize data collected by multiple sensors under certain rules to complete the required decisions or tasks, including information fusion, feature fusion, relationship fusion and decision fusion. It extends the lifespan of wireless sensor networks and improves data accuracy. It is generally considered that data fusion is an integrated process of information processing. It is generally considered that data fusion is a process of information synthesis and processing, making various information and data detected, correlated, estimated, and synthesized at multiple levels and from many aspects to obtain accurate and complete information. There are many methods for sensor data fusion, such as Bayesian method, D-S method, neural network, fuzzy reasoning, genetic algorithm, deep learning, etc. This article focuses on the application, analysis and comparison of probabilistic statistical methods in multi-sensor data fusion. The data fusion methods of probability statistics are divided into three categories: data fusion method based on estimation theory, data fusion method based on regression theory, and data fusion method based on information theory. This article just has a simple analysis on the three types from the perspective of theory and has a detailed analysis on the core Bayesian fusion in probability statistics.
{"title":"Research on Probability Statistics Method for Multi-sensor Data Fusion","authors":"Maoli Ran, Xiangyu Bai, Fangshuo Xin, Yaping Xiang","doi":"10.1109/CYBERC.2018.00079","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00079","url":null,"abstract":"In multi-sensor systems, data fusion is one of the key technologies for solving information diversification in wireless sensor networks. Data fusion is a process of information processing to automatically analyze and synthesize data collected by multiple sensors under certain rules to complete the required decisions or tasks, including information fusion, feature fusion, relationship fusion and decision fusion. It extends the lifespan of wireless sensor networks and improves data accuracy. It is generally considered that data fusion is an integrated process of information processing. It is generally considered that data fusion is a process of information synthesis and processing, making various information and data detected, correlated, estimated, and synthesized at multiple levels and from many aspects to obtain accurate and complete information. There are many methods for sensor data fusion, such as Bayesian method, D-S method, neural network, fuzzy reasoning, genetic algorithm, deep learning, etc. This article focuses on the application, analysis and comparison of probabilistic statistical methods in multi-sensor data fusion. The data fusion methods of probability statistics are divided into three categories: data fusion method based on estimation theory, data fusion method based on regression theory, and data fusion method based on information theory. This article just has a simple analysis on the three types from the perspective of theory and has a detailed analysis on the core Bayesian fusion in probability statistics.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121287226","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}
Pub Date : 2018-10-01DOI: 10.1109/CYBERC.2018.00032
Nadia Imtiaz Jaya, Md. Farhad Hossain
Amazon Web Services have recently developed their IoT platform, AWS IoT Core, which integrates all the necessary functions required for developing an IoT system. Our objective in this paper is to explore some of those functions and their integration in our designed project. In light of this, we develop and present a prototype air flow control system for home automation using AWS IoT Core and MQTT protocol over Websocket server. The advantages obtained in the choice of modules, communication protocols and services are explained in depth. System architecture, its implementation and performance analysis are also presented.
{"title":"A Prototype Air Flow Control System for Home Automation Using MQTT Over Websocket in AWS IoT Core","authors":"Nadia Imtiaz Jaya, Md. Farhad Hossain","doi":"10.1109/CYBERC.2018.00032","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00032","url":null,"abstract":"Amazon Web Services have recently developed their IoT platform, AWS IoT Core, which integrates all the necessary functions required for developing an IoT system. Our objective in this paper is to explore some of those functions and their integration in our designed project. In light of this, we develop and present a prototype air flow control system for home automation using AWS IoT Core and MQTT protocol over Websocket server. The advantages obtained in the choice of modules, communication protocols and services are explained in depth. System architecture, its implementation and performance analysis are also presented.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133353260","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}
Pub Date : 2018-10-01DOI: 10.1109/CYBERC.2018.00051
Tian-ping Chen, Tie Yun, L. Qi
Despite recent advances, including hierarchical and sound clustering techniques, perceptual audio rendering technique remains a high challenge for complex virtual scenes with thousands of sound sources due to its high computation cost. In the paper, we first present a spatial-frequency measurement based approach to generate recursive cluster for multiple sound source. This method can handle more than two times the number of sources on consumer 3D audio hardware, with minimal decrease in audio quality. The perceptual pilot was then studied which indicates its necessity to increase the number of different clusters of visible sound source. We present a sound categories based cost metric using this indication. The proposed method preforms well for rendering thousands of sound sources on a workstation.
{"title":"Progressive Perceptual Audio Rendering for Large Multi-source Scenes","authors":"Tian-ping Chen, Tie Yun, L. Qi","doi":"10.1109/CYBERC.2018.00051","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00051","url":null,"abstract":"Despite recent advances, including hierarchical and sound clustering techniques, perceptual audio rendering technique remains a high challenge for complex virtual scenes with thousands of sound sources due to its high computation cost. In the paper, we first present a spatial-frequency measurement based approach to generate recursive cluster for multiple sound source. This method can handle more than two times the number of sources on consumer 3D audio hardware, with minimal decrease in audio quality. The perceptual pilot was then studied which indicates its necessity to increase the number of different clusters of visible sound source. We present a sound categories based cost metric using this indication. The proposed method preforms well for rendering thousands of sound sources on a workstation.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123884181","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}
Pub Date : 2018-10-01DOI: 10.1109/CYBERC.2018.00072
Z. Shao, Pu Wu, Enqiang Zhu, Lanxiang Chen
The concept of metric dimension was proposed to model robot navigation where the places of navigating agents can change among nodes. The metric dimension md(G) of a graph G is the smallest number k for which G contains a vertex set W such that |W| = k and every pair of vertices of G possess different distances to at least one vertex in W. In this paper, we demonstrate that md(HDN1(n)) = 4 for n ≥ 2, this indicates that in this type of hex derived sensor networks, the least number of nodes needed is 4 for locating any other node in such a sensor network.
{"title":"Metric Dimension and Robot Navigation in Specific Sensor Networks","authors":"Z. Shao, Pu Wu, Enqiang Zhu, Lanxiang Chen","doi":"10.1109/CYBERC.2018.00072","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00072","url":null,"abstract":"The concept of metric dimension was proposed to model robot navigation where the places of navigating agents can change among nodes. The metric dimension md(G) of a graph G is the smallest number k for which G contains a vertex set W such that |W| = k and every pair of vertices of G possess different distances to at least one vertex in W. In this paper, we demonstrate that md(HDN1(n)) = 4 for n ≥ 2, this indicates that in this type of hex derived sensor networks, the least number of nodes needed is 4 for locating any other node in such a sensor network.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125410770","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}
Pub Date : 2018-10-01DOI: 10.1109/CYBERC.2018.00076
Weijie Dong, Ke-yan Liu, Lijuan Hu
With the gradual development of high proportion renewable energy access to distribution network and smart grid, the coupling of physical and information processes in distribution networks are becoming more and more closely coupled. It is a typical Cyber Physical System (CPS). The sequential characteristics of distribution network and the time discrete characteristics of communication systems make the research of distribution network CPS more complex. This paper aims at the dynamic process of distribution network CPS. On the basis of CPS's perception of the environment, explain the applicability and make an analysis from the aspect of CPS integration modelling and large scale simulation of distribution network.
{"title":"CPS Event Driving Method Based on Micro PMU of Distribution Network","authors":"Weijie Dong, Ke-yan Liu, Lijuan Hu","doi":"10.1109/CYBERC.2018.00076","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00076","url":null,"abstract":"With the gradual development of high proportion renewable energy access to distribution network and smart grid, the coupling of physical and information processes in distribution networks are becoming more and more closely coupled. It is a typical Cyber Physical System (CPS). The sequential characteristics of distribution network and the time discrete characteristics of communication systems make the research of distribution network CPS more complex. This paper aims at the dynamic process of distribution network CPS. On the basis of CPS's perception of the environment, explain the applicability and make an analysis from the aspect of CPS integration modelling and large scale simulation of distribution network.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"32 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116693633","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}
Pub Date : 2018-10-01DOI: 10.1109/CYBERC.2018.00074
Hui Huang, Chunlong Li, Fang Liu, H. Lu, Luming Li
In this paper, a joint optimization scheme of data gathering and charging is proposed to achieve the energy balance for wireless rechargeable sensing networks (WRSNs) consisted of one static base sink, one mobile charger sink and many sensor nodes. In this scheme, the urgent degree of charging is designed by considering the residual life time of nodes and the number of neighbor nodes to help determine anchor points in charging plan. In addition, a metric of forwarding cost value is proposed to construct the network topology targeting at the least cost routing path by considering the energy state, distance between nodes and child nodes number. Moreover the performance of WRSNs is analyzed in terms of average energy and energy stand deviation of each node. Simulation results show that WRSNs can achieve good performance by employing the proposed joint optimization scheme.
{"title":"Mobile Data Gathering and Charging in Wireless Rechargeable Sensor Networks","authors":"Hui Huang, Chunlong Li, Fang Liu, H. Lu, Luming Li","doi":"10.1109/CYBERC.2018.00074","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00074","url":null,"abstract":"In this paper, a joint optimization scheme of data gathering and charging is proposed to achieve the energy balance for wireless rechargeable sensing networks (WRSNs) consisted of one static base sink, one mobile charger sink and many sensor nodes. In this scheme, the urgent degree of charging is designed by considering the residual life time of nodes and the number of neighbor nodes to help determine anchor points in charging plan. In addition, a metric of forwarding cost value is proposed to construct the network topology targeting at the least cost routing path by considering the energy state, distance between nodes and child nodes number. Moreover the performance of WRSNs is analyzed in terms of average energy and energy stand deviation of each node. Simulation results show that WRSNs can achieve good performance by employing the proposed joint optimization scheme.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121568273","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
扫码关注我们
求助内容：
应助结果提醒方式：