Metal chlorides-promoted ammonia absorption of deep eutectic solvent

Ammonia is considered as a promising hydrogen or energy carrier. Ammonia absorption or adsorption is an important aspect for both ammonia removal, storage and separation applications. To these ends, a wide range of solid and liquid sorbents have been investigated. Among these, the deep eutectic solvent (DES) is emerging as a promising class of ammonia absorbers. Herein, we report a novel type of DES, i.e., metal-containing DESs for ammonia absorption. Specifically, the NH₃ absorption capacity is enhanced by ca. 18.1–36.9% when a small amount of metal chlorides, such as MgCl₂, MnCl₂ etc., are added into a DES composed of resorcinol (Res) and ethylene glycol (EG). To our knowledge, the MgCl₂/Res/EG (0.1:1:2) DES outperforms most of the reported DESs. The excellent NH₃ absorption performances of metal–containing DESs have been attributed to the synergy of Lewis acid–base and hydrogen bonding interactions. Additionally, good reversibility and high NH₃/CO₂ selectivity are achieved over the MgCl₂/Res/EG (0.1:1:2) DES, which enables it to be a potential NH₃ absorber for further investigations.     

Transverse magnetoresistance peculiarities of thermoelectric Lu-doped Bi2Te3 compound due to strong electrical disorder

The n-type thermoelectric Bi_1.9Lu_0.1Te₃ was prepared by microwave-solvothermal method and spark plasma sintering. The magnetic field and temperature dependences of transverse magnetoresistance measured within temperature 2–200 K interval allow finding the peculiarities characteristic for strongly disordered and inhomogeneous semiconductors. The first peculiarity is due to appearance of linear-in-magnetic field contribution to the total magnetoresistance reflected in a crossover from quadratic magnetoresistance at low magnetic fields to linear magnetoresistance at high magnetic fields. The linear magnetoresistance can result from the Hall resistance picked up from macroscopically distorted current paths due to local variations in stoichiometry of the compound studied. The second peculiarity is that both linear magnetoresistance magnitude and crossover field are functions of carrier mobility which is in agreement with the Parish and Littlewood model developed for disordered and inhomogeneous semiconductors. An increase in the mobility due to a decrease in temperature is accompanied by an increase in the magnetoresistance magnitude and a decrease in the crossover field. Finally, the third peculiarity is related to the remarkable deviation of the total magnetoresistance measured at various temperatures from the Kohler's rule. Presence of strong inhomogeneity and disorder in the Bi_1.9Lu_0.1Te₃ structure concluded from the magnetoresistance peculiarities can be responsible for the remarkable reduction in the total thermal conductivity of this compound.     

Off‐grid DoA estimation method of wideband signals

In this paper, an off‐grid direction of arrival (DoA) estimation method is proposed for wideband signals. This method is based on the sparse representation (SR) of the array covariance matrix. Similar to the time domain DoA estimation methods, the correlation function of the sources was assumed to be the same and known. A new measurement vector is obtained using the lower‐left triangular elements of the covariance matrix. The DoAs are estimated by quantizing the entire range of continuous angle space into discrete grid points. However, the exact DoAs may be located between two grid points; therefore, this estimation has errors. The accuracy of DoA estimation is improved by the minimization of the difference between the new measurement vector and its estimated values. Simulation results revealed that the proposed method can enhance the DoA estimation accuracy of wideband signals.     

基于分段加权的反向稀疏跟踪算法研究

为提高稀疏表示跟踪模型性能，提出一种分段加权的反向稀疏跟踪算法，将跟踪问题转化为在贝叶斯框架下寻找概率最高的候选对象问题，构造不同的分段权重函数来分别度量候选目标与正负模板的判别特征系数。通过池化来降低跟踪结果的不确定性干扰，选择正负模板加权系数差值最大的候选表示作为跟踪结果。实验表明，在光照变化、遮挡、快速运动、运动模糊情况下，所提出的算法可以确保跟踪结果的准确性和鲁棒性。     

LPNN-based approach for LASSO problem via a sequence of regularized minimizations

