控制爆破法处理卡钻事故

介绍了在包头市某工程实施管道穿越黄河施工中,采用爆破法处理卡钻的经验。针对深水环境条件及钻杆内径小不宜采用集团装药的条件,确定采用"小直径爆破筒,钻杆内部装药"的爆破方案,阐述了爆破设计及施工注意事项。可供类似工程参考。     

Annual and regional variations of aflatoxin B1 levels seen in grains and feed coming from Croatian dairy farms over a 5-year period

The aim of the study was to investigate annual and regional differences in the level of aflatoxin B₁ (AFB₁) in grains and dairy cattle feed. Maize (n = 972), wheat (n = 201), barley (n = 147), oat (n = 136), grain mixtures (n = 168), and dairy cattle feed (n = 325) were sampled from 2009 to 2013 on different farms and in different farm factories situated in four Croatian regions. The samples were analysed for AFB₁ using the validated ELISA immunoassay. AFB₁ was determined in 16.4% of all investigated samples, among which maize was proven to be the most contaminated, with 21.7% of the samples recovered during 2013 harbouring AFB₁ in concentrations over the permissible ones. Levels higher than permitted were observed in 17.9% and 12.3% of grain mixtures and dairy cattle feed, respectively, whereas concentrations of AFB₁ determined in other crops throughout the investigated period met the stipulated requirements. The results revealed the AFB₁ occurrence to be significantly (p < 0.05) dependent on the cultivation region, with the highest levels generally found in maize harvested in 2013 and consequently in grain mixtures and cattle feed that can most likely be associated with climatic conditions as the most critical factor for mould formation, and thus also AFB₁ production.     

A Student's t-based density peaks clustering with superpixel segmentation (tDPCSS) method for image color clustering

Image color clustering is a basic technique in image processing and computer vision, which is often applied in image segmentation, color transfer, contrast enhancement, object detection, skin color capture, and so forth. Various clustering algorithms have been employed for image color clustering in recent years. However, most of the algorithms require a large amount of memory or a predetermined number of clusters. In addition, some of the existing algorithms are sensitive to the parameter configurations. In order to tackle the above problems, we propose an image color clustering method named Student's t-based density peaks clustering with superpixel segmentation (tDPCSS), which can automatically obtain clustering results, without requiring a large amount of memory, and is not dependent on the parameters of the algorithm or the number of clusters. In tDPCSS, superpixels are obtained based on automatic and constrained simple non-iterative clustering, to automatically decrease the image data volume. A Student's t kernel function and a cluster center selection method are adopted to eliminate the dependence of the density peak clustering on parameters and the number of clusters, respectively. The experiments undertaken in this study confirmed that the proposed approach outperforms k-means, fuzzy c-means, mean-shift clustering, and density peak clustering with superpixel segmentation in the accuracy of the cluster centers and the validity of the clustering results.     

Controlled Secure Direct Communication Protocol via the Three-Qubit Partially Entangled Set of States

In this paper, we first re-examine the previous protocol of controlled quantum secure direct communication of Zhang et al.’s scheme, which was found insecure under two kinds of attacks, fake entangled particles attack and disentanglement attack. Then, by changing the party of the preparation of cluster states and using unitary operations, we present an improved protocol which can avoid these two kinds of attacks. Moreover, the protocol is proposed using the three-qubit partially entangled set of states. It is more efficient by only using three particles rather than four or even more to transmit one bit secret information. Given our using state is much easier to prepare for multiqubit states and our protocol needs less measurement resource, it makes this protocol more convenient from an applied point of view.     

Role of Co in formation of Ni-Ti clusters in maraging stainless steel

The effect of Co addition on the formation of Ni-Ti clusters in maraging stainless steel was studied by three dimensional atom probe (3DAP) and first-principles calculation. The cluster analysis based on the maximum separation approach showed an increase in size but a decrease in density of Ni-Ti clusters with increasing the Co content. The first-principles calculation indicated weaker Co-Ni (Co-Ti) interactions than Co-Ti (Fe-Ti) interactions, which should be the essential reason for the change of distribution characteristics of Ni-Ti clusters in bcc Fe caused by Co addition.     

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.