水热合成刚玉微粉粉体性能与烧结性能研究

通过对水热合成刚玉微粉和电熔刚玉微粉粉体性能和烧结性能的实验研究,表明水热合成刚玉微粉在化学成分、晶体形态、粒度分布、磨削性能和烧结性能等指标上优于电熔刚玉.     

轴类零件精密校直工艺理论及应用研究

文章分析了轴类零件的基本弯曲形式并运用弹塑性力学的基础理论对反弯压点方法的校直工艺理论进行了研究。采用了一种基于行程控制的校直工艺计算方法。在自行研制开发的YH40-10型自动精密液压校直机进行校直实验。并将理论计算结果和实验结果、ANSYS非线性有限元结果对比分析，结果表明此计算方法是有效可行的。     

AZ91D合金SIMA形变组织与共晶熔化激活能的研究

研究了SIMA法制备半固态AZ91D镁合金坯料过程中形变率对形变组织的影响, 并采用DSC技术研究了形变率与共晶熔化激活能的关系.结果表明:随着形变率的增大,合金的原始组织由树枝晶演变为碎块晶,晶粒内存在位错、孪晶缺陷;合金的共晶熔化激活能随形变率的增大而变小,当形变率达到40%时,共晶熔化激活能下降很少;共晶熔化开始温度随形变率的增大略有下降.     

灰铸铁组织对弹性模量的影响

研究了CE、Si/C、石墨形态、基体等对灰铸铁弹性模量的影响。     

DOBNet: exploiting the discourse of deception behaviour to uncover online deception strategies

Online deception is fuelled by the escalated penetration of the Internet and social media. As the threat of online deception increases, understanding deception behaviour and underlying strategies is having a greater social impact. The verbal behaviour of online deception has recently been extended to the discourse level; nevertheless, discourse behaviours have been examined in isolation without referring to other behaviours in the discourse. By conceptualising the discourse of online behaviour as a social network (DOBNet), this research investigates possible impacts of deception intent on the central structures of DOBNet at three different levels: the discourse behaviour, subnetwork, and whole network. The empirical results of discourse network analysis and statistical tests provide partial support for each of the hypothesised effects. The findings not only demonstrate the efficacy of discourse in distinguishing deceivers from truth-tellers but also extend deception theories by confirming deception strategies from the perspective of discourse network and by uncovering unique characteristics of online deception strategies.     

Dual–primal proximal point algorithms for extended convex programming

This paper presents a class of dual–primal proximal point algorithms (PPAs) for extended convex programming with linear constraints. By choosing appropriate proximal regularization matrices, the application of the general PPA to the equivalent variational inequality of the extended convex programming with linear constraints can result in easy proximal subproblems. In theory, the sequence generated by the general PPA may fail to converge since the proximal regularization matrix is asymmetric sometimes. So we construct descent directions derived from the solution obtained by the general PPA. Different step lengths and descent directions are chosen with the negligible additional computational load. The global convergence of the new algorithms is proved easily based on the fact that the sequences generated are Fejér monotone. Furthermore, we provide a simple proof for the O(1/t) convergence rate of these algorithms.     

一种基于OpenFlow的SDN访问控制策略实时冲突检测与解决方法

软件定义网络SDN(Software-Defined Networking)是由美国斯坦福大学Clean Slate研究组提出的一种新型网络创新架构,可通过软件编程的形式定义和控制网络,其控制平面和转发平面分离及开放性可编程的特点,为新型互联网体系结构研究提供了新的实验途径,也极大地推动了下一代互联网的发展.OpenFlow是SDN的主要协议,定义了SDN控制器与交换机之间的通信标准.目前,很多基于OpenFlow的SDN设备已经在实际中得到了部署.但是,基于OpenFlow的SDN却面临很多安全挑战.其中一个重要的挑战是如何建立一个安全可靠的SDN防火墙应用.由于OpenFlow协议的无状态性,现有的SDN防火墙可以被通过改写交换机中的流表项轻松绕过.针对这一安全威胁,作者提出了基于Flowpath的实时动态策略冲突检测与解决方法.通过获取实时的SDN网络状态,能够准确地检测防火墙策略的直接和间接违反,并且一旦发现冲突,可以基于Flowpath进行自动化和细粒度的冲突解决.最后,作者在开源控制器Floodlight上实现了一个安全增强的防火墙应用FlowVerifier,并基于Mininet对FlowVerifier的性能进行了评估.结果表明FlowVerifier能够检测和自动化地解决SDN网络中由于流表改写而引入的策略冲突及其带来的安全威胁.     

一种高精度车载坡度检测仪的研制

针对现有车载坡度检测技术缺陷,提出了一种高精度车载道路坡度检测仪的设计及实现方案。该检测仪由主控节点和多个检测节点组成,检测节点通过三轴加速度传感器检测与地面倾角,并将其发送给主控节点;主控节点收集各检测节点数据,对其进行数据融合得到坡度的最优估计值。通过仿真和实验验证了方案的可行性,设计成果可广泛应用于车载导航系统中。     

Online algorithms for scheduling two parallel machines with a single server

We consider an online scheduling problem on two identical parallel machines with a single server. Jobs arrive one by one and each job has to be loaded by the server before being processed on one of the machines, and unloaded immediately by the server after its processing. Both loading and unloading times are equal to one time unit. The goal is to minimize the makespan. For the variant of the problem involving both loading and unloading operations, we present an online algorithm with competitive ratio of 5/3. For the variant with loading operation only, we show that the competitive ratio of list scheduling is at least 8/5 and provide an improved online algorithm with competitive ratio of 11/7. Finally, we discuss the lower bounds for these problems. We show that both variants have a lower bound of 3/2. Furthermore, we show that the lower bound of the first variant is at least 8/5 if the online algorithm satisfies a certain constraint.