Exploring teachers' perceptions on different CSCL script editing tools

Despite the apparent maturity of the learning design field, and the variety of tooling available to support it, adoption among the teacher community (one of its alleged main targets) is still low. There is a lack of research on teachers' perception and use of different technological learning design tools, as existing evaluations are often restricted to a single tool. In order to explore whether there are common factors hampering teacher adoption, and which tool features might appeal to different teachers, more studies involving multiple authoring tools are needed. This paper provides a first step in this direction, describing a mixed methods study performed around a professional development workshop with 18 university teachers from multiple disciplines. This workshop exposed teachers to two different authoring tools (WebCollage and EDIT2), as they learned to create computer-supported collaborative learning (CSCL) designs and implement them. The findings of our interpretive study (which included questionnaires, observations, or group discussion recordings) support the idea that there is no single tool or set of features that are globally perceived as better, although our evidence also highlights certain factors as important for participant teachers – amongst others, the integration of learning designs with the ICT platforms for enactment, as well as with other tools that they already use in their everyday practice.     

Protein design to understand peptide ligand recognition by tetratricopeptide repeat proteins

Protein design aims to understand the fundamentals of protein structure by creating novel proteins with pre-specified folds. An equally important goal is to understand protein function by creating novel proteins with pre-specified activities. Here we describe the design and characterization of a tetratricopeptide (TPR) protein, which binds to the C-terminal peptide of the eukaryotic chaperone Hsp90. The design emphasizes the importance of both direct, short-range protein-peptide interactions and of long-range electrostatic optimization. We demonstrate that the designed protein binds specifically to the desired peptide and discriminates between it and the similar C-terminal peptide of Hsp70.     

列车用CAN协议一致性测试平台的设计与实现

列车用CAN总线协议一致性测试是保证不同设备制造厂家生产的CAN通信设备之间实现互联、互通和互操作的前提。在对协议一致性测试原理和CAN总线协议特点进行简要分析的基础上,提出了针对CAN总线协议一致性测试的协同测试方法和相应的一致性测试内容,设计并构建了相应的一致性测试硬件平台,并对测试软件平台中可执行测试实例产生、测试执行、测试评估以及测试管理等诸多环节所涉及的基本功能软件进行了设计和实现,完成了CAN协议一致性测试的基本功能。实际运行和测试结果表明：所设计的测试平台达到了预期结果,为下一步列车用CAN总线协议的一致性测试打下了基础。     

基于一致性的小型四旋翼机群自主编队分布式运动规划

设计一种小型四旋翼无人机群起飞后自主形成正多边形编队的分布式运动规划方法.在四旋翼无人机的串级控制系统框架下,分布式编队控制器以简化agent模型为基础,同时采用平均一致性算法和有领导一致性算法,共同产生各无人机位置与偏航角的期望轨迹.讨论了达成最终协调目标队形的拓扑条件,并给出一种基于有向Hamilton环的通信拓扑设计方案.最后通过数值仿真验证了所提出算法的有效性.     

Finite-time consensus of multiple second-order dynamic agents without velocity measurements

This article considers the finite-time consensus of multiple second-order dynamic agents without velocity measurements. A feasible protocol under which each agent can only obtain the measurements of its position relative to its neighbours is proposed. By applying the graph theory, Lyapunov theory and the homogeneous domination method, some sufficient conditions for finite-time consensus of second-order multi-agent systems are established under the different kinds of communication topologies. Some examples are presented to illustrate the effectiveness of the theoretical results.     

Robust consensus algorithm for multi-agent systems with exogenous disturbances under convergence conditions

In this paper, a robust consensus algorithm is developed and sufficient conditions for convergence to consensus are proposed for a multi-agent system (MAS) with exogenous disturbances subject to partial information. By utilizing H_∞ robust control, differential game theory and a design-based approach, the consensus problem of the MAS with exogenous bounded interference is resolved and the disturbances are restrained, simultaneously. Attention is focused on designing an H_∞ robust controller (the robust consensus algorithm) based on minimisation of our proposed rational and individual cost functions according to goals of the MAS. Furthermore, sufficient conditions for convergence of the robust consensus algorithm are given. An example is employed to demonstrate that our results are effective and more capable to restrain exogenous disturbances than the existing literature.     

两种基于个体偏好集结的多属性群决策共识方法

针对多属性群决策中的共识问题, 提出两种使群体达成共识的方法. 假设群体决策的结果以从个体偏好通过集结得到的群体偏好为基础, 在使用算术加权集结算子和几何加权集结算子的条件下, 分别设计相应的共识达成算法, 并对算法的收敛性进行分析. 与已有方法相比, 所提出算法能够体现决策个体的差异和决策个体对群体的影响. 通过某市政图书馆空调系统安装方案的选择表明了所提出方法的合理性和可行性.

     

基于中位数的用户信誉度排名算法

针对推荐系统易受Spammer攻击的影响,从而导致对象的实际得分不准确的问题,提出基于中位数的用户信誉度排名算法。通过衡量用户信誉度调整用户打分权重,根据中位数具有不易受极端打分影响的特性,选取用户打分与对象得分差距的中位数作为降低用户信誉度的标准,不断迭代调整用户信誉度以及最终得分直至收敛。在多个真实数据集上的运行结果证明,相比现有排名算法,该算法具有更合理的信誉度分布和更高的排名结果准确度,通过该算法预处理后的数据集在SVD++上运行可以得到更低的均方根误差。     

基于广告制作流程探讨平面广告设计课程的教学

文章主要是从平面广告的制作流程以及图形图像设计软件的特点出发,针对当前平面广告教学中遇到的问题。对平面广告的教学方法进行实践探讨。首先依据平面广告制作流程的不同模块让学生确立个人的学习目标和小组共同愿景,课程教学以完成相关参赛作品为最后目标,实施过程是课上课下相互结合,课上的案例针对课下的小组协作学习遇到的问题提供指导。课程的关键是要进行小组成果的展示与总结。     

Robust consensus for uncertain multi‐agent systems with discrete‐time dynamics

This paper investigates robust consensus for multi‐agent systems with discrete‐time dynamics affected by uncertainty. In particular, the paper considers multi‐agent systems with single and double integrators, where the weighted adjacency matrix is a polynomial function of uncertain parameters constrained into a semialgebraic set. Firstly, necessary and sufficient conditions are provided for robust consensus based on the existence of a Lyapunov function polynomially dependent on the uncertainty. In particular, an upper bound on the degree required for achieving necessity is provided. Secondly, a necessary and sufficient condition is provided for robust consensus with single integrator and nonnegative weighted adjacency matrices based on the zeros of a polynomial. Lastly, it is shown how these conditions can be investigated through convex programming by exploiting linear matrix inequalities and sums of squares of polynomials. Some numerical examples illustrate the proposed results. Copyright © 2013 John Wiley & Sons, Ltd.