An extended improved global structure model for influential node identification in complex networks

Accurate identification of influential nodes facilitates the control of rumor propagation and interrupts the spread of computer viruses. Many classical approaches have been proposed by researchers regarding different aspects. To explore the impact of location information in depth, this paper proposes an improved global structure model to characterize the influence of nodes. The method considers both the node's self-information and the role of the location information of neighboring nodes. First, degree centrality of each node is calculated, and then degree value of each node is used to represent self-influence, and degree values of the neighbor layer nodes are divided by the power of the path length, which is path attenuation used to represent global influence. Finally, an extended improved global structure model that considers the nearest neighbor information after combining self-influence and global influence is proposed to identify influential nodes. In this paper, the propagation process of a real network is obtained by simulation with the SIR model, and the effectiveness of the proposed method is verified from two aspects of discrimination and accuracy. The experimental results show that the proposed method is more accurate in identifying influential nodes than other comparative methods with multiple networks.     

一种改善 GNSS 弱信号捕获性能的伪码优化设计

强多址干扰下的弱信号捕获是高灵敏度GNSS接收机比较常见又难以解决的问题。本文提出一种非等长的伪码设计方法,通过使各路导航信号调制伪码码长互质,从时域上降低了伪码的互相关值,从频域上降低了目标信号和干扰信号的谱分离系数。理论分析和仿真表明,基于非等长的伪码优化方法,能够改善强多址干扰环境中弱信号的捕获性能。     

Global well‐posedness of the compressible Euler with damping in Besov spaces

In this paper, we consider the Cauchy problems for compressible Euler equations with damping. In terms of the Littlewood–Paley decomposition and Bony's para‐product formula, we prove the global existence, uniqueness and asymptotic behavior of the solution in the critical Besov space comparing with previous results. Copyright © 2012 John Wiley & Sons, Ltd.     

Global exact boundary observability for first‐order quasilinear hyperbolic systems of diagonal form

In this paper, by means of a constructive method based on the theory of the existence and the uniqueness of the C¹ solution to the Cauchy problem and the Goursat problem, the global exact boundary observability for the first‐order quasilinear hyperbolic systems of diagonal form with linearly degenerate characteristics is obtained. In the case that the system has no zero characteristics, we realize the two‐sided and one‐sided global exact boundary observability by the boundary observed values and obtain the observability inequality. Copyright © 2012 John Wiley & Sons, Ltd.     

Global convergence of conjugate gradient method

In this article, we consider the global convergence of the Polak–Ribiére–Polyak conjugate gradient method (abbreviated PRP method) for minimizing functions that have Lipschitz continuous partial derivatives. A novel form of non-monotone line search is proposed to guarantee the global convergence of the PRP method. It is also shown that the PRP method has linear convergence rate under some mild conditions when the non-monotone line search reduces to a related monotone line search. The new non-monotone line search needs to estimate the Lipschitz constant of the gradients of objective functions, for which two practical estimations are proposed to help us to find a suitable initial step size for the PRP method. Numerical results show that the new line search approach is efficient in practical computation.     

Simultaneous metric projection onto closed sets

We examine simultaneous metric projection by closed sets in a class of ordered normed spaces. First, we study simultaneous metric projection onto downward and upward sets and separation properties of these sets. The results obtained are used for examination of simultaneous metric projection by arbitrary closed sets, and we examine the minimization of the distance from a bounded set to an arbitrary closed set in a class of ordered normed spaces.     

Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods

In this article we study the hybrid extragradient method coupled with approximation and penalty schemes for convex minimization problems. Under certain hypotheses, which include, for example, the case of Tikhonov regularization, we prove asymptotic convergence of the method to the solution set of our minimization problem. When we use schemes of penalization or barrier, we can show asymptotic convergence using the well-known fast/slow parameterization techniques and exploiting the existence and finite length of an optimal path.     

An efficient interval computing technique for bound-constrained uncertain optimization problems

In this article, a competent interval-oriented approach is proposed to solve bound-constrained uncertain optimization problems. This new class of problems is considered here as an extension of the classical bound-constrained optimization problems in an inexact environment. The proposed technique is nothing but an imitation of the well-known interval analysis-based branch-and-bound optimization approach. Efficiency of this technique is strongly dependent on division, bounding, selection/rejection and termination criteria. The technique involves a multisection division criterion of the accepted/proposed search region. Then, we have employed the interval-ranking definitions with respect to the pessimistic decision makers’ point of view given by Mahato and Bhunia [Interval-arithmetic-oriented interval computing technique for global optimization, Appl. Math. Res. Express 2006 (2006), pp. 1–19] to compare the interval-valued objectives calculated in each subregion and also to select the subregion containing the best interval objective value. The process is continued until the interval width for each variable in the accepted subregion is negligible and ultimately the global or close-to-global interval-valued optimal solution is obtained. The proposed technique has been evaluated numerically using a wide set of newly introduced univariate/multivariate test problems. Finally, to compare the computational results obtained by the proposed method, the graphical representation for some test problems is given.