Nothing Special   »   [go: up one dir, main page]

You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (30)

Search Parameters:
Keywords = block selection criterion

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
21 pages, 9319 KiB  
Article
Forest Change Monitoring Based on Block Instance Sampling and Homomorphic Hypothesis Margin Evaluation
by Wei Feng, Fan Bu, Puxia Wu, Gabriel Dauphin, Yinghui Quan and Mengdao Xing
Remote Sens. 2024, 16(18), 3483; https://doi.org/10.3390/rs16183483 - 19 Sep 2024
Viewed by 512
Abstract
Forests play a crucial role in maintaining the integrity of natural ecosystems. Accurate mapping of windfall damages following storms is essential for effective post-disaster management. While remote sensing image classification offers substantial advantages over ground surveys for monitoring changes in forests, it encounters [...] Read more.
Forests play a crucial role in maintaining the integrity of natural ecosystems. Accurate mapping of windfall damages following storms is essential for effective post-disaster management. While remote sensing image classification offers substantial advantages over ground surveys for monitoring changes in forests, it encounters several challenges. Firstly, training samples in classification algorithms are typically selected through pixel-based random sampling or manual regional sampling. This approach struggles with accurately modeling complex patterns in high-resolution images and often results in redundant samples. Secondly, the limited availability of labeled samples compromises the classification accuracy when they are divided into training and test sets. To address these issues, two innovative approaches are proposed in this paper. The first is a new sample selection method which combines block-based sampling with spatial features extracted by single or multiple windows. Second, a new evaluation criterion is proposed by using the homomorphic hypothesis margin map with out-of-bag (OOB) accuracy. The former can not only assess the confidence level of each pixel category but also make regional boundaries clearer, and the latter can replace the test set so that all samples can be used for change detection. The experimental results show that the OOB accuracy obtained by spatial features with whole block sampling was 7.2% higher than that obtained by spectral features with pixel-based sampling and 2–3% higher than that for block center sampling, of which the highest value reached 98.8%. Additionally, the feasibility of identifying storm-damaged forests using only post-storm images has been demonstrated. Full article
(This article belongs to the Section Forest Remote Sensing)
Show Figures

Figure 1

Figure 1
<p>Location of study area.</p>
Full article ">Figure 2
<p>Formosat-2 multispectral images acquired before and after windstorm Klaus. (<b>a</b>) Before storm (RGB). (<b>b</b>) Before storm (NIR). (<b>c</b>) After storm (RGB). (<b>d</b>) After storm (NIR).</p>
Full article ">Figure 3
<p>Technical flowchart.</p>
Full article ">Figure 4
<p>The feature extraction procedure.</p>
Full article ">Figure 5
<p>The centers of windows of different sizes.</p>
Full article ">Figure 6
<p>Two sampling methods for remote sample selection. (<b>a</b>) Block center sampling, (<b>b</b>) Whole block sampling. The shadow is the selected sample point.</p>
Full article ">Figure 7
<p>Sampling technical flowchart.</p>
Full article ">Figure 8
<p>Binary map of random forests. (<b>a</b>) Spectral classification. (<b>b</b>) Spatial classification with block center sampling, <math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>. (<b>c</b>) Spatial classification with block center sampling (<math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>4</mn> </mrow> </semantics></math>). (<b>d</b>) Spatial classification with block center sampling (<math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math>). (<b>e</b>) Spatial classification with whole block sampling (<math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>). (<b>f</b>) Spatial classification with whole block sampling (<math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>4</mn> </mrow> </semantics></math>). (<b>g</b>) Spatial classification with whole block sampling, (<math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math>).</p>
Full article ">Figure 9
<p>Detail enlargements for the results.</p>
Full article ">Figure 10
<p>Margin map of random forests. (<b>a</b>) Spectral classification. (<b>b</b>) Spatial classification with block center sampling (<math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>). (<b>c</b>) Spatial classification with block center sampling (<math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>4</mn> </mrow> </semantics></math>). (<b>d</b>) Spatial classification with block center sampling (<math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math>). (<b>e</b>) Spatial classification with whole block sampling (<math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>). (<b>f</b>) Spatial classification with whole block sampling (<math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>4</mn> </mrow> </semantics></math>). (<b>g</b>) Spatial classification with whole block sampling (<math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math>).</p>
Full article ">Figure 11
<p>Binary map of random forests. (<b>a</b>) Test 1: 16 spatial features (<math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>). (<b>b</b>) Test 2: 40 spatial features (<math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>). (<b>c</b>) Test 3: 80 spatial features (<math display="inline"><semantics> <mrow> <msub> <mi>w</mi> <mn>1</mn> </msub> <mo>=</mo> <mn>3</mn> <mo>,</mo> <msub> <mi>w</mi> <mn>2</mn> </msub> <mo>=</mo> <mn>4</mn> </mrow> </semantics></math>).</p>
Full article ">Figure 12
<p>Margin map of random forests. (<b>a</b>) Test 1: 16 spatial features (<math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>). (<b>b</b>) Test 2: 40 spatial features (<math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>). (<b>c</b>) Test 3: 80 spatial features (<math display="inline"><semantics> <mrow> <msub> <mi>w</mi> <mn>1</mn> </msub> <mo>=</mo> <mn>3</mn> <mo>,</mo> <msub> <mi>w</mi> <mn>2</mn> </msub> <mo>=</mo> <mn>4</mn> </mrow> </semantics></math>).</p>
Full article ">Figure 13
<p>Binary map of random forests: (<b>a</b>) 20 spatial features, <math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>, (<b>b</b>) 40 spatial features, <math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>, (<b>c</b>) 40 spatial features, <math display="inline"><semantics> <mrow> <msub> <mi>w</mi> <mn>1</mn> </msub> <mo>=</mo> <mn>3</mn> <mo>,</mo> <msub> <mi>w</mi> <mn>2</mn> </msub> <mo>=</mo> <mn>4</mn> </mrow> </semantics></math>, and (<b>d</b>) 80 spatial features, <math display="inline"><semantics> <mrow> <msub> <mi>w</mi> <mn>1</mn> </msub> <mo>=</mo> <mn>3</mn> <mo>,</mo> <msub> <mi>w</mi> <mn>2</mn> </msub> <mo>=</mo> <mn>4</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 14
<p>Margin map of random forests: (<b>a</b>) 20 spatial features, <math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>, (<b>b</b>) 40 spatial features, <math display="inline"><semantics> <mrow> <mi>w</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>, (<b>c</b>) 40 spatial features, <math display="inline"><semantics> <mrow> <msub> <mi>w</mi> <mn>1</mn> </msub> <mo>=</mo> <mn>3</mn> <mo>,</mo> <msub> <mi>w</mi> <mn>2</mn> </msub> <mo>=</mo> <mn>4</mn> </mrow> </semantics></math>, and (<b>d</b>) 80 spatial features, <math display="inline"><semantics> <mrow> <msub> <mi>w</mi> <mn>1</mn> </msub> <mo>=</mo> <mn>3</mn> <mo>,</mo> <msub> <mi>w</mi> <mn>2</mn> </msub> <mo>=</mo> <mn>4</mn> </mrow> </semantics></math>.</p>
Full article ">
22 pages, 14082 KiB  
Article
A Robust SAR-Optical Heterologous Image Registration Method Based on Region-Adaptive Keypoint Selection
by Keke Zhang, Anxi Yu, Wenhao Tong and Zhen Dong
Remote Sens. 2024, 16(17), 3289; https://doi.org/10.3390/rs16173289 - 4 Sep 2024
Viewed by 588
Abstract
The differences in sensor imaging mechanisms, observation angles, and scattering characteristics of terrestrial objects significantly limit the registration performance of synthetic aperture radar (SAR) and optical heterologous images. Traditional methods particularly struggle in weak feature regions, such as harbors and islands with substantial [...] Read more.
The differences in sensor imaging mechanisms, observation angles, and scattering characteristics of terrestrial objects significantly limit the registration performance of synthetic aperture radar (SAR) and optical heterologous images. Traditional methods particularly struggle in weak feature regions, such as harbors and islands with substantial water coverage, as well as in desolate areas like deserts. This paper introduces a robust heterologous image registration technique based on region-adaptive keypoint selection that integrates image texture features, targeting two pivotal aspects: feature point extraction and matching point screening. Initially, a dual threshold criterion based on block region information entropy and variance products effectively identifies weak feature regions. Subsequently, it constructs feature descriptors to generate similarity maps, combining histogram parameter skewness with non-maximum suppression (NMS) to enhance matching point accuracy. Extensive experiments have been conducted on conventional SAR-optical datasets and typical SAR-optical images with different weak feature regions to assess the method’s performance. The findings indicate that this method successfully removes outliers in weak feature regions and completes the registration task of SAR and optical images with weak feature regions. Full article
Show Figures

Figure 1

