RadarSat-2全极化数据土地覆盖分类精度评价

Radar Sat-2全极化数据能否应用于土地覆盖分类需要大量的研究和论证。本文以NLCD为参考数据,利用SVM分类器对1景旧金山地区Radar Sat-2全极化数据进行土地覆盖分类实验,并从分类类别面积一致性、空间相似性两个方面对分类结果进行分类精度评价。实验获得Radar Sat-2数据分类结果总体分类精度76.91%和kappa系数0.65,表明Radar Sat-2全极化数据用于土地覆盖分类分类精度较高,可以达到很好的分类质量。     

石油钻机新技术探讨

分析了石油勘探开发和工程技术的新发展,特别是针对三大钻机技术(水平井钻井技术、欠平衡钻井技术、深井钻井技术),应运而生的新型石油钻井装备。还阐述了与之相关的新型石油钻井装备,如液压钻机、四象限运行的交流变频电驱钻机、模块钻机、快移快装钻机、钻机智能化、钻机顶驱装置等。     

关于加强专业实验室建设与管理研究与探讨

专业实验室是培养人才创新能力和实践能力的重要场所,加强专业实验室建设,优化资源配置,提高专业实验室的利用率,对培养学生实践创新能力具有重大的促进作用。同时,结合地方的特色产业,为地方的科技与经济做出应用的贡献。该文从专业实验室建设、专业实验室特色、专业实验室制度、专业实验室安排、实验室队伍建设进行研究与探讨。     

Exponential stability of stochastic singular delay systems with general Markovian switchings

In recent years, Markovian jump systems have received much attention. However, there are very few results on the stability of stochastic singular systems with Markovian switching. In this paper, the discussed system is the stochastic singular delay system with general transition rate matrix in terms of uncertain and partially unknown transition rate matrix. The aim is to answer the question whether there are conditions guaranteeing the underlying system having a unique solution and being exponentially admissible simultaneously. The proposed results show that all the features of the underlying system such as time delay, diffusion, and general Markovian switchings play important roles in the system analysis of exponential admissibility. A numerical example is used to demonstrate the effectiveness of the proposed methods. Copyright © 2014 John Wiley & Sons, Ltd.     

Approximate dynamic programming via iterated Bellman inequalities

In this paper, we introduce new methods for finding functions that lower bound the value function of a stochastic control problem, using an iterated form of the Bellman inequality. Our method is based on solving linear or semidefinite programs, and produces both a bound on the optimal objective, as well as a suboptimal policy that appears to works very well. These results extend and improve bounds obtained in a previous paper using a single Bellman inequality condition. We describe the methods in a general setting and show how they can be applied in specific cases including the finite state case, constrained linear quadratic control, switched affine control, and multi‐period portfolio investment. Copyright © 2014 John Wiley & Sons, Ltd.     

Informative conditions for a data set in a MIMO closed‐loop system with a switching controller

In system identification, a data set needs to be informativeto ensure that the identification criterion has a unique global minimum asymptotically, and the parameter estimation is consistent. To guarantee a data set in a MIMO closed‐loop system with a switching controller to be informative, we develop a group of flexible conditions for the controller's switching rule and feedback laws, which provide a trade‐off between these two aspects through adjustable parameters. Compared with the results in the existing literature, our result includes all kinds of switching rules and therefore is not limited by the constraints on the switching rule.Copyright © 2014 John Wiley & Sons, Ltd.     

A Physarum-inspired approach to supply chain network design基于多头绒泡菌模型的供应链网络设计算法

A supply chain is a system which moves products from a supplier to customers, which plays a very important role in all economic activities. This paper proposes a novel algorithm for a supply chain network design inspired by biological principles of nutrients’ distribution in protoplasmic networks of slime mould Physarum polycephalum. The algorithm handles supply networks where capacity investments and product flows are decision variables, and the networks are required to satisfy product demands. Two features of the slime mould are adopted in our algorithm. The first is the continuity of flux during the iterative process, which is used in real-time updating of the costs associated with the supply links. The second feature is adaptivity. The supply chain can converge to an equilibrium state when costs are changed. Numerical examples are provided to illustrate the practicality and flexibility of the proposed method algorithm.     

A low-complexity sensor fusion algorithm based on a fiber-optic gyroscope aided camera pose estimation system

Visual tracking, as a popular computer vision technique, has a wide range of applications, such as camera pose estimation. Conventional methods for it are mostly based on vision only, which are complex for image processing due to the use of only one sensor. This paper proposes a novel sensor fusion algorithm fusing the data from the camera and the fiber-optic gyroscope. In this system, the camera acquires images and detects the object directly at the beginning of each tracking stage; while the relative motion between the camera and the object measured by the fiber-optic gyroscope can track the object coordinate so that it can improve the effectiveness of visual tracking. Therefore, the sensor fusion algorithm presented based on the tracking system can overcome the drawbacks of the two sensors and take advantage of the sensor fusion to track the object accurately. In addition, the computational complexity of our proposed algorithm is obviously lower compared with the existing approaches(86% reducing for a 0.5 min visual tracking). Experiment results show that this visual tracking system reduces the tracking error by 6.15% comparing with the conventional vision-only tracking scheme(edge detection), and our proposed sensor fusion algorithm can achieve a long-term tracking with the help of bias drift suppression calibration.     

A B-spline curve extension algorithmB 样条曲线延伸算法

B-spline curve extension is an important operation in computer aided design systems. In this paper, we present a new extension algorithm for B-spline curves. The algorithm uses curve unclamping to generate a uniform B-spline curve segment from the original curve and gradually extends the segment to pass through every target point. Algorithms of uniform B-spline curves are used such that our algorithm has a low time cost and can easily handle arbitrary-order derivative constraints at the target points. Generalization for non-uniform rational B-spline curve extension is also discussed, and examples show the efficiency of our method.