首页 > 最新文献

2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)最新文献

英文 中文
Multi-Step Traffic Flow Prediction Using Recurrent Neural Network 基于递归神经网络的多步交通流预测
Di Yang, Huamin Yang, Peng Wang, Songjiang Li
Multi-step traffic flow prediction extends short-term single-step prediction to long-term prediction, which is more significant in many basic application in intelligent transportation systems, such as traffic planning. A main problem of multi-step prediction is that the error accumulation as steps increase, resulting in prediction performance degradation. In this work, combining recursive and multi-output strategies, we proposed a deep learning model, named MARNN, for multi-step traffic flow prediction. Specifically, we jointly consider recurrent neural network as dynamic neural network for simulating the dynamic characteristics in traffic time series as recursive strategy does and multi-output strategy for decreasing the accumulated error as step increases. In addition, we introduce attention mechanism for adaptively seeking correlated important information among traffic time series to improve prediction performance. The experiments on real traffic data show the advantages of MARNN model over other four baseline models, demonstrating the potential and promising capability of the proposed model on multi-step traffic flow prediction.
多步交通流预测将短期单步预测扩展到长期预测,在交通规划等智能交通系统的许多基础应用中具有更为重要的意义。多步预测的一个主要问题是误差随着步长增加而累积,导致预测性能下降。在这项工作中,我们结合递归和多输出策略,提出了一种深度学习模型,称为MARNN,用于多步交通流预测。具体来说,我们将递归神经网络作为模拟交通时间序列动态特性的动态神经网络,将递归神经网络作为模拟交通时间序列动态特性的动态神经网络,将多输出神经网络作为减少累积误差的多输出策略。此外,引入注意机制,自适应地在交通时间序列中寻找相关的重要信息,以提高预测性能。在实际交通数据上的实验表明,MARNN模型相对于其他四种基线模型具有一定的优势,证明了该模型在多步交通流预测方面的潜力和前景。
{"title":"Multi-Step Traffic Flow Prediction Using Recurrent Neural Network","authors":"Di Yang, Huamin Yang, Peng Wang, Songjiang Li","doi":"10.1109/IUCC/DSCI/SmartCNS.2019.00163","DOIUrl":"https://doi.org/10.1109/IUCC/DSCI/SmartCNS.2019.00163","url":null,"abstract":"Multi-step traffic flow prediction extends short-term single-step prediction to long-term prediction, which is more significant in many basic application in intelligent transportation systems, such as traffic planning. A main problem of multi-step prediction is that the error accumulation as steps increase, resulting in prediction performance degradation. In this work, combining recursive and multi-output strategies, we proposed a deep learning model, named MARNN, for multi-step traffic flow prediction. Specifically, we jointly consider recurrent neural network as dynamic neural network for simulating the dynamic characteristics in traffic time series as recursive strategy does and multi-output strategy for decreasing the accumulated error as step increases. In addition, we introduce attention mechanism for adaptively seeking correlated important information among traffic time series to improve prediction performance. The experiments on real traffic data show the advantages of MARNN model over other four baseline models, demonstrating the potential and promising capability of the proposed model on multi-step traffic flow prediction.","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131828360","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
VANET Channel Allocation Scheme Based on Hungarian Algorithm 基于匈牙利算法的VANET信道分配方案
Tengyuan Liu, Ruifang Li
With the development of vehicle network services and related software, the dedicated short-range communication (DSRC) frequency band is not sufficient to carry the increased wireless service demand in the in-vehicle network. The large television spectrum (i.e., the TV white space spectrum) issued by the US Federal Communications Commission for cognitive access will be used to provide additional bandwidth to the in-vehicle network, and the effective channel allocation scheme for TV White Space (TVWS) has become our goal. In this paper, we design a channel allocation scheme based on the Hungarian algorithm. Our main goal is to increase network throughput while minimizing network latency. We present simulation schemes and numerical evaluations to illustrate the desired performance of the proposed channel allocation scheme.
随着车联网业务和相关软件的发展,专用的短距离通信(DSRC)频段已不足以承载车载网络日益增长的无线业务需求。美国联邦通信委员会为认知接入而发布的大电视频谱(即电视空白频段)将为车载网络提供额外的带宽,有效的电视空白频段(TVWS)信道分配方案成为我们的目标。本文设计了一种基于匈牙利算法的信道分配方案。我们的主要目标是提高网络吞吐量,同时最小化网络延迟。我们提出了模拟方案和数值评估来说明所提出的信道分配方案的理想性能。
{"title":"VANET Channel Allocation Scheme Based on Hungarian Algorithm","authors":"Tengyuan Liu, Ruifang Li","doi":"10.1109/IUCC/DSCI/SmartCNS.2019.00148","DOIUrl":"https://doi.org/10.1109/IUCC/DSCI/SmartCNS.2019.00148","url":null,"abstract":"With the development of vehicle network services and related software, the dedicated short-range communication (DSRC) frequency band is not sufficient to carry the increased wireless service demand in the in-vehicle network. The large television spectrum (i.e., the TV white space spectrum) issued by the US Federal Communications Commission for cognitive access will be used to provide additional bandwidth to the in-vehicle network, and the effective channel allocation scheme for TV White Space (TVWS) has become our goal. In this paper, we design a channel allocation scheme based on the Hungarian algorithm. Our main goal is to increase network throughput while minimizing network latency. We present simulation schemes and numerical evaluations to illustrate the desired performance of the proposed channel allocation scheme.","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"71 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130784402","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
Message from the EMCA 2019 Workshop Chairs 2019年EMCA研讨会主席致辞
{"title":"Message from the EMCA 2019 Workshop Chairs","authors":"","doi":"10.1109/iucc/dsci/smartcns.2019.00015","DOIUrl":"https://doi.org/10.1109/iucc/dsci/smartcns.2019.00015","url":null,"abstract":"","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133031925","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
Meta-Learning Techniques to Analyze the Raman Data for Optical Diagnosis of Oral Cancer Detection 元学习技术分析口腔癌光学诊断的拉曼数据
Mukta Sharma, Lokesh Sharma, M. Jeng, Liann-Be Chang, Shiang-Fu Huang, Shih-Lin Wu
Recently, Machine Learning methods have shown great improvement while analyzing the biomedical data. Raman Spectroscopy (RS), a non-invasive technique, and widely used in screening to diagnose the oral cancer. In order to spot cancer in a smarter and faster way, we have employed Meta-Learning (ML) techniques to learn such as Bagging and Boosting on RS data. Further, we employed normal and tumor tissue class classification by Linear Discriminant Analysis (LDA), Quadratic Discriminant Analysis (QDA) and Adaptive Boosting (AdaBoost) classifiers. The present study aims at examining the RS data with total 110 samples, including 57 tumor and 53 normal ones. To evaluate the performance, we have used the training samples to optimize, and testing samples to generalize the model parameters. The results show that the AdaBoost classifier with Bagging techniques showed the significant changes in accuracy.
近年来,机器学习方法在分析生物医学数据方面有了很大的进步。拉曼光谱技术作为一种非侵入性技术,在口腔癌的筛查诊断中得到了广泛的应用。为了更智能、更快速地发现癌症,我们采用了元学习(ML)技术对RS数据进行Bagging和Boosting等学习。此外,我们采用线性判别分析(LDA)、二次判别分析(QDA)和自适应增强(AdaBoost)分类器对正常组织和肿瘤组织进行分类。本研究的目的是检查110个样本的RS数据,其中肿瘤57例,正常53例。为了评估性能,我们使用训练样本进行优化,使用测试样本对模型参数进行泛化。结果表明,采用Bagging技术的AdaBoost分类器在准确率上有显著的变化。
{"title":"Meta-Learning Techniques to Analyze the Raman Data for Optical Diagnosis of Oral Cancer Detection","authors":"Mukta Sharma, Lokesh Sharma, M. Jeng, Liann-Be Chang, Shiang-Fu Huang, Shih-Lin Wu","doi":"10.1109/IUCC/DSCI/SmartCNS.2019.00134","DOIUrl":"https://doi.org/10.1109/IUCC/DSCI/SmartCNS.2019.00134","url":null,"abstract":"Recently, Machine Learning methods have shown great improvement while analyzing the biomedical data. Raman Spectroscopy (RS), a non-invasive technique, and widely used in screening to diagnose the oral cancer. In order to spot cancer in a smarter and faster way, we have employed Meta-Learning (ML) techniques to learn such as Bagging and Boosting on RS data. Further, we employed normal and tumor tissue class classification by Linear Discriminant Analysis (LDA), Quadratic Discriminant Analysis (QDA) and Adaptive Boosting (AdaBoost) classifiers. The present study aims at examining the RS data with total 110 samples, including 57 tumor and 53 normal ones. To evaluate the performance, we have used the training samples to optimize, and testing samples to generalize the model parameters. The results show that the AdaBoost classifier with Bagging techniques showed the significant changes in accuracy.","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115738565","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}
引用次数: 2
An Improved DV-Hop Localization Algorithm Based on Error Vector Modification for Wireless Sensor Network 基于误差矢量修正的改进无线传感器网络DV-Hop定位算法
Haixiao Li, Dong Yu
Node Localization in Wireless Sensor Network (WSN) is the process of localizing the unknown node in use of anchor nodes' coordinates which are known in advance or can be got by GPS. As one of typical range-free localization algorithms, Distance Vector Hop (DV-Hop) algorithm is low-cost and doesn't require for additional hardware for ranging. However, the localization accuracy of DV-Hop algorithm is low because as parameters in localization algorithm the distances between the unknown node and anchor nodes are estimated by multiplying number of hops and average hop distance. The error in estimated distance leads to error accumulation in localization result. Therefore DV-Hop algorithm is usually applied under circumstances with low requirement for localization accuracy. In view of the main reason of the error in DV-Hop algorithm, an improved algorithm i.e. DV-Hop algorithm based on Error Vector Modification (EVM-DV-Hop) is proposed in this paper. The improved algorithm reduces the localization error by modifying the estimated coordinate of the unknown node with the help of Error Vector determined by anchor nodes with a certain degree of similarity to the unknown node. It is shown in simulation results that the improved algorithm reduces the localization error and raise the localization accuracy of DV-Hop algorithm effectively.
无线传感器网络(WSN)中的节点定位是利用事先已知的锚节点坐标或GPS可以获得的锚节点坐标对未知节点进行定位的过程。距离矢量跳(Distance Vector Hop, DV-Hop)算法是一种典型的无距离定位算法,其成本低,不需要额外的硬件进行测距。然而,DV-Hop算法的定位精度较低,因为作为定位算法的参数,未知节点与锚节点之间的距离是通过跳数与平均跳距离相乘来估计的。估计距离误差导致定位结果误差累积。因此,通常在对定位精度要求不高的情况下使用DV-Hop算法。针对DV-Hop算法存在误差的主要原因,本文提出了一种改进算法,即基于误差向量修正的DV-Hop算法(EVM-DV-Hop)。改进算法通过与未知节点具有一定相似度的锚节点确定的误差向量来修改未知节点的估计坐标,从而减小了定位误差。仿真结果表明,改进算法有效地减小了DV-Hop算法的定位误差,提高了定位精度。
{"title":"An Improved DV-Hop Localization Algorithm Based on Error Vector Modification for Wireless Sensor Network","authors":"Haixiao Li, Dong Yu","doi":"10.1109/IUCC/DSCI/SmartCNS.2019.00109","DOIUrl":"https://doi.org/10.1109/IUCC/DSCI/SmartCNS.2019.00109","url":null,"abstract":"Node Localization in Wireless Sensor Network (WSN) is the process of localizing the unknown node in use of anchor nodes' coordinates which are known in advance or can be got by GPS. As one of typical range-free localization algorithms, Distance Vector Hop (DV-Hop) algorithm is low-cost and doesn't require for additional hardware for ranging. However, the localization accuracy of DV-Hop algorithm is low because as parameters in localization algorithm the distances between the unknown node and anchor nodes are estimated by multiplying number of hops and average hop distance. The error in estimated distance leads to error accumulation in localization result. Therefore DV-Hop algorithm is usually applied under circumstances with low requirement for localization accuracy. In view of the main reason of the error in DV-Hop algorithm, an improved algorithm i.e. DV-Hop algorithm based on Error Vector Modification (EVM-DV-Hop) is proposed in this paper. The improved algorithm reduces the localization error by modifying the estimated coordinate of the unknown node with the help of Error Vector determined by anchor nodes with a certain degree of similarity to the unknown node. It is shown in simulation results that the improved algorithm reduces the localization error and raise the localization accuracy of DV-Hop algorithm effectively.","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117214571","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
An Improved Algorithm Based on Convolutional Neural Network for Smoke Detection 基于卷积神经网络的烟雾检测改进算法
H. Yin, Yurong Wei
As an essential method of fire prevention and disaster control, smoke detection is of great significance to production and life. At present, the convolutional neural network (CNN) has achieved good results in the research of smoke detection. However, the detection accuracy is not high for some scenes. For example, the wind speed is tremendous, and the shape of the smoke changes rapidly. In order to deal with this problem better, this paper proposes an improved algorithm based on cascading classification and deep convolutional neural network. In the cascading classification part, we improve the cascading structure and make it select the appropriate parameter threshold for the smoke generated in different scenes. The convolutional neural network structure is trained to extract the variation characteristics of smoke better. Also, we optimize the parameters on the target data set. The experimental results show that the algorithm has achieved excellent results in accuracy and speed on the selected smoke detection data sets.
烟雾探测作为一种必不可少的防火防灾手段,对生产和生活都具有重要意义。目前,卷积神经网络(CNN)在烟雾检测的研究中已经取得了很好的效果。然而,对于某些场景,检测精度并不高。例如,风速很大,烟的形状变化很快。为了更好地处理这一问题,本文提出了一种基于级联分类和深度卷积神经网络的改进算法。在级联分类部分,我们改进了级联结构,使其针对不同场景产生的烟雾选择合适的参数阈值。训练卷积神经网络结构,更好地提取烟雾的变化特征。同时,我们对目标数据集的参数进行了优化。实验结果表明,在选定的烟雾探测数据集上,该算法在精度和速度上都取得了很好的效果。
{"title":"An Improved Algorithm Based on Convolutional Neural Network for Smoke Detection","authors":"H. Yin, Yurong Wei","doi":"10.1109/IUCC/DSCI/SmartCNS.2019.00063","DOIUrl":"https://doi.org/10.1109/IUCC/DSCI/SmartCNS.2019.00063","url":null,"abstract":"As an essential method of fire prevention and disaster control, smoke detection is of great significance to production and life. At present, the convolutional neural network (CNN) has achieved good results in the research of smoke detection. However, the detection accuracy is not high for some scenes. For example, the wind speed is tremendous, and the shape of the smoke changes rapidly. In order to deal with this problem better, this paper proposes an improved algorithm based on cascading classification and deep convolutional neural network. In the cascading classification part, we improve the cascading structure and make it select the appropriate parameter threshold for the smoke generated in different scenes. The convolutional neural network structure is trained to extract the variation characteristics of smoke better. Also, we optimize the parameters on the target data set. The experimental results show that the algorithm has achieved excellent results in accuracy and speed on the selected smoke detection data sets.","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"445 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125768585","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}
引用次数: 2
Title Page III 第三页
{"title":"Title Page III","authors":"","doi":"10.1109/iucc/dsci/smartcns.2019.00002","DOIUrl":"https://doi.org/10.1109/iucc/dsci/smartcns.2019.00002","url":null,"abstract":"","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125829933","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
Sharing and Compatibility Studies of Eess(Passive) and IMT System in 24.25-27.5 GHz 24.25-27.5 GHz频段Eess与IMT系统的共享与兼容性研究
Yao Zhou, Yiying Niu, Yi Feng
5G is the research and development focus of global communication technology, and is an important engine for promoting the development of the national economy and improving the level of information. As the basic strategic resource of wireless communication, spectrum is crucial to the development of 5G industry. In order to better develop the IMT-2020 system, the WRC-15 Conference resolved to identify WRC-19 1.13 issues: deliberating to identify frequency bands for future development of International Mobile Telecommunications (IMT), including the possibility of making additional divisions for mobile services as the main business. This paper is based on the WRC-19 1.13 issue, the 24.75-27.5 GHz band as its key frequency band, which is the main research content of this paper. It mainly deals with the study of adjacent frequency interference of IMT-2020 system to the Earth exploration satellite service (EESS) (passive) in 24.75-27.5 GHz frequency band.
5G是全球通信技术的研发重点,是推动国民经济发展、提高信息化水平的重要引擎。频谱作为无线通信的基础战略资源,对5G产业的发展至关重要。为了更好地发展IMT-2020系统,WRC-15会议决定确定WRC-19 1.13议题:审议确定国际移动通信(IMT)未来发展的频段,包括将移动业务作为主业增设部门的可能性。本文基于WRC-19 1.13版本,将24.75-27.5 GHz频段作为其关键频段,这是本文的主要研究内容。主要研究了IMT-2020系统在24.75 ~ 27.5 GHz频段对地球探测卫星业务(EESS)(无源)的邻频干扰。
{"title":"Sharing and Compatibility Studies of Eess(Passive) and IMT System in 24.25-27.5 GHz","authors":"Yao Zhou, Yiying Niu, Yi Feng","doi":"10.1109/IUCC/DSCI/SmartCNS.2019.00156","DOIUrl":"https://doi.org/10.1109/IUCC/DSCI/SmartCNS.2019.00156","url":null,"abstract":"5G is the research and development focus of global communication technology, and is an important engine for promoting the development of the national economy and improving the level of information. As the basic strategic resource of wireless communication, spectrum is crucial to the development of 5G industry. In order to better develop the IMT-2020 system, the WRC-15 Conference resolved to identify WRC-19 1.13 issues: deliberating to identify frequency bands for future development of International Mobile Telecommunications (IMT), including the possibility of making additional divisions for mobile services as the main business. This paper is based on the WRC-19 1.13 issue, the 24.75-27.5 GHz band as its key frequency band, which is the main research content of this paper. It mainly deals with the study of adjacent frequency interference of IMT-2020 system to the Earth exploration satellite service (EESS) (passive) in 24.75-27.5 GHz frequency band.","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125902544","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
Continuous Skyline Query Processing Algorithm Based on Sharding Technology Under Sliding Window Model 滑动窗口模型下基于分片技术的连续Skyline查询处理算法
Xiufeng Xia, T. Yu, Rui Zhu, Jiajia Li, Xiangyu Liu, Chuanyu Zong
Continuous query processing over sliding window is an important problem in stream data management. Given the sliding window W and the continuous query q, q monitors to the multidimensional data objects in the window. When the window slides, q returns all the skyline objects in the window. Many scholars have carried out researches on such problems. The core idea is to delete objects that cannot be query results by using the temporal sequence relationship between objects in the window, and when the window slides, the algorithm can find the query results from the rest. However, the algorithm is sensitive to data timing relationships such as problems. In the worst case, the size of the candidate object equals to the size of the data in the window. In this paper, we propose a partition-based framework to support continuous skyline query over sliding window. It partitions the window into a group of sub-window, and maintain the skyline objects in each sub-window. In this way, it could effectively overcome the impact the object arrived order to the algorithm performance. In addition, we propose a self-adaptive algorithm to partition the window according to the distribution of streaming data. A large number of experiments prove the effectiveness and high efficiency of the proposed algorithm.
滑动窗口上的连续查询处理是流数据管理中的一个重要问题。给定滑动窗口W和连续查询q, q监视窗口中的多维数据对象。当窗口滑动时,q返回窗口中的所有天际线对象。许多学者对这些问题进行了研究。其核心思想是利用窗口中对象之间的时间序列关系,删除不能成为查询结果的对象,当窗口滑动时,算法可以从剩余的对象中找到查询结果。但该算法对数据时序关系等问题比较敏感。在最坏的情况下,候选对象的大小等于窗口中数据的大小。在本文中,我们提出了一个基于分区的框架来支持滑动窗口上的连续天际线查询。它将窗口划分为一组子窗口,并维护每个子窗口中的天际线对象。这样可以有效地克服目标到达顺序对算法性能的影响。此外,我们还提出了一种自适应算法,根据流数据的分布对窗口进行划分。大量实验证明了该算法的有效性和高效性。
{"title":"Continuous Skyline Query Processing Algorithm Based on Sharding Technology Under Sliding Window Model","authors":"Xiufeng Xia, T. Yu, Rui Zhu, Jiajia Li, Xiangyu Liu, Chuanyu Zong","doi":"10.1109/iucc/dsci/smartcns.2019.00036","DOIUrl":"https://doi.org/10.1109/iucc/dsci/smartcns.2019.00036","url":null,"abstract":"Continuous query processing over sliding window is an important problem in stream data management. Given the sliding window W and the continuous query q, q monitors to the multidimensional data objects in the window. When the window slides, q returns all the skyline objects in the window. Many scholars have carried out researches on such problems. The core idea is to delete objects that cannot be query results by using the temporal sequence relationship between objects in the window, and when the window slides, the algorithm can find the query results from the rest. However, the algorithm is sensitive to data timing relationships such as problems. In the worst case, the size of the candidate object equals to the size of the data in the window. In this paper, we propose a partition-based framework to support continuous skyline query over sliding window. It partitions the window into a group of sub-window, and maintain the skyline objects in each sub-window. In this way, it could effectively overcome the impact the object arrived order to the algorithm performance. In addition, we propose a self-adaptive algorithm to partition the window according to the distribution of streaming data. A large number of experiments prove the effectiveness and high efficiency of the proposed algorithm.","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129928016","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
Message from the IMHCS 2019 Workshop Chairs IMHCS 2019研讨会主席致辞
{"title":"Message from the IMHCS 2019 Workshop Chairs","authors":"","doi":"10.1109/iucc/dsci/smartcns.2019.00011","DOIUrl":"https://doi.org/10.1109/iucc/dsci/smartcns.2019.00011","url":null,"abstract":"","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130182177","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
期刊
2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1