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.     

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

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

Impulsive Noise Suppression from Highly Distorted Images with Triangular Interpolants

In this paper a new filter, Triangular Interpolant Based Impulsive Noise Suppression Filter (SF), is proposed to restore images corrupted by fixed valued impulsive noise (IN). The proposed filter comprises two main stages: detection of noise and restoration of corrupted pixels. The SF achieves the restoration of the detected noisy pixels by using one of the Triangular Interpolant techniques and leaves the other pixels unaltered. Simulation results reveal that the proposed filter shows better performance than the highly approved IN suppression filters across a wide noise density ranging from 10% to 90%. The proposed filter also perfectly achieves the robustness anddetail preservation with reduced computational complexity.     

降低紧密纺色织物浆纱断头的几项措施

为了降低紧密纺色织品种的浆纱断头,提高产品质量,分析了该品种在浆纱过程中产生断头的原因,介绍了在操作方面应采取的措施及在工艺方面应注意的问题.通过适当加大干分绞区张力及前浆槽纱线的喂入张力、预烘张力,单独控制前浆槽的浆液粘度,确保回潮率满足工艺要求,有效解决了紧密纺色织品种浆纱断头问题,提高了织轴质量.     

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.     

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.