C语言中动态链表的应用研究

链表是一种常见的重要的数据结构。在C语言程序设计中,链表也起到非常重要的作用,在实际应用中得到广泛的应用。链表又分为静态链表和动态链表两类。本文将主要针对动态链表的应用进行分析研究,并用C语言实现链表的定义,创建和常用的链表操作的实现。     

Reduzierung von Prozeßstauungen vor kritischen Abschnitten mittels Teillistensperrung

Processes execute in critical sections, if they acces a common data base (list). Many solutions of the necessary mutual exclusion so far lock the total list (total list locking) by the processP ^*, which is authorized to access, whereas all other processesP _i demanding access have to wait untilP ^* has left the critical section. However, in the following proposal only certain subsets of the list are locked for a single accessing process (partial list locking), whereas the rest of the list remains accessable for further processes. The organization of this solution is presented on the basis of typical list operations and known list types; finally simulation results to the behaviour of partial list locking in comparison with total list locking are presented.     

A class of hybrid list file organizations

A new class of hybrid list organizations is proposed in this paper. A hybrid list organization of length parameter Lth is to store a key list as an inverted list or as a multilist depending on whether the list length is larger than Lth or not. By varying the value of Lth one obtains a spectrum of list structures. The pure inverted list and pure multilist organizations are included in the class as degenerate cases. Efficiencies of file organizations in a particular data base system are dependent upon the data base characteristics. Evaluations through analysis and simulation show that, for some realistic data base systems, there exist non-degenerate hybrid list organizations which are indeed superior in performance.     

Distributed-directory scheme: Stanford distributed-directoryprotocol

The Stanford distributed-directory (SDD) cache-coherence protocol, based on a singly linked list of distributed directories, is examined. Sharing-list additions and removals are explained diagramatically. Reads, writes, pending signals, replacement, and synchronization are discussed. Replacing lines linked in a list is done by invalidating the lower part of the list. A doubly linked list may be used to patch the list in case of replacements. However, in practice, performance improvement depends on the list lengths and access patterns. A distributed-directory cache-coherence protocol allows efficient implementation of locks at minimal extra cost. The SDD protocol allows a lock implementation that minimizes network traffic     

巧用构造单链表的算法

在数据结构这门学科中,都不会丢下这一环节,那就是单链表的建立。先来介绍一下单链表的建立,明白其思路后,再巧用其算法,很快的就能构造出单循环链表和单链表的逆序的算法。     

巧用构造单链表的算法

在数据结构这门学科中，都不会丢下这一环节，那就是单链表的建立。先来介绍一下单链表的建立，明白其思路后，再巧用其算法．很快的就能构造出单循环链表和单链表的逆序的算法。     

链式存储结构上直接插入排序算法的研究与实现

线性表上进行的直接插入排序法是一种较简单的内部排序算法,计算机工作者经常研究和讨论顺序表中直接插入排序算法的实现及其改进,很少研究直接插入排序法在链表上的实现。本文讨论了直接插入排序在单链表上和静态链表上的算法及实现过程。最后分析了算法时间复杂度和空间复杂度。     

圆形窗口上一般多边形的内/外裁剪算法

本文详尽地分析了圆形窗口上一般多边形（凹／凸）的内／外裁剪问题,并通过构造顶交表、圆交表、入点表、出点表等给出了一般多边形（凹／凸）的内／外裁剪算法。     

BitTorrent流量控制方案

设计并实现了一个克隆Tracker以减少互联网中BitTorrent (BT)流量占用过多进出口带宽的问题。当BT客户端向Tracker发出列表请求时,Peers列表请求数据包被路由到克隆Tracker。克隆Tracker使用不同于原Tracker的列表选择算法,代替原Tracker向BT客户端返回Peers列表。克隆Tracker从原Tracker中获得并更新列表。在校园网的实地测试结果表明：在不修改BT客户端和原Tracker服务器的条件下,克隆Tracker能够有效控制所测网段BT流量占用的进出口带宽。     

Are online discussions enough to constitute communities of practice in professional domain? A case study of ergonomics’ practice in France

The goal of our research is to characterise how online discussions may provide support to the construction of a Virtual Community of Practice, as a way to develop a profession. To do so, we investigate the functions (sharing information, resources or experience) and the nature of knowledge (e.g. methodology and trends of ergonomics) exchanged on Ergoliste, a French-speaking online mailing list dedicated to ergonomics, as well as the status of participants. Our results reveal that the list has both informative and formative functions as it deals with sharing/seeking information, resources and experience, mainly between experts and novices in ergonomics, exchanging about situated and circumstantiated aspects of practices. Finally, these results are complemented by interviews with list participants which on the one hand confirm the main functions of the list and, on the other hand, reveal divergence in the perception that list participants belonging to a “community” structured only around this list. This research opens some prospects for more longitudinal investigations of the contents of the list, to analyse more deeply how the list can be viewed as an efficient tool to co-elaborate knowledge about ergonomics and its development.     

Prim最小生成树算法的动态优化

根据Prim最小生成树算法的设计思想,设计了独特CloseEdge型closedge向量表示U到V-U集合中的边,用上三角法建立了无向图的邻接多重双向链表,构造了链接closedge向量和邻接多重双向链表表结点的VU集合双向链。查找最小权值的边仅在VU集合双向链上进行,且当顶点被加入U集合后,常量时间删除其对应的VU集合双向链和邻接多重双向链表中的结点,使得最小生成树的生成达到极小化,其语句执行频度平均为e。     

