Considering the isolation set problem

Given a network, G = [N, E] the Isolation Set Problem (ISP) finds the set of arcs, D ⊆ E, that when removed will separate a predefined set of r distinguished nodes [2]. This involves eliminating connections from a specific set of nodes to the rest of a network. In our increasingly interconnected network-centric world, this might be isolating various units from Headquarters; isolating a portion of a computer network to disrupt communications or to quarantine a virus or some other form of cyber attack; or isolating a cell or sub-group in a terrorist or “dark” network, for example.     

Improving multicut in directed trees by upgrading nodes

In this paper, we consider the network improvement problem for multicut by upgrading nodes in a directed tree T = (V, E) with multiple sources and multiple terminals. In a node based upgrading model, a node v can be upgraded at the expense of c(v) and such an upgrade reduces weights on all edges incident to v. The objective is to upgrade a minimum cost subset S ⊆ V of nodes such that the resulting network has a multicut in which no edge has weight larger than a given value D. We first obtain a minimum cardinality node multicut V_c for tree T, then find the minimum cost upgrading set based on the upgrading sets for the subtrees rooted at the nodes in V_c. We show that our algorithm is polynomial when the number of source–terminal pairs is upper bounded by a given value.     

Generalized Gaussian quadrature rules over two-dimensional regions with linear sides

This paper presents a generalized Gaussian quadrature method for numerical integration over triangular, parallelogram and quadrilateral elements with linear sides. In order to derive the quadrature rule, a general transformation of the regions, R₁ = {(x, y)∣a ? x ? b, g(x) ? y ? h(x)} and R₂ = {(x, y)∣a ? y ? b, g(y) ? x ? h(y)}, where g(x), h(x), g(y) and h(y) are linear functions, is given from (x, y) space to a square in (ξ, η) space, S: {(ξ, η)∣0 ? ξ ? 1, 0 ? η ? 1}. Generlized Gaussian quadrature nodes and weights introduced by Ma et.al. in 1997 are used in the product formula presented in this paper to evaluate the integral over S, as it is proved to give more accurate results than the classical Gauss Legendre nodes and weights. The method can be used to integrate a wide class of functions including smooth functions and functions with end-point singularities, over any two-dimensional region, bounded by linear sides. The performance of the method is illustrated for different functions over different two-dimensional regions with numerical examples.     

Rank one operators and norm of elementary operators

Let A be a standard operator algebra acting on a (real or complex) normed space E. For two n-tuples A = (A₁, … , A_n) and B = (B₁, … , B_n) of elements in A, we define the elementary operator R_A,B on A by the relation for all X in A. For a single operator A∈A, we define the two particular elementary operators L_A and R_A on A by L_A(X) = AX and R_A(X) = XA, for every X in A. We denote by d(R_A,B) the supremum of the norm of R_A,B(X) over all unit rank one operators on E. In this note, we shall characterize: (i) the supremun d(R_A,B), (ii) the relation , (iii) the relation d(L_A − R_B) = ∥A∥ + ∥B∥, (iv) the relation d(L_AR_B − L_BR_A) = 2∥A∥ + ∥B∥. Moreover, we shall show the lower estimate d(L_A − R_B) ? max{sup_λ∈V(B)∥A − λI∥, sup_λ∈V(A)∥B − λI∥} (where V(X) is the algebraic numerical range of X in A).     

A finite difference solution to a two-dimensional parabolic inverse problem

In this paper, we consider the problem of finding u = u(x, y, t) and p = p(t) which satisfy u_t = u_xx + u_yy + p(t)u + ? in R × [0, T], u(x, y, 0) = f(x, y), (x, y) ∈ R = [0, 1] × [0, 1], u is known on the boundary of R and u(x^∗, y^∗, t) = E(t), 0 < t ? T, where E(t) is known and (x^∗, y^∗) is a given point of R. Through a function transformation, the nonlinear two-dimensional diffusion problem is transformed into a linear problem, and a backward Euler scheme is constructed. It is proved by the maximum principle that the scheme is uniquely solvable, unconditionally stable and convergent in L_∞ norm. The convergence orders of u and p are of O(τ + h²). The impact of initial data errors on the numerical solution is also considered. Numerical experiments are presented to illustrate the validity of the theoretical results.     

Factoring and decomposing a class of linear functional systems

