高速公路服务区综合楼建筑设计初探

本文以高速公路服务区综合楼为研究对象,分析其作为高速公路沿线配套建筑设施的特殊性;并对设计过程中涉及的建筑功能、流线、布局、形态等问题进行探讨。     

传输核心汇聚机房工艺布局规划研究

本文通过理论分析与实地测试,探究了当前传输核心汇聚机房普遍存在的局部温度过高问题,分析了造成该问题的主要原因,并提出了降低机房局部温度过高的工艺布局规划方法.     

Visualizing program dependencies: An experimental study

This paper addresses the problem of visualizing program dependencies (i.e. entities and their relations). A code visualization tool that maintains a repository of structural and functional dependencies for C programs is described. Visualization of such dependencies is accomplished by using a presentation model which combines data and control flow information. Moreover, transformation mechanisms and partitioning techniques used by the tool provide the means for managing large graphical representations. The quantitative results from an experimental study using this tool indicate that the productivity of its users was increased and that the quality of changes made during a program modification exercise was improved. Furthermore, the qualitative results have shown that its presentation model, transformation mechanisms and partitioning techniques constitute a promising platform for the comprehension and maintenance of C programs. Finally, the outcome of an empirical evaluation of the tool and the enhancement of its functionality and user interface are also discussed in this paper.     

一种时延驱动的VLSI布局方法

时廷特性对于高性能的超大规模集成电路(VLSI)来讲是十分重要的。本文提出了一个新的时延驱动的布局方法。在初始布局中,我们提出了给线网加权的新方法,在迭代改善布局中提出了等位场的概念。实验结果表明:这是一种有效的时延驱动布局方法。     

射频电路PCB设计

介绍了采用PROTEL99SE进行射频电路PCB设计的设计流程。为了保证电路的性能，在进行射频电路PCB设计时应考虑电磁兼容性。因而重点讨论了元器件的布局与布线原则来达到电磁兼容的目的。     

天津市中心城市开发区发展思路探讨

天津市中心城市开发区一体化发展应突出重点,结合现有的基础和发展前景,择优发展;合理分工,突出主导职能,择优发展主导产业;调整布局,优化开发区发展的空间结构。     

Data-Path布图系统的数据管理

Data-Path布图系统需要有效的数据管理作为支撑。该数据管理工作主要包括数据格式转换、数据结构设计和数据接口设计等方面。针对一个实际的Data-Path布图系统，设计了Verilog文件到DEF文件的转换算法，进行了相关数据接口的实现，指出了数据管理的特点与实现方法。     

0.9μm设计流程的提升

介绍了将0.9μm设计流程中的版图数据库缩到到0.6μm的过程，然后列出了使用0.6μm单元库所应作的流程的修改，主要包括布线和最终版图处理的过程，最后简单介绍了单元性能库的提升。     

Multiple Translational Containment Part I: An Approximate Algorithm

We present an algorithm for finding a solution to the two-dimensional translational approximate multiple containment problem: find translations for k polygons which place them inside a polygonal container so that no point of any polygon is more than 2ε inside of the boundary of any other polygon. The polygons and container may be nonconvex. The value of ε is an input to the algorithm. In industrial applications the containment solution acts as a guide to a machine cutting out polygonal shapes from a sheet of material. If ε is chosen to be a fraction of the cutter's accuracy, then the solution to the approximate containment problem is sufficient for industrial purposes. Given a containment problem, we characterize its solution and create a collection of containment subproblems from this characterization. We solve each subproblem by first restricting certain two-dimensional configuration spaces until a steady state is reached, and then testing for a solution inside the configuration spaces. If necessary, we subdivide the configuration spaces to generate new subproblems. The running time of our algorithm is , where s is the largest number of vertices of any polygon generated by a restriction operation. In the worst case s can be exponential in the size of the input, but, in practice, it is usually not more than quadratic. Received June 24, 1994; revised August 22, 1995.