{"title":"Ada3D","authors":"Muhong Wu, Shuai Yu, Xu Chen","doi":"10.1145/3393527.3393544","DOIUrl":"https://doi.org/10.1145/3393527.3393544","url":null,"abstract":"Augmented reality, so called AR, is recently the subject of attention by researchers from different fields and is developing rapidly. However, some attractive AR applications do not have mature technical basis yet, such as holographic conference and telesurgery. In these applications, 3D reconstruction of the target objects and real-time transmission of the reconstructed result are needed. It is challenging to build an integrated real-time 3D reconstruction system and effectively reduce the transmission delay within the system. In this paper, we propose Ada3D, a practical cross-platform system for real-time 3D reconstruction using multiple RGB-D sensors. It consists of several sensory clients and an edge server, which are responsible for data acquisition and data fusion, respectively. In addition, a compression-based method is applied in the system, which enables the client to automatically select an appropriate data compression level according to the current system state, including network status and device capability. Experiment results show that the method outperforms the common case by over 10% in delay saving.1","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116066371","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":"Pricing Adjustment System for Spatial-Temporal Load of Charging Station","authors":"Yunhao Wang, Peng Xu, Wei Zheng, Hengchang Liu","doi":"10.1145/3393527.3393555","DOIUrl":"https://doi.org/10.1145/3393527.3393555","url":null,"abstract":"Electric vehicles(EVs) have lately received great attention due to their low emission pollution and recyclability. However, the spatial-temporal charging load has made it challenging to popularize EVs. In the temporal aspect, the extra charging load causes power loss to the power grid, which even results in an overload of the power gird. In the spatial aspect, a long waiting queue during the peak period of charging in some charging stations is detrimental to the development of EVs. Although some encouraging progress has been made, the extra charging load during the peak period of domestic electricity consumption remains an ongoing challenge, and the pricing adjustment system without considering the income of charging station companies is hard to implement and still requires further research. In this paper, we proposed an innovative pricing adjustment system to solve these problems. By studying the charging behaviors and consumption behaviors of drivers, our system will provide each driver with the location, real-time queuing, and customized charging fee of charging stations with the consideration of the income of charging station companies. We use a real data set from Xi'an, e-charge, which contains 241,346 of vehicle charging and driving records for three months with data from 400 charging stations. The experiment shows that our system is effective in decreasing the number of charging vehicles during the peak period of domestic electricity consumption. Also, it reduces the average queue waiting time and the peak waiting time while protecting the profit of charging station operators.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129148491","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":"Extracting Chinese Domain-specific Open Entity and Relation by Using Learning Patterns","authors":"Hongying Wen, Zhiguang Wang, Qiang Lu","doi":"10.1145/3393527.3393548","DOIUrl":"https://doi.org/10.1145/3393527.3393548","url":null,"abstract":"Nowadays, Chinese domain-specific relation extraction faces a major challenge, that is the lack of annotation data. To cope with this challenge, the distant supervision which can automatically label large-scale training data was proposed. However, the distant supervision can produce noisy data which will hinder the performance of a model trained on such noisy data. Although significant progress has been made in filtering noisy data, the distant supervision method extracts the relation which already exists in the knowledge base. However, another major challenge in the extraction of domain-specific entities and relations is the diversity of entities and relation, which makes it difficult to accurately predefine relations in the knowledge base. Therefore, the distant supervision does not apply to domain-specific. In order to overcome the above challenges on specific domain, this paper proposes a Chinese Domain-specific Open Entity Relation Extraction Model (DOERE) which learns patterns from a small number of annotated data, and applies extraction patterns to the new domain-specific corpus for extracting entities and relations. Then, this paper proposes a method for automatically labeling data based on patterns. The experimental results show that the model has achieved better precision and recall in large-scale specific domain. And the method of automatically labeling data based on patterns has a good effect on data labeling in specific domain.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130373361","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":"Delay-sensitive Trajectory Designing for UAV-enabled Data Collection in Internet of Things","authors":"Pengfei Wu, Chao Sha, Haiping Huang, Haiyan Wang","doi":"10.1145/3393527.3393541","DOIUrl":"https://doi.org/10.1145/3393527.3393541","url":null,"abstract":"In this paper, we consider a data collection problem using an unmanned aerial vehicle (UAV) where the Internet of Things (IoT) is damaged. Different from the previous work, this paper is concerned with the communication delay of collected information for that the outdated data would delay the optical time to save lives and property. We study the delay-sensitive trajectory design problem in the damaged IoT networks, where the UAV is dispatched to collect data from the ground IoT devices. The communication delay of collected information refers to the interval between the times-tamps that the UAV arrives at the ground IoT device and returns to the base station. We formulate the delay-sensitive trajectory design problem as the symmetrical traveling salesman problem and prove it to be NP-hard. A Heuristic Algorithm (HA) is proposed to find the optimal delay-sensitive trajectory. Simulation results validate the effectiveness of the proposed algorithm and show how the maximum and average communication delays are affected by the network size.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126696740","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":"Web Security Education in A Multidisciplinary Learning Context","authors":"Qiang Liu, Wentao Zhao, Minghui Wu, Chengzhang Zhu","doi":"10.1145/3393527.3393528","DOIUrl":"https://doi.org/10.1145/3393527.3393528","url":null,"abstract":"Web security research and education are attracting much more attentions from industry and academia. In this paper, we report our teaching and learning experiences of a course entitled Web Security and Countermeasures (WebSC) in a multidisciplinary learning context. To achieve the learning outcome of practical skills improvement, we design a rounded teaching contents by jointly considering basic concepts, high-risk threats in OWASP TOP 10-2017 and emerging confrontation tools like PowerShell. Then, we coordinately adopt apprenticeship, interactive, problem-based and collaborative learning methods to improve the performance of all students. Finally, we integrate formative and summative assessment methods to conduct quantitative evaluation on students' learning performance and the instructor's teaching performance. Statistical results demonstrate the effectiveness of our course design and reveal some unforeseen findings that are very valuable for continuous improvement in near future.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115774433","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":"An Adaptive and Robust Model for WiFi-based Localization","authors":"Yajie Song, Xiansheng Guo","doi":"10.1145/3393527.3393546","DOIUrl":"https://doi.org/10.1145/3393527.3393546","url":null,"abstract":"The fluctuation of received signal strength (RSS) caused by environmental changing and heterogeneous devices severely degenerates the performance of WiFi fingerprint-based positioning methods. Deep Domain Adaptation (DDA) in transfer learning has proven to be an effective strategy to deal with this situation. However, the existing DDA methods show limited improvement in positioning accuracy in presence of the two factors simultaneously. In this study, we propose a new deep adaptation networks by adopting the joint constraints of mean and covariance to reduce domain discrepancy, which shows an excellent adaptability to environmental changing and heterogeneous devices. To further improve the robustness of our network, we design an exponential moving average method to update the parameters of the network, which can be further updated by unlabeled data from target domain, which is highly consistent with the actual application scenario and has practical significance. Experiment results show that the proposed model can reduce domain discrepancy effectively, and achieve lower positioning error than some other existing methods in real complex indoor environments.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116950046","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":"Context-aware Location Search on Maps","authors":"Yufan Sheng, Yu Hao","doi":"10.1145/3393527.3393556","DOIUrl":"https://doi.org/10.1145/3393527.3393556","url":null,"abstract":"Location searching by keywords has immense demands in location-based services (LBSs). In this paper, we study the context-aware location search problem based on maps. Specifically, given a primary keyword and a set of contexts keywords as constraints, the objective is to search for the best-fit location that meets the user's requirements. In order to improve the performance of the search process, we propose an index structure to reduce the workload of querying. In particular, we consider max distance among the locations corresponding to the primary keyword and all surrounding contexts keywords. Extensive experiments are conducted on multiple datasets to validate the effectiveness of our proposed index structure and searching algorithm.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121218264","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":"Fast and Precise Energy Consumption Prediction Based on Fully Convolutional Attention Res2Net","authors":"Chao Yang, Zhongwen Guo, Yuan Liu","doi":"10.1145/3393527.3393559","DOIUrl":"https://doi.org/10.1145/3393527.3393559","url":null,"abstract":"Energy consumption prediction has been poured lots of attention due to its importance in energy planning, management, conservation, etc. This paper proposes a convolutional network called Fully Convolutional Attention Res2Net (FCARN) based on Res2Net for fast and precise energy consumption prediction. Based on the thought of attention mechanism, gate whose value is calculated based on global feature maps are applied in the Res2Net. It assigns weights to the feature maps thus enabling the model to focus on the more important part. We conducted experiments and evaluated our model on appliances energy prediction dataset. As the thought of the gates is similar to Squeeze-and-Excitation Net (SENet), we compare our model with Res2Net, Res2Net combined with SENet and the existing state-of-the-art models. The results demonstrate the superiority and competitiveness of our model. In addition, we provide details of the training process.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129243820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A New Steganography Without Embedding Based on Adversarial Training","authors":"Wenjie Jiang, Donghui Hu, Cong Yu, Meng Li, Zhong-Qiu Zhao","doi":"10.1145/3393527.3393564","DOIUrl":"https://doi.org/10.1145/3393527.3393564","url":null,"abstract":"Steganography is an art to hide information in the carriers to prevent from being detected, while steganalysis is the opposite art to detect the presence of the hidden information. With the development of deep learning, several state-of-the-art steganography and steganalysis based on deep learning techniques have been proposed to improve hiding or detection capabilities. Generative Adversarial Networks (GANs) based steganography directly uses the minimax game between the generator and discriminator, to automatically generate steganography algorithms resisting being detected by powerful steganalysis. The steganography without embedding (SWE) based on GANs, where the generated cover images themselves are stego ones carrying secret information has shown its state-of-the-art steganography performance. However, SWE based on GANs has serious weaknesses, such as low information recovery accuracy, low steganography capacity and poor natural showing. To solve these problems, this paper proposes a new SWE based on adversarial training, with carefully designed generator, discriminator and extractor, as well as their loss functions and optimized training mode. The proposed method can achieve a very high information recovery accuracy (100% in some cases), and at the same time improve the steganography capacity and image quality.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126865680","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}