esa-sceva/satcom-chunk-collection huggingface dataset:
# Linear Method for Diagnosis of Inter-Turn Short Circuits in 3-Phase Induction Motors
## 5 Experiment and Discussion  
### Experimental Conditions  
In this experiment, a 3-phase induction motor with the specifications as in Table 1 was used.  
In addition, the experiment was performed under the following conditions to consider changes in the load conditions.  
* Operation of an induction motor by using inverter;
* Adjustment of the motor operation speed by using dynamometer;
* The initial speed--the rated speed 1690 [rpm];
* operating time--turn short per 30 [s];
* Sampling rate and the number of samplings: 10,000 [S/s], 10,000 [s];
* The frequency of samplings: 1 [s].  
During this time, two coils close to the turn number of the winding were randomly short-circuited. The current was measured using an i5s AC current clamp by Fluke and data were collected using a USB-DAQ 9215A with BNC by National Instruments.  
Figure 6 shows the structure of the total system.  
\begin{table}
\begin{tabular}{c c} \hline \hline
**Description** & **Value** \\ \hline Power & 0.75 [kW] (1 [HP]) \\ Input Voltage & 220 [V]/380 [V] \\ Full Load Current & 3.8 [A]/2.2 [A] \\ Supply Frequency & 60 [Hz] \\ Number of Pole & 4 \\ Number of Rotor Slot & 44 \\ Number of Rotor Slot & 36 \\ Full Load Torque & 0.43 [kg-m] \\ Rated Speed & 1690 [rpm] \\ \hline \hline \end{tabular}
\end{table}
Table 1: Motor specifications.  
Figure 6: Experimental device configuration.  
The measurement result of the input stage showed that the input power contained noise, as shown in Figure 7a. Thus, the cut-off frequency was set at 100 [Hz] by Butterworth third-order IIR filtering, and the filtering was processed as shown in Figure 7b.  
Furthermore, the short of the stator winding was configured artificially as shown in Figure 8a, and the winding was connected to an external tab as shown in Figure 8b.  
Table 2 shows a turn-to-turn short according to the tab connection. It shows the ITSC when turns no. 1-3 were connected. When turn no. 5 was connected, the turn-to-turn short increased to a 4-turn short.
# Spatial Analysis for Landscape Changes: A Bibliometric Review
## 3 Results
### Types of Spatial Analysis  
Although spatial analysis is a relatively broad term adopted for different and wide research disciplines, an analysis of keywords can be useful to extract information about the main methods and approaches used in s.a.l.c research. To this aim, data were cleaned manually and only keywords concerning methods were left in the analysis. Moreover, keywords with a broader meaning such as \"spatial analysis\", \"remote sensing\", or \"geospatial analysis\" were excluded.  
A synoptic scheme of such an analysis is reported in Figure 8, where one can observe the overlay between the co-occurrences map and its overlay with the publication year. Table 1 shows the first 50 keywords, in order of importance for their occurrences: the two top keywords represent, respectively, the traditional method used to analyze a landscape and one of the more innovative methods. In fact, the keyword \"classification\" (359 occ.) can be correlated to the results of the landscape analysis, whereas the second one (i.e., \"simulation\", 205 occ.) has a strong connection with the approaches adopted for the validation of the results or landscape modeling. Other relevant keywords are the tools used by spatial analysis, such as \"indicators\" (170 occ.) and \"metrics\" (156 occ.), or more innovative and specific methods such as \"cellular automaton\" (113 occ.), \"change detection\" (104 occ.), \"spatial autocorrelation\" (103 occ.), \"gradient analysis\" (84 occ.), \"species distribution model\" (82 occ.), and \"regression\" (80 occ.). Among them, \"cellular automation\" is maybe the most innovative, since has been recently introduced and represents a spatially distributed evolution of artificial intelligence algorithms. Finally, in 10 th place, we find the term \"(DEM, 72 occ.)\", which represents the basic elements of most of the landscape analysis approaches. Additional information about research trends in the s.a.l.c. topic can be inferred from the temporal variation of the keyword occurrences: for example, the prevalence of keywords such as DEM, statistical analysis, data analysis, or regression in the 2012-2013 period (blue tones in Figure 8) seems to suggest research approaches mainly based on visual inspection and basic statistical analysis, while the appearance of peculiar terms in 2016 such as random forest, Markov chain, machine learning, or cellular automata clearly indicates a transition toward the automatic or semi-automatic classification of landscape changes.  
Figure 8: Overlay map for the types of spatial analysis more occurred in s.a.l.c. research topic. Made with VOSviewer.
## 3 Wireless Sound-Based Channel
### Information Coverage  
In this section, we explain in detail how the audio is processed as a stereo signal with two channels, both of which were used for the coverage signal. For the wavelet analysis,we employed the Haar wavelet function over each of the arrays of each audio channel, as previously mentioned, which generates the \(cA1\) and \(cD1\) coefficients. Subsequently, we used the resulting \(cA1\) coefficient for further analysis. This process involved applying another wavelet analysis to the \(cA\)'s coefficients, continuing up to four levels of analysis. Figure 1 illustrates this multilevel analysis. The final \(cA4\) coefficients serve as the carrier signal in which the information is concealed.  
The hiding procedure for the information of the nodes starts by selecting a percentage of modification in each of the audios, this percentage varies for each audio, Table 1 presents a set of the percentages selected for some of the audios in the dataset. The audio signal gets distorted and provides less coverage at a higher modification percentage, none of the audios could support more than 2% of modification over the detail coefficient at the fourth level. The percentage selected is transformed into the number of bits to modify (C) at the fourth detail coefficient. The coefficient is segmented into \(C\) chunks. The last value of each of the chunks is modified to the result of \(x_{new}=(x_{original}+m)\times\alpha\) (see Figure 2), the probe message to be covered was a message of \"1's\" of length \(=C\), so \(m=1\). The \(\alpha\) value is set to achieve greater discretion to the modification and it was obtained by empirical methods to achieve a coefficient that allows a modification without being noticed, for this probe \(\alpha=0.009\). The inverse transform is made by replacing the original 4 th detail coefficient with the modified one (Figure 3). The results of the modified audios are reported in Table 1. Finally in Figure 4, we present the reconstructed signal separated by channel. It is important to note that the sounds used in this study are real and have not been simulated or synthesized.  
Figure 1: Signal decomposition in four levels after applying a wavelet transformation. The coefficient in gray is the Detail coefficient that hosts the modifications.  
Figure 2: The cA coeffient is divided into \(C\) chunks, then we select the last value of each of the chunks, and the insertion is made by calculating \(x_{new}=(x_{original}+m)\times\alpha\).
###### Abstract  
The Tactile Internet (TI) characterises the transformative paradigm that aims to support real-time control and haptic communication between humans and machines, heavily relying on a dense network of sensors and actuators. Non-Orthogonal Multiple Access (NOMA) is a promising enabler of TI that enhances interactions between sensors and actuators, which are collectively considered as users, and thus supports multiple users simultaneously in sharing the same Resource Block (RB), consequently offering remarkable improvements in spectral efficiency and latency. This article proposes a novel downlink power domain Single-Input Single-Output (SISO) NOMA communication scenario for TI by considering multiple users and a base station. The Signal-to-Interference Noise Ratio (SINR), sum rate and fair Power Allocation (PA) coefficients are mathematically derived in the SISO-NOMA system model. The simulations are performed with two-user and three-user scenarios to evaluate the system performance in terms of Bit Error Rate (BER), sum rate and latency between SISO-NOMA and traditional Orthogonal Multiple Access (OMA) schemes. Moreover, outage probability is analysed with varying fixed Power Allocation (PA) coefficients in the SISO-NOMA scheme. In addition, we present the outage probability, sum rate and latency analyses for fixed and derived fair PA coefficients, thus promoting dynamic PA and user fairness by efficiently utilising the available spectrum. Finally, the performance of 4 \(\times\) 4 Multiple-Input Multiple-Output (MIMO) NOMA incorporating zero forcing-based beamforming and a round-robin scheduling process is compared and analysed with SISO-NOMA in terms of achievable sum rate and latency.  
5G; B5G; power domain; SISO; MIMO; NOMA; tactile Internet +
Footnote †: journal:  
Article  
A Study of Downlink Power-Domain Non-Orthogonal Multiple Access Performance in Tactile Internet Employing Sensors and Actuators
# Evaluating the Efficiency of Physical and Cryptographic Security Solutions for Quantum Immune IoT
## 7 Discussion
### On the Advantages of Simulation Based Evaluations  
Previous benchmarking efforts for post-quantum security have focused on execution time and computational complexity. An important advantage of our work was that we gained a holistic overview of the energy consumption. Different operations (CPU, GPU, memory, disk, as well as transmissions and receiving on different channels) consume different amounts of energy, and this information is notavailable just by counting computing cycles or times. With the simulated approach, we can quickly find energy-consumption related problems in unoptimized implementations and algorithms.  
Another advantage of the simulator is that we can easily study the algorithms on platforms that are not yet available. For instance, in this study, the QQS algorithms and testsuites were tested on Raspberry Pi platforms even though the QQS has not been ported and does not work on the standard 32-bit Raspbian OS.  
The simulation approach has also its limitations. The simulation covers cryptographic as well as secrecy coding operations. It currently does not simulate the radio transmission and receiving operations in the physical layer. However, we addressed these shortcomings by complementing the simulation results with an analysis that utilizes known results on the energy efficiency of communication.  
Related Benchmarks of Post-Quantum Security  
The designers of the original NewHope and Frodo algorithms provided benchmarking results of their implementations. Optimized implementations of NewHope have also been proposed and their computational performance measured on Intel platforms. [PERSON] et al. (2016) even evaluated their NewHope algorithm also in the ARM platform. However, the results have focused on computational complexity (where units have been cycle counts). On the Intel platform, the relative performance difference between NewHope and Frodo seems to be even larger than in our simulated Raspberry ARM platform ([PERSON], 2016). The measured time in NewHope was 0.146 ms for Alice and 0.164 ms for Bob, while in Frodo the time was 1.26 ms for Alice and 1.34 ms for Bob.  
[PERSON] et al. (2016) presented an efficient hardware (FPGA) implementation of NewHope. In their implementation, the costs (or execution time) was 0.1709 ms for Alice and 0.1624 ms for Bob. Our results indicate that, on unoptimised IoT platforms, the time overhead can be significantly (even ten times) larger and that the division of costs between Alice and Bob can be more asymmetric.
## 1 Introduction
Polar codes have been widely used in communication systems, including 5G networks and beyond [27, 28, 29]. One disadvantage of polar codes is that when the codeword length is not long enough, the error performance with SC decoding is mediocre. Successive cancellation list (SCL) decoding for polar codes was proposed in Tal and Vardi [30] for improving error rate performance. The use of polar codes in relaying systems has been considered in [31, 32, 33, 34]. The original polar codes are non-systematic and therefore not suitable for the MWRN of [12]. The first systematic polar encoding algorithm was proposed by [PERSON] [35]. Most research on systematic polar encoding has focused on the implementation and optimization of this algorithm [36, 37, 38]. A modified systematic encoding method was proposed by [PERSON] et al. [39, 40], where the information bits are preserved at the input of the encoder. However, the above approaches mainly focus on reducing the encoding complexity, and none of the encoding functions are implemented by directly using a systematic generator matrix as required in the MWRN system of [12]. Therefore, an appropriate systematic encoding method of polar codes needs to be devised in order to make polar codes suitable for the MWRN system of [12]. This paper considers polar codes with Differential Binary Phase Shift Keying (DBPSK) modulation for MWRN. Compared to similar relaying systems employing LDPC codes, polar codes reduce the decoding complexity while still maintaining a comparable error performance. In this paper, we show how to employ systematic equivalent polar codes in MWRN and present the corresponding SC and SCL decoding algorithms for such systems. Then we analyze and compare the encoding and decoding complexity with maximum likelihood (ML) decoding for any linear block code, for LDPC codes with log-BP decoding, and for polar codes with SC and SCL decoding. While many other decoding techniques exist for polar codes [24; 41; 42; 43; 44; 45; 46; 47], in this paper, we choose to consider the classical SC and SCL algorithms, providing results that can be used as benchmarks when considering other techniques. Because of the selective DetF relaying protocol used in MWRNs, the relays transmit intermittently. Different transmission cases are considered based on whether the terminals know which relays transmit or not. Simulation results show that MWRNs with polar codes provide significant gain compared to uncoded schemes. For short polar codes, the error performance is compared with ML decoding. For longer polar codes, the performance is compared with LDPC codes with log-BP decoding. The rest of this paper is organized as follows. Section 2 introduces the system model and analyzes the encoding and decoding complexity with ML decoding and LDPC codes with log-BP decoding. Section 3 demonstrates how to employ systematic equivalent polar codes in MWRN with DBPSK and analyzes the corresponding decoding complexity. Section 4 presents performance simulation results of MWRN employing polar codes and a comparison with ML decoding, as well as with LDPC codes using log-BP decoding. Section 5 presents the conclusions.
# Path Planning of Underground Robots via Improved A* and Dynamic Window Approach
## 4 Experiment and Analysis
### Improved A* Algorithm Experiment
#### 4.1.1 Anti-Diagonal Collision Experiment  
In Section 2.2, it is elaborated in detail that the purpose of introducing the intersection point is to avoid the robot directly crossing the corner point of the obstacle when moving diagonally. The relevant experiment results are shown in Figure 10.  
By comparing Figures 4 and 10, it can be clearly observed that direct contact with the obstacle corner is successfully avoided after the concept of the intersection point is introduced. The comparison results fully verify the effectiveness and practicability of the proposed anti-diagonal collision strategy.
Recent research has picked up on the importance of geometry deformation and has started to become a subject of interest for obtaining realistic artwork. Most of the methods used can be classified into methods that are specialized for a particular use-case [2; 3] and more general-use methods [4]. Examples of the former can be seen in the fields of character style transfer [3] and face deformation [2]. On the other hand, there have been approaches that try to broaden the domain of objects that can be deformed. Such an example is Deformable Style Transfer [4] (DST), which manages to create a technique that is not restricted to a particular use-case. Their framework can take any images that have similarities and attempt to deform them accordingly. Although great results have been achieved with the methods mentioned, they all have a common limitation: they are limited to deforming only one object at a time. Henceforth, we would like to explore some ways to apply a similar method to images with multiple objects or points of interest.  
The method proposed in this paper takes one content image and multiple style images as input. Out of these style images, only one is an artistic-style image used for the \"traditional\" style application (which tries to imitate the colors, brush strokes, etc.), while the others are geometric-style images used for applying their shape/geometry to our content image. The first step is to detect objects in the original image, and then to attempt to find matching points for each detected object within the artistic images using a Neural Best Buddies (NBB) [5] network. The artwork that has the best match with the classified object is chosen, and the corresponding deformation is applied to the object using DST. The process is repeated until all detected objects have been deformed, and the results are merged using Poisson blending [6], thus obtaining an image deformed using the style of multiple artworks. Finally, the style of the artistic-style image is applied using NST to obtain the desired result. The proposed framework thus allows to obtain more varied artistic images in terms of style compared to previous proposed methods.  
The rest of the paper is organized as follows. Section 2 is dedicated to related work. Section 3 contains the description of the framework. Section 4 presents some performance comparisons with other existing techniques, and the results of a human evaluation study performed on a set of generated images using our implementation. Lastly, Section 5 presents conclusions and possible future work in this field.
## 3 Efficient Dynamic Perception Net
### Ice Thickness Calculation  
After obtaining the segmented image of ice-covered transmission lines, the ice-covered area and the background area are filled with black and white pixels of different pixel values; the ice-covered area is marked as white pixels, and the background area is marked as black pixels, achieving binary processing of the image. Then, by traversing the number of pixels in the white and black areas, the ice-covered area and background area can be calculated. By calculating the proportion of white pixels in the overall image and then the proportion of the ice-covered area to the overall area, the resulting ratio can be calculated.  
In order to accurately identify the thickness of ice, it is necessary to calculate the pixel ratio of the transmission line itself to the overall image when there is no ice cover. By obtaining clear images of the same transmission line in an ice-free state and repeating the aforementioned segmentation, binarization, and pixel statistics processes, the proportion of ice-free transmission lines can be determined. Comparing the actual pixel area under ice cover with the theoretical pixel area without ice cover, infer the additional pixel area due to ice cover and combine it with the known radius of the transmission line to calculate the ice-cover thickness. The calculation formula for the ice thickness of the transmission line is as follows:  
\[h=\frac{1}{2}\bigg{(}\frac{D_{1}\mathrm{d}_{2}}{d_{1}}-D_{1}\bigg{)} \tag{11}\]  
\(D_{1}\) is the diameter of the actual transmission line, \(d_{1}\) is the number of pixels of the actual line image transmission line, \(d_{2}\) is the number of pixels of the transmission line in the ice-covered line image, and \(h\) is the ice thickness. By utilizing the proportional relationship between the actual size of the image and the pixel area, the proportion of pixels in the image can be converted into the actual ice thickness.
## 3 Application Domains
### Workplace Safety  
Another important issue in the industrial environment is related to workers' safety. Indeed, workplace hazards and faults can be easily and promptly detected thanks to _personal monitoring_ and _environmental monitoring_[41]. In Industry 4.0, enabling technologies for workplace safety are embedded sensors placed on assets and workers' personal devices that, thanks to M2M communications, can be used to raise an alarm as soon as a possible hazard is detected. For example, smart helmets [42; 43] can be used and integrated with information coming from static sensors, in order to monitor CO\({}_{2}\), SO\({}_{2}\), SH\({}_{4}\), wind speed, humidity and temperature.
# Middle Rock Pillar Stability Criteria for a Bifurcated Small Clear-Distance Tunnel
###### Abstract  
Middle rock pillars (MRPs) play a crucial role in the stability of bifurcated small clear-distance tunnels. Assessing the stability of the MRP is a key challenge in design and construction. This study focuses on the bifurcated small clear-distance section of the Xiamen Haicang Shugang evacuation channel underground interchange tunnels. The stability criteria for the MRP during both the early design and later construction stages were analyzed by using the strength reduction method (SRM) via numerical simulations. In the design stage, the SRM was applied to determine the stability limit state of the MRP. Relationships between rock mass density, cohesion, and elastic modulus were identified, and these parameters were combined with basic cohesion values for an initial stability assessment. During the construction stage, the full excavation process was analyzed by examining the distribution and changes in the plastic zone of the rock mass. Two key construction stages, a 10 m excavation on the main line upper step and a 10 m excavation on the ramp upper step, were identified as points where the plastic zone of the MRP began to form on the sidewall and the center, respectively. Multiple linear regression was used to determine the displacement, stress, and plasticity criteria for MRP stability. A comprehensive criteria formula incorporating the width-span ratio, tunnel vault settlement, and horizontal clearance convergence was developed, providing technical guidance and a scientific basis for similar projects.  
bifurcated small clear-distance tunnel; middle rock pillar; stability criteria
# IoT Services for Monitoring Food Supply Chains
## 2 Literature Review
### Temperature and Humidity Control in Cold Chain Logistics
This temperature control is vital for inhibiting bacterial growth, which can compromise food safety and lead to health risks if the products are not kept within the appropriate temperature range [13]. For instance, when it comes to fresh produce, which includes a vast array of fruits and vegetables, the recommended temperature range for storage and transportation is typically between 0 \({}^{\circ}\)C and 5 \({}^{\circ}\)C. This specific temperature range is crucial for maintaining the freshness of the produce and preventing spoilage, which can occur rapidly if temperatures exceed this threshold. For frozen food items, including frozen meals and vegetables, strict temperature requirements mandate that these products be stored and transported at temperatures below \(-18\)\({}^{\circ}\)C. Adhering to this standard is crucial to prevent spoilage and ensure that the quality of frozen products is maintained throughout the cold chain process [14].