Figure 1
<p>The framework of the registration method based on region-adaptive keypoint selection.</p>
Full article ">Figure 2
<p>The flow chart of VE-FAST.</p>
Full article ">Figure 3
<p>Example of VE-FAST feature point extraction process. The left figure shows the distribution of candidate points, where the red points represent the candidate points selected as feature points and the blue points represent the eliminated candidate points. The red histogram on the right shows the variance product value of the red points and the blue histogram on the right shows the variance product value of the blue points. The feature point in the yellow square is the false feature point, and the yellow arrow points to its corresponding variance product value.</p>
Full article ">Figure 4
<p>Comparison of FAST, Block-FAST, Block-Harris, and VE-FAST feature point extraction. The red dots represent the feature points obtained by each feature point extraction algorithm.</p>
Full article ">Figure 5
<p>Run time of FAST, Block-Fast, Block-Harris, and VE-FAST.</p>
Full article ">Figure 6
<p>Comparison of similarity maps and histograms for correct matching points and false matching points. (<b>a</b>–<b>d</b>) Correct matching points; (<b>e</b>–<b>h</b>) false matching points. The first and third rows are normalized similarity maps, and the second and fourth rows are the corresponding histograms.</p>
Full article ">Figure 7
<p>SNMS flowchart.</p>
Full article ">Figure 8
<p>Simplified NMS example. (<b>a</b>) NMS of the correct matching point; (<b>b</b>) NMS of the false matching point.</p>
Full article ">Figure 9
<p>Example of SNMS-based matching point pair outputs. The red dots represent the feature points obtained by VE-FAST.</p>
Full article ">Figure 10
<p>Example of OS-dataset partial data.</p>
Full article ">Figure 11
<p>Six sets of weak feature region images. (<b>a1</b>–<b>f1</b>) Optical images of case <b>A</b>–<b>F</b>; (<b>a2</b>–<b>f2</b>) SAR images of case <b>A</b>–<b>F</b>.</p>
Full article ">Figure 11 Cont.
<p>Six sets of weak feature region images. (<b>a1</b>–<b>f1</b>) Optical images of case <b>A</b>–<b>F</b>; (<b>a2</b>–<b>f2</b>) SAR images of case <b>A</b>–<b>F</b>.</p>
Full article ">Figure 12
<p>Comparison of registration results based on OS dataset. (<b>a</b>) Comparison of CMR for five methods; (<b>b</b>) comparison of RMSE for five methods.</p>
Full article ">Figure 13
<p>Distribution of final matching point pairs. (<b>a</b>) Case <b>E</b> matching point distribution; (<b>b</b>) case <b>F</b> matching point distribution.</p>
Full article ">Figure 14
<p>Comparison of registration results for “isolated islands” case <b>E</b> and <b>F</b>. I-1 to III-1 are localized images of case <b>E</b> before registration, and I-2 to III-2 are localized images of case <b>E</b> after registration. IV-1 to VI-1 are localized images of case <b>F</b> before registration, and IV-2 to VI-2 are localized images of case <b>F</b> after registration.</p>
Full article ">Figure 15
<p>Registration results of five methods in the weak feature region. (<b>a</b>) CMR comparison results; (<b>b</b>) RMSE comparison results; (<b>c</b>) run time comparison results.</p>
Full article ">Figure 16
<p>Registration checkerboard results of this paper’s method under typical weak feature regions. (<b>a</b>) Registration results for desert scene; (<b>b</b>) registration results for island scene; (<b>c</b>) registration results for harbor scene; (<b>d</b>) registration results for forest scene.</p>
Full article ">Figure 17
<p>Impact of the number of candidate points on registration performance. (<b>a</b>) CMR changes; (<b>b</b>) RMSE changes; (<b>c</b>) run time changes.</p>
Full article ">
18 pages, 3019 KiB  
Article
Transient Analysis of a Selective Partial-Update LMS Algorithm
by Newton N. Siqueira, Leonardo C. Resende, Fabio A. A. Andrade, Rodrigo M. S. Pimenta, Diego B. Haddad and Mariane R. Petraglia
Appl. Sci. 2024, 14(7), 2775; https://doi.org/10.3390/app14072775 - 26 Mar 2024
Viewed by 720
Abstract
In applications where large-order filters are needed, the computational load of adaptive filtering algorithms can become prohibitively expensive. In this paper, a comprehensive analysis of a selective partial-update least mean squares, named SPU-LMS-M-min, is developed. By employing the partial-update strategy for a non-normalized [...] Read more.
In applications where large-order filters are needed, the computational load of adaptive filtering algorithms can become prohibitively expensive. In this paper, a comprehensive analysis of a selective partial-update least mean squares, named SPU-LMS-M-min, is developed. By employing the partial-update strategy for a non-normalized adaptive scheme, the designer can choose an appropriate number of update blocks considering a trade-off between convergence rate and computational complexity, which can result in a more than 40% reduction in the number of multiplications in some configurations compared to the traditional LMS algorithm. Based on the principle of minimum distortion, a selection criterion is proposed that is based on the input signal’s blocks with the lowest energy, whereas typical Selective Partial Update (SPU) algorithms use a selection criterion based on blocks with highest energy. Stochastic models are developed for the mean weights and mean and mean squared behaviour of the proposed algorithm, which are further extended to accommodate scenarios involving time-varying dynamics and suboptimal filter lengths. Simulation results show that the theoretical predictions are in good agreement with the experimental outcomes. Furthermore, it is demonstrated that the proposed selection criterion can be easily extended to active noise cancellation algorithms as well as algorithms utilizing variable filter length. This allows for the reduction of computational costs for these algorithms without compromising their asymptotic performance. Full article
(This article belongs to the Special Issue Statistical Signal Processing: Theory, Methods and Applications)
Show Figures

Figure 1

Figure 1
<p>Block diagram of an adaptive filtering algorithm applied to systems identification.</p>
Full article ">Figure 2
<p>Block diagram of the FX-LMS algorithm.</p>
Full article ">Figure 3
<p>Theoretical (red dashed line) and empirical (blue solid line) evolution of the adaptive filter coefficients for <math display="inline"><semantics> <mrow> <mi>B</mi> <mo>∈</mo> <mo>{</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mn>4</mn> <mo>}</mo> </mrow> </semantics></math>. (<b>a</b>) Coefficient <math display="inline"><semantics> <mrow> <msub> <mi>w</mi> <mn>8</mn> </msub> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </semantics></math>; (<b>b</b>) Coefficient <math display="inline"><semantics> <mrow> <msub> <mi>w</mi> <mn>34</mn> </msub> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </semantics></math>.</p>
Full article ">Figure 4
<p>Theoretical (red dashed line) and empirical (blue solid line) evolution of the adaptive filter coefficients for <math display="inline"><semantics> <mrow> <mi>B</mi> <mo>∈</mo> <mo>{</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mn>4</mn> <mo>}</mo> </mrow> </semantics></math>. (<b>a</b>) MSD (dB); (<b>b</b>) MSE (dB).</p>
Full article ">Figure 5
<p>Theoretical (red) and simulated (blue) steady-state MSD (in dB), as a function of <math display="inline"><semantics> <mi>β</mi> </semantics></math>. The variance in the random perturbation is <math display="inline"><semantics> <mrow> <msubsup> <mi>σ</mi> <mrow> <mi>q</mi> </mrow> <mn>2</mn> </msubsup> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>15</mn> </mrow> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>Comparison of empirical results (<b>a</b>) MSD (dB); (<b>b</b>) MSE (dB). Theoretical result (red) and experimental result (blue), considering the colored input signal.</p>
Full article ">Figure 7
<p>Comparison between theoretical MSE (dashed red line) and empirical MSE (solid blue line) for the deficient-length scenario.</p>
Full article ">Figure 8
<p>Comparison between empirical SPU-LMS-M-max (red) and SPU-LMS-M-min (blue) for the very intense impulsive noise scenario. (<b>a</b>) MSD (dB); (<b>b</b>) MSE (dB).</p>
Full article ">Figure 9
<p>Comparison between empirical SPU-Variable Tap Length (red) and Variable Tap Length (blue). (<b>a</b>) MSE (dB); (<b>b</b>) Tap Length.</p>
Full article ">Figure 10
<p>Comparison between empirical SPU-FX-LMS (red) and FX-LMS (blue) for different intense noise scenarios. (<b>a</b>) <math display="inline"><semantics> <mrow> <msubsup> <mi>σ</mi> <mrow> <mi>ν</mi> </mrow> <mn>2</mn> </msubsup> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>6</mn> </mrow> </msup> </mrow> </semantics></math>; (<b>b</b>) <math display="inline"><semantics> <mrow> <msubsup> <mi>σ</mi> <mrow> <mi>ν</mi> </mrow> <mn>2</mn> </msubsup> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>2</mn> </mrow> </msup> </mrow> </semantics></math>.</p>
Full article ">
14 pages, 387 KiB  
Article
Imputation-Based Variable Selection Method for Block-Wise Missing Data When Integrating Multiple Longitudinal Studies
by Zhongzhe Ouyang, Lu Wang and Alzheimer’s Disease Neuroimaging Initiative
Mathematics 2024, 12(7), 951; https://doi.org/10.3390/math12070951 - 23 Mar 2024
Viewed by 889
Abstract
When integrating data from multiple sources, a common challenge is block-wise missing. Most existing methods address this issue only in cross-sectional studies. In this paper, we propose a method for variable selection when combining datasets from multiple sources in longitudinal studies. To account [...] Read more.
When integrating data from multiple sources, a common challenge is block-wise missing. Most existing methods address this issue only in cross-sectional studies. In this paper, we propose a method for variable selection when combining datasets from multiple sources in longitudinal studies. To account for block-wise missing in covariates, we impute the missing values multiple times based on combinations of samples from different missing pattern and predictors from different data sources. We then use these imputed data to construct estimating equations, and aggregate the information across subjects and sources with the generalized method of moments. We employ the smoothly clipped absolute deviation penalty in variable selection and use the extended Bayesian Information Criterion criteria for tuning parameter selection. We establish the asymptotic properties of the proposed estimator, and demonstrate the superior performance of the proposed method through numerical experiments. Furthermore, we apply the proposed method in the Alzheimer’s Disease Neuroimaging Initiative study to identify sensitive early-stage biomarkers of Alzheimer’s Disease, which is crucial for early disease detection and personalized treatment. Full article
Show Figures

Figure 1

