{"title":"Spatio-Temporal Multi-Scale Convolutional Network for Traffic Forecasting","authors":"Qidong Liu, Tong Li, Rui Zhu, Zhen Hou, Zehui Zhang, Maoyu Chen, Bing Yang","doi":"10.1145/3456172.3456210","DOIUrl":"https://doi.org/10.1145/3456172.3456210","url":null,"abstract":"Effective traffic forecasting contributes to the public safety and urban management, and the complexity and variability of the traffic system make it difficult to predict traffic over a long-term horizon. In this paper, we focus on analyzing the spatio-temporal features of traffic, and propose a spatio-temporal multi-scale convolutional net-work (ST-MSCN) to solve the problem of traffic flow prediction. First, in order to directly capture the spatial dependence and multi-scale features of urban traffic flow, we propose an MSC unit. In addition, this paper also proposes a multi-level feature fusion strategy to combine low-level surface features and high-level abstract features to effectively avoid feature loss. Finally, we propose an early fusion mechanism and combine it with the MSC unit to ensure the improved prediction results while greatly reducing the complexity of the model. As for the simulation, Beijing taxi trajectory data and New York City bicycle trajectory data are used to carry out the simulation experiments. The experimental results show the advanced nature of our model, and prediction accuracy are 7.58% ∼ 9.23% higher than state-of-the-art.","PeriodicalId":133908,"journal":{"name":"Proceedings of the 2021 7th International Conference on Computing and Data Engineering","volume":"86 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120904101","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":"Optimization Techniques in Data Management: A Survey","authors":"Edjola Naka, V. Guliashki","doi":"10.1145/3456172.3456214","DOIUrl":"https://doi.org/10.1145/3456172.3456214","url":null,"abstract":"Data Management can be defined as the process of extracting, storing, organizing, and maintaining the data created and collected in organizations. Today's organizations invest in data management solutions that provide an efficient way to manage data in a unified structure. The enormously growth of data in the last decades has created a necessity for the fast extracting, accessing, and processing of the data. Optimization has been a key component in improving the system's performance, searching and accessing data in different data management solutions. Optimization is a mathematical discipline that formulates mathematical models and finds the best solution among a set of feasible solutions. This paper aims to give a general overview of applications of optimization techniques and algorithms in different areas of data management in the last decades. Data management includes a large group of functionalities, but we will focus on studying and reviewing the recent development of optimization algorithms used in databases, data warehouses, big data and machine learning. Furthermore, this paper will identify applications of optimization in data management, reviews the current solutions proposed and emphasize future topics where there is a lack of studies in data management.","PeriodicalId":133908,"journal":{"name":"Proceedings of the 2021 7th International Conference on Computing and Data Engineering","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129832313","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":"Improved KNN Algorithm based on Probability and Adaptive K Value","authors":"Yulong Ling, Xiao Zhang, Yong Zhang","doi":"10.1145/3456172.3456201","DOIUrl":"https://doi.org/10.1145/3456172.3456201","url":null,"abstract":"As one of the most classical supervised learning algorithms, the KNN algorithm is not only easy to understand but also can solve classification problems very well. Nevertheless, the KNN algorithm has a serious drawback:The voting principle used to predict the category of samples to be classified is too simple and does not take into account the proximity of the number of samples contained in each category in k near-neighbor samples. To solve this problem, this paper proposes a novel decision strategy based on probability and iterative k value to improve the KNN algorithm. By constantly adjusting the value of k to bring the probability value of the largest class in the k neighborhood to the specified threshold, the decision is sufficiently persuasive. The experimental results on several UCI public data sets show that compared with the KNN algorithm and the distance-weighted KNN algorithm, the improved algorithm in this paper improves the classification accuracy while reducing the sensitivity to hyperparameter k to a certain extent.","PeriodicalId":133908,"journal":{"name":"Proceedings of the 2021 7th International Conference on Computing and Data Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130137342","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 Tourism Knowledge Model through Topic Modeling from Online Reviews","authors":"Valentinus Roby Hananto, U. Serdült, V. Kryssanov","doi":"10.1145/3456172.3456211","DOIUrl":"https://doi.org/10.1145/3456172.3456211","url":null,"abstract":"Ontologies and knowledge models have gained more recognition because of their extensive use in recommender systems. The lack of automatic approaches in ontology engineering, however, becomes a challenge to fulfill increasing needs for such knowledge models in the field of tourism. In this study, a system for building tourism knowledge models from online reviews is proposed. The main contribution of the study is the application of topic modeling to build a knowledge model that, in turn, allows for an automated labeling process to train classifiers. Given a collection of unlabeled tourism online reviews, Latent Dirichlet Allocation (LDA) is applied to automatically label each document. Each topic discovered by LDA is labeled with one specific category, representing its semantic meaning based on an existing general ontology as a reference. These automatically labeled documents are used for classification, and the result is compared with manual annotation. Experiments on Indonesian tourism datasets showed that the automatic labeling approach using LDA provides for a precision score of 70%. In classification tasks, this approach can achieve comparable or even better classification performance than the manual labeling. The results obtained suggest that the developed system is capable of building a tourism knowledge model and providing acceptable-quality training data for the development of tourism recommender systems.","PeriodicalId":133908,"journal":{"name":"Proceedings of the 2021 7th International Conference on Computing and Data Engineering","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126146588","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":"Proceedings of the 2021 7th International Conference on Computing and Data Engineering","authors":"","doi":"10.1145/3456172","DOIUrl":"https://doi.org/10.1145/3456172","url":null,"abstract":"","PeriodicalId":133908,"journal":{"name":"Proceedings of the 2021 7th International Conference on Computing and Data Engineering","volume":"560 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124150404","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":"Near-Native Interrupt Latency in Real-Time Guests: Handler Emulation Through Memory Map Morphing","authors":"Farhad Andalibi, Paulo Garcia","doi":"10.1145/3456172.3456197","DOIUrl":"https://doi.org/10.1145/3456172.3456197","url":null,"abstract":"Interrupt latency, critical in real-time applications, is increased in virtualized systems; interrupts intended for a non-running partition can be delayed up to the length of the scheduling period. State-of-the art techniques for decreasing latency in real-time guests relax temporal isolation requirements, allowing guests’ interrupt handlers to be executed within another partition’s time slot. However, this approach does not yet achieve native latencies, due to the need to switch guests’ contexts, inducing overhead for Hypervisor execution. This paper presents an approach for reducing interrupt latencies: by taking advantage of virtualization support hardware in modern microprocessors, we show that real-time guests’ interrupt handlers can be executed within Hypervisor hardware context, i.e., by Hypervisor-dedicated processor hardware, eliminating the need for switching guests’ context and approaching native latencies. This is achieved by morphing the Hypervisor’s memory map translation mechanisms, so software is executed within the real-time guest’s memory context, allowing near-native interrupt latency. We evaluate our implementation, consisting of virtualization hardware and software, on a softcore ARM processor prototyped on a Xilinx Virtex 5 FPGA, running Linux and FreeRTOS. Results show memory map morphing is capable of achieving near-native interrupt latency for a real-time guest, outperforming the state of the art.","PeriodicalId":133908,"journal":{"name":"Proceedings of the 2021 7th International Conference on Computing and Data Engineering","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120957601","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}