十二孔闸改建工程抢工措施探讨

十二孔闸改建工程因“引黄补淀”要求,工期由原来设计的10个月压缩为两个半月,改建工程项目部克服多项困难组织抢工,在抢工过程中出现一些不足之处给抢工任务造成不利影响,该文着重分析抢工措施中的不足之处及提出应该注意的问题.     

机器视觉在水稻空壳率统计中的应用研究

针对水稻空壳率的自动化检测问题,采用机器视觉技术,设计一种实验设备,利用稻谷的透光性,使用普通可见光照射,对获得的图像进行分析处理,并比较采用灰度特征以及YUV颜色模型两种方法进行统计的结果,表明该设备和相关图像处理算法完全可以胜任空壳率的自动统计工作,为后续发展实际的应用设备奠定基础。     

电子政务信息安全的分析与对策

本文从论述电子政务信息安全的风险出发,阐述了制约我国电子政务信息安全的主要因素,给出了电子政务信息安全的有效对策.     

介观压阻效应电磁驱动微机械陀螺仪的设计与测试

将共振隧穿二极管具有的介观压阻效应与哥氏效应结合应用于陀螺的设计中,提出了一种新型的采用回折型正交梁的陀螺结构。结合现在的工艺水平,设计了合理的加工工艺方案,并进行了加工与封装。通过对封装后的陀螺进行驱动方向测试,得到了固有频率的范围;检测方向上利用振动台对陀螺灵敏度进行了测试,得到在1kHz和4kHz时的测试灵敏度分别为7.51mV/gn、100.74mV/gn。     

高职院校“订单式”人才培养模式之跨国比较

"订单式"人才培养模式,楔合了高职院校和用人企业在人才供需方面的共同利益点,是高职院校人才培养模式的未来发展方向,是解决高职学生就业的有力措施。本文通过对国内国外高职"订单式"人才培养模式比较,借鉴发达国家的成功经验,提供国内高职院校参考,以探索、创新出一条有中国特色的"订单式"人才培养模式的新路。     

An energy-efficient real-time scheduling scheme on dual-channel networks

The recent evolution of wireless sensor networks have yielded a demand to improve energy-efficient scheduling algorithms and energy-efficient medium access protocols. This paper proposes an energy-efficient real-time scheduling scheme that reduces power consumption and network errors on dual channel networks. The proposed scheme is based on a dynamic modulation scaling scheme which can scale the number of bits per symbol and a switching scheme which can swap the polling schedule between channels. Built on top of EDF scheduling policy, the proposed scheme enhances the power performance without violating the constraints of real-time streams. The simulation results show that the proposed scheme enhances fault-tolerance and reduces power consumption.     

Locally linear reconstruction for instance-based learning

Instance-based learning (IBL), so called memory-based reasoning (MBR), is a commonly used non-parametric learning algorithm. k-nearest neighbor (k-NN) learning is the most popular realization of IBL. Due to its usability and adaptability, k-NN has been successfully applied to a wide range of applications. However, in practice, one has to set important model parameters only empirically: the number of neighbors (k) and weights to those neighbors. In this paper, we propose structured ways to set these parameters, based on locally linear reconstruction (LLR). We then employed sequential minimal optimization (SMO) for solving quadratic programming step involved in LLR for classification to reduce the computational complexity. Experimental results from 11 classification and eight regression tasks were promising enough to merit further investigation: not only did LLR outperform the conventional weight allocation methods without much additional computational cost, but also LLR was found to be robust to the change of k.     

Influence of wall charge distribution on time lag of address discharge in AC plasma display panels

The influence of wall charge distribution on the time lag of address discharge in an AC plasma display panel is investigated using two different reset waveforms: one (typical reset) induces both face and surface discharges and the other (TR reset) induces face discharges only. The measured formative time lag and statistical time lag of address discharge for TR were 21–31 ns and 31–74 ns shorter than the one for the typical reset, respectively. The TR reset resulted in much less increase of statistical time lag than the typical reset when the reset-to-address time interval was increased, and 70 ns smaller deviation of the statistical time lag among different color cells. Calculations show that the TR reset forms a much smoother wall charge profile, which is less susceptible to cell parameter variations, than the typical reset. The observed differences in the time lags of address discharge between different scan lines and color cells are strongly correlated to the differences of the wall charge profile, indicating that a smooth wall charge profile formed by the reset using face discharges only reduces the time lag of address discharge and minimizes the susceptibility of address discharge to cell parameter variation.     

Free-form object reconstruction from silhouettes, occluding edges and texture edges: a unified and robust operator based on duality

In this paper, the duality in differential form is developed between a 3D primal surface and its dual manifold formed by the surface's tangent planes, i.e., each tangent plane of the primal surface is represented as a four-dimensional vector which constitutes a point on the dual manifold. The iterated dual theorem shows that each tangent plane of the dual manifold corresponds to a point on the original 3D surface, i.e., the dual of the dual goes back to the primal. This theorem can be directly used to reconstruct 3D surface from image edges by estimating the dual manifold from these edges. In this paper we further develop the work in our original conference papers resulting in the robust differential dual operator. We argue that the operator makes good use of the information available in the image data, by using both points of intensity discontinuity and their edge directions; we provide a simple physical interpretation of what the abstract algorithm is actually estimating and why it makes sense in terms of estimation accuracy; our algorithm operates on all edges in the images, including silhouette edges, self occlusion edges, and texture edges, without distinguishing their types (thus resulting in improved accuracy and handling locally concave surface estimation if texture edges are present); the algorithm automatically handles various degeneracies; and the algorithm incorporates new methodologies for implementing the required operations such as appropriately relating edges in pairs of images, evaluating and using the algorithm's sensitivity to noise to determine the accuracy of an estimated 3D point. Experiments with both synthetic and real images demonstrate that the operator is accurate, robust to degeneracies and noise, and general for reconstructing free-form objects from occluding edges and texture edges detected in calibrated images or video sequences.     

A Hidden‐picture Puzzles Generator

A hidden‐picture puzzle contains objects hidden in a background image, in such a way that each object fits closely into a local region of the background. Our system converts image of the background and objects into line drawing, and then finds places in which to hide transformed versions of the objects using rotation‐invariant shape context matching. During the hiding process, each object is subjected to a slight deformation to enhance its similarity to the background. The results were assessed by a panel of puzzle‐solvers.