Figure 1
<p>Example of block-wise missing data in longitudinal studies.</p>
Full article ">Figure 2
<p>Two imputation approaches for missing covariates of source 3 in pattern 2. In the left figure, samples from pattern 1 and covariates in source 1 and source 2 are used to train the model, which is subsequently used to predict the missing covariates in pattern 2. Similarly, in the right figure, samples from pattern 1 and pattern 3 and covariates in source 1 are used to train the model.</p>
Full article ">
13 pages, 4584 KiB  
Article
Transforaminal Endoscopic Lumbar Lateral Recess Decompression for Octogenarian Patients
by Yong Ahn and Jun-Hyeok Jung
J. Clin. Med. 2024, 13(2), 515; https://doi.org/10.3390/jcm13020515 - 17 Jan 2024
Viewed by 1279
Abstract
The incidence of radiculopathy due to lumbar spinal stenosis has been on the increase in the aging population. However, patients aged ≥ 80 years hesitate to undergo conventional open surgery under general anesthesia because of the risk of postoperative morbidity and adverse events. [...] Read more.
The incidence of radiculopathy due to lumbar spinal stenosis has been on the increase in the aging population. However, patients aged ≥ 80 years hesitate to undergo conventional open surgery under general anesthesia because of the risk of postoperative morbidity and adverse events. Therefore, less invasive surgical alternatives are required for the elderly or medically handicapped patients. Transforaminal endoscopic lumbar lateral recess decompression (TELLRD) may be helpful for those patients. This study aimed to demonstrate the efficacy of TELLRD for treating radiculopathy in octogenarian patients. A total of 21 consecutive octogenarian patients with lumbar foraminal stenosis underwent TELLRD between January 2017 and January 2021. The inclusion criterion was unilateral radiculopathy, which stemmed from lumbar lateral recess stenosis. The pain source was verified using imaging studies and selective nerve blocks. Full-scale lateral canal decompression was performed using a percutaneous transforaminal endoscopic approach under local anesthesia. We found the pain scores and functional status improved significantly during the 24-month follow-up period. The clinical improvement rate was 95.24% (20 of 21 patients) with no systemic complication. In conclusion, endoscopic lateral recess decompression via the transforaminal approach is practical for octogenarian patients. Full article
(This article belongs to the Special Issue Advances in Minimally Invasive Spine Surgery)
Show Figures

Figure 1

Figure 1
<p>Schematic pictures of TELLRD. (<b>A</b>) Lumbar lateral recess stenosis. The TNR is compressed by the hypertrophied SAP, thickened LF, and pedicle. (<b>B</b>) Transforaminal dorsal decompression by resecting SAP, LF, and part of the pedicle using endoscopic burrs and punches at the lateral recess. (<b>C</b>) Transforaminal ventral decompression by removing shoulder osteophytes and redundant disc using endoscopic burrs and forceps to release the TNR. (<b>D</b>) Endpoint of the full-scale decompression of the lateral spinal canal. TELLRD, transforaminal endoscopic lumbar lateral recess decompression; TNR, traversing nerve root; SAP, superior articular process; LF, ligamentum flavum.</p>
Full article ">Figure 2
<p>Intraoperative endoscopic pictures TELLRD. (<b>A</b>) Bony unroofing using endoscopic burrs and punches. The hypertrophic SAP and part of the pedicle were undercut using an endoscopic burr (L4–L5, left). (<b>B</b>) Ventral decompression with removal of thickened LF using endoscopic punches. (<b>C</b>) Dorsal decompression with removal of redundant disc and shoulder osteophytes using endoscopic burrs and punches. (<b>D</b>) Final endoscopic view showing the released TNR. TELLRD, transforaminal endoscopic lumbar lateral recess decompression; SAP, superior articular process; LF, ligamentum flavum; TNR, traversing nerve root.</p>
Full article ">Figure 3
<p>An illustrative case of an 81-year-old female patient treated with TELLRD. (<b>A</b>) Preoperative axial CT showing central and lateral recess stenosis at the L3–L4 level (arrows). (<b>B</b>) Postoperative axial CT showing lateral spinal canal decompression following undercutting of the hypertrophic SAP and LF compressing the TNR (arrowheads). (<b>C</b>) Preoperative sagittal CT showing lateral recess stenosis at the L3–L4 level (arrows). (<b>D</b>) Postoperative sagittal CT showing lateral spinal canal decompression following undercutting of the hypertrophic SAP and LF compressing the TNR (arrowheads). (<b>E</b>) Postoperative coronal CT showing lateral recess stenosis at the L3–L4 level (arrows). (<b>F</b>) Postoperative coronal CT showing lateral spinal canal decompression following undercutting the SAP and LF compressing the TNR (arrowheads). TELLRD, transforaminal endoscopic lumbar lateral recess decompression; SAP, superior articular process; LF, ligamentum flavum; TNR, traversing nerve root.</p>
Full article ">Figure 3 Cont.
<p>An illustrative case of an 81-year-old female patient treated with TELLRD. (<b>A</b>) Preoperative axial CT showing central and lateral recess stenosis at the L3–L4 level (arrows). (<b>B</b>) Postoperative axial CT showing lateral spinal canal decompression following undercutting of the hypertrophic SAP and LF compressing the TNR (arrowheads). (<b>C</b>) Preoperative sagittal CT showing lateral recess stenosis at the L3–L4 level (arrows). (<b>D</b>) Postoperative sagittal CT showing lateral spinal canal decompression following undercutting of the hypertrophic SAP and LF compressing the TNR (arrowheads). (<b>E</b>) Postoperative coronal CT showing lateral recess stenosis at the L3–L4 level (arrows). (<b>F</b>) Postoperative coronal CT showing lateral spinal canal decompression following undercutting the SAP and LF compressing the TNR (arrowheads). TELLRD, transforaminal endoscopic lumbar lateral recess decompression; SAP, superior articular process; LF, ligamentum flavum; TNR, traversing nerve root.</p>
Full article ">Figure 4
<p>Clinical outcomes of TELLRD for octogenarian patients. (<b>A</b>) VAS pain score for radicular pain preoperatively and at 6 weeks, 6 months, 1 year, and 2 years postoperatively. (<b>B</b>) ODI scores preoperatively and at 6 weeks, 6 months, 1 year, and 2 years postoperatively. TELLRD, transforaminal endoscopic lumbar lateral recess decompression; VAS, visual analog scale; ODI, Oswestry disability index.</p>
Full article ">Figure 4 Cont.
<p>Clinical outcomes of TELLRD for octogenarian patients. (<b>A</b>) VAS pain score for radicular pain preoperatively and at 6 weeks, 6 months, 1 year, and 2 years postoperatively. (<b>B</b>) ODI scores preoperatively and at 6 weeks, 6 months, 1 year, and 2 years postoperatively. TELLRD, transforaminal endoscopic lumbar lateral recess decompression; VAS, visual analog scale; ODI, Oswestry disability index.</p>
Full article ">Figure 5
<p>The four-point overall outcomes based on the modified MacNab criteria: the procedure outcomes were excellent in 5 patients (23. 81%), good in 13 (61.90%), fair in 2 (9.52%), and poor in 1 (4.76%). Therefore, the success rate was 85.71%, and the clinical improvement rate was 95.24%.</p>
Full article ">
22 pages, 6967 KiB  
Article
Design and Implementation of a New Framework for Post-Synthesis Obfuscation with a Mixture of Multiple Cells with an Integrated Anti-SAT Block
by Hamidur Rahman, A. B. M. Harun-ur Rashid and Mahmudul Hasan
Electronics 2023, 12(22), 4687; https://doi.org/10.3390/electronics12224687 - 17 Nov 2023
Viewed by 1120
Abstract
This paper proposes a new framework for post-synthesis obfuscation of digital circuits using a mixture of cells combined with an Anti-SAT block. Furthermore, a novel integrated framework has been established wherein obfuscation, along with Anti-SAT and validation of the benchmarks, progress through MATLAB [...] Read more.
This paper proposes a new framework for post-synthesis obfuscation of digital circuits using a mixture of cells combined with an Anti-SAT block. Furthermore, a novel integrated framework has been established wherein obfuscation, along with Anti-SAT and validation of the benchmarks, progress through MATLAB®, Python, Cadence RTL Encounter® and Cadence LEC® to implement the proposed methodology. Area, delay, leakage power and total power are adopted as elements of the evaluation matrix. These parameters are compared between the original circuit, the circuit after obfuscation, the circuit after integration with Anti-SAT and the circuit after implementation of the proposed method of multiple-cell obfuscation with Anti-SAT. The probability of breaking a circuit is taken as the security criterion. It is mathematically proven that as the number of types of obfuscated cells used increases, then the probability of breaking the circuit decreases. The results obtained accord with the mathematical proof. The framework minimizes the delay by inserting obfuscation cells (OCs) in the non-critical paths, strengthens the security by using several types of OCs and allows the user to select a design based on justified area, leakage power and total power. However, against a Boolean SATisfiability (SAT) attack, obfuscation with multiple cells is not a sufficient defense. An Anti-SAT block performs better than obfuscation but has its own limitations. Thus, use of an Anti-SAT block in combination with multiple-cell obfuscation is proposed and implemented, giving better results against an efficient SAT attack. The number of iterations, as well as runtime to obtain the correct keys, increase significantly for the Anti-SAT block combined with multiple-cell obfuscation compared to the Anti-SAT or obfuscation block alone. Full article
Show Figures

Figure 1

