Aerosol optical properties and its direct radiative forcing over Tibetan Plateau from 2006 to 2017

Studies on optical properties of aerosols can reduce the uncertainty for modelling direct radiative forcing (DRF) and improve the accuracy for discussing aerosols effects on the Tibetan Plateau (TP) climate. This study investigated the spatiotemporal variation of aerosol optical and microphysical properties over TP based on OMI and MERRA2, and assessed the influence of aerosol optical properties on DRF at NamCo station (30°46.44′N, 90°59.31′E, 4730 m) in the central TP from 2006 to 2017 based on a long measurement of AERONET and the modelling of SBDART model. The results show that aerosol optical depth (AOD) exhibits obvious seasonal variation over TP, with higher AOD_500nm (>0.75) during spring and summer, and lower value (<0.25) in autumn and winter. The aerosol concentrations show a fluctuated rising from 1980 to 2000, significant increasing from 2000 to 2010 and slight declining trend after 2013. Based on sensitivity experiments, it is found that AOD and single scattering albedo (SSA) have more important impact on the DRF compared with α values and ASY. When AOD_440nm increases by 60%, DRF at the TOA and ATM is increased by 57.2% and 60.2%, respectively. When SSA_440nm increases by 20%, DRF at the TOA and ATM decreases by 121% and 96.7%, respectively.     

The theoretical study of the efficiency of diffusion deposition of nanoaerosols in the extended range of the Peclet numbers

The efficiencies of the diffusion deposition of nanoaerosols for a single fiber for the models of aerosol filter and wire mesh screen are studied numerically in the extended range of the Peclet number Pe. The rectangular periodic cell model for fluid flow and convective-diffusive transport of small aerosol particles is used. Most of the previous theoretical and experimental studies of single fiber diffusion deposition efficiency were for the case of Pe > 1. The array with uniform square or chess grid of fibers and of a row of circular cylindrical fibers are considered as the filter and wire mesh screen models. The flow and particles transport equations are solved numerically using the Boundary Element Method.The obtained numerical data are used to derive the approximate formulas for the deposition efficiency in the entire range of the Peclet number for the various porosities of the filter medium or distances between fibers in a wire mesh screen. The derived dependencies take into account nonlinearity of the deposition efficiency at the low Peclet numbers. The obtained analytical dependencies compare well with the numerical and experimental data.     

SFE-SSD: 浅层特征增强的SSD算法在小目标检测问题中的研究与应用

SSD (Single Shot Multibox Dectetor)算法由于具有高速且高精度的检测性能,是目前最好的目标检测算法之一.但由于提取检测框的特征层的特征信息不足, SSD算法在小目标检测任务中表现不佳.为了解决这个问题,目前大部分方法以严重牺牲检测速度为代价提升目标检测模型的精度. 本文提出了SFE-SSD (Shallow Feature Enhancement SSD)提升SSD模型在小目标检测任务中的性能.首先我们采用反卷积操作对SSD算法中检测框金字塔特征层的最浅特征层进行特征扩张.接着通过特征融合机制对扩张后的特征层进行特征增强操作.浅层特征增强策略与SSD 的原始框提取金字塔特征层是并行结构,一定程度上是可以减少检测速度的损失.实验结果显示,我们的方法在PASCAL VOC 2007数据库上精度达到了78.4\%mAP高于SSD算法1.2\%,检测速度达到了81帧/秒,并且在小目标检测任务中有着显著的提升.     

High order moments of first hitting times for single death processes

We present an explicit and recursive representation for high order moments of the first hitting times of single death processes. Based on that, some necessary or sufficient conditions of exponential ergodicity as well as a criterion on\mathit{\ell }-ergodicity are obtained for single death processes, respectively.     

Inequalities for single crystal rod growth by edge-defined film-fed growth (E.F.G.) technique

