检索结果-内蒙古大学图书馆

KT-store: A key-order and write-order hybrid key-value store with high write and range-query performance 1

15th IFIP International Conference on Network and Parallel Computing, NPC 2018

作者： Wang, Haobo Yue, Yinliang He, Shuibing Wang, Weiping Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China School of Computer Science Wuhan University Wuhan China

ISBN: (数字)9783030056773

ISBN: (纸本)9783030056766

With the data volume increasing, key-value (KV) store plays an important role in today’s storage systems due to its flexible architecture and good scalability. There are two types of data organization in current KV stores: key-order layout and write-order layout, which organize records according to key order and write sequence, respectively. While the former and the latter layouts deliver high throughput for range-query and write operations respectively, neither of them can perform well for both write and range-query operations. In this paper, we propose a hybrid KV store, KT-Store, which combines the key-order and write-order layout together to improve performance. More specifically, KT-Store stores keys and value metadata into a LSM-tree, and stores values into multiple tables called TrieTables. By inserting the value among multiple TrieTables in a key-order fashion leveraging a trie, and into a specific TrieTable in a write-order fashion, KT-Store can obtain the advantages of existing two layout types and avoid their shortcomings. We implement KT-Store in RocksDB 5.7.2. Extensive evaluations demonstrate that KT-Store can simultaneously obtain encouraging write and range-query performance: compared with key-order based RocksDB, the write performance is improved by 4.3× -12.6× on HDDs;compared with write-order based Wisckey, KT-Store has 4.2× -112.6 range-query performance on HDDs. Besides, KT-Store also has encouraging performance on SSDs. © IFIP International Federation for Information Processing 2018.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Understanding the Behavioral Differences Between American and German Users: A Data-Driven Study

引用

Big Data Mining and Analytics 2018年第4期1卷 284-296页

作者： Chenxi Yang Yang Chen Qingyuan Gong Xinlei He Yu Xiao Yuhuan Huang Xiaoming Fu School of Computer Science Fudan UniversityShanghai 200433China Engineering Research Center of Cyber Security Auditing and Monitoring Ministry of EducationShanghai 200433China Department of Communications and Networking Aalto University02150 EspooFinland Faculty of European Languages and Cultures Guangdong University of Foreign StudiesGuangzhou 510420China Institute of Computer Science University of Gottingen37077 GottingenGermany

Given that the USA and Germany are the most populous countries in North America and Western Europe,understanding the behavioral differences between American and German users of online social networks is *** this work,we conduct a data-driven study based on the Yelp Open *** demonstrate the behavioral characteristics of both American and German users from different aspects,i.e.,social connectivity,review styles,and spatiotemporal *** addition,we construct a classification model to accurately recognize American and German users according to the behavioral *** model achieves high classification performance with an F1-score of 0.891 and AUC of 0.949.

关键词： behavioral difference online social networks Yelp machine learning

来源：评论

学校读者我要写书评

暂无评论

SoulMate: Short-text author linking through Multi-aspect temporal-textual embedding

arXiv

引用

arXiv 2019年

作者： Najafipour, Saeed Hosseini, Saeid Hua, Wen Kangavari, Mohammad Reza Zhou, Xiaofang Computational Cognitive Model Research Lab School of Computer Engineering Iran University of Science and Technology Iran Cyber Security Lab. Singapore University of Technology and Design Singapore School of Information Technology and Electrical Engineering University of Queensland Brisbane Australia

Linking authors of short-text contents has important usages in many applications, including Named Entity Recognition (NER) and human community detection. However, certain challenges lie ahead. Firstly, the input short-text contents are noisy, ambiguous, and do not follow the grammatical rules. Secondly, traditional text mining methods fail to effectively extract concepts through words and phrases. Thirdly, the textual contents are temporally skewed, which can affect the semantic understanding by multiple time facets. Finally, using the complementary knowledge-bases makes the results biased to the content of the external database and deviates the understanding and interpretation away from the real nature of the given short text corpus. To overcome these challenges, we devise a neural network-based temporal-textual framework that generates the tightly connected author subgraphs from microblog short-text contents. Our approach, on the one hand, computes the relevance score (edge weight) between the authors through considering a portmanteau of contents and concepts, and on the other hand, employs a stack-wise graph cutting algorithm to extract the communities of the related authors. Experimental results show that compared to other knowledge-centered competitors, our multi-aspect vector space model can achieve a higher performance in linking short-text authors. Additionally, given the author linking task, the more comprehensive the dataset is, the higher the significance of the extracted concepts will be. Copyright © 2019, The Authors. All rights reserved.

