esa-sceva/satcom-chunk-collection huggingface dataset:
# Secure Delivery Scheme of Common Data Model for Decentralized Cloud Platforms
## Materials and Methods
### Methods for Adapting to CDM Model
#### 2.2.2 The Secure Operation Scheme for the SC-CDM  
The SC-CDM aims to provide a distributed platform for CDM cloud, from transmission to utilization, including the workflow process communications for benefiting health professionals and patients.  
The use of CDM format is important for efficient data exchange between organizations in the network, given the diversity of organizations in the SC-CDM. It maximizes the use of existing data resources. The CDM has been constructed and supplied by several providers, thus resulting in separated and disseminated its data by clinical researchers. Figure 2 illustrates the concept of the SC-CDM. As you seen, in Figure 2, the trust manager of hospital A signs a CDM that is access by hospital B. More specifically, the CDM in Node\({}_{\text{A}}\) is signed by the private key (PrivateKey\({}_{\text{A}}\)) corresponding to the public key (PublicKey\({}_{\text{A}}\)) contained in Node\({}_{\text{B}}\). Then we represent it as CDM\({}_{\text{A}\rightarrow\text{B}}\). The signed CDM is verified with PublicKey\({}_{\text{A}}\) by the trust manager of hospital B operated in Node\({}_{\text{B}}\).  
The proposed CDM reference model is constructed by several CDM providers and CDM consumers that consist of hospitals and research institutes. Using this reference model, clinical researchers separate and disseminate the CDM data. The following describes the details of the CDM reference model.  
* Cryptography can be used for protecting information, using a hash value to maintain management of large-capacity CDMs.
* DID is applied to solve the risk of central ID management caused by SPF and privacy leakage problems.
* Distributed ledger is used to provide data integrity and share information through CDM signature.  
Figure 1: Conventional concept of Common Data Model (CDM) and operation scheme.
## 2 Materials and Methods  
### CT Data Optimized for Metal Artifact Reduction and Phantom Composition  
We used a self-made phantom in the form of a tooth made of plaster to measure the metal artifacts. The phantom contained all the shapes of human teeth and carried a nickel alloy dental prosthesis to express the dental prosthetic treatment virtually, which is often performed in patients with caries. Using this phantom, we measured the frequency of artifacts based on the effect of tube voltage change (kVp), the effect of tube current (mAs), and iMAR algorithm applied. All 64-channel multi-detector CT images were performed using a Somatom Syngo (Siemens, German) and CT scans were based on changes in five parameters. The position of the phantom was not changed according to the conditions. To measure the degree of artifact generation according to the change in tube voltage, the tube current was fixed at 50 mAs. The tube voltage was changed to 80, 100, or 120 kVp to acquire images in 3D using a helical scan method. In order to evaluate the tube current of artifacts, the tube voltage was fixed at 120 kVp and the tube current changed to 30, 50, and 80 mAs, and images were acquired in the same manner. Reconstructed images using the iMAR algorithm were obtained under altered conditions, and the degree of reduction in artifacts according to changes in tube voltage and tube current was compared and evaluated.
## 5 Simulation Results
In addition, the proposed method provides the best DOA estimation performance in all SNR regions, for the reason that the noncircularity-based joint reweighted sparse representation scheme enlarges the virtual array aperture and enhances the sparse solution. Figure 5 illustrates the RMSE of DOA estimation versus SNR in different methods with mutual coupling Case (2), where \(M=N=7\), \(J=200\), and there are three uncorrelated targets located at \(\theta_{1}=-15^{\circ}\), \(\theta_{2}=0^{\circ}\), \(\theta_{3}=15^{\circ}\). From Figure 5, it is clear that the performance of \(l_{1}\)-SVD is inferior to the other algorithms, and the proposed method has the lowest RMSE in all analyzed methods. This means  
Figure 4: RMSE versus SNR in ESPRIT-like, \(l_{1}\)-SVD and \(l_{1}\)-SRDML (sparse representation deterministic maximum likelihood) methods for nonzero mutual coupling coefficient number \(K=2\). Figure 3: Spatial spectrum of the proposed method with target number \(P=3\) and \(P=5\). that when the number of nonzero mutual coupling coefficients increases, the proposed method still has superior DOA estimation performance. Figure 6 shows the RMSE of DOA estimation versus snapshots of different methods with mutual coupling Case (1), where \(M=N=6\), SNR = 0 dB, there are three uncorrelated targets with DOAs being \(\theta_{1}=-11.5^{\circ}\), \(\theta_{2}=0^{\circ}\), \(\theta_{3}=11.5^{\circ}\) and the number of snapshots varies from \(J=50\) to \(J=550\). It can be seen from Figure 6 that the proposed method performs well in the case of fewer snapshots, and with obvious superiority over the ESPRIT-like, \(l_{1}\)-SVD and \(l_{1}\)-SRDML algorithms, the proposed method performs the best in all pf the ranges of snapshots on account of the application of the reweighted matrix and the noncircularity of emitted signals. Figure 7 demonstrates the target resolution probability of different methods versus SNR with mutual coupling Case (1), where \(M=N=6\), \(J=100\) and the DOAs of three targets are \(\theta_{1}=-20^{\circ}\), \(\theta_{2}=0^{\circ}\) and \(\theta_{3}=20^{\circ}\), respectively. They can be regarded as successfully detected when all of their absolute DOA estimation errors are within \(0.1^{\circ}\). It can be observed that when SNR is high enough, all methods provide 100% target resolution probability. Owing to the increased number of virtual array  
Figure 5: RMSE versus SNR in the ESPRIT-like, \(l_{1}\)-SVD and \(l_{1}\)-SRDML methods for nonzero mutual coupling coefficient number \(K=3\). Figure 6: RMSE versus snapshots in the ESPRIT-like, \(l_{1}\)-SVD and \(l_{1}\)-SRDML methods when SNR = 0 dB. elements, more diversity gain is obtained in the proposed algorithm. Consequently, the proposed method provides higher resolution probability than the ESPRIT-like, \(l_{1}\)-SVD and \(l_{1}\)-SRDML algorithms in all SNR regions, as shown in the simulation results of Figure 7.
# A 5G-Based VR Application for Efficient Port Management
## 3 Application of 5G + VR in Smart Ports
### System Architecture
Briefly, the intelligent security system proposed in this paper is mainly used to simulate the user's decision when danger occurs, as well as the discovery of potential risks, integrated information from all aspects to make comprehensive decisions to reduce human labor and time costs. Figure 8: Smart security architecture. * Intelligent Container Tally System  
The intelligent container tally system is mainly composed of an identification system, a transmission system at the edge of the network, and a management system at a higher level of the network [35; 36; 37]. From the implementation perspective, as shown in Figure 10, the recognition system and the management system are only different at the technical level, and usually not a bottleneck. The transmission system is a key of the QoS of an intelligent container tally system. Most of the quay cranes of the traditional wharf are not equipped with optical fiber for data transmission, and can only transmit the signal of the identification system to the back-end through a wireless network [20]. From the operating point of view, the limitations of the wireless Access Point (AP) solution are mainly manifested in the following three aspects:  
* Wireless AP's limited roaming support makes the quay cranes easy to experience packet loss in handover processes during their movement. * The maintenance effort of the wireless AP increases the cost of the terminal. * The overall QoS (i.e., bandwidth, packet loss, delay, jitter, etc.) level of wireless AP cannot simultaneously carry the transformation business requirements of quay crane tally and quay crane remote control. Judging from the technical characteristics of 5G and the current industry application demonstrations, 5G communication technology can better solve the above problems. eMBB is the enhanced mobile broadband of 5G to provide support for the high bandwidth required for both intelligent container tally system and quay crane remote control. At present, the measured speed under the No-Standalone network Architecture (NSA) can reach 1.2 Gbit/s. At the same time, 5G's high-reliability and low-latency connection can provide a cost-effective solution for the remote-control transformation of traditional quay cranes. A customized 5G industrial router can be installed on each quay crane to customize 5G access terminals so the data on the quay crane can be transmitted to the back-end management platform through the 5G network. The system can be extended to support more complex tasks such as cargo management, route planning, and time management of cargo ships through all aspects of gathered information. Figure 9: Schematic diagram of emergency command of smart ports.
## 8 A Hypothetical Robust and Renewable Transport Infrastructure Network
### Robustness and Renewability Improvement Based on Space Energy
\begin{table}
\begin{tabular}{p{113.8 pt} p{113.8 pt} p{113.8 pt} p{113.8 pt}} \hline \hline
**Research Topic** & **Advantages and Compromises** & **Expected Effect** & **Future Directions** \\ \hline
1. Intensive use of charging station energy 1 & Infrastructure development is uncertain, sustainability increases & Commitment to zero emissions & Increased availability for green energy [34], biosphere degradation is uncertain [6] \\ \hline
2. Increased green energy availability 1 & Infrastructure development is uncertain, sustainability further increases & Increasing number of SBSP satellites & Legal and territorial limitations are uncertain [4], biosphere may degrade [6] \\ \hline
3. Use and maintenance of high-energy conversion units for space applications 2 & Robustness increases, sustainability further increases & More effective orbital energy transfer & Operator health degradation [5], biosphere may degrade [6] \\ \hline \hline \end{tabular}  
* 1 Corresponds to changes related to energy infrastructure. 2 Corresponds to parts from the energy infrastructure. 3 Improved by [160]. 4 Confirmed by [161]. 5 Partially confirmed by [151; 152; 156]. 6 Unconfirmed plausible scenario.  
\end{table} 
Table 7: Robustness and renewability analysis for an alternative SBSP infrastructure. Figure 27: Distance energy transfer charging infrastructure. This approach uses an alternative SBSP (Space-Based Solar Power) transfer, storing and releasing energy using satellites on orbital trajectories. The energy is sent to ground charging stations. actions for migrating the transportation infrastructure to this hypothesis might mitigate the climate adverse events (SDG13). However, economic growth might be restricted due to the typically limited amount of green energy and territorial limitations (SDG8). Considering that all verification stages and safety concepts were fulfilled, this solution represents a plausible infrastructure for providing a robust and renewable modern transportation network. However, deploying such infrastructure requires high-precision parts, such as the accurate collimation of emitters. This would be necessary to achieve a similar or greater transmission distance than conventional communication devices for delivering energy to the charging station.
# An Efficient Relayed Broadcasting Based on the Duplication Estimation Model for IoT Applications
## 1 Introduction
It is possible that the transmission of a certain frame is excessively suppressed or it fails due to a collision with or interference from concurrent transmissions. To cope with this problem, we propose a _re-queuing_ scheme that selects a frame to compensate for excessive suppression or to recover a transmission failure and provides a secondary transmission opportunity for the selected frame. Therefore, the re-queuing scheme effectively improves the reliability of flooding. Furthermore, we propose a simple method to approximate the duplication ratio, which is difficult to estimate accurately without an appropriate acknowledgment mechanism for broadcasting. Simulation results showed that the proposed mechanism successfully delivered the data frame of a source node approximately 99% to all of the nodes and it significantly decreased the traffic dissemination time by up to 6-fold compared to the conventional flooding mechanism focusing on the transmission reliability. The notion of the duplication ratio was first proposed in our previous study [11]. In the present work, we significantly extend our previous study by investigating the characteristics of the duplication ratio in detail and using it in the re-queuing scheme, which was not considered in our previous work. Furthermore, we evaluate and compare the performance of the  
Figure 1: Examples of IoT services based on relayed broadcasting: (a) file sharing, (b) an emergency alarm, and (c) local social media or marketing. proposed mechanism in depth by considering diverse simulation configurations and performance indices. The contributions of our work are summarized as follows:  
* We present the duplication ratio as a systematic and unified criterion for relay suppression and compensation. We also propose a simple and practical method to approximate it. * As well as decreasing the redundancy, the proposed mechanism improves the reliability of flooding by combining duplication suppression and re-queuing schemes. * The proposed mechanism is totally decoupled from the channel access mechanism of WLAN and works in a distributed manner without incurring a signaling overhead or relying on a feedback mechanism. Moreover, it does not require adjusting control parameters depending on network conditions. The rest of the paper is organized as follows. Section 2 contains a statement of the problem of the flooding mechanism and a discussion of related work in the literature. We introduce the duplication ratio and propose the relay suppression and re-queuing schemes in Section 3. In Section 4, we evaluate and compare the performance of the proposed mechanism via simulations. Finally, we conclude the paper in Section 5.
# Change of Lip Curvature Through Extraction and Non-Extraction Orthodontic Treatment
###### Abstract  
Background: Orthodontic treatment plans face challenges when deciding on tooth extraction, particularly when the retraction of incisors leads to a flattening of the lip curvature. Despite the significance of this issue, quantitative measurements of curvature have not been previously undertaken. This study presents novel soft tissue measurements, namely SAL (A'to6n-Ls) depth, SAL angle, PBL (B'toLi-Pg) depth, and angle, as tools for assessing lip curvature. The aim of this study was to assess whether new parameters demonstrated more pronounced flattening of the upper and lower lips in the extraction group compared to the non-extraction group. Methods: A total of sixty-two patients diagnosed with skeletal Class I malocclusion and treated with extraction or non-extraction orthodontic treatment were included and compared. Cephalometric measurements were analyzed and compared between the initial and final stages of treatment. Results: The difference in SAL (1.99\({}^{\circ}\)) and PBL (4.41\({}^{\circ}\)) angles and other soft tissue measurements between the groups was not statistically significant. Multiple regression analysis yielded the equation: \(\Delta\)SAL = 0.66\(\Delta\)U1 tip - 0.98\(\Delta\)L1 tip - 1.58. Conclusions: Flattening of the upper lip was not significantly displayed on moderate anchorage. Consequently, orthodontic treatment accompanying the retraction of the upper incisors does not always result in obtuse lip profiles.  
extraction vs. non-extraction; soft tissue response; aesthetics; lip curvature +
Footnote †: journal: applied sciences
## 3 Results
### An Accuracy Assessment of CHM-Based Height
#### 3.3.1 Effect of LiDAR Point Density on Height Accuracy  
Average and standard deviation of LiDAR density were 1.6 and 1.1 points/m\({}^{2}\) for 2011-2013 LiDAR and 6.0 and 3.2 points/m\({}^{2}\) for 2017-2020 LiDAR data. Height error in relation to LiDAR point density mostly showed a positively skewed distribution (Figure 11). Median values were in a \(-\)3 to 5 m range. However, height error had a negatively skewed distribution for 2017-2020 LiDAR data when LiDAR point density was under 4 points/m\({}^{2}\). The third percentile of error distribution was \(-\)31 m when point density was 0-2 points/m\({}^{2}\) and \(-\)20 m when point density was 2-4 points/m\({}^{2}\).  
Height measurement error was displayed with respect to LiDAR acquisition year to investigate whether the data acquired in a specific year caused a larger error (Figure 12). The result showed that measurement error was mostly positively skewed for all data acquisition years. However, the height errors obtained from 2018 LiDAR data were negatively skewed when point density was 0-4 points/m\({}^{2}\). The errors from 2018 LiDAR data had a distinctively longer lower whisker when the point density values were under 2 points/m\({}^{2}\).
# Linear Computation Coding: A Framework for Joint Quantization and Computing
## 3 State of the Art in Linear Computation Coding
### Multidimensional Functions
#### 3.2.1 The Mailman Algorithm  
Accelerations to products of unstructured matrices with arbitrary vectors is well-studied for Boolean semi-rings [39; 40]. For Boolean semi-rings, [40] shows that lossless linear computation coding in \(K\) dimensions requires at most \(\mathsf{O}(K^{2}(\log K)^{-2})\) operations. The mailman algorithm [38] is inspired by these ideas. It allows to compute the product of a matrix composed of entries from a finite field with an arbitrary (even real or complex) vector by at most \(\mathsf{O}(K^{2}(\log K)^{-1})\) operations. For this purpose, the target matrix  
\[\mathbf{T}=\mathbf{B}\mathbf{W} \tag{6}\]  
is decomposed into a codebook matrix \(\mathbf{B}\) and a wiring matrix \(\mathbf{W}\) in order to simplify the computation of the linear function \(f(x)=\mathbf{T}x\) by \(f(x)=\mathbf{B}(\mathbf{W}x)\) with appropriate choices of the codebook and the wiring matrix.  
Let \(\mathbf{T}\in\mathcal{T}^{N\times K}\) for the finite set \(\mathcal{T}=\{0,\dots,T-1\}\). Let \(K=T^{N}\) and fix the codebook matrix \(\mathbf{B}\in\mathcal{T}^{N\times K}\) in such a way that the \((n,k)\)th entry of \(\mathbf{B}\) is the \(n\)th digit of the \(T\)-ary representation of \(k-1\). Thus, the \(k\)th column of the codebook matrix is the \(T\)-ary representation of \(k-1\). Since \(\mathbf{B}\) contains all the \(T^{N}\) possible columns, any column of \(\mathbf{T}\) is also a column of \(\mathbf{B}\). The purpose of the wiring matrix is to pick the columns of the codebook matrix in the right order similar to a mailman who orders the letters suitably prior to delivery. Since the wiring matrix only reorders the columns of the codebook matrix, it contains a single one per column while all other elements are zero. Thus, the product \(h=\mathbf{W}x\) is simply a permutation and does not require any arithmetic. On a circuit board, it just defines a wiring. For the product \(\mathbf{B}h\), ref. [38] gives a recursive algorithm that requires \(\mathsf{O}(K)\) operations. Decomposing a \(K\times K\) matrix into \(K/\log_{T}K\) submatrices of size \(\log_{T}K\times K\), the overall complexity scales as \(\mathsf{O}(K^{2}/\log K)\).  
The main drawback of the mailman algorithm is that it can only be used for matrices whose entries are all positive. We may generalize the wiring matrix \(\mathbf{W}\) and also allow negative entries within it. However, this still requires the entries of any column of the target matrix \(\mathbf{T}\) to have the same sign. This constraint severely restricts the applicability of the algorithm, in practice. In particular, it cannot be applied in neural networks.  
A further drawback of the mailman algorithm is its inflexibility. The accuracy of computation depends on the parameter \(T\). However, \(T\) is not free, but tied to the size of the matrix.
# Edge Federated Optimization for Heterogeneous Data
## 5 Experimental Results
### Performance Evaluation
#### 5.2.4 FedAvg/FedProx with Strategy 4  
In specific federated learning contexts, we hypothesize that freezing the initial layers may be disadvantageous for the model to capture sufficient discriminative power to handle more fine-grained classification tasks. In order to enhance the adaptability and generalization capabilities of the model across different datasets, we introduced the open-source tool DessiLB for implementing unstructured pruning in this study. Figure 10 presents the corresponding confusion matrix, following the approach outlined in [38] with tests conducted at three different pruning percentages (i.e., 10% (Figure 10a), 20% (Figure 10b), and 80% (Figure 10c) pruning percentages).  
For the FedProx algorithm, experimental results indicate that, across various pruning percentages, 10% pruning (95.58% and 63.47%) achieves the most competitive performance, compared to the results in Figure 8 (97.31% and 62.15%). However, even with a 10% pruning percentage, the pruning strategy still falls short of accurately classifying category A. Despite the simplicity and flexibility inherent in unstructured pruning and its ability to rapidly compress models in certain contexts, this pruning strategy did not significantly improve the model's classification performance in this experiment.  
Figure 10: Confusion matrix comparison of model performance: (**a**) at 10%, (**b**) at 20%, and (**c**) at 80% unstructured pruning rates.  
Nonetheless, for the FedAvg algorithm, Strategy 4 with 20% and 80% pruning percentages achieves better classification performance, respectively, with (88.75% and 72.75%) and (71.13% and 86.56%), compared to the results of the FedProx algorithm respectively with (90.40% and 51.94%) and (79.23% and 47.69%), which implies that compared with those of the FedAvg with Strategy 1 (Figure 7) and the FedProx, implementing optimization Strategy 4 (i.e., unstructured pruning and layer freezing) may achieve effective balance between model complexity and classification accuracy of the FedAvg algorithm.
###### Abstract  
Objective: The aims of this study were (1) to determine the one-year prevalence of injuries and their characteristics and (2) to analyze potential injury risk factors in high-level/national-level women artistic gymnasts. Methods: Competitive women artistic gymnasts training more than 10 h per week in a national training center and a TOP 12 club in France were invited to participate in a retrospective study through an online questionnaire about their self-reported injuries and potential injury risk factors (e.g., previous injuries, diseases, weight modification) during the 2020/2021 season. Results: A total of 88 gymnasts between 9 and 23 years old, who trained on average 22.0 \(\pm\) 6.2 h per week, answered the questionnaire. Ninety-five injuries were reported by 62 (70.5%) of the 88 gymnasts. The one-year injury prevalence was 70.5% (95% CI 60.9 to 80.0%). Gymnasts had, on average, 1.1 \(\pm\) 1.0 injuries per year. The most common reported injury location was the knee (25.3%), and the most common reported injury type was the ligament (26.3%). Having an injury during the previous season (OR = 9.06; CI 95% 2.66 to 36.73; \(p=0.0007\)) and using a prevention program (OR = 3.97; CI 95% 1.46 to 11.15; \(p=0.007\)) were associated with a higher risk of injury in the multivariate analysis. Conclusions: More than 70% of French high-level/national-level gymnasts had at least one injury during the 2020/2021 season. This high injury rate supports the need to promote injury prevention. However, in the present study, using a prevention program was associated with a higher risk of injury. There is thus a need to improve injury prevention strategies to counter the high injury risk and its potential consequences.  
gymnastics; sport injury; mental health; nutrition; sleep; epidemiology