A lightweight cell switching and traffic offloading scheme for energy optimization in ultra-dense heterogeneous networks

One of the major capacity boosters for 5G networks is the deployment of ultra-dense heterogeneous networks (UDHNs). However, this deployment results in a tremendous increase in the energy consumption of the network due to the large number of base stations (BSs) involved. In addition to enhanced capacity, 5G networks must also be energy efficient for it to be economically viable and environmentally friendly. Dynamic cell switching is a very common way of reducing the total energy consumption of the network, but most of the proposed methods are computationally demanding, which makes them unsuitable for application in ultra-dense network deployment with massive number of BSs. To tackle this problem, we propose a lightweight cell switching scheme also known as Threshold-based Hybrid cEll swItching Scheme (THESIS) for energy optimization in UDHNs. The developed approach combines the benefits of clustering and exhaustive search (ES) algorithm to produce a solution whose optimality is close to that of the ES (which is guaranteed to be optimal), but is computationally more efficient than ES and as such can be applied for cell switching in real networks even when their dimension is large. The performance evaluation shows that THESIS significantly reduces the energy consumption of the UDHN and can reduce the complexity of finding a near-optimal solution from exponential to polynomial complexity.     

PSO-LSSVM对LIBS定量分析精度的提高

针对土壤定量分析受基体效应影响大，LIBS定量分析精度不佳等问题，采用粒子群算法对LSSVM进行优化，提高模型的精确度。选取Pb Ⅰ 405.78 nm和Cr Ⅰ 425.44 nm作为分析谱线进行分析。采集十二个不同浓度样品的特征光谱，每个浓度样品在不同点采集20组数据，将其中17组数据设为训练集，3组数据设为预测集，用LSSVM和PSO-LSSVM两种方法建立定标模型。对比两种模型的拟合相关系数（R2）、训练集均方根误差（RMSEC）和预测集均方根误差(RMSEP)。由于自吸收效应的影响，随着浓度的增加，预测值逐渐低于实际值，LSSVM定标模型的拟合程度较低，无法达到实验要求，模型性能有待提高。利用粒子群算法对LSSVM的模型参数惩罚系数和核函数参数进行优化，得到最佳的参数组合，Pb元素为(8 096.8, 138.865 7)，Cr元素为(4 908.6, 393.563 5)，用最佳的参数组合构建LSSVM的定标模型。相比于LSSVM，PSO-LSSVM定标模型的精确度更高，Pb和Cr元素的R2提高到了0.982 8和0.985 0，拟合效果明显提升。Pb和Cr元素的训练集均方根误差由0.026 0 Wt%和0.027 2 Wt%下降到0.022 4 Wt%和0.019 1 Wt%，预测集均方根误差由0.101 8 Wt%和0.078 8 Wt% 下降到0.045 8 Wt%和0.042 0 Wt%，模型的稳定性进一步提高。说明PSO-LSSVM算法能够更好地降低土壤基体效应和自吸收效应带来的影响，提高分析结果的精确度与稳定性。     

全局优化问题的一个新的无参数填充函数

求全局最优化问题的填充函数算法被提出以来，参数的选取和调整一直是制约算法有效性的因素。如何在实际的计算过程中选取合适的参数，直接影响和决定了运算速度和效率。因此，构造不含参数的填充函数就显得极为重要。提出一个新的无参数的填充函数，对其理论性质进行了分析，并给出相应的填充函数算法，数值计算验证了算法的有效性。     

Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid

This letter studies the problem of minimizing increasing set functions, equivalently, maximizing decreasing set functions, over the base matroid. This setting has received great interest, since it generalizes several applied problems including actuator and sensor placement problems in control, task allocation problems, video summarization, and many others. We study two greedy heuristics, namely, the forward and reverse greedy. We provide two novel performance guarantees for the approximate solutions obtained by them depending on both submodularity ratio and curvature.     

Global existence and time decay of the non-cutoff Boltzmann equation with hard potential

This paper is concerned with the Cauchy problem on the Boltzmann equation without angular cutoff assumption for hard potential in the whole space. When the initial data is a small perturbation of a global Maxwellian, the global existence of solution to this problem is proved in unweighted Sobolev spaces $H^N\left({\mathbb{R}}_{x,v}^6\right)$ with $N\ge 2$. But if we want to obtain the optimal temporal decay estimates, we need to add the velocity weight function, in this case the global existence and the optimal temporal decay estimate of the Boltzmann equation are all established. Meanwhile, we further gain a more accurate energy estimate, which can guarantee the validity of the assumption in Chen et al. (0000).     

Global existence to the initial–boundary value problem for a system of nonlinear diffusion and wave equations

We prove the global existence of weak solution pair to the initial boundary value problem for a system of m-Laplacian type diffusion equation and nonlinear wave equation. The interaction of two equations is given through nonlinear source terms $f(u,v)$ and $g(u,v)$.     

Solution combustion synthesis,energy and environment: Best parameters for better materials

Solution combustion synthesis (SCS) is a worldwide used methodology for the preparation of inorganic ceramic and composite materials with controlled properties for a wide number of applications, from catalysis to photocatalysis and electrocatalysis, from heavy metal removal to sensoristics and electronics. The high versatility and efficiency of this technique have led to the introduction of many variants, which allowed important optimization to the prepared materials. Moreover, its ecofriendly nature encouraged further studies about the use of sustainable precursors for the preparation of nanomaterials for energy and environment, according to the concept of circular economy. On the other hand, the large variety of expressions to define SCS and the often-contradictory definitions of the SCS parameters witnessed a scarce consciousness of the potentiality of this methodology. In this review article, the most important findings about SCS and the selection criteria for its main parameters are critically reviewed, in order to give useful guidelines to those scientists who want to use this methodology for preparing materials with improved or new functional properties. This review aims as well (i) to bring more clarity in the SCS terminology (ii) to increase the awareness of the SCS as a convenient tool for the synthesis of materials and (iii) to propose a new perspective in the SCS, with special attention to the use of ecofriendly procedures. Part of the review is also dedicated to precautions and limitations of this powerful methodology.     

Orienteering for electioneering

In this paper, we introduce a combinatorial optimization problem that models the investment decision a political candidate faces when treating his or her opponents’ campaign plans as given. Our formulation accounts for both the time cost of traveling between districts and the time expended while campaigning within districts. We describe a polynomial-time algorithm that computes a $(2+?)$-approximation to the optimal solution of a discrete version of our problem by reducing the problem to another combinatorial optimization problem known as Orienteering.     

无穷多目标优化的Geoffrion真有效性及其在鲁棒优化中的应用

在多目标优化中,Pareto有效性体现了目标之间的妥协与补偿,而Geoffrion真有效性能保证补偿是有界的.本文对有无穷多个目标的优化问题引入了真有效性,完整保留了Geoffrion的结构.基于一族锥,揭示了Geoffrion真有效性的特点及其与Pareto有效性的区别.并将Geoffrion真有效性的思想用于鲁棒优化,得到了著名的Hurwicz决策准则.