基于联合迭代重建技术的超声CT重建算法

在研究超声CT成像原理的基础上,对阵列检测方法进行了探讨。通过对探头布置方式的改进,增加了成像所需的数据量。基于最小二乘方准则,利用联合迭代重建算法,采用四边扫描算法求解相关系数矩阵,通过不断修正误差逼近真实值,进而实现速度矩阵的求取。数值仿真表明：采用上述方法能够明显减小重建误差,改善层析成像效果。     

基于工学结合的网络综合布线教学改革实践

该文阐述了网络综合布线在课程体系的作用,提出了工学结合的教学设计和教学方法,最后给出教学改革产生的教学效果。     

重点课程特色建设的研究与实践

文章以上海市重点课程建设项目"数据库原理及应用"的建设为背景,根据人才培养目标和课程的特点,探讨课程建设方案的定位、目标和特色,以及课程建设的重点和难点、研究课程实践教学和素质能力培养的方式方法等,提出通过课程建设激发学生学习的积极性、主动性和创造性,从而提高教学效果和应用型人才的综合素质能力。     

Further results of recursive evaluation for compound distribution with the severity distribution of mixed type

Yang et al. [J.P. Yang, S.H. Cheng, Q. Wu, Recursive equations for compound distribution with the severity distribution of the mixed type, Science in China Series A 48 (2005) 594-609] investigated a recursive procedure for a kind of compound distributions with the number of claims belonging to (a,b)-family and the severity distribution of the mixed type. In this paper, we extend their results by assuming that the claim number belongs to a larger class. As applications, the excess-of-loss reinsurance treaty is discussed and concrete examples are considered in some detail.     

An inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities

In this paper, we investigate an inexact hybrid projection-proximal method for solving a class of generalized mixed variational inequalities in Hilbert spaces. We construct a general inexact hybrid projection-proximal point algorithm, in which an inexact relaxed proximal point step is followed by a suitable orthogonal projection onto a hyperplane. Under some suitable conditions concerned with the pseudomonotone set-valued mapping T, the nonsmooth convex function f and the step size λ_k, we prove the convergence of the inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities in Hilbert spaces.     

Pumping with electroosmosis of the second kind in mesoporous skeletons

This paper presents the use of mesoporous silica skeletons as substrates for electroosmotic (EO) micropumps. Mesoporous silica skeletons have bimodal pore size distributions consisting of macropores and cation-permselective mesopores. These materials have the potential for high flow rate per power because the cation-permselective mesopores can generate an induced charge layer (ICL) and electroosmosis of the second kind (EO-2) under high applied electric fields. The diffuse charge layers induced by the electric field result in an EO-2 flow rate that increases quadratically with increasing electric field. In contrast, the flow rate of the more common electroosmosis of the first kind (EO-1) is linearly proportional to electric field. Here, we investigate the impact of finite pressure loads on the EO-2 flow rate with experiments and an engineering model to evaluate the potential of mesoporous skeletons for micropumping applications. Our results include analyses of maximum flow rate, maximum pressure, and flow rate with intermediate pressure loads. The results indicate the existence of a critical pressure load at which reverse pressure-driven flow significantly diminishes the EO-2 flow. We also investigate the scaling of flow rate per power with respect to substrate thickness and area, demonstrating significant increases in flow rate per power with thinner substrates and favorable scaling for miniaturization of EO-2 pumps.     

涉密文档违规处理系统在保密部门的应用

计算机网络技术的高速发展大幅提高了人们的工作效率和信息获取量,但是提供便利的同时也隐藏着安全隐患。各地保密部门始终高度重视涉密文件、机密数据及个人隐私的安全防护,以防患于未然。因此针对堵截涉密信息泄露扩散的最佳时机研制出监测涉密文档监控系统。系统可通过安装在外网客户端上的监控程序,对客户机上文档的编辑工作进行监控,将编辑的文档标题自动发送给监视控制台或保密局等主管单位,并对编辑的文档自动进行涉密分析,一旦发现该文档可能包含有涉密信息,即刻屏蔽该机的网络连接,并立即报警。     

物联网技术在工业自动化中的应用与研究

物联网技术在现今实际应用中是极为普遍的,所谓物联网技术就是以互联网为载体来进行物与物之间信息交换的过程,以及通过互联网将任何物体与物体联系在一起的一种网络,也就是说,物联网实际上就是物物相连的互联网.     

基于H.264的视频编码标准的关键技术分析

H.261是ITU-T于1990年制定的一个视频编码标准,设计目的是能够在带宽为64kbps的倍数的综合业务数字网上传输质量可接受的视频信号,是最早的运动图像压缩标准,本文对H.261的视频编码标准关键技术研究。     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.