换装行人重识别研究进展

行人重识别旨在建立目标行人在多个无交叉覆盖监控区域间的身份联系,在智慧城市、司法侦查和监控安全等领域具有重要应用价值。传统行人重识别方法针对短时间跨度场景,依赖行人外观特征的稳定不变性,旨在克服光照差异、视角变化和物体遮挡等挑战。与之不同,换装行人重识别针对长时间跨度场景,除受限于上述挑战还面临换装带来的外观变化问题,是近几年的一个研究难点和热点。围绕换装行人重识别,本文从数据集和解决方法两个方面综述国内外研究进展,探讨面临的挑战和难点。首先,梳理并比较了当前针对换装行人重识别的数据集,从采集方式、行人及样本数量等方面分析其挑战性和面临的局限性。然后,在简单回顾换装行人重识别发展历史的基础上,将其归纳为基于非视觉传感器的方法和基于视觉相机的方法两类。针对基于非视觉传感器的方法,介绍了深度传感器、射频信号等在换装行人重识别中的应用。针对基于视觉相机的方法,详细阐述了基于显式特征设计与提取的方法、基于特征解耦的方法和基于隐式数据驱动自适应学习的方法。在此基础上,探讨了当前换装行人重识别面临的问题并展望未来的发展趋势,旨在为相关研究提供参考。     

Investigations on mode-division multiplexed free-space optical transmission for inter-satellite communication link

Wireless Networks - Inter-satellite data transmission links are very crucial for providing global inter-connectivity. We report designing and investigations on high date rate inter-satellite...     

Evolutionary state-based novel multi-objective periodic bacterial foraging optimization algorithm for data clustering

Clustering divides objects into groups based on similarity. However, traditional clustering approaches are plagued by their difficulty in dealing with data with complex structure and high dimensionality, as well as their inability in solving multi-objective data clustering problems. To address these issues, an evolutionary state-based novel multi-objective periodic bacterial foraging optimization algorithm (ES-NMPBFO) is proposed in this article. The algorithm is designed to alleviate the high-computing complexity of the standard bacterial foraging optimization (BFO) algorithm by introducing periodic BFO. Moreover, two learning strategies, global best individual (gbest) and personal historical best individual (pbest), are used in the chemotaxis operation to enhance the convergence speed and guide the bacteria to the optimum position. Two elimination-dispersal operations are also proposed to prevent falling into local optima and improve the diversity of solutions. The proposed algorithm is compared with five other algorithms on six validity indexes in two data clustering cases comprising nine general benchmark datasets and four credit risk assessment datasets. The experimental results suggest that the proposed algorithm significantly outperforms the competing approaches. To further examine the effectiveness of the proposed strategies, two variants of ES-NMPBFO were designed, and all three forms of ES-NMPBFO were tested. The experimental results show that all of the proposed strategies are conducive to the improvement of solution quality, diversity and convergence.     

Optimal imperfect preventive maintenance policy for equipment leased during successive periods

In this paper, we consider randomly failing equipment leased several times during their life cycle with a given warranty period. A mathematical model is developed to determine the optimal efficiency levels of preventive maintenance (PM) to be performed on the equipment between successive lease periods, maximising the expected total profit of the lessor over the equipment life cycle. The model considers the expected leasing revenue as well as the equipment acquisition cost and the average PM and repair costs. PM actions allow reducing the age of the equipment to a certain extent with a corresponding cost depending on the PM level adopted. The efficiency of the PM is determinant of the expected revenue during the next lease period. Given a set of K possible PM levels and the number of lease periods n over the equipment life cycle, K^{n?1 PM} strategies are possible. A genetic algorithm is proposed in order to obtain nearly optimal policies in situations where the number of possibilities K^n?1 is very high. Obtained numerical results are discussed. Small- and big-size instances of the problem are considered in the case of a service company in the oil and gas industry specialised in leasing specific equipment such as separators, to oil companies for production activities with a limited duration of several months like well testing or short production tests.     

Modulating the Surface State of SiC to Control Carrier Transport in Graphene/SiC

Silicon carbide (SiC) with epitaxial graphene (EG/SiC) shows a great potential in the applications of electronic and photoelectric devices. The performance of devices is primarily dependent on the interfacial heterojunction between graphene and SiC. Here, the band structure of the EG/SiC heterojunction is experimentally investigated by Kelvin probe force microscopy. The dependence of the barrier height at the EG/SiC heterojunction to the initial surface state of SiC is revealed. Both the barrier height and band bending tendency of the heterojunction can be modulated by controlling the surface state of SiC, leading to the tuned carrier transport behavior at the EG/SiC interface. The barrier height at the EG/SiC(000‐1) interface is almost ten times that of the EG/SiC(0001) interface. As a result, the amount of carrier transport at the EG/SiC(000‐1) interface is about ten times that of the EG/SiC(0001) interface. These results offer insights into the carrier transport behavior at the EG/SiC heterojunction by controlling the initial surface state of SiC, and this strategy can be extended in all devices with graphene as the top layer.     

First-order indicators for the estimation of discrete fractures in porous media

