User activities and the heterogeneity of urban space:The case of Dahiyat Al Hussein park

Urban researchers have maintained a constant interest in the complexity and continuity of urban space usage. Some have applied actor–network theory (ANT) to investigate the heterogeneity of spaces and present them through the networks of their users’ activities. However, these accounts are predominantly limited in examining the extent to which these spaces may be heterogeneous when exploring such networks. This paper draws on recent ANT scholarship, which employs an ethnographic research conducted in a main park in a housing project at Dahiyat Al Hussein in Amman, Jordan. The findings describe the complex and unpredictable negotiations that occur within spaces by documenting the varieties and interrelations among user activity networks within this common and shared urban space. This research reveals the extent to which spaces, parks in this case, may be heterogeneous by unpacking their usage. The conclusions and insights assert the necessity of paying attention to design detail and creating designs that are responsive to evolving user activities.     

面阵凝视型成像空间应用技术

介绍了凝视型成像技术的特点、优势、现状和发展趋势，论述了凝视型成像技术应用于遥感领域发展的重要性，总结了面阵凝视型成像技术作为空间应用所涵盖的关键技术，将为我国空间凝视型成像技术的进一步发展提供参考。     

Computing surfaces invariant under subdivision

In this paper, we propose a general subdivision algorithm for generating surfaces. The algorithm has as motivation our earlier work on the design of free form curves where similar ideas were investigated. Here we describe some properties of uniform refinement algorithms for surface generation. A detail analysis of their properties will be given later by one of us.     

Education-driven research in CAD

We argue for a new research category, named education-driven research (EDR), which fills the gap between traditional field-specific research that is not concerned with educational objectives and research in education that focuses on fundamental teaching and learning principles and possibly on their customization to broad areas (such as mathematics or physics), but not to specific disciplines (such as CAD). The objective of EDR is to simplify the formulation of the underlying theoretical foundations and of specific tools and solutions in a specialized domain, so as to make them easy to understand and internalize. As such, EDR is a difficult and genuine research activity, which requires a deep understanding of the specific field and can rarely be carried out by generalists with primary expertise in broad education principles. We illustrate the concept of EDR with three examples in CAD: (1) the Split and Tweak subdivisions of a polygon and its use for generating curves, surfaces, and animations; (2) the construction of a topological partition of a plane induced by an arbitrary arrangement of edges; and (3) a romantic definition of the minimal and Hausdorff distances. These examples demonstrate the value of using analogies, of introducing evocative terminology, and of synthesizing the simplest fundamental building blocks. The intuitive understanding provided by EDR enables the students (and even the instructor) to better appreciate the limitations of a particular solution and to explore alternatives. In particular, in these examples, EDR has allowed the author to: (1) reduce the cost of evaluating a cubic B-spline curve; (2) develop a new subdivision curve that is better approximated by its control polygon than either a cubic B-spline or an interpolating 4-point subdivision curve; (3) discover how a circuit inclusion tree may be used for identifying the faces in an arrangement; and (4) rectify a common misconception about the computation of the Hausdorff error between triangle meshes. We invite the scientific community to encourage the development of EDR by publishing its results as genuine research contributions in peer-reviewed professional journals.     

High training set size reduction by space partitioning and prototype abstraction

Instance-based learning methods like the nearest neighbour classifier generally suffer from the indiscriminate storage of all training instances, resulting in large memory requirements and slow execution speed. In this paper, new training set size reduction methods based on prototype generation and space partitioning are proposed. Experimental results show that the new algorithms achieve a very high reduction rate with still an important classification accuracy.     

Second-order accurate constraint formulation for subdivision finite element simulation of thin shells

We present a new method for enforcing boundary conditions within subdivision finite element simulations of thin shells. The proposed framework is demonstrated to be second-order accurate with respect to increasing refinement in the displacement and energy norm for simply supported, clamped, free and symmetric boundary conditions. Second-order accuracy on the boundary is consistent with the accuracy of subdivision-based approaches for the interior of a body. Our proposed framework is applicable to both triangular and quadrilateral refinement schemes, and does not impose any topological requirements upon the underlying subdivision control mesh. Several examples from an obstacle course of benchmark problems are used to demonstrate the convergence of the scheme. Copyright © 2004 John Wiley & Sons, Ltd.     

A space- and time-efficient local-spin spin lock

A simple code transformation is presented that reduces the space complexity of Yang and Anderson's local-spin mutual exclusion algorithm. In both the original and the transformed algorithm, only atomic read and write instructions are used; each process generates Θ(logN) remote memory references per lock request, where N is the number of processes. The transformed algorithm uses Θ(N) distinct variables, which is clearly optimal.     

金属/聚合物复合材料对中能电子的屏蔽作用研究

运用MULASSIS计算程序模拟计算了不同组成的屏蔽材料对空间辐射环境的屏蔽效果,在此基础上进行屏蔽材料的初步设计,并制备了一系列不同组成的金属/聚合物复合材料,结合中能电子照射的实验结果,讨论了组成对金属/聚合物复合材料的屏蔽效果的影响.研究发现,高原子序数和低原子序数金属混合添加的复合物样品具有较好的屏蔽效果.     

非平面对称磁场的空间展开及样条函数表述

为了研究带电粒子光学系统的光学特性,需要知道系统中磁场的空间分布。实际磁场往往不具有严格的平面对称性质,一些作者曾就这类磁场的空间展开做过不少工作。但他们的工作是在柱坐标系统中进行的,适用于诸如回旋加速器、双向聚焦磁分析器、环形磁β谱仪等一类装置的磁场分析。对于大型同位素电磁分离器(calutron)那样一类装置,其磁场分布需要     

Graph‐Theory Approach to Eigenvalue Problem of Large Space Structures

The dynamic analysis and control system design of large space structures involve the solution of the large‐dimensional generalized matrix eigenvalue problem. The computational effort involved is proportional to the third power of the dimension of the matrices involved. To minimize the computational time a graph‐theory approach to reduce a matrix to lower‐ordered submatrices is proposed. The matrix‐reduction algorithm uses the Boolean matrices corresponding to the original numerical matrices and, thus, the computational effort to reduce the original matrix is nominal. The computational savings directly depend upon the number of submatrices into which the original matrix is reduced. A free‐free square plate is considered as an example to illustrate the technique. In this example a matrix of 16th order is reduced to three scalars corresponding to three rigid‐body modes, and three matrices of order three and one matrix of order four.