大规模定制环境下基于产品结构复杂度的工时定额制定研究

针对大规模定制环境下产品种类多、工时制定困难的特点,为了能够快速且准确获取产品工时,研究了产品结构复杂度与工时之间的关系,提出了一种基于产品结构复杂度的工时估算方法.综合考虑影响产品结构复杂度的各种因素后,针对决策结果的排序向量决定决策者权重,引入灰色关联理论,建立了产品结构复杂度计算模型.基于数据库中的工时信息,运用MATLAB软件进行编程确定产品结构复杂度和工时之间的函数关系.最后,以某企业产品加工工时估算实例,证明了所提出的估算方法的可行性.     

基于特征偏好的聚类研究

传统的聚类方法,如k均值和模糊c均值,通常并不区分数据特征对聚类的不同贡献或重要度,因此在面对高维数据聚类时,常会导致偏低的聚类性能,这归咎于聚类时未考虑高维数据特征间所存在的高度相关性或冗余.而通过在聚类时为每一特征引入权重并通过聚类目标的优化,不仅能自动获得对应的权重,而且也获得了聚类性能的提升.尽管如此,但无监督获取的特征权重未必吻合用户所期望的特征间的相对重要性(或偏好).因此尝试利用用户给定的实际偏好设计出能反映特征偏好的聚类方法,其将现有独立于个体聚类的全局加权型偏好聚类方法拓展至聚类依赖的局部特征加权型方法,由此弥补了前者的不足,提升了偏好聚类算法的性能.     

基于Feeds的社交网络活跃度分析

从用户产生和消费Feeds的角度分析社交网络变得不活跃的原因,通过分析人人网某大学社区用户长周期的Feeds行为来探讨该社区用户活跃度的变化。通过对用户活跃性周期和Feeds时间间隔的分析,发现越来越多的用户产生Feeds的活跃度在下降,并导致其他用户接收到的信息流的流速和多样性下降。社交网络用户由于各种原因离开或变得不活跃,并通过信息流对其朋友圈形成负向反馈,这可能是社交网络变得不活跃的深层原因。模拟实验表明,30%的初始不活跃用户会使得整个社区的信息流快速下降,并导致整个社区不活跃。     

核电厂数字化反应堆保护系统T2响应时间分析及测试

反应堆保护系统是核电厂数字化仪表控制系统中重要的安全系统,是DCS的重要组成部分。为了核电站的安全,对保护系统的响应时间有严格的要求,有必要对响应时间进行评价,本文简要介绍了核电站反应堆保护系统的结构,给出了T2响应时间测试范围,并对反应堆保护系统的响应时间进行理论分析,给出了T2响应时间测试方法,建立了响应时间测试原理,介绍了VP Link作为测试装置如何进行响应时间测试。以某核电厂1&2机组的SG1水位低低导致紧急停堆响应时间测试工况为例,详细介绍了实际响应时间测试工作,给出了响应时间测试的输出文件清单,并对测试结果进行记录和分析。     

精馏塔时滞过程的分数阶PIλDμ控制器设计

本文针对精馏塔不稳定时滞过程,提出一种基于设定值加权的分数阶PIλDμ控制器设计方法.首先采用比例环节构成内环反馈镇定不稳定时滞过程,然后基于等效的过程模型,依据设定值加权方法设计分数阶PIλDμ控制器,并进行了控制器参数整定.仿真结果表明:分数阶PIλDμ控制器可以使精馏塔不稳定时滞过程系统获得良好的动态响应特性,干扰抑制特性以及克服系统参数变化的鲁棒性.     

基于分布式聚类的有向传感器网络移动目标跟踪算法研究

针对有向传感器网络DSN（Directional Sensor Networks）中,传感器节点部署数量对目标跟踪精度、网络寿命和能效问题的影响方面,提出了一个分布式聚类算法,该算法在优化活跃传感器和节点的直接通信过程中,由分布式集群来负责协调成员间的节点,通过传输给Sink的定位信息及从多个节点聚集的传感数据来准确定位目标的位置。基于该理论的目标跟踪机制,提高了目标跟踪精度、增加了网络寿命和网络剩余能量。并进行了仿真验证,结果表明该方法能实现更高的跟踪性能。     

