esa-sceva/satcom-chunk-collection huggingface dataset:
# Multizone Leak Detection Method for Metal Hose Based on YOLOv5 and OMD-ViBe Algorithm
## 1 Introduction
proposed a ViBe and EfficientNetB0 combination algorithm for leak identification to improve detection accuracy [35]. [PERSON] and [PERSON] proposed a ViBe adaptive threshold calculation method based on temperature field offset to eliminate the noise in the background and a round modeling method and threshold segmentation calculation value of the ViBe algorithm to improve the detection speed [36]. The abovementioned background model still had a poor detection effect on leak bubbles, so the ViBe algorithm was improved to improve leak detection performance. The goal of this work is to provide a solution for metal hose leak rate calculation and leak location based on OMD-ViBe and pressure analysis. Different types and sizes of metal hose leaks affect bubble detection. The framework mentioned can be used for different types and sizes of metal hoses. In order to reduce the interference of the nonleakage area, YOLOv5 is used to extract the metal hose ROI area. In addition, it is proposed that OMD-ViBe uses multiframe average initialization background to eliminate the false detection caused by impurities or bubbles in the first frame of the video and uses the difference idea combined with _OTSU_ and the maximum intraclass variance ratio method to calculate the adaptive threshold to improve the bubble detection effect. The multipoint leakage rate is calculated based on OMD-ViBe combined with pressure data and the foreground point frequency calculation method. The leakage location is realized by using the frequency superposition of the foreground points combined with the central moment method. Finally, the metal hose leak detection method based on YOLOv5 and OMD-ViBe can effectively improve the leak detection effect. The remainder of the paper is organized as follows. In Section 2, the formula of YOLOv5 region correction is given, and the improvement of the OMD-ViBe algorithm, the calculation method of foreground point frequency and the central moment leakage location method are presented. The metal hose leakage detection results are provided in Section 3. Finally, concluding remarks and potential future work are given in Section 4.
###### Abstract  
Inter-satellite links are an important component of the new generation of satellite navigation systems, characterized by low signal-to-noise ratio (SNR), complex electromagnetic interference and the short time slot of each satellite, which brings difficulties to the acquisition stage. The inter-satellite link in both Global Positioning System (GPS) and Beilou Navigation Satellite System (BDS) adopt the long code spread spectrum system. However, long code acquisition is a difficult and time-consuming task due to the long code period. Traditional folding methods such as extended replica folding acquisition search technique (XFAST) and direct average are largely restricted because of code Doppler and additional SNR loss caused by replica folding. The dual folding method (DF-XFAST) and dual-channel method have been proposed to achieve long code acquisition in low SNR and high dynamic situations, respectively, but the former is easily affected by code Doppler and the latter is not fast enough. Considering the environment of inter-satellite links and the problems of existing algorithms, this paper proposes a new long code acquisition algorithm named dual-channel acquisition method based on the extended replica folding algorithm (DC-XFAST). This method employs dual channels for verification. Each channel contains an incoming signal block. Local code samples are folded and zero-padded to the length of the incoming signal block. After a circular FFT operation, the correlation results contain two peaks of the same magnitude and specified relative position. The detection process is eased through finding the two largest values. The verification takes all the full and partial peaks into account. Numerical results reveal that the DC-XFAST method can improve acquisition performance while acquisition speed is guaranteed. The method has a significantly higher acquisition probability than folding methods XFAST and DF-XFAST. Moreover, with the advantage of higher detection probability and lower false alarm probability, it has a lower mean acquisition time than traditional XFAST, DF-XFAST and zero-padding.  
inter-satellite link; mean acquisition time; dual-channel; folding method; long code +
Footnote †: journal: Sensors
# Earthquake Damage Index and Fragility Analysis of Steel Damper for Seismic Isolation Bridge
## 4 Fragility Analysis of Steel Dampers in Bridges Designed for Seismic and Isolation
### Ground Motions Selection  
This study adopts the Peak Ground Acceleration (PGA) as the ground motion intensity index. Based on the geological conditions of the bridges, a total of 170 natural earthquake records were selected from the PEER (Pacific Earthquake Engineering Research Center) ground motion database [25], and an additional 30 artificial waves were generated. The selected earthquakes generally have a magnitude of 6 or higher, an epicentral distance of 10 km or greater, and shear wave velocities in the soil layer at a depth of 30 m ranging from 180 m/s to 360 m/s. Figure 11 shows the distribution of ground motions, including the magnitude, epicenter distance, and PGA distributions.  
Figure 11: Distribution of ground motions. (**a**) Distribution of magnitude and epicentral distance. (**b**) Distribution of PGA.  
Figure 10: The numerical model of the overall bridge.
## 1 Introduction
We characterize the spatial distribution of MEC servers and users by employing stochastic geometry, and we derive the delay distribution via queuing theory uncertainties. 3. Leveraging average task offloading delay, immediate service probability and blocking probability, we evaluate network performance. 4. We elucidate the impacts of network parameters and bias factors on network performance.
# Providing Predictable Quality of Service in a Cloud-Based Web System
###### Abstract
Therefore, the quality of the web service is often evaluated based on the time required to receive the content. Time delays concerning fetching web content are related to the time of sending data via the Internet and the time of servicing HTTP requests by the web services, especially cloud-based web systems. Based on predictability, the web services can be categorized as best-effort, predictable, and guaranteed [11]. Best-effort services provide no control over how the service will satisfy the user requirements. It means that the rest of the system (users and applications) will need to adapt to the service's state and the service will be unpredictable. In most cases, best-effort services do their best to service requests as fast as possible, but they cannot guarantee anything. Guaranteed service is the opposite of best-effort service. Guaranteed service is predictable and reliable. When service is not available, the provider must account for the loss of service. There are also predictable services. They are something between best-effort and guaranteed services. They provide some degree of predictability but do not require the accountability of guaranteed service. The HTTP request distribution method in a two-layer architecture of a cluster-based web system is presented in the article. The method allows predictable QoWS to be provided by keeping the service times within adopted constraints and at the same time processing HTTP requests very efficiently. The method is called Web Cloud Earliest Deadline First (WCEDF). The main element designed to be used in the method is the WCEDF web switch. It allows the incoming requests to be queued by letting the time-consuming requests be serviced first. It additionally distributes requests in a way that keeps selected resources of the cloud idle and ready to service time-consuming requests faster. The presented method is another step towards the development of algorithms and methods of load distribution and sharing in cloud-computing systems. The rest of the article is composed as follows: In Section 2, the related work is presented with a description of the previous works that constitute the basis for a new solution. Section 3 provides a description of the WCEDF method. In Section 4, the testbed and results of experiments and discussion are presented. Section 5 presents conclusions and the directions of future research. Section 6 summarizes the article.
# A Metaheuristic Framework with Experience Reuse for Dynamic Multi-Objective Big Data Optimization
## 4 Usages and Test Cases
### Performance of the Experience Reuse Method
\begin{table}
\begin{tabular}{c c c c c c} \hline \hline
**Problem** & **Indicator** & **A1** & **A2** & **A3** & **A4** \\ \hline BDDF1 & MIGD & \(1.8500\times 10^{-4}\) & \(1.4809\times 10^{-3}\) & \(\textbf{6.4360\times 10^{-5}}\) & \(1.0036\times 10^{-3}\) \\  & MHV & \(4.3401\times 10^{-1}\) & \(4.1502\times 10^{-1}\) & \(4.4289\times 10^{-1}\) & \(\textbf{4.4732\times 10^{-1}}\) \\ BDDF2 & MIGD & \(2.2304\times 10^{-4}\) & \(1.7448\times 10^{-3}\) & \(\textbf{1.0527\times 10^{-4}}\) & \(1.3398\times 10^{-3}\) \\  & MHV & \(6.5972\times 10^{-1}\) & \(6.4354\times 10^{-1}\) & \(6.5491\times 10^{-1}\) & \(\textbf{6.6033\times 10^{-1}}\) \\ BDDF3 & MIGD & \(\textbf{1.8964\times 10^{-4}}\) & \(1.2837\times 10^{-2}\) & \(1.4779\times 10^{-3}\) & \(1.3903\times 10^{-3}\) \\  & MHV & \(4.0194\times 10^{-1}\) & \(2.4583\times 10^{-1}\) & \(3.9074\times 10^{-1}\) & \(\textbf{4.2186\times 10^{-1}}\) \\ BDDF4 & MIGD & \(1.3389\times 10^{-2}\) & \(1.4031\times 10^{-2}\) & \(\textbf{3.6891\times 10^{-3}}\) & \(1.3702\times 10^{-2}\) \\  & MHV & \(8.1468\times 10^{-1}\) & \(7.1039\times 10^{-1}\) & \(\textbf{8.2782\times 10^{-1}}\) & \(8.2764\times 10^{-1}\) \\ BDDF5 & MIGD & \(3.7284\times 10^{-3}\) & \(3.2760\times 10^{-3}\) & \(\textbf{4.7790\times 10^{-4}}\) & \(2.7206\times 10^{-3}\) \\  & MHV & \(7.0020\times 10^{-1}\) & \(6.9393\times 10^{-1}\) & \(7.6172\times 10^{-1}\) & \(\textbf{7.9461\times 10^{-1}}\) \\ BDDF6 & MIGD & \(4.2031\times 10^{-2}\) & \(4.1738\times 10^{-2}\) & \(4.0031\times 10^{-2}\) & \(\textbf{4.1093\times 10^{-3}}\) \\  & MHV & \(5.1172\times 10^{-1}\) & \(4.3911\times 10^{-1}\) & \(5.4137\times 10^{-1}\) & \(\textbf{5.5103\times 10^{-1}}\) \\ BDDF7 & MIGD & \(\textbf{4.6651\times 10^{-4}}\) & \(6.9730\times 10^{-3}\) & \(5.7113\times 10^{-3}\) & \(4.2090\times 10^{-3}\) \\  & MHV & \(\textbf{7.1815\times 10^{-1}}\) & \(6.0376\times 10^{-1}\) & \(6.5238\times 10^{-1}\) & \(6.7601\times 10^{-1}\) \\ BDDF8 & MIGD & \(2.7726\times 10^{-3}\) & \(2.3101\times 10^{-3}\) & \(\textbf{4.6662\times 10^{-4}}\) & \(6.1093\times 10^{-4}\) \\  & MHV & \(6.9368\times 10^{-1}\) & \(6.1332\times 10^{-1}\) & \(7.2841\times 10^{-1}\) & \(\textbf{7.4483\times 10^{-1}}\) \\ BDDF9 & MIGD & \(3.1520\times 10^{-3}\) & \(\textbf{2.9101\times 10^{-4}}\) & \(1.1152\times 10^{-3}\) & \(2.7406\times 10^{-3}\) \\  & MHV & \(7.1287\times 10^{-1}\) & \(6.9002\times 10^{-1}\) & \(7.8224\times 10^{-1}\) & \(\textbf{8.0122\times 10^{-1}}\) \\ \hline \hline \end{tabular}  
* A1: Dynamic NSGA-II. A2: Dynamic NSGA-III. A3: Dynamic MOEA/D-DE. At: Dynamic ABC.  
\end{table} 
Table 3: The MIGD values and MHV values of Dynamic NSGA-II, Dynamic NSGA-III, Dynamic MOEA/D-DE, Dynamic ABC for 30 independent runs on BDDF problems. The best result in each row is bolded. Figure 8: Nearly optimal PFs obtained by Dynamic ABC on BDDF problems. (**a**) BDDF1. (**b**) BDDF2. (**c**) BDDF3. (**d**) BDDF4. (**e**) BDDF5. (**f**) BDDF6. (**g**) BDDF7. (**h**) BDDF8. (**i**) BDDF9.
# Design of Novel Laser Crosslink Systems Using Nanosatellites in Formation Flying: The VISION
## 2 Laser Crosslink Mission
### Orbit Scenarios
#### 2.2.2 Phase II--Drift Recovery and Station-Keeping Phase (DRSKP)  
In the DRSKP, the thrusters were fired towards the desired directions, as determined by the flight dynamics system (FDS) and mission planning system (MPS), until the distance between nanosatellites was reduced to approximately 50 km. While decreasing the distances, commissioning operations for the RF crosslink and laser crosslink were performed to verify the on-orbit availability of the crosslinks and the relative navigation. Finally, station-keeping maneuvers were performed to satisfy the initial relative distance maintenance.
# Phytomicrobiones: A Potential Approach for Sustainable Pesticide Biodegradation
## 2 Pesticides
### Fate of Pesticides  
The destiny of pesticides within the environment is an intricate dance dictated by the interplay of environmental conditions and the unique characteristics of each pesticide. Figure 1 offers a visual representation of the typical trajectory of pesticides in the environment. A staggering majority, nearly 80%, embarks on a downward journey, infiltrating the soil's pores and ultimately contaminating groundwater sources [34]. This process, aptly termed leaching and percolation, is largely underpinned by soil sorption mechanisms [35]. Indeed, the persistence, movement, and accumulation of pesticides within the soil matrix are intrinsically linked to the soil's capacity for retention and its ability to facilitate degradation processes [36]. Within the soil ecosystem, a myriad of factors come into play, exerting their influence on the migration of pesticides. Variables such as temperature, moisture levels, and the physicochemical and biological properties of the soil collectively shape the trajectory of these chemical agents. Yet, it is imperative to note that the application of pesticides, while targeting pests, carries collateral consequences for soil microbes. Pesticides have the potential to disrupt the delicate balance of microbial communities, leading to modifications in microbial diversity [35].  
In the intricate soil environment, the microbial world takes center stage in the degradation of pesticides. These microscopic entities, often regarding pesticides as valuable sources of carbon (C) or nitrogen (N), engage in a biotransformation process that gives rise to diverse metabolites. These metabolites, in turn, are subject to further degradation by other members of the microbial consortium. Yet, the persistent and unchecked usage of pesticides may result in the accumulation of pesticide residues within the soil's organic matter, particularly in the humus layer. These residues, like silent specters, await their chance to be taken up by plants, initiating a journey that leads them into the very heart of the food chain through biomagnification (see Figure 1). The implications of this complex interplay of pesticides within the natural world are far-reaching, underlining the critical need for a nuanced understanding in our pursuit of sustainable pesticide management.  
Figure 1: Fate of pesticide in the environment.
## 4 Conclusions  
After 3 min of non-thermal plasma treatment with SDBD plasma, _A. niger_ isolated from palm date types is inhibited. The SDBD plasma treatment conditions did not significantly change the nutritional and mineral composition of palm date fruits. The dose and strength of the used SDBD plasma did not have the same impact on the chemical components of dates. However, the plasma concentration and power of SDBD were capable of influencing the amounts of active components, such as HMF, phenolic, and antioxidant activity. Plasma from SDBD may be an effective decontamination method, not only for palm date varieties but also for other fruits and vegetables. It is probably acceptable to conclude that the non-thermal treatments did not significantly change the quality of palm date types. In addition, the HFM values, antioxidant activity, and total phenol contents of palm date varieties treated with SDBD plasma were significantly changed, resulting in an improvement in palm date variety quality. The results of the PCA model could show how the variables of palm date varieties that have been treated with SDBD plasma and those that have not been treated relate to each other.  
Conceptualization, K.L. and S.M.A.-Q.; methodology, K.L., S.M.A.-Q., F.A.B.S., S.A.A. and T.A.M.; software, K.M.E.-A., N.A.A.-H. and S.M.A.-Q.; validation, N.A.A.-H., F.A.B.S. and T.A.M.; formal analysis, K.L., F.A.B.S., S.A.A. and T.A.M.; investigation, K.L., F.A.B.S., S.A.A. and T.A.M.; resources, S.M.A.-Q., F.A.B.S. and S.A.A.; data curation, K.L., F.A.B.S., S.A.A. and T.A.M.; writing--original draft preparation, K.L., S.A.A. and N.A.A.-H.; writing--review and editing, K.L., K.M.E.-A. and T.A.M.; visualization, K.L., S.M.A.-Q., N.A, F.A.B.S., S.A.A. and T.A.M.; supervision, N.A.A.-H. and F.A.B.S.; project administration, K.L.; funding acquisition, F.A.B.S. and S.A.A. All authors have read and agreed to the published version of the manuscript.  
This research was funded by the Saudi Arabia Ministry of Environment, Water, and Agriculture grant number [2200011540].  
Not applicable.  
All data generated or analyzed during this study are included in this published article.  
**Acknowledgments:** The authors would like to extend their gratitude to the Saudi Arabia Ministry of Environment, Water, and Agriculture for providing financial, technical, and administrative support to fund this work through the initiative of encouraging the agricultural \"Applied research project in the field of palm and dates no. 2200011540\".  
**Conflicts of Interest:** All the authors declare no conflict of interest for this work. There is no known competing financial interest and personal relationship that could influence this paper's reported work.
# The Complex Relationship between Virulence and Antibiotic Resistance
## 3 Virulence Mechanisms
### Virulence Factors
#### 3.1.4 Host Immune Evasion  
The _Salmonella_ plasmid virulence (_spv_) locus reduced the LD50 of _Salmonella enterica serovar typhimurium_ in zebrafish larvae and inhibited neutrophils and macrophages, allowing bacterial replication to accelerate. Additionally, the _spv_ locus was found to prevent autophagy of _S. typhimurium_ by inhibiting the formation of the autophagosomes, leading to the supposition that the _spv_ locus is involved in suppressing the innate immune response [128]. Alternatively, diversity in the glycosylated structure of siderophores has not only produced functional redundancy and specificity concurrently but has also served to avoid host defenses, such is the case with Lipocalin 2, which can sequester the siderophore, Enterobactin but not is glycosylated derivative Salmonella [126]. Group B _Streptococcus_ produces a phosphodiesterase that limits type I interferon to promote virulence [129; 130]. Finally, a variety of bacterial pathogens have evolved molecular mimicry to hijack and manipulate the host's inhibitory immune signaling as well as the ability to directly interact with host cytokines and other factors [131; 132; 133]. These represent just a small subset of bacterial strategies for immune evasion; bacteria have evolved a plethora of virulence factors that contribute to host immune evasion [134].
## 8 Conclusions  
We develop a three-stage algorithm for balanced partitioning of a graph, with the main objective of minimizing the overall weight of cut edges.  
The first two stages construct an ordering of the vertices based on the neighborhoods in the graph--nearby vertices are expected to be close to each other in the ordering.  
The third stage considers the permissible imbalance and moves the boundaries of parts so as to optimize the cut value. It may also permute vertices that are very close to the part boundaries.  
Though we give a few variants for each stage, it is not necessary to run all the three stages; some can be replaced by a dummy routine. To get the full potential of the algorithm, one had better use the best variants of every stage, however, even using random ordering in the first stage, for instance, produces a nontrivial result. Similarly, only using a natural balanced partitioning based on the hierarchical agglomerative clustering produces decent results. Interestingly, this outperforms the Hilbert cover-based ordering, even for the geographic graphs where the latter technique is feasible.  
For \(k>2\), our algorithm beats METIS and FENNEL, and is more scalable than both of them. For \(k=2\), that is, the minimum bisection problem, while our algorithm is far superior in terms of running time and scalability, the results that we obtain are on par with (or slightly worse than) those of the other two.  
Our algorithm is pretty scalable: for example, it runs smoothly on a portion of the world graph with half a billion vertices and more than a billion edges.  
Furthermore, we study or deploy this solution in various applications at Google.  
* A simple version of our algorithm (using Hilbert curves for the initial ordering, no optimization in stage two and dynamic programming in the third stage) yields a 40% improvement for the Google Maps Driving Directions application: the improvement is both in terms of overall CPU usage as well as the number of multishard queries.
* In another work [47], we show how to use balanced partitioning to optimize the load balancing component of Google Search backend. Deployed in 2015, the said solution decreases cache miss rate by about 0.5% and increases end-to-end throughput by double-digit percentage.
* This algorithm has been effective in scheduling jobs in data centers with the objective of minimizing communication.
* It is also demonstrated in a separate work [48] that experiment design can benefit from a balanced partitioning of users based on their geography. This helps reduce the dependency between various experiment arms.  
**Author Contributions:** Conceptualization, K.A., M.B. and V.M.; Data curation, K.A.; Methodology, V.M.; Software, K.A. and M.B.; Supervision, V.M.; Visualization, K.A. and M.B.; Writing--Original Draft, M.B.; Writing--Review & Editing, K.A., M.B. and V.M.  
**Funding:** This research received no external funding.  
**Acknowledgments:** The authors wish to thank [PERSON] and [PERSON] for fruitful discussions.  
**Conflicts of Interest:** The authors declare no conflict of interest.
# Forklift Tracking: Industry 4.0 Implementation in Large-Scale Warehouses through UWB Sensor Fusion
###### Abstract  
This article addresses the problem of determining the location of pallets carried by forklifts inside a warehouse, which are recognized thanks to an onboard Radio Frequency IDentification (RFID) system at the ultra-high-frequency (UHF) band. By reconstructing the forklift trajectory and orientation, the location of the pallets can be associated with the forklift position at the time of unloading events. The localization task is accomplished by means of an easy-to-deploy combination of onboard sensors, i.e., an inertial measurement unit (IMU) and an optical flow sensor (OPS), with a commercial ultra-wideband (UWB) system through an Unscented Kalman Filter (UKF) algorithm, which estimates the forklift pose over time. The proposed sensor fusion approach contributes to the localization error mitigation by preventing drifts in the trajectory reconstruction. The designed methods was at first evaluated by means of a simulation framework and then through an experimental analysis conducted in a large warehouse with a size of about 4000 m\({}^{2}\).  
Cyber-Physical System; Industry 4.0; UWB; sensor fusion; tracking; indoor; localization +
Footnote †: journal: Applied Sciences  
Article