Three-dimensional reconstruction on PC-Windows platform for evaluation of living donor nephrectomy

Evaluation of renal vasculature was necessary for preoperative donor assessment in living donor kidney transplantation, and the ability to view the vascular imaging in three-dimensional (3D) space should be helpful undoubtedly. Considering the widespread use of personal computer (PC) systems, we aimed to find a handy way to display the anatomy of the renal arterial and venous systems of potential donors on PC-Windows platform. Ten living-related donors were included in this study. Serial computed tomography (CT) images were loaded into Amira 3.1 running on a PC with Windows XP. Following image crop, segmentation and 3D reconstruction, we got the 3D images and the video clips. According to the displays which were confirmed by latter intraoperative findings, eight donors had single renal vessels, one had a left accessory renal artery and one had a right accessory renal artery. This project offered a new approach to evaluate the renal vessel anatomy in living donor kidney transplantation, and it was favorable for accuracy and popularizing.     

知识获取技术及其在网络智能故障诊断中的应用

基于遗传算法提出了一种新型的机器学习方法,它利用遗传算法的全局寻优手段,为解决知识获取这一瓶颈问题另辟捷径。论述了该方法的原理及其实现过程,并且给出了网络故障诊断应用实例,证明了它的有效性。     

基于RS—485的楼宇智能监控系统的设计

本文介绍一种基于RS－485串行总线结构的多单片机分布式系统,该系统可满足大型企业、宾馆、银行、个人住宅等场所的保安需要。     

一个农户生态经济系统的分析

对沈阳市桃仙镇荒山子村一个农户生态经济系统进行分析,结果表明：该农户正处于从传统农业向现代农业的过渡阶段,经济效益较好,整体技术水平和生态效益低,后两了该农户的进一步发展,以目前的生产水平,应采取户与户联合,取得规模效益,以当前农业产业化的发展。     

对重催I/A'S系统三冲量控制回路的探讨

本文主要对广州石油化工总厂重油催化裂化装置的复杂回路——三冲量控制在I/A'S系统的实现进行探讨和实施。     

Optimizing multiple dimensional queries simultaneously in multidimensional databases

Some significant progress related to multidimensional data analysis has been achieved in the past few years, including the design of fast algorithms for computing datacubes, selecting some precomputed group-bys to materialize, and designing efficient storage structures for multidimensional data. However, little work has been carried out on multidimensional query optimization issues. Particularly the response time (or evaluation cost) for answering several related dimensional queries simultaneously is crucial to the OLAP applications. Recently, Zhao et al. first exploited this problem by presenting three heuristic algorithms. In this paper we first consider in detail two cases of the problem in which all the queries are either hash-based star joins or index-based star joins only. In the case of the hash-based star join, we devise a polynomial approximation algorithm which delivers a plan whose evaluation cost is $ O(n^{\epsilon }$) times the optimal, where n is the number of queries and is a fixed constant with . We also present an exponential algorithm which delivers a plan with the optimal evaluation cost. In the case of the index-based star join, we present a heuristic algorithm which delivers a plan whose evaluation cost is n times the optimal, and an exponential algorithm which delivers a plan with the optimal evaluation cost. We then consider a general case in which both hash-based star-join and index-based star-join queries are included. For this case, we give a possible improvement on the work of Zhao et al., based on an analysis of their solutions. We also develop another heuristic and an exact algorithm for the problem. We finally conduct a performance study by implementing our algorithms. The experimental results demonstrate that the solutions delivered for the restricted cases are always within two times of the optimal, which confirms our theoretical upper bounds. Actually these experiments produce much better results than our theoretical estimates. To the best of our knowledge, this is the only development of polynomial algorithms for the first two cases which are able to deliver plans with deterministic performance guarantees in terms of the qualities of the plans generated. The previous approaches including that of [ZDNS98] may generate a feasible plan for the problem in these two cases, but they do not provide any performance guarantee, i.e., the plans generated by their algorithms can be arbitrarily far from the optimal one. Received: July 21, 1998 / Accepted: August 26, 1999     

不同肟类N－甲基氨基甲酸酯的杀虫活性和离体胆碱酯酶抑制作用的研究

文中测定了一系列α－氰基甲酮肟和三氟甲基苯基甲酮肟类Ｎ－甲基氨基甲酸酯的杀虫活性和抑制胆碱酯酶活性。α－氰基烷基甲酮肟类Ｎ－甲基氨基甲酸酯具有极好的杀虫活性和抑制胆碱酯酶活性，而α－氰基苯基甲酮肟类衍生物仅仅呈现抑制胆碱酯酶活性。三氟甲基苯基甲酮肟类Ｎ－甲基氨基甲酸酯具有有力的杀虫活性和胆碱酯酶抑制活性。