Figure 1
<p>Flowchart of the proposed framework for protecting hardware intellectual property.</p>
Full article ">Figure 2
<p>(<b>a</b>). Anti-SAT and (<b>b</b>). Existing Anti-SAT + Obfuscation with only one type of key gate.</p>
Full article ">Figure 3
<p>Original s27 circuit.</p>
Full article ">Figure 4
<p>s27 circuit converted to a combinational circuit.</p>
Full article ">Figure 5
<p>Anti-SAT implemented in an s27 circuit.</p>
Full article ">Figure 6
<p>Proposed system of Anti-SAT + Obfuscation with multiple types of key gates, implemented in an s27 circuit.</p>
Full article ">Figure 7
<p>(<b>a</b>). SAT Attack Circuit Diagram. (<b>b</b>). SAT Attack Circuit Diagram [<a href="#B34-electronics-12-04687" class="html-bibr">34</a>].</p>
Full article ">Figure 8
<p>Percentage increase in area for 25%, 50% and 75% obfuscation levels of ISCAS 89 benchmark circuits using OC3 random.</p>
Full article ">Figure 9
<p>Percentage increase in delay for 25%, 50% and 75% obfuscation levels of ISCAS 89 benchmark circuits using OC3 random.</p>
Full article ">Figure 10
<p>Percentage increase in leakage power for 25%, 50% and 75% obfuscation levels of ISCAS 89 benchmark circuits using OC3 random.</p>
Full article ">Figure 11
<p>Percentage increase in total power for 25%, 50% and 75% obfuscation levels of ISCAS 89 benchmark circuits using OC3 random.</p>
Full article ">Figure 12
<p>Average percentage increase in area of the benchmark circuits with different numbers and types of OC.</p>
Full article ">Figure 13
<p>Average percentage increase in delay of the benchmark circuits with different numbers and types of OC.</p>
Full article ">Figure 14
<p>Average percentage increase in leakage power of the benchmark circuits with different numbers and types of OC.</p>
Full article ">Figure 15
<p>Average percentage increase in total power of the benchmark circuits with different numbers and types of OC.</p>
Full article ">Figure 16
<p>Probability of detecting correct output for 25%, 50% and 75% obfuscation levels in ISCAS 89 benchmark circuits.</p>
Full article ">Figure 17
<p>Probability of detecting the correct OC at the correct location for 25%, 50% and 75% obfuscation levels with different numbers of OCs in ISCAS 89 benchmark circuits.</p>
Full article ">Figure 18
<p>Probability of detecting correct OC at precise location for 25%, 50% and 75% obfuscation levels with OC3 for ISCAS 89 benchmark circuits.</p>
Full article ">Figure 19
<p>Probability of detecting the correct OC at the correct location for 25% obfuscation levels with different numbers of OCs for ISCAS 89 benchmark circuits.</p>
Full article ">
16 pages, 3821 KiB  
Article
Improved Broad Learning System for Birdsong Recognition
by Jing Lu, Yan Zhang, Danjv Lv, Shanshan Xie, Yixing Fu, Dan Lv, Youjie Zhao and Zhun Li
Appl. Sci. 2023, 13(19), 11009; https://doi.org/10.3390/app131911009 - 6 Oct 2023
Cited by 1 | Viewed by 939
Abstract
Birds play a vital and indispensable role in biodiversity and environmental conservation. Protecting bird diversity is crucial for maintaining the balance of nature, promoting ecosystem health, and ensuring sustainable development. The Broad Learning System (BLS) exhibits an excellent ability to extract highly discriminative [...] Read more.
Birds play a vital and indispensable role in biodiversity and environmental conservation. Protecting bird diversity is crucial for maintaining the balance of nature, promoting ecosystem health, and ensuring sustainable development. The Broad Learning System (BLS) exhibits an excellent ability to extract highly discriminative features from raw inputs and construct complex feature representations by combining feature nodes and enhancement nodes, thereby enabling effective recognition and classification of various birdsongs. However, within the BLS, the selection of feature nodes and enhancement nodes assumes critical significance, yet the model lacks the capability to identify high quality network nodes. To address this issue, this paper proposes a novel method that introduces residual blocks and Mutual Similarity Criterion (MSC) layers into BLS to form an improved BLS (RMSC-BLS), which makes it easier for BLS to automatically select optimal features related to output. Experimental results demonstrate the accuracy of the RMSC-BLS model for the three construction features of MFCC, dMFCC, and dsquence is 78.85%, 79.29%, and 92.37%, respectively, which is 4.08%, 4.50%, and 2.38% higher than that of original BLS model. In addition, compared with other models, our RMSC-BLS model shows superior recognition performance, has higher stability and better generalization ability, and provides an effective solution for birdsong recognition. Full article
Show Figures

Figure 1

Figure 1
<p>The structure of Broad Learning System.</p>
Full article ">Figure 2
<p>The Proposed framework.</p>
Full article ">Figure 3
<p>Construction of <math display="inline"> <semantics> <mrow> <msub> <mi>d</mi> <mrow> <mi>s</mi> <mi>q</mi> <mi>u</mi> <mi>e</mi> <mi>n</mi> <mi>c</mi> <mi>e</mi> </mrow> </msub> </mrow> </semantics> </math> feature.</p>
Full article ">Figure 4
<p>The improved BLS model with residual block and MSC.</p>
Full article ">Figure 5
<p>Performance of different features on three models. (<b>a</b>) Results of MFCC on models; (<b>b</b>) Results of <math display="inline"> <semantics> <mrow> <msub> <mi>d</mi> <mrow> <mi>M</mi> <mi>F</mi> <mi>C</mi> <mi>C</mi> </mrow> </msub> </mrow> </semantics> </math> on models; (<b>c</b>) Results of <math display="inline"> <semantics> <mrow> <msub> <mi>d</mi> <mrow> <mi>s</mi> <mi>q</mi> <mi>u</mi> <mi>e</mi> <mi>n</mi> <mi>c</mi> <mi>e</mi> </mrow> </msub> </mrow> </semantics> </math> on models.</p>
Full article ">Figure 6
<p>Results of <math display="inline"> <semantics> <mrow> <msub> <mi>d</mi> <mrow> <mi>s</mi> <mi>q</mi> <mi>u</mi> <mi>e</mi> <mi>n</mi> <mi>c</mi> <mi>e</mi> </mrow> </msub> </mrow> </semantics> </math> on RMSC-BLS.</p>
Full article ">Figure 7
<p>Comparison of different BLS models.</p>
Full article ">Figure 8
<p>Comparison with Res-BLS, MSC-BLS and RMSC-BLS.</p>
Full article ">Figure 9
<p>Confusion matrices.</p>
Full article ">
19 pages, 7768 KiB  
Article
Chromatin Morphology in Human Germinal Vesicle Oocytes and Their Competence to Mature in Stimulated Cycles
by Daniil Salimov, Tatiana Lisovskaya, Junko Otsuki, Alexandre Gzgzyan, Irina Bogolyubova and Dmitry Bogolyubov
Cells 2023, 12(15), 1976; https://doi.org/10.3390/cells12151976 - 31 Jul 2023
Cited by 1 | Viewed by 1780
Abstract
The search for simple morphological predictors of oocyte quality is an important task for assisted reproduction technologies (ARTs). One such predictor may be the morphology of the oocyte nucleus, called the germinal vesicle (GV), including the level of chromatin aggregation around the atypical [...] Read more.
The search for simple morphological predictors of oocyte quality is an important task for assisted reproduction technologies (ARTs). One such predictor may be the morphology of the oocyte nucleus, called the germinal vesicle (GV), including the level of chromatin aggregation around the atypical nucleolus (ANu)—a peculiar nuclear organelle, formerly referred to as the nucleolus-like body. A prospective cohort study allowed distinguishing three classes of GV oocytes among 135 oocytes retrieved from 64 patients: with a non-surrounded ANu and rare chromatin blocks in the nucleoplasm (Class A), with a complete peri-ANu heterochromatic rim assembling all chromatin (Class C), and intermediate variants (Class B). Comparison of the chromatin state and the ability of oocytes to complete meiosis allowed us to conclude that Class B and C oocytes are more capable of resuming meiosis in vitro and completing the first meiotic division, while Class A oocytes can resume maturation but often stop their development either at metaphase I (MI arrest) or before the onset of GV breakdown (GVBD arrest). In addition, oocytes with a low chromatin condensation demonstrated a high level of aneuploidy during the resumption of meiosis. Considering that the degree of chromatin condensation/compaction can be determined in vivo under a light microscope, this characteristic of the GV can be considered a promising criterion for selecting the best-quality GV oocytes in IVM rescue programs. Full article
Show Figures

Figure 1

