催化精馏合成N-异丙基苯胺

在Joback基团贡献法估算反应的G ibbs函数的基础上,得到了异丙醇与苯胺合成N-异丙基苯胺的平衡常数与反应温度的关系式。研究了回流比、异丙醇与苯胺的摩尔比、塔釜操作温度、苯胺进料口位置距塔顶的距离对异丙醇与苯胺催化精馏合成N-异丙基苯胺的影响,确定了适宜的工艺条件:回流比2.5~3.5、异丙醇与苯胺的摩尔比1.5、塔釜操作温度223℃、苯胺进料口位置距塔顶300~400mm。在优化条件下,苯胺的转化率可达到99%,N-异丙基苯胺的选择性可达到99.5%,N-异丙基苯胺的质量分数可稳定在98.8%以上。     

五种恒虚警方法性能分析

比较了五种恒虚警方法在各种杂波背景下的检测性能,得出CMLD-CFAR是工程上可以实现且检测性能比较好的一种恒虚警处理方法.     

从RC5到RC6

论文详细描述并分析了从RC5到RC6的演化设计过程,在详细研究了RC6性能的同时,指出了应该如何从一个旧的密码设计出好的新密码。最后对RC6和Rijndael作了一些比较,指出各自在性能上的优缺点。     

SIMPLIS环境中开关电源集成电路控制器模型的开发及应用

介绍现代开关电源行业仿真工作的意义和现状,以及专用仿真软件包SIM etrix/SIMPLIS的优点和不足。通过实例给出SIMPLIS环境中集成电路控制芯片的建模过程,并就其中的关键技术予以简单讨论。     

Automatic image hanging protocol for chest radiographs in PACS.

Chest radiography is one of the most widely used techniques in diagnostic imaging. It comprises at least one-third of all diagnostic radiographic procedures in hospitals. However, in the picture archive and communication system, images are often stored with the projection and orientation unknown or mislabeled, which causes inefficiency for radiologists' interpretation. To address this problem, an automatic hanging protocol for chest radiographs is presented. The method targets the most effective region in a chest radiograph, and extracts a set of size-, rotation-, and translation-invariant features from it. Then, a well-trained classifier is used to recognize the projection. The orientation of the radiograph is later identified by locating the neck, heart, and abdomen positions in the radiographs. Initial experiments are performed on the radiographs collected from daily routine chest exams in hospitals and show promising results. Using the presented protocol, 98.2% of all cases could be hung correctly on projection view (without protocol, 62%), and 96.1% had correct orientation (without protocol, 75%). A workflow study on the protocol also demonstrates a significant improvement in efficiency for image display.     

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.     

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

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

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.