The energy consumption and carbon footprint of the fifth-generation (5G) of mobile technology is a current concern to mobile network operators (MNOs). These are currently attempting to lower both their carbon emissions and electricity bills by investigating new schemes that allow adapting the network transmission capabilities to the end-users' quality of service (QoS) requirements. Many of such schemes rely on accurate traffic forecasting, and as a consequence, there is a large effort on investigating novel machine learning (ML) algorithms, which fed by network measurement data and empowered by the computing capabilities of dedicated hardware, can help modelling and predicting users' behaviours. Most of the works in the literature, however, focus on predicting the traffic when energy saving features, e.g. carrier shutdown, are not implemented or activated. However, the prediction task becomes much more challenging when energy saving features are adopted due to their impact to the actual measured traffic. In this paper, we consider a scenario in which part of the base stations implement energy saving schemes, which allow them to dynamically switch off part of their hardware to reduce their power consumption. Then, we present a ML framework based on graph convolutional networks (GCNs) for traffic forecasting in such dynamic scenarios, and compare its performance with other statistical and ML prediction algorithms. The proposed GCN framework provides significant accuracy gains. Moreover, we provide an analysis of the impact of spatial correlation-captured by the GCN model-on the achieved performance.

MOTIVATION: T and B cell receptors (TCRs and BCRs) play a pivotal role in the adaptive immune system by recognizing an enormous variety of external and internal antigens. Understanding these receptors is critical for exploring the process of immunoreaction and exploiting potential applications in immunotherapy and antibody drug design. Although a large number of samples have had their TCR and BCR repertoires sequenced using high-throughput sequencing in recent years, very few databases have been constructed to store these kinds of data. To resolve this issue, we developed a database. RESULTS: We developed a database, the Pan Immune Repertoire Database (PIRD), located in China National GeneBank (CNGBdb), to collect and store annotated TCR and BCR sequencing data, including from Homo sapiens and other species. In addition to data storage, PIRD also provides functions of data visualization and interactive online analysis. Additionally, a manually curated database of TCRs and BCRs targeting known antigens (TBAdb) was also deposited in PIRD. AVAILABILITY AND IMPLEMENTATION: PIRD can be freely accessed at https://db.cngb.org/pird.

Numerical code is often applied in the safety-critical, but resource-limited areas. Hence, it is crucial for it to be correct and efficient, both of which are difficult to ensure. On one hand, accumulated rounding errors in numerical programs can cause system failures. On the other hand, arbitrary/infinite-precision arithmetic, although accurate, is infeasible in practice and especially in resource-limited scenarios because it performs thousands of times slower than floating-point arithmetic. Thus, it has been a significant challenge to obtain high-precision, easy-to-maintain, and efficient numerical code. This paper introduces a novel global optimization framework to tackle this challenge. Using our framework, a developer simply writes the infinite-precision numerical program directly following the problem's mathematical requirement specification. The resulting code is correct and easy-to-maintain, but inefficient. Our framework then optimizes the program in a global fashion (i.e., considering the whole program, rather than individual expressions or statements as in prior work), the key technical difficulty this work solves. To this end, it analyzes the program's numerical value flows across different statements through a symbolic trace extraction algorithm, and generates optimized traces via stochastic algebraic transformations guided by effective rule selection. We first evaluate our technique on numerical benchmarks from the literature; results show that our global optimization achieves significantly higher worst-case accuracy than the state-of-the-art numerical optimization tool. Second, we show that our framework is also effective on benchmarks having complicated program structures, which are challenging for numerical optimization. Finally, we apply our framework on real-world code to successfully detect numerical bugs that have been confirmed by developers.

Noise statistics are essential for estimation performance. In practical situations, however, a priori information of noise statistics is often imperfect. Previous work on noise statistics identification in linear systems still requires initial prior knowledge of the noise. A novel approach is presented in this paper to solve this paradox. First, we apply the H ∞ filter to obtain the system state estimates without the common assumptions about the noise in conventional adaptive filters. Then by applying state estimates obtained from the H ∞ filter, better estimates of the noise mean and covariance can be achieved, which can improve the performance of estimation. The proposed approach makes the best use of the system knowledge without a priori information with modest computation cost, which makes it possible to be applied online. Finally, numerical examples are presented to show the efficiency of this approach.

We propose an efficient measurement-driven sequential Monte Carlo multi-Bernoulli (SMC-MB) filter for multi-target filtering in the presence of clutter and missing detection. The survival and birth measurements are distinguished from the original measurements using the gating technique. Then the survival measurements are used to update both survival and birth targets, and the birth measurements are used to update only the birth targets. Since most clutter measurements do not participate in the update step, the computing time is reduced significantly. Simulation results demonstrate that the proposed approach improves the real-time performance without degradation of filtering performance.

Common deployment schemes in wireless sensor networks (WSNs) are built upon the assumption that the boundary effects can be ignored in the sensing field, which result in additional repair work to detect boundaries and redeem coverage holes along them. This repair not only breaks the uniformity of the deployed network, but also causes extra manual and material costs in practice. According to the geometry characteristics of a target area, we propose an innovative deployment scheme GRLD (Growth Rings Like Deployment), which can achieve coverage as well as connectivity without boundary effects. We also prove the full coverage and connectivity of this scheme and compare its efficiency with some popular regular deployment patterns, such as the square grid and the hexagon grid. Our work is the first to apply biological principles to the study and design of deployment schemes in WSNs, which avoids boundary effects efficiently and provides more adaptability.