esa-sceva/satcom-chunk-collection huggingface dataset:
# Identification of C-Band Radio Frequency Interferences from Sentinel-1 Data
## 5 Discussion  
The main innovation of the proposed method is both in the use of rank-pulses S1 data and in the joint exploitation of two different detectors: Fisher Z test, for the strongest RFI, and KL divergence, sensitive to diffused RFI with low power, like RLAN, that are becoming more and more diffused. The along track squinting of the antenna beam, is a necessary requirement, since it provides rejection to previous transmitted pulses by exploiting the 2D antenna pattern. The method is insofar limited to TOPSAR, and then to S1 (the sole system presently using that mode). Furthermore, the measure is not spanning the whole C-band spectrum, but only up to 40% (in IW1), and it leaves gaps along track, since each swath is sampled for 4 km each 25 km, though near swaths will still be influenced by RFI.  
The analysis assumed IW mode data, that exclude RFI detection over polar regions, that are systematically imaged EW mode. Indeed, it could be extended to the EW mode, but the bandwidth would be quite limited, to \(<\)20 MHz.  
The detection of RFI, carried out with 4\(\sigma\) threshold, would ensure ideally a false alarm rate in the order of \(\sim\)10\({}^{-5}\). However, this applies with respect to thermal noise, whereas the analysis of rank pulses it has shown time-varying behavior due to internal instrument instability. It is expected that detections above threshold are not to be attributed just to RFI, but also to some internal spurious or transients. Nonetheless, the geo-political correlation of the RFI power maps let think that values starting from RFI of 5 dBm are more likely to be attributed to on-ground sources than to the instrument. This seems to be a reliable sensitivity of the system.
## 6 Simulation Results
### First Stage: One Day Evaluation
#### 6.1.5 Second Order Low-Pass Filter (SOLPF) Method  
Simulation results for the SOLPF method are shown in Figure 15. It is noted that the SOC reached the upper limit twice during the day for \(\omega_{\rm n}=1/35\). Furthermore, there were multiple violations for \(\omega_{\rm n}=1/35\). A summary of the simulation results for the SOLPF method is shown in Table 7. The least degradation without having PRR violations occurred when \(\omega_{\rm n}=1/25\).  
\begin{table}
\begin{tabular}{c c c c} \hline \hline
**Measurement** & \(\mathbf{T_{f}}\) = **450** & \(\mathbf{T_{f}}\) = **500** & \(\mathbf{T_{f}}\) = **550** \\ \hline D(\%) & 0.0071 & 0.0081 & 0.0085 \\ \hline NC(80\%) & 0.7117 & 0.8127 & 0.8485 \\ \hline Violations (mins) & 1 & 0 & 0 \\ \hline SOC (end of the day) -SOC(ref) & \(-21.6426\) & \(-22.8112\) & \(-21.7886\) \\ \hline \(\sigma^{2}(\mathrm{PRR}_{\mathrm{out}})\) & 6.1622 & 5.1486 & 4.3769 \\ \hline \hline \end{tabular}
\end{table}
Table 6: Summary of the simulation results for the FOLPF method.  
Figure 14: Simulation results for the FOLPF method. (**a**) One-day data results showing the total output power (\(\mathrm{P}_{\mathrm{out}}\)), the ESS output power (\(\mathrm{P}_{\mathrm{ess}}\)), the PRR at the output (\(\mathrm{PRR}_{\mathrm{out}}\)), and the state of charge (SOC). (**b**) Zoomed figures of the corresponding black squares.
## 1 Introduction  
Half-metallic materials (HMMs) [1] can provide completely spin-polarized conducting electrons due to their unique electronic band structure which shows metallic characteristics in one spin channel and semiconducting/insulating properties in the other spin channel. Hence, HMMs are very much appreciated as key materials for providing high spin polarized carriers for spintronics devices.  
As one of the important HMM families, Heusler compounds have a special importance due to their high Curie temperature, tunable electronic structure, and wide change of lattice constant [2, 3]. Moreover, from the previous reports concerning pseudo-quaternary or ternary Heusler compounds with half-metallicity, it was found that the materials containing 4d or 5d transition metal elements generally demonstrate a wide band gap implying a robust half-metallicity in a quite uniform strain or tetragonal distortion, which is quite suitable for practical applications. Therefore, in recent years, the investigations on the Heusler compounds containing 4d or 5d transition metal elements have become the research focus [4, 5, 6, 7, 8, 9]. Although many ternary Heusler compounds containing 4d transition metal elements have been reported in the literature, the quaternary Heusler compounds containing 4d or 5d transition metal elements, especially, the stoichiometric quaternary Heusler (SQH) compoundswith half-metallicity have been rarely reported. Hence, it is important to further investigate and search for new half-metallic SQH materials containing 4d or 5d transition metal elements.  
In this work, we investigate two new SQH compounds, ZrRhTiAl and ZrRhTiGa, for the first time. Our prime aim in this work is to investigate the electronic and magnetic properties of both compounds and their half-metallic (HM) stability under uniform strain and tetragonal distortion. The elastic constants, formation energy, and cohesive energy were also presented to help understand the possibility of experimental synthesis and the mechanical properties of these two compounds.
## 1 Introduction
The inclusion of these four objective functions is believed to improve QoS of a communication link in the smart grid network unlike most of the prior work that only focuses on maximizing network coverage and minimizing energy consumption. In this paper, we propose to apply our proposed MOSFET method that is inspired by sperm motility to fertilize the egg to find the optimal value of packet payload size based on the aforementioned objective functions. The complexity of real life problems in WSN increases with time due to the limited power, memory size, and communication ranges of sensor nodes. Most of the available metaheuristic techniques suffer from slow convergence and bad local search ability. Therefore, solving the real life problems in WSN will require a more powerful metaheuristic-based technique. The advantages of MOSFET over the other algorithms are the ability of MOSFET to solve complex objective functions, such as Zitzler-Deb-Thiele 3 (ZDT3) and solve functions that contain more than two objective functions, such as Walking-Fish-Group 5 and 8 (WFG5 and WFG8) as proved in our prior paper [19]. Additionally, MOSFET has the advantages of finding a good approximation of Pareto front and attending a high amount of points of the true Pareto front for these objective functions [19]. In this paper, we choose a smart grid as a case study because smart grids have problems that can be represented by the objective functions similar to ZDT3, WFG5, and WFG8 in which MOSFET has a higher efficiency and ability to provide an optimal solution for them. This is because MOSFET has a higher convergence and spread of the results than OMOPSO, NSGA-II, and SPEA2 while solving these kinds of problems. Examples of these objective functions that have the same features of the aforementioned problems are end-to-end delay and end-to-end latency, where the latency is affected by the results of end-to-end delay. In addition, the four aforementioned algorithms will be used to study the effect of packet payload size to the network QoS as well as how this parameter plays a significant role in minimizing both end-to-end delay and end-to-end latency and also in maximizing both energy efficiency and packet throughput. In the first stage, the four algorithms are evaluated to find the most efficient algorithm. This is followed by Pareto-optimal set analysis to find the optimal value of packet payload size that minimizes both end-to-end delay and end-to-end latency and maximizes both energy efficiency and packet throughput. This paper is organized as follows: Section 2 presents a literature review. Section 3 shows the multi-objective optimization algorithms. Section 4 discusses the quality of service features of WSNs. Section 5 presents a case study. Section 6 presents the methodology and experimental setup. Section 7 presents our experimentation and results. We conclude the findings in Section 8.
## 5 Conclusions  
In summary, carbon fluxes model based on remote sensing data were presented in this study. The model was calibrated and validated at two stations in the midstream of the Heihe River Basin. Based on this research, the following conclusions are presented. (1) In the midstream of the Heihe River Basin, the maize land had higher GPP (1442.04 g C/m\({}^{2}\)/year) than the reed dominated wetland (928.89 g C/m\({}^{2}\)/year). However, the NEP of maize land (409.38 g C/m\({}^{2}\)/year) was nearly equal to that of the reed dominated wetland (422.60 g C/m\({}^{2}\)/year). (2) RS-CFLUX can adequately simulate the seasonal dynamics and quantity of carbon fluxes for the maize land and reed dominated wetland. (3) From the calibration of RS-CFLUX, only a few parameters were well constrained. However, these well-constrained parameters are important to model output, such as the maximum light use efficiency, respiration at the reference temperature and the activation energy parameter of respiration. If these parameters are not well estimated, then they can result in large uncertainties in the model output.
## 2 Related Works
### Camera Surveillance Systems  
Camera surveillance systems have emerged as a vital component in elderly monitoring, leveraging advanced image processing and AI algorithms. The integration of high-resolution cameras with real-time video analytics has enabled more detailed observation of elderly activities, ensuring safety by providing prompt alerts to caregivers [8; 9; 10]. Innovations in this domain include the use of infrared or thermal imaging to enhance monitoring capabilities during low-light or no-light conditions [11; 12; 13; 14; 15]. Additionally, the implementation of machine learning models, such as convolutional neural networks (CNNs), has significantly improved the ability of these systems to recognize and interpret complex human behaviors [16; 17]. This progress has been vital in not just detecting emergencies like falls or unusual inactivity, but also in understanding daily patterns and deviations that might indicate health or well-being concerns.  
Furthermore, the adoption of edge computing in camera surveillance systems marks a crucial development in the area of elderly surveillance systems. By processing data locally, smart camera systems are more cost-effective, reduce latency, and decrease response time,which is essential for prompt interventions in emergency situations [18; 19; 20; 21]. Moreover, edge computing aids in addressing privacy concerns, as sensitive data can be processed and stored locally, minimizing the need for transmission to remote servers. This feature is particularly important in elderly care, where privacy and data security are paramount. However, recent advances in edge computing rely on minimal data transmission, meaning that only essential information, such as alerts or behavioral data, is transmitted to servers and caregivers. While this method effectively addresses visual privacy concerns [7], it does not provide caregivers with a complete picture of a scene. This limitation is of the utmost concern, since fall detection and behavioral analysis models, although useful, are not infallible and are prone to false alarms and missed incidents.
# Real-Time Path Planning for Strategic Missions
## 5 Results and Discussion
### Scalability Analysis  
In order to claim that the proposed algorithm is scalable, this section carries out simulations using a 5 \(\times\) 5 and a 50 \(\times\) 50 map. Other sizes of maps could be also considered, but we decide to exploit these and later explain how to deal with bigger or smaller ones. At the beginning, both maps are clean. All cells are free navigation zones. Then, the robot starts navigating, aiming to cross and reach the opposite side of the map. During navigation, the simulation code pauses six times, and blocked zones are randomly placed in the environment. After the last pause, approximately 24% of the maps are already labeled as occupied.  
Whenever the code pauses, the robot stops, LPA* runs and returns a new optimal route joining the started position to the target position. After, [PERSON] runs and finds a \"shortcut\" joining the agent to the route computed by the LPA* algorithm. Then, the robot resumes its navigation according to the new computed route. Figure 6 illustrates the last stop situation and the feasible solutions found by the proposed strategy in both cases.  
The computer used to run the simulations has a Gigabyte B450M motherboard, an AMD Ryzen 5 1600 3.6 GHz processor, 16 GB 3000 MHz RAM memory and runs MATLAB(r) software. Taking into account such hardware and software setup, the average times spent to find a feasible solution for the 5 \(\times\) 5 and 50 \(\times\) 50 maps are 24.6 and 58.2 ms, respectively.  
As one can see, the larger the map is, the longer the time required to find a way to the destination (whenever possible) is. However, taking the mission covered in this work, it allows the robot to take the time to find the best route. After all, the work deals with an exploration mission. Hence, we assume that to take the necessary time to find a feasible solution is safer than to interrupt the search process and present a sub-optimal solution.  
It is worth stressing that the scope of the work is not to propose a better search algorithm, but to present an application of a strategy to improve the use of the LPA* and Dijkstra algorithms. Further, one way out to deal with giant maps would be to subdivide them into sectors containing smaller grids. Therefore, the algorithm would have to calculate a path showing which sectors the robot should pass through, and within each sector there would be another route conducting the robot to the  
Figure 5: Comparison with (**a**) Ant Colony Optimization with the Influence of Critical (ACOIC) controller by [PERSON] in [14] and (**b**) Improved genetic algorithm (IGA) controller by [PERSON] in [17].  
next sector. Nevertheless, this strategy goes beyond the proposal of the present work, thus becoming a suggestion for its continuity.
# Generation of High Resolution Vegetation Productivity from a Downscaling Method
## 4 Discussion
### Future Work  
Bias of the downscaled FPAR and LAI in our study, may have introduced some considerable errors in the GPP and NPP estimation. Specifically, FPAR is related to the absorbed radiation in GPP estimation and LAI was related to the maintenance respiration in NPP estimation. In the future, we may carry out research into the error transfers in GPP and NPP estimates when using the downscaled FPAR and LAI in the MuSyQ GPP/NPP algorithm. Second, the STARFM predictions were affected by the number of spectral slices, the maximum search distance and the method used to inform the search for similar neighbor pixels [1; 25]. Therefore, we may do some further analysis on the parameter optimization in the GPP and NPP predictions. Third, STARFM did not gain the ability to accurately predict short-term, transient changes that are not recorded in any of the bracketing fine-resolution images, therefore combining STARFM with ESTARFM and STAARCH may be a feasible way to solve the problem in generating high resolution vegetation productivity [21]. To improve the accuracy of the downscaling results, higher quality low resolution data would be used, and some improvements model of STARFM would be adopted. Improving the method to match the scale between ground observation data and satellite derived data, would be another way to improve the accuracy of downscaling results.
# A V2V Identity Authentication and Key Agreement Scheme Based on Identity-Based Cryptograph
## 6 Security Analysis and Experimental Validation
### Experimental Validation
The identity authentication and key agreement process only needs to transmit three data packets. We simulated this scheme identity authentication process and PKI-based identity authentication process with software. Compared with the traditional method based on the PKI system, this scheme is more lightweight and easier to implement.
## 7 Conclusions  
In this paper, we proposed a reliable transport scheme, the RTS, for human opportunistic network, where an optimal trade-off between the file round-trip delay and the energy consumption of relays were made. The scheme relied on acknowledgements and coding at the source to enable successful file delivery. The cache management rule referred to as the \"full-duplex\" strategy was formulated when the network was configured, and a mathematical model was set up to analyze the proposed scheme. This model described the evolution of packets' dissemination and allowed both the mean file round-trip delay and the energy consumption up to the reception of last ACK by the source to be expressed. Based on the model, a new function was proposed to reflect the impact of these two metrics on the number of files delivered under time and energy constraints. Then the function was optimized to obtain the parameters' combination which could achieve optimization of the file delivery delay and the energy consumption. The accuracy of the analytical model was validated through numerous simulations, and results from performance comparison showed that the RTS could significantly reduce the energy consumption of file delivery, which obviously alleviated the selfish behavior of nodes.  
Figure 17: The number of successfully delivered files of both RTS and RTS-MV under different \(K\).  
Although the delivery delay of the RTS increased slightly compared with that of the energy-consuming approaches, a more reliable and stable communication service in human ONs could be provided. Thus, the proposed RTS was very credible and suitable for some scenarios where network resources, especially power, were very scarce and the number of messages to be sent was quite large.  
Future work consists (i) in progressing to a better protocol for human ONs by considering multiple flows, and (ii) in extending this scheme to the more general human ONs with heterogeneous-mobility models.  
[PERSON], [PERSON], [PERSON] and [PERSON] conceived and designed the proposed scheme. [PERSON] and [PERSON] conceived and designed the simulations; [PERSON] and [PERSON] performed the simulations; [PERSON] and [PERSON] analyzed the data; [PERSON] wrote the paper. All authors have read and agreed to the published version of the manuscript.  
The research of [PERSON] and [PERSON] was supported by the National Natural Science Foundation of China (grant number: U1736121).  
The authors declare no conflict of interest.
## 5 WirelessHART Simulators
Therefore, it is a natural platform for the development of network simulation modules. The work in [106] presents a modification in the wireless network block of the TrueTime simulator in order to simulate WirelessHART networks. The modifications were made using some C++ functions and MATLAB MEXinterfaces, and the simulations are used using Simulink's block language. It is worth noting that the JRMNL algorithm presented in Section 3.2 was validated using MATLAB(r)[62], but a specific simulation module for the platform was not developed. Another approach for the TrueTime platform was implemented by [107] aiming at the application levels, mainly control loops. The module provides information about possible errors in data flow dependencies and network access conflicts. However, the implementation does not support multiple hop communication and utilization of the 15 channels defined by the WirelessHART specification [6]. OPNETis a proprietary discrete event network simulator that adopts a hierarchical structure divided into three layers (network, node and process) that is intended to be parallel with the structure of actual communication networks [108]. One WirelessHART implementation for the OPNET platform is presented in [109]; it tries to build an entire WirelessHART network stack. This network model can be used as a simulation platform to test resource scheduling algorithms' performance and internetworking protocols. Another implementation can be seen in [110], where the author claims it to be a \"primary implementation of the medium access control layer of WirelessHART\" and proposes the improvement of the shared slot access method by using slotted CSMA-CA instead of the existing aloha. The language used in OPNET is a proprietary block diagram language with the possibility of event scheduling. It is worth noting that nowadays, OPNET is available as a part of the Riverbed Network Simulation Software [111]. For the sake of a better understanding, Table 7 will outline some key points of the aforementioned WirelessHART simulation modules. \begin{table}
\begin{tabular}{c c c c c} \hline \hline
**Simulator** & **Open Source** & **Language** & **Module Ref.** & **Simulator Ref.** \\ \hline COOJA & Yes & Java & [102] & [112] \\ NS-2 & Yes & OTCL C++ & [55] & [113] \\ NS-3 & Yes & C++ Python & [100, 105, 114] & [103] \\ MATLAB(r) (TrueTime) & No & Simulink blocks & [106, 107] & [115] \\ OPNET & No & OPNET block language & [109] & [111] \\ \hline \hline \end{tabular}
\end{table} 
Table 7: Available WirelessHART simulation modules. NS, Network Simulator; OTCL, Object-oriented Tool Command Language.
# Unified Ciphertext-Policy Weighted Attribute-Based Encryption for Sharing Data in Cloud Computing
## 7 Evaluation of the Encryption Efficiency
### Efficiency Analysis Based on Implementation  
The implementation of UCP-WABE is on the basis of the cpabe toolkit [33] and the Pairing-Based Cryptography library [34]. The implementation uses a 160-bit elliptic curve group based on the supersingular curve \(y^{2}=x^{3}+x\) over a 512-bit finite field. The experiments are conducted on a PC, in Intel Core2 Duo with 3.00-GHz CPU and 2 GB RAM, running Ubuntu15.04. We compare UCP-WABE with CP-WABE and CP-ABE in the field of encryption time cost. For all experiments, we make all the weighted access policies' threshold gates \"AND\" gates. This ensures that all of the ciphertext components could be calculated in **Decrypt**.  
Figure 6 shows the encryption time cost with given experimental conditions \(k_{1}=27,\omega_{i}=3\), and \(l_{i}=4\) (\(i=1,\cdots,7\)), \(l_{i}=3\) (\(i=8,\cdots,27\)). We do not suppose all the attributes have the same maximum weight in this case for the reason that the result of CP-ABE is too high. The number of mutual attributes used in the experiments is \(k_{\epsilon}=\{2,5,8,11,14,17,20,23,26\}\). As shown in Figure 6, the encryption time cost of UCP-WABE follows a linear decline with the number of the mutual access tree attributes. For CP-WABE and CP-ABE, the encryption time cost almost keeps unchanged.  
Figure 7 displays the encryption time with \(k_{\epsilon}=3,\omega_{i}=3\) and \(l_{i}=4\). In the experiments, the number of \(\Gamma_{1}\)'s attributes is \(k_{1}=\{4,5,6,7,8,9,10\}\). As shown in Figure 7, the encryption time cost follows a linear growth with the number of the access tree attributes in UCP-WABE and CP-WABE. Meanwhile, the former is lower than the latter. The result of CP-ABE increases exponentially with the number of access tree attributes.  
Figure 6: Encryption time cost for the changed number of mutual access tree attributes.  
Figure 8 shows the encryption time cost with given experimental conditions \(k_{1}=3,k_{c}=2\), and \(l_{i}=9\). The weight of attributes in \(\Gamma_{1}\) used in the experiments is \(\omega_{i}=\{1,2,3,4,5,6,7\}\). Figure 8 shows that the encryption time cost of UCP-WABE and CP-WABE is following a linear growth in the weight of attributes, and the former is lower than the latter. The result of CP-ABE is decreasing with the weight of attributes; however, it is still higher than UCP-WABE. Therefore, UCP-WABE improves the efficiency of encryption.