Discrete time sliding mode control with reduced switching – a new reaching law approach

In this paper, a novel reaching law for discrete‐time variable structure systems is proposed. It ensures that the representative point (state) of the controlled plant approaches the switching plane in finite time and then crosses it in every subsequent step. Moreover, the proposed reaching law ensures that for the nominal plant the absolute value of the sliding variable asymptotically decreases to zero, and for the perturbed plant, it converges to a smaller interval around zero than with the application of previously proposed reaching laws. The control method proposed in this paper guarantees asymptotic stability of the nominal system and uniform ultimate boundedness of the perturbed one. Furthermore, the method ensures that the sliding variable rate of change (i.e. the difference between its values at any two subsequent sampling instants) is bounded by design parameters, which do not depend on the system initial conditions. This is a highly desirable property, as it results in a priori specified, ‘almost’ constant convergence rate of the sliding variable when the system state is far off the switching plane and helps enforce state constraints in the system. Copyright © 2014 John Wiley & Sons, Ltd.     

Finite‐time asynchronous filtering for discrete‐time Markov jump systems over a lossy network

This paper is concerned with the problem of finite‐time asynchronous filtering for a class of discrete‐time Markov jump systems. The communication links between the system and filter are assumed to be unreliable, which lead to the simultaneous occurrences of packet dropouts, time delays, sensor nonlinearity and nonsynchronous modes. The objective is to design a filter that ensures not only the mean‐square stochastic finite‐time bounded but also a prescribed level of performance for the underlying error system over a lossy network. With the help of the Lyapunov–Krasovskii approach and stochastic analysis theory, sufficient conditions are established for the existence of an admissible filter. By using a novel simple matrix decoupling approach, a desired asynchronous filter can be constructed. Finally, a numerical example is presented and a pulse‐width‐modulation‐driven boost converter model is employed to demonstrate the effectiveness of the proposed approach. Copyright © 2016 John Wiley & Sons, Ltd.     

Two general integral inequalities and their applications to stability analysis for systems with time‐varying delay

Integral inequalities have been widely used in stability analysis for systems with time‐varying delay because they directly produce bounds for integral terms with respect to quadratic functions. This paper presents two general integral inequalities from which almost all of the existing integral inequalities can be obtained, such as Jensen inequality, the Wirtinger‐based inequality, the Bessel–Legendre inequality, the Wirtinger‐based double integral inequality, and the auxiliary function‐based integral inequalities. Based on orthogonal polynomials defined in different inner spaces, various concrete single/multiple integral inequalities are obtained. They can produce more accurate bounds with more orthogonal polynomials considered. To show the effectiveness of the new inequalities, their applications to stability analysis for systems with time‐varying delay are demonstrated with two numerical examples. Copyright © 2016 John Wiley & Sons, Ltd.     

Recursive state estimation for discrete‐time nonlinear systems with event‐triggered data transmission,norm‐bounded uncertainties and multiple missing measurements

In this paper, we consider the recursive state estimation problem for a class of discrete‐time nonlinear systems with event‐triggered data transmission, norm‐bounded uncertainties, and multiple missing measurements. The phenomenon of event‐triggered communication mechanism occurs only when the specified event‐triggering condition is violated, which leads to a reduction in the number of excessive signal transmissions in a network. A sequence of independent Bernoulli random variables is employed to model the multiple measurements missing in the transmission. The norm‐bounded uncertainties that could be considered as external disturbances which lie in a bounded set. The purpose of the addressed filtering problem is to obtain an optimal robust recursive filter in the minimum‐variance sense such that with the simultaneous presence of event‐triggered data transmission, norm‐bounded uncertainties, and multiple missing measurements; the filtering error is minimized at each sampling time. By solving two Riccati‐like difference equations, the filter gain is calculated recursively. Based on the stochastic analysis theory, it is proved that the estimation error is bounded under certain conditions. Finally, two numerical examples are presented to demonstrate the effectiveness of the proposed algorithm. Copyright © 2016 John Wiley & Sons, Ltd.