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.     

Synchronization for linear singularly perturbed complex networks with coupling delays

This paper is concerned with the synchronization problem about linear singularly perturbed complex network system with coupling delay. The sufficient delay-dependent conditions for the synchronization of the network are established by introducing an equivalent network system with the Lyapunov stability theory. These conditions, which are formulated in terms of linear matrix inequalities, can be solved efficiently by the LMI toolbox of MATLAB. A simulation example is provided to show the validity of the proposed the synchronization conditions of the whole network.     

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.     

Redundancy filtering and fusion verification for video copy detection

Multimedia Systems - Recently, the frame fusion based video copy detection scheme provides a possibility to detect copies in a continuous query video stream. However, its computational complexity...     

开放式数控系统网络接口技术研究

数控系统网络接口技术是实现数控机床实时信息采集的基础,是确保数控系统开放式、网络化及智能化的关键技术.通过对数控系统传统信息采集接口和基于网络的MTConnect标准的对比研究,基于后者在兼容性、跨平台性、可读性方面存在的优势,围绕开放式数控系统体系框架,本文设计一种基于MTConnect标准的开放式数控系统网络采集接口.同时,为兼容传统信息采集接口,提出一种可拓展的通用接口架构,阐述架构间模块的功能及互联方式,并从数控系统数据项抽取、数据项适配器(Adapter)、接口代理(Agent)等方面重点阐述接口的设计.最后,在自主研发的数控系统上实现网络接口,并对相关时间延迟开展了测试与分析,表明了该通用接口的正确性与实用性.