多约束的桥梁结构拓扑优化

基于ESO (Evolutionary Structural Optimization)的拓扑优化方法,本文提出了一种适应于桥梁结构的拓扑优化方法。引进了两种性能指标公式来确定最佳拓扑设计。另外,为了更有效地尝试改进最终设计的细节,而又不进行更精细有限元网格的完整分析,这里提出了一种精细网络设计方案。再者,结合细啃技术,完成了考虑应力、位移、频率约束的斜拉桥优化设计。通过几种桥梁的设计优化,表明该方法的可应用性、简洁性和有效性。     

Infinite-horizon Scheduling Algorithms for Optimal Search for Hidden Objects

This paper considers discrete search problems in which a decision-maker has to find objects lost or hidden in a given set of locations so as to minimize the expected losses incurred. Given a chance to look for a hidden object in the same location infinitely many times, this type of problem, in contrast to standard scheduling problems, has an infinite sequence as its solution. Thus we are concerned to find an algorithm that yields an optimal solution, rather than the optimal sequence itself. Using combinatorial techniques, fast optimal algorithms for solving the problems are obtained, and optimality conditions are presented for search criteria, under which the local-search algorithms yield the global optimum.     

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.     

一次国际设计竞赛的尝试--多维住宅设计

在后工业时代，建筑设计已经冲破了西方思维所惯用的二元对立方式的约束，呈现出日新月异的景象，建筑表皮的创作尤为突出。这个住宅设计是从四维分解到四维连续的一种大胆尝试，并引入拓扑学的基本方法处理动态空间。     

Color Grouping in Space and Time: Evidence From Negative Color-Based Carryover Effects in Preview Search.

Five experiments addressed the role of color grouping in preview search (D. G. Watson & G. W. Humphreys, 1997). Experiment 1 used opposite color ratios of distractors in preview and second search displays, creating equal numbers of distractors in each color group in the final display. There was selective slowing for new targets carrying the majority color of the old items. This effect held when there was no bias in the preview and only the second search set had an uneven color ratio (Experiment 2). In Experiment 3, participants had foreknowledge of the target color, and effects were shown over and above those due to color biases. Experiment 4 demonstrated negative color carryover even when previews changed color. Experiment 5 showed reduced color carryover effects when previews were presented more briefly. Collectively, the results provide evidence for inhibitory carryover effects in preview search based on feature grouping. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Response Selection in Visual Search: The Influence of Response Compatibility of Nontargets.

The authors used visual search tasks in which components of the classic flanker task (B. A. Eriksen & C. W. Eriksen, 1974) were introduced. In several experiments the authors obtained evidence of parallel search for a target among distractor elements. Therefore, 2-stage models of visual search predict no effect of the identity of those distractors. However, clear compatibility effects of the distractors were obtained: Responses were faster when the distractors were compatible with the response than when they were incompatible. These results show that even in parallel search tasks identity information is extracted from the distractors. In addition, alternative interpretations of the results in terms of the occasional identification of a distractor before or after the target was identified could be ruled out. The results showed that flat search slopes obtained in visual search experiments provide no benchmark for preattentive processing. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Effects of surrounding brightness on visual search for safety colors

The present article reports the investigation of the effects of surrounding brightness on a visual search for three safety colors: red, orange, and yellow. Images of visual stimuli consisting of an array of colored circles placed on a large visual field (a visual angle of 40°) were displayed on an 80‐in. screen with a DLP projector. Experiment I examined the search efficiency under three levels of background luminance that were equivalent to the three target luminances. The results showed that the search efficiency for the orange target decreased as the number of distractors increased, under each of the background luminance levels, whereas the efficiency scarcely decreased for the red and yellow targets. Although a reduction in background luminance increased the search efficiency for the orange target, it is suggested that the effect of background luminance is smaller than the effect of the target color in search efficiency. Experiment II examined the search efficiency under three conditions of low levels of incident illuminance, which were matched with a linear regression to the luminance of color chips of safety colors measured twilight conditions. The results showed that the search efficiency for the orange target decreased as the number of distractors increased under each of the different illuminance conditions, whereas the efficiency scarcely decreased for red and yellow targets. Furthermore, as illuminance decreased, the search time for the orange target was more greatly impacted than for red or yellow. These results imply that the recognition of orange tends to be influenced by the surrounding brightness. © 2005 Wiley Periodicals, Inc. Col Res Appl, 30, 400–409, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20152     

一个基于优化的有限元模型修正方法

本文提供了一个基于一阶搜索优化的有限元模型修正方法。它只需利用结构模态试验的部分固有频率，就能获得较精确的有限元模型。文中附有某无人机上垂尾有限元模型修正的实例。根据上垂尾前二阶试验的固有频率，采用本文方法，对有限元模型进行了修正。修正后有限元模型的前二阶固有频率与试验值的相对误差在2．35％以内，而第三阶固有频率与试验值的相对误差仅为5．81％。它不仅大大地缩小了用修正前有限元模型算得的固有频率与试验值的相对误差，而且还能较精确地预测无试验结果的高阶固有频率值。     

A note on stress-constrained truss topology optimization

The purpose of this brief note is to demonstrate that general-purpose optimization methods and codes should not be discarded when dealing with stress-constrained truss topology optimization. By using a disaggregated formulation of the considered problem, such methods may find also “singular optima”, without using perturbation techniques like the ε-relaxed approach. Received February 19, 2002