课程文献中心 更多>>

关键词： 区块链技术   应用探索   金融领域   数据结构  

摘要： 随着时代的进步,中国科学技术不断发展,同时,人们的生活水平不断提高,使得近些年来网购行业发展迅猛,进而推动了物流行业的快速发展。区块链技术的应用已经不仅仅是货币类专属,现已深入到各大领域中,特别是区块链技术在物流领域中应用取得了良好的效果,为物流领域更好的发展提供了技术基础。基于此,对区块链技术进行简要概述,并提出区块链技术在物流领域中的应用策略。

关键词： Range majority and minority   Dynamic data structures   Compact data structures  

摘要： In the range alpha-majority query problem, we are given a sequence S[1 horizontal ellipsis n] and a fixed threshold alpha is an element of(0,1), and are asked to preprocess S such that, given a query range [i horizontal ellipsis j], we can efficiently report the symbols that occur more than alpha(j-i+1) times in S[i horizontal ellipsis j], which are called the range alpha-majorities. In this article we describe the first compressed dynamic data structure for range alpha-majority queries. It represents S in compressed space-nHk+o(nlg sigma) bits for any k=o(lg sigma n), where sigma is the alphabet size and Hk <= H0 <= lg sigma is the kth order empirical entropy of S-and answers queries in amortized time. We then show how to modify our data structure to receive some beta >=alpha at query time and report the range beta-majorities in time, without increasing the asymptotic space or update-time bounds. The best previous dynamic solution has the same query and update times as ours, but it occupies O(n) words and cannot take advantage of being given a larger threshold beta at query time. We also design the first dynamic data structure for range alpha-minority-i.e., find a non-alpha-majority that occurs in a range-and obtain space and time bounds similar to those for alpha-majorities. We extend the structure to find Theta(1/alpha)-minorities at the same space and time cost. By giving up updates, we obtain static data structures with query time O((1/alpha)lglgw sigma) for both problems, on a RAM with word size w=omega(lgn) bits, without increasing our space bound. Static alternatives reach time O(1/alpha), but they compress S only to zeroth order entropy (H0) or they only handle small values of alpha, that is, lg(1/alpha)=o(lg sigma).

关键词： 数据结构   JAVA语言  

ISBN: (纸本)9787302551355

摘要： 本书详细给出了《教程》中所有练习题和上机实验题的解题思路和参考答案,以及在线编程题的AC代码。书中练习题和实验题不仅涵盖数据结构课程的基本知识点,还融合了各个知识点的运用和扩展,学习、理解和借鉴这些参考答案是掌握和提高数据结构知识的最佳捷径。

关键词： Wireless Body Area Networks (WBANs)   Cloud computing   Authenticated data structures   Cyber-physical system (CPS)   Healthcare  

摘要： Nowadays the healthcare system is undergoing a paradigm shift to integrate cloud computing and Internet-of-Things with physical medical equipments into a distributed network ensuring real-time and near real-time data transfer from the physical world to the cyber space for computation, storage and analysis. Namely, the healthcare system can be seen as a cyber-physical system (CPS) for patientcentric healthcare applications and services, called Health-CPS, based on cloud computing, Wireless Body Area Networks (WBANs) and big data analytics technologies. Health-CPS has played an important role in healthcare for improving treatment quality and patients' assistance speed. However, despite these advantages, the development of Health-CPS will be restricted by serious security threats, especially the security threats to the healthcare-related data. Because Health-CPS forward Electronic health records (EHRs), biomedical signals of patients and public health to the cloud which may operate in distributed and hostile environments, novel security mechanisms are required to prevent malicious interactions to the storage infrastructure. Therefore, the cloud providers must take strong security measures to protect the integrity and privacy of the healthcare related data. But most of the researchers do not simultaneously pay attention to both integrity and privacy for Health-CPS. Therefore, we proposed a privacy-preserving data integrity verification model by using lightweight streaming authenticated data structures for HealthCPS. We have given the design idea, architecture, formal definition, security definition, communication protocols of our model in detail. The key construction processes of our model which include initialization, data appending, scale expansion, data query and verification, are also given in this paper. Finally, the security and performance analysis show that our scheme is not only secure but also efficient. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Parallel programming   Semantic violation detection   C plus plus contracts   Lock-free data structures  