Faults and geological barriers can drastically affect the flow patterns in porous media. Such fractures can be modelled as interfaces that interact with the surrounding matrix. We propose a new technique for the estimation of the location and hydrogeological properties of a small number of large fractures in a porous medium from given distributed pressure or flow data. At each iteration, the algorithm builds a short list of candidates by comparing fracture indicators. These indicators quantify at the first order the decrease of a data misfit function; they are cheap to compute. Then, the best candidate is picked up by minimization of the objective function for each candidate. Optimally driven by the fit to the data, the approach has the great advantage of not requiring remeshing, nor shape derivation. The stability of the algorithm is shown on a series of numerical examples representative of typical situations.     

Fractional Order Nonlinear Bone Remodeling Dynamics Using the Supervised Neural Network

This study aims to solve the nonlinear fractional-order mathematical model (FOMM) by using the normal and dysregulated bone remodeling of the myeloma bone disease (MBD). For the more precise performance of the model, fractional-order derivatives have been used to solve the disease model numerically. The FOMM is preliminarily designed to focus on the critical interactions between bone resorption or osteoclasts (OC) and bone formation or osteoblasts (OB). The connections of OC and OB are represented by a nonlinear differential system based on the cellular components, which depict stable fluctuation in the usual bone case and unstable fluctuation through the MBD. Untreated myeloma causes by increasing the OC and reducing the osteoblasts, resulting in net bone waste the tumor growth. The solutions of the FOMM will be provided by using the stochastic framework based on the Levenberg-Marquardt backpropagation (LVMBP) neural networks (NN), i.e., LVMBPNN. The mathematical performances of three variations of the fractional-order derivative based on the nonlinear disease model using the LVMPNN. The static structural performances are 82% for investigation and 9% for both learning and certification. The performances of the LVMBPNN are authenticated by using the results of the Adams-Bashforth-Moulton mechanism. To accomplish the capability, steadiness, accuracy, and ability of the LVMBPNN, the performances of the error histograms (EHs), mean square error (MSE), recurrence, and state transitions (STs) will be provided.     

Discrimination between accelerated life models via Approximate Bayesian Computation

Accelerated life testing (ALT) is widely used in high-reliability product estimation to get relevant information about an item's performance and its failure mechanisms. To analyse the observed ALT data, reliability practitioners need to select a suitable accelerated life model based on the nature of the stress and the physics involved. A statistical model consists of (i) a lifetime distribution that represents the scatter in product life and (ii) a relationship between life and stress. In practice, several accelerated life models could be used for the same failure mode and the choice of the best model is far from trivial. For this reason, an efficient selection procedure to discriminate between a set of competing accelerated life models is of great importance for practitioners. In this paper, accelerated life model selection is approached by using the Approximate Bayesian Computation (ABC) method and a likelihood-based approach for comparison purposes. To demonstrate the efficiency of the ABC method in calibrating and selecting accelerated life model, an extensive Monte Carlo simulation study is carried out using different distances to measure the discrepancy between the empirical and simulated times of failure data. Then, the ABC algorithm is applied to real accelerated fatigue life data in order to select the most likely model among five plausible models. It has been demonstrated that the ABC method outperforms the likelihood-based approach in terms of reliability predictions mainly at lower percentiles particularly useful in reliability engineering and risk assessment applications. Moreover, it has shown that ABC could mitigate the effects of model misspecification through an appropriate choice of the distance function.     

A new scalable multicast routing algorithm for interactive real-time applications

Quality of service (QoS) provisioning generally assumes more than one QoS measure that implies that QoS routing can be categorized as an instance of routing subject to multiple constraints: delay jitter, bandwidth, cost, etc. We study the problem of constructing multicast trees to meet the QoS requirements of real-time interactive applications where it is necessary to provide bounded delays and bounded delay variation among the source and all destinations while keeping overall cost of the multicast tree low. The main contribution of our work is a new strategy for constructing multiconstrained multicast trees. We first derive mathematically a new delay-variation estimation scheme and prove its efficiency. Thereafter, we propose a simple and competitive (in terms of running time) heuristic algorithm, for delay and delay variation constrained routing problem based on the proposed delay-variation estimation scheme and using the Extended Prim-Dijkstra tradeoffs’ algorithm. Our contribution also extends previous works in providing some properties and analyses of delay bounded paths satisfying delay variation constraints. Extensive simulation results show that our algorithm outperforms DVDMR in terms of multicast delay variation with the same time complexity as DVDMR.     

小卫星测试系统设计与实现

针对某小卫星研制过程中的电测需求,设计并开发了一种小卫星测试系统;系统模仿通用仪器结构设计了分布式的功能板卡作为独立测试功能单元,并在机箱中采用开放式总线底板,最大限度地提高系统适应性,发挥系统效率;为保证系统控制与数据传输的实时性,使用装载VxWorks操作系统的嵌入式计算机作为主控制器,使用LVDS高速接口作为系统内部数据传输通道,传输速率为10 Mbit/s,本系统可以完成小卫星电信号的并行测试,满足测试要求.