关键词： Vector spaces

来源：评论

学校读者我要写书评

暂无评论

Improved upper bounds on the hermite and KZ constants

arXiv

引用

arXiv 2019年

作者： Wen, Jinming Chang, Xiao-Wen Weng, Jian College of Information Science and Technology College of Cyber Security Jinan University Guangzhou510632 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 School of Computer Science McGill University MontrealH3A 0E9 Canada

The Korkine-Zolotareff (KZ) reduction is a widely used lattice reduction strategy in communications and cryptography. The Hermite constant, which is a vital constant of lattice, has many applications, such as bounding the length of the shortest nonzero lattice vector and orthogonality defect of lattices. The KZ constant can be used in quantifying some useful properties of KZ reduced matrices. In this paper, we first develop a linear upper bound on the Hermite constant and then use the bound to develop an upper bound on the KZ constant. These upper bounds are sharper than those obtained recently by the first two authors. Some examples on the applications of the improved upper bounds are also presented. Copyright © 2019, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Backscatter-Aided Hybrid Data Offloading for Wireless Powered Edge Sensor Networks

Backscatter-Aided Hybrid Data Offloading for Wireless Powere...

引用

IEEE Global Communications Conference

作者： Yuze Zou Jing Xu Shimin Gong Yuanxiong Guo Dusit Niyato Wenqing Cheng School of Computer Science and Engineering Nanyang Technological University Singapore School of Electronic Information and Communications Huazhong University of Science and Technology China School of Intelligent Systems Engineering Sun Yat-sen University China Department of Information Systems and Cyber Security University of Texas San Antonio USA

ISBN: (数字)9781728109626

ISBN: (纸本)9781728109633

In this paper, we consider a backscatter-aided hybrid data offloading scheme for a batteryless wireless sensor network. All sensor devices on the edge are coordinated by a hybrid access point (HAP), while also provides power for them via wireless power transfer. Co-located with the HAP, an edge computing server is set up to provide the computation and caching capabilities for the edge devices with insufficient power and computation resources. Each node is allocated a fixed time-slot for data offloading via either the conventional active communications or the passive backscatter communications. Such a hybrid data offloading scheme can flexibly control the tradeoff between power consumption and data rate in offloading. We aim to minimize the total energy consumption by optimizing the offloading strategy of each edge device and the HAP's wireless power allocation over different edge devices. We show that the energy minimization problem exhibits a convex reformulation. For practical consideration, we devise a distributed algorithm to solve the problem. The numerical results demonstrate that the distributed algorithm can achieve a near-optimal performance. With a fixed transmit power at the HAP, our proposed hybrid offloading scheme provides a higher offloading throughput compared to the state-of-the-art data offloading schemes.

关键词： Backscatter Wireless sensor networks Wireless communication Servers Power demand Silicon Hybrid power systems

来源：评论

学校读者我要写书评

暂无评论

Integrating privacy enhancing techniques into blockchains using sidechains

arXiv

引用

arXiv 2019年

作者： Parizi, Reza M. Homayoun, Sajad Yazdinejad, Abbas Dehghantanha, Ali Choo, Kim-Kwang Raymond Department of Software Engineering and Game Development Kennesaw State University GA United States Department of Computer Engineering and Information Technology Shiraz University of Technology Shiraz Iran Faculty of Computer Engineering University of Isfahan School of Computer Science University of Guelph ON Canada Department of Information Systems and Cyber Security University of Texas San AntonioTX United States