Figure 1
<p>A diagram illustrating the studied groups of human oocytes.</p>
Full article ">Figure 2
<p>Human oocytes with central (<b>a</b>) and peripheral position (<b>b</b>) of the GV.</p>
Full article ">Figure 3
<p>Percentage of GV oocytes retrieved from small and medium follicles in Groups I, II, and III that differ by their competence to resume meiosis.</p>
Full article ">Figure 4
<p>Percentage of oocytes with peripheral and central localization of the GV (<b>a</b>) and the relative displacement of the GV (L<sub>ecc</sub>, %) (<b>b</b>) in oocyte groups differing by their competence to resume meiosis (I, II, and III).</p>
Full article ">Figure 5
<p>Representative human GV oocytes of three classes (A, B, and C) that differ in chromatin configuration and its association with the atypical nucleolus (asterisks) viewed using DIC optics (<b>a</b>–<b>c</b>). In Class A oocytes (<b>a</b>), chromatin is predominantly distributed throughout the GV; only rare blocks of heterochromatin are visible. In Class C oocytes (<b>c</b>), all the chromatin is assembled around the atypical nucleolus, forming a ring (arrow). Class B oocytes (<b>b</b>) exhibit all intermediate chromatin configurations; gaps in the incomplete ring around the atypical nucleolus are shown (arrowheads).</p>
Full article ">Figure 6
<p>Percentage of oocytes with different chromatin configurations (Classes A, B, C): (<b>a</b>) of all oocytes retrieved; (<b>b</b>) in Groups I, II, and III that differ by their competence to resume meiosis; asterisks indicate significant differences and corresponding <span class="html-italic">p</span>-values.</p>
Full article ">Figure 7
<p>Aggregation level of condensed chromatin, S<sub>ch</sub> (<b>a</b>), and atypical nucleolus size, S<sub>ANu</sub> (<b>b</b>), in oocyte groups differing by their competence to resume meiosis (I, II, and III); asterisks indicate significant differences and corresponding <span class="html-italic">p</span>-values.</p>
Full article ">Figure 8
<p>Dynamics of projection areas of chromatin, S<sub>ch</sub> (<b>a</b>), and atypical nucleolus, S<sub>ANu</sub> (<b>b</b>), during in vitro development of GV oocytes with different chromatin configurations (Classes A, B, C); asterisks indicate significant differences and corresponding <span class="html-italic">p</span>-values.</p>
Full article ">Figure 9
<p>FISH to reveal aneuploidy for chromosomes (Chr) 13, 16, 18, 21, and 22 in an oocyte at metaphase I (MI, left column, framed blue) and an oocyte at metaphase II (MII, right column) with the first polar body (PB1, central column) (framed green). Aneuploidies are indicated by arrows: two—instead of four—copies of Chr 18 and 22 in MI and one—instead of two—copies of Chr 22 in PB1 and MII. Both examples are derived from Class A GV oocytes.</p>
Full article ">Figure 10
<p>Aneuploidy rates in different classes of GV oocytes (<b>a</b>), including the error source (<b>b</b>); asterisk indicates significant difference and corresponding <span class="html-italic">p</span>-value.</p>
Full article ">Figure A1
<p>Main morphometric parameters measured in the study: long diameter (D<sub>o</sub>, μm); short diameter of the oocyte (d<sub>o</sub>); minimum and maximum thickness of <span class="html-italic">zona pellucida</span> (ZP<sub>min</sub>/ZP<sub>max</sub>); eccentricity of the nucleus (L); projection areas of the nucleus (S<sub>GV</sub>), atypical nucleolus (S<sub>ANu</sub>), and karyosphere (S<sub>k</sub>).</p>
Full article ">Figure A2
<p>Consecutive steps of metaphase plate biopsy. (<b>a</b>) Laser dissection of <span class="html-italic">zona pellucida</span> (ZP); (<b>b</b>) penetration of the capillary; note the tight contact with the area containing the spindle; (<b>c</b>) suction of the karyoplast; (<b>d</b>) extraction of the karyoplast through ZP; (<b>e</b>) detaching the karyoplast from the remaining ooplasm; (<b>f</b>) transfer of the karyoplast.</p>
Full article ">
19 pages, 10497 KiB  
Article
Towards Intricate Stand Structure: A Novel Individual Tree Segmentation Method for ALS Point Cloud Based on Extreme Offset Deep Learning
by Yizhuo Zhang, Hantao Liu, Xingyu Liu and Huiling Yu
Appl. Sci. 2023, 13(11), 6853; https://doi.org/10.3390/app13116853 - 5 Jun 2023
Cited by 4 | Viewed by 1608
Abstract
Due to the complex structure of high-canopy-density forests, the traditional individual tree segmentation (ITS) algorithms based on ALS point cloud, which set segmentation threshold manually, is difficult to adequately cover a variety of complex situations, so the ITS accuracy is unsatisfactory. In this [...] Read more.
Due to the complex structure of high-canopy-density forests, the traditional individual tree segmentation (ITS) algorithms based on ALS point cloud, which set segmentation threshold manually, is difficult to adequately cover a variety of complex situations, so the ITS accuracy is unsatisfactory. In this paper, a top-down segmentation strategy is adopted to propose an adaptive segmentation method based on extreme offset deep learning, and the ITS set aggregation strategy based on gradient change criterion is designed for the over-segmentation generated by random offset, and the precise ITS is realized. Firstly, the segmentation sub-plot is set as 25 m × 25 m, the regional point cloud and its treetop are marked, and the offset network is trained. Secondly, the extreme offset network is designed to carry out spatial transformation of the original point cloud, and each point is offset to the position near the treetop to obtain the offset point cloud with a high density at the treetop, which enhances the discrimination among individual trees. Thirdly, the self-adaptive mean shift algorithm based on average neighboring distance is designed to divide and mark the offset point cloud. Fourthly, the offset point cloud, after clustering, is mapped back to the original space to complete the preliminary segmentation. Finally, according to the gradient change among different canopies, the ITS aggregation method is designed to aggregate adjacent canopies with a gentle gradient change. In order to investigate the universality of the proposed method on different stand structures, two coniferous forest plots (U1, U2) in the Blue Ridge area of Washington, USA, and two mixed forest plots (G1, G2) in Bretten, Germany, are selected in the experiment. The learning rate of the deep network is set as 0.001, the sampled point number of the sub-plot is 900, the transformer dimension is 512 × 512, the neighboring search number of points is 16, and the number of up-sampling blocks is 3. Experimental results show that in mixed forests (G1, G2) with complex structures, the F-score of the proposed method reaches 0.89, which is about 4% and 7% higher than the classical SHDR and improved DK, respectively. In high-canopy-density areas (U2, G2), the F-score of the proposed method reaches 0.89, which is about 3% and 4% higher than the SHDR and improved DK, respectively. The results show that the proposed method has high universality and accuracy, even in a complex stand environment with high canopy density. Full article
Show Figures

Figure 1

Figure 1
<p>Flowchart of the extreme offset segmentation method. (1) Preprocessing. (2) Extreme offset. Each point is offset to the corresponding treetop to obtain an offset point cloud with large discrimination among different trees. (3) Mean shift. The offset point cloud is clustered. (4) Space mapping. The offset point cloud, after clustering and labeling, is mapped back to the original point cloud space. (5) ITS set aggregation. The adjacent canopies with gentle gradient change are aggregated to reduce the over-segmentation error. (6) Postprocessing. The segmentation is completed after up-sampling and coordinate de-normalization.</p>
Full article ">Figure 2
<p>The main steps of data preprocessing. (<b>a</b>) Point cloud filtering; (<b>b</b>) Elevation normalization; (<b>c</b>) Divide subplot; (<b>d</b>) Point cloud denoising. The points surrounded by the red circle are the noise points at the boundary of the subplot; (<b>e</b>) Down-sampling; (<b>f</b>) Coordinate normalization.</p>
Full article ">Figure 3
<p>Point Transformer with extreme offset loss function.</p>
Full article ">Figure 4
<p>Schematic diagram of the mean shift process. The red arrow indicates the mean shift vector.</p>
Full article ">Figure 5
<p>Schematic diagram of the ITS set aggregation. (<b>a</b>) The purple and green sets should not be aggregated; (<b>b</b>) The green and blue sets should be aggregated.</p>
Full article ">Figure 6
<p>Schematic representation of the test plots.</p>
Full article ">Figure 7
<p>Partial segmentation results of the proposed method are shown, where the red circle represents the actual individual treetop, and the blue triangle represents the predicted individual treetop. (<b>a</b>) The point cloud after data preprocessing; (<b>b</b>) The offset point cloud after extreme offset; (<b>c</b>) The offset point cloud after mean shift cluster; (<b>d</b>) The point cloud after space mapping; (<b>e</b>) The point cloud after ITS set aggregation; (<b>f</b>) The origin point cloud after postprocessing.</p>
Full article ">Figure 7 Cont.
<p>Partial segmentation results of the proposed method are shown, where the red circle represents the actual individual treetop, and the blue triangle represents the predicted individual treetop. (<b>a</b>) The point cloud after data preprocessing; (<b>b</b>) The offset point cloud after extreme offset; (<b>c</b>) The offset point cloud after mean shift cluster; (<b>d</b>) The point cloud after space mapping; (<b>e</b>) The point cloud after ITS set aggregation; (<b>f</b>) The origin point cloud after postprocessing.</p>
Full article ">Figure 8
<p>The overall 3D segmentation results of the proposed method are shown. (<b>a</b>) U1; (<b>b</b>) U2; (<b>c</b>) G1; (<b>d</b>) G2.</p>
Full article ">Figure 9
<p>The curve of loss value and epoch when training and validation are performed in different offset ways. (<b>a</b>) training loss and epoch; (<b>b</b>) validation loss and epoch.</p>
Full article ">Figure 10
<p>Fixed bandwidth vs. Dynamic bandwidth.</p>
Full article ">Figure 11
<p>HAIS set cluster algorithm vs. ITS set cluster algorithm.</p>
Full article ">Figure 12
<p>Comparative test results. (<b>a</b>) Overall precision, recall, and F-score on different methods; (<b>b</b>) F-score on different plots and methods.</p>
Full article ">
24 pages, 2307 KiB  
Article
Anisotropy and Mechanical Properties of Nanoclay Filled, Medium-Density Rigid Polyurethane Foams Produced in a Sealed Mold, from Renewable Resources
by Ilze Beverte, Ugis Cabulis, Janis Andersons, Mikelis Kirpluks, Vilis Skruls and Peteris Cabulis
Polymers 2023, 15(11), 2582; https://doi.org/10.3390/polym15112582 - 5 Jun 2023
Cited by 5 | Viewed by 1658
Abstract
Medium-density rigid polyurethane (PU) foams are often produced in sealed molds; therefore, the processes inside the mold and structure of the produced foam blocks need to be understood. The structural and mechanical anisotropy is shown to be the third variable along with (1) [...] Read more.
Medium-density rigid polyurethane (PU) foams are often produced in sealed molds; therefore, the processes inside the mold and structure of the produced foam blocks need to be understood. The structural and mechanical anisotropy is shown to be the third variable along with (1) concentration of the nanoclay filler and (2) density, to determine the mechanical properties of the filled PU foam composites produced in a sealed mold. The varying anisotropy of the specimens hinders the accurate evaluation of the filling effect. The methodology for the estimation of the anisotropy characteristics of specimens from different locations within the nanoclay filled PU foam blocks is elaborated. A criterion, based on analysis of Poisson’s ratios, is formulated for the selection of specimens with similar anisotropy characteristics. The shear and bulk moduli are estimated theoretically, dependent on the filler’s concentration, using the experimentally determined constants. Full article
(This article belongs to the Section Polymer Networks)
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>The mold (<b>a</b>) open, (<b>b</b>) with a sealed lid, and (<b>c</b>) with a PU foam block inside.</p>
Full article ">Figure 2
<p>A PU foam block: (<b>a</b>) top view and (<b>b</b>) side view; the green rectangles enclose a zone of highly uniform density; C-a and C-b are sections of compression specimens, T-a and T-b are sections of tension specimens. X<sub>1</sub>OX<sub>2</sub>X<sub>3</sub>—a coordinate system, associated with the block (CGRH—the central gas-release hole and PGRH-s—the peripheral gas-release holes).</p>
Full article ">Figure 3
<p>XRD patterns of Cloisite-30B (black), NEOpolyol-380 (green) and a 5% dispersion of Cloisite-30B in NEOpolyol-380 made by sonication for 20 min (red) and high shear mixing for 20 min (blue).</p>
Full article ">Figure 4
<p>Density of NEOpolyol-380 PU foam specimens from blocks Nos. 1, 6 and 7 (as examples, the density distribution in the blocks Nos. 2, 3, 4 and 5 was similar); concentration of filler η = 0.0, 3.0 and 5.0%: (<b>a</b>–<b>c</b>) the compression specimens from sections C-a (black) and C-b (gray) and (<b>d</b>–<b>f</b>) the straight part of tension specimens from sections T-a (black) and T-b (gray).</p>
Full article ">Figure 5
<p>The dependence of Poisson’s ratios ν<sub>12</sub>, ν<sub>13</sub>, ν<sub>31</sub> and ν<sub>32</sub> on the degree of monotropy DM of the industrial PU foams. For isotropic PU foams ν = 0.33 (Black dashed line).</p>
Full article ">Figure 6
<p>Moduli (<b>a</b>) E<sub>1</sub> = E<sub>2</sub> and (<b>b</b>) E<sub>3</sub>, Poisson’s ratios (<b>c</b>) ν<sub>12</sub> = ν<sub>21</sub> and (<b>d</b>) ν<sub>31</sub> = ν<sub>32</sub>, stress at 10% strain (<b>e</b>) σ<sub>11(10%)</sub> = σ<sub>22(10%)</sub> and (<b>f</b>) σ<sub>33(10%)</sub> in compression, with dependence on concentration of filler: blue—data and trendlines of the selected specimens; the black markers—data points of the excluded specimens; and violet—trendlines for data of all specimens.</p>
Full article ">Figure 6 Cont.
<p>Moduli (<b>a</b>) E<sub>1</sub> = E<sub>2</sub> and (<b>b</b>) E<sub>3</sub>, Poisson’s ratios (<b>c</b>) ν<sub>12</sub> = ν<sub>21</sub> and (<b>d</b>) ν<sub>31</sub> = ν<sub>32</sub>, stress at 10% strain (<b>e</b>) σ<sub>11(10%)</sub> = σ<sub>22(10%)</sub> and (<b>f</b>) σ<sub>33(10%)</sub> in compression, with dependence on concentration of filler: blue—data and trendlines of the selected specimens; the black markers—data points of the excluded specimens; and violet—trendlines for data of all specimens.</p>
Full article ">Figure 7
<p>(<b>a</b>) Moduli E<sub>1</sub> = E<sub>2</sub>, (<b>b</b>) Poisson’s ratio ν<sub>12</sub> = ν<sub>21</sub>, (<b>c</b>) strengths σ<sub>11max</sub> and (<b>d</b>) elongation at break ε<sub>11max</sub> in tension, with dependence on concentration of filler: red—data and trendlines of the selected specimens; the black markers—data points of the excluded specimens; and violet—trendlines for data of all specimens.</p>
Full article ">Figure 8
<p>The other calculated elastic constants (<b>a</b>) Poisson’s ratios ν<sub>13</sub> = ν<sub>23</sub> in compression, (<b>b</b>) shear modulus and (<b>c</b>) bulk modulus with dependence on concentration of filler (the selected specimens).</p>
Full article ">
25 pages, 2399 KiB  
Article
A Distributed Blocking Flowshop Scheduling with Setup Times Using Multi-Factory Collaboration Iterated Greedy Algorithm
by Chenyao Zhang, Yuyan Han, Yuting Wang, Junqing Li and Kaizhou Gao
Mathematics 2023, 11(3), 581; https://doi.org/10.3390/math11030581 - 22 Jan 2023
Cited by 5 | Viewed by 1692
Abstract
As multi-factory production models are more widespread in modern manufacturing systems, a distributed blocking flowshop scheduling problem (DBFSP) is studied in which no buffer between adjacent machines and setup time constraints are considered. To address the above problem, a mixed integer linear programming [...] Read more.
As multi-factory production models are more widespread in modern manufacturing systems, a distributed blocking flowshop scheduling problem (DBFSP) is studied in which no buffer between adjacent machines and setup time constraints are considered. To address the above problem, a mixed integer linear programming (MILP) model is first constructed, and its correctness is verified. Then, an iterated greedy-algorithm-blending multi-factory collaboration mechanism (mIG) is presented to optimize the makespan criterion. In the mIG algorithm, a rapid evaluation method is designed to reduce the time complexity, and two different iterative processes are selected by a certain probability. In addition, collaborative interactions between cross-factory and inner-factory are considered to further improve the exploitation and exploration of mIG. Finally, the 270 tests showed that the average makespan and RPI values of mIG are 1.93% and 78.35% better than the five comparison algorithms on average, respectively. Therefore, mIG is more suitable to solve the studied DBFSP_SDST. Full article
(This article belongs to the Special Issue Optimization Algorithms: Theory and Applications)
Show Figures

