Socially augmented argumentation tools: Rationale,design and evaluation of a debate dashboard

Collaborative Computer-Supported Argument Visualization (CCSAV) is a technical methodology that offers support for online collective deliberation over complex dilemmas. As compared with more traditional conversational technologies, like wikis and forums, CCSAV is designed to promote more critical thinking and evidence-based reasoning, by using representations that highlight conceptual relationships between contributions, and through computational analytics that assess the structural integrity of the network. However, to date, CCSAV tools have achieved adoption primarily in small-scale educational contexts, and only to a limited degree in real world applications. We hypothesise that by reifying conversations as logical maps to address the shortcomings of chronological streams, CCSAV tools underestimate the importance of participation and interaction in enhancing collaborative knowledge-building. We argue, therefore, that CCSAV platforms should be socially augmented in order to improve their mediation capability. Drawing on Clark and Brennan influential Common Ground theory, we designed a Debate Dashboard, which augmented a CCSAV tool with a set of widgets that deliver meta-information about participants and the interaction process. An empirical study simulating a moderately sized collective deliberation scenario provides evidence that this experimental version outperformed the control version on a range of indicators, including usability, mutual understanding, quality of perceived collaboration, and accuracy of individual decisions. No evidence was found that the addition of the Debate Dashboard impeded the quality of the argumentation or the richness of content.     

机载光测设备过顶跟踪方法

在分析了地平式跟踪架、双轴式跟踪架优缺点基础上,本文论述了一种基于机载光测设备的过顶跟踪技术,它结合了地平式跟踪架、双轴式跟踪架的优点,能够对过顶盲区的目标进行有效的跟踪。外场试验表明,该跟踪方法简单,跟踪精度3′,满足技术指标要求。     

Transformations for early reply and forward message passing mechanisms

Message passing notations (language, package, etc.) typically include some form of asynchronous or synchronous invocation. In a synchronous invocation, the invoker waits for the invocation's servicer to pass back results. Some message passing notations also include early reply or deferred reply (including forwarding), which alters how and when the servicer passes back its results; this additional flexibility is useful in realistic applications. It is well known how to transform a synchronous invocation into only asynchronous invocations. This paper extends such transformations to early reply and forward. This paper also describes the use of these transformations within the implementations of programming notations. Using the transformation simplifies the implementation without significantly affecting run‐time costs. Copyright © 2015 John Wiley & Sons, Ltd.     

回采巷道过断层施工技术

受断层影响,巷道过断层期间掘进速度缓慢,影响采掘接替和矿井生产效率。为了更好地促进矿井生产,以23上04轨顺掘进为研究对象,采用FLAC 3D软件模拟巷道过断层时巷道围岩变形量和塑性区范围,并将围岩划分为正常围岩、过渡带和破碎带3部分。根据模拟结果可知,围岩变形量和塑性区范围都在过渡带开始增大,在破碎带达到最大值。巷道采用后退卧底法过断层,并对断层破碎带及时采用锚网索、注浆、U型钢棚进行支护,通过联合支护相互配合,可以共同提高巷道支护强度,增强巷道顶帮抗变形能力。     

基于TOULMIN模型的协商研讨系统的设计与实现

为缩小形式化模型与系统实现之间的差距,提供一种科学有效的决策方式,提出了基于Toulmin模型的协商研讨支持系统.经过对系统功能需求的分析,构建系统体系框架,指出主要功能模块,并对各个功能模块进行了分析与设计,在软硬件环境的支持下开发并实现了基于Toulmin模型的协商研讨支持系统,最后在该协商研讨平台进行了实例演示分析.     

冷轧平整机组延伸率自动控制系统

通过对平整机组延伸率控制系统的分析,对延伸率设定值的给定、延伸率的控制模式进行了探讨。     

道路规划设计中的车辆换算初探

本文对我国道路规划设计中的车辆换算进行了初步探讨.文中假设车辆的当量换算值不仅与通行能力有关,也与车辆对道路的动态面积占用有关;给出了基本换算公式,提出了对于不同的道路服务水平采用相应的小客车当量换算值的建议,并给出相应的建议值.文中还给出了自行车的小客车当置换算值.     

包头市道路交叉口的交通改善及效果

通过对包头市主要道路交叉口的调查与分析,介绍了交叉口交通改善的措施,并对其效果进行了评价.     

A bivalency proof of the lower bound for uniform consensus

Bivalency argument is a widely-used technique that employs forward induction to show impossibility results and lower bounds related to consensus. However, for a synchronous distributed system of n processes with up to t potential and f actual crash failures, applying bivalency argument to prove the lower bound for reaching uniform consensus is still an open problem. In this paper, we address this problem by presenting a bivalency proof that the lower bound for reaching uniform consensus is (f+2)-rounds where 0?f?t−2.