esa-sceva/satcom-chunk-collection huggingface dataset:
# A Novel Multipath Transmission Scheme for Information-Centric Networking
## 6 Conclusions  
In this paper, we propose a novel multipath transmission scheme which is applied in an IP-compatible ICN architecture. First, we introduce the overall layout of our ICN protocol stack and describe the principle and process of multipath transmission in detail. Then, we focus on how to make full use of multipath resources and propose a path management mechanism. In the path selection phase, we select several relay nodes as initial temporary solutions based on historical transmission information. In the path switching phase, path reselection can be performed during transmission by measuring the congestion degree of the selected sub-paths. Finally, we conduct simulation experiments to evaluate the performance of our proposed method. The experimental results show that our proposed method has an excellent performance in terms of average throughput, average flow completion time, and average chunk completion time.  
In future research, we will focus on the following two aspects. Firstly, a reasonable data scheduling strategy is required to allocate the data ratio of each sub-path to ensure load balance. Secondly, the mathematical apparatus used in this paper is valid, but quite simple. Considering that the path selection method based on historical information cannot avoid the underlying overlapping paths, we will redesign the path selection strategy according to the network topology information obtained from the controller to eliminate the correlation of paths.  
Conceptualization, Y.X., H.N. and X.Z.; methodology, Y.X., H.N. and X.Z.; software, Y.X.; writing--original draft preparation, Y.X.; writing--review and editing, H.N. and X.Z.; supervision, X.Z.; project administration, X.Z.; funding acquisition, H.N. All authors have read and agreed to the published version of the manuscript.  
This work was funded by the Strategic Leadership Project of the Chinese Academy of Sciences SEANET Technology Standardization Research System Development (project no. XDC020/0100).  
**Institutional Review Board Statement:** Not applicable.  
Figure 8: The cumulative distribution of the CCT.
## 3 Development and Verification of the Inspection Device for Field Application
### Cross-Assessment of Measurements Data through MCNP Simulation
#### 3.2.3 Verification and Comparison with Field Measurements Using FLUKA Simulation  
The simulated geometry closely resembled the actual device, revealing a similar dose distribution trend at a 15\({}^{\circ}\) angle from the tungsten collimator when leaking from a horizontal pipe position, as depicted in Figure 8.  
\begin{table}
\begin{tabular}{c c c} \hline
**Type** & & **Details** \\ \hline Blackhole area & Size & 100 m \(\times\) 100 m \(\times\) 20 m \\ Evaluated area & Size & 50 m \(\times\) 50 m \(\times\) 20 m \\ Shielded for Radiography Testing & Size & 200 mm \(\times\) 380 mm \\ Thickness & 10 mm (Lead) \\  & Dia. & 500 A \\ Pipe & (out. 558.8 mm) \\ (for inspecting) & Leng. & 10 m \\ Thickness of shielding material & 5.5 mm (Iron) \\  & Intensity & 47 Ci \\ Source & Active Source Size & 3.0 \(\times\) 3.0 mm \\  & (Dia.) & 97, 121, 136, 264, 279, 401 keV \\  & Energy Spectrum (peak) & 97, 121, 136, 264, 279, 401 keV \\  & Angle range of irradiation & 30\({}^{\circ}\)\(\times\) 15\({}^{\circ}\) \\ Collimator & Size & Leng. & 72 mm \\  & Depth. & 41 mm \\  & Thickness of shielding material & 21 mm (Tungsten) \\ \hline \end{tabular}
\end{table}
Table 7: Modeling geometry to perform simulations.  
Figure 8: _Cont._  
Figure 8: FLUKA simulation results according to initial design conditions. (**a**) Three-dimensional modeling and placement according to initial shielding design. (**b**) Dose distribution derived from the X–Y axis. (**c**) Dose distribution derived from the Y–Z axis (section at 11 m based on the X axis). (**d**) Dose map for determining leakage areas through position movement on the Y–Z axis (section at 55 m based on the X axis).  
Analysis of the dose map along the X-Y and Y-Z axes showed scattered irradiation extended approximately \(\pm 11\) m in the X direction and over 52 m in the Y direction from the viewpoint. The radiation scattering angle confirmed by simulations was approximately 26.3\({}^{\circ}\) from the center. These findings suggested that the initially designed shielding range should be expanded. Considering the 26.3\({}^{\circ}\) angle distribution around the center, the minimum required shielding width was determined to be 274 mm.
# Multidisciplinary Reliability Design Optimization Modeling Based on SysML
## 3 Representation of Optimization Problems Using SysML
### Definition of Extension Types for Optimization Types
#### 3.1.3 Optimization Objective Metamodel  
The extension of optimization objectives is similar to that of optimization constraints. In some cases, optimization objectives and constraints can be interchangeable. For example, the mass of a module can serve as either a system optimization constraint or an optimization objective. As illustrated in Figure 7, optimization objectives also inherit from the SysML constraint block and include seven attributes: name, equation, owner, variable, parameter, disciplinary, and direction. The direction attribute defines the value orientation of the objective function, indicating whether the objective is to be maximized or minimized. We define its data type as Boolean, where 0 represents minimization and 1 represents maximization.
## 4 Pilot Studies  
The pilot studies were carried out in two stages. The first stage consisted in examining four people (two women and two men aged 45-55 years) with simulated pattern dysfunction. In the second stage of the study, one man was completely blind from birth (age group 65+) and had been using Braille books since childhood. All persons consented to the disclosure of their image.  
The aim of the research carried out on a group of people with simulated visual impairment was to test the acceptance of 3D printed models for kinaesthetic cognition. Information was collected about the perceived quality of the surface of the object as a whole and about the places of the object where the supports were printed, as well as about the size of the objects and the recognition of its individual details. The research was carried out in \"Lab 3D\" at the Lublin University of Technology.  
In the case of the blind person, the scope of the research was extended by collecting information on the legibility of the descriptions written in Braille (in various scales, as seen in Figure 11b), which were integrated onto the surface of the object. The research was conducted at the respondent's place of residence.  
Stage 1--tests with simulated visual impairment.  
The research was carried out according to the following scheme:  
* Participants were brought into the room and had a non-translucent eye shield;
* The objects were placed in front of the examined person;
* The participants of the study were asked to try to classify the object into the appropriate group (e.g., mug, jug shell) and to identify individual details of the touched object (handle, spout condition, decorative elements, Braille inscriptions);
* The participants examined the surface roughness of the individual copy elements, as seen in Figure 12;
* The participants were asked to comment on the size of the tested object (this only concerned the jug).  
Figure 11: (**a**) A model of a jug with integrated descriptions in Braille; (**b**) the scales of the inscriptions in the following lines (starting from the top) were: 100%, 110%, 120% and 130%.  
Figure 12: Studies involving people with simulated visual impairment.  
Figure 13: Research with the participation of a blind person.  
The subjects were asked to comment on their impressions and what they felt through touch out loud. The entire course of the research was recorded on a Dictaphone (the respondents gave their consent). This allowed for their later listening, study and analysis. This solution allowed them to focus on conducting the research and did not distract the respondents. Before starting the research, the participants were informed that they would receive two objects for recognition. There was no information about the technique with which they were made and where they came from. Information was also provided on what they should pay attention to when touching the objects. During the research, the person conducting the experiment asked additional questions and asked about some details of the object. The order in which the objects were given was random.
## 4 Design and Implementation of Matched Filter Based on High-Power Clock Multiplexing  
### Matched Filter Length Design  
According to Formula (11), when the length of incoherent accumulations \(L\) is fixed, the values of \(P_{acq}\) under different normalization thresholds are different, and \(P_{acq}\) can reach the maximum at a certain threshold. The maximum value of \(P_{acq}\) is different under different incoherent accumulation lengths, and is denoted as \(P_{max}(L)\). Increasing the length of incoherent accumulations can improve the success probability of acquisition at suitable thresholds. As can be seen from Figure 8, the larger the length of incoherent accumulations, the larger the \(P_{max}(L)\) value, and it gradually tends to \(1\). According to the requirement of acquisition success probability, when the maximum acquisition success probability under a certain incoherent accumulation length is large enough, the appropriate length of incoherent accumulation can be obtained. A detailed simulation is shown in Section 5.1.  
Figure 7: Signal acquisition decision diagram.
## 3 Kd-Trees
### Construction  
A _kd-tree_[37] for a set \(X\) is a binary tree with the nodes labelled by non-empty subsets of \(X\), following the conditions:  
1. label(root) = \(X\), the whole set
2. label(leaf) = \(\{\mathbf{x}\}\), one point
3. label(internal node) = label(left child) \(\sqcup\) label(right child), the disjoint union of the sets below  
In our work, we apply the kd-tree to the set of all test points (not the set of all training points). Typically, these are part of a triangular mesh and thus represent positions in three-dimensional Euclidean space. Therefore, a node can be described by a bounding rectangular box or cuboid. Several possible splitting criteria have been proposed to split the nodes recursively [21]. As described in detail in [38], a commonly used method is splitting a node along the median of its widest dimension. For a _balanced_ kd-tree, #(left child) \(\approx\) #(right child) in each node. Balancing a kd-tree optimizes search times for random points [39]. Nearest neighbour search in a kd-tree with randomly distributed points takes an empirically observed average running time of \(\mathcal{O}(\log(n))\)[40].  
For trees with large nodes, as in our case, calculating the median becomes time-consuming. According to [41], a faster approach to construct the kd-tree is splitting a node in half along its widest dimension. However, this approach does not guarantee a balanced tree. Nonetheless, the imbalances observed when working with points that are spread evenly on a high resolution triangular mesh are negligible. This approach is also explained in [42; 43]. Alternatively, Ref. [39] also states that simply alternating the dimension to split along would be even faster, since this eliminates the need to check for the widest dimension or calculating the median. Locally, triangular meshes become almost flat 2D surfaces. Using all three dimensions in an alternating way introduces very underpopulated nodes. These imbalances have a negative effect on overall performance. However, for point clouds that do not represent a 2D surface embedded in 3D, this is a viable alternative.  
In our implementation, the kd-tree is fixed and fully constructed beforehand. Alternatively, the kd-tree could be adaptive to incoming data points, expanding nodes only when needed, i.e., when they are close to data points according to the criteria mentioned. We leave this for future work.
## 5 Using MEC to Augment the Computing Capabilities of Vehicles
### Resource Allocation
Additionally, they put forth an efficient matching technique that solves the MINLP while considering both user and edge server preferences for selection. Service migration is a crucial step in ensuring users receive service continuously. The user must decide whether to migrate, because they usually are within range of several small BSs. Considering this, there are two basic user service strategies [127]. When a user switches from one small BS to another, they can either (a) continue using the previous edge server to complete tasks and receive the computed results or (b) transfer the service to a different edge server. This resource-provisioning issue might be viewed as a matching problem between edge servers and users [128]. Users can choose from a variety of computing resources provided by edge servers, and edge servers and users are matched. Therefore, to create a competitive resource allocation scheme, the authors devise a matching algorithm. Figure 9: VFEC network architecture [123]. In ref. [129], authors researched the use of intelligent offloading and caching techniques for link control in MEC systems. The goal of this study is to optimize QoS through coordinated resource allocation and MEC in multiaccess heterogeneous networks, aiming to guarantee the users' QoS requirements while also optimizing system energy efficiency. First, a new objective function is created for the multiserver MEC scenario, taking into account various offloading and computation methods, in order to reduce the time it takes for all tasks to be completed and to achieve the highest possible energy efficiency while still meeting deadlines. Secondly, the basic optimization problem is changed to a MINLP by adding interference coordination and user association and continuing carrier allocation variables to the objective function. The authors suggest a method to match users with suitable channels for optimal access, considering data rate limits and transmission power constraints. This involves pairing each user with a channel and using a Dinkelbach-like technique to attain the best resource allocation. In ref. [130], researchers introduce a framework which considers an orchestration for edge and cloud endpoints [131], structured in three planes. They transform the scheduling challenge into an MDP and tackle it using Deep Deterministic Policy Gradient (DDPG) [132], leveraging reward functions to enhance exploration performance and mitigate the dispersion of good scheduling rewards. NoisyNet [133] is integrated with the suggested scheduling technique. They also create a Mobility-aware (MA) component to detect the temporal and spatial distribution of mobile devices and forecast their motion. This component is further improved with the suggested method to effectively make decisions about computational task offloading and resource assignment. Regardless of the number of mobile devices, their work provides the lowest maximum latency among all alternatives [130]. The above works are summarized and compared in Table 5.
# Review of Image-Based 3D Reconstruction of Building for Automated Construction Progress Monitoring
## 4 Knowledge Gaps and Challenges
### Disputes about Prior Information  
As mentioned above, point clouds and BIM models can be used to infer geometric changes and construction progress, and image information such as color and texture can be used to make the inference more accurate. However, due to the complex structure of the building nested in large and small spaces, self-occlusion is inevitable. Therefore, it is obviously unrealistic to obtain information of all the building components only through images.  
In many studies, prior information, such as logical and physical relationships between objects or geometric primitives, is used to assist reasoning or reduce the ambiguity of recognition results. Usually, such relationships are represented by semantic net [24; 63], as shown in Figure 12. However, it must be acknowledged that this information will not be totally reliable, since the only way to truly gain confidence that a component is frinished is to visually verify it [32]. If the prior information plays a major role, most of the results can be inferred from them, as shown in Figure 13. These results may not be consistent with reality violating the original intention of monitoring. Therefore, how to reasonably use prior information is a question that needs to be explored.  
Figure 12: Semantic net [63].  
Figure 13: Precedence relationship graph [25].
# Refinement Orders for Quantitative Information Flow and Differential Privacy +
## 4 Privacy-Based Refinement
### Differential Privacy and \(d\)-Privacy  
Differential privacy relies on the observation that some pairs of secrets _need to be indistinguishable_ from the point of view of the adversary in order to provide some meaningful notion of privacy; for instance, databases differing in a single individual should not be distinguishable, otherwise the privacy of that individual is violated. At the same, other pairs of secrets can be allowed to be distinguishable in order to provide some utility; for instance, distinguishing databases differing in many individuals allows us to answer a statistical query about those individuals.  
This idea can be formalized by a _distinguishability metric_\(d\). (To be precise, \(d\) is an extended pseudo metric, namely one in which distinct secrets can have distance \(0\), and distance \(+\infty\) is allowed.) Intuitively, \(d(x,x^{\prime})\) models how _distinguishable_ we allow these secrets to be. A value \(0\) means that we require \(x\) and \(x^{\prime}\) to be completely indistinguishable to the adversary, while \(+\infty\) means that she can distinguish them completely.  
In this context, a mechanism is simply a channel (the two terms will be used interchangeably), mapping secrets \(\mathcal{X}\) to some observations \(\mathcal{Y}\). Denote by \(\mathbb{M}\mathcal{X}\) the set of all metrics on \(\mathcal{X}\). Given \(d\in\mathbb{M}\mathcal{X}\), we define \(d\)-privacy as follows:  
**Definition 3**.: _A channel \(C\) satisfies \(d\)-privacy iff_  
\[C_{x,y}\leq e^{d(x,x^{\prime})}C_{x^{\prime},y}\qquad\text{for all $x,x^{\prime} \in\mathcal{X},y\in\mathcal{Y}$} \tag{15}\]  
Intuitively, this definition requires that the closer \(x\) and \(x^{\prime}\) are (as measured by \(d\)), the more similar (probabilistically) the output of the mechanism on these secrets should be.  
**Remark 1**.: _Note that the definition of \(d\)-privacy given in (1) is slightly different from the above one because of the presence of \(\varepsilon\) in the exponent. Indeed, it is common to scale \(d\) by a privacy parameter \(\varepsilon\geq 0\), in which case \(d\) can be thought of as the \"kind\" and \(\varepsilon\) as the \"amount\" of privacy. In other words, the structure determined byon the data specifies how we want to distinguish each pair of data, and \(\varepsilon\) specifies (uniformly) the degree of the distinction. Note that \(\varepsilon\cdot d\) is itself a metric, so the two definitions are equivalent._  
Using a generic metric \(d\) in this definition allows us to express different scenarios, depending on the domain \(\mathcal{X}\) on which the mechanism is applied and the choice of \(d\). For instance, in the standard model of differential privacy, the mechanism is applied to a database \(x\) (i.e., \(\mathcal{X}\) is the set of all databases), and produces some observation \(y\) (e.g., a number). The _Hamming_ metric \(d_{\mathrm{H}}\)--defined as the number of individuals in which \(x\) and \(x^{\prime}\) differ--captures standard differential privacy.
###### Abstract  
A novel ring oscillator-based Vernier-type time interpolation method, known as the fine-timestamp maker, is proposed for field programmable gate array (FPGA)-based time-to-digital converters (TDCs). This method determines lower measurement dead time and improves resolution by using a bi-time interpolation scheme, first presented in this paper. Additionally, a group of cascaded delay units are packaged as an intellectual property core (DU-IP) to form a ring delay line and to adjust its length via the engineering change order (ECO) tool, which makes the adjustment of the ring oscillator's frequency more linear and less position dependent. A prototype TDC was implemented on a Kintex-7 FPGA. The experimental results demonstrate that a single TDC channel only consumes 35 DFFs, 31 LUTs, and 16 CARRY4 logics after specific adjustment. The results, with a time resolution of 20 ps, dead time of 58 ns, and a root-mean-square error of 15-20 ps, show a significant performance improvement compared to traditional Vernier-type TDCs.  
time-to-digital converter; FPGA; Vernier; high precision; high throughput; IP core
## 5 Conclusions  
The main conclusions of this study are as follows:  
1. Based on the Uninformative Variable Elimination method, the sensitive variables for predicting the moisture content of outgoing corn can be effectively screened from 18 to 8, which effectively decreases the redundancy and multicollinearity of the data in the MLR model. The importance of sensitive variables in modeling is emphasized, and the coefficient of determination R\({}^{2}\) of the ELM model is improved up to 0.02, while the improvement in the LSTM model is up to 0.05.
2. The prediction model for outgoing corn moisture content, based on ELM and LSTM methods, achieves a better fitting effect and higher prediction accuracy compared to MLR. The UVE-LSTM model, with a batch size of 30, a learning rate of 0.01, and 100 iterations, achieves a training set R\({}^{2}\) of 0.931. When the UVE-ELM model uses _sigmoid_ as the activation function and the number of neurons is set to 14, the model runs at a speed of 0.02 s and achieves the best prediction effect. The R\({}^{2}\) of the training and validation set of the UVE-ELM model are 0.943 and 0.946, respectively, with the prediction errors of 0.544% and 0.581%, demonstrating its superior prediction ability. It provides a more scientific method for predicting corn drying moisture content and lays the foundation for using the prediction model to guide actual production.  
Conceptualization, S.X.; Methodology, S.X. and X.G.; Software, S.X. and Z.L.; Formal analysis, S.X.; Investigation, G.L.; Resources, S.X., Z.L., D.W. and G.L.; Data curation, Z.L. and X.G.; Writing--original draft, S.X., Z.L., X.G., D.W., G.L., Y.C. and Y.L.; Writing--review & editing, S.X. and X.G.; Visualization, Y.L.; Supervision, Y.C.; Project administration, Y.C.; Funding acquisition, Y.C., Z.L. and G.L. All authors have read and agreed to the published version of the manuscript.  
This research was funded by Liaoning Provincial Natural Science Foundation-Superficial Project-\"Research on the Mechanism of Multi-physical Field Coupling in Corn Drying Section\" (2022-MS-068), The Presidential Foundation of the Liaoning Academy of Agricultural Sciences (NO2024 MS0606) and 2023 Special Project for Young and Middle-aged Scientific and Technological Innovative Talents in Shenyang City (RC230459).  
Not applicable.  
Data Availability Statement: The datasets presented in this article are not readily available because the data are part of an ongoing study. Requests to access the datasets should be directed to the corresponding author.  
The authors declare no conflict of interest.