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

FNF: flow-net based fingerprinting FNF:基于flow-net的指纹识别

Proceedings of the ACM Turing 50th Celebration Conference - China Pub Date : 2017-05-12 DOI: 10.1145/3063955.3063986

Bo Fu, Yang Xiao, Hui Chen

引用次数: 4

How does web-based virtual reality affect learning: evidences from a quasi-experiment 基于网络的虚拟现实如何影响学习:来自准实验的证据

Proceedings of the ACM Turing 50th Celebration Conference - China Pub Date : 2017-05-12 DOI: 10.1145/3063955.3063964

Ruobin Wang, Fengxia Li, Nannan Cheng, Bin Xiao, Jiandong Wang, Chuntao Du

引用次数: 8

NANI: an efficient community detection algorithm based on nested aggregation of node influence NANI:一种基于节点影响嵌套聚合的高效社区检测算法

Proceedings of the ACM Turing 50th Celebration Conference - China Pub Date : 2017-05-12 DOI: 10.1145/3063955.3063980

Chuan Li, Zhiheng Jiang, Yijie Li, Yangfan Miao, D. Hu, Guangming Liu, Yijing Liu

{"title":"NANI: an efficient community detection algorithm based on nested aggregation of node influence","authors":"Chuan Li, Zhiheng Jiang, Yijie Li, Yangfan Miao, D. Hu, Guangming Liu, Yijing Liu","doi":"10.1145/3063955.3063980","DOIUrl":"https://doi.org/10.1145/3063955.3063980","url":null,"abstract":"Most traditional community detection algorithms were developed based on the similarity evaluation of topological features. None of them have concerned about the rules during the information dissemination from the dynamic aspect, and therefore, they cannot discover communities that best serve the purpose of information diffusion. In addition, since traditional algorithms have not considered the information interacting structure and mechanism with-between network nodes, the community center and backbone nodes identified may not even be effective in the actual information dissemination process. To deal with this problem, this paper explored the community detection issue from a different angle of dynamic information diffusion and did the following contributions: (1) proposing a novel model, called NI (Node Influence) to evaluate the influence between nodes and intermediate communities, (2) proposing a novel algorithm, NANI (Nested Aggregation of Node Influences) to merge the nodes or intermediate communities on the way upwards based on NI model, (3) conducting extensive experiments on all existing 9 kinds of similarity measures. Experiments showed that the NANI algorithm outperforms all the related methods at most cases, especially when the data volume scale is considerably huge.","PeriodicalId":340447,"journal":{"name":"Proceedings of the ACM Turing 50th Celebration Conference - China","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126653141","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

Thor: a server-level hybrid switching data center network with heterogeneous topologies Thor:具有异构拓扑的服务器级混合交换数据中心网络

Proceedings of the ACM Turing 50th Celebration Conference - China Pub Date : 2017-05-12 DOI: 10.1145/3063955.3063992

Xiaoshan Yu, Hong Xu, Huaxi Gu

{"title":"Thor: a server-level hybrid switching data center network with heterogeneous topologies","authors":"Xiaoshan Yu, Hong Xu, Huaxi Gu","doi":"10.1145/3063955.3063992","DOIUrl":"https://doi.org/10.1145/3063955.3063992","url":null,"abstract":"Optical interconnects are promising to address the dilemma faced by traditional electrical networks in data centers. However, some issues, including weak connectivity of the topology, limited scalability of the control system, and inefficient use of WDM technologies, limit the deployment potential of optical networks. To address these issues, we propose a novel hybrid network called Thor. By employing different topologies for the optical and electrical networks, Thor achieves server-level optical interconnects and can better exploit the unique properties of circuit switching and packet switching. To build a more scalable and responsive control plane, Thor uses a distributed control system built atop the electrical network. Moreover, we develop a new optical switch to more efficiently utilize multiple wavelengths. Our evaluation results show that Thor is able to deliver ∼ 90% bisection bandwidth of a non-blocking electrical network under realistic traffic patterns. Moreover, by transmitting mice and elephant flows separately in each of the two networks, Thor is able to provide an order of magnitude speedup in average flow completion times for mice flows compared to conventional approaches.","PeriodicalId":340447,"journal":{"name":"Proceedings of the ACM Turing 50th Celebration Conference - China","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127891297","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}

引用次数: 1

Proceedings of the ACM Turing 50th Celebration Conference - China 美国计算机学会图灵50周年纪念会议论文集-中国

Proceedings of the ACM Turing 50th Celebration Conference - China Pub Date : 2017-05-12 DOI: 10.1145/3063955

John C.S. Lui, Xinbing Wang, A. Wolf, Yunhao Liu, Chuanping Hu

引用次数: 0

Performance evaluation of anomaly-detection algorithm for keystroke-typing based insider detection 基于击键输入的内部检测异常检测算法的性能评价

Proceedings of the ACM Turing 50th Celebration Conference - China Pub Date : 2017-05-12 DOI: 10.1145/3063955.3063987

Liang He, Zhixiang Li, Chao Shen

{"title":"Performance evaluation of anomaly-detection algorithm for keystroke-typing based insider detection","authors":"Liang He, Zhixiang Li, Chao Shen","doi":"10.1145/3063955.3063987","DOIUrl":"https://doi.org/10.1145/3063955.3063987","url":null,"abstract":"Keystroke dynamics is the process to identify or authenticate individuals based on the typing rhythm behaviors. There are many classifications proposed to check the user's legitimacy, and therefore we should make it clear how they perform in order to confirm promising research direction. Nevertheless, these researches provide experiments in different situations such as datasets, conditions and methodologies as well. This paper aims to benchmark the algorithms in the same dataset and feature in order to measure the performance on an equal level. Using dataset containing 51 subjects' typing rhythm, we implemented and evaluated 13 classifiers measured by F1-measure. We also develop a way to process the typing data, and test it on these algorithms. Considering the case that the model should reject outlander, we test the algorithms on open set. The top-performing classifier achieves F1-measure rates 0.92 when using 50 subjects' typing normalized data to train and the remaining one to test. The results, along with the normalization methodology, constitute a benchmark for comparing classifiers and measuring performance of keystroke dynamics for insider detection.","PeriodicalId":340447,"journal":{"name":"Proceedings of the ACM Turing 50th Celebration Conference - China","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126108769","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