A boundary value problem in the case of the second order axi-symmetric Young-Laplace differential equation (some of whose solutions describe the static meniscus free surface, i.e. the static liquid bridge free surface between the shaper and the crystal, occurring in single crystal rod growth) is analyzed. The analysis concerns the dependence of the solution of an initial value problem of the equation on a parameter p (the controllable part of the pressure difference Δp across the free surface). Inequalities are established for p which are necessary or sufficient conditions for the existence of a solution which represents a stable and convex free surface of a static meniscus. The analysis is numerically illustrated for the static menisci occurring in the NdYAG laser single crystal rod growth from the melt by edge-defined film-fed growth (E.F.G.) technique. This kind of inequalities can be useful in the experiment planning and technology design.     

Reliability analysis of a k-out-of-n:G repairable system with single vacation

This paper analyzes a k-out-of-n:G   repairable system with one repairman who takes a single vacation, the duration of which follows a general distribution. The working time of each component is an exponentially distributed random variable and the repair time of each failed component is governed by an arbitrary distribution. Moreover, we assume that every component is “as good as new” after being repaired. Under these assumptions, several important reliability measures such as the availability, the rate of occurrence of failures, and the mean time to first failure of the system are derived by employing the supplementary variable technique and the Laplace transform. Meanwhile, their recursive expressions are obtained. Furthermore, through numerical examples, we study the influence of various parameters on the system reliability measures. Finally, the Monte Carlo simulation and two special cases of the system which are (n-1)$(n-1)$-out-of-n:G repairable system and 1-out-of-n:G repairable system are presented to illustrate the correctness of the analytical results.     

单重工作休假M/M/c排队驱动的流体模型分析

该文在M/M/c排队驱动系统中加入工作休假策略,研究了单重工作休假多服务台排队驱动的流体模型.利用拟生灭过程和矩阵几何解法得到驱动系统稳态队长分布.构建净输入率结构,导出流体模型的稳态联合分布函数满足的的矩阵微分方程组,进而利用Laplace-Stieltjes变换(LST)方法得到稳态下缓冲器库存量的空库概率及均值表...     

Lifting,superadditivity, mixed integer rounding and single node flow sets revisited

In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer rounding with lifting for the development of strong valid inequalities for knapsack and single node flow sets. Our hope is that the latter can be used in practice to generate cutting planes for mixed integer programs. The survey contains essentially two parts. In the first we present lifting in a very general way, emphasizing superadditive lifting which allows one to lift simultaneously different sets of variables. In the second, our procedure for generating strong valid inequalities consists of reduction to a knapsack set with a single continuous variable, construction of a mixed integer rounding inequality, and superadditive lifting. It is applied to several generalizations of the 0–1 single node flow set. This paper appeared in 4OR, 1, 173–208 (2003). The first author is supported by the FNRS as a chercheur qualifié. This paper presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian State, Prime Minister’s Office, Science Policy Programming. The scientific responsibility is assumed by the authors.     

A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness

This paper addresses the NP-hard problem of scheduling N jobs on a single machine with due dates, sequence-dependent setup times and no preemption where the objective is to minimize the maximum tardiness. An algorithm based on branch-and-bound permutation schemes is developed including the implementation of lower and upper bounding procedures, and three dominance rules. Computational experiments demonstrate the effectiveness of the algorithm. In the experiments, the impacts of control parameters to generate test instances on algorithm performance (CPU times) are studied by statistics methods.     

Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem

We study a static stochastic single machine scheduling problem in which jobs have random processing times with arbitrary distributions, due dates are known with certainty, and fixed individual penalties (or weights) are imposed on both early and tardy jobs. The objective is to find an optimal sequence that minimizes the expected total weighted number of early and tardy jobs. The general problem is NP-hard to solve; however, in this paper, we develop certain conditions under which the problem is solvable exactly. An efficient heuristic is also introduced to find a candidate for the optimal sequence of the general problem. Our illustrative examples and computational results demonstrate that the heuristic performs well in identifying either optimal sequences or good candidates with low errors. Furthermore, we show that special cases of the problem studied here reduce to some classical stochastic single machine scheduling problems including the problem of minimizing the expected weighted number of early jobs and the problem of minimizing the expected weighted number of tardy jobs which are both solvable by the proposed exact or heuristic methods.