基于S7-200系列的测温回路的扩展

电除尘器的保温十分重要,它保证了高电压回路的绝缘强度,对电除尘器的正常运行起着十分关键的作用。以西门子PLCS7-200系列为例,介绍了使用DI/DO模块和DUT3000数据采集模块来采集电除尘器加热回路的温度,实现方便、实用的、低成本、高可靠、高精度的温度测量。     

基于QNX的PC104总线设备驱动模块的开发

QNX作为最优秀的嵌入式实时操作系统之一,已被应用于诸如医疗仪器、电网通信以及航空航天等任务关键型领域。在掌握QNX微内核结构和消息传递机制的基础上,论述了QNX下资源管理器的原理以及资源管理器与设备驱动程序的关系,具体分析了PC104总线设备驱动程序编写规范和步骤。实现了QNX下应用程序对硬件访问的无关性,大大增强了系统安全性以及移植性等。     

基于S3C2440和Windows CE5.0的嵌入式设备休眠唤醒技术研究

就休眠唤醒技术实现过程中的难点进行了深入研究,并针对S3C2440开发板提出了两种可行的低功耗休眠模式唤醒实现方法:外部中断唤醒和RTC中断唤醒.将这两种方法应用于一款基于S3C2440和WindowsCE 5.0的嵌入式智能巡检分析诊断仪,仪器运行稳定、效果理想.     

A goodness-of-fit test for Archimedean copula models in the presence of right censoring

A goodness-of-fit testing procedure for Archimedean copula (AC) models is developed based on right-censored data. The proposed approach extends an existing method, which is suitable for the Clayton model, to general AC models. Asymptotic properties of the proposed test statistics under the true model assumption are derived. Simulation analysis shows that the proposed test has reasonable performance. Finally, two real data examples are analyzed for illustrative purposes.     

Robust model selection with flexible trimming

The forward search provides data-driven flexible trimming of a C_p statistic for the choice of regression models that reveals the effect of outliers on model selection. An informed robust model choice follows. Even in small samples, the statistic has a null distribution indistinguishable from an F distribution. Limits on acceptable values of the C_p statistic follow. Two examples of widely differing size are discussed. A powerful graphical tool is the generalized candlestick plot, which summarizes the information on all forward searches and on the choice of models. A comparison is made with the use of M-estimation in robust model choice.     

双焊枪自动焊接机数控系统设计

针对散热器多T型管相贯线的连续焊接问题,提出了一种基于PC机和6K运动控制器的双焊枪自动焊接机数控系统。采用"PC+多轴控制器"的上下位机控制结构,上位机采用VisualBasic编制控制程序,实现系统的管理、控制功能。下位机采用6K4控制器独有的6000运动语言开发底层的伺服驱动程序,并可由上位机通过以太网接口调用。整个系统能够完成各轴状态实时显示、故障自动诊断、焊接路径规划、焊接参数调节等任务。     

基于蓝牙技术的智能车实时监测系统的研究

研究开发了以Freescale公司MC9S12DG128单片机为核心控制单元的智能车无线监测系统。系统主要由传感器模块、数据采集与处理模块、UART通讯模块、蓝牙通讯模块、上位机模块组成。详细介绍了以上4个模块的设计开发。经过测试表明,此系统工作稳定,对于摄像头图像的显示,速度曲线的绘制,PID参数修正等功能完全满足智能车调试的需求。     

On the complexity of deciding avoidability of sets of partial words

Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k≥2, is NP-hard [F. Blanchet-Sadri, R. Jungers, J. Palumbo, Testing avoidability on sets of partial words is hard, Theoret. Comput. Sci. 410 (2009) 968-972]. Building on their work, we analyze in this paper the complexity of natural variations on the problem. While some of them are NP-hard, others are shown to be efficiently decidable. Using some combinatorial properties of de Bruijn graphs, we establish a correspondence between lengths of cycles in such graphs and periods of avoiding words, resulting in a tight bound for periods of avoiding words. We also prove that Avoidability can be solved in polynomial space, and reduces in polynomial time to the problem of deciding the avoidability of a finite set of partial words of equal length over the binary alphabet. We give a polynomial bound on the period of an infinite avoiding word, in the case of sets of full words, in terms of two parameters: the length and the number of words in the set. We give a polynomial space algorithm to decide if a finite set of partial words is avoided by a non-ultimately periodic infinite word. The same algorithm also decides if the number of words of length n avoiding a given finite set of partial words grows polynomially or exponentially with n.     

Finding an Euclidean anti--centrum location of a set of points

An obnoxious facility is to be located inside a polygonal region of the plane, maximizing the sum of the k smallest weighted Euclidean distances to n given points, each protected by some polygonal forbidden region. For the unweighted case and k fixed an O(n²logn) time algorithm is presented. For the weighted case a thorough study of the relevant structure of the multiplicatively weighted order-k-Voronoi diagram leads to the design of an O(kn³+n³logn) time algorithm for finding an optimal solution to the anti-t-centrum problem for every t=1,…,k, simultaneously.