esa-sceva/satcom-chunk-collection huggingface dataset:
# An Investigation of the Selection of LEED Version 4 Credits for Sustainable Building Projects
## 5 Discussion
### Achieved Categories Were Changed Compared with Previous Versions  
In the last few years, several pieces of research on the selection of LEED credits have been conducted. However, most of the available studies have differences from the purpose of finding achieved categories of the study, such as using the data of LEED version 2.2, LEED adaptations [19; 34], or sample regions [1; 32; 35; 37; 42], or not considered [21; 22; 40; 41]. Therefore, the adherence rate for the main LEED criteria groups is shown in Table 5. Comparing the results with those reported in an earlier study [10] that collected similar data for the previous LEED implementation, LEED 2009, there has been a significant shift in the tendency to select the various criteria groups. Although the thresholds are now higher for the various criteria designed to reduce and optimize energy usage, all the criteria related to the operation costs of buildings such as water and energy efficiency have higher achievement rates in projects built to meet the new standards. Compared with the previous analysis [10], the achievement rates for criteria in the \"energy and atmosphere\" standards increased by 16.6%, rising from 40.3% for LEED 2009 to 56.9% for LEED v4. \"Water efficiency\" also increased, rising from 60.80% to 64.58%. This may be either because the technologies now available deliver higher electricity efficiency and lower water consumption, or due to the growing public awareness of the depletion of these limited resources. Interestingly, achievement levels for two of the groups, \"materials and resources\" and \"indoor environmental quality,\" are markedly lower for LEED v4 than for LEED 2009, which may be due to the difficulty of satisfying the new more stringent standards. The achieved high rate (77.59%) of the regional priority credit (RP) showed the success of the regional priority program in efforts to promote green buildings to new areas by balancing location advantages.
# New Protocol and Architecture for a Wastewater Treatment System Intended for Irrigation
## 3 Results
### Status of the SDs
Thus, we identify a pattern of storing information until midday when all the data are sent to Node 2, and then Node 2 sends data to the gateway to free its SD. The maximum amount of stored information is 106,486 bits (13.3 Kbytes).
# On the Lagged Diffusivity Method for the Solution of Nonlinear Finite Difference Systems
## 3 The Lagged Diffusivity Method
### Effect of the Discretization  
In the previous paragraphs, we applied the lagged diffusivity method to Equation (9), which was obtained by discretizing time using a \(\theta-\)method. The time discretization, however, affects some properties of the lagging iteration. For instance, if we can use an IMEX method and treat \(\mathbf{G}(\mathbf{u})\) explicitly, the lagged diffusivity method completely linearizes the discretized system.  
Analogously, an IMEX scheme can simplify the analysis of cases with non-constant velocity terms: if we can treat non-constant terms \(\mathbf{\tilde{v}}(\mathbf{u})\) explicitly, all the convection terms are evaluated at the previous time level and are, thus, known. Both monotonicity and convergence analyses can then be traced back to the results obtained for constant \(\mathbf{\tilde{v}}\).  
Figure 1 summarizes all these cases, representing which functions are unknown at each time level and at each lagging iteration.  
Finally, although formally the system does not change, also the space discretization has an effect on the solution procedure. Indeed, we noticed earlier that \(A(\mathbf{u})\) is always an M-matrix when the upwind discretization is used, while we have a condition on the step-size \(h\) when central finite differences are used. If \(A(\mathbf{u})\) is an M-matrix, also the coefficient matrices of the linear systems arising from applying a [PERSON]'s method to solve Equation (10) are M-matrices. This is important since some linear solvers converge only when the coefficient matrix is an M-matrix. We can thus always use these solvers when we use the upwind discretization, while we can do so only when condition Equation (7) is satisfied when we use central FD. This is of great importance especially when \(\mathbf{\tilde{v}}\) is large: indeed, in this case the coefficient matrix of the linear systems is highly non-symmetric and we would like to use splitting methods such as the Arithmetic Mean (AM) [14], which are particularly efficient in this case but require that the coefficient matrix is an M-matrix. Thus, also considering that Equation (7) implies that \(h\) must be really small when \(\tilde{v}\) is large, we may want to use an upwind discretization in order to use these linear solvers. This is further studied in the numerical experiments.
# Scheduling the Exchange of Context Information for Time-Triggered Adaptive Systems
###### Abstract  
This paper presents a novel metascheduling algorithm to enhance communication efficiency in off-chip time-triggered multi-processor system-on-chip (MPSoC) platforms, particularly for safety-critical applications in aerospace and automotive domains. Time-triggered communication standards such as time-sensitive networking (TSN) and TTEthernet effectively enable deterministic and reliable communication across distributed systems, including MPSoC-based platforms connected via Ethernet. However, their dependence on static resource allocation limits adaptability under dynamic operating conditions. To address this challenge, we propose an offline metascheduling framework that generates multiple precomputed schedules corresponding to different context events. The proposed algorithm introduces a selective communication strategy that synchronizes context information exchange with key decision points, thereby minimizing unnecessary communication while maintaining global consistency and system determinism. By leveraging knowledge of context event patterns, our method facilitates coordinated schedule transitions and significantly reduces communication overhead. Experimental results show that our approach outperforms conventional scheduling techniques, achieving a communication overhead reduction ranging from 9.89 to 32.98 times compared to a two-time-unit periodic sampling strategy. This work provides a practical and certifiable solution for introducing adaptability into Ethernet-based time-triggered MPSoC systems without compromising the predictability essential for safety certification.  
adaptation; communication efficiency; energy efficiency; metascheduling; MPSoC environment; resource allocation; static remapping; time-triggered architecture; time-triggered systems +
Footnote †: journal: _Algorithms_
## 4 Results and Comparison
### PNR-TDNN Experiments  
Unlike models that utilize MFCCs for speaker verification, the PNR-TDNN employs the output features of a pre-trained network for the speaker verification task. These features, with their higher dimensionality, provide increased flexibility and enable adaptability across diverse application scenarios. This results in slower convergence rates in recognition networks, so training epoch is set to 60.
## 3 Surface Plasmons in Photonic Integrated Circuits
### LSPR for Molecules Biosensing  
Plasmonic biosensing [88; 89; 90; 91; 92] was initially mainly based on functionalized gold films and propagative plasmons (SPR technology) to exploit localized surface plasmons in metallic nanostructures arrays on glass (LSPR technology) [19; 93], as used in present commercialized setups. Such functionalized substrates are used in complex 3D optic systems made of prisms and lenses with the following principle: metallic (gold) nanostructures are grafted with molecule receptors (often thiols), and molecules to be detected are brought to these receptors by a microfluidic system. The trapping of the molecules is detected by the plasmonic resonance shift induced by the complex index modification near the metallic structure, where a diffraction-limited laser beam in the Kretchman configuration excites the plasmon [94]. In LSPR systems, the sensor sensitivity is limited by the optical power available for each functionalized nanostructure because of the poor mode matching, as explained above. By using the same detection principle, the excitation of LSPs can be realized in guided configurations, with two main advantages:  
* The excitation electromagnetic energy can be fully transferred to the LSP, like in the case of a 5 MNP chain [95], leading to an improved sensitivity,
* Parallel or series sensing areas can be implemented on the chip with the same optical source, considerably enhancing the global analysis capacity.  
Figure 6 shows such a guided LSPR sensor including a chain or 5 MNPs, and the resonance spectral shift induced by grafted thiol molecules which form an equivalent layer  
Figure 5: Localized plasmon waveguide integrated on SOI (TE mode). **(a)** Sketch of the structure. **(b,c)** FDTD-calculated dispersion curves for d = 150 nm, r\({}_{\rm x}\) = 42.5 nm, r\({}_{\rm y}\) = 100 nm, t = 30 nm (the permittivity of gold is obtained using a Drude model fitted to ellipsometric measurements). **(d)** A typical spatial distribution of the two supermodes. **(e,f)** Electric field intensity in the case of a finite chain of **(e)** 5 or **(f)** 20 nanoparticles. Inspired by [85].  
with a thickness of t = 2 nm and index of n = 1 + \(\Delta\)n. This shift (\(\Delta\lambda\)) has been numerically evaluated and experimentally checked as corresponding to the relation \(\Delta\lambda\)(nm) \(\approx\) 27 (t(nm) \(\times\)\(\Delta\)n)\({}^{0.75}\). The expected sensitivity to the environment of this sensor integrated on SOI can reach a value up to 270 nm/RIU (Refractive Index Unit) [95].
## 5 Conclusions  
A two-dimensional beam scanning model for a rotating dual grating based on inertial navigation feedforward technology was established, and the correctness of the model was verified. The Fuzzy PID control algorithm was compared with the traditional PID control algorithm, highlighting the advantages of Fuzzy PID in the rotating dual-grating scanning system. A Fuzzy PID control system for the rotating dual-grating two-dimensional scanning model based on inertial navigation feedforward technology was designed and analyzed, achieving fast and stable scanning under complex sea conditions. A scanning experimental platform was constructed to validate the rotating dual grating scanning system. Under maximum ship-attitude disturbances (10\({}^{\circ}\), 0.1 Hz), the system demonstrated a 0.5 mrad peak scanning error with 0.328 mrad RMS accuracy, achieving full 360\({}^{\circ}\) FOV coverage in 28 s. Compared to the traditional control system, the proposed system improves scanning accuracy by more than 40.85% and increases scanning speed by over 21.42%. The experimental results validate the effectiveness and superiority of the Fuzzy PID control system for the rotating dual-grating two-dimensional scanning model based on inertial navigation feedforward technology, proving that the system can achieve fast and stable scanning on a shipborne platform, with significant application value. This provides theoretical reference and technical support for the application of rotating dual grating electro-optical scanning technology in shipborne laser communication and other practical engineering fields. In the future, improvements will continue to be made to the rotating dual-grating electro-optical scanning system on shipborne platforms to optimize the system's scanning performance. A solution will also be proposed to address the dead-zone issue in the rotating dual-grating electro-optical scanning system and enhance the scanning coverage.  
Conceptualization, W.X.; methodology, W.X.; software, Y.L., Y.T. and Q.W.; validation, Y.L. and Y.T.; formal analysis, W.X.; investigation, W.X. and H.W.; data curation, W.X. and F.Z.; writing--original draft preparation, W.X. and F.S.; writing--review and editing, Q.W. and W.X.; supervision, Y.L. and X.Y. All authors have read and agreed to the published version of the manuscript.
* [1]**Funding:** This work was financially supported by the Science and Technology Development Plan Project of Jilin Province, China (20240304109 SF). This work was supported by the Jilin Province Science and Technology Department, China (20220201074 GX). This work was supported by the Opening Funding of National Key Laboratory of Electromagnetic Space Security, China (2023 JCJQLB044010).
* [2]**Data Availability Statement:** Data is contained within the article.  
[3]**Conflicts of Interest:** The authors declare no conflicts of interest.
## 2 Theoretical Framework
### Self-Determination Theory (SDT)
#### 2.2.2 Relatedness  
Relatedness refers to the need to establish emotional links with other individuals [75]. In an educational context, relatedness pertains to the capacity to engage in tasks that allow for collaboration and communication with other students [63]. Also, according to SDT, a student can enjoy social interactions and social connections [80].  
Educational literature shows that relatedness is the least studied need [84]. Nonetheless, some research has shown that relatedness is a strong predictor of learners' intention to continue in an educational program [85]. Perhaps it is due to the intrinsic characteristics of the educational environment, where a student can develop the ability to initiate connections with others, from which it is possible to foster the generalization of relevant behaviors [45].  
In this respect, relatedness can reduce fears and increase the tendency to share with others knowledge related to the OSS features [84]. In the field of ICT, relatedness is one of the most important incentives. People tend to value the opinions of those to whom they feel connected as highly relevant [85]. Therefore, the following hypotheses have been proposed (Figure 2):  
**Hypothesis 6 (H6).**_Relatedness (REL) has a positive effect on the perceived usefulness (PU) of OSS._  
**Hypothesis 7 (H7).**_Relatedness (REL) has a positive effect on the perceived ease of use (PEU) of OSS._
## 4 Discussion
### Practical Applications  
The findings of this study hold significant application value in the field of precision agriculture. Accurate biomass prediction provides data support for crop management, such as optimizing fertilization, irrigation, and pest control strategies, thereby enhancing agricultural production efficiency. [PERSON] et al. (2019) proposed NeFF-BioNet, which integrates point clouds and UAV images to predict crop biomass, demonstrating the potential of multimodal approaches. In contrast, the BMP_Net model proposed in this study focuses on LiDAR point clouds, offering an efficient unimodal solution.  
Moreover, above-ground biomass is closely related to the feed rate of harvesting machinery ([PERSON] et al., 2018). The high-precision predictions of BMP_Net can serve as a basis for adjusting machinery parameters, reducing efficiency losses during equipment operation. On the SGCBP dataset, the combination of BMP_Net and PSCDR achieves a MAPE of only 0.115, significantly outperforming PointMixer's MAPE of 0.194. This enables reliable technical support for the dynamic monitoring of small grain cereals such as wheat and barley. Compared to traditional manual sampling methods ([PERSON] et al., 2018; [PERSON] et al., 2018), this non-destructive prediction approach offers clear advantages in terms of efficiency and sustainability, laying a foundation for the modernization and intelligent development of agriculture. For instance, on a large-scale wheat farm, high-precision biomass maps generated by PSCDR-BMPNet could guide variable-rate nitrogen application by drones, optimizing fertilizer use efficiency for different growth zones and minimizing environmental runoff. Similarly, in barley cultivation, understanding biomass variability can inform decisions on differential harvesting strategies to maximize yield quality.  
The incorporation of the PSCDR method with BMP_Net yielded significant performance gains, as evidenced by the reduction in RMSE from 84.48 to 75.92, MAE from 67.31 to 63.19, and MAPE from 0.131 to 0.115 when compared to BMP_Net alone on the SGCBP dataset. These represent relative improvements of approximately 10.13% in RMSE, 6.12% in MAE, and 12.21% in MAPE. Such enhancements in prediction accuracy are of considerable practical importance in precision agriculture. For instance, a reduction of 8.56 g/m\({}^{2}\) in RMSE translates to a more precise estimation of available plant material per unit area. This increased accuracy can directly inform more efficient N-fertilizer management strategies, potentially leading to optimized fertilizer application rates, reduced input costs, and minimized environmental leaching. Furthermore, more accurate biomass predictions throughout the growing season can contribute to more reliable yield forecasting, aiding farmers and stakeholders in better logistical planning and market engagement. While the definition of \"sufficient\" accuracy can be application-dependent, these quantitative improvements demonstrate a meaningful step towards more robust and actionable biomass monitoring tools.
# Multi-Connectivity-Based Adaptive Fractional Packet Duplication in Cellular Networks
## 3 Multi-Connectivity in Cellular Networks
### Advantages of Multi-Connectivity
#### 3.4.4 Deployment Savings  
With the advancement of wireless communications and the increasing number of devices requiring extremely reliable and high bandwidth connections, service providersare always attempting to improve their network's coverage and capacity. This includes deploying more BS and utilizing resources from different technologies.  
The operational expense (OPEX) is very high, and a means to help transition to 5G networks is by implementing dual connectivity. This allows for existing 4G/LTE BS to work in conjunction with newer 5G-NR BS to provide better user experience. Furthermore, replacing the existing infrastructure takes many years, and MC allows for the progressive conversion to newer technology without service interruption.
# Dynamic Path Planning for Unmanned Surface Vehicles with a Modified Neuronal Genetic Algorithm
## 1 Introduction  
An unmanned surface vehicle (USV) is a type of waterborne vehicle that operates on the surface of a body of water with autonomous navigation and self-reliant planning capability [1]. USVs can be remotely controlled or can operate autonomously, relying on various sensors, navigation systems, and communication technologies. These vehicles are widely used for a variety of purposes, ranging from scientific research [2], environmental monitoring [3], and disaster robotics [4] to maritime security and military applications [5, 6]. USVs have played an essential role in oceanographic research, security and surveillance, defense and military applications, network monitoring cooperating with aerial and ground vehicles, search and rescue, and autonomous transportation [2]. More USV implementations are in the pipeline, with an increasing amount of automation research being conducted on these devices.  
Automation plays a crucial role in the development and operation of USVs. There are various critical aspects of automation in unmanned surface vehicles including navigation and path planning, obstacle avoidance and detection, remote operation and supervision, data collection, mission execution, communication and data transmission, energy management, redundancy, and fail-safe mechanisms. These aspects of automation are crucial for USVs, especially when operated in dynamic and uncertain environments, such as open water, rivers, or busy harbors. Handling dynamic obstacles, changing currents, andunpredictable weather conditions can be challenging. From these many aspects of USV automation, path planning stands out as a critical technology guaranteeing safe navigation by creating trajectories that avoid collisions [7].  
The subject of this research is a USV that performs a path planning task in a dynamic environment. We also conducted experiments in a static environment as a comparison. Figure 1 illustrates the simple USV path planning process in a dynamic environment. USV dynamic path planning becomes essential because this process can bridge the automation stage at the previous level that has been achieved (manual control and static environment) with more advanced research (autonomous navigation and cognitive planning in a complex environment) [2]. This is what motivated us to research USV path planning in both dynamic and static environments using the proposed genetic algorithm modification method.
Sensors_**2015**, _15_, 1518-1536; doi:10.3390/s150101518  
_Sensors_  
**ISSN 1424-8220**  
www.mdpi.com/journal/sensors  
_Article_  
**An Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks**  
**[PERSON] 1, [PERSON] 1,*, [PERSON] 1, [PERSON] 1 and [PERSON] 2**  
* Parana, Curitiba 80215-901, Brazil; E-Mails: [EMAIL_ADDRESS] (R.L.); [EMAIL_ADDRESS] (M.C.P.); [EMAIL_ADDRESS] (E.J.)
* Parana, Curitiba 80230-901, Brazil; E-Mail: [EMAIL_ADDRESS]  
* Author to whom correspondence should be addressed; E-Mail: [EMAIL_ADDRESS]; Tel./Fax: +55-41-3271-1669.  
Academic Editor: [PERSON]  
_Received: 21 November 2014 / Accepted: 8 January 2015 / Published: 14 January 2015_  
**Abstract:** Monitoring and data collection are the two main functions in wireless sensor networks (WSNs). Collected data are generally transmitted via multihop communication to a special node, called the sink. While in a typical WSN, nodes have a sink node as the final destination for the data traffic, in an _ad hoc_ network, nodes need to communicate with each other. For this reason, routing protocols for _ad hoc_ networks are inefficient for WSNs. Trees, on the other hand, are classic routing structures explicitly or implicitly used in WSNs. In this work, we implement and evaluate distributed algorithms for constructing routing trees in WSNs described in the literature. After identifying the drawbacks and advantages of these algorithms, we propose a new algorithm for constructing spanning trees in WSNs. The performance of the proposed algorithm and the quality of the constructed tree were evaluated in different network scenarios. The results showed that the proposed algorithm is a more efficient solution. Furthermore, the algorithm provides multiple routes to the sensor nodes to be used as mechanisms for fault tolerance and load balancing.  
**Keywords:** wireless sensor networks; distributed spanning tree algorithms; routing; shortest path trees
# Advanced SDR-Based Custom OFDM Protocol for Improved Data Rates in HF-NVIS Links
###### Abstract
Demonstration of system performance to users and investors: the validation of the system under real-world conditions and the presentation of practical results that demonstrate reliability to potential users and investors.