esa-sceva/satcom-chunk-collection huggingface dataset:
### The Purpose of This Article  
The purpose of this article is to present a method for the application of cryptography to protect three types of cardio data: ECG, photoplethysmographic signal (PPG), and Holter. The encryption procedure is performed after compression of the studied data and performing a wavelet transform (WT) on the resulting sequence. The proposed encryption procedure aims to offer good protection of the three types of cardio signals when creating an archive of the used ECG, PPG, and Holter records, obtained in the study of cardio records from patients with various cardiovascular diseases and a healthy control group. The created algorithm is implemented in software in a Microsoft Visual C++ programming environment as a standard software application. Mathematical analyses of the conducted researches have been made and evaluation characteristics have been determined.  
This study analyzes the effectiveness of the individual steps in implementing the applied cardio data protection procedure (using parameters to evaluate the effectiveness of the algorithms used in the procedure) and to compare the values of the parameters of the output signal with those of the input signal for all three types of cardio data.  
Another research task of the article is to make an analysis of the influence of the length of the watermark, the choice of specific wavelet basis (Haar, Db4, Db8, Db12, and Db16 wavelet basis were studied), and the choice of method for processing threshold coefficients on the estimating parameters of the output-transformed cardio signal. The results of the research are presented parametrically and graphically.  
The rest of this paper is organized as follows. Section 2 presents the technology used in this study and the proposed method for protecting cardiac data from possible attacks and attempts at unauthorized access. Section 3 shows the results obtained by applying the described method on three types of cardio data and presents the comparative analyses. Finally, Sections 4 and 5 provide the final remarks in the form of discussion and conclusions, respectively.
# A Scheme for Controlled Cyclic Asymmetric Remote State Preparation in Noisy Environment
## 2 Four-Party Controlled Cyclic Asymmetrical RSP Protocol of Sequentially Increasing Qubits States
### Preparation of Quantum Channel  
The quantum channel in the simplest case is a ten-qubits entangled state shared by the sender [PERSON], [PERSON], [PERSON] and the receiver [PERSON], which can be realized by Hadamard (H), Controlled-NOT (CNOT) operations and Pauli X, Y, Z gates in \"IBM qasm Simulator\".  
Firstly, the product state of ten-qubit states initialized to \(\left|0\right\rangle\) is used as the input state \(\left|\varphi_{0}\right\rangle\) in the quantum circuit, which can be expressed as:  
\[\left|\varphi_{0}\right\rangle=\left|0\right\rangle_{1}\otimes\left|0\right\rangle _{2}\cdots\otimes\left|0\right\rangle_{10} \tag{2}\]  
Then, performing H gates on qubits (1, 5, 8, 10), and then the input state \(\left|\varphi_{0}\right\rangle\) is converted to \(\left|\varphi_{1}\right\rangle\) as follows:  
\[\left|\varphi_{1}\right\rangle=(\left|0000\right\rangle+\left|1000\right\rangle )_{1234}\otimes(\left|000\right\rangle+\left|100\right\rangle)_{567}\otimes( \left|00\right\rangle+\left|10\right\rangle)_{89}(\left|0\right\rangle+\left|1 \right\rangle)_{10}. \tag{3}\]  
Several CNOT operations are performed on the following qubit pairs (1,2), (1,3), (1,4), (5,6), (5,7), (8,9). When qubit 10 is \(\left|1\right\rangle\), qubits 3, 4, 6, 7, and 9 are performed Pauli X gate operation, and qubits 1, 5, and 8 are performed Pauli Z gate operation. Afterwards, the quantum channel is reconstructed as Formula (1).  
Then, [PERSON], [PERSON] and [PERSON] respectively performing CNOT operation on qubits pairs (9, _a'_) (5, _b'_), (1, _c'_), qubits 9, 5, 1 control auxiliary qubits _a'_ and _b'_, _c'_. We get the thirteen-qubits target channel and it can be described as follows:  
\[\begin{array}{l}\left|\varphi^{{}^{\prime}}\right\rangle_{12345678910^{ \prime}}\left|0\right\rangle_{2}\left|0\right\rangle_{2}\left|0\right\rangle _{2}\left|0\right\rangle_{2 Theoretically, the distribution probability of each quantum state in the target channel is 0.0625 in ideal case. Based on the Figure 2b, we calculate that the standard deviation of the average probability distribution is 0.002. The diversity in mean probability and ideal case is due to the decoherence effects and gate errors.
## 2 Literature Review
### 31 nSat--Italy  
The Train Integrated Safety Satellite System--_31 nSat_--was developed in Italy by Ansaldo STS in cooperation with other foreign partners. The project was finalized in 2014, and the designed system is used on a regional single-track line in Sardinia with a total length of 50 km. The system also uses RCB for data collection and for train drive permits. The information about vehicle position is obtained from satellite navigation (GPS EGNOS and Galileo) and from an odometer. GSM, TETRA (Trans-European Trunked Radio) systems, and satellites are used for the transmission of information. The architecture is based on ETCS L2 [21; 22]
# Dynamic Online Label Distribution Feature Selection Based on Label Importance and Label Correlation
## 2 Related Work
### Label Correlation  
In the past few years, researchers have proposed various methods to improve the recognition rate of annotation labels by classifiers. By incorporating label correlation, a large number of studies have convincingly demonstrated that exploiting label correlation can significantly improve classifier performance. For example, in the Movie dataset, we often observe that \"science fiction\" movies tend to be associated with the \"adventure\" label, while some movies also have the \"humor\" label. This pattern of co-occurrence between \"science fiction\" and \"adventure\" signals the global label correlation between them. In addition, the frequent co-occurrence of \"adventure\" and \"humor\" in some movies also indicates the local correlation between them. A deeper understanding of the relationships among labels can provide guidance for building more accurate multi-label classifiers. The method proposed by [PERSON] et al. [40] simultaneously handles complete and missing labels, exploiting global and local label correlations by learning latent label representations and optimizing label manifolds. However, these methods may still have a limited ability to handle missing labels.
## 2 Related Work and Theoretical Foundations
### Theoretical Foundations of Patricia Tries  
The foundational analysis of Patricia tries to establish their core properties and performance characteristics. [PERSON] et al. (1989) [5] proved that for binary Patricia tries, the variance of external path length asymptotically equals \(0.37\ldots n+nP(\log_{2}n)\), where \(n\) is the number of stored records. This result demonstrated that external path length is asymptotically equal to \(nP(\log_{2}n)\) with high probability, providing the theoretical basis for trie efficiency.  
[PERSON] (1992) [6] extended this analysis by examining balance properties under different input distributions, while [PERSON] et al. (2016) [9] introduced a smoothed analysis model showing that under perturbation conditions, the smoothed heights of both tries and Patricia tries are in \(\Theta(\log n)\). These results established the theoretical framework for understanding trie behavior under various conditions.  
[PERSON] (2002) [10] established fundamental probabilistic properties of Patricia tries, proving that trie height normalized by its expectation converges to one in probability. His work provides crucial tail inequalities for various trie metrics, including height, depth, and internal path length, applicable to arbitrary string distributions.  
[PERSON] et al. (2002) [11] introduced an innovative, dynamic construction algorithm for Compact Patricia tries using a hierarchical structure. Their approach achieved 40 times faster updates and 35% better memory efficiency compared to traditional methods, particularly effective for large-scale key sets.  
[PERSON] and [PERSON] (2022) [12] developed a self-stabilizing protocol for Hashed Patricia Tries, enabling efficient prefix search with O(\(\log\!\mid\!\!\mid\!\!\mid\)) complexity. Their work demonstrates how to maintain structural integrity in distributed environments while ensuring optimal memory usage of \(\Theta\)(d) bits for storing keys.
## 4 Experimental Setup and Evaluation
### Area Selection for Case Study  
For the case study, the urban region of Kathmandu metropolitan city, Nepal, around New Baneshwor, Old Baneshwor, and Gaushala region bounded by the longitude, latitude points (85\({}^{\circ}\)19\({}^{\prime}\)42\({}^{\prime\prime}\) E, 27\({}^{\circ}\)41\({}^{\prime}\)24\({}^{\prime\prime}\) N), (85\({}^{\circ}\)19\({}^{\prime}\)42\({}^{\prime\prime}\) E, 27\({}^{\circ}\)42\({}^{\prime}\)29\({}^{\prime\prime}\) N), (85\({}^{\circ}\)20\({}^{\prime}\)55\({}^{\prime\prime}\) E, 27\({}^{\circ}\)41\({}^{\prime}\)24\({}^{\prime\prime}\) N) and (85\({}^{\circ}\)20\({}^{\prime}\)55\({}^{\prime\prime}\) E, 27\({}^{\circ}\)42\({}^{\prime}\)29\({}^{\prime\prime}\) N) is selected. The total area is 2 km \(\times\) 2 km (4 km\({}^{2}\)). For Scenario II, the suburban region around Tarakeshwor and Tokha municipalities, Nepal, has an area of 4 km \(\times\) 4 km (16 km\({}^{2}\)), is selected for the case study. The area is bounded by the longitude latitude points (85\({}^{\circ}\)17\({}^{\prime}\)33\({}^{\prime\prime}\) E, 27\({}^{\circ}\)44\({}^{\prime}\)52\({}^{\prime\prime}\) N), (85\({}^{\circ}\)17\({}^{\prime}\)33\({}^{\prime\prime}\) E, 27\({}^{\circ}\)47\({}^{\prime}\)02\({}^{\prime\prime}\) N), (85\({}^{\circ}\)20\({}^{\prime}\)55\({}^{\prime\prime}\) E, 27\({}^{\circ}\)44\({}^{\prime}\)52\({}^{\prime\prime}\) N), and (85\({}^{\circ}\)20\({}^{\prime}\)55\({}^{\prime\prime}\) E, 27\({}^{\circ}\)47\({}^{\prime}\)02\({}^{\prime\prime}\) N). In both scenarios, the performance evaluation of both cases i.e., Case I (5G greenfield) and Case II (5G using 4G infrastructure) is carried out and analyzed.
# Optimizing the Quality of Service of Mobile Broadband Networks for a Dense Urban Environment
## 2 Theoretical Background  
Mobile broadband (MBB) and wireless networks are increasingly impacting the economies of nations across the globe. MBB has created efficient business environments through effective communications and connectivity [19]. The World Bank also reckons that internet broadband has the propensity to create opportunities and avenues for job creation, helping developing countries to attain strategic development goals (SDGs) [20]. In Nigeria, the MBB market saw a leap from 400,000 to 92 million active subscribers between 2001 and 2016. Surprisingly, with over 48% of the entire population as active MBB subscribers, the reduced price of mobile phones is not the only factor responsible for the widespread adoption of wireless technologies. The endless desire for connection, the explosion of the internet, and gaming, among other reasons, are why people gravitate toward using MBB networks such as 4G LTE.  
However, it is important to note that the exponential growth in the number of MBB subscribers in Nigeria has not always been the same in recent years. Following the liberalization policy reform of the Nigerian telecommunication industry in 2001, investments in wireless infrastructure have witnessed sporadic increases, which have only multiplied as more subscribers join different MNOs. Were it not for the poor wire/wireless internet infrastructure deployment in the country, which makes it difficult for the newest technologies such as 5G to be easily implemented, there is no telling the economic and sociological impact that wireless technologies could have in Nigeria. In the struggle towards better connection and communication in Nigeria, over 95% of internet connection is done over mobile broadband, which is led by major network providers such as MTN, Etisalat, Global Communication (GLO), and Airtel. The market was estimated to contribute over $6 billion to the national GDP in 2016. With such a level of impact, it is, therefore, necessary for network services such as the 4G LTE used in the nation to be optimized while plans are made for deploying 5G in the near future.
# An Active Path-Associated Cache Scheme for Mobile Scenes
## 3 The Proposed Approach  
The network background of the method proposed in this paper is the MobilityFirst network architecture. MobilityFirst is a future network architecture funded by the National Science Foundation [28]. It aims to directly solve the challenges of large-scale wireless access and mobility. Its main design concepts include the separation of names and addresses, globally unique identifiers of content objects, global name resolution services to bind names and addresses, and so on. These characteristics make MobilityFirst naturally support mobility. Our proactive caching strategy is a scheme that relies on ICN caching to enhance user experience in mobile scenarios.  
In the WIFI mobile scenario, user movement brings new challenges to the original cache strategy of ICN, so this section mainly discusses the design of a new cache strategy in the mobile scenario. Our overall caching architecture is to first select the target AP set for mobile user migration (in the following, we refer to the target AP set as a neighbor AP set) and then select the appropriate node cache on the path from the source AP to the target AP. A simplified network scenario is shown in Figure 1. When no movement occurs, the user and the content server communicate and cache the content according to the red path in Figure 1. Our active caching strategy is triggered when the user moves, and our designed path cooperative caching strategy will cache valuable content along the blue path. In this section, we first introduce how to select the target AP from a theoretical perspective, i.e., the neighbor AP selection mechanism in the WiFi mobile scenario. Then, in the next section, based on our neighbor AP selection mechanism, we further propose a cooperative caching mechanism on the path.  
Figure 1: The network scenario.
## 3 Wireless Localization Technology
### Range-Free Techniques  
Range-based technologies can have limitations in terms of accuracy as wireless signals are influenced by various factors such as distance, spatial structure, humans, objects, temperature, humidity, etc. In contrast, range-free technologies estimate the location of a device by using pre-existing information, rather than relying solely on the physical factors of the wireless signal.
# Resilience Evaluation of Multi-Path Routing against Network Attacks and Failures
## 3 Problem Statement
### Single Path or Multi-Path Routing
#### 3.1.1 Single Path (SP)  
SP routing is provided by the current Internet architecture. It lacks rapid mitigation mechanisms to counter Internet hazards, such as network congestion or link failures. For example, multihoming is connected to multiple providers, and the edge routers of the network communicate with the providers using a dynamic routing protocol. If one of the links fails, the protocol re-configures its routing tables for a new single path.
# Hardware Model Checking Algorithms and Techniques
## 2 Background and Notation
### Temporal Logics
#### 2.9.1 Linear Temporal Logic
We give the following inductive definition of when \(\boldsymbol{\pi}\) satisfies \(\psi\), denoted as \(\boldsymbol{\pi}\models\psi\):_  
* \(\boldsymbol{\pi}\models\top\) _and_ \(\boldsymbol{\pi}\
ot\models\bot\)_._
* _For each_ \(p\in AP\)_,_ \(\boldsymbol{\pi}\models p\) _iff_ \(p\in L(\boldsymbol{\pi}[0])\)_._
* \(\boldsymbol{\pi}\models\
eg\psi_{1}\) _iff_ \(\boldsymbol{\pi}\
ot\models\psi_{1}\)_._
* \(\boldsymbol{\pi}\models\psi_{1}\wedge\psi_{2}\) _iff_ \(\boldsymbol{\pi}\models\psi_{1}\) _and_ \(\boldsymbol{\pi}\models\psi_{2}\)_._
* \(\boldsymbol{\pi}\models\psi_{1}\vee\psi_{2}\) _iff_ \(\boldsymbol{\pi}\models\psi_{1}\) _or_ \(\boldsymbol{\pi}\models\psi_{2}\)_._
* \(\boldsymbol{\pi}\models\mathbf{X}\psi_{1}\) _iff_ \(\boldsymbol{\pi}_{1}\models\psi_{1}\)_._
* \(\boldsymbol{\pi}\models\mathbf{F}\psi_{1}\) _iff_ \(\boldsymbol{\pi}_{i}\models\psi_{1}\)_for some_ \(i\geq 0\)_._
* \(\boldsymbol{\pi}\models\mathbf{G}\psi_{1}\) _iff_ \(\boldsymbol{\pi}_{i}\models\psi_{1}\) _for every_ \(i\geq 0\)_._
* \(\boldsymbol{\pi}\models\psi_{1}\mathbf{U}\psi_{2}\) _iff_ \(\boldsymbol{\pi}_{i}\models\psi_{2}\) _for some_ \(i\geq 0\) _and_ \(\boldsymbol{\pi}_{j}\models\psi_{1}\) _for every_ \(0\leq j<i\)_._  
Other common Boolean operators have semantics that can easily be inferred from the semantics of \(\
eg\wedge\) or \(\vee\). **Definition 48** (Semantics of LTL Formulas with Respect to States). : _Given a transition system \(\mathcal{TS}\stackrel{{\text{\tiny{\it def}}}}{{=}}\langle S,S_{0},R,AP,L\rangle\), let \(s\in S\) be a state and let \(\psi\) be an LTL formula over \(AP\). We say that \(s\) satisfies \(\psi\), denoted as \(s\models\psi\), iff \(\mathbf{\pi}\models\psi\) for each infinite path \(\mathbf{\pi}=(s_{0},s_{1},\dots)\) with \(s_{0}=s\)._  
**Definition 49** (Semantics of LTL Formulas with Respect to Transition Systems). : _Given a transition system \(\mathcal{TS}\stackrel{{\text{\tiny{\it def}}}}{{=}}\langle S,S_{0},R,AP,L\rangle\), let \(\psi\) be an LTL formula over \(AP\). We say that \(\mathcal{TS}\) satisfies \(\psi\), denoted as \(\mathcal{TS}\models\psi\), iff \(s_{0}\models\psi\) for each \(s_{0}\in S_{0}\)._  
The interpretation of an LTL formula \(\psi\) in terms of a state \(s\) requires that all the computations starting from \(s\) satisfy \(\psi\), in order for \(s\) to satisfy \(\psi\). In LTL semantics, therefore, there is an implicit universal quantification over all computations when determining whether a state satisfies a formula. Thus, LTL can be used to express properties holding for every path from a state but it cannot express properties holding only for some of such paths.
## 4 Methods
### Overview  
#### 4.1.1 Neural Network Architecture  
In order to support real-time streaming requirements, we limit our focus to one-stage object detection frameworks such as SSD [11] and YOLO [12]. Architectures such as Faster R-CNN [13] can achieve high accuracy in general-purpose object detection tasks, but the region-based approach in Faster R-CNN and other two-stage object detection frameworks is unsuitable for mobile devices with limited computational power.  
One-stage object detection architectures use a proposal-free approach to make predictions with impressive accuracy and speed, which is suitable for mobile and edge devices. They typically consist of a convolutional neural network (CNN) and an object detection meta-architecture such as SSD. The CNN is based on a standard architecture used for image classification and is known as the backbone architecture. The SSD method aggregates information from feature maps extracted by the CNN at different scales to generate predictions about objects. We choose to use MobileNetV3 [9] as the backbone architecture because of its impressive speed on devices with limited computing power and couple it with the SSD meta-architecture for real-time object detection.  
In addition to supporting real-time streaming requirements, we enforce a privacy-preserving approach by implementing the SSD-MobileNetV3 model in the form of a _split-model architecture_. As the name suggests, the object detection model is split across the drone and the cloudlet. The motivation for pursuing this approach stems from the fact that PII can be leaked from the raw video frames transmitted to the cloudlet in a traditional compute-offloading scenario. The SSD head in the model only requires the feature maps extracted at different scales, which are intermediate representations (IRs) of the neural network. While feature maps can contain edge information, overall shape, and some invariants, they do not contain PII explicitly. In the split-model architecture, the drone receives video footage as input and generates the feature maps for relevant video frames. The cloudlet receives the feature maps as input and generates predictions, which are sent back to the drone without any PII being explicitly leaked.
# A Comparative Analysis of IMUs and Optical Systems in Layup Shot Biomechanics
## 2 Materials and Methods  
### Participant and Equipment  
Ten basketball players of recreational to university-level skill, six males and four females (age = 23.8 \(\pm\) 3.19 years, height = 1.72 \(\pm\) 0.10 m, body mass = 70.43 \(\pm\) 9.29 kg), took part after providing informed consent in line with the university ethical approval granted for the study. Seventeen Xsens (Xsens Technologies B.V., Enschede, The Netherlands) sensors (weight: 16 g, dimensions: 47 \(\times\) 30 \(\times\) 13 mm) sampling at 60 Hz were affixed to 14 body segments. Concurrently, 52 reflective markers (diameter 14 mm) were attached to the participants according to a custom marker set model. This model incorporated Vicon's (Vicon Motion Systems Ltd., Oxford, UK) plug-in gait markers along with additional markers placed distally on the middle finger, the distal ends of the second and fifth metacarpal bones, and one marker positioned inferior to the shoulder joint to accurately capture joint angle positions at 180\({}^{\circ}\) (Figure 1). The markers were tracked by eighteen T40/T20 Vicon cameras (Vicon Motion Systems Ltd., Oxford, UK) recording at a frequency of 240 Hz over a capture volume of approximately 4 \(\times\) 8 \(\times\) 3.5 m. A standard regulation basketball hoop (rim height = 3.05 m, rim diameter = 0.45 m, backboard height = 0.88 m, backboard width = 1.44 m) was used for the study, along with official internationally recognised Molten BG4500 basketballs (size 7 for males, size 6 for females), which are used by the British Basketball League (BBL).