Blockchains are turning into decentralized computing platforms and are getting worldwide recognition for their unique advantages. There is an emerging trend beyond payments that blockchains could enable a new breed of decentralized applications, and serve as the foundation for Internet's security infrastructure. The immutable nature of the blockchain makes it a winner on security and transparency;it is nearly inconceivable for ledgers to be altered in a way not instantly clear to every single user involved. However, most blockchains fall short in privacy aspects, particularly in data protection. Garlic Routing and Onion Routing are two of major Privacy Enhancing Techniques (PETs) which are popular for anonymization and security. Garlic Routing is a methodology using by I2P Anonymous Network to hide the identity of sender and receiver of data packets by bundling multiple messages into a layered encryption structure. The Onion Routing attempts to provide lowlatency Internet-based connections that resist traffic analysis, deanonymization attack, eavesdropping, and other attacks both by outsiders (e.g. Internet routers) and insiders (Onion Routing servers themselves). As there are a few controversies over the rate of resistance of these two techniques to privacy attacks, we propose a PET-Enabled Sidechain (PETES) as a new privacy enhancing technique by integrating Garlic Routing and Onion Routing into a Garlic Onion Routing (GOR) framework suitable to the structure of blockchains. The preliminary proposed GOR aims to improve the privacy of transactions in blockchains via PETES structure. Copyright © 2019, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

cyber-security internals of a skoda octavia vRS: A hands on approach

arXiv

引用

arXiv 2019年

作者： Urquhart, Colin Bellekens, Xavier Tachtatzis, Christos Atkinson, Robert Seeam, Amar Hindy, Hanan Abertay University Division of Cyber-Security Dundee United Kingdom University of Strathclyde Dept. Electronic and Electrical Engineering Glasgow United Kingdom Middlesex University Dept. Computer Science Uniciti Flic-en-Flac Mauritius

The convergence of information technology and vehicular technologies are a growing paradigm, allowing information to be sent by and to vehicles. This information can further be processed by the Electronic Control Unit (ECU) and the Controller Area Network (CAN) for in-vehicle communications or through a mobile phone or server for out-vehicle communication. Information sent by or to the vehicle can be life-critical (e.g. breaking, acceleration, cruise control, emergency communication, etc. . .). As vehicular technology advances, in-vehicle networks are connected to external networks through 3 and 4G mobile networks, enabling manufacturer and customer monitoring of different aspects of the car. While these services provide valuable information, they also increase the attack surface of the vehicle, and can enable long and short range attacks. In this manuscript, we evaluate the security of the 2017 Skoda Octavia vRS 4x4. Both physical and remote attacks are considered, the key fob rolling code is successfully compromised, privacy attacks are demonstrated through the infotainment system, the Volkswagen Transport Protocol 2.0 is reverse engineered. Additionally, in-car attacks are highlighted and described, providing an overlook of potentially deadly threats by modifying ECU parameters and components enabling digital forensics investigation are identified. Copyright © 2019, The Authors. All rights reserved.

关键词： cybersecurity

来源：评论

学校读者我要写书评

暂无评论

General linear group action on tensors: A candidate for post-quantum cryptography

arXiv

引用

arXiv 2019年

作者： Ji, Zhengfeng Qiao, Youming Song, Fang Yun, Aaram Centre for Quantum Software and Information School of Software Faculty of Engineering and Information Technology University of Technology SydneyNSW Australia Department of Computer Science and Engineering Texas A&M University Texas United States Department of Cyber Security Division of Software Science and Engineering Ewha Womans University Seoul Korea Republic of

