基准平面垂直断面法在爆破漏斗试验中的应用

系统阐述了基准平面垂直断面法在爆破漏斗试验中测量爆破漏斗体积的基本原理,并将隧道激光断面仪应用于金厂河矿1 750 m水平15^#采场底部切割巷道爆破漏斗试验爆破漏斗体积测量中。通过与传统体重法等计算法所得漏斗体积分析比较,结果表明基于隧道激光断面仪与3D Mine软件分析的基准平面垂直断面法实用性强、操作方便、结果直观可靠,达到试验预期目的。     

水压爆破拆除超大容积水池

简要介绍了组合式超大容积（８５０ｍ３）水池在水压爆破拆除过程中爆破方案选择、参数选取等方面的经验，并对爆破效果进行了分析，为同类工程施工提供了可借鉴的经验。     

Mixing enhancement mechanism of combined H2–Water jets in supersonic crossflows in a combustor with an expanded section

To obtain the mixing enhancement mechanism of H₂–Water combined jets in supersonic crossflows in a combustor with expanded section for rotating detonation ramjet, the flow field shape and spray structure were studied by experimental and numerical methods. The Eulerian–Lagrangian method was used to investigate the diffusion mechanism and H₂–Water interaction law of combined jets with different sequences. At the same time, high-speed photography and the schlieren technique were used to capture the flow field. The effects of jet pressure drop, orifice diameter, orifice spacing, incoming Mach number, and other parameters on the penetration depth of water jets were studied. The results of experiment and simulation show that using H₂–Water combined jets, the penetration depth of the jet spray can be greatly increased and the jet mixing effect can be significantly improved, which will contribute to the engine's ignition and stable combustion. In the case of pre-water/post-H₂, the penetration depth of the hydrogen jet is greater. In the case of pre-H₂/post-water, the hydrogen jet raises the water spray mainly by protecting the integrity of the water column.     

钢管套筒灌浆连接轴向受拉性能模拟试验研究

为研究钢管套筒灌浆连接轴向受拉破坏过程及破坏机理，试验中设计了16组48个钢管套筒灌浆连接试件，试件采用钢板代替圆钢管，并进行静载试验。分析了灌浆料裂缝扩展过程、荷载-相对位移曲线，并对抗剪键高距比、灌浆料厚度、侧向力等因素对破坏过程及承载力的影响进行分析。结果表明：对于不设置抗剪键的套筒灌浆连接试件，斜裂缝随机产生，裂缝分布不均匀；对于设置抗剪键的套筒灌浆连接试件，裂缝首先出现在底部抗剪键位置处，与水平方向夹角约为30°，随后在中部和上部抗剪键位置处分别出现斜裂缝。由于每个抗剪键上荷载分担并不均匀，与抗剪键接触的灌浆料逐渐达到极限压应力，达到极限状态时，承载力全部由抗剪键间的机械咬合力承担，在连接承载力中，可忽略摩擦力和胶结力作用。随着抗剪键高距比h/s增大，各试件初始剪切刚度相差不大，承载力增大，但增幅逐渐减小，建议抗剪键高距比0.06g/s>0.3，同时需要满足灌浆料灌注的施工要求。     

A self-adaptive synthetic over-sampling technique for imbalanced classification

Traditionally, in supervised machine learning, (a significant) part of the available data (usually 50%-80%) is used for training and the rest—for validation. In many problems, however, the data are highly imbalanced in regard to different classes or does not have good coverage of the feasible data space which, in turn, creates problems in validation and usage phase. In this paper, we propose a technique for synthesizing feasible and likely data to help balance the classes as well as to boost the performance in terms of confusion matrix as well as overall. The idea, in a nutshell, is to synthesize data samples in close vicinity to the actual data samples specifically for the less represented (minority) classes. This has also implications to the so-called fairness of machine learning. In this paper, we propose a specific method for synthesizing data in a way to balance the classes and boost the performance, especially of the minority classes. It is generic and can be applied to different base algorithms, for example, support vector machines, k-nearest neighbour classifiers deep neural, rule-based classifiers, decision trees, and so forth. The results demonstrated that (a) a significantly more balanced (and fair) classification results can be achieved and (b) that the overall performance as well as the performance per class measured by confusion matrix can be boosted. In addition, this approach can be very valuable for the cases when the number of actual available labelled data is small which itself is one of the problems of the contemporary machine learning.     

Improved error performance for generalised spatial modulation with enhanced spectral efficiency

The existing analytical average bit error rate (ABER) expression of conventional generalised spatial modulation (CGSM) does not agree well with the Monte Carlo simulation results in the low signal‐to‐noise ratio (SNR) region. Hence, the first contribution of this paper is to derive a new and easy way to evaluate analytical ABER expression that improves the validation of the simulation results at low SNRs. Secondly, a novel system termed CGSM with enhanced spectral efficiency (CGSM‐ESE) is presented. This system is realised by applying a rotation angle to one of the two active transmit antennas. As a result, the overall spectral efficiency is increased by 1 bit/s/Hz when compared with the equivalent CGSM system. In order to validate the simulation results of CGSM‐ESE, the third contribution is to derive an analytical ABER expression. Finally, to improve the ABER performance of CGSM‐ESE, three link adaptation algorithms are developed. By assuming full knowledge of the channel at the receiver, the proposed algorithms select a subset of channel gain vector (CGV) pairs based on the Euclidean distance between all CGV pairs, CGV splitting, CGV amplitudes, or a combination of these.     

Recent Biophysical Issues About the Preparation of Solute-Filled Lipid Vesicles

Here we report some recent biophysical issues on the preparation of solute-filled lipid vesicles and their relevance to the construction of “synthetic cells.” First, we introduce the “semi-synthetic minimal cells” as the liposome-based cell-like systems, which contain a minimal number of biomolecules required to display simple and complex biological functions. Next, we focus on recent aspects related to the construction of synthetic cells. Emphasis is given to the interplay between the methods of synthetic cell preparation and the physics of solute encapsulation. We briefly introduce the notion of structural and compositional “diversity” in synthetic cell populations.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

High-resolution ISAR imaging of fast rotating targets based on pattern-coupled Bayesian strategy for multiple measurement vectors

Very high resolution inverse synthetic aperture radar (ISAR) imaging of fast rotating targets is a complicated task. There may be insufficient pulses or may introduce migration through range cells (MTRC) during the coherent processing interval (CPI) when we use the conventional range Doppler (RD) ISAR technique. With compressed sensing (CS) technique, we can achieve the high-resolution ISAR imaging of a target with limited number of pulses. Sparse representation based method can achieve the super resolution ISAR imaging of a target with a short CPI, during which the target rotates only a small angle and the range migration of the scatterers is small. However, traditional CS-based ISAR imaging method generally faced with the problem of basis mismatch, which may degrade the ISAR image. To achieve the high resolution ISAR imaging of fast rotating targets, this paper proposed a pattern-coupled sparse Bayesian learning method for multiple measurement vectors, i.e. the PC-MSBL algorithm. A multi-channel pattern-coupled hierarchical Gaussian prior is proposed to model the pattern dependencies among neighboring range cells and correct the MTRC problem. The expectation-maximization (EM) algorithm is used to infer the maximum a posterior (MAP) estimate of the hyperparameters. Simulation results validate the effectiveness and superiority of the proposed algorithm.