智能建筑空调机组监控技术及其系统结构

针对目前智能建筑中几种常见的中央空调机组单元配置及其运行机制,简要分析了采用网络化数字监控技术的空调机组的工作原理,并说明了此类空调配置方案的控制系统结构及其性能特点和应用场合。     

Interactive transfer function design based on editing direct volume rendered images

Direct volume rendered images (DVRIs) have been widely used to reveal structures in volumetric data. However, DVRIs generated by many volume visualization techniques can only partially satisfy users' demands. In this paper, we propose a framework for editing DVRIs, which can also be used for interactive transfer function (TF) design. Our approach allows users to fuse multiple features in distinct DVRIs into a comprehensive one, to blend two DVRIs, and/or to delete features in a DVRI. We further present how these editing operations can generate smooth animations for focus + context visualization. Experimental results on some real volumetric data demonstrate the effectiveness of our method.     

Performance evaluation of a dental handpiece in simulation of clinical finishing using a novel 2DOF in vitro apparatus

This paper reports on the performance evaluation of a dental handpiece in simulation of clinical finishing using a novel two-degrees-of-freedom (2DOF) in vitro apparatus. The instrumented apparatus consisted of a two-dimensional computer-controlled coordinate worktable carrying a dental handpiece, a piezoelectric force dynamometer, and a high-speed data acquisition and signal conditioning system for simulating the clinical operations and monitoring the dental finishing processes. The performance of the dental handpiece was experimentally evaluated with respect to rotational speed, torque, and specific finishing energy under the applied clinical finishing conditions. The results show that the rotational speeds of the dental handpiece decreased by increasing either the depth of cut or the feed rate at a constant clinically applied air pressure and water flowrate. They also decreased when increasing both the tangential and normal finishing forces. The specific finishing energy decreased with an increase in either depth of cut or feed rate, while the finishing torque increased as either the depth of cut or the feed rate was increased. Implications of these results were to provide guidance for proper applications of dental handpieces in clinical practice.     

“龙腾”R2微处理器Cache单元的设计与实现

合理地组织一个多级的高速缓冲存储器(Cache)是一种有效的减少存储器访问延迟的方法。论文提出了一种设计32位超标量微处理器Cache单元的结构,讨论了一级Cache、二级Cache设计中的关键技术,介绍了Cache一致性协议的实现,满足了“龙腾”R2微处理器芯片的设计要求。整个芯片采用0.18umCMOS工艺实现,芯片面积在4.1mm×4.1mm之内,微处理器核心频率超过233MHz,功耗小于1.5W。     

1000BASE—T—在5类铜缆上实现千兆传输

１０００ＢＡＳＥ－Ｔ是一种在５类铜缆上传输１０００Ｍｂｐｓ速度的以太网解决方案。本文介绍了１０００ＢＡＳＥ－Ｔ的基本特性、关键性能参数及其设计。     

科学规划、合理利用和保护松辽流域重点河道岸线

在深入开展岸线资源及其开发利用情况、河道演变规律调查评价的基础上,全面分析岸线资源利用状况和需求以及岸线资源利用与河道整治工程、河势控制工程的关系,在确保防洪安全、供水安全和保护好水生态环境的基础上,对流域重要河段的岸线进行评估,合理规划岸线资源的利用与保护,并提出岸线利用与保护的指导意见,进一步明确河道岸线的管理范围,为实现岸线资源的科学管理,加强水行政执法提供技术支撑。     

对广东省水库移民项目扶持模式多元化的探讨

以广东省为例,总结了其水库移民后期扶持工作的特点,一直走在时代的前列,取得了阶段性成果.为保持其创新性和先进性,针对广东省现阶段注重基础设施建设的“一村一策整村推进”后期扶持方式特点,进一步提出了人力资源综合开发,金融信贷,农业综合开发,第二及第三产业开发等5种水库移民扶持模式,建立了多元化项目扶持的框架,为广东省丰富水库移民扶持方式提供了参考.     

A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems

This paper investigates the first hybrid scatter search and path relinking meta-heuristic for the Delay-Constrained Least-Cost (DCLC) multicast routing problem. The underpinning mathematic model of the DCLC multicast routing problem is the constrained Steiner tree problem in graphs, a well known NP-complete problem. After combining a path relinking method as the solution combination method in scatter search, we further explore two improvement strategies: tabu search and variable neighborhood search, to intensify the search in the hybrid scatter search algorithm. A large number of simulations on some benchmark instances from the OR-library and a group of random graphs of different characteristics demonstrate that the improvement strategy greatly affects the performance of the proposed scatter search algorithm. The hybrid scatter search algorithm intensified by a variable neighborhood descent search is highly efficient in solving the DCLC multicast routing problem in comparison with other algorithms and heuristics in the literature.     

A pattern recognition based intelligent search method and?two?assignment problem case?studies

Numerous papers based on various search methods across a wide variety of applications have appeared in the literature over recent years. Most of these methods apply the following same approach to address the problems at hand: at each iteration of the search, they first apply their search methods to generate new solutions, then they calculate the objective values (or costs) by taking some constraints into account, and finally they use some strategies to determine the acceptance or rejection of these solutions based upon the calculated objective values. However, the premise of this paper is that calculating the exact objective value of every resulting solution is not a must, particularly for highly constrained problems where such a calculation is costly and the feasible regions are small and disconnected. Furthermore, we believe that for newly-generated solutions, evaluating the quality purely by their objective values is sometimes not the most efficient approach. In many combinatorial problems, there are poor-cost solutions where possibly just one component is misplaced and all others work well. Although these poor-cost solutions can be the intermediate states towards the search of a high quality solution, any cost-oriented criteria for solution acceptance would deem them as inferior and consequently probably suggest a rejection. To address the above issues, we propose a pattern recognition-based framework with the target of designing more intelligent and more flexible search systems. The role of pattern recognition is to classify the quality of resulting solutions, based on the solution structure rather than the solution cost. Hence, the general contributions of this work are in the line of “insights” and recommendations. Two real-world cases of the assignment problem, i.e. the hospital personnel scheduling and educational timetabling, are used as the case studies. For each case, we apply neural networks as the tool for pattern recognition. In addition, we present our theoretical and experimental results in terms of runtime speedup.     

A compact genetic algorithm for the network coding based resource minimization problem

In network coding based data transmission, intermediate nodes in the network are allowed to perform mathematical operations to recombine (code) data packets received from different incoming links. Such coding operations incur additional computational overhead and consume public resources such as buffering and computational resource within the network. Therefore, the amount of coding operations is expected to be minimized so that more public resources are left for other network applications.