esa-sceva/satcom-chunk-collection huggingface dataset:
# A QoS-Enabled Medium-Transparent MAC Protocol for Fiber-Wireless 5G RAN Transport Networks
## 5 Conclusions  
In this paper, we proposed a QoS-enabled Medium-Transparent MAC protocol, termed qMT-MAC, for Fiber-Wireless A-RoF 5G transport networks. qMT-MAC was shown through simulations to efficiently support three types of services, i.e., Constant Express, Express, and Best Effort, under the same framework, while achieving the respective delay and jitter requirements set by the standards. Specifically, it was shown that, under qMT-MAC, the CEXP traffic flows can be optimally combined to satisfy the strict delay and delay jitter requirements set by the eCPRI standard. On the other hand, EXP traffic flows were shown to have significant prioritization and be able to maintain a <250 \(\upmu\)s delay even for load conditions that approach the network's capacity. Finally, it was shown, that two additional proposed enhanced priority PS execution policies could offer significant performance gains, reaching up to a 64% reduction of attested delay for the Pre-emption policy vs. the Default priority scheme, overall solidifying qMT-MAC's ability to serve delay-sensitive traffic over the SoA MT-MAC protocols.  
Conceptualization, G.K. and N.P.; architecture design, G.K., N.P., D.P., C.V. and R.M.; methodology, A.M. and M.G.; simulator implementation, D.P. and M.G.; validation, A.M. and M.G.; resources, G.K. and A.M.; writing--original draft preparation, G.K. and D.P.; writing--review and editing, C.V., M.G., A.M., R.M. and N.P.; visualization, G.K. and A.M.; supervision, N.P. and G.K.; project administration, G.K., M.G. and A.M.; funding acquisition, G.K., A.M. and C.V. All authors have read and agreed to the published version of the manuscript.  
This work was funded by H2020 5G-COMPLETE (GA 871900) and H2020 Int5 Gent (GA 957403).  
Not applicable.  
**Data Availability Statement**: No new data were created or analyzed in this study.  
Figure 8: Performance evaluation vs. load for three PS execution policies: No priority, EXP priority and Pre-emption priority: (**a**) Throughput vs. Load, (**b**) Packet drops vs. Load, (**c**) Delay vs. Load for EXP traffic, and (**d**) Delay vs. Load for BE traffic.  
Conflicts of Interest: The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of the data; in the writing of the manuscript; nor in the decision to publish the results.
# Optimized Gateway Placement for Interference Cancellation in Transmit-Only LPWA Networks
## 4 Algorithms for Multiple GWs Placement
### Algorithm of PGL  
With the increasing number of SNs, the WBG algorithm will become more and more time consuming, because the number of OPs grows rapidly with the number of SNs. Given of \(n\) SNs, there will be \(O(n^{2})\) ordered SNs pairs with one capture circle and one ICD Circle for each pair. In the worst case, every crescent composed by a single capture circle and an ICD circle intersects with each other crescent except which decided by same pair of SNs with different order, then, there will be \(O(n^{4})\) OPs. For every OP, we have to count how many capture circles and ICD circles it is in. Therefore, there are \(O(n^{6})\) circles we count for \(O(n^{4})\) OPs and \(O(n^{2})\) capture circles and ICD circles. In the average case, every crescent does not necessarily intersect with every other, so the number of OPs will be less than that in the worst case. Even so, we still get a huge number of OPs to consider in the WBG algorithm. To decrease the number of OPs, which means to reduce the computational complexity, we may regard the whole potential area where the GWs could be deployed as a gray level image. Then, OPs are replaced by the pixels in the image and the edges with weight values are replaced by the gray level of each pixel, as shown in Figure 9. Therefore, the fast search algorithm of PGL is suggested as Algorithm 2. It can be seen obviously in Figure 9 that different pixels located in different regions have different gray levels. The pixel with higher gray level means that the GW that location could decode more collided packets transmitted by two of the SNs in collision. Therefore, the single most optimized location of the GW will be at the pixel with the maximum gray level. After removing all of the SNs whose packets can be decoded in the collision, the algorithm begins a new computation cycle again, until the location of all of GWs are set optimally. Figure 8: Example of the suggested WBG Algorithm with 3 SNs and GWs. (**a**) shows the complete bipartite graph, where \(\alpha=1\) and \(\beta=2\). The weights of the edges joining \(P_{11}\) and \(V_{s_{1},s_{3}}\) and joining \(P_{17}\) and \(V_{s_{1},s_{3}}\) are 1 and 2, respectively, as shown in (**b**). ```
0:\(N\) Number of SNs with known location; \(R\) Number of pixels in row; \(C\) Number of pixels in column; \(M\) Number of GWs;
0:The locations of number of \(M\) GWs, \(\{g_{1},g_{2},\cdots,g_{M}\}\in\Re^{2}\).
## 3 Methodology
### Data Collection  
Given the varied locations of the client within our network tests, it was impossible to accurately track each latency component of the entire system through traditional packet analysis. As a solution to this issue, TCP packets were utilized to track the end-to-end Client Request Duration for the client to request a movement, measured from the transmission of the \"Move\" Request until it is acknowledged as completed by the host using the \"Move Complete\" Response, as well as various individual constituent processing times between the host and the robot, as shown in Figure 2. The IK Solver Request, IK Solver Response, Move Request, and Move Response are all ROS packets initiated from the host server to control the robot. Furthermore, by tracking the host's processing duration from receiving the client's Move Request to when it transmits the Move Complete Response and including that timing in the response message, we can subsequently also determine the round-trip time (RTT) between the client and the host.  
As each \"Move Request\" packet is sent from the client to the host, the client uses an internal timer to track the total time until a response is received from the host server. The host also utilizes internal timers to track the total IK Solver time, Move Request time, and total processing time. This is then attached to the \"Move Complete\" packet for latency data collection. These results were aggregated for the statistical analysis presented in Section 4.1 of this paper. For camera latency, a precision timer was displayed on the client's screen, the webcam was pointed at the timer, and the client then connected to the camera video stream to render the received video next to the displayed precision timer. Screenshots were then taken of the resulting difference between the streamed timer video feed and the directly displayed precision timer, acting as the ground truth, in order to measure the end-to-end camera latency. Utilizing this setup locally on the host device without a network connection, we found the webcam's latency to be 100 ms at 30 fps. Since this methodology cannot be utilized within our transatlantic tests, results are only presented for the first 3 latency cases.  
Modern compression methods, such as H.264 and H.265, were not employed for the video feed in this architecture, as a frame free from errors and movement artifacts was desired for this test rather than higher compression rates. However, this resulted in the 1.25 Mbps bandwidth required for video transmission, and existing research has shown favorable results of reducing the bit rate by several hundred kbps [33; 34], so future testing of the user experience with compression over lossy channels is planned.
# A Cluster-Based Hierarchical-Approach for the Path Planning of Swarm
## 2 Problem Formulations  
This section describes the problem that this paper is trying to solve. Firstly, in this research, we simulate the scenario by parallel implementing the design hierarchy with the non-dominated sorting genetic algorithm II (NSGA-II) to check the validity of our scheme. Hereinafter, this research consists of two mission situations, inorder to validate the proposed strategy, i.e., (i) validate the proposed algorithm in a rough environment with hilly peaks. (ii) Crooscheck the execution of the designed model in an environment with tornadoes.  
Figure 1 shows the mission scenario in which three colonies have to reach their destination through a dynamic territory. To achieve our objective, we have divided our mission into two main phases. In the first phase, MMACO finds the most optimal route for the leader of each colony. Then, in the second phase, the rest of the two UAVs follow their leader as agents toward the destination using Vicsek MAS. Keep in mind that the three colonies will come closer and closer towards the end and act as one single network. Additionally, there are some obstacles such as mountain peaks and tornados in the mission environment. Due to the aforementioned threats in the area, all UAVs need to coordinate and synchronize to avoid any collision.  
A regular mesh is used as the topology of the network which means that all the edges are of the same length. The hills and tornadoes are modeled as missing nodes. In Figure 2 there is an association in legs, edges and nodes. In order to understand the concept of path planning, it is essential to first understand the concept of nodes, edges, and legs. The nodes are intermediate points plotted by the algorithm between starting position and the final position. The UAV only moves from one node to another. The algorithm plots the nodes for the whole path during one iteration. As the air space is 3D, we split it into three 2D planes, i.e., \(xy\), \(yz\), and \(zx\), to make the computations simpler [24].  
Every time a UAV is set to hit something, the algorithm alters its path and generates a leg. After every turn, a new leg is generated. It is clear from Figure 2 that an edge connects two nodes. For example, edge (a, b) is the length from node a to b. There are 4 nodes, 3 edges, and 2 legs in Figure 2. \(\phi\) is the angle between the legs. The complete consists of multiple legs.  
Figure 1: Mission Scenario.  
Figure 2: Nodes, Edges, and Legs.
# OTFS: A Potential Waveform for Space-Air-Ground Integrated Networks in 6G and Beyond
## 5 Conclusions  
The performance of OTFS and OFDM was evaluated under various mobility scenarios expected in SAGINs. The results demonstrate that OTFS outperforms OFDM in high-mobility and multipath environments, which are characteristic of SAGINs. While OFDM remains effective in static and low-mobility channels, it struggles to mitigate severe Doppler effects and multipath fading encountered in high-mobility scenarios. OTFS, by operating in the delay-Doppler domain, enables superior channel estimation, improved equalization, and greater resilience to ICI and multipath effects. This results in significantly lower BER and more reliable communication in dynamic environments.  
Despite these advantages, OTFS introduces higher computational complexity, which may impact its practical deployment in 6G networks. Nevertheless, given the growing demand for reliable, high-mobility communication, OTFS emerges as a strong candidate for SAGINs in 6G and beyond, enabling seamless integration across space, air, and ground network layers.  
Future work may focus on evaluating the practical challenges of OTFS implementation, including computational complexity and hardware feasibility. Additionally, further research could explore the integration of OTFS with MIMO and massive MIMO systems to enhance spectral efficiency and capacity. Another promising direction is the application of deep learning-based techniques for channel estimation and equalization to further improve the performance of OTFS in dynamic channels. These investigations will provide deeper insights into the viability of OTFS for SAGINs and its potential role in 6G and beyond.  
Conceptualization, O.O.; methodology, O.O.; software, O.O. and X.D.; validation, O.O., X.D. and A.L.I.; formal analysis, O.O. and O.S.; investigation, O.O.; resources, O.O.; writing--original draft preparation, O.O.; writing--review and editing, O.O., O.S. and A.L.I; supervision, X.D.; project administration, X.D. All authors have read and agreed to the published version of the manuscript.  
This research received no external funding.  
The data that support the findings of this study are available from the corresponding author upon reasonable request.  
The authors declare no conflicts of interest.
_Article_  
**Clinicopathologic Aspects of Squamous Cell**  
**Carcinoma of the Uterine Cervix: Role of PTEN,**  
**BCL2 and P53**  
**[PERSON] 1,2, [PERSON] 1, [PERSON] 1,**  
**[PERSON] 3, [PERSON] 4,**  
**[PERSON] 1 and [PERSON] 1,**  
1 Department of Medical Laboratories, College of Applied Medical Sciences, Qassim University,  
Buraidah 51452, Saudi Arabia; [EMAIL_ADDRESS] (A.Y.B.); [EMAIL_ADDRESS] (A.A.); [EMAIL_ADDRESS] (K.S.A.); [EMAIL_ADDRESS] (M.A.A.)  
2 Department of Histopathology and Cytology, College of Medical Laboratories Science,  
University of Sciences and Technology, Omdurman P.O. Box 407, Sudan  
3 Department of Pathology, Faculty of Medicine, Omdurman Islamic University,  
Omdurman P.O. Box 382, Sudan; [EMAIL_ADDRESS]  
4 Department of Obstetrics and Gynecology, College of Medicine, Qassim University,  
Buraidah 51452, Saudi Arabia; [PERSON]MAIL_ADDRESS]  
* Correspondence: [EMAIL_ADDRESS]  
Received: 24 September 2018; Accepted: 27 October 2018; Published: 1 November 2018  
**Abstract: Background**: Squamous cell carcinoma (SCC) of the uterine cervix is a leading cause of morbidity and mortality among women. The alterations of Phosphatase and tensin homolog (_PTEN_), B-cell lymphoma 2 (_Bcl2_) and p53 expression seem to be significant in the development of various types of cancers. The altered expressions of PTEN, Bcl2 and p53 and their involvement in cancer of the uterine cervix are not well recognized. **Aim**: This study aimed at examining the expression patterns of PTEN, Bcl2 and p53 proteins and comparing them with the grade and stage of cervical cancer. **Materials and Methods**: Tissue blocks of SCC and ten cases of inflammatory lesions of the uterine cervix were examined immunohistochemically for the expression of PTEN, Bcl2 and p53 proteins. **Results**: Loss of PTEN expression was identified in 45.33% of cervical SCC and high expression was found in inflammatory lesions (\(p\leq 0.05\)). PTEN expression was significantly associated with the clinical stage of SCC (61.36% and 45.16% in stages I-II and III-IV, respectively) (\(p<0.05\)), but not with the degree of differentiation of the SCC. The expression of _Bcl2_ was significantly high (60%) in cancer cases than in control cases (\(p<0.05\)). Bcl2 did not show any significant association with the histologic type and clinical stage of the SCC of the uterine cervix. The expression of p53 protein was significantly high (57.33%)) in cancer tissue, and no expression was noted in control cases (\(p<0.05\)). Moreover, the expression pattern of p53 protein in cervical cancer tissue samples was not linked with the patient age, grade and stage of the cervical SCC (\(p>0.05\)). **Conclusion**: The reduced expression of PETN and overexpressions of Bcl2 and p53 might play an indispensable role in carcinogenesis of cervical SCC. Moreover, a relationship was detected between PTEN expression and clinical stage of the cervical SCC.  
**Keywords: PTEN; Bcl2; p53; gene; immunohistochemistry; prognostic role; pathogenesis; carcinogenesis; SCC; cervical cancer**
# A Quantum Detectable Byzantine Agreement Protocol Using Only EPR Pairs
## 4 The \(n\) Player EPRQDBA Protocol
### The \(n\) Player Entanglement Distribution Phase  
The first phase is the entanglement distribution phase that involves the generation and distribution of qubits and entangled EPR pairs. As we have already explained in assumption (\(\mathbf{A}_{1}\)), we take for granted the existence of a trusted quantum source that fulfills this task. Taking into account the capabilities of modern quantum apparatus, the quantum source should have no difficulty in producing  
* \((n-2)(n-1)m\) qubits in the \(|+\rangle\) state by simply applying the Hadamard transform on \(|0\rangle\), and
* \((n-1)m\) EPR pairs in the \(|\Psi^{+}\rangle\) state, which can be easily generated by modern quantum computers.  
The parameter \(m\) plays an important role and should be a sufficiently large positive integer. The forthcoming mathematical analysis of the protocol contains additional discussion regarding \(m\). The source distributes the produced qubits according to the next scheme.  
* The \((n-1)m\) EPR pairs are numbered from \(0\) to \((n-1)m-1\).
* The source sends a sequence \(q_{0}^{A}\), \(q_{1}^{A}\),..., \(q_{(n-1)m-2}^{A}\), \(q_{(n-1)m-1}^{A}\) of \((n-1)m\) qubits to [PERSON] and a sequence \(q_{0}^{i}\), \(q_{1}^{i}\),..., \(q_{(n-1)m-2}^{i}\), \(q_{(n-1)m-1}^{i}\) of \((n-1)m\) qubits to lieutenant general \(\mathrm{LT}_{i}\), \(0\leq i\leq n-2\).
* [PERSON]'s sequence is constructed by inserting in position \(k\) the first qubit of the EPR pair \(k\), \(0\leq k\leq(n-1)m-1\).
* \(\mathrm{LT}_{i}\)'s sequence, \(0\leq i\leq n-2\), is constructed as follows. Position \(k\), \(0\leq k\leq(n-1)m-1\), contains the second qubit of the EPR pair \(k\) if and only if \(k\equiv i\bmod(n-1)\); otherwise position \(k\) contains a qubit in the \(|+\rangle\) state.  
The end result is that the quantum registers of [PERSON] and her \(n-1\) lieutenant generals \(\mathrm{LT}_{0}\),..., \(\mathrm{LT}_{n-2}\), are populated as shown in Figure 4.
## 8 Clinical Trials and Patents
These patents include diverse natural compounds such as curcumin, quercetin, ceramide, and resveratrol loaded in nanocarriers to improve the modulation of MDR. Both the WO2012078831A3 and CN111568882A patents [129; 131] focused on developing the MDR inhibitory activity of curcumin mediated by nanoformulations. Meanwhile, CN111568882A prepared a compound curcumin nanoparticle, which decreased curcumin metabolization through piperine and used P-gp inhibitors as auxiliary materials, resulting in an enhanced antitumor efficacy of curcumin and MDR reversion; WO2012078831A3 described polymeric nanoparticles encapsulated with curcumin and one or more chemotherapeutic agents. In the same way, the patent CN102697795A [128] described how ejurubicin and quercetin encapsulated in  
\begin{table}
\begin{tabular}{c c c c c c} \hline \hline
**Patent No. ** & **Inventors** & **Title** & \begin{tabular}{c} **Natural Compound,** \\ **Extract, or Preparation** \\ \end{tabular}  & **Year** & **Reference** \\ \hline \multirow{4}{*}{WO2021187905A1} & \multirow{4}{*}{[PERSON]. [PERSON]} & Pharmaceutical composition for cancer & Extract of _Trichosenthes_ & \multirow{4}{*}{2021} & \multirow{4}{*}{[118]} \\  & & and resistant cancer comprising & _kirliweli_ Maxim, & & \\  & & _Trichosenthes kirliweli_ maxim, & _Dicatamus_ & & \\  & & _dasaryrus_ [PERSON] and _Morus alb_ L. & & Turcz, \(\_\), and _Morus alb_ L. & \\  & & Composition for inhibition of MDR & & & \\  & & containing an extract of _Trichosenthes_ & \multirow{4}{*}{2013} & \multirow{4}{*}{[119]} \\  & & & _kirliweli_ maxim & & \\  & & Application of salvainolic acid A in & & & \\  & & preparation of medicine for treating tumor & & & \\  & & multi-drug resistance & & & \\  & & & Application of ergotamine as a tumor & & \\  & & multiple drug resistance reversal agent & & & \\  & & Application of dicouramol in & & & \\  & & tumor resistance & & & \\  & & & & \\  & & & & \\  & & & epoxylantolactone & & \\  & & in resisting multidrug resistant tumors & & & \\  & & & of Composite & & \\  & & & & \\  & & Novel skeleton cyclic impopeptide & & A new skeleton cyclic & \\  & & compound with activity of reversing MDR & & & \\  & & of tumor as well as preparation method & & & \\  & & and application of same & & & \\  & & Macrocyclic ditere compounds in fruit & & & \\  & & & & \\  & & _Eulphis sorria_ A. schrenk as well as & & & \\  & & preparation method of macrocyclic & & & \\  &  
the same nanoparticles can reverse leukemia drug-resistant K562/A02 cells. Similarly, the CN103142481A patent [130] presented a liposome containing paclitaxel and resveratrolol, capable of inhibiting MDR in chemoresistant cells. Finally, among the patents relative to nanoencapsulation, WO2014144421A1 presented a novel mechanism for dealing with MDR based on ceramide-loaded nanoliposomes that induces rapid translocation of a chemotherapeutic drug, daunorubicin, from the cytoplasm to the nucleus. It is necessary to continue research in this field and advance the clinical applications of natural products that have already been patented.
## 2 Methodology and Networks
### Evaluation Metrics  
In order to quantitatively evaluate and compare the qualities of the real digital rock samples and the generated digital rock samples, several statistical metrics are utilized. The metrics adopted in this study include:  
Density Distribution Curve: This curve represents the probability distribution of data points in both real and generated digital rock samples. It is essential for visualizing the distribution of pixel values, ensuring that generated digital rocks resemble real rocks. The kernel density estimation (KDE) is often used for this purpose, given by:  
\[f(x)=\frac{1}{Nh}\sum_{i=1}^{N}K\left(\frac{x-x_{i}}{h}\right) \tag{1}\]  
where \(K\) is the kernel function, \(h\) is the bandwidth, and \(N\) is the number of data points.  
Box Plot: The box plot provides a visual summary of the data's central tendency, variability, and outliers. The central rectangle spans the interquartile range (IQR), the segment inside the rectangle shows the median, and \"whiskers\" above and below the box show the range outside the middle 50% of the data.  
The calculation for IQR is:  
\[\text{IQR}=Q_{3}-Q_{1} \tag{2}\]  
where \(Q_{3}\) is the third quartile and \(Q_{1}\) is the first quartile.  
Outliers can be determined using:  
\[\text{Outliers}=\{x:x<Q_{1}-1.5\times\text{IQR}\text{ or }x>Q_{3}+1.5\times \text{IQR}\} \tag{3}\]  
Mean: Represents the average value of the digital rock samples. It is calculated as:  
\[\text{Mean}=\frac{1}{N}\sum_{i=1}^{N}x_{i} \tag{4}\]  
where \(N\) is the total number of data points, and \(x_{i}\) is the value of the \(i\)th data point.  
Standard Deviation: Measures the amount of variation or dispersion of the data points. It provides insights into the variability of the data. The formula is:  
\[\sigma=\sqrt{\frac{1}{N-1}\sum_{i=1}^{N}\left(x_{i}-\text{Mean}\right)^{2}} \tag{5}\]
# Phase Reversal Method for Damage Imaging in Composite Laminates Based on Data Fusion
## 1 Introduction
In this study, the commercial software COMSOL(Version 5.3) was used to perform numerical simulation and verify the experimental research. In the proposed method, localization of damage in composite laminated structures was realized without using the information on material parameters, dispersion relation, and anisotropy. The results show that the proposed method has great application potential in damage imaging and structural health monitoring of composite laminates.