安卓手机数据结构演示软件开发技术

针对数据结构相对抽象的特点,结合实际情况,通过利用文字、图像、动画等形式描述数据结构的算法特点,在安卓手机平台上开发数据结构演示软件。整个演示软件使用下拉列表控制方式,每个列表项包括若干选项。每个列表项对应一个选择或一个子列表。系统一直处于选择菜列表或执行某一被选列表项状态,直到退出演示软件。该数据结构演示软件包含了线形表、堆栈、树、图等基本数据结构的概念以及实例分析的展示。     

链式存储结构上选择排序算法的研究与实现

线性表上进行的选择排序法是一种较简单的内部排序算法,计算机研发人员经常研究和讨论顺序表中选择排序算法的实现及其改进。讨论了选择排序在单链表上和静态链表上的算法及实现过程,分析了算法时间和空间复杂度。     

基于IMS移动终端的即时通信联系人列表管理器

本文主要介绍基于IMS移动终端的即时通信联系人管理器,该管理器主要由XML搜索器、XML解析器、XML管理模块、XCAP通信模块构成。分析联系人列表中联系人的XML片段的定长特性,设计了XML搜索器,实现了节点的快速查找。在XML管理器模块中,以节点路径和消息片段的方式提交联系人修改,减少XML消息传输的字节数,从而提高了消息的传输速率。     

一种基于变量可达向量的链表抽象方法

提出了一种链表抽象表示方法.该方法隐式存储链表结点之间的边信息,并采用了一种紧致的链表状态表示,存储开销较低,且维护了链表长度信息,精确度较高.具体而言,根据变量对链表结点的可达性质定义了变量可达向量,采用带计数的变量可达向量集描述链表的形态及数量性质,并定义了基本链表操作的抽象语义.通过简单扩展,该方法可以建模包括环形链表在内的所有单向链表.最后,为了验证该链表抽象方法的正确性,在符号执行框架中进行实验,并对常见链表操作程序的运行时错误、长度相关性质等关键性质进行了分析与验证.     

A complexity-reduced fast successive cancellation list decoder for polar codes

A multi-bit decision for polar codes based on a simplified successive cancellation (SSC) decoding algorithm can improve the throughput of polar decoding. A list algorithm is used to improve the error-correcting performance. However, list decoders are highly complex compared with decoders without a list algorithm. In this paper, a low-complexity list decoder is proposed, where path-splitting operations for a multi-bit decision can be avoided, if the decoding reliability exceeds a threshold. The threshold is determined based on the reliability of subchannels and positions of decoding nodes. Path splitting rules are designed for multi-bit decision processes, and a complexity-reduced list decoder is proposed based on this. Results show that the number of survival paths can be greatly reduced at the cost of negligible deterioration in block error performance. Thus, the computational complexity can be significantly reduced, especially for a high signal-to-noise ratio (SNR) region.     

Josephus问题的算法设计与应用研究

Josephus问题是组合数学的发展源头之一。关于Josephus问题的描述形式甚多。文章通过实验和分析,总结了一个通用性的描述形式,并给出了基于循环链表的算法设计。算法的数据源从文本文件中获取,增强了算法的实用性;根据数据元素值的递增顺序建立循环链表,能够有效地分类数据,使Josephus数据序列均匀分布且不重复。文章还给出了Josephus问题的若干个应用实例,包括将Josephus问题应用于通用试题库的组卷算法和找出一组数据中某个指定范围的数据序列等。     

ROBUST AND NONLINEAR CONTROL LITERATURE SURVEY (No. 28)

In order to keep readers up‐to‐date, the journal will contain a list of recently published journal articles relevant to the fields of robust and nonlinear control six times a year. This list is compiled from a wide range of journals. Please note that even though the list has been broadly categorized these classifications are by no means strict, and are there to assist the reader. Please also note that inclusion in the list is not an endorsement of a paper's quality. If you have any suggestions or comments, please e‐mail Dr. Jiqiang Wang at jiqiang.wang@nuaa.edu.cn .     

基于启发式搜索的浮点表达式设计空间探索方法

为了提高浮点表达式设计空间的探索效率,提出一种基于启发搜索的浮点表达式设计空间探索方法。在每次迭代过程中首先对非支配表达式的设计空间进行探索,同时将非支配表达式和可支配表达式分别添加到非支配列表和可支配列表中。当迭代完成后对可支配列表中的表达式进行探索,从中选择非支配的表达式,并对其邻域进行探索。将新的非支配表达式添加到非支配列表中,有效提高了非支配表达式的多样性和随机性。最后再次对非支配列表进行探索,得到最终的等价表达式,并进一步提高最优表达式的性能。与现有的浮点表达式设计空间的探索方法相比较,所提出的方法使计算精度提高了2%~9%,并减少了5%~19%的计算时间和4%~7%的资源消耗。实验结果表明,该方法可有效提高空间探索效率。     

一个新的证书吊销列表设计方案

通过对证书员销列表中吊销证书条目字段重新编码在，结合分段的思想，提出一个新的证书吊销信息分发方案Compact CRL，新方案大大简化了CRL的大小，节省了证书吊销信息分发所需要的带宽。