A new way for multidimensional medical data management: volume of interest (VOI)-based retrieval of medical images with visual and functional features.

The advances in digital medical imaging and storage in integrated databases are resulting in growing demands for efficient image retrieval and management. Content-based image retrieval (CBIR) refers to the retrieval of images from a database, using the visual features derived from the information in the image, and has become an attractive approach to managing large medical image archives. In conventional CBIR systems for medical images, images are often segmented into regions which are used to derive two-dimensional visual features for region-based queries. Although such approach has the advantage of including only relevant regions in the formulation of a query, medical images that are inherently multidimensional can potentially benefit from the multidimensional feature extraction which could open up new opportunities in visual feature extraction and retrieval. In this study, we present a volume of interest (VOI) based content-based retrieval of four-dimensional (three spatial and one temporal) dynamic PET images. By segmenting the images into VOIs consisting of functionally similar voxels (e.g., a tumor structure), multidimensional visual and functional features were extracted and used as region-based query features. A prototype VOI-based functional image retrieval system (VOI-FIRS) has been designed to demonstrate the proposed multidimensional feature extraction and retrieval. Experimental results show that the proposed system allows for the retrieval of related images that constitute similar visual and functional VOI features, and can find potential applications in medical data management, such as to aid in education, diagnosis, and statistical analysis.     

238C防盗报警系统的改进

漯河中波台自安装238C防盗报警系统以来,多次出现误报现象,严重影响了发射及其他工作的正常进行。首先对该系统的工作原理进行了简单介绍,然后对误报故障现象进行了分析、处理,并改进了电路设计中存在的不足。改进后的运行数据表明,系统误报率明显下降,达到了预期的目的。最后,对本系统的设计提出了进一步完善的建议。     

一个基于PE分层技术的电子政务网络平台

电子政务网络建设的主要目标就是建立一个开放的、基于标准的统一网络平台，并在该平台上实现政府不同部门之间的信息交换和资源共享，同时保证各部门信息的独立和安全。通过介绍电子政务网络建设中的主流技术——MPLSVPN，提出了一种基于该技术原理的PE分层技术，详细讨论了基于该分层技术的电子政务网络平台的实现过程和主要技术，并对其性能参数进行了测试与分析。     

用DSP实现多目标实时跟踪

介绍了在 TMS3 2 0 C62 0 3上实现 4个目标的快速跟踪技术。为了提高实时性和精确度 ,采用线性汇编优化实现。1个 3 2 0× 160主窗口的 DSP平均处理时间为 2 m s,3个 60× 60副窗口的 DSP平均处理时间各为 0 .4ms,实现了复杂背景下低对比度目标的快速跟踪。实验结果证明跟踪效果良好 ,解决了以前窗口开不大、跟踪速度慢的问题     

Blind estimation of OFDM carrier frequency offset via oversampling

Blind deterministic estimation of the orthogonal frequency division multiplexing (OFDM) frequency offset via oversampling is proposed in this paper. This method utilizes the intrinsic phase shift of neighboring sample points incurred by the frequency offset that is common among all subcarriers. The proposed method is data efficient - it requires only a single OFDM symbol to achieve reliable estimation, hence making it more suitable to systems with stringent delay requirement and mobility-induced channel variation. The proposed scheme is devised to perfectly retrieve frequency offset in the absence of noise. Quite remarkably, we show that in the presence of channel noise, this intuitive scheme is indeed the maximum likelihood estimate of the carrier frequency offset. The possible presence of virtual carriers are also accommodated in the system model, and some interesting observations are obtained. The Cramer-Rao lower bound is derived for the oversampling-based signal model, and we show through numerical simulation that the proposed algorithm is efficient. Practical issues such as identifiability, the front-end filter bandwidth, and the possible presence of correlated noises are also carefully addressed.     

用CMOS工艺实现非接触IC卡天线的集成化设计

论述了用CMOS工艺实现非接触式IC卡天线的集成化需要考虑的各个方面,建立了集成天线的模型,给出了合理的设计方案,并通过实验验证了模型和设计方案.实验结果表明,采用片上天线完全可以提供非接触式IC卡工作所需要的能量.在频率为2 2 .5 MHz、感应强度为6×10 - 4 T的磁场中,面积为2 m m×2 mm的集成天线可以为10 kΩ的负载提供1.2 2 5 m W的能量.     

Mining predecessor–successor rules from DAG data

Data mining extracts implicit, previously unknown, and potentially useful information from databases. Many approaches have been proposed to extract information, and one of the most important ones is finding association rules. Although a large amount of research has been devoted to this subject, none of it finds association rules from directed acyclic graph (DAG) data. Without such a mining method, the hidden knowledge, if any, cannot be discovered from the databases storing DAG data such as family genealogy profiles, product structures, XML documents, task precedence relations, and course structures. In this article, we define a new kind of association rule in DAG databases called the predecessor–successor rule, where a node x is a predecessor of another node y if we can find a path in DAG where x appears before y. The predecessor–successor rules enable us to observe how the characteristics of the predecessors influence the successors. An approach containing four stages is proposed to discover the predecessor–successor rules. © 2006 Wiley Periodicals, Inc. Int J Int Syst 21: 621–637, 2006.     

大型往复式压缩机的配管设计

大型往复式压缩机功率大、占地面积大,管道振动问题也更为突出。笔者结合实践经验,对大型往复式压缩机的配管设计进行探讨,说明了平面布置与管道防振设计的密切关系,并介绍了管道防振设计的方法和步骤,以及相对简单的复杂管系气柱固有频率的转移矩阵计算方法。     

区域分割法辅助计算复杂图像面积

介绍计算具有复杂边缘轮廓的图像面积的区域分割法。采用鼠标多边形作图法近似圈定待处理的图像区域。本文由格林定理出发得到有限连续边界与其包围区域面积之间的函数关系,并且应用这一函数关系得出多边形与其包围区域面积的数学关系,近似得到图像区域面积。文中以烟幕图像为例对上述结论进行了验证。文章最后给出了在VC++环境下实现多边形分割的部分源代码。     

Data-efficient blind OFDM channel estimation using receiver diversity

We investigate non data-aided channel estimation for cyclically prefixed orthogonal frequency division multiplexing (OFDM) systems. By exploiting channel diversity using only two receive antennas, a blind deterministic algorithm is proposed. Identifiability conditions are derived that guarantee the perfect channel retrieval in the absence of noise. In the presence of noise, the proposed method has the desired property of being data efficient-only a single OFDM block is needed to achieve good estimation performance for a wide range of SNR values. The algorithm is also robust to input symbols as it does not have any restriction on the input symbols with regard to their constellation or their statistical properties. In addition, this diversity-based algorithm is computationally efficient, and its performance compares favorably to most existing blind algorithms.