Novel method of data compression for the online detection signal of coal mine wire rope

2020 ◽  
Vol 62 (10) ◽  
pp. 600-608
Author(s):  
Tian Jie ◽  
Wang Hongyao ◽  
Meng Guoying ◽  
Sven Bilen ◽  
Wu Xinli

Coal mine wire rope detection is related to personnel and production safety. With the Chinese coal mining trend tending towards deep mining, a considerable amount of data is critical for the online detection of deep well lifting wire rope. To improve the sampling rate, decrease the analysis processing time and realise real-time online detection, this paper proposes an online detection data compression processing method. The study focuses on the distortion compression method for the online detection signal of deep well hoisting wire rope. The set partitioning in hierarchical trees (SPIHT) algorithm is one of the most advanced methods in the field of image transformation coding. Compared with other coding algorithms, the SPIHT algorithm demonstrates desired characteristics such as a high signal-to-noise ratio, lower complexity and decreased computational load, among others. This paper discusses how, in combination with the image processing method, a compression coding method for the one-dimensional signal of the magnetic leakage detection of the mining wire rope is developed. Furthermore, the set partitioning sorting algorithm is investigated and analysed, the temporal orientation tree structure of the one-dimensional signal of the wavelet coefficient is defined for wire rope magnetic leakage detection and the SPIHT algorithm is presented, in addition to an example of the one-dimensional signal from the magnetic leakage detection of the wire rope. The results reveal that under the condition of the normalised mean square error (NMSE; NMSE < 0.01) of distortion, the compression ratio improved by 30%. The online detection signal lossy compression method proposed in this study has a considerable influence on the recovery of the original signal, in addition to a higher compression ratio and a reduced computation time, compared to the existing method.

2019 ◽  
Vol 55 (3) ◽  
pp. 233-239
Author(s):  
Hongyao Wang ◽  
Jie Tian ◽  
Guoying Meng ◽  
Xiaowei Li ◽  
Junying Zhou ◽  
...  

2020 ◽  
Vol 32 (2) ◽  
pp. 428-443
Author(s):  
Lijun Wei ◽  
Zhixing Luo ◽  
Roberto Baldacci ◽  
Andrew Lim

In this paper, a new branch-and-price-and-cut algorithm is proposed to solve the one-dimensional bin-packing problem (1D-BPP). The 1D-BPP is one of the most fundamental problems in combinatorial optimization and has been extensively studied for decades. Recently, a set of new 500 test instances were proposed for the 1D-BPP, and the best exact algorithm proposed in the literature can optimally solve 167 of these new instances, with a time limit of 1 hour imposed on each execution of the algorithm. The exact algorithm proposed in this paper is based on the classical set-partitioning model for the 1DBPPs and the subset row inequalities. We describe an ad hoc label-setting algorithm to solve the pricing problem, dominance, and fathoming rules to speed up its computation and a new primal heuristic. The exact algorithm can easily handle some practical constraints, such as the incompatibility between the items, and therefore, we also apply it to solve the one-dimensional bin-packing problem with conflicts (1D-BPPC). The proposed method is tested on a large family of 1D-BPP and 1D-BPPC classes of instances. For the 1D-BPP, the proposed method can optimally solve 237 instances of the new set of difficult instances; the largest instance involves 1,003 items and bins of capacity 80,000. For the 1D-BPPC, the experiments show that the method is highly competitive with state-of-the-art methods and that it successfully closed several open 1D-BPPC instances.


2008 ◽  
Vol 67 (1) ◽  
pp. 51-60 ◽  
Author(s):  
Stefano Passini

The relation between authoritarianism and social dominance orientation was analyzed, with authoritarianism measured using a three-dimensional scale. The implicit multidimensional structure (authoritarian submission, conventionalism, authoritarian aggression) of Altemeyer’s (1981, 1988) conceptualization of authoritarianism is inconsistent with its one-dimensional methodological operationalization. The dimensionality of authoritarianism was investigated using confirmatory factor analysis in a sample of 713 university students. As hypothesized, the three-factor model fit the data significantly better than the one-factor model. Regression analyses revealed that only authoritarian aggression was related to social dominance orientation. That is, only intolerance of deviance was related to high social dominance, whereas submissiveness was not.


2011 ◽  
Vol 35 (1) ◽  
pp. 15-27
Author(s):  
Zoran Ivić ◽  
Željko Pržulj

Adiabatic large polarons in anisotropic molecular crystals We study the large polaron whose motion is confined to a single chain in a system composed of the collection of parallel molecular chains embedded in threedimensional lattice. It is found that the interchain coupling has a significant impact on the large polaron characteristics. In particular, its radius is quite larger while its effective mass is considerably lighter than that estimated within the one-dimensional models. We believe that our findings should be taken into account for the proper understanding of the possible role of large polarons in the charge and energy transfer in quasi-one-dimensional substances.


1983 ◽  
Vol 4 ◽  
pp. 297-297
Author(s):  
G. Brugnot

We consider the paper by Brugnot and Pochat (1981), which describes a one-dimensional model applied to a snow avalanche. The main advance made here is the introduction of the second dimension in the runout zone. Indeed, in the channelled course, we still use the one-dimensional model, but, when the avalanche spreads before stopping, we apply a (x, y) grid on the ground and six equations have to be solved: (1) for the avalanche body, one equation for continuity and two equations for momentum conservation, and (2) at the front, one equation for continuity and two equations for momentum conservation. We suppose the front to be a mobile jump, with longitudinal velocity varying more rapidly than transverse velocity.We solve these equations by a finite difference method. This involves many topological problems, due to the actual position of the front, which is defined by its intersection with the reference grid (SI, YJ). In the near future our two directions of research will be testing the code on actual avalanches and improving it by trying to make it cheaper without impairing its accuracy.


Sign in / Sign up

Export Citation Format

Share Document