Within a constructive homological algebra approach, we study the factorization and decomposition problems for a class of linear functional (determined, over-determined, under-determined) systems. Using the concept of Ore algebras of functional operators (e.g., ordinary/partial differential operators, shift operators, time-delay operators), we first concentrate on the computation of morphisms from a finitely presented left module M over an Ore algebra to another one M′, where M (resp., M′) is a module intrinsically associated with the linear functional system Ry = 0 (resp., R′z = 0). These morphisms define applications sending solutions of the system R′z = 0 to solutions of R y = 0. We explicitly characterize the kernel, image, cokernel and coimage of a general morphism. We then show that the existence of a non-injective endomorphism of the module M is equivalent to the existence of a non-trivial factorization R = R₂R₁ of the system matrix R. The corresponding system can then be integrated “in cascade”. Under certain conditions, we also show that the system Ry = 0 is equivalent to a system R′z = 0, where R′ is a block-triangular matrix of the same size as R. We show that the existence of idempotents of the endomorphism ring of the module M allows us to reduce the integration of the system Ry = 0 to the integration of two independent systems R₁y₁ = 0 and R₂y₂ = 0. Furthermore, we prove that, under certain conditions, idempotents provide decompositions of the system Ry = 0, i.e., they allow us to compute an equivalent system R′z = 0, where R′ is a block-diagonal matrix of the same size as R. Applications of these results in mathematical physics and control theory are given. Finally, the different algorithms of the paper are implemented in the Maple package Morphisms based on the library oremodules.     

Alexandrov’s inequality and conjectures on some Toeplitz matrices

We study determinant inequalities for certain Toeplitz-like matrices over C. For fixed n and N ? 1, let Q be the n × (n + N − 1) zero-one Toeplitz matrix with Q_ij = 1 for 0 ? j − i ? N − 1 and Q_ij = 0 otherwise. We prove that det(QQ^∗) is the minimum of det(RR^∗) over all complex matrices R with the same dimensions as Q satisfying ∣R_ij∣ ? 1 whenever Q_ij = 1 and R_ij = 0 otherwise. Although R has a Toeplitz-like band structure, it is not required to be actually Toeplitz. Our proof involves Alexandrov’s inequality for polarized determinants and its generalizations. This problem is motivated by Littlewood’s conjecture on the minimum 1-norm of N-term exponential sums on the unit circle. We also discuss polarized Bazin-Reiss-Picquet identities, some connections with k-tree enumeration, and analogous conjectured inequalities for the elementary symmetric functions of QQ^∗.     

Minmax regret location–allocation problem on a network under uncertainty

We consider a robust location–allocation problem with uncertainty in demand coefficients. Specifically, for each demand point, only an interval estimate of its demand is known and we consider the problem of determining where to locate a new service when a given fraction of these demand points must be served by the utility. The optimal solution of this problem is determined by the “minimax regret” location, i.e., the point that minimizes the worst-case loss in the objective function that may occur because a decision is made without knowing which state of nature will take place. For the case where the demand points are vertices of a network we show that the robust location–allocation problem can be solved in O(min{p, n − p}n³m) time, where n is the number of demand points, p (p < n) is the fixed number of demand points that must be served by the new service and m is the number of edges of the network.     

Identifying large robust network clusters via new compact formulations of maximum k-club problems

Network robustness issues are crucial in a variety of application areas. In many situations, one of the key robustness requirements is the connectivity between each pair of nodes through a path that is short enough, which makes a network cluster more robust with respect to potential network component disruptions. A k-club, which by definition is a subgraph of a diameter of at most k, is a structure that addresses this requirement (assuming that k is small enough with respect to the size of the original network). We develop a new compact linear 0-1 programming formulation for finding maximum k-clubs that has substantially fewer entities compared to the previously known formulation (O(kn²) instead of O(n^k+1), which is important in the general case of k > 2) and is rather tight despite its compactness. Moreover, we introduce a new related concept referred to as an R-robust k-club (or, (k, R)-club), which naturally arises from the developed k-club formulations and extends the standard definition of a k-club by explicitly requiring that there must be at least R distinct paths of length at most k between all pairs of nodes. A compact formulation for the maximum R-robust k-club problem is also developed, and error and attack tolerance properties of the important special case of R-robust 2-clubs are investigated. Computational results are presented for multiple types of random graph instances.     

A delayed computer virus propagation model and its dynamics

In this paper, we propose a delayed computer virus propagation model and study its dynamic behaviors. First, we give the threshold value R₀ determining whether the virus dies out completely. Second, we study the local asymptotic stability of the equilibria of this model and it is found that, depending on the time delays, a Hopf bifurcation may occur in the model. Next, we prove that, if R₀ = 1, the virus-free equilibrium is globally attractive; and when R₀ < 1, it is globally asymptotically stable. Finally, a sufficient criterion for the global stability of the virus equilibrium is obtained.     

Sharp distortion theorems for some subclass of close-to-convex functions

