esa-sceva/satcom-chunk-collection huggingface dataset:
# Design of Nanosecond Pulse Laser Diode Array Driver Circuit for LiDAR
## 1 Introduction
In 2020, [PERSON] and his team employed field-effect switching devices to drive a laser, producing a peak power of 80 W and a pulse width of 3.7 ns [24]. In 2022, [PERSON] and his team implemented an application-specific integrated circuit (ASIC) for driving a vertical cavity surface emitting laser (VCSEL), achieving a peak current of up to 8 A and a pulse width of less than 1 ns [25]. In 2024, [PERSON] and his team designed a high-speed dual-channel gate driver based on charge transfer bootstrap circuits, which was used to drive a GaN MOSFET and achieved a laser pulse width of 2.5 ns [26]. The aforementioned circuits are all designed for driving a single laser. With the technological advancements in solid-state LiDAR, the requirements for laser sources are becoming increasingly stringent. For instance, wavelength-tunable lasers are employed to emit variable-wavelength laser light to gratings for beam deflection, or lasers with different wavelengths or emission directions are driven individually to achieve beam scanning [27; 28; 29; 30]. This article proposes a nanosecond-level pulsed laser diode array drive circuit to address the laser drive issue at the laser emission end of a solid-state LiDAR. This circuit boasts high repetition rates, high output power, and narrow pulse widths. When utilizing this circuit to drive an 8-channel LD array, the eight LDs emit beams in different directions, which can be conducted sequentially to achieve high-speed beam scanning. We employ FPGA to control the operation of this drive circuit and have conducted a series of experimental verifications.
# Federated Learning-Based Service Caching in Multi-Access Edge Computing System
## 4 Proposed Service Caching Framework
### Overview  
To enhance the efficiency of service caching within a system, we propose a framework that enables distributed service cache replacement. The mechanism is illustrated in Figure 2. Specifically, an FL-based method is proposed to determine the popularity score corresponding to each service. MEC servers can effectively gain knowledge of the distribution of service requests throughout the entire system while maintaining user data privacy. Additionally, a scoring system for service caching that considers both popularity and resource limitations is presented to evaluate the effectiveness of the services. Individual MEC servers can autonomously select optimal services based on the service caching score. The workflow of the proposed framework consists of the following steps.  
* The individual MEC servers accept user requests and consolidate them into local data. It should be noted that the local data are not shared with any other server.
* The popularity score of each service is determined by each MEC server using its local data and knowledge acquired from FL.
* Each MEC server calculates the caching score for each service based on its popularity score and the availability of resources. The caching scores are ranked to identify the most ideal services.  
The decision-making process of each MEC server determines the replacement of service caches. Redundant services are eliminated, while underemployed services are replicated from the cloud server.
## 1 Introduction  
### Research Background  
The climate of the United Arab Emirates (UAE) is classified as Arid (B), Desert (W), and Hot Arid (h) (Bwh) by [PERSON] and [PERSON] [1], which makes it a hot desert type climate. The mean yearly temperature, relative humidity (RH), and rainfall for Abu Dhabi (AD) is 27.6 Celsius (\"C), 63%, and 62.1 mm (mm), respectively [2]. Still in October 2019, 13 Arab countries were among the world's 19 most water-scarce countries [3,4]. Per capita, water availability in eight Middle East countries is below 200 m\({}^{3}\) per year including the UAE [5] (see Figure 1). Therefore, with such an arid climate, there is a significant need to investigate and implement all opportunities for recycling and reusing water in the built environment and their associated landscapes in AD.  
The medical facility case study (MFCS) was a 364-bedroom hospital that opened in 2015 with 50% of its footprint dedicated to landscing (33,354 m\({}^{2}\)), and the design aspirations were to target 100% non-clinical/non-potable water use for landscape irrigation (LI) and use in water features (WFs) from treated air conditioning (A/C) condensate water. Peak condensate formation occurs during the hottest and most humid months of each year (April to November) with the minimum condensate formation rates occurring in the winter and spring months between December and April [7]. This is because the MFCS does not need to be cooled in winter and spring as much as in summer.  
Hence, therein lies a problem since for five months per year (December-April) there is a predicted non-potable water deficit and desalinated potable water is required for use in LI and WFs, which is expensive and has significant associated carbon emissions from the desalination process of seawater. Thus, the research set out to investigate any additional sources of water use/harvesting that could be recycled for reuse in LI and WFs at the MFCS to mitigate the use of potable water use during the five months of the year when no treated condensate water is available [6].  
In order to investigate alternate sources of water for recycling and reuse, the research project used a mixed methods approach after Creswell and Creswell [8] to collect data on water sources available at the MFCS. The water and energy data were used to develop a sustainable water conservation and reuse (SWC) strategy (that includes the reduction of water consumption for LI by soil improvement, building water system audits, and the use of additional non-potable water sources), forming the basis of a water conservation protocol, thus enabling the MFCS to meet the five-month potable water shortfall. The results also include a greenhouse gas (GHG) metric in terms of kilograms of carbon dioxide equivalent (kgCO2e) per cubic meter (m\({}^{3}\)) to assess the carbon savings by using recycled water for LI and WFs use.
# Numerical Simulation of Non-Linear Models of Reaction--Diffusion for a DGT Sensor
## 3 Iterative Resolution of the Resulting System of Equations
All this implies that to have access to the \(j\)-th spatial position of a vector corresponding to the \(i\)-th substance, it must be calculated \(l=(i-1)*nint+j\). This relationship is used several times within the general resolution algorithm detailed in the Appendix A. It is worth noting that although the complete domain \((0,r^{*}+g^{*})\) has been divided into equal-length intervals \(\Delta z\) in every subdomain, this discretization is not essential. In fact, if required, the problem can be easily split into several subdomains, each with its own length. This provides two major advantages: on the one hand, it allows choosing small intervals where functions quickly vary (usually near the interface) and large intervals in the rest of the domain, increasing calculation speed even more. On the other hand, it allows solving configurations different from those of the conventional DGT sensor (as the case of the voltammetry detectors (\(r\to 0\)) [13], or DGT sensors with several resins [14; 15]). That is to say, with the condition that the reactions may be expressed in the basic form \(\mathrm{A}+\mathrm{B}\rightleftharpoons\mathrm{C}\), the proposed algorithm can be adapted to solve different arrangements, simply by modifying the initial and boundary conditions. Generally, the quality of numerical simulations of reaction-diffusion problems often faces some drawbacks as the values of reactions rate constants increase. Nevertheless, if the kinetics rate constants increase, while keeping their quotient constant (i.e., \(K=k_{\mathrm{a}}/k_{\mathrm{d}}=\)const), the concentration profiles tend to be those that would result in the fully labile case, i.e., the case in which the rate constants are infinite but the stability constant, \(K\), remains fixed. Thus, the use of the solution of the fully labile case could provide good initialization values for the problem with large kinetic rate constants. Unfortunately, it is not possible to obtain always the fully labile solution in the general case. For this reason, specific techniques have been developed to initialize in these cases. The general strategy is to solve the system, at each time, for a set of kinetic constants lower than desired but that provide a solution. With this result, the problem is initialized for a larger value of the constants of reaction (keeping the same \(K\) value). The procedure is repeated until the values of the require constants are reached. The described algorithm ceases to operate when the constants are enormous, but even so, it allows to explore a range of sufficiently large values to obtain conclusions about the behavior of the systems of experimental interest.
# Technology Behavior Model--Beyond Your Sight with Extended Reality in Surgery
## 6 Implications
### Social Implication  
The use of XRSGs in clinical surgery can lead to a better surgical experience, increase the success rate of surgery and save more patients [58]. Changing the way medical experts operate can lead to a better surgical experience for patients. The use of XRSG is a stepforward in the development of smart surgery, a paradigm shift from relying solely on medical experts to embracing artificial intelligence. This has changed the development of existing surgical systems. It solves the problem of social trust stigmatization of patients with high medical difficulty and high surgical risk. The application of telemedicine systems can help patients in remote areas with remote consultations and remote surgery. It also allows for international medical online surgical collaboration; the promotion of surgical research and learning in hospitals, institutions, and countries; higher chances that patients achieve the best surgical results; and the improvement of the technical professional ethics of medical experts.
# Video over DSL with LDGM Codes for Interactive Applications
## 4 Findings  
This Section firstly compares across the candidate channel codes before investigating how the proposed LDGM method performs when applied specifically to video streams. In the experiments, the code was a regular LDGM code with degree three. The parity-check matrix was created by using the classic stochastic algorithm [32]. Decoding was based on the belief-propagation iterative algorithm mentioned in Section 1.
# DynamiChain: Development of Medical Blockchain Ecosystem Based on Dynamic Consent System
## 3 Proposed System
### Restricted Medical Data Policy Applied Work Flow Specifications  
Some countries worldwide, including South Korea, still prohibit healthcare data to be stored outside certified medical institutions. Considering this, the proposed system only saves hash values of the health examination data and stores actual medical data separately in another database. Medical data's multiple hash values are stored in the blockchain ledger so that data utilizers could read the data providers' data based on set rules. Encoding-decoding access key to the actual medical data is, by default, managed by the data provider, unless the data provider delegates his or her authority to medical institutions where the actual database is stored. Using this mechanism, we balanced the data co-ownership ecosystem while preserving data integrity in a practical situation. This service process is shown in Figure 3. The hospital generates health an examination data of a data provider than the hash management system encrypts the data with the data provider's public key and stores them with the hash value of the data. The data provider then confirms the data itself and dynamic consent rule in real-time and modifies the setting of the rules if necessary. The data utilizer requests for the data of the data provider, and the hospital confirms the request. The hospital allows access to actual data transmission after the endorsement process. Finally, data utilizer read the requested data through hash value comparison.  
Hospital type data are created when data providers visit the hospital for a health examination. For each data, our proposed system stores encoded data, and accordingly, it has the data provider public key. Data providers have access to their own physical data and can set or change their dynamic consent rule in real-time. When other data utilizers (e.g., companies and research institutions) request for the allowed data providers' medical data, the data source hospital confirms this request before transmitting the actual medical data to the requested data utilizer. Thereafter, the data utilizers could read the requested data.  
Figure 3: Proposed specific blockchain service process.  
This is the key process that not only overcomes the issue of restricted health data sharing policies for some countries, but also guarantees data integrity. Note that out-hospital-data types are free from this scenario.
# Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers
## 5 An \(O(n^{2}d)\) Algorithm for Edit Distance via Input-Altering Transducers
### The Second \(O(n^{2}d)\) Algorithm for Edit Distance
**Remark 3**: _If the trim transducer \(\mathbf{t}^{\prime}_{k}\) has no final states, then \(\mathbf{t}^{\prime}_{k+1}\) has no final states if and only if none of the new created states in the optimized construction is a final state._  
Algorithm DistInpAlter  
Input: NFA **a**  
Construct the transducer \(\mathbf{i}\mathbf{a}_{1}\)--see Figure 2  
Construct the trim transducer \(\mathbf{t}^{\prime}_{1}\leftarrow\mathbf{i}\mathbf{a}_{1}\downarrow\mathbf{a}\uparrow\mathbf{a}\)  
Let \(k\gets 1\)  
Let \(\mathbf{s}\leftarrow\) the set of states of \(\mathbf{t}^{\prime}_{1}\)  
**while** (\(\mathbf{s}\) contains no final states)  
Construct \(\mathbf{t}^{\prime}_{k+1}\) from \(\mathbf{t}^{\prime}_{k}\) using the optimized construction  
Let \(\mathbf{s}\) be the set of new states in the optimized construction  
Let \(k\gets k+1\)  
**return**\(k\)  
**Theorem 3**: _Algorithm DistInpAlter computes the edit distance of the language given via a trim NFA **a** in time_  
\[O(n^{2}dr^{2}),\]  
_where \(d\) is the computed edit distance, \(n=|T_{\mathbf{a}}|\), and \(r\) is the cardinality of the alphabet used in \(T_{\mathbf{a}}\)._  
The correctness of the algorithm follows from the above optimized construction and Corollary 2. For the time complexity of the algorithm, we note the following: first, \(\mathbf{t}^{\prime}_{1}\) is constructed in time \(O(|\mathbf{a}|^{2}r^{2})\). Then, \(\mathbf{t}^{\prime}_{2},\ldots,\mathbf{t}^{\prime}_{d}\) are constructed according to the optimized construction. Each of these is constructed in time \(O(|\mathbf{a}|^{2}r^{2})\) and has \(O(|Q_{\mathbf{a}}|^{2}r)\) states and \(O(|T_{\mathbf{a}}|^{2}r^{2})\) transitions. In addition, each \(\mathbf{t}^{\prime}_{k}\) is tested for final states in linear time. **Remark 4**: _When a final state \(f\), say, of \(\mathbf{t}^{\prime}_{k}\) is created, then we know that there is an accepting path of \(\mathbf{i}\mathbf{a}_{k}\downarrow\mathbf{a}\uparrow\mathbf{a}\) ending at \(f\). The label of that path is a word pair \((u,v)\) such that \(\delta(u,v)=k\). Thus, the above algorithm can be modified to return not only the edit distance of \(L(\mathbf{a})\), but also a witness pair for that distance._
## 3 Results and Validation  
### Annual Land Cover Results from 1980 to 1990  
In experiments, it took about two seconds to run the BFAST algorithm for a single pixel. Therefore, this study focused on a smaller research area in the Heihe River Basin--Jayuguan City and Suzhou District of Jiuquan City (indicated in red in Figure 11)--to assess the feasibility of updating land cover products using the SRGAN model and BFAST algorithm. Furthermore, to enhance efficiency, the time series NDVI data were partitioned, and the BFAST program was executed in parallel on multiple CPUs and processes.  
Based on the procedure in Section 2.3.4, the land cover maps from 1980-1990 were updated and they are shown in Figure 12.  
Subsequently, the changes in the area of various land cover types in the study area from 1980 to 1990 were analyzed. The annual changes and trends in the area of different land cover types in the study area from 1980 to 1990 were found to be consistent with the changes in area between the original two time points. Overall, the land cover changes from 1980 to 1990 can be summarized as follows: (1) There was a rapid increase of 3594.87 ha (30.97%) in built-up land compared with the 1980s; (2) The area of water body decreased by 641.43 ha (\(-\)3.63%); (3) Grassland and unused land showed continuous decreases (\(-\)0.27% and \(-\)0.71%, respectively); (4) Cropland decreased slightly by 40.59 ha (\(-\)0.03%) from 1980 to 1990; (5) The forest area also exhibited a decreasing trend, with a relative stability in total forest area from 1980 to 1985 followed by an 8.16% reduction in the subsequent 5 years.  
Figure 10: Breakpoint test (example for one pixel).  
Figure 11: The location of Jiayuguan City and Suzhou District (indicated by the red line) and the Heihe River Basin (indicated by the blue line).  
Figure 12: Annual land cover maps from 1980 to 1990.  
These changes revealed a pattern of land use change characterized by the expansion of built-up land at the expense of grassland, forests, and unused land following land reclamation activities. Since the reform and opening up in 1978, urbanization has progressed rapidly, particularly noticeable after the implementation of land use right reform policy in 1988. This expansion of built-up land is observed prominently in the southern region of Jiayuguan City and the southwestern industrial park of Suzhou District in Jiuquan City within the study area (see Figure 13).
## 3 Results
### Results from BEST Procedure
#### 3.3.3 Capacity-Based Indicators  
The same statistical methods described in the previous paragraph were also used to evaluate the differences in the capacity indicators. For the LTAE NewSmoca, the one-way ANOVA showed significant differences among treatments for all the capacity-based indicators with \(p\)-values of 10\({}^{-7}\) order (P\({}_{\rm MAC}\), A\({}_{\rm C}\), and AWC) and 10\({}^{-3}\) for R\({}_{\rm FC}\). The significant differences are mainly attributable to the INT+ treatment with P\({}_{\rm MAC}\) and A\({}_{\rm C}\) values lower than those of the other two treatments and a higher R\({}_{\rm FC}\) value. In terms of AWC, however, the INT+ and INT treatments show similar values, significantly lower than those estimated for ORG. In any case, all parameters are within the ranges considered good or optimal, except for P\({}_{\rm MAC}\) for the INT+ treatment, which indicates aeration-limited soil.  
For LTAE Rotation, the results obtained from the two-way ANOVA are more complex than those obtained for the hydraulic and porosity parameters. The Residual Management factor is highly significant for parameters A\({}_{\rm C}\), R\({}_{\rm FC}\) and AWC with \(p\)-values of 1.7 \(\times\) 10\({}^{-7}\), 9 \(\times\) 10\({}^{-5}\) and 2.5 \(\times\) 10\({}^{-12}\), respectively. In particular, it can be observed (Table 2) that the burial (B) treatments have generally higher values of A\({}_{\rm C}\) and AWC and lower values of R\({}_{\rm FC}\) than removal (R) treatments. The Rotation Type factor appears much less significant, for which \(p\)-values of 0.02, 0.01 and 0.01 were found for P\({}_{\rm MAC}\), A\({}_{\rm C}\) and R\({}_{\rm FC}\), respectively. In this case, the reason is to be found in the BiFV treatment, which presents mean values that are lower for P\({}_{\rm MAC}\) and A\({}_{\rm C}\) and higher for R\({}_{\rm FC}\). The interaction RT-RM is significant only for AWC with a \(p\)-value of 1.3 \(\times\) 10\({}^{-5}\). As for the hydraulic and porosity parameters, a significant effect of the block on all the capacity parameters was also detected.
###### Abstract  
The scientific community's interest in finding an alternative to the term \"wastes\" for coffee by-products is steadily increasing. The substantial presence of polyphenols, caffeine, and tannins in these wastes could result in the contamination of water and soil, as they exhibit harmful effects on a range of plants, microorganisms, and aquatic organisms. However, these identical antioxidants can extensively be utilized in food packaging applications. In the context of active packaging, the development of bioactive food packaging films based on natural products and coffee industry wastes is of significant importance according to circular economy principles. In this study, the effect of coffee silverskin particles, i.e., waste of the coffee roasting process, and coffee silverskin aqueous extracts on the properties and antioxidant activity of wheat flour-based films with glucose for food packaging applications were evaluated. In addition, chemical structure identification, optical and morphological analysis, color measurements, and physico-chemical characterization of the films were performed, determining their water absorption, film solubility, and degree of swelling. Furthermore, the oxygen and water vapor transition rate and their antioxidant activity were also measured, and it was found that increasing the addition of coffee silverskin particles and aqueous extracts affected the properties of the films. The biocomposite films of wheat flour and glucose with coffee silverskin particles produced in this work exhibited higher tensile stress at break and Young's modulus compared with wheat flour film with no additives. However, a decrease in elongation at break was observed with increasing addition of the silverskin due to the transition from a pure elastomeric material to a crosslinked one following the formation of hydrogen bonds between the additive and the matrix, which was also found in the FTIR spectra. This work offers a new use of wheat flour and coffee silverskin as an inexpensive biocomposite material to produce multifunctional active films for food packaging applications.  
food packaging; edible films; wheat flour; coffee silverskin; antioxidant activity +
Footnote †: journal: Applied Sciences
# A Review of Early Fault Diagnosis Approaches and Their Applications in Rotating Machinery
## 2 Review of Early Fault Diagnosis Approaches
### AI-Based Early Fault Diagnosis
#### 2.2.2 Svm  
SVM, proposed by [PERSON], is one of the most widely used and effective classification algorithms. SVM is a machine leaning algorithm based on statistical learning theory (SLT). The initial idea of SVM is to use a linear separating hyperplane to divide the training samples into two classes. Generally, there are two kinds of suitable methods to complete this target [5]. The first one is to find the optimal decision hyperplane which halves the two closest samples into two convex hulls. Figure 6 shows an example of maximum margin. The second one is to discover the optimal decision hyperplane making the margin between two parallel supporting planes. Both these two methods can produce the optimal decision hyperplane and the support vectors. In practical applications, the problems based on multiple classes instead of two classes are needed to solve. The widely used methods of SVM are such as: one against (OAA) all proposed by [PERSON] [55], one against one (OAO) proposed by [PERSON] [56], decision directed acyclic graph proposed by [PERSON] (DDAG) [57] and binary tree (BT) proposed by [PERSON] and [PERSON] [58].