esa-sceva/satcom-chunk-collection huggingface dataset:
# A Novel GPU-Based Acceleration Algorithm for a Longwave Radiative Transfer Model
## 3 Model Description and GPU Overview
### GPU and CUDA Fortran  
There are an array of streaming multiprocessors (SMs) inside a GPU. Several streaming processors inside each SM share the control logic and instruction cache. CUDA, a general purpose parallel computing architecture, fosters a software environment to make full use of many cores of GPUs in a massively parallel fashion. Functions or subroutines are defined as \"kernels\" by CUDA, and then they are executed on the GPU. Before running on the GPU, these kernels need to be invoked by the CPU. In the three-level hierarchy of CUDA, each kernel has a grid that is at the highest level. Each grid consists of thread blocks. Inside each thread block, data is efficiently shared by a group of threads through a fast shared memory [34]. CUDA supports many high-level languages, such as C/C++ and Fortran. NVIDIA and PGJ jointly developed CUDA Fortran [28]. CUDA Fortran extends Fortran in memory management statements, declaration statements, CUDA runtime APIs, and kernel execution syntaxes [35].  
```
subroutine\(rrtng\_lw\)(parameters) //ncol is the number of horizontal columns
1.do iplon=1, ncol
2. call\(inatm\)(parameters)
3. call\(cldprmc\)(parameters)
4. call\(setcoef\)(parameters)
5. call\(taumol\)(parameters)
6. if aerosol is active then //combine gaseous and aerosol optical depths
7. \(\text{taut}(k,ig)=\text{taug}(k,ig)+\text{taua}(k,\text{ngb}(ig))\)
8. else
9. \(\text{taut}(k,ig)=\text{taug}(k,ig)\)
10. end if
11. call\(rtrmmc\)(parameters)
12. Transfer fluxes and heating rate to output arrays
13.end do end subroutine
```  
**Algorithm 1**Computing procedure of original \(rrtng\_lw\).
# A Self-Recovery Fragile Image Watermarking with Variable Watermark Capacity
## 1 Introduction
However, 4 LSBs might be changed by the watermark, which causes great damage to the watermarked images. To improve the tamper detection precision and the quality of restored images, a new self-recovery fragile image watermarking with variable watermark capacity is presented in this paper. In this method, the host image is firstly split into \(2\times 2\) blocks. For each block, the trace of singular value matrix after singular value decomposition (SVD) is served as the authentication watermark. The left and right singular vectors are used to classify the image blocks into smooth blocks and texture blocks. For different blocks, different length recovery watermark is produced. That means the watermark capacity is alterable. Before watermark embedding, the watermark is encrypted by the binary pseudo-random sequences, which is adopted to ensure the security of the proposed method. Compared with other recoverable fragile watermarking schemes, the strengths of the proposed method are as follows: (i) Based on the analysis of SVD characteristics, a block classification method is designed, which is used to divide the image blocks into smooth blocks and texture blocks; (ii) a variable recovery watermark generation strategy is developed to produce different recovery watermarking bits for different blocks; (iii) a three-level detection strategy is applied to improve the tamper localization accuracy. The experimental results prove that the presented method achieves good tamper detection results, and the recovered image has better image quality in subjective and objective way. The remainder of this paper is organized as follows. In Section 2, the SVD transform and its characteristics are analyzed. Based on the characteristics, a new block classification method is introduced. In Section 3, the proposed watermarking method is developed in detail. The experimental results and comparison analysis are presented in Section 4. Section 5 summarizes this paper and gives the possible future task.
# Dark Type Dynamical Systems: The Integrability Algorithm and Applications +
## 2 Nonlinear Dynamical Systems and the Lax Type Representation
### Dark Type Dynamical Systems: Introductory Setting  
We begin with studying integrability properties of a certain class of nonlinear dynamical systems of the form  
\[v_{t}=K[v,u], \tag{55}\]on a suitably chosen [17] smooth \(2\pi\)-periodic functional manifold \(M_{v}\subset C(\mathbb{R}/\{2\pi\mathbb{Z}\};\mathbb{R}^{m(v)})\), \(m(v)\in\mathbb{N}\), where \(t\in\mathbb{R}\) is the evolution parameter and \(K:M_{v}\to T(M_{v})\) is a smooth vector field on \(M_{v}\), with values in its tangent space \(T(M_{v})\), represented by means of polynomial functions on the related jet-space \(J\big{(}\mathbb{R}/\{2\pi\mathbb{Z}\};\mathbb{R}^{m(v)\times m(u)}\big{)}\) of a finite order, depending _parametrically_ on a functional variable \(u\in M_{u}\subset C(\mathbb{R}/\{2\pi\mathbb{Z}\};\mathbb{R}^{m(u)})\), \(m(u)\in\mathbb{N}\). Moreover, we will assume that the vector field on \(M_{v}\) satisfies the following additional functional constraint: the flow on \(M_{v}\), generated by the vector field (55), possesses internal hidden symmetry properties, for instance an infinite hierarchy of suitably ordered conservation laws (they may be almost all nontrivial, or except finite, trivial), satisfying the related recursion relationships. The latter gives rise to some functional-analytic constraints on the parametric variable \(u\in M_{u}\), which in general can be represented as the following supplementing (55) dynamical system:  
\[u_{t} =F[v,u,p], \tag{56}\] \[p_{t} =P[v,u,p]\]  
on an extended functional manifold \(M_{u}\times M_{p}\subset C(\mathbb{R}/\{2\pi\mathbb{Z}\};\mathbb{R}^{m(u)\times m (p)})\), where the additional vector fields \(F:M_{u}\to T(M_{u})\) and \(P:M_{p}\to T(M_{p})\) are smooth and, by definition, finitely-component, that is the functional manifold \(M_{p}\subset C(\mathbb{R}/\{2\pi\mathbb{Z}\};\mathbb{R}^{m(p)})\), where the dimension \(p\in\mathbb{Z}_{+}\) has to be finite. The resulting combined dynamical system  
\[\left.\begin{array}{l}v_{t}=K[v,u]\\ u_{t}=F[v,u,p]\\ p_{t}=P[v,u,p]\end{array}\right\}:=Q[v,u,p] \tag{57}\]  
is closed and determines a completely integrable Lax type linearized flow on the joint functional manifold \(M_{v}\times M_{u}\times M_{p}\). The latter makes it possible to formulate for the dynamical system (55) the following definition.  
Definition 1: A dynamical system (55), allowing the finitely-component and completely integrable Lax-type linearized extension (57), is called the dark type system.  
This definition proves to be constructive enough and allows by means of the gradient-holonomic approach [14; 15; 16; 27] to classify many linear and nonlinear dynamical systems of dark type, presenting, in addition, a great interest for applications in modern physics, mechanics, hydrodynamics and biology sciences. To be more specific, we will turn to the analysis of some interesting examples of dark type dynamical systems on functional manifolds.
## 2 Materials and Methods
### Selection Process  
The PRISMA flow process was carried out to select the relevant studies. The PRISMA process is presented by [PERSON] and includes four phases [32]. Primary studies from selected databases were collected as the first phase, which was considered to be identification. Screening of collected studies based on titles and abstracts was performed as the second phase to check relevancy with review article objectives. Full articles were compared for inclusion or exclusion to meet the quality criteria, determining their eligibility, as the third phase. The last or fourth phase was regarding the ultimate inclusion of research studies for quantity synthesis.  
Following the above-described procedure, a total of 1763 studies were found in the described databases. This huge number of articles was found due to the commonly used terms \"crop\", \"yield\", \"traits\" and \"model\" in agriculture research articles. These terms have high numbers of articles available, particularly in the database ScienceDirect (1604), without any relevancy to RTM applications, i.e., [33; 34; 35; 36; 37], which were not included. Similarly, forest-relevant articles [38; 39; 40], even those having RTM applications, were excluded. Resultantly, a total of 179 articles were relevant to RTM applications for crop yield prediction and crop traits retrieval. Narrowing to the scope of the review, articles that did not have quality evaluation parameters or RTM applications for CYP and crop traits retrieval were also excluded. Thus, a total of 109 research articles were screened. Finally, after removal of 18 duplicated articles among selected databases, a total of 91 publications were included in this SLR that had RTM applications for crop yield prediction and crop traits retrieval. These articles were further segregated into categories relevant to estimated or retrieved features. This process of article screening is recapitulated in a flowchart given below as Figure 1.  
The following facts have been thoroughly extracted from each article: publication year, information about the dataset, detailed information about features, crop yield prediction based on radiative transfer models and whether they feature integration with crop growth models. The number of selected articles by year and by source are described in the results.
## 4 Experiment and Result Analysis
### Visual Comparison  
To visualize the results, two representative cases are compared in Figures 9 and 10. Red boxes indicate ripe blueberries, orange boxes indicate semi-ripe blueberries, and pink boxes indicate unripe blueberries. Moreover, blue boxes indicate missed or false detections.
## 8 Load Optimization and Scheduling
### Scheduling Algorithm
#### 8.1.1 Population Evaluation Functions
If the first appliance class is selected, the scheduling algorithm performs the appliance scheduling without considering appliance waiting time and renewable energy. In this way, the electricity bill is minimized with less user comfort. Alternatively, if appliance Class 2 is selected, the WDO algorithm performs the scheduling by incorporating renewable energy. Lastly, if appliance Class 3 is selected, scheduling is performed to increase the user comfort along with electricity bill cost reduction. After this step, the algorithm checks the current time slot, so that scheduling can be performed for the next time slot. Otherwise, the next cycle for all types of appliances will start. In the proceeding step, if the energy consumption is within the threshold limits, the results are stored for graphical representation. Otherwise, the whole process will be repeated to achieve the cost-effective results. In order to best describe the working of the proposed algorithm, optimization and scheduling steps are given in Figure 5.  
Figure 5: Scheduling algorithm.
## Open Issues in DTN Multicasting
### Performance due to Protocol Complexity  
There are a few common performance metrics that are used to evaluate the effectiveness and efficiency of DTN routing algorithms, including the following: Delivery ratio, delivery latency, transmission cost, and energy consumption. Since IoT devices deployed in a DTN environment are usually limited in storage and operate in low power mode for message forwarding, a routing algorithm shall achieve enough delivery ratios within a specific delivery latency and low overhead in terms of delivery cost and energy consumption. Data efficiency and overall efficiency are two other performance metrics that are specific to the multicast communication paradigm and are based on the ratio of delivered multicast packets to the traffic generated (data or control packets) in the network [6].  
Multicast in DTN requires group membership maintenance due to the mobility of nodes. The fact that nodes may join or leave a group anytime contributes to the dynamic topologies in the network. Membership might change during message propagation, which might be longer due to intermittent connectivity, so there is no general framework to define the intended receivers of multicast traffic. Such a dynamic membership generates extra transmission overheads that affects the overall performance. On the other hand, the security mechanism in DTN also incurs extra transmission and computation costs. Encoding or use of a cryptography algorithm increases the bandwidth utilization, while computation costs depend on the security algorithm used to encrypt the messages.  
Furthermore, buffer management schemes also increase the complexity of routing protocols and affect network performance with higher computational cost. The goal of a sophisticated multicast routing protocol aims to achieve a maximum delivery ratio with shorter delays and make the best use of resources to improve overall network performance.  
Besides the discussed open issues, we also should pay attention to the incorporation of artificial intelligence (AI) in DTN to improve routing efficiency and network performance. For example, AI can help to minimize the number of replications using fuzzy logic and ant colony optimization [63], or can compute and learn the trust level to select the best candidate to relay messages [88]. Furthermore, there are potential new applications for DTN in future internet architectures, such as the Information Centric Network (ICN) [89], or for use in new technologies, such as fog computing [90].
# Integrated DVB-X2 Receiver Architecture with Common Acceleration Engine
## 6 Conclusions  
In this paper, an integrated DVB-X2 receiver architecture to support multi-mode broadcasting standards in a single platform was proposed. The proposed receiver architecture uses the common acceleration engine to receive DVB-T2, DVB-C2, and DVB-S2-modulated signals, and its functional blocks are designed with the H/W engine and the S/W engine. The proposed receiver is implemented with the tuner block, two FPGA devices, the DSP, 256 MB memory, and the A/V decoder. According to the implementation results, the proposed receiver uses the same amount of memory as the DVB-T2 receiver with a small increase in the number of logic resources. Thus, the proposed receiver architecture can support DVB-T2, DVB-C2, and DVB-S2 standards while minimizing additional H/W resources required. The functionality of the proposed receiver was verified under various DVB-T2/C2/S2 operation modes as specified in the standards. The proposed DVB-X2 receiver is applicable to consumer digital broadcasting systems such as DVB set-top-boxes, digital HDTVs, etc.  
Conceptualization, J.K. and Y.-S.L.; methodology, J.K. and Y.-S.L.; software, J.K.; validation, J.K. and Y.-S.L.; formal analysis, J.K. and Y.-S.L.; investigation, Y.-S.L.; resources, Y.-S.L.; data curation, Y.-S.L.; writing--original draft preparation, J.K.; writing--review and editing, J.K. and Y.-S.L; visualization, Y.-S.L.; supervision, J.K.; project administration, Y.-S.L.; funding acquisition, Y.-S.L.  
This research received no external funding.  
The authors declare no conflict of interest.
# Analysis of the Sugarane Biomass Use to Produce Green Hydrogen: Brazilian Case Study
## 7 Future Perspectives  
Brazil's leadership in sugarcane production offers significant potential for advancing green hydrogen technologies. While 2G ethanol is renewable, its combustion is not fully carbon neutral, highlighting the need for more sustainable alternatives like green hydrogen. Future research should focus on optimizing the conversion of 2G ethanol to green hydrogen through emerging technologies, such as electrocatalytic reforming and plasma reactors, combined with lignocellulosic biomass. Brazil's established bioenergy infrastructure provides a strong foundation for scaling these innovations. Research should also explore advanced pretreatment strategies, microbial dynamics, and anaerobic processes to improve efficiency and yield. Overcoming technological and logistical challenges, such as optimizing supply chains and scaling up production, will be crucial for advancing biohydrogen production. Collaborative efforts will help address these barriers, while integrated systems combining green hydrogen with other renewable energy technologies will strengthen Brazil's energy independence and contribute to global sustainability goals.
# Analysis and Experimental Validation of Efficient Coded OFDM for an Impulsive Noise Environment
## 4 Experimental Planning and Test Bed Design
### Measurements Scenarios
#### 4.2.1 Experimental Scenario 1  
For the first experimental scenario, we consider an LOS situation as depicted in Figure 5a. We consider two configurations in this situation.  
* The impulsive noise source is placed at equal distance from the emitter and the receiver, which is 1 m. The distance between the two USRPs is 2 m.
* In the second case, we place the emitter at 1.90 m from the source, and the receiver is at 1.80 m from the source. For all the configurations, we generate four types of voltage for impulsive noise from 12 kV-18 kV. We limit the maximum to 18 kV to avoid the risk of breakdown.  
\begin{table}
\begin{tabular}{c c} \hline \hline
**Components** & **Types** \\ \hline Operating system & Ubuntu V. 16.4 LTS \\ CPU & Intel Core i7-2600 \\ GNU Radio & Version 3.7.10 \\ Matlab & R2016a \\ Wireshark & Version 2.4.5. \\ \hline \hline \end{tabular}
\end{table}
Table 2: Overview of the software used to verify the transceiver system.
## 2 Lattice Discrete Particle Model  
The Lattice Discrete Particle Model (LDPM) can be used to characterize the mesostructure of concrete as a three-dimensional assembly of discrete particles. This mesostructure consists of coarse aggregates embedded within a cementitious mortar matrix. The LDPM method begins by positioning spherical aggregate particles randomly inside the specimen volume according to a particle size distribution based on the Fuller equation [14] and applying spatial placement functions like uniform or other probabilistic ones. A specialized spatial discretization technique is then employed to connect each aggregate to its adjacent mortar and aggregates, usually using a modified Voronoi tessellation to partition the space efficiently.  
Four neighboring aggregates form tetrahedral elements in the LDPM model, which define the mechanical particle-particle interactions. The nodes at the centers of the aggregates are the tetrahedra's vertices, each possessing six degrees of freedom--three translational and three rotational. Mechanical response is defined by constitutive relations on triangular facets that simulate the interfaces between aggregates. The facets capture significant mechanical events, including elastic deformation, plasticity, damage, and fracture. Numerical solutions are typically achieved using explicit time-stepping schemes, enabling the model to effectively handle quasi-static and dynamic loading conditions.  
Cracking in the LDPM is limited to the mortar matrix because the aggregates are represented as rigid, non-fracturable inclusions in its standard formulation. While computationally beneficial, such an approximation can restrict the model's accuracy when simulating high-strength concrete or large, voided concrete, or when under high strain rates. Yet, more recent efforts [15] applied localized aggregate discretization techniques to overcome this limitation and enable fracture to traverse large aggregates. The constitutive behavior of the facets encompasses elastic and inelastic responses, compaction under compression, pore collapse, and damage evolution, and model parameters are calibrated based on standard experimental tests. Crack propagation is simulated as the fragmentation of polyhedral cells around aggregates after the locally exceeded damage threshold value. LDPM has been shown to have an excellent ability to mimic the fracture behavior of concrete under a wide variety of loading conditions [16, 17, 18, 19, 20].
# Neural Machine Translation of Electrical Engineering with Fusion of Memory Information
## 4 Experiment
### Impact of Fusion Methods  
To select the most suitable fusion method for the GRU, we experimented with models using concatenation fusion, gate fusion, attention fusion, and arithmetic average fu sion, and compared them with the baseline model. The experimental results are shown in Table 1, and the column chart of training data of different fusion methods is shown in Figure 3. (The horizontal axis represents the training rounds, while the vertical axis represents the BLEU value.)  
The baseline model achieved a BLEU score of 34.25, whereas all the models incorporating memory information achieved higher scores. The concatenation fusion method had the highest BLEU score of 36.29, which is 2.04 points higher than the baseline. The arithmetic average fusion, gate fusion, and attention fusion methods also outperformed the baseline model, but to a lesser extent.  
These results suggest that incorporating memory information into the transformer model can improve translation performance, and the most effective way to do so is through concatenation fusion. Through our exploration and analysis, we believe that the reason for this result may be that the other three fusion methods may lose some useful information when fusing global information and memory information. Arithmetic average fusion loses some information when calculating the means of the two types of information. Gate fusion loses information when controlling and selecting the incoming information through the gate coefficient. Attention fusion discards some information based on the weight of the memory information vector. Concatenation fusion concatenates the memory information vector directly to the last dimension of the global information vector, reducing the possibility of losing information. Therefore, the model using the concatenation fusion method has better performance than the other three models.
# Beyond Static Estimates: Dynamic Simulation of Fire-Evacuation Interaction in Historical Districts
## 3 Results
### Evacuations in Historical District
#### 3.4.5 Dynamic vs. Static  
The evacuation and the estimation without considering fire development are compared (Figure 8). In both cases, the average evacuation distance is 24% to 26% greater than the static result, while the average evacuation duration exceeds the estimated values by 135% to 155%. Though individuals experience evacuation distances that align with the static results, only 30% to 34% of individuals have evacuation durations consistent with the planned values. Additionally, in 2-600, the impact of fire on the shortest path to the W4 exit introduces further divergence between actual road usage and static traffic load estimations.  
The comparative results suggest that, while differences in evacuation distance remain modest, the differences in evacuation duration are considerable. Two primary factors may explain this divergence: (1) Localized detours caused by fire and high-temperature zones are not captured in the static analysis, leading to a slight underestimation of average evacuation distance and subtle changes in route selection; (2) Fire-induced congestion and its cascading effects--especially during early rapid evacuations--are overlooked, resulting in a substantial underestimation of total evacuation time.