esa-sceva/satcom-chunk-collection huggingface dataset:
# Analysing the Performance of a Trust-Based AODV in the Presence of a Flooding Attack
## 5 Trust Management  
One of the essential goals for MANETs is to provide routing security in the network and ensure confidentiality, integrity, availability and anonymity [41]. The existence and implementation of MANETs depend on the nodes' cooperative and trusting nature. There is a common assumption in existing MANET routing protocols that each node participating in the network is trustworthy [42]. This default assumption needs to change with the development of a mechanism that can distinguish a trustworthy node from a malicious node.  
Trust can broadly be defined as a measure of subjective belief that an entity will perform an action and another will perform the promised work without the need to examine whether or not the work is done [43]. This definition contains two inspiring terms: measure and performance. This is how networks work; it is all about performance and the ability to measure it.  
In MANETs, trust management is a reputational mechanism such that every node in the network observes and evaluates its neighbouring nodes' activities and tries to detect and isolate any malicious node [42]. It is a method of collecting the information about an entity needed to make a trust relationship decision about it [27]. Trust management can go further and obtain experiences from other entities. Thus, the trust decision can be made using information collected directly or using other nodes' experiences and recommendations.  
Trust management has become crucial to solving many performance issues in MANETS. The principle of trust is derived from the social sciences and is used in many fields, such as economics, communications, business and computing and networking. In computer networks in general and in MANETs especially, trust entails believing that a node is cooperating with other nodes to forward the data through the network as expected without any disruption [44].  
[PERSON] et al. [44] defined that the objectives of trust management in MANETs as follows:  
1. To distinguish between trustworthy and malicious nodes.
2. To allow trustworthy nodes to participate in establishing routes between sources and destinations.
3. To isolate malicious nodes and prevent them from participating in the network  
Due to the unique characteristics of MANETs, a trust management scheme must be distributive and self-organised. Also, it should consume fewer CPU cycles and battery, memory and bandwidth resources.  
Trust management in MANETs comprises four steps: trust initialisation, information collection, trust calculation and decision making [44]. Each step has its own challenges and difficulties in MANETs.
## 3 Experiments and Discussions
### Evaluation of the Measurement Range and Resolution to Be Achieved by the Developed Setup
(**a**) Normalized chromatic confocal outputs in the range of 1550–1610 nm obtained at each \(Z\)-position; (**b**) variation of the peak wavelength over a range of 46 \(\upmu\)m.  
Figure 13: Peak wavelength \(\lambda_{\text{ITLM}}\) and centroid wavelength \(\lambda_{\text{ITLM}\_C}\) of \(I_{\text{ITLM}}\) encoded from the normalized chromatic confocal output obtained at each \(Z\)-position of the target mirror by the chromatic confocal probe with the proposed off-axis differential method. with a \(Z\)-directional step of 40, 30 and 20 nm, respectively. For each moving interval, five repetitive measurements were made, and the mean value from the repeated measurements at each period is plotted in Figure 14. As can be seen in the figures, the change in the peak wavelength with respect to the step Z-displacement given to the target mirror was clearly distinguished in each of the cases. Figure 14d shows a standard deviation of the five repetitive measurements at each step observed in the case of Figure 14c. The standard deviation was evaluated to be smaller than 0.14 nm. It should be noted that the above results contained the uncertainty that came from the PZT stage employed in the experiments. Meanwhile, the PZT stage had a positioning resolution of 0.4 nm and a linearity error of 0.02% (corresponding to 1.2 nm regarding a travel range of 6 \(\upmu\)m in Figure 14c), which were much smaller than those obtained by the femtosecond laser chromatic confocal probe and were enough for the experiments. The verification experiments in this manuscript have been done as the first step of the investigation of the proposed off-axis differential method. Analyses on the measurement uncertainty of the femtosecond laser chromatic confocal probe with the proposed off-axis method will be carried out in future work while considering the positioning uncertainty of the PZT stage. Figure 14: Evaluation of the measurement resolution of the mode-locked femtosecond laser differential chromatic confocal probe with the off-axis differential method. (**a**) Measured variation of the stage position moved in a step of 40 nm; (**b**) measured variation of the stage position moved in a step of 30 nm; (**c**) measured variation of the stage position moved in a step of 20 nm; (**d**) standard deviation of the repeated measurements in (**c**).
# Secure Video Communication Using Multi-Equation Multi-Key Hybrid Cryptography
## 5 Conclusions  
This study presents a novel and secure system architecture. The platform will encrypt and decrypt the video file using the suggested cryptographic method. In this study, we present a hybrid and multi-key cryptography technique. It encrypts the video data using RSA, equation set, and AES.  
The proposed multi-key approach divides the video into numerous pieces, each of which is encrypted using a different key. The recipients are not aware of these keys. The key is generated by the receiving program using the received encrypted data. Since the proposed solution is dynamic and automatic, the receiver program can begin decryption once it receives the video chunks.  
The Android version of the app was developed on the receiving end. The proposed strategy and testing were implemented in Java-based server-side software. Individual modules were created, each tailored to the tasks considered by the proposed approach. The program was then put through its paces using video files of varying lengths. The results confirmed the app's continuous delay and demonstrated its ability to facilitate real-time video conversation. The equation set, RSA, and AES were all used in the hybrid method. These cryptographic methods make video material more secure.  
The suggested platform encrypts and streams across the network while securing the video contents using a dynamic key, all while utilising the recipient's credentials and device details, making it ideal for use in video-on-demand applications. All created keys and encrypted content can be stored locally on the target device due to configurable program settings. This technology is very helpful for copyright protection because it prevents the data from being transmitted. More individuals are signing up for paid video services, which is good news for the industry's bottom line. The ultimate long-term objective is to create a state-of-the-art, thoroughly implemented security system for live-streamed video via the internet.  
Conceptualisation, Y.F.; formal analysis, Y.F. and A.L.; project administration, R.M.; Software, Y.F. and R.M.; supervision, A.L.; writing--original draft, R.M.; writing--review and editing, R.M., Y.F., and A.L. All authors have read and agreed to the published version of the manuscript.  
Figure 8: End-to-end delay in decryption (Compared with Multi-Key [13]).  
**Funding:** This research received no external funding.  
**Data Availability Statement:** No new data were created or analyzed in this study. Data sharing is not applicable to this article.  
**Conflicts of Interest:** The authors declare no conflicts of interest.
# Multidimensional Group Recommendations in the Health Domain
## 6 Evaluation
### Evaluation Results  
#### 6.2.1 Evaluation of Similarity Functions  
To evaluate the proposed similarity functions, we used the recommendations produced for single users. We used 50 users, for which we hidden 20% percent of their ratings. We then applied the recommendation algorithm using different values for the variables \(\alpha,\ \beta,\ \gamma,\) and \(\delta\) and predicted a score for them. We used the hidden items as the ground truth for the calculation of the \(IDCG\). Finally, we averaged these scores. The results are shown in Figure 2. In our experiments, for computing the semantic similarity function \(SemS\), we used the value of 0.1 for constant \(w\) that is needed in Definition 1. As a reminder, \(\alpha\) is the weight that corresponds to the rating similarity \(RatS\), \(\beta\) to health problems similarity \(SemS\), \(\gamma\) to education/health literacy similarity \(EducStatusS\), and \(\delta\) to anxiety/cognitive closure similarity \(PhychStatusS\).  
In our previous work [11], we showed that \(SemS\) outperforms \(RatS\). We now want to focus on what effect the \(EducStatusS\) and \(PhychStatusS\) has on them. When we introduce the two new similarities to the old ones, we can still observe that the \(SemS\) gives better results. However, if we combine all the similarities we get the best \(nDCG\) values. The \(SemS\) and \(RatS\) similarities can compensate for the faults of each other. \(SemS\) can find patients with similar health problems which means that they have an interest in the same documents. \(RatS\) can find all the other patients that are not necessarily related with similar health problems, but have a similar interest in documents. The results improve further when we \(EducStatusS\) and \(PhychStatusS\). They further refine the selection of the peers, so the recommendations are more accurate.  
We did not make any evaluations for \(\gamma\) and \(\delta\) on their own as the \(EducStatusS\) and \(PhychStatusS\) similarities offer more auxiliary and not defining information for the patients. They need another similarity to augment their knowledge in order to function as intended.
## 3 Results and Discussion
### Green Corrosion Inhibitors Derived from Plant Extracts
This is related to the composition of extracts, mostly composed of heterocyclics such as flavonoids and alkaloids and other structures such as tannins, cellulose and polycyclic compounds. This composition can lead to the formation of a film on the metal surface and protect it by adsorption mechanism [73]. There is no absolute solution for incorporation of plant extracts and natural product inhibitors are well reviewed by [PERSON] et al. [74]. Some inhibitors are incorporated into painting resin (water-based epoxy coatings, for example) directly or microencapsulated. Others can be used as waterborne processes as revealed by [PERSON] et al. [75]. In the SciELO database, the combination of group C descriptors (corros* AND (inhib* or inib*) AND (green OR environmental sustainable OR eco-friendly) AND plant* AND extract) recovered two articles, already mentioned in Table 3 (Section 3.2). The first deals with the use of oil extracted from the fruit of babassu to inhibit corrosion in carbon steel 1020 in HCl 1 mol\(\cdot\)L\({}^{-1}\) solution. The extract showed good results, with 20% more efficiency in the comparison made with the commercial corrosion inhibitor Polydisperse HIPAA (acid 2-Hidroxphosphonocarboxylic), under the same conditions [39]. The second article used white tea extract in the inhibition of corrosion in carbon steel P110 in HCl 1 mol\(\cdot\)L\({}^{-1}\) solution. The inhibitor obtained efficiency of 90.2% [40]. In addition, no patent document was recovered with the combination of group C descriptors in the INPI source. However, some patents are described in Table 4 in which inhibitors are derived from plant extracts, such as: the use of cocoa almond bark (BR 10 2019 006077 8) of _Phyllantlus amarus [PERSON]_ leaves (BR 10 2014 031459 8), and Copaiba oil (BR 10 2014 022875 6), with efficiencies above 80%. In the Orbit database, 20 patent documents were recovered for the combination of group C descriptors. Details of these documents are set out in the Table 5.  
Patents reporting the use of corrosion inhibitors based on extracts such as leaves, seeds, fruit peels and roots, were found in the Web of Science and SciELO databases (group C). About 70% of these patents have been filed in the last four years; China is the country with the highest number of deposits, an expected result for the home country of 19, of the 20 largest players, in the area (Figure 4).
## 10 Soft Decision Cognitive Radio and Hybrid Overlay/Underlay Cognitive Radio Waveform Design
### Hybrid Overlay/Underlay  
For the soft decision CR, the waveform achieves benefits of both overlay-CR and underlay-CR waveforms by exploiting both _unused_ and _underused_ spectral regions. This is done by employing soft decision criteria at each distinct frequency component while minimizing the interference to primary users [170, 171, 172]. The expression in (97) represents the hybrid overlay/underlay waveform utilizing the SD-SMSE framework.
# Rapid Prototyping of Multi-Functional Battery Energy Storage System Applications
## 3 Related Work and Background
### Smart Grid Domain Standards  
The main concern of the current study is to employ information models from recommended international standards to derive an interoperable and flexible solution. Data models for the power system domain are outlined in the IEC Smart Grid Standardization Roadmap [17]. On this basis, a collection of standards mainly important to DER involved in BESS UCs has been gathered, resulting in the following list:  
* _IEC 61970/IEC 61968 Common Information Model (CIM)_: Its main concern is to ensure interoperability across power networks, [18]. Thereby, it offers a common semantic for EMS, Supervisory and Control Data Acquisition (SCADA) and power system topology. This is formally represented by a Unified Modeling Language (UML) model, including over 1300 classes.
* _IEC 61850_: It is mainly conceived to improve interoperability between IEDs in a power system substation; nowadays, it has been extended to DERs and power utility components among other areas [8]. Functional aspects of an IED are mapped into a Logical Node (LN). They are referenced in the standard IEC 61850-7-4 and extended by IEC 61850-7-420 [19], where functionalities of DERs such as inverters and batteries are modeled.
* _IEC 62325_: It provides a set of standards related to market communication using CIM, covering data models for market participants and market operators.
* _IEC 62056_: It applies mainly to smart home and data exchange for meter reading.
* _Open Platform Communications Unified Architecture (OPC UA)_: Since the EMS should support the exchange with other IEDs distributed along the power utility grid, the consideration of information models from the automation domain such as OPC UA is relevant. It is a standard of OPC foundation that focuses on exchanging real-time data within the process automation. It is platform-independent, thereby not tied to one operating system. It is standardized under IEC 62541, part 5 of that standard defines the information model (IEC 62541-5) [20].
# Efficient Transmit Antenna Subset Selection for Multiuser Space-Time Line Code Systems
## 4 Complexity Analysis
### Complexity Comparison  
In this work, \((N_{T},N_{S},K)\) indicates that \(N_{T}\) transmit antennas, \(N_{S}\) selected transmit antennas, and \(K\) users are used as system parameters. Remember that each user has two receive antennas, even for the MU-STLC systems. In Figure 1, the complexity of the proposed incremental and decremental TAS selection algorithms is compared with that of the greedy algorithm as a function of the number of selected transmit antennas for \(N_{T}=8\), where the number of users is assumed to be the same as that of the selected transmit antennas. It is deduced that for the small number of \(N_{S}(=2,3)\) in the \((8,N_{S},K)\) MU-STLC system with \(N_{S}=K\), the complexity of the conventional greedy-based algorithm is comparable to the proposed algorithms. As \(N_{S}\) gets higher, the complexity of the greedy algorithm significantly increases and the proposed incremental algorithm obtains a much smaller complexity than the greedy one. On the other hand, the decremental algorithm achieves the smallest complexity for large \(N_{S}\).  
Figure 2a-d illustrate the complexity of three TAS selection algorithms as a function of varying \(N_{S}\) for \((8,N_{S},4)\), \((16,N_{S},4)\), \((32,N_{S},8)\) and \((200,N_{S},32)\), and MU-STLC systems, respectively, where the number of users is invariant. For the small number of \(N_{S}(=4,5)\) of the \((16,N_{S},4)\) MU-STLC system in Figure 2b, the conventional greedy-based algorithm has lower complexity than the proposed MMSE decremental algorithm but higher complexity than the proposed incremental algorithm. Meanwhile, it can be observed that the proposed incremental algorithm significantly reduces the complexity of the greedy algorithm for larger \(N_{S}\). In addition, the rate of increase for the proposed incremental algorithm is much smaller than that of the greedy algorithm. On the other hand, the complexity of the decremental algorithm becomes lower as \(N_{S}\) increases. It is mainly due to reduction of \(C(N_{T},N_{S})\). Furthermore, it is found that the decremental algorithm can attain lower complexity than the proposed incremental algorithm when is greater than half of \(N_{T}\). It should be noted that the proposed algorithms conduct \(2\times 2\) matrix inverse operations in each incremental/decremental step, which is the main reason to offer a low complexity for large antenna dimensions, compared to the conventional greedy-based algorithm requiring \(2K\times 2K\) matrix inverse operations.  
Figure 1: The complexity of the proposed transmit antenna subset (TAS) selection algorithms as a function of \(N_{S}\) for \((8,N_{S},K)\) multiuser space–time line code (MU–STLC) system with \(N_{S}=K\).
## 4 Simulation Results and Discussion
### Experiments with CPNRA  
For our simulation environment, we used an Intel Core i7-8559U Processor system, with clock speed at 2.7 GHz, equipped with four cores and eight threads/core, for a total of 32 logical processors. In our simulations, each user is entitled of up to 4 CPUs, 4 GB RAM and 40 GB of system disk. We also set that one CPU is one CPU unit, 1 GB RAM is one memory unit and 10 GB disk is one disk unit. Thus, the demand (2 CPUs, 1 GB RAM and 10 GB disk) is translated into (2,1,1) and it is CPU-intensive and the demand (1 CPU, 3 GB RAM, and 20 GB disk) is translated into (1,3,2) and it is memory-intensive. In our experimental results, we used our CPN based simulator to study the effect of the job input rate control and the system utilization. Finally, we studied the average response time, that is the average time between a transition activation and the actual firing (triggering) that causes a system change. This particular study will be supported by some more mathematical background, which we give in this section for clarity and convenience.
## 3 Results and Discussion
### Volatile Composition of Single-Dose Espresso Coffee-Based Blends

