esa-sceva/satcom-chunk-collection huggingface dataset:
## 3 Concepts and Definitions
### Linguistic Text Processing  
Text processing operators not only help to improve the quality of results of _automatic_ M2M transformations but also speed up the process of _semi-automatic_ transformations by adding a degree of automation to text analysis, which would otherwise have to be performed by a user himself. In this section, we apply a set of linguistic text processing operators that improves text processing tasks; these operators were previously introduced in [38].  
The following operators were defined for the linguistic text processing in the UML UCM \(\rightarrow\) SBVR BV approach:  
* EXTRACTNOUN(_phrase_, _'all'_)--extracts nouns/noun phrases from the _phrase_. If the second parameter is set to _'all'_, all possible nouns/noun phrases will be extracted; otherwise, the most general noun phrase will be extracted;
* EXTRACTVERB(_phrase_)--extracts a verb wording from the _phrase_;
* CONCAT(_phrase_,...)--concatenates multiple text phrases, including the names of the source elements or conventional text chunks (which are represented using single quotes such as _'text'_).  
In this paper, we did not consider advanced NLP functionality as one of our objectives. Therefore, we present the simplified versions of EXTRACTNOUN() and EXTRACTVERB0), which were applied for text processing in this paper:  
* EXTRACTVERB() is simplified to extracting the first word in the phrase, relying upon the fact that this operator will mostly be applied for processing Use Case element names, which are considered to be named using the pattern <VERB><NOUN>!NOUN PHASE>. This pattern is generally considered as a good naming practice for naming activity-like UML model elements, such as use cases in use case diagrams or activities in activity diagrams.
* EXTRACTNOUN() is simplified to extracting the remaining part of the given phrase.  
These restrictions do not impact evaluation results presented in this paper as the focus lays on the _structural soundness_ of the transformation output. In other words, we seek to verify if a correct number of corresponding target elements are generated, rather than _semantic soundness_, which aims at verifying the semantic validity of the acquired output (e.g., whether the label _actually_ represents a valid noun phrase or a verb phrase).
# WiFi FTM, UWB and Cellular-Based Radio Fusion for Indoor Positioning
## 3 Materials and Methods
### Multi-Technology Fusion  
In trilateration the ranging information usually comes from a single technology. However, in [10], a scheme for fusing ranges from different technologies is presented. The use of multi-technology fusion in trilateration improves low-precision accuracy provided by technologies (in this work, LTE) by using the ranges of precise technologies, such as UWB or WiFi FTM.  
In addition, to enhance the end-user location precision, multi-technology fusion also provides a seamless navigation between areas served by different technologies (e.g., exteriors where GNSS can be used, and interiors with UWB deployments, using other ranging technologies, such as LTE to cover for the missing ranges in the borders). Fusion benefits from high-precision reference points in a sparse deployment which can help to improve location in emergency cases, such as fires, earthquakes, etc. In these scenarios, fusion can also compensate the missing AP structures with portable APs in order to provide high-precision localisation. Although in this paper we have set the focus on WiFi FTM and UWB for precise positioning, other technologies which provide high-precision ranging data could also be used, such as GNSS or Bluetooth.  
Figure 1: Flowchart of the system.
# Designing a Vertical Handover Algorithm for Security-Constrained Applications
## 4 Performance Evaluation and Results Discussion
In conclusion, it is important to consider the important factors affecting the VHO process, such as the required data rate for a running application, bandwidth, velocity of the MU, RSS, SINR, user preferences, etc. These factors highly influence the VHO process. Figure 6: Analysis of packet loss during the mobility of MUs in the simulation scenario.
### Simulation Results
#### 4.5.2 Real Traffic Settings  
The fixed maximum speeds used in the above simulations are unrealistic assumptions. The reason behind this assumption is that it is not efficient to set the maximum speed of each road segment. In addition, the maximum driving speed of a vehicle in a road segment can vary dramatically in different periods (e.g., rush hours and non-rush hours). To ensure the usefulness of our results, we obtained data from the website of the Taipei Traffic Control Center [41]. The website reports data from a large number of vehicle detectors (VD) deployed throughout the city. Each VD provides real-time traffic information on lane numbers, average numbers of vehicles per time unit, and average vehicle speeds. We collected the information provided by the VDs deployed in the geographic area shown in Figure 7. The average speed data at a rush hour (6 p.m. on 24 September 2014) were used to set maximum speeds for the corresponding road segments.  
EV travel times for three simulation sets using real traffic data are shown in Figures 14-16. The maximum speeds below 40 km/hour reflect the rush hour scenario, thus explaining the longer travel times compared to those in Figures 10-12. However, the same relationships among the various method combinations are similar. Similar relationships were also found for a non-rush hour scenario (1 p.m. on the afternoon of the same date), therefore those data are not presented.
## 4 Evaluation and Results
### Application Performance  
We stated that 2.8 Mpps show a limit in the mechanism of a straightforward firewall. The identical number of requests processed per minute per server instance achieves a throughput of 6.35 Mpps utilising a complier that tries to minimize or maximize some attributes of an executable program. For all packet sizes, hXDP offers a 10\(\times\) reduction  
\begin{table}
\begin{tabular}{c c c c c} \hline \hline \(\mathbf{S}\)**No.** & **Program** & **Instruction** & **X86** & **hXdp** \\ \hline
1 & Xdp1 & 77 & 2.18 & 1.65 \\ \hline
2 & Xdp 2 & 60 & 2.22 & 1.69 \\ \hline
3 & Xdp tail & 115 & 2.32 & 2.69 \\ \hline
4 & Ipv4 & 117 & 2.31 & 2.31 \\ \hline
5 & rxq info & 80 & 2.74 & 1.75 \\ \hline
6 & Ip & 281 & 2.34 & 2.76 \\ \hline
7 & Katran & 267 & 2.31 & 2.61 \\ \hline
8 & Firewall & 70 & 2.28 & 2.55 \\ \hline \hline \end{tabular}
\end{table}
Table 4: Instruction per cycle and IPC.  
Figure 6: Impact of code optimization eBPF bytecode.  
Figure 7: Very long instruction word inputs varying with no. of execution lanes.  
in processing delay (see Figure 8). Since h\(\times\)DP does not cross the PCI or provide lower latency and higher data transfer rates than parallel buses such as PCI and PCI-X, this is the situation. The header and metadata are delivered to a flow processing, while the payload is forwarded to one of the memories in the displayed programmed express data path software, which solely conducts relaying of packets from one segment to another by nodes in the network. Despite the fact that it cannot be executed, the eBPF software offload solution provides a foundation for high performance, kernel complaint firewalls, DDoS protection, and load balancing. Even in this scenario, it is clear that h\(\times\)DP offers a transmission capacity delay, particularly at
When executed, it seamlessly integrates with the standard hydroacoustic modem software, transforming the modest hydroacoustic modem from a basic simplex digital communication device into a fully functional network communication node. This paper makes the following contributions:  
* A model for constructing hydroacoustic networks that allows taking into account potential implementations with modems from different manufacturers as nodes in this network. * Creation of a software platform for developing and configuring proprietary algorithms for transmitting data via a hydroacoustic communications channel, which enables the modification of the existing algorithms and the inclusion of new communication techniques to achieve optimal settings for information transfer underwater. * Presentation of a comparative evaluation of network performance with and without different protocols, allowing the assessment of data transfer rates and the probability of successful delivery. The article is organized as follows. Section 2 highlights the versatility of the software network add-in, demonstrating its ability to \"unlink\" from execution on specific hardware and software platforms of the hydroacoustic modem. It also explores the potential for modifying the existing protocols within the access control layer and data routing protocols. Section 3 considers the concept of constructing the EviNS software framework. Section 4 provides details on the implementation of network and link layer protocols, which enable data transmission even in conditions of relatively low network dynamics while minimizing energy consumption per unit of data delivered to the recipient. Finally, Section 5 presents the findings from experimental studies, followed by a discussion of the results and conclusions.
## 1 Introduction
The STARFM considers both the discrepancy of space and spectrum reflectance difference from multi-temporal MODIS images and has been widely introduced to produce high spatial-temporal data for detecting gradual changes over large areas [3; 25; 28; 29]. However, several limitations for STARFM should be noted: it is incapable of estimating the transient or mutated surface changed information which is not captured by the base Landsat images [25; 28; 30]. STARFM also depends on temporal information from pure homogenous patches of land cover at the MODIS pixel scale and the predicted results can be misleading when used in heterogeneous landscapes, including cases of small-scale agriculture [25; 28]. Many improvements of data spatial-temporal fusion models were conducted for STARFM. The Spatial Temporal Adaptive Algorithm for Mapping Reflectance Change (STAARCH), developed by [PERSON] _et al._[28], was designed to detect the date on which land-cover change occurs and to record this information in a Landsat image to improve the final predicted result of the original STARFM approach [26; 30]. For the latter limitation of STARFM, it is more difficult to find the pure MODIS pixels for central pixels in the fragmented area due to low resolution of MODIS when there are multiple land covers within one pixel. [PERSON] _et al._[30] also attempted to develop an Enhanced STARFM method (ESTARFM) for heterogeneous landscapes regions, which introduces a conversion coefficient to succeed in enhancing the performance of prediction for heterogeneous landscapes. However, the precondition of at least two pairs of fine and coarse spatial resolution images on the same day for this method increases the difficulty of data acquisition and limits its applicability [30]. To resolve the difficulties that STARFM presents from the mixed pixel of MODIS in heterogeneous regions, we developed an improved STARFM named Unmixing-based STARFM (USTARFM) with the help of an Unmixing-based algorithm. The main objectives of this study include: (1) improve the performance of STARFM in heterogeneous areas, through unmixing the coarse pixel to gain specific land cover reflectance as the basis for further fusion rather than directed resampled data; (2) compare the fusion results of USTARFM and STARFM at different window sizes, and (3) assess the influence of landscape heterogeneity on the fusion performance of USTARFM. The USTARFM approach was applied to generate Landsat-like resolution and MODIS-like frequency images, and was tested using the Landsat 8/7 and MODIS reflectance as the reference data in two study areas.
# A Study on the Design and Control of the Overhead Hoist Railway-Based Transportation System
## 1 Introduction
Compared to other transportation systems, Telelift's monorail system is designed to bend with the help of complex cable tray profiles. Skyrav is the newest overhead hoist transport system created by Murata Machinery USA, Inc. [11]. The overhead transport provided by Skyrav allows for the provision of different collection and deposit points; it is clearer, with a contactless power supply and more space-efficiency than other transport systems. The Murata system is made up of a double rail and does not have the modules curving along the vertical axis. In addition, the research of [PERSON] et al. supplies a new method for indoor transport and mobile manipulation by applying the Omni-wheels and continuous overhead manipulation [12]. Swarmrail Robot commutes on the rail structure, which has no transfer rails module but intersections instead. With 8 Omnibreels, the Swarm Rail Robot changes direction at an intersection. However, all of the mentioned systems (Telelift, Skyrav, or Swarm Rail) operate on a direct power supply, and the mechanism of OHTs is still complicated and only applies to large-scale factories or warehouses. The aim of this research is to develop a new mechanical and controller design that can be utilized in both large and small-scale factories in Vietnam. The concept of modulation is used in the mechanics and controller system, making it possible to extend the scale with more stations or shuttles. In addition, the location detection method and algorithms in the controller design are also proposed to control this system. In particular, the explanation will focus on a realistic mechanical model and a queueing algorithm. This has only been a closed-looped system in the initial phase. The article is divided into seven sections: Section 2 introduces the basic concepts of mechanical and controller design. Details of the mechanical, electrical, and electronic design as well as the difficulties of the problem of design are provided in Section 3. Section 4 explains the algorithm used to control two major modules and the system sub-function. Section 5 shows the results of the primary simulation with respect to four different cases. Sections 6 and 7 provide descriptions of the algorithm's conclusions and a discussion about the experimental results. Section 8 exposes the final conclusions and the directions for future work.
## 2 Related Work
Shamir Secret Sharing [31] is an early information protection threshold cryptographic scheme based on polynomial interpolation. This allows the dealer to distribute partial secrets (\(s_{1},s_{2},\dots\)\(s_{n}\)) of secret \(S\) to \(n\) parts such that minimum \(t<n\) is required to reconstruct secret S. This assumes the dealer is trusted, generates valid partial secrets, and ensures that partial secrets can be securely communicated to a node. This scheme does not reveal any information to fewer than \(t\) participants and minimizes share size. In addition, it allows update/change shares while maintaining the secret or changing the threshold. However, in this method, there is no way to validate the partial secret share received by an entity is a valid partial secret. The Verifiable Secret Sharing (VSS) schemes, first introduced by [PERSON] and [PERSON] [32], and then, by [PERSON] et al. [33], were further developed by [PERSON] [34]. They enable participants to validate shares received from a semi-trusted dealer and detect any malicious changes during the transfer. Identity-Based public key management schemes utilize a node's unique identity as a part of its public key, which could be software-based such as IP address and email or hardware-based Physical Unclonable Functions (PUFs) [35; 36]. This eliminates the need for a certificate to validate the public keys. [PERSON] presents a scalable solution [37] for ID-based cryptography, which includes an ID-based encryption scheme where the sender encrypts a message using a public key derived from the recipient's unique identity. The receiver then decrypts the message using a private key obtained from a key generation center (KGC), which corresponds to the recipient's identity. [PERSON] proposed an ID-based certificateless public key framework [14] based on standard (discrete logarithm) assumptions. This scheme is based on [PERSON]'s VSS scheme [34] and was discussed earlier in the section. Dealers use VSS to create partial shares and commitments, which act as a private group key. The generated partial share is securely transferred to devices, and it will become the device's private key. This will be the foundation of the proposed key exchange protocol, and these concepts will be explored further later in this work.
# Enhanced Steganography for High Dynamic Range Images with Improved Security and Capacity
## 3 Proposed Scheme
### Phase 2: Embedding  
The embedding procedures are analogous to those delineated in [PERSON] et al.'s scheme and, accordingly, are briefly introduced below.  
Step 1. For a \(P(R,G,B,E)\) in RGBE format, its homogeneous representation group (HRG\({}_{P}\)) elements are determined, and its corresponding homogeneity value (\(HV_{P}\)) for this pixel is defined as the number of elements in the homogeneous representation group.  
Step 2. Every element in the HRG is sorted according to the value represented in the exponent channel in ascending order, and an index is assigned to each sorted element. This enables the definition of a homogeneity index (HI) for every sorted element in HRG, with the HI\({}_{P}\) having a range from 0 to (\(HV_{P}\)-1).  
Step 3. Upon determining the homogeneous group and the homogeneity value of a pixel \(K\), HV\({}_{K}\), the pixel capacity in bits is computed, denoted as C\({}_{K}\), as shown in Equation (4).  
\[\text{C}_{K}=\lfloor\log_{2}\text{HV}_{K}\rfloor \tag{4}\]  
Step 4. The homogeneity index table (Table 2) is utilized to facilitate the embedding process of the cover pixel \(K(R,G,B,E)\). Depending on its homogeneity value HV\({}_{K}\), the numbers of bits that can be conveyed are listed in the first column of Table 2. In the third column, the bit patterns of the secret message that can be concealed, corresponding to different homogeneity indices, are described. By referring to Table 2, the cover status C(HV\({}_{K}\), HI\({}_{K}\)) can be modified, and the status of the cover pixel, which is changed to the stego status S(HV\({}_{K}\), HI\({}^{\prime}\)\({}_{K}\)), is recorded. This indicates that a desired bit pattern of the secret message has been conveyed by the stego pixel. If the homogeneity value (HV\({}_{K}\)) is less than or equal to 1, this pixel cannot convey any secret message.
# A Survey of Wi-Fi 6: Technologies, Advances, and Challenges
## 10 Open Challenges with Wi-Fi 6
### Challenges
#### 10.1.3 Interoperability  
There are many different Wi-Fi access points on the market as well as Wi-Fi **NIC**s. An implementation must conform with interoperability tests to be standard-compliant. However, each vendor may implement additional proprietary algorithms, e.g., for time measurement [212; 213] or for the contention window distribution [214]. For this reason, predicting the behavior of a multi-vendor Wi-Fi deployment is challenging.  
More importantly, today's firmwares are not open access; therefore, there is limited control of the scheduling process, the MCS selection, or MU MIMO. Researchers need to access the firmware and low-level features to identify the pathological situations and provide algorithms or protocols to tackle the identified problems. Moreover, orchestrating a large deployment from different vendors is difficult and the results would likely be suboptimal.  
It is also essential to have a standardized API to control the behavior of the access point. Ideally, the architecture should be sufficiently flexible to accommodate novel algorithms and protocols to support novel features. [PERSON] et al. [215] paved the way for network agility with OpenRoods consisting of three layers (flow, slicing, and controller). Although this solution focused on the SDN architecture, features to control the specific Wi-Fi 6 mechanisms would be helpful.  
Backward compatibility brings specific challenges. In particular, CSMA/CA is still used by an access point to compete with other nodes to access the channel. A Wi-Fi 6 access point can receive the same amount of time as legacy Wi-Fi nodes, which significantly reduces the bitrate and causes unfairness. This situation may be similar to the performance anomaly problem in [216]. It can also cause collisions and long delays [86].  
The main advantages of Wi-Fi networks are the implementation simplicity and lower deployment costs. However, the implementation complexity increases with the new Wi-Fi generations Wi-Fi 6 and Wi-Fi 7, which also increases costs. Their level of complexity is approaching that of LTE networks.
## 3 Methodology and Results for Testing the Accuracy of Measurements
\begin{table}
\begin{tabular}{c c c c c c c c} \hline \hline \multirow{2}{*}{**Values of Statistics**} & \multicolumn{2}{c}{**\(\mathbf{\delta_{x}\pm d/2}\)**} & \multicolumn{2}{c}{**\(\mathbf{\delta_{y}\pm d/2}\)**} & \multicolumn{2}{c}{**\(\mathbf{\delta_{H}\pm d/2}\)**} & \multirow{2}{*}{**PDOP\({}_{\mathbf{min}}\)**} & \multirow{2}{*}{**PDOP\({}_{\mathbf{max}}\)**} \\ \cline{2-2} \cline{5-8}  & \multicolumn{2}{c}{**[m]**} & & **[m]** & & **[m]** & & \\ \hline \(min\) & \(-0.0171\) & \(\pm 0.0051\) & \(0.0059\) & \(\pm 0.0005\) & \(-0.0068\) & \(\pm 0.0012\) & 1.687 & 1.873 \\ \(max\) & \(0.0238\) & \(\pm 0.0035\) & \(0.0306\) & \(\pm 0.0046\) & \(0.0330\) & \(\pm 0.0109\) & 3.920 & 6.579 \\ \(AV\) & \(0.0011\) & \(\pm 0.0018\) & \(0.0247\) & \(\pm 0.0012\) & \(0.0141\) & \(\pm 0.0030\) & 2.418 & 3.733 \\ \(SD\) & \(0.0081\) & \(\pm 0.0018\) & \(0.0054\) & \(\pm 0.0008\) & \(0.0105\) & \(\pm 0.0020\) & 0.601 & 1.208 \\ \(V\) & \(717.1\%\) & \(98.4\%\) & \(21.8\%\) & \(\pm 67.9\%\) & \(74.6\%\) & \(\pm 67.0\%\) & \(24.9\%\) & 32.4\% \\ \hline \hline \end{tabular}
\end{table} 
Table 10: Basic statistics for systematic errors of measurements together with the length of confidence intervals (d/2) at the confidence level of 0.95 and the minimum (PDOPmin) and maximum (PDOPmax) values of PDOP parameters for each series. \begin{table}
\begin{tabular}{c c c c c c c c} \hline \hline \multirow{2}{*}{**No of Series \(j\)**} & \multicolumn{2}{c}{**A**} & \multicolumn{2}{c}{**B**} & \multirow{2}{*}{**Number of Measurements**} \\ \cline{2-2} \cline{5-8}  & \(\pm m_{\Delta x}\) & \(\pm m_{\Delta y}\) & \(\pm m_{\Delta h}\) & \(\pm m_{v_{x}}\) & \(\pm m_{v_{y}}\) & \(\pm m_{v_{h}}\) \\ \cline{2-2} \cline{5-8}  & **[m]** & **[m]** & **[m]** & **[m]** & **[m]** & **[m]** \\ \hline
1 & 0.009  
Table 12 summarizes the basic numerical characteristics of the obtained average errors of a single measurement.
## 5 Case Study: Smart Conservation of Cultural Heritage
### Reasoning in a Smart Cultural Heritage Space
#### 5.2.4 Application Module  
The actuation process is not performed by the middleware since the application is responsible for performing such actions based on the reasoning output. Thus, an application module is also implemented, which takes high-level information and acts upon it. The necessary actions for the preventive conservation of CH are performed in this module, which is executed independently. For example, the application module checks whether the temperature of a room is appropriate, whether visitors are keeping a safe distance from artifacts or whether a room is crowded, thus any more visitors should be avoided. The inference engine of the application module follows _if-then_ logic, also taking into consideration the probability score tagged to contextual information. Thus, a low probability event may not trigger the equivalent action depending on other parameters, such as temporal restrictions.  
The implemented application module addresses the necessity for the automated preventive conservation for cultural spaces. Other applications that could be built on top of the existing middleware may perform personalized visits, recommendation services, management and optimization of exhibitions, etc. The open architecture of the proposed infrastructure allows the interconnection with any number of applications that require contextual information.