Figure 1

Figure 1
<p>The Gantt chart of the example instance.</p>
Full article ">Figure 2
<p>Rapid evaluation criteria. (<b>a</b>) Calculate the time <math display="inline"><semantics> <mrow> <mi>j</mi> <msub> <mi>d</mi> <mrow> <mo stretchy="false">[</mo> <mi>j</mi> <mo stretchy="false">]</mo> <mo>,</mo> <mi>m</mi> </mrow> </msub> </mrow> </semantics></math>. (<b>b</b>) Calculate the time <math display="inline"><semantics> <mrow> <mi>j</mi> <msub> <mi>e</mi> <mrow> <mo stretchy="false">[</mo> <mi>j</mi> <mo stretchy="false">]</mo> <mo>,</mo> <mi>m</mi> </mrow> </msub> </mrow> </semantics></math>. (<b>c</b>) Insert job <math display="inline"><semantics> <mrow> <msup> <mi>τ</mi> <mrow> <msub> <msup> <mi>j</mi> <mo>′</mo> </msup> <mi>t</mi> </msub> </mrow> </msup> </mrow> </semantics></math> into position 2. (<b>d</b>) Recalculate <math display="inline"><semantics> <mrow> <mi>j</mi> <msub> <mi>d</mi> <mrow> <mo stretchy="false">[</mo> <mi>j</mi> <mo stretchy="false">]</mo> <mo>,</mo> <mi>m</mi> </mrow> </msub> </mrow> </semantics></math> of the job after position 2. (<b>e</b>) Recalculate <math display="inline"><semantics> <mrow> <mi>j</mi> <msub> <mi>e</mi> <mrow> <mo stretchy="false">[</mo> <mi>j</mi> <mo stretchy="false">]</mo> <mo>,</mo> <mi>m</mi> </mrow> </msub> </mrow> </semantics></math> of the job before position 2 and calculate <math display="inline"><semantics> <mrow> <mi>j</mi> <msub> <mi>e</mi> <mrow> <msub> <msup> <mi>j</mi> <mo>′</mo> </msup> <mi>t</mi> </msub> <mo>,</mo> <mi>m</mi> </mrow> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 2 Cont.
<p>Rapid evaluation criteria. (<b>a</b>) Calculate the time <math display="inline"><semantics> <mrow> <mi>j</mi> <msub> <mi>d</mi> <mrow> <mo stretchy="false">[</mo> <mi>j</mi> <mo stretchy="false">]</mo> <mo>,</mo> <mi>m</mi> </mrow> </msub> </mrow> </semantics></math>. (<b>b</b>) Calculate the time <math display="inline"><semantics> <mrow> <mi>j</mi> <msub> <mi>e</mi> <mrow> <mo stretchy="false">[</mo> <mi>j</mi> <mo stretchy="false">]</mo> <mo>,</mo> <mi>m</mi> </mrow> </msub> </mrow> </semantics></math>. (<b>c</b>) Insert job <math display="inline"><semantics> <mrow> <msup> <mi>τ</mi> <mrow> <msub> <msup> <mi>j</mi> <mo>′</mo> </msup> <mi>t</mi> </msub> </mrow> </msup> </mrow> </semantics></math> into position 2. (<b>d</b>) Recalculate <math display="inline"><semantics> <mrow> <mi>j</mi> <msub> <mi>d</mi> <mrow> <mo stretchy="false">[</mo> <mi>j</mi> <mo stretchy="false">]</mo> <mo>,</mo> <mi>m</mi> </mrow> </msub> </mrow> </semantics></math> of the job after position 2. (<b>e</b>) Recalculate <math display="inline"><semantics> <mrow> <mi>j</mi> <msub> <mi>e</mi> <mrow> <mo stretchy="false">[</mo> <mi>j</mi> <mo stretchy="false">]</mo> <mo>,</mo> <mi>m</mi> </mrow> </msub> </mrow> </semantics></math> of the job before position 2 and calculate <math display="inline"><semantics> <mrow> <mi>j</mi> <msub> <mi>e</mi> <mrow> <msub> <msup> <mi>j</mi> <mo>′</mo> </msup> <mi>t</mi> </msub> <mo>,</mo> <mi>m</mi> </mrow> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 3
<p>Flow chart of the mIG algorithm.</p>
Full article ">Figure 4
<p>The trend of the parameter level.</p>
Full article ">Figure 5
<p>Confidence interval for mIG and mIG_NV.</p>
Full article ">Figure 6
<p>The evolutionary curves of compared algorithms. (<b>a</b>) 100_6_10. (<b>b</b>) 400_7_10.</p>
Full article ">Figure 7
<p>Interactions for ES, DABC, IGR, EA, DDE, mIG0, and mIG. (<b>a</b>) Means of all the compared algorithms. (<b>b</b>–<b>d</b>) are interactions of the numbers of factories, jobs, machines, and compared algorithms, respectively.</p>
Full article ">
14 pages, 7277 KiB  
Article
A Deep Learning Method for Facies Recognition from Core Images and Its Application: A Case Study of Mackay River Oil Sands Reservoir
by Haojie Shang, Lihua Cheng, Jixin Huang, Lixin Wang and Yanshu Yin
Energies 2023, 16(1), 465; https://doi.org/10.3390/en16010465 - 1 Jan 2023
Viewed by 1994
Abstract
There is a large amount of drilling core data in the Mackay River oil sands block in Canada, and the accurate identification of facies from the cores is important and necessary for the understanding of the subsurface reservoir. The traditional recognition method of [...] Read more.
There is a large amount of drilling core data in the Mackay River oil sands block in Canada, and the accurate identification of facies from the cores is important and necessary for the understanding of the subsurface reservoir. The traditional recognition method of facies from cores is by human work and is very time consuming. Furthermore, the results are different according to different geologists because of the subjective judgment criterion. An efficient and objective method is important to solve the above problem. In this paper, the deep learning image-recognition algorithm is used to automatically and intelligently recognize the facies type from the core image. Through a series of high-reliability preprocessing operations, such as cropping, segmentation, rotation transformation, and noise removal of the original core image, that have been manually identified, the key feature information in the images is extracted based on the ResNet50 convolutional neural network. On the dataset of about 200 core images from 13 facies, an intelligent identification system of facies from core images is constructed, which realizes automatic facies identification from core images. Comparing this method with traditional convolutional neural networks and support vector machines (SVM), the results show that the recognition accuracy of this model is as high as 91.12%, which is higher than the other two models. It is also shown that for a relatively special dataset, such as core images, it is necessary to rely on their global features in order to classify them, and, with a large similarity between some of the categories, it is extremely difficult to classify them. The selection of a suitable neural network model can have a great impact on the accuracy of recognition results. Then, the recognized facies are input as hard data to construct the three-dimensional facies model, which reveals the complex heterogeneity and distribution of the subsurface reservoir for further exploration and development. Full article
Show Figures