Table 1: _Cont._
From the 390 volatile compounds putatively identified, ca. 26% (100 out of 390 volatile compounds) were determined for the first time in roasted coffee and/or in different types of coffee brews. These included 1 alcohol, 4 aldehydes, 18 esters, 7 furans, 10 hydrocarbons, 18 ketones, 1 volatile phenol, 3 oxazoles, 8 pyrazines, 2 pyridines, 1 sulfur compound, 12 terpenic compounds, 5 norisoprenoids, 3 thiazoles, and 7 thiophene compounds. The aroma descriptors of some of these compounds have already been noted, related mainly to fruity, sweet, and floral notes of esters, ketones, and norisoprenoids, and to herbaceous
# Imaging Electron Dynamics with Ultrashort Light Pulses: A Theory Perspective
## 2 Coherently Evolving Electronic System  
Nowadays, it is possible to trigger and observe coherent electron dynamics in atoms [3; 6], molecules [2; 4; 5; 35] and crystals [36; 37; 38; 39; 40], and even control the outcome of a simple chemical reaction [41]. Sub-femtosecond timing synchronization between pump and probe pulses required for observation of such dynamics has been achieved [3; 42]. It has been demonstrated that valence-electron wave packets can evolve with a high degree of coherence for much longer than 10 fs [3].  
Let us consider such coherently evolving electronic system that had been excited by a pump pulse into a coherent superposition of the electronic eigenstates at time \(t_{0}\). Its time evolution is given by  
\[|\Psi(t)\rangle=\sum_{I}C_{I}e^{-iE_{I}(t-t_{0})}|\Phi_{I}\rangle. \tag{1}\]  
Here, \(|\Phi_{I}\rangle\) are the eigenstates and \(E_{I}\) are the corresponding eigenenergies of the many-body Hamiltonian of the electronic system in the absence of an X-ray field, \(\hat{H}_{\rm m}\). We use atomic units for this and the following expressions. Since the purpose of this article is to discuss techniques that would allow probing such electron dynamics in real space and real time, we do not concentrate on a specific pump process giving rise to \(|\Psi(t)\rangle\). We assume that the pump and probe pulses do not overlap in time that makes it possible to describe the probe and the pump steps separately [43].  
The density matrix of this nonstationary electronic system given by  
\[\hat{\rho}^{m}(t)= |\Psi(t)\rangle\langle\Psi(t)| \tag{2}\] \[= \sum_{I,K}C_{I}C_{K}^{*}e^{-i(E_{I}-E_{K})(t-t_{0})}|\Phi_{I} \rangle\langle\Phi_{K}|\]  
contains time-dependent complex off-diagonal elements. The time-dependent electron density of the electronic system is given by the relation \(\rho(\textbf{r},t)=\textrm{Tr}[\hat{\psi}^{\dagger}(\textbf{r})\hat{\psi}( \textbf{r})\hat{\rho}^{m}(t)]\) resulting in  
\[\rho(\textbf{r},t)=\textrm{Re}\langle\Psi(t)|\hat{\psi}^{\dagger}(\textbf{r} )\hat{\psi}(\textbf{r})|\Psi(t)\rangle. \tag{3}\]
# Reconfigurable Formation Control of Multi-Agents Using Virtual Linkage Approach
## 4 Simulation and Results
### Formation Moving Using Virtual Linkage  
To illustrate the formation moving ability of the proposed virtual linkage approach, a simulation is carried out. In this simulation task, nine agents are required to align in a line formation with a uniform distance of 0.1 m and move around a circle with a radius of 1 m in 10 s. Therefore, the velocity and angle velocity \(v=\pi/5\ m/s\omega=\pi/5\ rad/s\) are specified to enable this task. The uniform distance of 0.1 m is specified to make the simulation results more easily comprehensible to readers.
# A Fault Analysis Method Based on Association Rule Mining for Distribution Terminal Unit
## 7 Discussion  
The proposed method was intended for enhancing the efficiency of DTU maintenance work. Constructing a fault rule base and diagnosis rule base can support planned maintenance and fault repairing. This method showed a good performance in terms of lowering fault incidence and shortening fault elimination time. These improvements were due to the prevention of potential fault causes and guidance for fault repairing. Nonetheless, the proposed method also had some limitations:  
1. Its performance was affected by the amount of available data.  
As shown in Figure 8, insufficient data limited the improvement of this method. It is reasonable since this is a data-driven method which required a certain amount of data to achieve satisfactory results.
2. Results were not always reliable.  
Since fault data was updated according to the real-time operation of DTU devices, newly generated rules were probably not in the initial rule bases and some of them might have been unreliable. Therefore, these new rules must be verified before they are incorporated into rule bases. Additionally, strong rules founded by association rule mining algorithms were sometimes redundant and repetitive; in this case, manual inspection is indispensable.