Organic wavelength‐converting‐film‐based hybrid planar white light‐emitting diodes

Abstract— In this study, organic wavelength‐converting films (WCFs) applied to InGaN blue LED‐based hybrid planar WLED has been fabricated. The organic dye layer in the WCF was formed between the upper and bottom polymer sheets by using a simple roll‐laminating technique. Subsequently, the hybrid planar WLEDs have been fabricated based upon these films. The luminous efficiency of green WCF‐based hybrid planar WLEDs with a single blue LED chip was 34.6 lm/W and that of red‐WCF‐assisted green WCF‐based hybrid planar WLEDs was 27.3 lm/W under 20 mA. The use of WCF to fabricate hybrid planar WLEDs showed better stability than that of directly coating organic color‐convergence materials (CCMs) on the LED chips. It only decreased to about 10% of the initial wavelength‐converting intensity after 1 hour of continual operation at 20 mA.     

招贴设计形态的空间延伸性探析

本文以招贴设计的空间形态作为突破点进行理论与实践探讨,分析如何从平面空间向立体空间、静止空间向运动空间的延伸来完成招贴设计形态的多维性创新,并提出了具体可行的创作方法,通过创意与表现形式的结合来完成招贴设计形态在空间上的延伸设计。     

浅谈平面结构形式在现代服装设计中的表现

近年来许多服装设计师开始大量借用中式服装中披挂,直线裁剪,抽褶等设计手法;本文通过分析平面结构服装的特点,对二维平面服装与西方立体服装进行对比,从审美和实用这两个角度,阐述平面结构式服装的特点。列举其设计形式的多变性和功能的舒适性在服装设计中的表现,指出平面结构形式对现代服装设计的影响与作用。     

球面上的K最近邻查询算法

针对球面上数据对象点集的特征和K最近邻查询的需求,提出2种处理球面上K最近邻查询的算法:基于查询轴的K最近邻查询算法(PAM方法)和基于查询圆面的K最近邻查询算法(PCM方法).对2种算法进行实验比较,结果表明,PAM方法和PCM方法都适合处理球面上的最近邻查询问题,PAM方法在存储量和查询复杂度方面相对于PCM方法具...     

Stability analysis and time-varying walking control for an under-actuated planar biped robot

This paper presents two walking controllers for a planar biped robot with unactuated point feet. The control is based on the tracking of reference motions expressed as a function of time. First, the reference motions are adapted at each step in order to create a hybrid zero dynamic (HZD) system. Next, the stability of the walking gait under closed-loop control is evaluated with the linearization of the restricted Poincaré map of the HZD. When the controlled outputs are selected to be the actuated coordinates, most periodic walking gaits for this robot are unstable, that is, the eigenvalues of the linearized Poincaré map (ELPM) is larger than one. Therefore, two control strategies are explored to produce stable walking. The first strategy uses an event-based feedback controller to modify the ELPM and the second one is based on the choice of controlled outputs. The stability analysis show that, for the same robot and for the same reference trajectory, the stability of the walking (or ELPM) can be modified by some pertinent choices of controlled outputs. Moreover, by studying some walking characteristics of many stable cases, a necessary condition for stable walking is proposed. It is that the height of swing foot is nearly zero at the desired moment of impact. Based on this condition, the duration of the step is almost constant in presence of initial error, so a method for choosing controlled outputs for the second controller is given. By using this method, two stable domains for the controlled outputs selection are obtained.     

μ-Bases and singularities of rational planar curves

We provide a technique to detect the singularities of rational planar curves and to compute the correct order of each singularity including the infinitely near singularities without resorting to blow ups. Our approach employs the given parametrization of the curve and uses a μ-basis for the parametrization to construct two planar algebraic curves whose intersection points correspond to the parameters of the singularities including infinitely near singularities with proper multiplicity. This approach extends Abhyankar's method of t-resultants from planar polynomial curves to rational planar curves. We also derive the classical result that for a rational planar curve of degree n the sum of all the singularities with proper multiplicity is (n−1)(n−2)/2. Examples are provided to flesh out our results.     

简化UKF算法在摄像机标定中的应用

提出一种基于简化无迹卡尔曼滤波（UKF）算法的摄像机标定方法。将平面靶标图像上的不同特征点坐标视为同一个特征点在不同时刻的运动坐标。为避免欧拉角描述法带来的奇异问题,用单位四元数描述世界坐标系和摄像机坐标系之间的变换关系,选取摄像机内外参数作为系统状态变量。结合实际应用背景,简化标准UKF算法,将其用于摄像机参数估计,在保证标定精度的前提下降低运算复杂度。仿真结果表明了该方法的有效性。     

Continuous output‐feedback control for a class of switched high‐order planar systems and its application

This paper deals with the problem of continuous output‐feedback stabilization for a class of switched high‐order planar systems under arbitrary switchings. Based on the common Lyapunov function design method, by using the adding a power integrator technique and designing an implementable observer, a continuous output‐feedback controller is constructed such that the closed‐loop system is global stabilization and the output can be regulated to the origin. As an application, the developed strategy is utilized to the control design for the continuous stirred tank reactor with two modes feed stream. The simulation results verify the efficiency of the proposed design scheme. Copyright © 2017 John Wiley & Sons, Ltd.     

可识别声源深度的三维声聚焦波束形成方法

当前平面传声器阵列结合波束形成方法进行声源识别定位时,存在不能确定声源相对全息测量阵列距离的问题,提出了可识别声源深度的三维声聚焦波束形成方法。基于球面波声场模型和波束形成方法,在不同深度的平面上进行声聚焦,首先根据聚焦面上波束形成功率的最大点位置沿聚焦深度方向（即z方向）的轨迹变化判断声源在z方向的位置,再进一步确定声源在x和y方向的位置。为验证方法的有效性,在点声源构成的声场中进行了仿真验证,并且在全消声室内进行了单声源及多声源识别定位的实验验证。仿真结果和实验结果一致表明：该方法能够实现基于平面阵列的三维空间中声源的识别定位。     

A new neural network algorithm for planarization problems

To deal with the planarization problem widely used in many applications including routing very-large-scale integration （VLSI） circuits, this paper points out that only when its vertices are arranged in some specific order in a line can a planar graph be embedded on a line without any cross connections or cross edges. Energy function is proposed to meet the need of embedding a graph on a single line and route it correctly. A Hopfield network is designed according to the proposed energy function for such embedding and routing. The advantage of the proposed method is that it not only can detect if a graph is a planar one or not, but also can embed a planar graph or the maximal planar subgraph of a non-planar graph on a single line. In addition, simulated annealing is employed for helping the network to escape from local minima during the running of the Hopfield network. Experiments of the proposed method and its comparison with some existent conventional methods were performed and the results indicate that the proposed method is of great feasibility and effectiveness especially for the planarization problem of large graphs.