Figure 1

Figure 1
<p>Typical core photograph of the study area.</p>
Full article ">Figure 2
<p>Residuals of ResNet50 [<a href="#B16-energies-16-00465" class="html-bibr">16</a>].</p>
Full article ">Figure 3
<p>ReLU activation function.</p>
Full article ">Figure 4
<p>Categories of lithofacies.</p>
Full article ">Figure 5
<p>Types of lithofacies and corresponding sedimentary microfacies.</p>
Full article ">Figure 6
<p>Flow chart.</p>
Full article ">Figure 7
<p>Rotation dataset.</p>
Full article ">Figure 8
<p>Moving window recognition.</p>
Full article ">Figure 9
<p>Core identification result.</p>
Full article ">Figure 10
<p>The 3D model of the study area.</p>
Full article ">
32 pages, 14202 KiB  
Article
Particle Swarm Optimization and Two-Way Fixed-Effects Analysis of Variance for Efficient Brain Tumor Segmentation
by Naoual Atia, Amir Benzaoui, Sébastien Jacques, Madina Hamiane, Kaouther El Kourd, Ayache Bouakaz and Abdeldjalil Ouahabi
Cancers 2022, 14(18), 4399; https://doi.org/10.3390/cancers14184399 - 10 Sep 2022
Cited by 26 | Viewed by 2835
Abstract
Segmentation of brain tumor images, to refine the detection and understanding of abnormal masses in the brain, is an important research topic in medical imaging. This paper proposes a new segmentation method, consisting of three main steps, to detect brain lesions using magnetic [...] Read more.
Segmentation of brain tumor images, to refine the detection and understanding of abnormal masses in the brain, is an important research topic in medical imaging. This paper proposes a new segmentation method, consisting of three main steps, to detect brain lesions using magnetic resonance imaging (MRI). In the first step, the parts of the image delineating the skull bone are removed, to exclude insignificant data. In the second step, which is the main contribution of this study, the particle swarm optimization (PSO) technique is applied, to detect the block that contains the brain lesions. The fitness function, used to determine the best block among all candidate blocks, is based on a two-way fixed-effects analysis of variance (ANOVA). In the last step of the algorithm, the K-means segmentation method is used in the lesion block, to classify it as a tumor or not. A thorough evaluation of the proposed algorithm was performed, using: (1) a private MRI database provided by the Kouba imaging center—Algiers (KICA); (2) the multimodal brain tumor segmentation challenge (BraTS) 2015 database. Estimates of the selected fitness function were first compared to those based on the sum-of-absolute-differences (SAD) dissimilarity criterion, to demonstrate the efficiency and robustness of the ANOVA. The performance of the optimized brain tumor segmentation algorithm was then compared to the results of several state-of-the-art techniques. The results obtained, by using the Dice coefficient, Jaccard distance, correlation coefficient, and root mean square error (RMSE) measurements, demonstrated the superiority of the proposed optimized segmentation algorithm over equivalent techniques. Full article
(This article belongs to the Section Cancer Causes, Screening and Diagnosis)
Show Figures

Figure 1

Figure 1
<p>(<b>A</b>) MRI of the brain: axial FLAIR section. A thin-walled cyst-like image (arrow) consistent with an ependymal cyst can be seen in the occipital extension of the left lateral ventricle. (<b>B</b>) Brain cross-section (illustration).</p>
Full article ">Figure 2
<p>Example of 3 MRI sequences: T1-Weighted, T2-Weighted, and FLAIR.</p>
Full article ">Figure 3
<p>Comparison between a T1-Weighted MRI sequence without a contrast agent (T1) and the same sequence with a contrast agent (T1c).</p>
Full article ">Figure 4
<p>MRI sequences of brain tumors: FLAIR, T1, T1 contrasted by Gadolinium injection, T2, and Ground Truth superimposed on the FLAIR sequence.</p>
Full article ">Figure 5
<p>Segmentation result (see <a href="#sec4-cancers-14-04399" class="html-sec">Section 4</a>): MRI sequences: T1, T2, T1c, FLAIR, Ground Truth, and segmentation.</p>
Full article ">Figure 6
<p>Segmentation result (see <a href="#sec4-cancers-14-04399" class="html-sec">Section 4</a>): T1c, automatic detection of brain tumors, segmentation, and binarization.</p>
Full article ">Figure 7
<p>Diagram of the proposed approach.</p>
Full article ">Figure 8
<p>Flowchart of the proposed segmentation method.</p>
Full article ">Figure 9
<p>Pre-processing step: (<b>a</b>) original brain image; (<b>b</b>) brain image after pre-processing.</p>
Full article ">Figure 10
<p>ROI identification, using PSO and ANOVA: (<b>a</b>) candidate blocks (in red) after 5 iterations; (<b>b</b>) candidate blocks after 15 iterations; (<b>c</b>) candidate blocks after 35 iterations; (<b>d</b>) candidate blocks after 50 iterations.</p>
Full article ">Figure 11
<p>ROI segmentation using K-means: (<b>a</b>) identified ROI; (<b>b</b>) ROI segmented with K-means.</p>
Full article ">Figure 12
<p>Performance comparison between the proposed brain tumor segmentation and Ground Truth: (<b>a</b>) segmentation using our method; (<b>b</b>) Ground Truth.</p>
Full article ">Figure 13
<p>The efficiency of brain tumor segmentation on the KICA dataset: comparison of ANOVA and SAD-based methods. (<b>a</b>) Original images. (<b>b</b>) Pre-processing. (<b>c</b>) Our method with ANOVA. (<b>d</b>) Our method with SAD.</p>
Full article ">Figure 13 Cont.
<p>The efficiency of brain tumor segmentation on the KICA dataset: comparison of ANOVA and SAD-based methods. (<b>a</b>) Original images. (<b>b</b>) Pre-processing. (<b>c</b>) Our method with ANOVA. (<b>d</b>) Our method with SAD.</p>
Full article ">Figure 13 Cont.
<p>The efficiency of brain tumor segmentation on the KICA dataset: comparison of ANOVA and SAD-based methods. (<b>a</b>) Original images. (<b>b</b>) Pre-processing. (<b>c</b>) Our method with ANOVA. (<b>d</b>) Our method with SAD.</p>
Full article ">Figure 14
<p>The efficiency of brain tumor segmentation on the KICA dataset: comparison between the proposed ANOVA-based method and other well-known methods.</p>
Full article ">Figure 14 Cont.
<p>The efficiency of brain tumor segmentation on the KICA dataset: comparison between the proposed ANOVA-based method and other well-known methods.</p>
Full article ">Figure 14 Cont.
<p>The efficiency of brain tumor segmentation on the KICA dataset: comparison between the proposed ANOVA-based method and other well-known methods.</p>
Full article ">Figure 15
<p>Comparison of segmentation results on the CIKA dataset based on: (<b>a</b>) Dice similarity coefficient; (<b>b</b>) Jaccard Distance; (<b>c</b>) correlation coefficient; (<b>d</b>) RMSE metric.</p>
Full article ">Figure 15 Cont.
<p>Comparison of segmentation results on the CIKA dataset based on: (<b>a</b>) Dice similarity coefficient; (<b>b</b>) Jaccard Distance; (<b>c</b>) correlation coefficient; (<b>d</b>) RMSE metric.</p>
Full article ">Figure 16
<p>The three modalities of tumor regions: complete, core, and enhancing tumors.</p>
Full article ">Figure 17
<p>The efficiency of our proposed brain tumor segmentation method on the BraTS 2015 dataset: (top row) original T2-FLAIR images; (bottom row) segmentation results of complete tumors.</p>
Full article ">
21 pages, 5899 KiB  
Article
A Quantitative Evaluation Method of Anti-Sloughing Drilling Fluid Inhibition for Deep Mudstone
by Kehao Bo, Yan Jin, Yunhu Lu, Hongtao Liu and Jinzhi Zhu
Energies 2022, 15(3), 1226; https://doi.org/10.3390/en15031226 - 8 Feb 2022
Cited by 2 | Viewed by 1963
Abstract
Wellbore instability resulting from deep mudstone hydration severely restricts the development of oil and gas resources from deep reservoir in western China. Accurate evaluation of drilling fluid inhibition properties plays an important role in selecting drilling fluid that can control deep mudstone hydration [...] Read more.
Wellbore instability resulting from deep mudstone hydration severely restricts the development of oil and gas resources from deep reservoir in western China. Accurate evaluation of drilling fluid inhibition properties plays an important role in selecting drilling fluid that can control deep mudstone hydration and then sustain wellbore stability. The previous evaluations are conducted by qualitative analysis and cannot consider the influence of complex hydration conditions of deep mudstone (high temperature, high pressure and flushing action). The study proposes a quantitative method to evaluate drilling fluid’s inhibition property for deep mudstone under natural drilling conditions. In this method, the cohesive strength of mudstone after hydration is adopted as the inhibition index of the tested drilling fluid. An experimental platform containing a newly designed HPHT (High pressure and high temperature) hydration experiment apparatus and mechanics characterization of mudstone after hydration based on scratch test is proposed to obtain the current inhibition index of tested drilling fluid under deep well drilling environments. Based on the mechanical–chemical wellbore stability model considering strength weakening characteristics of deep mudstone after hydration, a cross-correlation between drilling fluid density (collapse pressure) and required inhibition index (cohesive strength) for deep mudstone is provided as the quantitative evaluation criterion. Once the density of tested mud is known, one can confirm whether the inhibition property of tested mud is sufficient. In this study, the JDK mudstone of a K block in western China is selected as the application object of the proposed evaluation method. Firstly, the evaluation chart, which can demonstrate the required inhibition indexes of the tested fluids quantitatively with various densities for JDK mudstone, is constructed. Furthermore, the experimental evaluations of inhibition indexes of drilling fluids taken from two wells in K block are conducted under ambient and deep-well drilling conditions, respectively. In order to show the validity and advantage of the proposed method, a comparison between the laboratory evaluation results and field data is made. Results show that the laboratory evaluation results under deep-well drilling conditions are consistent with the field data. However, the evaluation under ambient conditions overestimates the inhibition property of the tested fluid and brings a risk of wellbore instability. The developed quantitative method can be a new way to evaluate and optimize the inhibition property of drilling fluid for deep mudstone. Full article
Show Figures

