esa-sceva/satcom-chunk-collection huggingface dataset:
## 4 Encrypted SFC Architecture
### Service Functions  
The Service Functions (SFs), applied as VMs, are intended to manipulate the end-user data packets. We simulated that we used SFs acting as a vCPE, video caching service and a virtual firewall by using dummy services. Therefore, all SFs are configured to simply forward all data traffic according to the flow-specification rules we apply. The SFC RFC 7665 [2] defines that an SF has primarily two data plane interfaces: one for incoming and one for outgoing traffic. Inside the SF, the packet forwarding is explicitly set to follow the SFC directions and not the standard routing table. Specifically, data traffic coming in on one interface must go out on the other interface and vice versa. We solved this SF routing problem by making the SF NSH-aware. This implies that the NSH header is not removed when a packet enters an SF. Due to the lack of NSH state capabilities in operating systems such as native Linux systems, we introduce a new virtual NSH network stack inside the SF. This new network stack is an NSH-aware P4 switch which acts as a front-end network stack inside the SF. This principle of NSH-awareness in the SF is extracted from the VXLAN-tool [31] implementation and adopted to a P4 environment in order to support the new NSH header. We defined the following features in the SF:  
* One SF can appear multiple times in one single SFC. Hence, the SF is NSH-aware by using an underlying P4 switch in the SF. The P4 switch is connected to two virtual veth interfaces facing the SF application and two native interfaces facing network interfaces of the VM.
* According to the SFC specification, the SF should be independent of the IP subnet topology between the SFs. This means that the IP subnets connected to VM interfaces do not follow standard IP subnetting topologies. For example, when an SFC changes, the mac-address of the next-hop SF are also changing. From an SF perspective, this mac-address has to correspond to the next NSH hop. Hence, the virtual P4 switch in the SF must be able to map interface mac-addresses to SFs. For outgoing traffic from an SF, we use dummy static destination mac-addresses. For incoming traffic to an SF, it is the responsibility of the P4 switch to set the correct destination mac-address to the IP interface of the SF. This mac-address is based on next hop in the SFC. Hence, instead of using standard ARP as a binding between layer 2 and layer 3, we introduce a new mac-address mapping scheme between mac-addresses and NSH Service Function Identifiers. This is implemented as P4 flow-rule actions. A dynamic side effect of this is that the IPv4 addresses of the SF application theoretically can be reused for each hop in an SFC.
# Improving Non-Autoregressive Machine Translation Using Sentence-Level Semantic Agreement
## 4 Experiments
### Datasets and Settings  
#### 4.1.1 Datasets  
For a fair comparison, we followed previous works [4; 7] and conducted the experiments on the benchmark tasks: WMT 2014 EN \(\rightarrow\) DE, WMT 2016 EN \(\rightarrow\) RO, and IWSLT 2014 DE \(\rightarrow\) EN. The training datasets of these tasks contain 4.5 M, 610 k, and 190 k bilingual sentence pairs, respectively. After we preprocessed these datasets following the preprocessing steps in [15], each word in the dataset was divided into the sub-word units using BPE [16]. For WMT 2014 EN \(\rightarrow\) DE, newstest-2013 and newstest-2014 were used as the development and test sets, respectively. For WMT 2016 EN \(\rightarrow\) RO, newstdev-2016 and newstest-2016 were employed as development and test sets, respectively. Furthermore, for IWSLT 2014 DE \(\rightarrow\) EN, we merged dev2010, dev2012, test2010, test2011, and test2012 together as the test set.
## 4 Model Checking Fidelity Properties
### The Standard Bottom-Up Approach  
As one can reasonably expect, the model checking algorithm for FCTL is analogous to the one for QCTL: it follows a bottom-up approach to compute the sets \(Sat(\varphi^{\prime})\) for each the state subformula \(\varphi^{\prime}\) occurring in the formula \(\varphi\) we need to verify. Everything is the same, except for the evaluation of \(Sat(\mathbb{F}_{\sim\tau}[\psi])\). For this, first the matrix representation of the super-operator \(\mathcal{E}_{s}=Q_{s}^{\mathfrak{M}}(\{\sigma\in\mathrm{Path}^{\mathfrak{M}} \mid\sigma\models\psi\})\) is obtained, which corresponds to the analogous computation for QCTL. Then, the expression \(\mathrm{Fid}(\mathcal{E}_{s})\sim\tau\) is evaluated by converting it to the quantified constraint \(\mathtt{q}_{\sim}\ket{\eta}\in\mathcal{H}:\mathrm{Fid}(\mathcal{E}_{s}, \ket{\eta}\bra{\eta})\sim\tau\), where \(\mathtt{q}_{\leq}=\exists\) and \(\mathtt{q}_{\geq}=\mathbb{V}\). The resulting constraint, after some appropriate manipulation, is then verified by means of the existential theory of the reals.  
Example 2: _As an example of the application of the fidelity operator, consider the QMC for the loop program depicted in Figure 1 and the fidelity formula \(\mathbb{F}_{\geq 1}[(\
eg\ell_{2})\Uparrow\ell_{3}]\). We have already computedin Example 1 the super-operators \(X_{\ell_{i}}\) corresponding to the path formula \((-\ell_{2})\)\(\mathbf{U}\)\(\ell_{3}\) for each state \(\ell_{i}\), that is, \(X_{\ell_{0}}\eqsim\mathcal{E}_{0}\mathcal{A}\), \(X_{\ell_{1}}\eqsim\mathcal{E}_{0}\), \(X_{\ell_{2}}\eqsim\mathcal{O}_{\mathcal{H}}\), and \(X_{\ell_{3}}\eqsim\mathcal{I}_{\mathcal{H}}\). The formula \(\mathbb{F}_{\geq 1}[(-\ell_{2})\ \mathbf{U}\ \ell_{3}]\) holds in the state \(\ell_{i}\) if the corresponding super-operator \(X_{\ell_{i}}\) is such that \(\min_{|\eta|\land\eta\rangle\in\mathcal{H}}\operatorname{Fid}(X_{\ell_{i}},| \eta\rangle\ \langle\eta|)\geq 1\); this holds only when \(X_{\ell_{i}}\eqsim\mathcal{I}_{\mathcal{H}}\) (cf. [50]), which is true only for \(\ell_{3}\)._  
The technical details for the constructions presented in this section, as well as some improvements on the computation of \(\mathcal{Q}_{s}^{\mathfrak{M}}(\{\sigma\in\operatorname{Path}^{\mathfrak{M}} \mid\sigma\models\psi\})\), are rather involved; the interested reader can find them in [50] (Section 5), together with examples showing their application.
Thus, the main contributions of this research are as follows:  
* Extensive measurements in the Amazon environment with the transmitter at different heights: 6 m (tree trunk level), 12 m (beginning of the tree canopy), and 18 m (middle of the tree canopy);
* Analysis of signal propagation in the Amazon environment considering different polarizations of the transmitting and receiving antennas, vertical-vertical (VV) and horizontal-horizontal (HH);
* Analysis of the RSSI (received signal strength indication) and SNR (signal-to-noise ratio) variation for Amazonian environments;
* Calculation of coefficients, Alpha and Beta, for the Floating Intercept (FI) model and Path Loss Exponent (PLE) for the Close-In (CI) considering the frequency of 915 MHz for environments with heterogeneous and dense vegetation;
* Development of two ML models using a general regression neural network (GRNN) and a multilayer perceptron neural network (MLPNN), based on data measured in a densely wooded scenario. The rest of this article is organized as follows. Section 2 discusses with details the related works showing the main works with propagation in wooded environments and addresses ML-based propagation models. Section 3 describes the materials and methodsused in this research. Section 4 presents the main empirical propagation models, used to compare with the proposed model. Section 5 explains the machine learning techniques employed in this work. Section 6 details the evaluation of the results found by this work. Finally, Section 7 provides the conclusions of the research and suggest future works.
## 5 Conclusions  
Protocols making use of bidirectional quantum channels like the ones described in this work have the interesting feature of encodings being embedded in a unitary transformation as opposed to the preparation of a quantum state as well as the added advantage of how a decoding procedure should not see wastage due to bases mismatch unlike the conventional BB84. By conventional we refer to the BB84 in its original form where the choice of bases is equiprobable, resulting in only half of qubits transmitted could be used as a raw key. While asymmetric BB84 is proposed as a remedy and is expected to not perform any less than the two \"deterministic\" protocols in the infinite key regime, the scenario for finite keys can be different; thus the motivation for this work.  
Noting how the choice of relevant probability distribution for EM and CM is immediately analogous to the asymmetric BB84's choice for the preferred basis and non preferred basis respectively in [9], we extend the security proof based on purified versions of the SDC and LM05 in [5] to the use of smooth entropies for a finite key analysis. We provide for secure key rates in terms of efficiency for the protocols.  
In a relatively small number of qubits resources used (order of \(10^{4}\)) as well as lower depolarization of channels, we observe an obvious advantage in LM05 due to having more bits for raw key purpose (derived from EM). This results from LM05's encoding/decoding process which is independent of [PERSON]'s choice of bases for measurement processes; which is in fact the 'deterministic' merit claim of the protocol. This advantage does however diminish in the region of asymptotically long keys when compared to BB84 (as well as the SDC).  
The SDC is in some sense very similar to the asymmetric BB84 as bits for key purposes can only be salvaged when both [PERSON]'s and [PERSON]'s encoding and decoding processes respectively coincide (unlike LM05 where [PERSON]'s measurements in CM would be equally meaningful as a decoding measurement in the EM). The only real advantage SDC has over BB84 would be in the correlated channels case due to the error correction procedure. However, one must bear in mind that while efficiency for LM05 and BB84 is measured as key bits per-qubits transmitted, SDC's is measured as key bits per-entangled pairs used. Practically, this may not set to provide for a promising scenario as quantum memories become a necessity. Apart from our study of independent as well as a specific correlated channels, It is possible to consider variant cases of the latter beyond the one modeled here. Despite how any results thereof would depend strongly on the nature of the correlations, one may roughly deduce that having errors in EM lower than that provided by independent channels may very well result in a higher key rate for SDC and LM05 against BB84. Conversely, when the errors in EM is higher, it is likely the case that LM05 may not perform better than BB84 except for possible very small error rates. We conclude saying that a finite key analysis would be enlightening also for two-way QKD in the framework of continuous variable [29].
# The eIDAS Regulation: A Survey of Technological Trends for European Electronic Identity Schemes
## 9 Lessons Learned
### Privacy Considerations
#### 9.2.2 OIDC-Based Considerations  
This section highlights the implementation choices that should be considered within the implementation of OIDC-based eID schemes to provide \"Data Minimization\" and \"Unlinkability\".  
* **Data Minimization**: it means asking only for the required claims. Indeed, OIDC Core recommends minimizing the amount of information requested from the user. This is possible by the usage of the OIDC \"Claim\" parameter that returns the information explicitly declared using this parameter;
* **Unlinkability**: is to prevent users from being identified across different SPs. In the context of OIDC solutions, the users can be identified by SPs through the usage of subject identifier (sub) in the ID Token. Using the pairwise value for the subject type can help to protect the users against tracking by SPs as it will assign different values to the same user across different SPs. Thus, it can avoid user tracking across SPs.  
In the light of the GDPR, privacy is turning into a hot topic, and that is the main reason why the European Commission is trying to address the major privacy shortcoming of eIDAS in the revised eIDAS framework (eIDAS 2.0 [5]) by promoting the transition from federated to decentralized solutions that aim to give back the control of data to the user. Section 10 provides a brief overview of the eIDAS 2.0 regulations.
# 2D Semantic Segmentation: Recent Developments and Future Directions
## 4 Key Technologies to Improve the Effect of Semantic Segmentation
### Dilated Convolutions  
The emergence of dilated convolutions has had a remarkable impact on semantic segmentation. The basic idea of dilated convolutions [56] is to continuously use convolutional filters to expand their effective receptive field (as shown in Figure 8). The difference between dilated and ordinary convolutions is that a dilation rate parameter (indicating the size of expansion) is added to the former. The similarity between dilated and ordinary convolutions is that the size of the convolution kernel is the same; that is, the number of parameters is unchanged. Another difference is that the receptive field of dilated convolutions is larger than that of ordinary convolutions. [PERSON] et al. [57] introduced a mixed dilated convolution (MDC) module to improve the model's ability to recognize objects with various scales and irregular shapes. The MDC module not only increases the diversity of receptive fields but also solves the problems in conventional dilated convolutions (the pervasive \"mesh\" problems). The authors in [58] proposed a grouped dilated convolution module that combined existing grouped convolutions and atrous SPP techniques. The experimental results showed that the mean intersection over union (MIoU) of the method based on the CamVid data set was 73.15%, and the MIoU of the method based on SBD was 72.81%. The performance was excellent. However, compared with other technical methods, the GPU memory usage of dilated convolutions was higher.  
Dilated convolutions also have some drawbacks. First, when the dilation rate is too high, a \"checkerboard effect\" may occur, resulting in false shadows and noise in the segmentation results. Second, the receptive field of dilated convolutions is limited by the size of the kernel and the dilation rate, so the method cannot handle global information.  
Future research directions for dilated convolutions can be explored in several aspects. First, new dilation rate selection strategies can be explored to address the checkerboard effect and local information loss. Second, dilated convolutions can be combined with other operations to further improve the accuracy and efficiency of semantic segmentation. Lastly, the application and optimization of deep learning models based on dilated convolutions can be performed in practical scenarios.
# Deducing Energy Consumer Behavior from Smart Meter Data +
## 1 Introduction
For instance, in the telemedicine domain, the doctors can remotely observe the behavior of their patients and in energy domain, energy utilities may use such reports to evaluate their customers (e.g., demand response programs). The contribution of this work is a generic framework for deducing and presenting users behavior from their smart meter data. The framework aims to:  
* separate disaggregation data analyses from data representations;
* use open standard interfaces to exchange data (i.e., ZigBee and RESTful web interfaces) in a seamless way;
* provide a unique and shared database for appliance signatures and disaggregated results;  
Figure 1: Conceptual view of the proposed framework. * improve the aggregated data quality by detecting and fixing its errors;
* combine the consumptions of several homes to detect appliance usage patterns. * provide natural language reports about the user behavior to relevant stakeholders (hospitals, companies, etc.). The paper is structured as follows: Section 2 gives a brief overview of the related work. Section 3 shows the techniques and modeling languages used in this work. Section 4 presents the proposed framework and Section 5 demonstrates the applicability of the framework from a test case. Section 6 draws a conclusion and outlines future work.
# Electrification in Maritime Vessels: Reviewing Storage Solutions and Long-Term Energy Management
## 2 Electrification of Marine Vessels
### Charging Infrastructure of Marine Vessels
This makes the inductive charging system particularly advantageous for scenarios where ships frequently dock at the shore for short intervals, facilitating time-saving operations. Nevertheless, the technology's adoption comes with challenges, including alignment difficulties, the necessity for larger coils to manage higher power demands, elevated temperatures due to larger coil sizes, and various other considerations that may limit this charging station's effectiveness [43]. The integration of electric charging infrastructure in port environments presents significant financial and logistical challenges. Retrofitting existing port facilities to support wired, wireless, or battery swapping systems often requires substantial investment in grid upgrades, spatial reconfiguration, and equipment procurement. Moreover, ports must consider the impact of installation on daily operations, as well as long-term maintenance costs and compatibility with diverse vessel types. Regulatory compliance, safety standards, and coordination with utility providers further complicate the transition, making it essential for port authorities to conduct comprehensive feasibility studies before implementation.
## 2 Technical Background and Related Work
### Literature Review  
Several algorithms have been proposed for solving the Multiple Traveling Salesman Problem. These solutions have been proposed from three different approaches, namely (1) exact solutions, (2) using heuristics, and (3) transformation to TSP.  
An earlier work on presenting an exact solution to mTSP is that of [PERSON] and [PERSON] [7] whose solution is based on the relaxation of a few constraints of the original problem. [PERSON] and [PERSON] [8] proposed an integer linear programming-based solution addressing sub-tour elimination constraints (SEC), whereas [PERSON] and [PERSON] [9] proposed different SECs to provide a solution to the Vehicle Routing Problem (VRP)--a special case of mTSP. A branch and bound algorithm is proposed by [PERSON] and [PERSON] [10] that provides a solution to the asymmetric case of mTSP.  
In large-scale problems where it is difficult to find an optimal solution, heuristic-based algorithms are used to provide a sub-optimal solution. The heuristic-based algorithms to solve the Multiple Traveling Salesman Problem include the Evolutionary Algorithm [11], Genetic Algorithm [12], Tabu Search [13], Simulated Annealing [14], and Neural Networks [15]. A hybrid approach that uses the Genetic Algorithm (GA) and the Gravitational Emulation Local Search (GELS) algorithm is proposed by [PERSON] et al. [16] that addresses the complex situations of mTSP.  
Another approach to solving the Multiple Traveling Salesman Problem is to transform it into a simple Traveling Salesman Problem, solving the transformed problem with the available algorithms, thus addressing the original problem. The work presented by [PERSON] and [PERSON] [17], [PERSON] [18], and [PERSON] and [PERSON] [19] proposes the transformation of symmetric mTSP to symmetric TSP whereas the transformation suggested by [PERSON] and [PERSON] [20] converts the asymmetric mTSP to an asymmetric TSP.  
Colored Petri Nets have been used extensively in the modeling and analysis of systems from various domains. [PERSON] [21] modeled manufacturing systems with CPN and analyze them to find the conditions required to avoid deadlock during its operation. [PERSON] et al. [22] modeled a logistic and manufacturing system through CPN and performed simulation analysis to improve the system's performance. [PERSON] [23] used CPN to model a switched Local Area Network and estimated its buffer size and response time through simulation. [PERSON] [24] suggested a transformation of scheduling problems to Timed Petri Nets and used analysis techniques to find conflicting and redundant scheduling precedence, and to put a lower and upper bound on the time required to finish tasks. A class of Petri Nets known as the Stochastic Petri Nets (SPNs) has been used to propose efficient scheduling mechanism for grid-based systems [25] and for optimizing the execution time for tasks in such systems [26].
## 1 Introduction
This allows implementing advanced adaptive algorithms for ANC systems (for details, see [38] and the references therein). * In the classical FxLMS algorithm [3], the cost function is (deterministic) least squares which is not well-suited for the application at hand, i.e., impulsive ANC systems. The RLS-based adaptive ANC algorithm developed in this paper employs an objective function expected to achieve robustness against impulsive sources. Furthermore, a fixed step size (FSS) is introduced in the proposed algorithm while computing the the increment vector, resulting in the FSS MFx robust RLS (FSS-MFxRRLS) algorithm for ANC of impulsive sources. * In order to address the issue of the numerical instability of the FxLMS algorithm [18], a very simple solution of low-pass filtering is incorporated while computing the current estimate of the inverse correlation matrix. * In previous work, a convex-combined step size (CCSS) based modified normalized FxLMS (CCSS-MNFxLMS) algorithm was developed [39; 40]. Motivated by the result presented there, it is suggested to incorporate a similar strategy with the FSS-MFxRRLS ANC algorithm and develop the proposed CCSS-based MFx robust RLS (CCSS-MFxRRLS) algorithm. A brief overview of the classical FxLMS and FxRLS algorithms is given in Section 2. The details on the development and derivation of the proposed RLS-based ANC algorithms are given in Section 3, and Section 4 presents results of the extensive numerical simulations. A few remarks on the issue of computational complexity are also presented in this section. Finally, Section 5 gives a few concluding remarks and directions for future work. A short version of this paper was presented at [41].