欧盟、美国和日本加工农产品中农药残留评估现状

本文介绍了欧盟、美国和日本评估加工农产品中农药残留的数据要求和试验准则,以及开展膳食摄入风险评估和推荐农药最大残留限量(MRL)的方法,汇总了用于农药残留评估的加工农产品及其分类,分析了加工农产品中农药MRL制定现状,为进一步提高我国相关领域技术提供借鉴。比较分析结果表明,欧盟和美国在农药登记资料要求中明确提出了加工试验数据要求并且制定了相应的试验准则,美国在试验准则中描述了加工农产品中农药MRL的推荐原则;美国和日本制定了一定数量的加工农产品中农药MRL,欧盟建立了适用于监管农药MRL的加工因子数据库;欧盟、美国和日本均在相关法规中规定了加工农产品中农药残留的合规性判定。     

光源、性别及光处理时间对草地贪夜蛾趋光行为的影响

为研发高效、精准的监测防控设备,利用八臂行为选择装置系统测定不同光源、性别和光处理时间下草地贪夜蛾Spodoptera frugiperda的趋光行为。结果显示,在紫外光（波长365 nm）、紫光（波长420～430 nm）、蓝光（波长465～475 nm）、绿光（波长525～535 nm）、黄光（波长585～595 nm）和红光（波长655～665 nm）6种波长光源下,草地贪夜蛾混合种群（雌雄成虫比为1∶1）对紫外光光源的趋光选择率最高,为25.61%,显著高于其他处理,其次为紫光和蓝光光源,趋光选择率分别为16.30%和8.82%,对红光的趋光选择率最低,为4.76%。在紫外光刺激下,草地贪夜蛾雌成虫的趋光选择率显著高于混合种群（雌雄成虫比为1∶1）,在红光刺激下,雄成虫的趋光选择率显著高于雌成虫。另外,在紫外光刺激下,光处理时间60 min草地贪夜蛾雌成虫的趋光选择率显著高于其他处理。表明光源与性别因素均影响草地贪夜蛾的趋光行为,光处理时间对草地贪夜蛾的趋光行为影响较小,且与光源及性别因素有关。     

机动车废气分析仪信号处理系统的智能化设计

提出了机动车废气分析仪的智能化组成及其实现信号处理的全过程。详细阐述了信号处理的软硬件的实现。实验结果表明：本系统克服了传统不分光红外线分析仪固有的缺陷。进一步保证了测量数据的正确性和准确性。     

青海省农产品加工业的现状 问题及对策

简述了青海省农产品加工业的发展现状及存在问题,并提出了相应的发展对策,旨在加快青海省农产品加工业的发展,实现农产品转化增值,优化产业结构,吸纳农村富余劳动力,提高农业综合效益。     

Practical Method of High-Speed Access for Medical Digital Image Sequences

The high-speed access for medical digital image sequences was restricted to special device and complicated system in the past. The authors present a new method of high-speed access for medical digital image sequences which can be performed on general computer by means of the combination of Serial ATA(SATA) and Redundant Array of Independent Disk(RAID).Then they introduce the scheme of system configuration and software program. Lastly the testing result is given and the speediness,cheapness and conveniency of this method are elucidated.     

Visualization of the FEM Analysis Data of 3D on the Cut Plane

The colored patterns on arbitrary cut plane is an important method in 3D data-field visualization of finite element.By using the technology of the Object-Oriented Programming and the method of scan-line,the colored patterns on arbitrary cut plane are given.The example by the OPENGL of Visual C++ R6 can support the theory satisfactorily.     

OPTIMIZATION OF BIPARTITE JOINS WITH GRAPH THGORY

An optimization approach for multi-relational joins based on the matching concept in graph theory is introduced. The basic idea lies in constructing a join graph from an expression of N-relation query, and seeking for a maximun matching with minimun total weight. The algorithm for bipartition(X, Y) is proposed in this paper.