For real A, B such that −1 ? B < A ? 1, we denote by R(A,B) the class of functions, such that f′ ? (1 + Az)/(1 + Bz). Sharp distortion results for functions from R_A,B are obtained.     

Boundedness of solutions for asymmetric Duffing equations

In this paper, we are concerned with the boundedness of all the solutions and the existence of quasiperiodic solutions for some Duffing equations , where e(t) is of period 1, and g : R → R possesses the characters: g(x) is superlinear when x ? d₀, d₀ is a positive constant and g(x) is semilinear when x ? 0.     

Efficient Chebyshev spectral methods for solving multi-term fractional orders differential equations

In this paper, we state and prove a new formula expressing explicitly the derivatives of shifted Chebyshev polynomials of any degree and for any fractional-order in terms of shifted Chebyshev polynomials themselves. We develop also a direct solution technique for solving the linear multi-order fractional differential equations (FDEs) with constant coefficients using a spectral tau method. The spatial approximation with its fractional-order derivatives (described in the Caputo sense) are based on shifted Chebyshev polynomials T_L,n(x) with x ∈ (0, L), L > 0 and n is the polynomial degree. We presented a shifted Chebyshev collocation method with shifted Chebyshev–Gauss points used as collocation nodes for solving nonlinear multi-order fractional initial value problems. Several numerical examples are considered aiming to demonstrate the validity and applicability of the proposed techniques and to compare with the existing results.     

Global stability of nonresident computer virus models

In this paper, applying Lyapunov functional techniques to nonresident computer virus models, we establish global dynamics of the model whose threshold parameter is the basic reproduction number R₀ such that the virus‐free equilibrium is globally asymptotically stable when R₀ ≤ 1, and the infected equilibrium is globally asymptotically stable when R₀ > 1 under the same restricted condition on a parameter, which appeared in the literature on delayed susceptible‐infected‐recovered‐susceptible (SIRS) epidemic models. We use new techniques on permanence and global stability of this model for R₀ > 1. Copyright © 2014 John Wiley & Sons, Ltd.     

Dynamic model of worm propagation in computer network

In this paper, an attempt has been made to mathematically formulate a compartmental susceptible – exposed – infectious – susceptible with vaccination (that is, anti-virus treatment) (SEIS-V) epidemic transmission model of worms in a computer network with natural death rate (which depends on the total number of nodes). The stability of the result is stated in terms of modified reproductive number R_v. We have derived an explicit formula for the modified reproductive number R_v, and have shown that the worm-free equilibrium, whose component of infective is zero, is globally asymptotically stable if R_v < 1, and unstable if R_v > 1. The contribution of vertical transmission to the modified reproductive number is also analyzed. Numerical methods are employed to solve and simulate the system of equations developed and interpretation of the model yields interesting revelations. Analysis of efficient antivirus software is also performed.     

Bounds for increasing multi-state consecutive k-out-of-r-from-n: F system with equal components probabilities

The consecutive k-out-of-r-from-n: F system was generalized to multi-state case. This system consists of n linearly ordered components which are at state below j if and only if at least k_j components out of any r consecutive are in state below j. In this paper we suggest bounds of increasing multi-state consecutive-k-out-of-r-from-n: F system (k₁ ? k₂ ? ? ? k_M) by applying second order Boole–Bonferroni bounds and applying Hunter–Worsley upper bound. Also numerical results are given. The programs in V.B.6 of the algorithms are available upon request from the authors.     

Mathematical model on the transmission of worms in wireless sensor network

Wireless sensor networks (WSNs) have received extensive attention due to their great potential in civil and military applications. The sensor nodes have limited power and radio communication capabilities. As sensor nodes are resource constrained, they generally have weak defense capabilities and are attractive targets for software attacks. Cyber attack by worm presents one of the most dangerous threats to the security and integrity of the computer and WSN. In this paper, we study the attacking behavior of possible worms in WSN. Using compartmental epidemic model, we propose susceptible – exposed – infectious – recovered – susceptible with a vaccination compartment (SEIRS-V) to describe the dynamics of worm propagation with respect to time in WSN. The proposed model captures both the spatial and temporal dynamics of worms spread process. Reproduction number, equilibria, and their stability are also found. If reproduction number is less than one, the infected fraction of the sensor nodes disappears and if the reproduction number is greater than one, the infected fraction persists and the feasible region is asymptotically stable region for the endemic equilibrium state. Numerical methods are employed to solve and simulate the systems of equations developed and also to validate our model. A critical analysis of vaccination class with respect to susceptible class and infectious class has been made for a positive impact of increasing security measures on worm propagation in WSN.