esa-sceva/satcom-chunk-collection huggingface dataset:
## 4 Dynamic Load Balancing Modeling with ACO
### Dynamic Load Balancing Algorithm  
Algorithm 1 presents the essential steps to achieve load balancing by the use of the proposed approach. At the beginning, all slave nodes in cloud computing platform are initialized using Equation (7) (line 2 of Algorithm 1), the master node gets the job from the user's request, and the job is divided into a number of executable tasks (lines 3 and 4 of Algorithm 1). Then, the tasks are distributed to slave nodes for execution by \(n_{t}\) times, since the slave nodes cannot execute all the tasks at once (line 6 of Algorithm 1). After that, the nodes are judged if there is any overload or underload node (line 7 of Algorithm 1). If yes, the forward ant is created and carries out the searching missions, along with the assistance of the backward ant (lines from 7 to 21 of Algorithm 1). In this process, we should note that the moving probability is calculated according to diverse situations, that is, whether the forward ant meets the backward ant or not. If the candidate nodes can satisfy the demand of performing load balancing, do it and continue the next loop (lines from 22 to 25 of Algorithm 1). If the tasks have been done, go on to the next group of new tasks (lines 26 and 27 of Algorithm 1).  
```
1. Beginning of proposed algorithm
2. Initialize pheromone for slave nodes;
3. Get-job-from-user (job\({}_{\text{n}}\)) for master node;
4. Job-divides-into-tasks (job\({}_{\text{n}}\)) by master node;
5. for(i = 0 to n)\(\{\text{\char 17}/\text{n}_{\text{t}}\) is the distribution number of the tasks
6. Distribute-tasks-to-slaves(task\({}_{\text{i}}\));
7. If-there-are-overload/underload-nodes()\(\{\)
8. Generate-forward-ant();
9. Compute-moving-probability();
10. Move to next node;
11. if(node-is-candidate)
12. Generate-backward-ant();
13. Start-timer-for-backward-ant(timer\({}_{\text{n}}\));
14. Update-pheromone-by-forward-ant();
15. if(timer\({}_{\text{n}}\) > 0)
16. Update-pheromone-by-backward-ant();
17. if(task-in-slave-successful)
18. Increase- pheromone;
19. if(task-in-slave-failed)
20. Decrease- pheromone;
21. }
22. if(satisfy-load-balancing)\(\{\)
23. Do-load-balancing();
24. continue;
25. }
26. else if(need-new-tasks)
27. Go to 3;
28. }
29. End of algorithm
```  
**Algorithm 1** The step by step procedure of the proposed load balancing
## 2 Theory and Methodology
### Sparse Adaptive Leja Interpolation
#### Adaptive Anisotropic Leja Interpolation  
We will base the adaptive construction of anisotropic sparse interpolations on the dimension-adaptive algorithm first presented in [47] for quadrature purposes. Variants of this algorithm appear in a number of later works [16; 30; 36; 37; 48]. In this work, we assume the all underlying univariate interpolation rules employ Leja nodes, presented in Section 2.3, along with the level-to-nodes function \(m(i)=i+1\). Our approach is depicted in Algorithm 1, while a detailed presentation follows. ```
Data: input-output map \(g\left(\mathbf{y}\right)\), initial downward-closed multi-index set \(\Lambda^{\text{init}}\), tolerance \(\epsilon\), simulation budget \(B\). Result: multi-index set \(\Lambda\), sparse interpolation \(\mathcal{I}_{\Lambda}\left[g\right]\), sparse grid \(Z_{\Lambda}\). \(\Lambda\leftarrow\Lambda^{\text{init}}\). whileTruedo  Compute admissible set: \(\Lambda^{\text{adm}}=\left\{\mathbf{i}:\mathbf{i}\
ot\in\Lambda\text{ and }\Lambda\cup\left\{\mathbf{i}\right\}\text{ is downward-closed}\right\}\). Compute admissible Leja nodes: \(\mathbf{y}_{\mathbf{i}}=Z_{\mathbf{i}}\setminus Z_{\Lambda}\), \(\forall\mathbf{i}\in\Lambda^{\text{adm}}\). Compute hierarchical surpluses: \(\mathbf{s}_{\mathbf{i}}=g\left(\mathbf{y}_{\mathbf{i}}\right)-\mathcal{I}_{ \Lambda}\left[g\right]\left(\mathbf{y}_{\mathbf{i}}\right)\), \(\forall\mathbf{i}\in\Lambda^{\text{adm}}\). Compute contribution indicators: \(\eta_{\mathbf{i}}=\left|s_{\mathbf{i}}\right|\), \(\forall\mathbf{i}\in\Lambda^{\text{adm}}\). Compute costs: \(C=\#Z_{\Lambda}+\#Z_{\Lambda^{\text{adm}}}\). Compute total contribution of the admissible set: \(\eta^{\text{tot}}=\sum_{\mathbf{i}\in\Lambda^{\text{adm}}}\eta_{\mathbf{i}}\). if\(C\geq B\) OR \(\eta^{\text{tot}}\leq\epsilon\)then  Exit while-loop. end if  Find new multi-index: \(\mathbf{i}^{*}=\text{argmax}_{\mathbf{i}\in\Lambda^{\text{adm}}}\eta_{\mathbf{ i}}\). Update multi-index set: \(\Lambda\leftarrow\Lambda\cup\left\{\mathbf{i}^{*}\right\}\). end  Construct final multi-index set \(\Lambda\leftarrow\Lambda\cup\Lambda^{\text{adm}}\), sparse grid \(Z_{\Lambda}\), and approximation \(\mathcal{I}_{\Lambda}\left[g\right]\). ```  
**Algorithm 1**Dimension-adaptive Leja interpolation. Let us assume that a sparse interpolation \(\mathcal{I}_{\Lambda}\), based on a downward-closed multi-index set \(\Lambda\) and on univariate Leja sequences, is given as in Equation (11).
# Decentralized Identity Authentication with Auditability and Privacy
###### Abstract
In summary, we make the following contributions: (1) We define two security properties for detecting credential misuse in DID authentication (DIDAuth), namely, auditability and privacy. (2) We propose two protocols that achieve auditability with varying privacy and performance guarantees. The first has high performance but limited privacy, and the second has full privacy but low performance. (3) We provide a formal security analysis of our privacy-preserving protocol by using the Tamarin Prover. (4) We implement and evaluate the two protocols by using Hyperledger Fabric v0.6 (Hyperledger Fabric v0.6 has higher performance and security guarantees than those of v1.4 [11]). The results confirm that the overhead for privacy is substantial--the protocol can only handle one authentication event for every 3 s. However, by lowering the privacy guarantee, our protocol can perform over 38 events per second, which means that it can handle the average workload of today's centralized authentication systems. The rest of this paper is organized as follows. Section 2 provides the relevant background and related work on blockchain, DIDs, and cryptographic primitives. Section 3 describes the system model, threat model, and security properties. Sections 4 and 5 present the two protocols in detail. Section 6 gives a formal security analysis by using the Tamarin Prover. Section 7 discusses the implementation and performance of the two protocols before Section 8 provides the conclusions.
## 6 Conclusions  
It has been shown that when the devices had a clear vision of the zenith, both the linear polarized antenna boosters and circularly polarized patch antennas behaved similarly in terms of TFFF.  
However, for other positions of the devices in a vehicle and several orientations (up, upside down, vertical pointing to the front and back part of a car), the advantage of a linear polarized antenna booster becomes clear with a reduced TTFF. For example, when placing the tracking device on the seat of a vehicle, after averaging four orientations of the device, the TTFF was 7.3 s better. These differences became even larger in an urban environment. For example, in the same previous case, the TTFF was 15.7 s less for the device with antenna boosters. Some challenging positions, such as the tracking device under the seat for an urban scenario, increased these differences even more to 44.8 s less for the antenna booster case.  
Therefore, for unpredictable environments, the theoretical loss of 3 dB due to different polarization than the incoming electromagnetic signal from the satellite is not at all relevant. Other antenna parameters, such as the radiation patterns, become more important. This is the case in the linear polarized antenna booster with quasi-isotropic radiation patterns that allow the device to be robust to reception to any orientation of the device. However, for a circularly polarized patch antenna, the reception is reduced when the device is not located in the ideal position, pointing to the sky and with buildings modifying the polarization. This situation can be extrapolated to other situations rather than vehicles. For example, when the IoT device is on a vertical wall of a container and thus, the patch antenna is not pointing to the sky, but to the horizon where received, the signals are weaker.  
To sum up, for typical random positions and orientations of tracking devices, linear polarized antenna boosters ensure a better TTFF. Not only does less TTFF imply more battery life, but it also reduces the impact of CO\({}_{2}\) due to the longer battery duration.  
[PERSON]. ([PERSON]) contributed to writing the original draft, formal analysis, and investigation. [PERSON] contributed to the investigation. [PERSON] contributed to the conceptualization and investigation. [PERSON]. ([PERSON]) contributed to the conceptualization. [PERSON] contributed to writing review. [PERSON] contributed to the investigation, writing review, conceptualization, and supervision. All authors have read and agreed to the published version of the manuscript. Part of this research was funded by CDTI (Centro para el Desarrollo Tecnologico Industrial) Spain, Project IDI-20190285. The authors declare no conflict of interest.
# A Review of Parallel Heterogeneous Computing Algorithms in Power Systems
## 3 PHC in Power Systems
### Gpu
#### 3.1.6 Contingency Analysis  
Following smart grids, contingency analysis is the next application where GPU is used to reduce the simulation time of power flow analysis [100; 101; 102; 103; 104; 105; 106; 107; 108]. Depending on the simulation time reduction achieved, hybrid CPU-GPU solutions can evaluate a high number of contingencies and scenarios to find an optimal performance of power systems. The authors in ref. [102] presented a strategy to accelerate DC contingency screening where the following tasks are parallelized in a GPU: calculation of the node voltages and detection of overloaded elements after an outage of branches and generators.
# A Robust Multi-Watermarking Algorithm for Medical Images Based on DTCWT-DCT and Henon Map
## 1 Introduction
For medical images, the particularity is that the embedded watermark cannot affect the diagnosis of doctors, and cannot obviously change the main content of medical images, especially for the region of interest of the image. The second category uses reversible digital watermarks. Although the watermark image can be restored to the original image without loss, the watermark is not robust. Therefore, finding a feature vector that can resist geometric attacks in medical images so that the algorithm can show good robustness without changing the original image is a problem that has long puzzled researchers [7; 8; 12; 20; 21]. Figure 1: Category of watermarking algorithms for medical images. Consequently, this paper proposes a multi-watermark robust algorithm based on a dual-tree complex wavelet transform and discrete cosine transform (DTCWT-DCT) using perceptual hash and henon mapping. By selecting the low frequency coefficients of the medical images in the DTCWT-DCT transform domain and performing symbol transformation, the features of the medical image may be extracted. Then, using henon chaos and hash function properties, different initial values of the chaotic sequences and XOR operation are given to encrypt each watermark. Finally, based on common watermark technology, a set of secret keys are generated by combining the concepts of the \"third party\", chaotic encryption and cryptography technology to complete the embedding and extraction of the multi-watermark. The main contribution of the present research is:  
(1) A new method is proposed to extract stable features of medical images according to human vision, which does not require any changes to the original images, and is highly resistant to geometric attacks. (2) The encryption of watermarks uses a chaotic system and hash function properties, which are extremely sensitive to the initial value, to enhance the security of watermarks. (3) The embedding of watermarks generates a set of secret keys that can be stored by a third party. The region of interest need not be selected, which can effectively protect the privacy of patients. (4) The extraction of watermarks does not require the original image, i.e., zero watermark and blind extraction. (5) It solves the problem that existing algorithms cannot simultaneously offer protection against geometric attacks and robustness. The proposed algorithm has good robustness and invisibility.
# Current Trends in Fluid Viscous Dampers with Semi-Active and Adaptive Behavior
## 2 Passive Fluid Viscous Damper
Figure 3a shows the influence of the exponent \(\alpha\) on the shape of the force-displacement diagram of an FVD, while Figure 3b depicts the force-velocity curves considering different values of \(\alpha\) and a constant damping coefficient. As \(\alpha\) decreases, the area of the force-displacement hysteresis loop gets larger, with a consequent increase in the dissipated energy [55]; indeed, the shape corresponding to an FVD characterized by \(\alpha=1\) (linear FVD) is close to an ellipse, while it gets closer to a rectangle as \(\alpha\) tends to zero. The ultra-linear FVDs (with values of \(\alpha\) up to 1.8-2), as well as linear FVDs, are normally employed in applications where the structure is primarily excited by wind forces since these systems behave as shock-transmitting or lock-up devices that tend to develop large forces at high velocities [1; 54], as shown in Figure 3b. Non-linear FVDs are preferred for the protection of structures from earthquakes since they are able to dissipate a great amount of seismic energy, larger than that of linear and ultra-linear FVDs [57], over a large number of frequencies (Figure 3a). As a drawback, the high energy dissipation releases a huge amount of heat, causing a temperature increment in the device; this may be an issue in the case of long-term excitation, like in the case of wind excitation [34].
# The Enhanced Adaptive Grasping of a Soft Robotic Gripper Using Rigid Supports
## 4 Discussion
### Comparison with Other Soft Grippers  
The properties of the proposed gripper are listed below in Table 2.  
Figure 8 is the comparison of lifting force between the previous SPA studies and the proposed gripper. The gripper of [PERSON] et al. demanded 80 kPa to reach a lifting force of 28.7 N [3]. The gripper designed by [PERSON] et al. needed 50 kPa to reach a lifting force of 22.53 N [20]. The 3D-printed variable stiffness gripper of [PERSON]. [PERSON] et al. required 120 kPa for the soft actuators and \(-90\) kPa for the variable stiffness structures to reach a lifting force of 17 N [21]. The proposed soft gripper with rigid supports can reach a lifting force of 47 N in 27.3 kPa.  
Soft grippers, which are made by the proposed scheme, have a wide range of applications across various fields. These grippers are designed to adapt to different object shapes and increase the grasping force, allowing them to operate effectively in diverse environments. One significant application is in electronics assembly, where soft grippers effortlessly grasp and handle electronic components such as batteries and circuit boards for automated assembly processes. They also find utility in underwater maintenance tasks, such as repairing oil wells or manipulating fishing nets. In the medical field, soft grippers play a vital role in operating rooms by securely gripping surgical instruments or medication bottles. Logistics operations benefit greatly from their versatility, as soft grippers can handle packages of various sizes, thereby improving overall efficiency. Moreover, soft  
\begin{table}
\begin{tabular}{c c} \hline \hline
**Property** & **Value** \\ \hline Dimensions & \(158\times 158\times 91\) mm (L \(\times\) W \(\times\) H) \\ Maximum lifting force & 47 N in 27.3 kPa \\ (Spherical object, 75 mm in diameter) & 80 mm in diameter \\ Maximum grasping size & 10 mm in diameter \\ Minimum grasping size & 0–27.5 kPa \\ Incremental pressure range & \hline \hline \end{tabular}
\end{table}
Table 2: The properties of the proposed gripper.  
Figure 7: The experimental setup and grasped items. (**a**): The experimental setup; (**b**): a bunch of keys (53.3 g) in 25.9 kPa; (**c**): a screwdriver (66.3 g) in 23.4 kPa; (**d**): a square steel sheet (17 g, 60 mm \(\times\) 60 mm \(\times\) 2 mm) in 23.4 kPa; (**e**): a wrench (672 g) in 26.4 kPa; (**f**): a cylindrical metal block (476 g, 60 mm in diameter, 61.2 mm in height) in 25.4 kPa; (**g**): a small metal ball (112 g, 30 mm in diameter) in 25.4 kPa.  
grippers have proven invaluable in space exploration, enabling spacecraft maintenance and satellite manipulation. In agriculture, they assist in tasks such as fruit picking or grain harvesting by adapting to different shapes. Construction projects also benefit from soft grippers for handling construction materials like stones or wood. Overall, these soft grippers demonstrate promising potential and significantly contribute to enhancing work efficiency and overcoming challenges across diverse industries and scenarios.
# Online Learning-Based Adaptive Device-Free Localization in Time-Varying Indoor Environment
## 2 Related Work
### Fingerprint-Based DFL Method
(**a**,**d**,**g**) The schematic diagram of the reference locations; (**b**,**e**,**h**) The original signals distribution of the corresponding reference locations; (**c**,**f**,**i**) the ratio-based features distribution of the corresponding reference locations. Meanwhile, as the WiFi signals will be impacted by various environmental factors, CSI fingerprints will exhibit significant variations due to environmental changes. Consequently, the accuracy of the DFL model is significantly degraded in the time-varying environment. To address this issue, AdapLoc was proposed, which utilized a one-dimensional Convolutional Neural Network (1D-CNN) and leveraged Domain Adaptation (DA) with Semantic Alignment (SA) to achieve adaptation [27]. However, even when the environment changes due to the movement of furniture or other objects, there is still much room for improving the localization accuracy in the fingerprint-based DFL. [PERSON] et al. [28] proposed a novel DFL algorithm for dynamic environments, featuring an enhanced channel-selection method and adopting the logistic regression classifier to enhance the localization accuracy. The above works can adapt to the changes in the environment but do not address the similarities between fingerprints. In this paper, we construct a discriminable fingerprint with deep learning representation and propose an online learning-based mechanism to design a DFL model against environmental changes in the time-varying environment.
## 3 Results
### Main Outcomes of the Top 20 Highly Cited Articles from Each Thematic Area
#### 3.2.1 Atmosphere
[48] found that the vegetation greenness trend consistently decreased (range = \(-\)0.47 to \(-\)0.08) in eastern Iran. Similarly, projected land use changes for Saudi Arabia between 2014 and 2100 showed reductions in vegetation due to climate change and anthropogenic activities [49]. [PERSON] et al. [50] examined the long-term temporal and spatial characteristics associated with aerosol pollution in Lake Urmia by using daily aerosol optical depth (AOD) data from MODIS satellites, between 2001 and 2015. They found that aerosols in the area are emitted more effectively from bordering lands (desiccated areas, dried watercourses, and river deltas), rather than the Lake Urmia salt crust. The study of [PERSON] and [PERSON] [51] evaluated the performance of three advanced fusion-based methodologies including the ordered weighted averaged (OWA) approach based on the ORNESS weighting method (ORNESS-OWA) and ORLIKE weighting method (ORLIKE-OWA) for drought estimation with the use of different remotely sensed precipitation data products (CHOMPS, GPCP, CMAP, PERSIANN-CDR, TRMM, GLDAS-2, and MERRA-2). Their results showed that the ORNESS-OWA method had the highest performance (MARE = 2.51% and R2 = 95%) in comparison with all other fusion-based models, demonstrating an effective proficiency in drought estimation. [PERSON] et al. [52] showed the feasibility of detecting earthquake (EQ)-related anomalies in the ionosphere with the use of the Temporal Electron Content (TEC) from Global Ionospheric Map TEC (GIMTEC) and ground-based dual-frequency GPS receivers. They used data for three major (M > 7.0) earthquakes in Nepal and the Iran-Iraq border from 2015-2017. Their statistical procedures showed positive ionospheric anomalies within 10 days before all the major earthquakes.
## 1 Introduction
The aim of this study is to perform a detailed investigation of the influence of different problem properties on the quality of DRs automatically developed by GP for unrelated machine scheduling problems. The motivation for this is to determine the set of the most suitable terminal nodes, with which GP can generate DRs that perform well across a wide range of problem instances. This is done in a sequential manner, where first, simple atomic features are analysed, representing only the most basic information about the problem. Then, composite features are added to the set of terminals to investigate whether by including more sophisticated terminal nodes, either designed automatically or manually, they can improve the performance of the generated DRs. Naturally, only providing the terminal nodes is not enough, since a too-large terminal set can negatively affect the results simply due to a too-large solution space that the algorithm needs to traverse. Therefore, to select the appropriate feature set, we use the backward sequential feature selection method, which is commonly used in the literature for this purpose, but also investigate the ability of GP to perform feature selection by using the frequency of occurrence of nodes in the expressions as a criterion for selecting the appropriate features. From the obtained results, we investigate how the different node sets that were obtained influence not only the performance and complexity of the generated DRs but also the performance of different methods in selecting the appropriate features. The contributions of this study can be summarised as follows:* Analysis of how different types of terminal nodes influence the effectiveness of GP to generate good quality DRs and their complexity. * Construction of new terminal nodes based on the frequency of occurrence of sub-expressions in the generated DRs. * Application and comparison of two feature selection methods to determine appropriate terminal node sets. The rest of this study is organised as follows. Section 2 outlines the relevant literature on the generation of DRs with GP. The necessary background information about the problem under consideration and the application of GP to generate DRs is given in Section 3. The methodology used to conduct the investigation in this paper is described in Section 4. Section 5 describes the design of the experimental study and discusses the results obtained. A more in-depth analysis of the results obtained is presented in Section 6. Finally, Section 7 concludes this paper and provides guidance for future research.