esa-sceva/satcom-chunk-collection huggingface dataset:
## 6 Conclusions  
A cell balancing topology in combination with MWTFC and SCC has been proposed and experimentally verified in the present paper. The balancing circuit based on the intra-module and  
\begin{table}
\begin{tabular}{c c c c c c c} \hline \hline \multirow{2}{*}{**Topology**} & \multicolumn{6}{c}{**No. of the Components**} \\ \cline{2-6}  & **Switch** & **D** & **C** & **L** & **Transformer** \\ \hline \multirow{3}{*}{Switched capacitor converter} & Basic SCC [22] & 2n & - & n \(-\) 1 & - & - \\  & Double-Tiered SCC [26] & 2n & - & 2n \(-\) 3 & - & - \\  & Single SCC [30] & n + 5 & - & 1 & - & - \\  & Quasi-Resonant SCC [38] & 2n & - & n \(-\) 1 & n \(-\) 1 & - \\ \hline \multirow{3}{*}{Buck-boost Converter} & Basis topology [12] & 2(n \(-\) 1) & - & - & n \(-\) 1 & - \\  & Cuk converter [36] & 2(n \(-\) 1) & - & n \(-\) 1 & 2(n \(-\) 1) & - \\ \hline \multirow{3}{*}{Multi-winding transformer} & Flyback converter [18] & 1 & n & - & - & 1 (n primary windings) \\  & Forward converter [17] & n & 1 & - & - & 1 (n primary windings) \\ \hline \multicolumn{2}{c}{Proposed topology} & n + 2M & M & M \(-\) 1 & - & M (n/M primary windings) 1 \\ \hline \hline \end{tabular}  
* M: a number of the modules; M \(\geq\) 2.  
\end{table}
Table 3: Comparison of the proposed and conventional topologies in a number of components.  
outer-module balancers has several advantages and overcomes the disadvantages of two conventional circuits. In this balancing topology, the energy of cells in SCBS is transmitted from a high voltage level to a low voltage level in both the cells in each module and the modules by simultaneous intra- and outer-module balancers. The main advantages of the proposed MCBC are the elimination of voltage sensors and the simple control scheme. Further, the proposed MCBC can easily extend the number of cells in SCBS. The experimental results for three different cases show that the voltages of all cells in SCBS achieved a balanced state. Furthermore, regardless of the various arrangements of the initial voltage, the voltages of the cells have achieved a balance state. In the balanced state, the energy efficiency of the proposed circuit can reach 83.31%. We have obtained satisfactory results proving that the proposed balancing circuit could be applied for SCBS in electric vehicles.  
Conceptualization, T.M.B. and S.B.R.; Methodology, T.M.B. and S.B.R.; Software, T.M.B.; Validation, T.M.B. and S.B.R.; Formal Analysis, T.M.B. and S.B.R.; Investigation, T.M.B. and S.B.R.; Resources, T.M.B.; Data Curation, T.M.B.; Writing-Original Draft Preparation, T.M.B.; Writing-Review & Editing, T.M.B., C.-H.K., K.-H.K. and S.B.R.; Visualization, T.M.B., C.-H.K. and K.-H.K.; Supervision, S.B.R.  
This research received no external funding.  
The authors are extremely thankful to Smart Power System laboratory, Yeungnam University and Power & Energy System laboratory, Hanyang University for providing necessary information, materials, equipment, and guidance to pursue this research. We would like to express our gratitude to one and all who were directly or indirectly involved in the research results.  
The authors
## 1 Introduction  
A non-orthogonal multiple access (NOMA) system has been classified as promoting a multiple access structure for future wireless systems to boost system throughput and spectral efficacy. NOMA could utilize the present resources more effectively by resource-fully benefiting from the users' channel environments and providing numerous users with distinct quality of service (QoS) demands. NOMA enables several users to achieve simultaneous arrival to the same time-frequency block by superpositioning them in the code or power domains [1]. The concept of NOMA is established on that the user with a weak channel condition can be combined with the user with a good channel condition in the same time slot and on the same allocated subcarrier to ensure that the bandwidth block could be effectively exploited [2].  
In the NOMA scheme, receiver equipment will receive the multiplexing of symbols from different users in the system; therefore, elimination of interference from other users is necessary for coordinated decoding.  
Generally, multiuser detection (MUD) in NOMA can be managed through SIC, which was carried out in the power domain. In the SIC technique, symbols from several users are decoded consecutively based on the allocated signal power and the channel state information (CSI) [3]. Complete realization of CSI or channel status for individual users is challenging, since pilot symbols that are utilized in channel estimation may interfere with symbols from other users, thus influencing the performance of classical channel estimation procedures, such as minimum mean square error and least square estimators [4]. Machine learning (ML) algorithms have the capability to adapt to variations in channel between user and base station (BS); therefore, ML is regarded as a strong contender for future radio networks [5].
# Causality Analysis and Risk Assessment of Haze Disaster in Beijing
## 3 Results and Discussion
### Combination of Cross Regional Collaborative Governance Policy  
Considering the geographical location of Beijing, Tianjin and Hebei, it is crucial to implement the cross-regional collaborative governance policy to control the haze in Beijing. Similar to Beijing, further emission reduction measures are taken for vehicle exhausts, petrochemical industry production and coal combustion in Tianjin and Hebei Province. The annual emission reduction in vehicle exhausts, petrochemical production and coal combustion in Tianjin, Hebei is 12%, 12% and 14% respectively. That is to say, in the dynamic model of the Beijing haze system, the emission reduction factor of motor vehicles, the petrochemical industry and coal combustion in Tianjin Hebei is 0.12, 0.12 and 0.14, respectively. The system simulation result is shown in Figure 14, where it can be seen that, under the combination of cross-regional collaborative governance policies of Beijing, Tianjin and Hebei, the effect of haze governance in Beijing is the best. In addition, Figure 14 shows three stages of haze control in Beijing. Firstly, from 2011 to 2017, Beijing's air quality changed from light pollution to good, and, by 2017, Beijing's PM2.5 reduced to 75 \(\upmu\)g/m\({}^{3}\);  
Figure 12: Impact of the vehicle emission reduction (**a**), petrochemical production emission reduction (**b**), coal combustion emission reduction (**c**) and greening and reducing dust (**d**) on PM2.5 in Beijing.  
then, from 2017 to 2035, Beijing's urban haze control effect will be further strengthened, and, by 2035, Beijing's PM2.5 will be reduced to 35 \(\upmu\)g/m\({}^{3}\); finally, from 2035 to 2050, Beijing's PM2.5 will continue to be reduced, the speed of reduction will slow down, and the achievements of haze control in Beijing will be consolidated. By 2050, the problem of haze in Beijing will be basically solved.  
In this study, a novel nonlinear dynamic haze prediction model for a complex multiple-factor and cross-regional system was established under the condition of smaller data. Different scenarios are considered in the literature.  
Figure 14: Impact of cross-regional collaborative governance policy on PM2.5 in Beijing.  
Figure 13: Impact of collaborative governance policy on PM2.5 in Beijing.  
ferent from the machine learning models, this new model incorporate the causal association and nonlinear dynamical mechanism. Therefore, it has advantages in reliably characterizing the cross-regional haze systems. Moreover, this model concentrates on long-term haze evolution under different governance control policies, which makes it easy to determine the validity of the governance policy.
# Adsorption of Lead and Nickel on to Expanded Graphite Decorated with Manganese Oxide Nanoparticles
## 2 Materials and Methods
### Experiment  
Batch adsorption experiments of Pb\({}^{2+}\) and Ni\({}^{2+}\) on the prepared MONPs-EG were carried out in single and binary metal systems. Adsorption isotherm experiments were studied with seven different concentrations of heavy metals ranging from 0.01 to 1.0 mM. The initial pH solution was adjusted to pH 5 using NaOH (0.1 M) and/or HCl (0.1 M). The experiments were performed using a fixed amount of MONPs-EG (0.5 g/L) for 100 mL metal solutions contained in series amber glass bottles, which were then shaken in an incubator (WIS-20, Daihan Scientific Co., Gangwon, Korea) for 12 h at a speed of 150 rpm and a temperature of 25 \({}^{\circ}\)C. The kinetic adsorption experiments studied 500 mL metal solutions of Pb\({}^{2+}\) and/or Ni\({}^{2+}\) prepared at initial concentrations of 0.1 and 0.01 mM, respectively. The experiment was performed for 4 h and samples were taken at given time intervals of the reaction, while other conditions were maintained the same as those in the isotherm experiments. In addition, to investigate the influence of natural organic matter on the adsorption behavior of the MONPs-EG, 10.0 mg/L humic acid was used. The concentration of metal ions in the solution was analyzed using inductively coupled plasma optical emission spectroscopy (Optima 7300 DV ICP-OES, Perkin Elmer Inc., Waltham, Massachusetts, United States), with method detection limits (MDL) of 1.7 \(\upmu\)g/L and 0.5 \(\upmu\)g/L for Pb\({}^{2+}\) and Ni\({}^{2+}\), respectively.  
The amount of metal adsorbed onto the prepared MONPs-EG (q\({}_{e}\)) was calculated by subtracting the equilibrium concentrations of metal from the initial concentration, as expressed by the following Equation:  
\[q_{e}=\frac{(C_{0}-C_{e})}{m}V \tag{1}\]  
where \(C_{0}\) and \(C_{e}\) are the initial and equilibrium concentrations of metals (mg/L), respectively, \(V\) is the volume of the solution (L), and \(m\) is the mass of the MONPs-EG (g).
# Millimetre-Wave Backhaul for 5G Networks: Challenges and Solutions
## 4 Emerging Mm-Wave Physical Layer Techniques
### Full Duplex Transceiver  
Half duplexing has been a long-held assumption in wireless communication. In 2013, [PERSON] _et al._ from Stanford University [19] presented a design for in-band full duplex WiFi radios, which can transmit and receive data simultaneously through a single antenna. The implementation shows that it almost doubles the throughput, and the design maintains the robustness in a noisy environment. In 2014, [PERSON] _et al._ at Samsung [20] showed that 70 to 80 dB isolation is available from the transmit sector to the adjacent receiver sector on the same SBS for a 28-GHz mm-wave prototype adopting directional antenna arrays. They also illustrate that an additional 30 to 50 dB isolation is likely to be achieved by using conventional full duplex interference cancellation. Therefore, commercial full duplex for in-band mm-wave systems will be available soon. Using full duplex in backhaul can greatly enhance the throughput, and the benefits are especially remarkable in multi-hop routes.
# Authenticated Multicast in Tiny Networks via an Extremely Low-Bandwidth Medium
## 3 Establishing Group Keys
### Summing Strategies
#### 3.1.1 Decimating the Power Set  
Here, we present a concrete instance of the general summing strategy suggested to us by [PERSON]: first, we split \(\mathcal{N}\) into \(k\) disjoint subsets \(\mathcal{N}_{1},\ldots,\mathcal{N}_{k}\), each of cardinality \(n/k\). For each \(\mathcal{N}_{i}\) and each \(Z\subseteq\mathcal{N}_{i}\) such that \(|Z|>1\) (here we consider the keys for non-unicast transmission), we generate a separate key \(K_{Z}\). This key is then preloaded on the sender \(S\) and all members of the set \(Z\). Suppose that the sender \(S\) wants to create a multicast group \(\mathcal{R}\). Then, the sender:  
1. Chooses a key \(K\) at random;
2. Finds the intersection \(Z_{i}=\mathcal{N}_{i}\cap\mathcal{R}\) for each \(i\leq k\);
3. Broadcasts \(k\) messages, with the \(i\)-th message being a ciphertext of \(K\) obtained with the key \(K_{Z_{i}}\), i.e., \(\mathsf{Enc}_{K_{Z_{i}}}(K)\);
4. For \(Z_{i}=\mathcal{N}_{i}\cap\mathcal{R}\) such that \(|Z_{i}|=1\), the ciphertext of \(K\) is send to the only \(Z_{i}\) member via one-to-one channel (unicast transmission).  
The number of group keys to be stored by the sender now becomes \(k\cdot(2^{n/k}-1-n/k)\), while each receiver has to store only \(2^{n/k-1}-1\) group keys. For example, for \(n=16\) and \(k=4\) the sender would have to store \(44\) preloaded group keys, while each receiver would only have to store \(7\) preloaded keys. Including the link keys for one-to-one communication with the sender, the sender would have to store \(60\) keys altogether. A few further examples are presented in Table 3.
# A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications
## 3 Regular, \(d_{m}\)-Regular, and \(td_{m}\)-Regular Neutrosophic Graphs
: _Let \(G\) be a self-complementary HING. Then:_  
\[\sum_{a\
eq b}T_{M}(a,b) \leq\frac{1}{2}\sum_{a\
eq b}\min\left(T_{N}\left(a\right),T_{N} \left(b\right)\right))\] \[\sum_{a\
eq b}I_{M}(a,b) \geq\frac{1}{2}\sum_{a\
eq b}\max\left(I_{N}\left(a\right),I_{N} \left(b\right)\right))\] \[\sum_{a\
eq b}F_{M}(a,b) \geq\frac{1}{2}\sum_{a\
eq b}\max\left(F_{N}\left(a\right),F_{N} \left(b\right)\right))\]  
**Definition 26**. : _Let \(G=(N,M)\) be a neutrosophic graph and \(G^{u}=(N^{u},M^{u})\) be the \(\mu\) complement of \(G\) where \(N=N^{u}\) and \(M^{\mu}=\left(T_{M^{\prime}}^{u}I_{M^{\prime}}^{u}F_{M}^{u}\right)\) where:_  
\[T_{M}^{\mu} = \begin{cases}\min\left(T_{N}(a),T_{M}(b)\right)-T_{M}(a,b)&\text{ if }\ T_{M}(a,b)>0\\ 0&\text{ if }\ T_{M}(a,b)=0\end{cases} \] \[I_{M}^{\mu} = \begin{cases}I_{M}(a,b)-\max\left(T_{N}(a),T_{M}(b)\right)&\text{ if }\ I_{M}(a,b)>0\\ 0&\text{ if }\ I_{M}(a,b)=0\end{cases} \] \[F_{M}^{\mu} = \begin{cases}F_{M}(a,b)-\max\left(F_{N}(a),F_{M}(b)\right)&\text{ if }\ F_{M}(a,b)>0\\ 0&\text{ if }\ F_{M}(a,b)=0\end{cases} \]  
**Theorem 6**. : _Let \(G^{\mu}\) be the \(\mu\)-complement of an HING. \(G\) need not be highly irregular._  
Proof. : All the adjacent nodes of \(G\) with different neutrosophic degrees or all the other nodes of \(G\) with different neutrosophic degrees may possibly be adjacent nodes with equivalent degrees. This condition opposes the idea of HING. **Theorem 7**. : _Let \(G_{1}\) and \(G_{2}\) be two HINGs. If \(G_{1}\) and \(G_{2}\) are two isomorphic neutrosophic graphs, then \(G_{1}^{\mu}\) and \(G_{2}^{\mu}\) are also isomorphic, and vice versa._  
Proof. : Let \(G_{1}\) and \(G_{2}\) be two isomorphic neutrosophic graphs; there always exists a map \(h:V_{1}toV_{2}\) satisfying \(T_{N_{1}}\left(a\right)=T_{N_{2}}\left(h\left(a\right)\right)\), for all \(a\in V_{1}\) and \(T_{M_{1}}\left(ab\right)=T_{M_{2}}\left(h\left(a\right)h\left(b\right)\right)\), \(I_{M_{1}}\left(ab\right)=I_{M2}\left(h\left(a\right)h\left(b\right)\right)\) and \(F_{M1}\left(ab\right)\ =\ F_{M2}\left(h\left(a\right)h\left(b\right)\right)\), for all \(ab\in E_{1}\). By the concept of the \(\mu\) complement neutrosophic graph, we have \(T_{M_{1}}^{\mu}\left(ab\right)=\min\left(T_{N1}\left(a\right),T_{N1}\left(b \right)-T_{M1}\left(ab\right)=\min\left(T_{N2}\left(h\left(a\right)\right),T_{N2 }\left(h\left(b\right)\right)\right)-T_{M2}\left(h\left(a\right)h\left(b\right)\right)\), \(F_{M_{1}}^{\mu}\left(ab\right)=F_{M_{1}}\left(ab\right)-\max\left(F_{N1}\left(a \right),F_{N1}\left(b\right)\right)=T_{M2}\left(h\left(a\right)h\left(b\right) \right)-\max\left(F_{N1}\left(h\left(a\right)\right),F_{N2}\left(h\left(b\right) \right)\right)\) for all \(ab\in E_{1}\,(I_{M_{1}}^{\mu}\,(ab)\) values can be calculated using the same method). Hence, \(G_{1}^{\mu}\cong G_{2}^{\mu}\). The proof of the converse part is straight forward.
# Wireless Mesh Networking: An IoT-Oriented Perspective Survey on Relevant Technologies
## 3 Mesh in IEEE 802.11 Networks
### Other Solutions  
#### 3.2.1 Better Approach To Mobile Ad-hoc Networks (B.A.T.M.A.N.)  
B.A.T.M.A.N. advanced (batman-adv in the following) is a proactive routing protocol designed for WMNs that became popular in last years thanks to the fact that it is already available in the Linux kernel. It is the \"wireless\" version of B.A.T.M.A.N. protocol, originally designed for wired networks and works at MAC layer instead of network layer. The batman-adv approach allows each node, for each destination in the mesh network, to determine its best next-hop--thus, there is no need for route discovery but, rather, for neighbor discovery--without requiring the knowledge of the complete topology of the network, leading to a significant reduction of control messages in the network.  
In our description, we refer to the batman-adv version V. To discover neighbors, nodes regularly send in broadcast an OriGinator Message version 2 (OGMv2, OGM in the following), depicted in Figure 2, applying a a delay to avoid packet collisions [12]. The OGM format comprises several fields, such as a sequence number (used to detect new OGMs and avoid that OGMs are counted twice), throughput, and optional flags (e.g., to set a node as a gateway towards an external network). In batman-adv V, the neighbor discovery is handled by the Echo Location Protocol (ELP), whose details, to best of the authors' knowledge, are not up publically available since they are not up to date with the last versions of the protocol. However, in principle this packet type is never forwarded or re-broadcasted in the mesh and the OGM flooding protocol is used to determine the link quality, based on the throughput of the link itself, and remains responsible for mesh routing.  
Dividing the phase of the discovery and the phase of routing leads to: (i) reduced overhead, as OGMs interval can be incresed; (ii) neighbor discovery and metric estimation are performed separately.  
The previous version of batman-adv, namely B.A.T.M.A.N. IV, used a packet loss-based metric: however, this metric is not fit to handle the increasing number of devices. For this reason, in batman-adv a throughput metric was introduced. Depending on the link type, batman-adv is able to determine the throughput exploiting the features of the used radio interface (whose driver provides the estimated throughput for each neighbor node) or evaluated directly from batman-adv protocol running a \"throughput meter\" test. Finally, the overall path throughput between a source node \(S\) and a destination node \(D\) is computed as the minimum between the throughput of all available paths.
# Support Vector Machine-Assisted Importance Sampling for Optimal Reliability Design
## 1 Introduction
On the one hand, IS prevents sample degeneracy (keeps the sample diversity), and thus the exploration of the feasible space is more adequate. In addition, the constructed optimal IS PDF perfectly avoids local optima. On the other hand, the utilization of SVM escapes the repeated invocation of complex functions, thus saving computation time. This advantage is evident if the investigated problem involves complicated black-box functions. The innovations and contributions of this paper are threefold. (a) A deterministic target distribution is constructed by utilizing IS without the need to set a series of parameters. (b) SVM is used to construct alternative models for dividing the feasible/infeasible domains and distinguishing the superior/inferior individuals. This facilitates the sampling process, because it does not need to repeatedly invoke the complex functions involved in the optimization model. (c) New individuals can be simply generated via the constructed quasi-optimal IS PDF without complicated operations. The diversity of new individuals is ensured and local optima avoided. The rest of this paper is organized as follows. Section 2 revisits the mathematical model related to ORD. Section 3 introduces the proposed algorithm with explanations of the rationale behind it. Numerical results are given in Section 4 to showcase the feasibility of the proposed algorithm. Conclusions are drawn in Section 5.
# Radiation Qualification by Means of the System-Level Testing: Opportunities and Limitations
## 4 Limiting Factors of Qualification
### Observability of Parameters
#### 4.4.1 Observability of Parameters in TID Tests  
There is an advantage of TID tests over SEE tests in terms of observability coming from the fact that it is possible to perform remote testing after TID irradiation: DUT (device  
\begin{table}
\begin{tabular}{c c c c} \hline \hline  & **Energy (MeV)** & \
\begin{tabular}{c} **Beam Size** \\ **(cm Diameter)** \\ \end{tabular} &
\begin{tabular}{c} **Max. Range in Si** \\ **(mm, SRIM2013)** \\ \end{tabular} & **Flux (p/cm\({}^{2}\)/s)** \\ \hline PSI, Switzerland & 6–230 & 9 & 176 & \textless{}2 \(\times\) 10\({}^{9}\) \\ \hline KVI, Netherlands & 10–184 & 12 & 120 & \textless{}10\({}^{9}\) \\ \hline UCL, Belgium & 10–62 & 8 & 18 & \textless{}5 \(\times\) 10\({}^{8}\) \\ \hline RADEF, Finland & 0.4–55 & 10 & 14 & \textless{}3 \(\times\) 10\({}^{8}\) \\ \hline \hline \end{tabular}
\end{table}
Table 4: Beam parameters of the chosen proton facilities (after [30]).  
\begin{table}
\begin{tabular}{c c c c} \hline \hline
**Heavy Ion Facility** & **Beam Size** & \begin{tabular}{c} **Max Energy** \\ **(MeV/u)** \\ \end{tabular} & \begin{tabular}{c} **LET Range** \\ **(MeV\textless{}cm\textless{}^{2}/mg)** \\ \end{tabular} \\ \hline NSRL, USA & \
\begin{tabular}{c} 60 \(\times\) 60 cm\({}^{2}\) (typically \\ 20 \(\times\) 20) \\ \end{tabular} & 1500 & 0.5–94 \\ \hline RADEF, Finland & 5 \(\times\) 5 cm\({}^{2}\) (3 \(\times\) 3 in air) & 16.3 & 7–70 \\ \hline TAMU, USA & 4.5 cm diameter & 40 & 5–95 \\ \hline KVI, Netherlands & 3 \(\times\) 3 cm\({}^{2}\) & 90 & 4.5–65 \\ \hline UCL, Belgium & 2.5 cm diameter & 9.3 & 1–62.5 \\ \hline GANIL, France &
\begin{tabular}{c} Few cm diameter, \\ sweeping beam \\ \end{tabular} & 60 & 5.4–97.6 \\ \hline \hline \end{tabular}
\end{table}
Table 3: Beam parameters of the chosen heavy ion facilities (after [30]).  
under test) or SUT might be removed from the beam area to perform electrical/functional characterization.