摘要： The use of synchronization mechanisms in multithreaded applications is essential on shared-memory multi-core architectures. However, debugging parallel applications to avoid potential failures, such as data races or deadlocks, can be challenging. Race detectors are key to spot such concurrency bugs;nevertheless, if lock-free data structures are used, these may emit a significant number of false positives. In this paper, we present a framework for semantic violation detection of lock-free data structures which makes use of contracts, a novel feature of the upcoming C++20, and a customized version of the ThreadSanitizer race detector. We evaluate the detection accuracy of the framework in terms of false positives and false negatives leveraging some synthetic benchmarks which make use of the SPSC and MPMC lock-free queue structures from the Boost C++ library. Thanks to this framework, we are able to check the correct use of lock-free data structures, thus reducing the number of false positives.

关键词： 数据结构  

ISBN: (纸本)9787551714747

摘要： 本书是学习数据结构及算法的大学参考教材。内容包括: 绪论 ; 线性表 ; 栈和队列 ; 串和数组及广义表 ; 树和二及树 ; 图 ; 查找 ; 排序。

关键词： 数据结构   软件工具  

ISBN: (纸本)9787111657187

摘要： 本书选择Python作为描述语言，在选材与编排上，贴近当前普通高等院校“数据结构”课程的现状和发展趋势，内容难度适度，突出实用性和应用性。在内容选取与结构上，本书并未对各种数据结构面面俱到，而是通过分类和讲解典型结构，使读者形成对数据结构的宏观认识。根据内容侧重，本书共分为8章，分别为绪论、线性表、栈和队列、串和数组、树形结构、图、内排序和查找。

关键词： 数据结构   软件工具  

ISBN: (纸本)9787111657187

摘要： 本书选择Python作为描述语言, 在选材与编排上, 贴近当前普通高等院校“数据结构”课程的现状和发展趋势, 内容难度适度, 突出实用性和应用性。在内容选取与结构上, 本书并未对各种数据结构面面俱到, 而是通过分类和讲解典型结构, 使读者形成对数据结构的宏观认识。根据内容侧重, 本书共分为8章, 分别为绪论、线性表、栈和队列、串和数组、树形结构、图、内排序和查找。

关键词： Range query   Heavy path decomposition   Suffix tree  

摘要： Let T[1, n] be a text of length n and T[i, n] be the suffix starting at position i. Also, for any two strings X and Y, let LCP(X, Y) denote their longest common prefix. The range-LCP of T w.r.t. a range [alpha, beta], where 1 <= alpha < beta <= n is rlcP(alpha, beta) = max{vertical bar LCP(T[i, n], T[j, n])vertical bar vertical bar i not equal j and i, j is an element of [alpha,beta]} Amir et al. [2] introduced the indexing version of this problem, where the task is to build a data structure over T, so that rlcp(alpha, beta) for any query range [alpha, beta] can be reported efficiently. They proposed an 0 (nlog(1+is an element of) n) space structure with query time 0 (log log n), and a linear space (i.e., 0 (n) words) structure with query time 0 (delta loglogn), where delta = beta - alpha +1 is the length of the input range and is an element of > 0 is an arbitrarily small constant. Later, Patil et al. [5] proposed another linear space structure with an improved query time of 0 root delta(log(is an element of) delta). This poses an interesting question, whether it is possible to answer rlcp(., .) queries in poly-logarithmic time using a linear space data structure. In this paper, we settle this question by presenting an 0 (n) space data structure with query time 0 (log(1+is an element of) n) and construction time 0 (n log n). (C) 2020 Elsevier B.V. All rights reserved.