Proceedings of the ACM Turing Celebration Conference - China最新文献

{"title":"Management system for secure mobile application development","authors":"Wei Guo","doi":"10.1145/3321408.3321418","DOIUrl":"https://doi.org/10.1145/3321408.3321418","url":null,"abstract":"Most mobile Internet application security issues are introduced in the development process. How to effectively prevent security problems and solve them as soon as possible in the development process of mobile application development is the key to the security of mobile Internet. This paper introduces the design and implementation of a management and control platform for secure mobile application development. For Android applications and iOS applications, security standards are provided for different application types in the form of security baselines, and the application security baseline standards are managed in the form of security knowledge base. The security baseline points are mapped to specific application security technical specifications and security verification technical points. It provides an effective solution for secure mobile application development.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125652300","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":"IoT device fingerprinting for relieving pressure in the access control","authors":"Yubo Song, Qiang Huang, Junjie Yang, Ming Fan, A. Hu, Yu Jiang","doi":"10.1145/3321408.3326671","DOIUrl":"https://doi.org/10.1145/3321408.3326671","url":null,"abstract":"As mass devices access to network in the era of the Internet of Things (IoT), the network access control becomes more important. Traditional authentication mechanisms are no longer suitable for IoT devices with limited physical and computational resources because of their complexity. This problem can be solved by the device fingerprinting, which can identify devices only by their traffic characteristics. However, existing device fingerprinting technologies cannot accurately identify devices' type from the same manufacturer which equips these devices with similar hardwares and softwares. Therefore, we proposed the TSMC-SVM algorithm which introduced the cosine similarity into the SVM for improving the identification accuracy of these similar devices described above. Experiments illustrate that the average identification accuracy of the TSMC-SVM reaches 93.2%.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124116955","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":"RI-SSGE: a framework with rule inference and sentence schema graph embedding for knowledge base query construction","authors":"Xiaoyang Huo, Chuan Wen, Yuchen Yan, Ruijie Wang","doi":"10.1145/3321408.3321604","DOIUrl":"https://doi.org/10.1145/3321408.3321604","url":null,"abstract":"As knowledge graph becomes popular in recent years, more and more attention has been paid to Knowledge Base Question-Answer (KBQA) systems. For KBQA systems, Question Understanding, as the first stage, aims to convert factual question into the interpretable form to machine just like Λ-DCS. And some latest works used query subgraph to change the Question Understanding task into the Question to Subgraph(Question2Subgraph) task with which the subgraph can be simply and directly mapped to Λ-DCS. In this paper, we focus on factual question to subgraph task (Qƒ, G) and prove that more complex questions can be easily solved based on it. Then, we propose a novel framework with Rule Inference and Sentence Schema Graph Embedding (RI-SSGE) to solve (Qƒ, G) task. Inspired by isomeride structures in Chemistry, we concentrate RI-SSGE on structure detection of questions to avoid the problem of poor generalization in other models, which are based on templates on various specific domain knowledge graphs. To address the problem of error propagation, RI-SSGE creatively combines the traditional rule inference method and the graph representation method together, and thus guarantees the performance of the whole framework. Having observed that human can exploit the hidden relations by joining the question and the knowledge graph structure together, we raise a novel Sentence-Schema-Graph (SSG) in the last network representation learning stage of RI-SSGE, which is designed to imitate human's way of thinking. We experimented on Geoquery-880 and AceQG[11] datasets which has 133,143 (Factual Question, Subgraph) pairs on an open academic knowledge graph and results demonstrate the advantages of RI-SSGE over other baselines.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132600946","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":"Hybrid recommendation algorithm based on multi-attribute rating from online reviews","authors":"Jinhai Li, Z. Qian, P. Zhang, Youshi He","doi":"10.1145/3321408.3326669","DOIUrl":"https://doi.org/10.1145/3321408.3326669","url":null,"abstract":"As the growing users and products in network shopping platform under the big data environment, the data sparsity and cold start problem are increasingly prominent which lead to the recommended effect of recommendation algorithm can't be satisfied by users. For this problem, the paper presents a construction method of user preference model and product feature model based on information mining of online reviews, and then it eases data sparsity through multi-attribute rating. And the paper solves the problem of user cold start and product cold start to a certain extent through the algorithm of similarity which is based user attributes and product attributes. Finally, the paper combines with multiple similarity algorithms to construct hybrid recommendation algorithm based on user preference and product feature. Simulation experiments verify the ability to solve the cold start problem and good recommendation accuracy of the algorithm through collecting 10000 online reviews information from the mobile channel of Amazon.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134010018","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":"VRPSOFC","authors":"Guangxia Xu, Peng Jiang, Chuang Ma, M. Daneshmand, Shaoci Xie","doi":"10.1145/3321408.3323081","DOIUrl":"https://doi.org/10.1145/3321408.3323081","url":null,"abstract":"The focused crawler is the key technology of the search engine. It filters webpages based on relevant algorithms until certain conditions are met. The current focused crawler is prone to topic-drift and low precision in the process of crawling the webpages. Therefore, this paper proposes a focused crawler framework (VRPSOFC) based on mutation improving particle swarm optimization. First of all, for each topic, VRPSOFC gets 3 different types of seed pages that are easy to generate large-scale web page aggregation based on the page click rate of Google search, which are official website, wikipedia, forum or video page. Then VRPSOFC uses the mutation improved particle swarm optimization algorithm proposed in this paper to crawl webpages, where each seed page will be used as the initial page. Finally, experiment in the real web environment and analyze the results. Compared with traditional VSM and other methods, VRPSOFC can obtain more accurate URL priority and crawl high quality web pages. Therefore, the topic crawler framework proposed in this paper is effective and important.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131147650","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":"Cow face detection and recognition based on automatic feature extraction algorithm","authors":"L. Yao, Zexi Hu, Caixing Liu, Hanxing Liu, Yingjie Kuang, Yuefang Gao","doi":"10.1145/3321408.3322628","DOIUrl":"https://doi.org/10.1145/3321408.3322628","url":null,"abstract":"Automatic farm livestock detection and recognition have high importance in the management of livestock due to the increasing potentials in dairy cow welfare as well as production efficiency. In contrast to the general object (e.g., person, car and bird), the recognition of farm livestock still remains challenging due to the open complex scenarios, similar appearance, shape deformation, occlusion and insufficient annotated data and needs to be solved. In this paper, we discuss the problem of cow face detection and recognition by releasing a new large-scale cow dataset which containing about 50,000 annotated cow face detection data and probably 18,000 cow recognition data. Moreover, a cow face recognition framework is proposed which hybrids the detection and recognition model to improve the recognition performance. Experimental results show the superiority of the proposed method. The accuracy of the detection is 98.3%, and the accuracy of the cow face recognition is up to 94.1%.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131399415","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":"Learning to create multi-stylized Chinese character fonts by generative adversarial networks","authors":"Jiefu Chen, Xing Xu, Yanli Ji, Hua Chen","doi":"10.1145/3321408.3322631","DOIUrl":"https://doi.org/10.1145/3321408.3322631","url":null,"abstract":"Owing to the complex structure of Chinese characters and the huge number of Chinese characters, it is very challenging and time consuming for artists to design a new font of Chinese characters. Therefore, the generation of Chinese characters and the transformation of font styles have become research hotspots. At present, most of the models on Chinese character transformation cannot generate multiple fonts, and they are not doing well in faking fonts. In this paper, we propose a novel method of Chinese character fonts transformation and generation based on Generative Adversarial Networks. Our model is able to generate multiple fonts at once through font style specifying mechanism and it can generate a new font at the same time if we combine the characteristics of existing fonts.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131433358","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":"Wandering between close and apart: are scholarly domains crossable?","authors":"Haiwen Wang, Lingkun Kong, Luoyi Fu, Xinbing Wang","doi":"10.1145/3321408.3321576","DOIUrl":"https://doi.org/10.1145/3321408.3321576","url":null,"abstract":"Interdisciplinary collaborations, i.e., scholarly crossdomain collaborations have generated huge impact to society, and has been previously proved to exhibit domain skewness[20]. To illustrate, scholarly cross-domain collaborations seldom emerge between irrelevant scholarly domains. In this work we address a question to determine the possible existence of scholarly cross-domain collaborations, namely: \"Are scholarly domains really crossable?\" Using a real-world scholarly dataset, i.e., Microsoft Academic Graph (MAG)[1] with 126 million papers collected from 53,834 domains, we take the initiative to formalize a \"crossability\" quantification problem, where the \"crossability\" serves as an index that aims to evaluate the ability of two scientific domains to establish collaborations. In doing so, we propose two metrics, i.e., co-paper ratio and hierarchical distance, where the former one is the ratio of common papers in two domains to which in a single domain, and the later one is the difference of domains' levels according to their positions in the hierarchical structure. Interestingly, we observe a peak pattern, meaning that the influence of research work, i.e., number of citations, climbs to a peak when its domains' count goes to a certain number, after which the citation count decrease sharply. Our discovery indicates that a moderate amount of domain \"crossability\" helps to improve the impact of research work, which, however, could be weakened under excessive \"crossability\". With elaborately modeling, we reproduce this peak pattern and briefly discuss the reason of the existence of peak.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128204391","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":"The prediction model of initial flowering based on accumulated temperature of different species peach in Longquanyi","authors":"Chen Chao, Tian Shan, Li Mei-Yan, Xiao Xiao","doi":"10.1145/3321408.3326690","DOIUrl":"https://doi.org/10.1145/3321408.3326690","url":null,"abstract":"The phenological model refers to a mathematical model based on the response mechanism of plants to environmental factors, which can be used to simulate plant growth and development.So far, many scholars have established various types of phenological models. We know that changes in phenological period of plants are closely related to meteorological conditions. Previous studies have shown that temperature plays a key and decisive role in various meteorological factors which affects phenological period of plants. In recent years, phenological models have been used to reconstruct past climate change, predict changes in tree species distribution, and plant disaster risk assessment, etc. Longquanyi is the seat of the state-level Chengdu Economic and Technological Development Zone. Longquanyi is rich in peaches. And the peach is one of the main economic crops and ornamental plants in the area. Accurately predicting the flowering period of peach blossoms will play an important role in increasing the income of local farmers and adapting to the demand for tourism meteorological services. Based on the phenological and meteorological data of Meteorological Bureau of Longquanyi, this paper establishes prediction models for the initial flowering period of different species of peach blossoms based on effective accumulated temperature by linear regression and statistical analysis, and carries out the simulation and test of the initial flowering period. At the same time, we have analyzed the response sensitivity of the prediction model that passed the test under the temperature change. We know that the initial flowering period of traditional peach blossom, greenhouse peach blossom and ornamental peach blossom can be simulated based on the prediction model established by effective accumulated temperature, and the accuracy is high. The last,We can get the results of the sensitivity of the prediction model of the three types of peach to the change of temperature factor. During the same period, the temperature decreased by 2 °C, and the initial flowering period of the three types of peach blossoms was delayed by 15.38d on average. During the same period, the temperature increased by 2 °C, and the initial flowering period of the three types of peach blossoms was 17.33d on average.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128219634","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":"Computation offloading for mobile edge computing with accuracy guarantee","authors":"Yuben Qu, Jiajia Liu","doi":"10.1145/3321408.3321582","DOIUrl":"https://doi.org/10.1145/3321408.3321582","url":null,"abstract":"In this paper, we investigate the problem of energy expenditure minimization under latency and accuracy constraints in mobile edge computing (MEC)-based computation offloading. Given the non-convexity of the formulated problem, we first propose an energy-efficient computation resource allocation scheme inspired by the recent successive convex approximation (SCA) advances. After carefully exploring the problem structure, we fortunately derive the optimal solution, whose optimality is theoretically proved. Numerical results show that, compared with the SCA-based scheme and two other benchmark schemes, the optimal computation resource allocation scheme achieves the lowest energy consumption while satisfying the latency and accuracy requirements.","PeriodicalId":364264,"journal":{"name":"Proceedings of the ACM Turing Celebration Conference - China","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128471108","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}