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.     

Research on Circular Area Search algorithm of multi-robot service based on SOA cloud platform

Considering autonomous mobile robots with a variety of specific functions as a kind of service, when there are many types and quantities of services and the density of regional services is large, proposing an algorithm of Circular Area Search (CAS) because of the problem of multi-robot service scheduling in various areas. Firstly, Django is used as the web framework to build the Service-Oriented Architecture (SOA) multi-robot service cloud platform, which is the basic platform for multi-service combination. Then, the service type, the latitude and longitude and the scoring parameters of the service are selected as the service search metrics to design the CAS algorithm that based on the existing service information registered in MySQL and the Gaode Map for screening optimal service, and then providing the service applicant with the best service. Finally, the service applicant applies for the self-driving tour service as an example to perform performance simulation test on the proposed CAS algorithm. The results show that the CAS algorithm of the multi-robot service cloud platform proposed in this paper is practical compared to the global search. And compared with the Greedy Algorithm experiment, the service search time is reduced about 58% compared with the Greedy Algorithm, which verifies the efficiency of CAS algorithm.     

Internet中文信息搜索引擎评析

介绍搜索引擎的分类、对比和查询技巧。     

国内电子商务门户网站的现状研究

从电子商务在我国迅速发展的角度出发，系统地介绍了我国电子商务网站的典范：阿里巴巴、淘宝。从电子商务的模式出发分析了其经营理念，成功因素及其不足，对中国的电子商务目前状况作了分析，并提出展望。     

Breaking the search space symmetry in partitioning problems: An application to the graph coloring problem

Many problems consist in splitting a set of objects into different groups so that each group verifies some properties. In practice, a partitioning is often encoded by an array mapping each object to its group numbering. In fact, the group number of an object does not really matter, and one can simply rename each group to obtain a new encoding. That is what we call the symmetry of the search space in a partitioning problem. This property may be prejudicial for optimization methods such as evolutionary algorithms (EA) which require some diversity during the search.     

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)那样一类装置,其磁场分布需要