基于真实物体模型的空间对象检索技术研究

针对MBR模型只适合检索联通的空间对象且查准率较低的问题,建立了真实物体模型,依据空间对象在平面上的几何投影的方法建立真实物体模型,采用深度方向关系矩阵表示真实物体模型之间的方向关系,利用该模型可以很好地将矩形代数良好的计算性质应用于空间对象检索技术中,简化了检索的过程,实现了矩形代数与真实物体模型的有效结合,使其检索的范围变的更加广泛.同时提出了一种改进的R*树算法,有效地提高了真实物体模型的检索精确度,降低了错误匹配的发生率.实验结果表明,该算法可以有效地提高检索的查准率,提高空间对象检索的效率.     

Robust observer–controller compensator design using the loop shaping design procedure and the algebraic method

This paper investigates robust observer‐controller compensator design using Vidyasagar's structure (VS). VS has a unit matrix parameter H similar to the Q parameter for the Youla–Kucera parameterization. VS can be designed based on the left coprimeness of the central controller in the H_∞‐loop shaping design procedure (H_∞‐LSDP) and therefore can preserve the intrinsic properties of the H_∞‐LSDP. This paper introduces algebraic methods to simplify the design of H in the VS controller by solving specific algebraic equations. In particular, the algebraic design of H can achieve two things. First, a dynamic H adjusts the tracking performance and yields the integral action. Second, a dynamic H rejects the input and output sinusoidal disturbances with known frequencies. These attributes are indications of the flexibility of the proposed method since the output‐feedback controller design of the H_∞‐LSDP cannot easily deal with such conditions. This paper discusses the achieved loop and the closed‐loop behavior of the system with VS, and also gives two numerical examples. The first example shows that the proposed method results in a better design in many aspects than the resulting from H_∞‐LSDP. The second example shows the application of the proposed method to rejecting input and output step disturbances, and input and output multiple sinusoidal disturbances, for which the H_∞‐LSDP can hardly be used. Copyright © 2009 John Wiley & Sons, Ltd.     

Constrained multivariable stable predictive control based on Toeplitz equation

A stable constrained multivariable predictive control algorithm based on the Toeplitz predictive equation is presented. An analytical method for transformation between left and right coprime factorization of multivariable system is put forward, and then an unconstrained control law and its stable condition are given. Furthermore, for the constrained multivariable controlled system, a predictive controller and its asymptotically stable condition are presented and proved. Finally, the constrained receding horizon optimization is transformed into a typical linear matrix inequality (LMI) problem and solved. The detailed control algorithm is depicted in a numerical example, and the simulation results reveal the effectiveness and practicability of the presented algorithm. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

基于二次TF* IDF的互信息文本特征选择算法研究

在分析传统互信息法缺陷的基础上,提出一种基于二次TF*IDF的互信息特征选择算法,对仅在一个类别中出现的特征词的重要程度给予再次的衡量,解决了互信息值相等而无法进行有效特征选择的问题。利用贝叶斯分类器对该方法进行验证的结果表明该算法在文本分类效率和正确率上比原有方法有一定的提高。     

A local construction of the Smith normal form of a matrix polynomial

We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant separately and then combines them into a global Smith form, whereas other algorithms apply a sequence of unimodular row and column operations to the original matrix. The performance of the algorithm in exact arithmetic is reported for several test cases.     

三维分层航迹规划算法研究与仿真

针对传统A*算法在飞行器航迹规划过程中产生节点较多,搜索时间较长等缺点,提出了一种改进的A*算法.该算法采用分层思想,将局部规划与全局规划相结合,并对代价函数进行了改进,在保证航迹优化的基础上,提高了搜索效率.仿真结果表明,运用该算法能够规划出符合工程应用的飞行器航迹.     

Algorithms to Separate $\{0,\frac{1}{2}\}$ -Chvátal-Gomory Cuts

Chvátal-Gomory cuts are among the most well-known classes of cutting planes for general integer linear programs (ILPs). In case the constraint multipliers are either 0 or , such cuts are known as -cuts. It has been proven by Caprara and Fischetti (Math. Program. 74:221–235, 1996) that separation of -cuts is -hard. In this paper, we study ways to separate -cuts effectively in practice. We propose a range of preprocessing rules to reduce the size of the separation problem. The core of the preprocessing builds a Gaussian elimination-like procedure. To separate the most violated -cut, we formulate the (reduced) problem as integer linear program. Some simple heuristic separation routines complete the algorithmic framework. Computational experiments on benchmark instances show that the combination of preprocessing with exact and/or heuristic separation is a very vital idea to generate strong generic cutting planes for integer linear programs and to reduce the overall computation times of state-of-the-art ILP-solvers.     

TPR^＊树索引构建及其动态维护方法

提出一种新的TPR^＊树索引构建方法,在根节点层利用速度矢量对移动对象集进行划分,根据速度矢量的大小将移动对象聚集到不同子节点中,并逐层构建TPR^＊树。在根节点层用溢出桶存储插入的移动对象记录,同时对TPR^＊树索引进行批量插入更新,以减少其插入更新维护的代价。实验结果表明,该方法是可行的。     

Unfriend or ignore tweets?: A time series analysis on Japanese Twitter users suffering from information overload

In recent years, with increased opportunities to post content on social media, a number of users are experiencing information overload in relation to social media use. This study addresses how Japanese Twitter users suffering from information overload cope with their stress, focusing on two actions: (1) The “unfriending” activities and (2) The changes in tweet processing methods. Objective data, such as numbers of friends, were collected through Twitter's open Application Programming Interfaces (APIs), and subjective data, such as perceived information overload and tweet processing methods, were collected through a web-based survey as a panel dataset (n = 778). The results demonstrated that although users experience information overload, they continue to increase their number of friends, and that the users who experience information overload modify their usage habits to avoid seeing all received tweets. In short, users do not choose a strategy to reduce the absolute number of received tweets, but only a strategy that involves changing the processing method of the received tweets.     

Prevalence and personality correlates of Facebook bullying among university undergraduates

The purpose of the present study was to examine the prevalence of cyber-bullying through Facebook in a sample of 226 Greek university undergraduates, and to explore whether big five personality characteristics, narcissism, as well as attitudes toward Facebook, technological knowledge and skills were predictive of such behavior. Participants completed a self-report questionnaire measuring the above constructs. Results indicated that almost one third of the sample reported Facebook bullying engagement at least once during the past month, with male students reporting more frequent involvement than females. Bullying through Facebook was predicted by low Agreeableness and more time spent on Facebook only for males, whereas for females none of the studied variables predicted engagement in Facebook bullying. Findings are discussed in terms of prevention and intervention strategies.