关于fuzzy映射的完全广义混合强非线性变分包含

引入并研究了Hilbert空间中一类新的关于fuzzy映射的完全广义混合强非线性变分包含，利用极大单调映射的预解算子技巧构造迭代算法．并证明此变分包含的解的存在性及由迭代算法所生成的迭代序列的收敛性。所得结果改进并推广以往所得的相应结果。     

系统可靠性分配的综合因子法

综合因子法是系统可靠性分配的一种基本方法 ,本文在现有方法综合因子法的基础上概括出其可靠性分配的基本思想 ,使该方法可对单调关联系统进行可靠性分配 ,在计算机上予以实现 ,并在文中举例加以说明     

A discrete Newton algorithm for minimizing a function of many variables

A Newton-like method is presented for minimizing a function ofn variables. It uses only function and gradient values and is a variant of the discrete Newton algorithm. This variant requires fewer operations than the standard method whenn > 39, and storage is proportional ton rather thann ².     

The complexity of computing metric distances between partitions

Quantitative measurement of the similarity of partitions is a problem of particular relevance to the social and behavioral sciences, where experimental procedures necessitate the analysis and comparison of partitions of objects. Since metrics used for this purpose vary considerably in computational complexity. I describe two related metric models that permit methodical enumeration of metrics which may be useful and computationally tractable. Twelve metrics on partitions are identified in this way. Five of them have appeared in the literature, while seven appear to be new. Four of them seem difficult to compute, but efficient algorithms for the remaining eight exist and exhibit time complexities ranging from O(n) to O(n³), where n is the number of objects in the partitions. These algorithms are all based on lattice- and graph-theoretic representations of the computational problems.     

Computing the face lattice of a polytope from its vertex-facet incidences

We give an algorithm that constructs the Hasse diagram of the face lattice of a convex polytope P from its vertex-facet incidences in time O(min{n,m}··), where n is the number of vertices, m is the number of facets, is the number of vertex-facet incidences, and  is the total number of faces of P. This improves results of Fukuda and Rosta [Computational Geometry 4 (4) (1994) 191–198], who described an algorithm for enumerating all faces of a d-polytope in O(min{n,m}·d·²) steps. For simple or simplicial d-polytopes our algorithm can be specialized to run in time O(d··). Furthermore, applications of the algorithm to other atomic lattices are discussed, e.g., to face lattices of oriented matroids.     

Computation of the null distribution of the largest or smallest latent roots of a beta matrix

An algorithm is presented for the numerical evaluation of the null distribution of the largest latent root of a beta matrix, based on a finite series recently given by Khatri [6]. The same method can also be used for the distribution of the smallest latent root, and it can be easily adapted to find percentage points. The method is only useful if the size of the matrix and the size of the denominator sample are small, and in this sense it complements some of the large sample approximations.Although the calculation may be fairly lengthy, the algorithm itself is quite short, and a Fortran coding of it will be submitted to the Journal of the Royal Statistical Society, Series C (Applied Statistics) for publication.     

智能写字机器人设计

设计了一种两自由度写字机器人,可以很方便地完成在平面上的书写绘画任务。可以把在计算机输入的文字通过控制算法和硬件电路用步进电机带动写字笔在纸面自动地描写出来。上位机选用计算机作为主机,采用Arduino系统作为从机。在计算机上将输入的文字转换成坐标形式的G代码,在通过串口发送给下位机控制器,下位机控制器采用直线插补和圆弧形插补算法,输出控制脉冲和方向电平控制步进电机前进或者后退。步进电机是由脉冲控制的,每发来一个脉冲就前进一步,实现了对距离的精确控制。本设计可以拓展一轴,加入Z轴理论上可以实现3D打印功能,把写字笔换成雕刻刀或者是激光头可以雕刻立体作品,拓展功能丰富。     

基于9DOF IMU的AUV惯性导航技术研究

水下机器人（underwater vehicle）惯性导航技术是目前机器人控制技术的难点,通过加装不同类型的IMU组件,可以实现水下机器人姿态、方位等参数的测量,并将这些参数作为反馈输入来实现水下机器人的精确控制。针对低成本微惯性传感器的应用特性,采用Sparkfun、Arduino Mega和Raspberry Pi,设计了基于Raspberry Pi集中处理、Arduino控制板分布式控制的微小型捷联惯导系统,实现了水下机器人惯性导航系统的全部导航和制导参数读取,包含位置坐标、线速度、角速度、姿态角、方位角等信息,通过水池试验表明应用表明本系统满足Eco-dolphin的水下定航控制要求。     

一种数据特征敏感的高效数据聚集编码方案

物联网中数据聚集算法设计面临的主要困难是：数据聚集时数据冗余的发现和消除,数据特征的发现均需要周密的思考,数据聚集时通信效率的提升通常需要较高超的数据编码技巧,精巧的算法设计思路。因此,研究数据聚集的高效率编码算法对于降低数据聚集的能耗具有重要的意义。当前研究中对于数据聚集中编码的综合讨论尚不充分,论文首先对问题进行建模,提出数据平滑泛型的概念,并通过分析得到数据平滑泛型将显著提高通信效率提升指数,在此基础上,论文提出了一套数据特征敏感的物联网高效数据聚集编码方案,包括数据聚集前的数据特征敏感的编码方法,基于CRT的数据编码准备方法,以及多节点数据聚集的可聚集变换方法。所给出的方法均经过严格的理论分析和证明论证,表明了方案的可行性。     

无线传感网络节点隶属度模糊定位算法研究

无线传感网络RSSI算法定位精度很高,但易受环境干扰。本文针对其不足,提出基于节点隶属度模糊算法,并应用于RSSI定位模型之中。新算法首先利用岭形分布对RSSI初始信号模糊化取得隶属函数,再根据隶属度近似程度反馈求精,通过隶属程度以逐渐逼近方式计算节点坐标区域。仿真实验结果证明,与RSSI和DV-Hop算法相比,新算法可以减少环境干扰和信号波动带来的影响,具有更高的定位精度和稳定性。