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.     

MIMO-GFDM系统中低复杂度动态禁忌搜索检测算法的改进

针对多输入多输出的广义频分复用（MIMO-GFDM）系统的等效信道矩阵维度极大，传统的MIMO检测算法复杂度高且性能不佳的问题，将大规模MIMO系统中的动态禁忌搜索（RTS）检测算法运用到MIMO-GFDM系统中，并解决了RTS算法初始值的求解复杂度高的问题。首先利用最小均方误差（MMSE）检测算法所用到矩阵的正定对称性将矩阵Cholesky分解，并结合Sherman-Morrison公式迭代计算初始值，降低了初始值求逆的高复杂度；然后以改进的MMSE检测结果作为RTS算法的初始值，从初始值逐步全局搜索最优解；最后通过仿真，对不同算法的迭代次数和误码率（BER）性能进行了研究。理论分析与仿真结果表明：在MIMO-GFDM中，所提改进RTS信号检测算法误码率远低于传统信号检测算法。在4QAM时，RTS算法大约有低于MMSE检测6 dB的信噪比性能增益（误码率在10^-3时）；在16QAM时，RTS算法大约有低于MMSE检测4 dB的信噪比性能增益（误码率在10^-2时）。与传统RTS算法性相比，所提改进算法在不影响误码率性能的同时降低了算法复杂度。     

基于深度概率图模型的鲁棒人脸画像合成

针对基于数据驱动的人脸画像合成算法像素特征缺乏对光照变化和复杂背景的鲁棒性,常合成低质量的画像的问题,文中提出基于深度概率图模型的鲁棒人脸画像合成算法.采用预处理方法调整测试照片的光照亮度和人脸姿态,使之与训练照片一致.采用深度特征代替像素特征进行近邻匹配,采用深度概率图模型对画像重建权重和深度特征权重联合建模,得到合成画像的最佳重构表示.为了提高画像合成速度,提出快速近邻搜索方法.实验验证文中算法的鲁棒性和快速性.     

Multi-Input Single Output SSSC based damping controller design by a hybrid Improved Differential Evolution-Pattern Search approach

In this paper, a hybrid Improved Differential Evolution and Pattern Search (hIDEPS) approach is proposed for the design of a PI-Type Multi-Input Single Output (MISO) Static Synchronous Series Compensator (SSSC) based damping controller. The improvement in Differential Evolution (DE) algorithm is introduced by a simple but effective scheme of changing two of its most important control parameters i.e. step size and crossover probability with an objective of achieving improved performance. Pattern Search (PS) is subsequently employed to fine tune the best solution provided by modified DE algorithm. The superiority of a proposed hIDEPS technique over DE and improved DE has also been demonstrated. At the outset, this concept is applied to a SSSC connected in a Single Machine Infinite Bus (SMIB) power system and then extended to a multi-machine power system. To show the effectiveness and robustness of the proposed design approach, simulation results are presented and compared with DE and Particle Swarm Optimization (PSO) optimized Single Input Single Output (SISO) SSSC based damping controllers. It is observed that the proposed approach yield superior damping performance compared to some approaches available in the literature.     

Top-k-size keyword search on tree structured data

Keyword search is the most popular technique for querying large tree-structured datasets, often of unknown structure, in the web. Recent keyword search approaches return lowest common ancestors (LCAs) of the keyword matches ranked with respect to their relevance to the keyword query. A major challenge of a ranking approach is the efficiency of its algorithms as the number of keywords and the size and complexity of the data increase. To face this challenge most of the known approaches restrict their ranking to a subset of the LCAs (e.g., SLCAs, ELCAs), missing relevant results.In this work, we design novel top-k-size stack-based algorithms on tree-structured data. Our algorithms implement ranking semantics for keyword queries which is based on the concept of LCA size. Similar to metric selection in information retrieval, LCA size reflects the proximity of keyword matches in the data tree. This semantics does not rank a predefined subset of LCAs and through a layered presentation of results, it demonstrates improved effectiveness compared to previous relevant approaches. To address performance challenges our algorithms exploit a lattice of the partitions of the keyword set, which empowers a linear time performance. This result is obtained without the support of auxiliary precomputed data structures. An extensive experimental study on various and large datasets confirms the theoretical analysis. The results show that, in contrast to other approaches, our algorithms scale smoothly when the size of the dataset and the number of keywords increase.     