Figure 1

Figure 1
<p>Framework of evaluation method of drilling fluid inhibition for deep mudstone.</p>
Full article ">Figure 2
<p>HPHT experimental apparatus for studying rock–fluid interaction (only use hydration experiment section in this study).</p>
Full article ">Figure 3
<p>TerraTek continuous scratch test system.</p>
Full article ">Figure 4
<p>Detailed procedure of evaluation of the drilling fluid inhibition property for deep mudstone.</p>
Full article ">Figure 5
<p>Returned fall-blocks of JDK mudstone in the K block (western China).</p>
Full article ">Figure 6
<p>Photos of two samples of JDK mudstones after hydration. (<b>a</b>) 1<sup>#</sup>—After 0 h, (<b>b</b>) 1<sup>#</sup>—After 4 h, (<b>c</b>) 1<sup>#</sup>—After 24 h, (<b>d</b>) 2<sup>#</sup>—After 0 h, (<b>e</b>) 2<sup>#</sup>—After 4 h, (<b>f</b>) 2<sup>#</sup>—After 24 h.</p>
Full article ">Figure 7
<p>Hydration characteristics of JDK mudstones. (<b>a</b>) Uptake water content, (<b>b</b>) Uniaxial compressive strength, (<b>c</b>) Internal friction angle, (<b>d</b>) Cohesive strength.</p>
Full article ">Figure 8
<p>The weakening equations of mechanical properties of JDK mudstones after hydration. (<b>a</b>) Internal friction angle, (<b>b</b>) Cohesive strength.</p>
Full article ">Figure 9
<p>Wellbore collapse regions of JDK mudstones at different hydration levels with drilling fluid density of 1.80 g/cm<sup>3</sup> (<b>a</b>–<b>f</b>), the hydration level of mudstone continues to gradually increase; graph (<b>a</b>) represents the mudstone without hydration; red areas denote wellbore collapse region.</p>
Full article ">Figure 9 Cont.
<p>Wellbore collapse regions of JDK mudstones at different hydration levels with drilling fluid density of 1.80 g/cm<sup>3</sup> (<b>a</b>–<b>f</b>), the hydration level of mudstone continues to gradually increase; graph (<b>a</b>) represents the mudstone without hydration; red areas denote wellbore collapse region.</p>
Full article ">Figure 10
<p>The cross-correlation chart of drilling fluid density and matching inhibition index for JDK mudstone.</p>
Full article ">Figure 11
<p>JDK mudstone used in inhibition evaluation of drilling fluid in well K 8-13 under deep-well drilling conditions. (<b>a</b>) Before hydration, (<b>b</b>) After hydration.</p>
Full article ">Figure 12
<p>JDK mudstone used in inhibition evaluation of drilling fluid in well K 8-13 under ambient conditions. (<b>a</b>) Before hydration, (<b>b</b>) After hydration.</p>
Full article ">Figure 13
<p>Inhibition evaluation results of drilling fluid in well K 8-13 under different hydration conditions (1<sup>#</sup>, 2<sup>#</sup> and 3<sup>#</sup> are the inhibition evaluation results of drilling fluid under deep-well drilling conditions; 4<sup>#</sup> and 5<sup>#</sup> are the inhibition evaluation results of drilling fluid under ambient conditions).</p>
Full article ">Figure 14
<p>Drilling history of well K 8-13 (the orange area denotes the JDK mudstone formation).</p>
Full article ">Figure 15
<p>JDK mudstone used in inhibition evaluation of drilling fluid in well K 9-3 under deep-well drilling conditions. (<b>a</b>) Before hydration, (<b>b</b>) After hydration.</p>
Full article ">Figure 16
<p>Inhibition evaluation result of drilling fluid in well K 9-3 under deep-well drilling conditions.</p>
Full article ">Figure 17
<p>Drilling history of well K 9-3 (the orange area denotes the JDK mudstone formation).</p>
Full article ">
13 pages, 1116 KiB  
Article
The Impact of Gastrointestinal Symptoms on Patients’ Well-Being: Best–Worst Scaling (BWS) to Prioritize Symptoms of the Gastrointestinal Symptom Score (GIS)
by Axel Christian Mühlbacher and Anika Kaczynski
Int. J. Environ. Res. Public Health 2021, 18(21), 11715; https://doi.org/10.3390/ijerph182111715 - 8 Nov 2021
Cited by 1 | Viewed by 2376
Abstract
Background: The gastrointestinal symptom score (GIS) is used in a standardized form to ascertain dyspeptic symptoms in patients with functional dyspepsia in clinical practice. As a criterion for evaluating the effectiveness of a treatment, the change in the summed total point value is [...] Read more.
Background: The gastrointestinal symptom score (GIS) is used in a standardized form to ascertain dyspeptic symptoms in patients with functional dyspepsia in clinical practice. As a criterion for evaluating the effectiveness of a treatment, the change in the summed total point value is used. The total score ranges from 0 to 40 points, in which a higher score represents a more serious manifestation of the disease. Each symptom is included with equal importance in the overall evaluation. The objective of this study was to test this assumption from a patients’ perspective. Our aim was to measure the priorities of patients for the ten gastrointestinal symptoms by using best–worst scaling. Method: A best–worst scaling (BWS) object scaling (Case 1) was applied. Therefore, the symptoms of the GIS were included in a questionnaire using a fractional factorial design (BIBD—balanced incomplete block design). In each choice set, the patients selected the component that had the most and the least impact on their well-being. The BIB design generated a total of 15 choice sets, which each included four attributes. Results: In this study, 1096 affected patients were asked for their priorities regarding a treatment of functional dyspepsia and motility disorder. Based on the data analysis, the symptoms abdominal cramps (SQRT (B/W): −1.27), vomiting (SQRT (B/W): −1.07) and epigastric pain (SQRT (B/W): −0.76) were most important and thus have the greatest influence on the well-being of patients with functional dyspepsia and motility disorders. In the middle range are the symptoms nausea (SQRT (B/W): −0.69), acid reflux/indigestion (SQRT (B/W): −0.29), sickness (SQRT (B/W): −0.26) and retrosternal discomfort (SQRT (B/W): 0.26), whereas the symptoms causing the least impact are the feeling of fullness (SQRT (B/W): 0.80), early satiety (SQRT (B/W): 1.54) and loss of appetite (SQRT(B/W): 1.95). Discussion: Unlike the underlying assumption of the GIS, the BWS indicated that patients did not weight the 10 symptoms equally. The results of the survey show that the three symptoms of vomiting, abdominal cramps and epigastric pain are weighted considerably higher than symptoms such as early satiety, loss of appetite and the feeling of fullness. The evaluation of the BWS data has illustrated, however, that the restrictive assumption of GIS does not reflect the reality of dyspeptic patients. Conclusions: In conclusion, a preference-based GIS is necessary to make valid information about the real burden of illness and to improve the burden of symptoms in the indication of gastrointestinal conditions. The findings of the BWS demonstrate that the common GIS is not applicable to represent the real burden of disease. The results suggest the potential modification of the established GIS by future research using a stated preference study. Full article
(This article belongs to the Section Health Care Sciences & Services)
Show Figures

Figure 1

Figure 1
<p>Best–worst scores (rescaled) of the 10 gastrointestinal symptoms.</p>
Full article ">Figure 2
<p>Weighting of gastrointestinal symptoms separated for each study sample.</p>
Full article ">Figure A1
<p>Weighting of gastrointestinal symptoms—experts’ vs. patients’ perspectives.</p>
Full article ">
Back to TopTop