esa-sceva/satcom-chunk-collection huggingface dataset:
## 4 Discussion
Research should be carried out to propose methods and algorithms for upper layer design goals and objectives. Existing protocols can also be investigated to devise a complete protocol stack for RPW communication. Sensor-fault detection is a considerable issue in the deployment of digital twins in Industry 4.0 [29]. RPW can be investigated to solve this problem. The challenges of link quality, noise and interference, and environmental impacts in wireless sensor networks can also be addressed by employing RPW [30]. Use of RP-MPSK for non-industrial applications such as mobile communication is another potential research direction. RPW also has a great potential to solve the problem of reliable broadband connection in remote and rural areas. It can provide a reliable satellite link by mitigating atmospheric perturbations. Another interesting application is non-destructive testing of orthotropic materials [31]. In short, since RPW is a nascent wireless communication technology, it has a vast room for researchers to explore on various levels and in various fields.
## 2 Data and Methods
### Study Area and Data
#### 2.1.3 Other Data  
The administrative division data used in this study are used to define the research scope, while the road data specifically refer to the three-level and higher road network data. In addition, high-precision human residential point data from OpenStreetMap, which include various categories such as town, village, hamlet, city, locality, suburb, and county, are utilized in this study. Furthermore, the LandScan dataset, provided by the Oak Ridge National Laboratory (ORNL), offers detailed information on population counts and density at a 30 arc-second (approximately 1000 m) resolution on a global scale.
# A Systematic Review of the Trends and Advances in IFC Schema Extensions for BIM Interoperability
## 3 Evolution, Architecture, and Implementation of the IFC Schema
### Inheritance and Objectified Relations  
The IFC schema uses inheritance and objectified relations to leverage the rich semantics defined in each of the layers to specify the properties and attributes of specific entities. Figure 3 provides an example through the entity _IfcWallStandardCase_. This entity defines a standardized wall with a constant thickness and is a subtype of _IfcWall_. Both entities, _IfcWall_ and _IfcWallStandardCase_, are part of the _IfcSharedBuildingElements_ in the shared/interoperability layer and are subtypes of the _IfcBuildingElement_, which in turn is an entity of one of the core extension layers (i.e., _IfcProductExtension_). The supertypes of the _IfcBuildingElement_, _IfcElement_, and _IfcProduct_ are again subtypes of the kernel entities, _IfcObject_, _IfcObjectDefinition_, and _IfcRoot_.  
Meanwhile, the material attributes of the _IfcWallStandardCase_ entity are not encapsulated in the entity itself but specified using _IfcMaterial_, an entity in the resource layer. Their relation is made explicit using a third entity, _IfcRelAssociatesMaterial_, which objectifies their relationship. This objectified relation is specified as an inverse expression called _HasAssociates_ and declared in the _IfcObjectDefinition_ entity.  
The inheritance structure and objectified relations are realized using rules and expressions defined in EXPRESS, which abide by the objected-oriented programming framework. EXPRESS-G, a graphical modeling notation developed within STEP and used for the definition of IFC, is used to graph the entities, the data attributes of entities, and the relationships that exist between entities.  
Figure 3: Inheritance mechanism of an IFC.
# On the Performance Analysis for CSIDH-Based Cryptosystems
## 4 Implementation and Security Analysis
While this speed gap is meaningless because the hybrid method surpasses both algorithms, we conclude that the potential derived from the applicability of 2-isogenies makes CSIDH on the surface more attractive as computing 2-isogeny in CSURF [14] does not require sampling of a 2-torsion point. On the other hand, CSURF is slower than other algorithms, since the tweaked Montgomery curves have inefficient elliptic curve arithmetic - DBLADD and isogeny evaluation - compared to the Montgomery curves in projective coordinates. Thus, deducing from the implementation of CSIDH and CSURF, instead of using tweaked Montgomery curves, CSIDH on the surface can be executed more efficiently by using a prime of the form \(p\equiv 7\mod 8\) and the Montgomery curves. When prime \(p\equiv 3\mod 8\) is used, then we can implement CSIDH efficiently on the floor by exploiting the hybrid method proposed in [10]. Moreover, it is recommended to use [PERSON]'s collision-free method, since an attack on the collision can potentially exist. \begin{table}
\begin{tabular}{c c c c c} \hline \hline  & **CSIDH [6]** & **[PERSON]’s [13]** & **Hybrid [10]** & **CSURF [14]** \\ \hline \multirow{2}{*}{\(p_{1}\)} & 32.39 ms & 30.77 ms & 28.68 ms & - \\  & 110,401,470 cc & 104,866,008 cc & 97,752,709 cc & - \\ \hline \multirow{2}{*}{\(p_{2}\)} & 29.62 ms & - & 28.01 ms & 39.38 ms \\  & 100,945,178 cc & - & 95,480,448 cc & 134,216,582 cc \\ \hline \multirow{2}{*}{Interval} & \([-5,5]^{74}/[-5,5]^{73}\) & \([-1,1]\times[-5,5]^{73}\) & \([-5,5]^{74}/[-5,5]^{73}\) & \([-137,137]\times[-4,4]^{3}\times[-5,5]^{45}\times[-4,4]^{25}\) \\ \hline \multirow{2}{*}{Security} & 255.998/252.536 & 254.123 & 255.998/252.536 & 252.535 \\ \hline \hline \end{tabular}
\end{table} 
Table 4: Wall-clock time and clock cycles of group action of CSIDH-based algorithms (original).
# Development and Evaluation of Doppler Ultrasound Training Phantom for Human Vessel Simulation
## 2 Materials and Methods  
### Vessel-Mimicking Phantom  
The vessel-mimicking phantom was created using agarose gel (Sigma-Aldrich, Saint Louis, MO, USA) to simulate soft tissue. Agarose gel was chosen as the mimicking material due to its acoustic impedance, which ranges from 1489 to 1600 m/s, similar to that of human soft tissue (1540 m/s). It has a density of 1016 to 1100 kg/m\({}^{2}\) and attenuation of 0.04 to 1.40 dB/cm [25; 29].  
Figure 1a is a frame design used in the making of the vessel-mimicking phantoms, made of acrylonitrile butadiene styrene (ABS). The blood vessel simulation was achieved using a 10 mm ABS rod. The trapezoidal-shaped phantom frame (Figure 1a) had dimensions of 100 mm in height, 50 mm in width, an upper side measuring 40 mm, and a lower side measuring 60 mm. The trapezoidal shape was chosen to incline the upper surface, preventing the beam direction of the probe, and the angle of blood flow, from reaching 90\({}^{\circ}\). Figure 1b is a vessel-mimicking phantom created using the frame shown in Figure 1a.  
The production process of the vessel-mimicking phantom is as follows: 2% weight/volume (\(w/v\)) agarose gel was added into 300 g of deionized water, and the mixture was stirred using a magnetic stirrer (PC-420D, Corning, NY, USA) at a speed of 260 rpm at 280 \({}^{\circ}\)C for 30 min. Observations revealed that the initially opaque mixture began transitioning into transparency after approximately 17 min. After a total of 30 min, the mixture became completely transparent. To remove ultrasound image artifacts caused by air bubbles, a degassing process was carried out for 10 min, using a vacuum degas system (GAST; Model DOA-P704-AA, Benton Harbor, MI, USA), after the completion of stirring. Given the agarose gel's tendency to solidify rapidly, care was taken not to exceed an appropriate duration for the degassing process. Subsequently, the degassed mixture was poured into the trapezoidal frame, as shown in Figure 1a, and left to solidify for 4 h.  
Figure 1: **(a)** The vessel-mimicking phantom frame. **(b)** The vessel-mimicking phantom made of agarose gel, photographed from the left and top. The dashed lines represent the simulated vessel.
###### Abstract  
Extreme temperature events are becoming more frequent due to global warming, and have critical effects on natural ecosystems, social and economic spheres, human production and life. Predicting changes in temperature extremes and trends under future climate scenarios helps to assess the impact of climate change accurately. Based on climate observations from 54 meteorological stations in the North China Plain and the projection data from seven general circulation models (GCMs) from the Coupled Model Intercomparison Project phase 6 (CMIP6), this paper researches nine representative extreme temperature indices under four typical climate scenarios. The aim is to reveal the temporal and spatial variations in extreme temperature indices in the North China Plain during the past (1971-2010) and the future (2061-2100). The results show that: using a support vector machine (SVM) to perform regression analysis on the multi-GCMs prediction results, the root mean square error (RMSE) and relative standard deviation (RSD) of the multi-model ensemble simulations obtained by the SVM method are lower than those of the arithmetic mean method and can better match the trend of the historical extreme temperature index; the extreme high temperature index is predicted to show a significant upward trend in the future, while the extreme low temperature index will decrease significantly; and there are significant spatial differences in the extreme temperature index in both historical and future periods, with the extreme temperature index under the high radiation forcing scenario (SSP585) showing the most considerable variation and the most significant spatial differences.  
Keywords:extreme temperature index; global climate models; the SVM; north China plain; CMIP6
# Effective Bus Travel Time Prediction System of Multiple Routes: Introducing PMLNet Based on MDARNN
## 4 Results and Discussion
### Model Verification
#### 4.3.2 Analysis of Sub-Module Results  
The errors analyzing the neural network models for the four sub-models are depicted in Table 9; the MAPE values for all four models register below 3%, while the MAE values remain under 1 min. In summary, the performances of MAE, MAPE, and MSE metrics across all four models demonstrate effective results, affirming the efficacy of each model.  
In the MDARNN model for the Bus Stop Dwelling Time module and Stop-to-Stop Travel Time module, the impact of the number of bus stations on error features is depicted in Figure 10; the horizontal coordinate indicates the number of consecutive stations involved in the prediction of dwelling time and the vertical coordinate indicates the error (MAE, MSE or MAPE). The figure suggests that as the number of stations increases, both MAE and MSE values exhibit a corresponding rise. In contrast, the MAPE value maintains a relatively consistent level.  
Figure 10: The values of MAE, MSE, and MAPE in different stop. (**a**) The values of MAE, MSE, and MAPE of Bus Stop Dwelling Time. (**b**) The values of MAE, MSE, and MAPE of Stop-to-Stop Travel Time.  
\begin{table}
\begin{tabular}{l c c c} \hline \hline
**Module** & **MAE (min)** & **MAPE (\%)** & **MSE** \\ \hline Current Driving Segment Travel Time & 0.63 & 2.75 & 0.97 \\ Bus Stop Dwelling Time & 0.052 & 1.32 & 0.098 \\ Stop-to-Stop Travel Time & 0.96 & 0.87 & 1.12 \\ Transfer Point Waiting Time & 0.79 & 2.81 & 0.88 \\ \hline \hline \end{tabular}
\end{table}
Table 9: Performance metrics of sub-models.  
Figure 11 displays the error features associated with various transfer points shown in Table 4. As shown in figure, the performance of the LSTM network in this module performs relatively well for different lines, with MAE within 1 min and MAPE less than 0.03.
# Regular Equivalence for Social Networks
## Appendix A Barabasi-Albert Graphs  
Throughout this work, experiments with the minimal regular coloring algorithm have been performed with generated scale-free networks. A specialized and efficient Barabasi-Albert graph generator was built and here we provide details about its design and the rationale behind the decisions made.  
The distribution of the vertex degrees in scale-free graphs follows a so-called power law. This means that the probability for a vertex to have degree \(k\) is inversely proportional to \(k^{\alpha}\) for some \(\alpha\) called the scaling exponent, that is, \(P[k]\propto k^{-\alpha}\). For real-life networks it holds that, in case they are scale-free, one typically has \(2\leq\alpha\leq 3\). Of course, real-life networks are often not scale-free at all.  
A Barabasi-Albert-style graph generator is built upon the principle of a growth process combined with the idea of preferential attachment. The first version of this generator only produced scale-free networks with \(\alpha=3\), but it was generalized and expanded through the work of many researchers, allowing different parameters, one of the most important being \(\alpha\). Other work focused on mimicking the clustering coefficient of real-life networks, among others.  
We implemented a version of the generalized Barabasi-Albert random scale-free graph generator, which is in common use in the scientific community [12; 13]. As an input, the procedure expects a small network \(G_{0}\) with \(n_{0}\) vertices and no edges, together with parameters \(m\), the number of edges each new vertex receives, and \(c\), a parameter that influences the rate of new edges between already existing vertices. The code will add edges by repeatedly executing these three steps:  
1. Add a new vertex \(v_{s}\) to \(V_{s-1}\).
2. Add \(m\leq n_{0}\) new edges, each one between \(v_{s}\) and some vertex \(u\in V_{s-1}\), which is randomly chosen with a probability proportional to its degree.
3. Add \(c*m\) new edges, each one randomly chosen between vertices \(u\in V_{s-1}\) and \(v\in V_{s-1}\), with a probability proportional to the product of their degrees.  
The resulting scale-free network will have scaling exponent \(\alpha=2+\frac{1}{1+2c}\)[9]. The algorithm has been optimized for efficiency in runtime and memory-usage and allows fractional parameters using an improved statistical approach to edge-generation.
# Characterization of Congolese Woody Biomass and Its Potential as a Bioenergy Source
## 3 Results
### Economic Analysis Based on the Price and Energy Density of the Forest and Savannah Biomass Fuels  
Forest and savannah biomass are readily available in Nguela village and hold significant potential for bioenergy production. Conducting an economic analysis based on biomass pricing is crucial. The estimated delivery cost of forest and savannah biomass for energy production depends on the processes of harvesting, handling, transportation, and storage. To minimize these costs, the harvested biomass will be dried and ground on-site to produce pellets for energy production. This approach aims to reduce transportation and storage costs while enhancing energy production efficiency. Pellets are particularly suitable for bioenergy production due to their high energy density, which refers to the amount of energy delivered per unit of mass or volume of fuel, measured in kWh/kg.  
Savannah biomass from 1 hectare produces 14.56 tons of biomass, supplying 218.4 GJ of energy. In terms of energy density, 14.56 tons of biomass provide 4.16 kWh/kg. Consequently, 1/2 hectare, yielding 7.28 tons, delivers 2.0833 kWh/kg.
# Privacy-Preserving Ride-Sharing System with Minimum-Detouring Route
###### Abstract  
Online ride-hailing (ORH) services allow people to enjoy on-demand transportation services through their mobile devices in a short responding time. Despite the great convenience, users need to submit their location information to the ORH service provider, which may incur unexpected privacy problems. In this paper, we mainly study the privacy and utility of the ride-sharing system, which enables multiple riders to share one driver. To solve the privacy problem and reduce the ride-sharing detouring waste, we propose a privacy-preserving ride-sharing system named _pShare_. To hide users' precise locations from the service provider, we apply a zone-based travel time estimation approach to privately compute over sensitive data while cloaking each rider's location in a zone area. To compute the matching results along with the least-detouring route, the service provider first computes the shortest path for each eligible rider combination, then compares the additional traveling time (ATT) of all combinations, and finally selects the combination with minimum ATT. We designed a secure comparing protocol by utilizing the garbled circuit, which enables the ORH server to execute the protocol with a crypto server without privacy leakage. Moreover, we apply the data packing technique, by which multiple data can be packed as one to reduce the communication and computation overhead. Through the theoretical analysis and evaluation results, we prove that _pShare_ is a practical ride-sharing scheme that can find out the sharing riders with minimum ATT in acceptable accuracy while protecting users' privacy.  
online ride-hailing; ride-sharing matching; privacy-preserving; location privacy; path planning
# Automotive Vulnerability Disclosure: Stakeholders, Opportunities, Challenges
## 2 Vulnerability Disclosure
### The Protection of the User as the Main Objective of Standardized Processes  
Before standardized processes were recognized, vulnerabilities found were often published anonymously in public due to fear of legal prosecution or a lack of appropriate reporting contacts (known as zero-day disclosure, full disclosure). The problem for manufacturers and users is not only the risk of the vulnerability being maliciously exploited, but also the lack of access to valuable detailed knowledge about the existing vulnerability. Full Disclosure is not the preferred solution, as it ultimately serves the interests of none of the parties involved. Both manufacturers and users are directly exposed to enormous risks and the finder usually achieves the opposite of what he or she wanted to achieve. Namely, reputation or money and closed security gaps before any harm is done. Two standards have been developed for the disclosure of vulnerabilities, which on the one hand define a responsible publication process (ISO/IEC 29147 [15]) and on the other hand define the internal company handling of reported vulnerabilities (ISO/IEC 30111 [16]). In particular, ISO/IEC 29147 propagates limited disclosure, i.e., the publication of only selected information at specific points in time. This strategy places the protection of the user and the cooperation of all parties involved in the foreground (responsible disclosure). In 2010, the Google Security Team criticized in an article [17] the way in which responsible disclosure is implemented in some companies, as it sees the propagated responsible behavior as often not being treated seriously by vendors (\"...responsible disclosure is a two-way street...\"). It is probably for this reason that Microsoft in particular has contrasted responsible disclosure with the concept of coordinated disclosure [18]. The distinction is marginal and consists in the fact that the finder of a vulnerability is not only seen as a valuable provider of information, but as an equal partner in the process. The harmonious relationship between interests of all parties involved is even more in focus here and should ultimately serve the main goal of protecting users. The finder thus has even more transparency regarding implementation, progress, and time management of patch development and release. He in particular discusses appropriate patching times with the manufacturer and possibly third parties on an equal footing. The goal is to avoid conflicts and to ensure that vulnerability information is only made public after a patch or at least a mitigation of the given vulnerability problem has been made available.
## 4 Discussion
### Limitations and Future Works  
Despite the high resolution and contrast compared with DAS, the image quality based on fkCS is not as good as beamformers based on MV, especially with low compression rate. It can be seen in Figure 10g that there are artifacts around the bright region when the compression rate decrease to 30%. Even compound imaging cannot eliminate these artifacts. In order to further improve the image quality, more research can be conducted in the compression process and reconstruction algorithm. A good compression process can not only compress the data load with a lower compression rate, but also improve the image quality after recovery. In this paper, we chose discrete sinusoidal as the sparse basis and the Gaussian matrix to construct the sampling matrix. The restoration algorithm is the re-weight minimum-focal underdetermined system solver algorithm (RM-FOCUSS). There are many studies in this field which can be combined with plane wave beamforming to improve the image quality.  
In addition, this method is only available with plane wave emitted by linear array transducer. For the diverge wave emitted by curve array transducer, [PERSON]'s f-k migration is not suitable anymore due to the phase shift. Curve array transducers are widely used in practice, so it makes sense to combine the compressive beamforming with a migration method suitable for diverge wave.
# Multi-Objective Defocus Robust Source and Mask Optimization Using Sensitive Penalty
###### Abstract  
The continuous decrease in the size of lithographic technology nodes has led to the development of source and mask optimization (SMO) and also to the control of defocus becoming stringent in the actual lithography process. Due to multi-factor impact, defocusing is always changeable and uncertain in the real exposure process. But conventional SMO assumes the lithography system is ideal, which only compensates the optical proximity effect (OPE) in the best focus plane. Therefore, to solve the inverse lithography problem with more uniformity of pattern in different defocus variations, we proposed a defocus robust SMO (DRSMO) approach that is driven by a defocus sensitivity penalty function for the first time. This multi-objective optimization samples a wide range of defocus disturbances and it can be proceeded by the mini-batch gradient descent (MBGD) algorithm effectively. The simulation results showed that a more robust defocus source and mask can be designed through DRSMO optimization. The defocus sensitivity factor \(s_{\beta}\) maximally decreased 63.5% compared to conventional SMO, and due to the low error sensitivity and the depth of defocus (DOF), the process window (PW) was further enlarged effectively. Compared to conventional SMO, the exposure latitude (EL) maximally increased from 4.5% to 10.5% and DOF maximally increased 54.5% (EL = 5%), which proved the validity of the DRSMO method in improving the focusing performance.  
caputational lithography; source and mask optimization (SMO); defocus robustness; process window enhancement; multi-objective optimization Article