Job Search Networks and Strategies in Scattered-site Public Housing

How does poverty dispersal influence the job search tactics and networks of poor women? Using the results of interviews with 253 women living in dispersed and small clusters of public housing, this paper examines how job networks and search tactics may vary. The premise is that the mechanisms involved in connecting poor residents of more affluent areas with opportunity may consist of both social connections and new strategies for accessing opportunity. The paper finds that dispersed residents have job networks containing more diverse information. Second, dispersed residents more often used formal methods to find their most recent job. Third, dispersed residents seek better jobs, net of demographic controls, search method, and search outcome. The paper discusses the implications of these findings for the design of housing mobility and mixed-income housing programmes, the current policy emphasis at the US Department of Housing and Urban Development.     

Tenure Choice and Labour Market Outcomes

In a series of papers Andrew Oswald has suggested that since home owners are relatively less mobile across geographic locations than renters, regional home ownership rates are positively correlated with regional unemployment rates. This paper examines this hypothesis at the individual level. Search theory suggests that when a subset of the population is less mobile than others, this less mobile group (that is, owners) will have lower probability of employment, longer spells of unemployment and lower wages than more mobile renters. These hypotheses on inferior labour market outcomes for owners were tested using US Current Population Survey data as well as data from the Panel Survey of Income Dynamics. The empirical model suggests that these hypotheses are not supported by any of the tests. Home owners, conditionally or unconditionally, have better labour market outcomes than renters.     

第二类双边装配线平衡的混合粒子群算法

双边装配线广泛用于汽车、卡车等大型产品的装配过程中。为有效解决第二类双边装配线平衡问题(TALBP-II),提出了一种新的混合粒子群算法(HPSO)。该算法利用粒子群进行全局搜索,使用遗传算法中的交叉算子增强全局搜索,同时利用变邻域搜索进行局部搜索。结合TALBP-II的特点,提出一种解码方式,减少由于操作关系导致的空闲时间。提出工位时间判断策略,缩小搜索空间,提高局部搜索效率。实验结果表明所提出的混合粒子群算法能有效解决第二类双边装配线平衡问题。     

Inverted index maintenance strategy for flashSSDs: Revitalization of in-place index update strategy

An inverted index is a core data structure of Information Retrieval systems, especially in search engines. Since the search environments have become more dynamic, many on-line index maintenance strategies have been proposed. Previous strategies were designed for HDDs. Consequently, in order to avoid expensive random access cost, Merge-based strategies have been preferred to In-place index update strategies on HDDs. However, flashSSDs have become solid alternatives to HDDs. FlashSSDs currently are adopted in a wide range of areas due to their superior features such as the short access latency, energy efficiency, and high bandwidth. In this article, we first reexamined potentials of In-place index update strategies on flashSSDs. Thanks to the insignificant access latency of flashSSDs, we discovered that In-place index update strategies outperform Merge-based strategies, since In-place index update strategies generate much less amount of I/O than Merge-based strategies despite inducing frequent random accesses. Based on this discovery, we suggest a new inverted index maintenance strategy based on an In-place index update strategy for flashSSDs, called Multipath Flash In-place Strategy (MFIS). To enhance the index maintenance performance, MFIS stores the posting list of each term non-contiguously and exploits the internal parallelism of flashSSDs. Thus, MFIS not only induces the minimum amount of I/O but also utilizes the maximum bandwidth of flashSSDs. Furthermore, MFIS is designed to show high query processing performance by utilizing the internal parallelism of flashSSDs even though the posting list of each term is stored non-contiguously. In our experiments, the index maintenance performance of MFIS was considerably better than other previous maintenance strategies. The index maintenance performance was up to 14.93, 4.04, 5.12, and 2.33 times higher than Merge-based strategies such as Immediate Merge, Geometric Partitioning, Hybrid, and SSD-aware Hybrid, respectively. The query processing performance of MFIS was up to 1.62 times higher than non-contiguous In-place. In addition, MFIS showed almost the best query processing performance as Merge-based strategies did. In conclusion, MFIS is the best on-line inverted index maintenance strategy on flashSSDs in terms of both index maintenance and query processing performance.