Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.     

浅谈程序设计中一题多解的教学方法

中等职业学校一般开设VB、VC及数据库等涉及程序设计的计算机课程。本文拟就程序设计中一题多解的教学方法进行探讨。     

历史中心区复兴中的地域性问题与对策

本文以上海思南路47～48街坊改造为例,探讨城市形态更新与居民外迁问题,并期待相关地域性社会对策的出现。     

Apollonius tenth problem via radius adjustment and Möbius transformations

The Apollonius Tenth Problem, as defined by Apollonius of Perga circa 200 B.C., has been useful for various applications in addition to its theoretical interest. Even though particular cases have been handled previously, a general framework for the problem has never been reported. Presented in this paper is a theory to handle the Apollonius Tenth Problem by characterizing the spatial relationship among given circles and the desired Apollonius circles. Hence, the given three circles in this paper do not make any assumption regarding on the sizes of circles and the intersection/inclusion relationship among them. The observations made provide an easy-to-code algorithm to compute any desired Apollonius circle which is computationally efficient and robust.     

Gorillas (Gorilla gorilla) and Orangutans (Pongo pygmaeus) Encode Relevant Problem Features in a Tool-Using Task.

Two important elements in problem solving are the abilities to encode relevant task features and to combine multiple actions to achieve the goal. The authors investigated these 2 elements in a task in which gorillas (Gorilla gorilla) and orangutans (Pongo pygmaeus) had to use a tool to retrieve an out-of-reach reward. Subjects were able to select tools of an appropriate length to reach the reward even when the position of the reward and tools were not simultaneously visible. When presented with tools that were too short to retrieve the reward, subjects were more likely to refuse to use them than when tools were the appropriate length. Subjects were proficient at using tools in sequence to retrieve the reward. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

美国西雅图先锋广场历史保护区的形成

考察美国西雅图先锋广场历史保护区形成的过程,可以看出城市历史文化遗存的保护是经济与历史文化合力作用的结果,公众参与在城市历史文化保护工作中发挥着重要的作用。我国城市经济高速发展,保护与发展的矛盾冲突还没得到很好解决,先锋广场的例子对我们具有一定的参考价值。     

Accelerating filtering techniques for numeric CSPs

Search algorithms for solving Numeric CSPs (Constraint Satisfaction Problems) make an extensive use of filtering techniques. In this paper¹ we show how those filtering techniques can be accelerated by discovering and exploiting some regularities during the filtering process. Two kinds of regularities are discussed, cyclic phenomena in the propagation queue and numeric regularities of the domains of the variables. We also present in this paper an attempt to unify numeric CSPs solving methods from two distinct communities, that of CSP in artificial intelligence, and that of interval analysis.     

省煤器管开裂原因分析

对省煤器开裂管进行了化学成分及宏、微观分析。分析结果表明，在高温高压条件下，在其焊缝溶合区出现粗大的魏氏组织，管材中的珠光体组织产生了不同程度的球化，而母材组织又存在严重的带状组织。在过热条件下熔合区极易出现裂纹，并由此快速扩展，造成省煤器管开裂。     

The problem of definition expansion and contraction

This article is the fourth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research focuses on finding criteria that would enable an automated reasoning program to expand or contract definitions wisely. For evaluating a proposed solution to this research problem, we include suggestions concerning possible test problems.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38.     

New quadratic models for the maximum weighted cut problem

New quadratic models are proposed to improve the upper-bound estimates in the maximum weighted cut problem. They are found by two original methods for deriving redundant quadratic constraints. A well-known linear model is shown to follow from the models proposed. Recommendations on how to develop its strengthened analogs are given. This study is partially sponsored from the grant UM2-2574-KV-03 (CRDF Cooperative Grants Program). __________ Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 63—75, January–February 2006.