Diffusion Model of a Non-Integer Order PIγ Controller with TCP/UDP Streams

In this article, a way to employ the diffusion approximation to model interplay between TCP and UDP flows is presented. In order to control traffic congestion, an environment of IP routers applying AQM (Active Queue Management) algorithms has been introduced. Furthermore, the impact of the fractional controller PIγ and its parameters on the transport protocols is investigated. The controller has been elaborated in accordance with the control theory. The TCP and UDP flows are transmitted simultaneously and are mutually independent. Only the TCP is controlled by the AQM algorithm. Our diffusion model allows a single TCP or UDP flow to start or end at any time, which distinguishes it from those previously described in the literature.     

广义神经传播方程的整体吸引子

使用Galerkin方法,结合Sobolev空间理论和不等式技巧,给出了广义神经传播方程解的存在唯一性定理,然后利用吸引子存在性定理,采用半群方法证明了方程整体吸引子的存在性.     

Fundamental Groups of Graphs of Cyclic Subgroup Separable and Weakly Potent Groups

We give a characterization of the cyclic subgroup separability and weak potency of the fundamental group of a graph of polycyclic-by-finite groups and free-by-finite groups amalgamating edge subgroups of the form × D,where h has infinite order and D is finite.     

基于GA_XGBoost模型的大学生科研能力预测问题研究

科学评价大学生科研创新能力对我国科研水平的提高具有重要意义.采用机器学习模型来预测大学生科研能力可以起到良好的效果,提出一种GAXGBoost模型来实现对大学生的科研能力预测.此模型是以Xgboost算法为基础,然后充分利用遗传算法的全局搜索能力自动搜索Xgboost最优超参数,避免了人为经验调参不准确的缺陷,最后采用精英选择策略以此确保每一轮都是最佳的进化结果.通过分析表明,所采用的GAXGBoost模型在大学生科研能力预测的结果中具有很高的精度,将此模型与Logistic Regression、Random Forest、SVM等模型进行对比,GAXGBoost模型的预测精度最高.     

单面柱局域共振声子晶体低频带隙特性分析及结构改进研究

基于有限元法对单面柱局域共振声子晶体进行带隙特性分析,研究了结构参数对该类型声子晶体的影响。结果表明:随着散射体高度的增加,单面柱声子晶体的第一完全带隙的起始频率逐渐降低,带宽逐渐增大;随着基板厚度的增大,单面柱声子晶体的起始频率逐渐升高,截止频率先增大后减小。并且在经典单面柱声子晶体的基础上,组合了两种新型的三组元单面柱声子晶体结构:嵌入式单面柱声子晶体(以下简称结构Ⅰ)和粘接式单面柱声子晶体(以下简称结构Ⅱ)。通过对其带隙特性的分析得出:这两种新结构与经典的单面柱声子晶体相比,都具有更低频的带隙,这对于低频减振降噪是非常有利的。本文的结果将对实际的工程应用提供一定的理论指导。     

The Fifty Percent Machines—A Short History of Influence Machines and an Elementary Theory of Their Efficiency: An Attempt

Presenting the devices invented by Toepler, Holtz, Wimshurst, and Wommelsdorf, the history of the influence machines, the progress made, and the remaining deficits are discussed. The theoretical considerations published in the literature lack generalizable statements on the efficiency. Based on R. W. Pohl's model (1927), an elementary analysis is made, with the result that the upper limit of the theoretically achievable efficiency of influence machines is only 50%.     

Semiconvergence analysis of the randomized row iterative method and its extended variants

The row iterative method is popular in solving the large‐scale ill‐posed problems due to its simplicity and efficiency. In this work we consider the randomized row iterative (RRI) method to tackle this issue. First, we present the semiconvergence analysis of RRI method for the overdetermined and inconsistent system, and derive upper bounds for the noise error propagation in the iteration vectors. To achieve a least squares solution, we then propose an extended version of the RRI (ERRI) method, which in fact can converge in expectation to the solution of the overdetermined or underdetermined, consistent or inconsistent systems. Finally, some numerical examples are given to demonstrate the convergence behaviors of the RRI and ERRI methods for these types of linear system.     

On the numerical solution of ill‐conditioned linear systems by regularization and iteration

We propose to reduce the (spectral) condition number of a given linear system by adding a suitable diagonal matrix to the system matrix, in particular by shifting its spectrum. Iterative procedures are then adopted to recover the solution of the original system. The case of real symmetric positive definite matrices is considered in particular, and several numerical examples are given. This approach has some close relations with Riley's method and with Tikhonov regularization. Moreover, we identify approximately the aforementioned procedure with a true action of preconditioning.