Effects of experimental parameters on elemental analysis of coal by laser-induced breakdown spectroscopy

The purpose of this work is to improve the precision of the elemental analysis of coal using laser-induced breakdown spectroscopy (LIBS). The LIBS technique has the ability to allow simultaneous elemental analysis and on-line determination, so it could be used in the elemental analysis of coal. Organic components such as C, H, O, N and inorganic components such as Ca, Mg, Fe, Al, Si, Ti, Na, and K of coal have been identified. The precision of the LIBS technique depends strongly on the experimental conditions, and the choice of experimental parameters should be aimed at optimizing the repeatability of the measurements. The dependences of the relative standard deviation (RSD) of the LIBS measurements on the experimental parameters including the sample preparation parameters, lens-to-sample distance, sample operation mode, and ambient gas have been investigated. The results indicate that the precision of LIBS measurements for the coal sample can be improved by using the optimum experimental parameters

The maximum number of cliques in graphs with given fractional matching number and minimum degree

Recently, Ma, Qian and Shi determined the maximum size of an $n$-vertex graph with given fractional matching number $s$ and maximum degree at most $d$. Motivated by this result, we determine the maximum number of $\ell$-cliques in a graph with given fractional matching number and minimum degree, which generalizes Shi and Ma's result about the maximum size of a graph with given fractional matching number and minimum degree at least one. We also determine the maximum number of complete bipartite graphs in a graph with prescribed fractional matching number and minimum degree

Novel endoscopic multi-firing-clip applicator for endoscopic closure of large colonic perforations

Background: Existing endoclip closure devices have difficulty in closing large colonic perforation. We developed a novel endoscopic multi-firing-clip applicator (EMFCA) system to address these limitations, and report on its initial evaluation.Material and Methods: The functionality and efficacy of the prototype EMFCA equipped with re-openable clamp and preloaded with four clips were assessed using standardized 1.5 cm incisions created in ex-vivo porcine colonic segments. Endoscopic closure of the lacerations with two, three and four clips (n = five for each group) was followed by measurement of the leakage pressure of the three groups. Finite element analysis (FEA) was performed to validate the clip behavior and reliability during deployment.Results: All 15 perforations were sealed without leakage until fully distended. The leakage pressures of colonic lacerations sealed with two, three, and four clips were 26.1 ± 2.8 mmHg, 37.3 ± 7.3 mmHg and 42.3 ± 7.4 mmHg, respectively. The mean operation time to deploy one clip was 25.4 ± 5.2 seconds. On FEA, the deformation of the shape of the clip matched that of the intended design, with each clip sustaining a maximum stress of 648.5 MPa without any material failure during deployment.Conclusions: These initial results confirm the efficacy of the EMFCA prototype system for endoscopic closure of colonic perforations.</p

Bound vertices of longest paths between two vertices in cubic graphs

Thomassen's chord conjecture from 1976 states that every longest cycle in a $3$-connected graph has a chord. This is one of the most important unsolved problems in graph theory. Let $H$ be a subgraph of a graph $G$. A vertex $v$ of $H$ is said to be $H$-bound if all the neighbors of $v$ in $G$ lie in $H$. Recently, Zhan has made the more general conjecture that in a $k$-connected graph, every longest path $P$ between two vertices contains at least $k-1$ internal $P$-bound vertices. In this paper, we prove that Zhan's conjecture holds for $2$-connected cubic graphs. This conclusion generalizes a result of Thomassen [{\em J. Combin. Theory Ser. B} \textbf{129} (2018) 148--157]. Furthermore, we prove that if the two vertices are adjacent, Zhan's conjecture holds for $3$-connected cubic graphs, from which we deduce that every longest cycle in a $3$-connected cubic graph has at least two chords. This strengthens a result of Thomassen [{\em J. Combin. Theory Ser. B} \textbf{71} (1997) 211--214]

SeFi-CD: A Semantic First Change Detection Paradigm That Can Detect Any Change You Want

The existing change detection(CD) methods can be summarized as the visual-first change detection (ViFi-CD) paradigm, which first extracts change features from visual differences and then assigns them specific semantic information. However, CD is essentially dependent on change regions of interest (CRoIs), meaning that the CD results are directly determined by the semantics changes of interest, making its primary image factor semantic of interest rather than visual. The ViFi-CD paradigm can only assign specific semantics of interest to specific change features extracted from visual differences, leading to the inevitable omission of potential CRoIs and the inability to adapt to different CRoI CD tasks. In other words, changes in other CRoIs cannot be detected by the ViFi-CD method without retraining the model or significantly modifying the method. This paper introduces a new CD paradigm, the semantic-first CD (SeFi-CD) paradigm. The core idea of SeFi-CD is to first perceive the dynamic semantics of interest and then visually search for change features related to the semantics. Based on the SeFi-CD paradigm, we designed Anything You Want Change Detection (AUWCD). Experiments on public datasets demonstrate that the AUWCD outperforms the current state-of-the-art CD methods, achieving an average F1 score 5.01\% higher than that of these advanced supervised baselines on the SECOND dataset, with a maximum increase of 13.17\%. The proposed SeFi-CD offers a novel CD perspective and approach

From Fourier to Neural ODEs: Flow Matching for Modeling Complex Systems

Modeling complex systems using standard neural ordinary differential equations (NODEs) often faces some essential challenges, including high computational costs and susceptibility to local optima. To address these challenges, we propose a simulation-free framework, called Fourier NODEs (FNODEs), that effectively trains NODEs by directly matching the target vector field based on Fourier analysis. Specifically, we employ the Fourier analysis to estimate temporal and potential high-order spatial gradients from noisy observational data. We then incorporate the estimated spatial gradients as additional inputs to a neural network. Furthermore, we utilize the estimated temporal gradient as the optimization objective for the output of the neural network. Later, the trained neural network generates more data points through an ODE solver without participating in the computational graph, facilitating more accurate estimations of gradients based on Fourier analysis. These two steps form a positive feedback loop, enabling accurate dynamics modeling in our framework. Consequently, our approach outperforms state-of-the-art methods in terms of training time, dynamics prediction, and robustness. Finally, we demonstrate the superior performance of our framework using a number of representative complex systems