Starting from the one-way group action framework of Brassard and Yung (Crypto'90), we revisit building cryptography based on group actions. Several previous candidates for one-way group actions no longer stand, due to progress both on classical algorithms (e.g., graph isomorphism) and quantum algorithms (e.g., discrete logarithm). We propose the general linear group action on tensors as a new candidate to build cryptography based on group actions. Recent works (Futorny-Grochow-Sergeichuk Lin. Alg. Appl., 2019) suggest that the underlying algorithmic problem, the tensor isomorphism problem, is the hardest one among several isomorphism testing problems arising from areas including coding theory, computational group theory, and multivariate cryptography. We present evidence to justify the viability of this proposal from comprehensive study of the state-of-art heuristic algorithms, theoretical algorithms and hardness results, as well as quantum algorithms. We then introduce a new notion called pseudorandom group actions to further develop group-action based cryptography. Briefly speaking, given a group G acting on a set S, we assume that it is hard to distinguish two distributions of (s, t) either uniformly chosen from S × S, or where s is randomly chosen from S and t is the result of applying a random group action of g ∈ G on s. This subsumes the classical decisional Diffie-Hellman assumption when specialized to a particular group action. We carefully analyze various attack strategies that support the general linear group action on tensors as a candidate for this assumption. Finally, we establish the quantum security of several cryptographic primitives based on the one-way group action assumption and the pseudorandom group action assumption. Copyright © 2019, The Authors. All rights reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Building an efficient intrusion detection system based on feature selection and ensemble classifier

arXiv

引用

arXiv 2019年

作者： Zhou, Yuyang Cheng, Guang Jiang, Shanqing Dai, Mian School of Cyber Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing China Jiangsu Provincial Key Laboratory of Computer Network Technology Southeast University Nanjing China National Key Laboratory of Science and Technology on Information System Security Beijing China

Intrusion detection system (IDS) is one of extensively used techniques in a network topology to safeguard the integrity and availability of sensitive assets in the protected systems. Although many supervised and unsupervised learning approaches from the field of machine learning have been used to increase the efficacy of IDSs, it is still a problem for existing intrusion detection algorithms to achieve good performance. First, lots of redundant and irrelevant data in high-dimensional datasets interfere with the classification process of an IDS. Second, an individual classifier may not perform well in the detection of each type of attacks. Third, many models are built for stale datasets, making them less adaptable for novel attacks. Thus, we propose a new intrusion detection framework in this paper, and this framework is based on the feature selection and ensemble learning techniques. In the first step, a heuristic algorithm called CFS-BA is proposed for dimensionality reduction, which selects the optimal subset based on the correlation between features. Then, we introduce an ensemble approach that combines C4.5, Random Forest (RF), and Forest by Penalizing Attributes (Forest PA) algorithms. Finally, voting technique is used to combine the probability distributions of the base learners for attack recognition. The experimental results, using NSL-KDD, AWID, and CIC-IDS2017 datasets, reveal that the proposed CFS-BA-Ensemble method is able to exhibit better performance than other related and state of the art approaches under several metrics. Copyright © 2019, The Authors. All rights reserved.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Distortion-free watermarking scheme for compressed data in columnar database 15

Distortion-free watermarking scheme for compressed data in c...

引用

15th International Joint Conference on e-Business and Telecommunications, ICETE 2018

作者： Yaqub, Waheeb Kamel, Ibrahim Aung, Zeyar Center for Cyber Security New York University Abu Dhabi United Arab Emirates Department of Electrical and Computer Engineering University of Sharjah Sharjah United Arab Emirates Department of Computer Science Khalifa University of Science and Technology Masdar Institute Abu Dhabi United Arab Emirates

ISBN: (纸本)9789897583193

Digital watermarking is an effective technique for protecting various databases against data copyright infringement, piracy, and data tampering in the columnar database. Increasing deployments of various database systems and their versatile applications have raised the need for better watermarking schemes that are tailored to the target database systems’ specific architecture. Most of the existing digital watermarking schemes do not take into consideration the side effects that watermarking might have on the database’s important characteristics such as data compression and overall performance. In this research, we propose a distortion-free fragile watermarking scheme for columnar database architecture without interfering its underlying data compression scheme and its overall performance. The proposed scheme is flexible and can be adapted to various distributions of data. We tested our proposed scheme on both synthetic and real-world data, and proved its effectiveness. Copyright © 2018 by SCITEPRESS – science and Technology Publications, Lda. All rights reserved

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：