In compressive sampling theory, the least absolute shrinkage and selection operator (LASSO) is a representative problem. Nevertheless, the non-differentiable constraint impedes the use of Lagrange programming neural networks (LPNNs). We present in this article the -LPNN model, a novel algorithm that tackles the LASSO minimization together with the underlying theory support. First, we design a sequence of smooth constrained optimization problems, by introducing a convenient differentiable approximation to the non-differentiable -norm constraint. Next, we prove that the optimal solutions of the regularized intermediate problems converge to the optimal sparse signal for the LASSO. Then, for every regularized problem from the sequence, the -LPNN dynamic model is derived, and the asymptotic stability of its equilibrium state is established as well. Finally, numerical simulations are carried out to compare the performance of the proposed -LPNN algorithm with both the LASSO-LPNN model and a standard digital method.     

智能化救援监控系统在煤矿安全生产中的应用

针对煤矿发生事故后传统救援监控系统无法实时对井下人员进行动态定位，导致矿井救援盲目性大、救援效率差、救援难度大等技术难题，为了进一步提高煤矿救援效率，通过技术研究，设计了一套以通信基站为核心的智能化救援监控系统，分析了该系统结构组成、工作原理，通过在担水沟煤矿井下实际应用效果来看，智能化救援监控系统对人员定位精准度达95%，实现人员动态位置三维成像，救援效率提高至80%以上，有效缩短了煤矿事故救援时间，取得了显著应用成效。     

A novel approach to adaptive relational association rule mining

The paper focuses on the adaptive relational association rule mining problem. Relational association rules represent a particular type of association rules which describe frequent relations that occur between the features characterizing the instances within a data set. We aim at re-mining an object set, previously mined, when the feature set characterizing the objects increases. An adaptive relational association rule method, based on the discovery of interesting relational association rules, is proposed. This method, called ARARM (Adaptive Relational Association Rule Mining) adapts the set of rules that was established by mining the data before the feature set changed, preserving the completeness. We aim to reach the result more efficiently than running the mining algorithm again from scratch on the feature-extended object set. Experiments testing the method's performance on several case studies are also reported. The obtained results highlight the efficiency of the ARARM method and confirm the potential of our proposal.     

Critical state model for structured soil

Structure is an evident determinant for macroscopic behaviors of soils. However, this is not taken into account in most constitutive models, as structure is a rather complex issue in models. For this, it is important to develop and implement simple models that can reflect this important aspect of soil behavior. This paper tried to model structured soils based on well-established concepts, such as critical state and sub-loading. Critical state is the core of the classic Cam Clay model. The sub-loading concept implies adoption of an inner (sub-loading) yield surface, according to specific hardening rules for some internal strain-like state variables. Nakai and co-workers proposed such internal variables for controlling density (ρ) and structure (ω), using a modified stress space, called t_ij. Herein, similar variables are used in the context of the better-known invariants (p and q) of the Cam Clay model. This change requires explicit adoption of a non-associated flow rule for the sub-loading surface. This is accomplished by modifying the dilatancy ratio of the Cam Clay model, as a function of the new internal variables. These modifications are described and implemented under three-dimensional (3D) conditions. The model is then applied to simulating laboratory tests under different stress paths and the results are compared to experiments reported for different types of structured soils. The good agreements show the capacity and potential of the proposed model.     

因素空间理论下基点分类算法研究

目前，基于因素空间理论的背景基提取算法计算过程复杂，初始化必须依赖各因素极值，基点数量提取冗余等原因，未能在应用中取得很好效果。为此，结合内点判别法和知识可继承、可扩展的思想，提出一种计算简单、初始化独立、基点数量小的改进的背景基提取算法。然后，利用改进的背景基提取算法构造出一种全新的数据分类算法-基点分类算法，基点分类算法以提取每一类样本的背景基为预测模型，再通过新定义的λ-背景基，优化预测模型。数值实验表明:基点分类算法原理简单、构造难度小、分类模型泛化能力强，预测能力准确率高，同时严格的模型限定区域又能为识别新类别提供新方法。