esa-sceva/satcom-chunk-collection huggingface dataset:
# An Improved Small Target Segmentation Model Based on Mask Dino
## 3 Materials and Methods
### Improvement of Swin Transformer
#### 3.1.1 Scaled Cosine Attention Method  
In the task of small object segmentation, when extracting deeper features, the background information of small object segmentation targets is complex, and attention calculations are often dominated by a few pixels. Therefore, this paper introduces the scaled cosine attention method to improve the network's attention algorithm. The scaled cosine attention method is a variant based on the self-attention mechanism that uses cosine similarity to calculate attention weights instead of the traditional dot product method. It performs better than the traditional dot product method when dealing with data that has significant directional or angular differences.  
The implementation steps of the scaled cosine attention method are as follows:  
1. Similarity calculation: Standardize the input features to make the length of each feature vector equal to 1. Then, calculate the cosine similarity between the standardized feature vectors. In this paper's self-attention calculation, an additional parameter bias term is introduced to encode geometric relationships. The formula is as shown in Equation (1) below:  
Figure 1: The structure diagram of the improved Mask Dino.  
\[\text{Attention}(\text{Q},\text{K},\text{V})=\text{SoftMax}\Big{(}\text{QK}^{\text{T}} /\sqrt{\text{d}}+\text{B}\Big{)}\text{V} \tag{1}\]
2. Scaling factor: A scaling factor is introduced to adjust the distribution of attention weights [27], helping the model maintain stability during training. Compared to the dot(Q,K) operation used in Mask Dino for calculating attention, this paper replaces it with cosine (Q,K)/\(\tau\) in FFMask Dino by using the scaled cosine function to calculate the logarithmic attention for pixel pairs i and j. The formula is as shown in Equation (2) below: \[\text{Sim }(q_{i},k_{j})=\cos(q_{i},k_{j})/\tau+B_{ij}\] (2) where \(B_{ij}\) is the relative positional deviation between pixel i and j, and \(\tau\) is a learnable scalar that is not shared between network heads and layers, set to be greater than 0.01. Since the cosine function is naturally normalized, it results in more accurate attention values.
3. Applying attention weights: Use the obtained attention weights to weigh the input features, generating weighted feature representations that are more focused on important parts of the input.
## Materials and Methods
### Expression and Purification of mNKLs  
After pMD19-T cloning and direct sequencing, the recombinant plasmids were digested with restriction enzymes _BamHI_ and _Hind_III. The digested mNKL fragments were inserted into pET-32a(+), which fuses the construct in tandem to the sequence of thioredoxin, generating pET32-mNKL 1, pET32-Mnkl 2, pET32-mNKL 3. The confirmed recombinant expression constructs were first transformed into _E. coli_ BL21 (DE3) (Tiangen, Berjing, China) cells but the expression was unsuccessful in all cases. _E. coli_ Rosetta (DE3) (Tiangen, Berjing, China) cells can enhance the expression of eukaryotic proteins which contains _E. coli_ rare codons. Rare codon was analyzedby Rare Codon Calculator (RaCC), a rare Arg codon (CGA) was observed on the 47 th codon of NK-lysis 1 and NK-lysis 2, a rare Arg codon (AGA) was observed on the 38 th codon of NK-lysisn 3 (data not shown). The confirmed recombinant expression constructs were transformed into _E. coli_ Rosetta (DE3) cells. After optimization of expression condition, higher level expression was induced by isopropyl-\(\beta\)-d-thiogalactopyranoside (IPTG) to express protein at a final concentration of 0.1 mM for 4 h at 37 \({}^{\circ}\)C and harvested by centrifugation at 8000\(\times\)_g_, 4 \({}^{\circ}\)C, for 10 min. After centrifugation, the pellets were resuspended in Ni-Native-0 buffer (50 mM NaH\({}_{2}\)PO\({}_{4}\), 300 mM NaCl, pH 8.0). The resuspended bacterial cells were lysed by sonication and the extracted supernatant that may contain soluble proteins were clarified by centrifugation at 12,000 rpm at 4 \({}^{\circ}\)C for 20 min, then the supernatants with Ni-Native-0 buffer were added into the equilibrated Ni-NTA-Sefinose column (Sangon Biotech, Shanghai, China). Ni-Native-250 buffer (50 mM NaH\({}_{2}\)PO\({}_{4}\), 300 mM NaCl, 250 mM Imidazole, pH 8.0) was used to wash the resin absorbed Histidine-tagged fusion protein. The extracted proteins were analyzed by Tricine-SDS (Sodium Dodecyl Sulfonate)-PAGE (Sangon Biotech, Shanghai, China), stained with Coomassieie Brilliant Blue R-250 and imaged by a Molecular Imager Gel Doc XR+ imaging system (Bio-Rad Laboratories, Hercules, CA, USA). The purified products were concentrated then visualized by Tricine-SDS-PAGE (Sangon Biotech, Shanghai, China). Final concentrations of purified mNKLs were measured by the micro-BCA protein assay reagent according to the manufacturer's instructions (Sangon Biotech, Shanghai, China).
## 5 Conclusions and Future Work  
Aiming at efficient mission scheduling for earth observation distributed satellite systems, this paper addresses the problem by learning from game theory. We firstly propose DMSA which views each satellite as a rational player that focuses on maximizing its payoff through cooperation with neighbors, and we adopt the idea of Nash Equilibrium to guarantee convergence to a near global optimal scheduling plan. To achieve static and dynamic scheduling circumstances, we propose APSOA and ATSA, respectively, and set experimental cases to evaluate their effectiveness. The simulation results show that, in static scheduling, our method can effectively overcome the shortcomings of centralized methods in large-scale mission scheduling scenarios, such as a sharp increase in scheduling time and slow convergence. The distributed mission scheduling method can flexibly deal with different scales of problem scenarios. The algorithm performance will not decrease significantly with the increase in the problem scale and can stably and efficiently obtain the near global optimal solution whose performance is slightly lower than that of the centralized scheduling. In dynamic scheduling, high priority targets will take precedence in execution, and most of the emergency targets will be dynamically scheduled in a relatively short time without major changes to the initial plan. To conclude, the proposed method yields a high scheduling revenue and low scheduling cost and provides a way of solving the DEOS scheduling problem with scalability, adaptability, efficiency, and effectiveness. It has potential to be further applied to more complex scenarios.  
In future work, we will introduce new constraints and update our optimization strategy to make the scheduling model more comprehensive and robust and study the emergency demand analysis mechanism to transform user needs with precision and efficiency. Moreover, we will explore the distributed collaborative scheduling mechanism with restricted communication environments to meet the demands of more complex satellite scheduling problems in the real world.  
[PERSON] is the director of the corresponding contents. Conceptualization, L.L. and Z.D.; methodology, L.L. and H.S.; data processing, D.Y. and H.S.; validation, H.S.; review and editing, D.Y. All authors have read and agreed to the published version of the manuscript.  
This research received no external funding.  
Not applicable.  
The data that support the findings of this study are available from the corresponding author upon reasonable request.  
The authors would like to thank the Qian Xuesen Laboratory, CAST, and Changchun Institute of Optics, Fine Mechanics, and Physics (CIOMP), Chinese Academy of Sciences for providing the technical guidance. Comments from the anonymous reviewers and the editor are also gratefully appreciated.  
The authors declare no conflict of interest.
# Fracturing Fluids and Their Application in the Republic of Croatia
## 9 Conclusions  
Based on an extensive review of the literature and analysis of the selected field case studies, it is possible to conclude the following:  
* Water-based fracturing fluids are the most commonly used fracturing fluids, can be designed for different types of reservoir rocks and applied in a wide range of temperatures.
* The application of acid-based fracturing fluid fracturing is confined to carbonate reservoirs and is never used to stimulate sandstone, shale, or coal seam reservoirs.
* Oil-based, alcohol-based, emulsion-based and energized fracturing fluids are used for low permeability reservoirs, low pressure formations, water-sensitive formations (shale reservoirs, reservoirs with high clay content).
* Newly developed synthetic fracturing fluids demonstrate stability up to 230 \({}^{\circ}\)C, better suspension ability than guar-based fluids, extremely efficient crosslinking, good shear stability, acceptable fluid loss, good cleanup and low formation damage.
* Proppant crosslinked water-based fluids and acid fracturing are the most commonly used fracturing fluids in the HF of naturally fractured reservoirs.
* The proppant fracturing treatment applied in the considered wells resulted in an increase in total gas production by 43%, and condensate production by 106% without a significant increase in water production except in the W-4 well, which cannot be predicted since it was an exploration well.
* The achieved increase in the wellhead pressure (from 4.1% to 100%) will allow a longer well life production and more profitable reserves.
* All fractured formations achieved acceptable FCD. Especially the open hole well design resulted in significant FCD, therefore a new HF well candidate should be considered as an open hole including the appropriate formation parameters.  
**Author Contributions:** N.G.-M.: conceptualization, creation of the idea for the paper, writing, reviewing, and editing of the whole manuscript, visualization; V.B.: preparation of the data presented in case studies and writing the discussion and conclusion section; M.T.: provision of company data, writing the text related to materials and methods, prepared tables and figures; P.M.: preparation of the comprehensive literature overview, writing the text related to fracturing fluids, prepared tables and figures. All authors have read and agreed to the published version of the manuscript.  
**Funding:** This research was funded by the institutional project Drilling technology through fractured reservoirs, 311980013 IZP - FRED, Faculty of Mining, Geology and Petroleum Engineering, University of Zagreb, Croatia.  
**Institutional Review Board Statement:** Not applicable.  
**Informed Consent Statement:** Not applicable.  
**Data Availability Statement:** Data available in a publicly accessible repository and data obtained with the permission of INA--Industrija nafte d.d.  
**Acknowledgments:** The authors thank INA-Industrija nafte d.d on the provided case study data of hydraulic fracturing in Croatia.  
**Conflicts of Interest:** The authors declare no conflict of interest.
###### Abstract  
This study explores the use of edge computing technologies to enhance the quality control processes in the dairy industry. Traditional milk quality control methods can be time-consuming and sometimes inadequate, whereas this new approach offers real-time data processing and rapid decision-making capabilities. The objective of the study is to assess the effectiveness of evaluating various spectral characteristics of milk in predicting critical parameters such as protein and fat content. In this research, a multi-channel sensor capable of collecting spectral data at various wavelengths was utilized. The collected data were processed using advanced machine learning models, where XGBoost and other regression models were assessed for their accuracy in predicting protein and fat content. The findings demonstrate the suitability of this technology for quality control in the dairy industry. The results reveal that edge computing-based systems can determine milk quality more quickly and accurately. This technology holds significant potential for overcoming the challenges faced in milk quality control, particularly in developing countries. This study provides valuable insights into how the use of edge computing can enhance operational efficiency and ensure product quality in the dairy industry. This research represents an important step towards developing more effective quality control mechanisms in the dairy industry and aims to establish a robust foundation for future studies. Recommendations focus on the adaptation of this technology to other food safety applications and its diversification for widespread industrial use.  
edge computing; milk quality control; spectral analysis; machine learning applications
# Intelligent Reflective Surfaces for Wireless Networks:
### Notations  
The following notation is employed: \(a\) is a scalar, \(\mathbf{a}\) is a vector, and \(\mathbf{A}\) stands for a matrix. Transpose and conjugate transpose of \(\mathbf{A}\) are represented by \(\mathbf{A}^{T}\) and \(\mathbf{A}^{H}\), respectively. \(\mathcal{A}\) denotes a set. Finally, a statistical expectation is denoted by \(\mathbb{E}[\cdot]\).
# Constant Transmission Efficiency Dimming Control Scheme for VLC Systems
## 1 Introduction
In this paper, we propose a dimming control scheme based on extensional constant weight codeword sets (ECWCS) to realize dimming control with constant transmission efficiency. The simulation results show that when the transmission efficiency and dimming factor are both the same, the error performance of the proposed scheme is better than that of the block coding scheme. We can also conclude that the proposed scheme has a wider dimming range than the block coding scheme. The ECWCS scheme can provide constant transmission efficiency, a wider dimming range, and a lower division value of the dimming factor. Therefore, the ECWCS scheme is a better choice for the indoor scene with variable brightness, such as office, conference room, classroom, and movie theater. The rest of this paper can be settled as follows: Section 2 proposes the system model of the proposed ECWCS scheme. In Section 3, the motivation, codeword construction, and the encoding/decoding procedure of the proposed scheme are given. Section 4 shows the simulation results of the proposed scheme and the contrast scheme. The conclusion of the whole paper is shown in Section 6.
## 6 Conclusions and Future Research Direction  
The _dynamic_ and _continuous_ berth allocation problem is a seaside operational problem routinely faced by container terminal planners. As this problem can considerably affect the productivity of a container terminal, a better solution for this problem is needed. In this research, we have proposed a two-stage approach for dealing with this problem. In the first stage, the First Come First Served rule (FCFS), Shuffled Frog-Leaping Algorithm (SFLA), and Improved Shuffled Frog-Leaping Algorithm (ISFLA) were each employed in order to generate alternative ship placement sequences that could serve as inputs for the second stage. In the second stage, a specific heuristic was used to assign berthing positions and resolve overlaps of ships in order to develop a feasible solution. The experimental results showed that the Improved Shuffled Frog-Leaping Algorithm outperformed the other two methods in terms of solution quality. The contributions of this research are highlighted below:  
1. A novel Shuffled Frog-Leaping Algorithm-based approach (i.e., the ISFLA) was developed to deal with the _dynamic_ and _continuous_ berth allocation problem. To our best knowledge, this kind of approach has never been used for this purpose in a container terminal.
2. In addition to the Improved Shuffled Frog-Leaping Algorithm, a heuristic was developed, in the second stage of a two-stage procedure, for placing ships and resolving overlaps of ships for the development of a feasible solution.
3. The Java programing language was used to implement the two-stage procedure, as it facilitates the generation of BAP solutions for practical use. Our small-sized experiments showed that the proposed approach was capable of finding optimal/near-optimal solutions in terms of the objective function defined in this research. In addition, our experiments demonstrated the feasibility of the ISFLA with respect to computational time for solving a large-sized problem of up to 60 ships.  
In this research, we achieved the first step in dealing with the _dynamic_ and _continuous_ berth allocation problem (DCBAP) by using an Improved Shuffled Frog-Leaping Algorithm (ISFLA). The next step could consist of applying the Improved Shuffled Frog-Leaping Algorithm to deal with the dynamic and continuous berth allocation problem and quay crane assignment problem (QCAP) simultaneously. Using ISFLA to deal with the quay crane scheduling problem (QCSP) is another research direction. In addition, a comparison between the Improved Shuffled Frog-Leaping Algorithm and other approaches proposed in past research (such as the [1; 34]) could further be conducted. In addition, improving the heuristic used in the second stage of the two-stage procedure is another direction of research.  
[PERSON] guided the research direction, developed the algorithm and found the solutions; [PERSON] summarized and analyzed the data, revised and edited this paper. All authors have contributed to this research.  
This research was supported by the Ministry of Science and Technology of Taiwan under the grant MOST 107-2410-H-992-037.  
The authors declare no conflict of interest.
# Rain Streak Removal for Single Images Using Conditional Generative Adversarial Networks
## 2 Related Work
### Video-based Methods  
With the availability of inter-frame information, video-based image de-raining is relatively more effective and easier compared to single image de-raining. Most research studies [1; 23; 24] have focused on detecting potential rain streaks using their physical characteristics and removing them using image restoration algorithms. In [25], the authors divided rain streaks into dense and sparse groups and removed the streaks using a matrix decomposition algorithm. Other methods have focused on de-raining in the Fourier domain [1] using Gaussian mixture models [23], matrix completions [24], and low-rank approximations [3].
# FPGA Applied to Latency Reduction for the Tactile Internet
## 7 Results
Differently from previous works (Table 4), in [35], the authors present unique hardware for calculating forward and inverse kinematics together. In the proposed model, the 32-bit fixed-point representation was used. The total time to perform the calculation is 2000 ns. The time obtained was calculated taking into account the entire process duration; however, separate times for each module were not specified. Given this scenario, by adding the \(t_{\mathrm{s}}\) FK module time that calculates forward kinematics with the IK module, the total time resulting from both implementations reaches 265 ns, according to Table 4. Hence, the hardware presented in the work here developed achieved a 7.54\(\times\) speedup over the model presented in [35]. Differently from previous works (Table 4), in [35], the authors present unique hardware for calculating forward and inverse kinematics together. The hardware computes all calculations in parallel. The computation of forward and inverse kinematics share the same processing time. An ARM processor was used to make the communication part between the modules, and the FPGA is used to calculate the kinematics model. The CORDIC module was used to perform trigonometric calculations. In the proposed model, the 32-bit fixed-point representation was used. The total time to perform the calculation is 2000 ns. The time obtained was calculated taking into account the entire process duration; however, separate times for each module were not specified. Given this scenario, by adding the \(t_{s}\) FK module time that calculates forward kinematics with the IK module, the total time resulting from both implementations reaches 265 ns, according to Table 4. Hence, the hardware presented in the work here developed achieved a 7.54\(\times\) speedup over the model presented in [35]. It can be seen from Table 4, that none of the works from the state-of-the-art presented the hardware implementation of all four robotics algorithms that were presented here. It is also noted that just two works used the floating-point numerical representation. The floating-point implementation of robotics algorithms proposed by this work showed significant gains when compared to the works presented in the literature as shown in Table 4. The different amounts of degrees of freedom (DoF) used in the devices can somehow influence in values of sample rate and throughput. Another factor that can also influence these values is in relation to the type of FPGA that is used to perform the synthesis. Due to the fact that the implementation of this work was designed in a parallel architecture, the increase in the amount of DoF does not necessarily reflect in a significant increase in sample rate.
## 2 Materials and Methods
### Other Detection Methods for Performance Comparison
#### 2.3.1 DBSCAN Detector  
State-of-the-art algorithms traditionally rely on spatial temporal clustering to identify related events as targets [40; 41]. To group events within the 3D space, one useful technique is proximity-based grouping. To implement proximity-based grouping, the newest event is grouped with its nearest neighbor if the spacing between the groups is below a chosen threshold. Only groups surpassing a chosen size are reported as groups. Density-based spatial clustering of applications with noise (DBSCAN) mimics this clustering behavior by growing clusters with a series of core points above a threshold of close neighbors. Border points, on the edge of a cluster, only become core points once they reach that threshold. The resulting density-based clusters can take on non-uniform shapes and have been proven to cluster sparse event-data effectively [42; 43]. Issues with DBSCAN arise when there is not enough separation in the data from different sources and its processing time scales at the worst case as an O(n\({}^{2}\)) algorithm [43]. Detection results for the DBSCAN method will be determined by both thresholding the number of clustered events in pixels so false-alarm ratios can be chosen as well as transforming the clustered events to a binary detection map.