车辆电子电气系统测试方法研究

随着车辆电子信息技术的飞速发展,车辆电子电气系统在整车的可靠性中起着至关重要的作用。对电子电气系统的测试传统的做法往往是在整个系统完成之后利用整车环境进行的,这种方法不利于发现早期问题,对系统可靠性带来隐患;为了提升车辆电子电气系统可靠性,主要从实际工程测试出发,从项目的前期以及后期两个方面对电子电气系统的测试进行了分析,在项目的前期主要进行快速原型以及HIL测试,在项目的后期主要进行功能、性能、接口测试,从而实现提升车辆电子电气系统高可靠性以及经济性的提升。     

基于ACR9000控制器的自动光学检测平台设计 

针对自动光学检测（AOI）平台运行过程中的定位精度控制问题,提出了一种基于速度和加速度前馈控制与PID反馈控制的复合控制算法,该算法对输入量进行跟踪补偿控制以消除系统稳态误差,用于提高AOI平台定位精度。基于开放式的数控系统设计方法设计了AOI平台。在Matlab/Simulink环境下,构建了基于该复合控制算法的定位精度控制仿真模型,仿真结果验证了复合控制算法的有效性。将该复合控制算法作为ACR9000控制器的控制算法,并基于ACR9000控制器进行AOI平台实验研究。应用该AOI平台进行了印刷电路板（PCB）检测实验,实验结果表明文中复合控制算法能够提高AOI平台定位精度,AOI平台的定位精度满足印刷电路板检测要求,可以将该AOI平台用于印刷电路板检测。     

基于斑马鱼图像特征的鱼群检测算法北大核心CSCD

计算机视觉方法越来越多地应用于斑马鱼的群体行为研究;但是,由于斑马鱼游动过程形体变化大,遮挡多,准确与鲁棒地检测出斑马鱼仍然是一件非常具有挑战性的问题。为了解决该问题,提出一种基于斑马鱼图像特征的鱼群检测算法。首先通过分析目标特性,提出使用鱼头和鱼尾替代全鱼的检测方法,解决了传统整鱼检测在鱼群交叉遮挡时失效的难题;然后基于斑马鱼图像特征自动构建训练集,避免了深度学习手动标注的费时费力问题。通过对实际斑马鱼视频进行处理验证,与现有的算法相比,本文提出的方法在标注率、召回率(recall,R)与遮挡检测率(occlusion detection rate,ODR)等性能指标上有更好的实验效果。其中,在标注性能方面,本文提出的自动标注方法在总标注率上达到87.40%;在训练集效果方面,本文自动标注算法结合人工校正在标注时间上相比于人工标注方法减少93.11%,均值平均精度(mean average precision,mAP)达到79.80%;在目标检测方面,在目标遮挡率为42.72%的情况下,本文检测算法能够获得82.0%的召回率及58.02%的遮挡检测率。     

Automatic in-tube SPME and fast liquid chromatography: a cost-effective method for the estimation of dibuthyl and di-2-ethylhexyl phthalates in environmental water samples

A 80-cm length commercially available capillary coated with 95% polydimethylsiloxane and 5% polydiphenylsiloxane (TBR-5) was employed to carry out on-line extraction and preconcentration of dibuthyl phthalate (DBP) and di-2-ethylhexyl phthalate (DEHP) in the chromatographic system. The coated capillary was placed between the sample injection loop and the injection needle of an autosampler. Variables affecting the automatic in-tube solid-phase microextraction (SPME) were optimized. A Genesis C₁₈ (5 cm × 4.6 mm i.d., 4 μm particle size) was employed as analytical column. The achieved limits of detection by use of diode array detection were 1 and 2.5 μg L⁻¹, respectively. The proposed conditions have been applied to determine those compounds at low ppb levels (≤250 μg L⁻¹) in aqueous samples. No matrix effect was found, and recoveries between 85 and 115% were obtained. The precision of the method was good, and the achieved intra- and inter-day variation coefficients were between 5 and 20%. The analysis time per sample was 20 min and any off-line pre-treatment of the samples was needed. The taken sample volume was 100 μL. Data on the application of the described method to the analysis of different water samples are presented.     

Efficient automatic simulation of parallel computation on networks of workstations

Andrews et al. [Automatic method for hiding latency in high bandwidth networks, in: Proceedings of the ACM Symposium on Theory of Computing, 1996, pp. 257-265; Improved methods for hiding latency in high bandwidth networks, in: Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, 1996, pp. 52-61] introduced a number of techniques for automatically hiding latency when performing simulations of networks with unit delay links on networks with arbitrary unequal delay links. In their work, they assume that processors of the host network are identical in computational power to those of the guest network being simulated. They further assume that the links of the host are able to pipeline messages, i.e., they are able to deliver P packets in time O(P+d) where d is the delay on the link.In this paper we examine the effect of eliminating one or both of these assumptions. In particular, we provide an efficient simulation of a linear array of homogeneous processors connected by unit-delay links on a linear array of heterogeneous processors connected by links with arbitrary delay. We show that the slowdown achieved by our simulation is optimal. We then consider the case of simulating cliques by cliques; i.e., a clique of heterogeneous processors with arbitrary delay links is used to simulate a clique of homogeneous processors with unit delay links. We reduce the slowdown from the obvious bound of the maximum delay link to the average of the link delays. In the case of the linear array we consider both links with and without pipelining. For the clique simulation the links are not assumed to support pipelining.The main motivation of our results (as was the case with Andrews et al.) is to mitigate the degradation of performance when executing parallel programs designed for different architectures on a network of workstations (NOW). In such a setting it is unlikely that the links provided by the NOW will support pipelining and it is quite probable the processors will be heterogeneous. Combining our result on clique simulation with well-known techniques for simulating shared memory PRAMs on distributed memory machines provides an effective automatic compilation of a PRAM algorithm on a NOW.     

Comparison of Methods for Image Analysis on cDNA Microarray Data

Microarrays are part of a new class of biotechnologies which allow the monitoring of expression levels for thousands of genes simultaneously. Image analysis is an important aspect of microarray experiments, one that can have a potentially large impact on subsequent analyses such as clustering or the identification of differentially expressed genes. This article reviews a number of existing image analysis approaches for cDNA microarray experiments and proposes new addressing, segmentation, and background correction methods for extracting information from microarray scanned images. The segmentation component uses a seeded region growing algorithm which makes provision for spots of different shapes and sizes. The background estimation approach is based on an image analysis technique known as morphological opening. These new image analysis procedures are implemented in a software package named Spot, built on the R environment for statistical computing. The statistical properties of the different segmentation and background adjustment methods are examined using microarray data from a study of lipid metabolism in mice. It is shown that in some cases background adjustment can substantially reduce the precision—that is, increase the variability—of low-intensity spot values. In contrast, the choice of segmentation procedure has a smaller impact. The comparison further suggests that seeded region growing segmentation with morphological background correction provides precise and accurate estimates of foreground and background intensities.     

On a family of 2-automatic sequences generating algebraic continued fractions in characteristic 2

We present family of automatic sequences that define algebraic continued fractions in characteristic 2. This family is constructed from ultimately period words and contains the period-doubling sequence.