DESIGN METHODOLOGY OF NETWORKED SOFTWARE EVOLUTION GROWTH BASED ON SOFTWARE PATTERNS

Recently,some new characteristics of complex networks attract the attentions of scientistsin different fields,and lead to many kinds of emerging research directions.So far,most of the researchwork has been limited in discovery of complex network characteristics by structure analysis in large-scalesoftware systems.This paper presents the theoretical basis,design method,algorithms and experiment results ofthe research.It firstly emphasizes the significance of design method of evolution growth for networktopology of Object Oriented(OO)software systems,and argues that.the selection and modulationof network models with various topology characteristics will bring un-ignorable effect on the processof design and implementation of OO software systems.Then we analyze the similar discipline of“negation of negation and compromise”between the evolution of network models with different topologycharacteristics and the development of software modelling methods.According to the analysis of thegrowth features of software patterns,we propose an object-oriented software network evolution growthmethod and its algorithms in succession.In addition,we also propose the parameter systems for OOsoftware system metrics based on complex network theory.Based on these parameter systems,it cananalyze the features of various nodes,links and local-world,modulate the network topology and guidethe software metrics.All these can be helpful to the detailed design,implementation and performanceanalysis.Finally.we focus on the application of the evolution algorithms and demonstrate it by a casestudy.Comparing the results from our early experiments with methodologies in empirical software engi-neering,we believe that the proposed software engineering design method is a computational softwareengineering approach based on complex network theory.We argue that this method should be greatlybeneficial for the design,implementation,modulation and metrics of functionality,structure and per-formance in large-scale OO software complex system.     

On spectrum of networks based on matrix of link-state and its symmetry

This paper constructs a new spectrum of networks by means of the matrix of link-state of the network, which can reveal the characteristics of the correlation between the degrees of the network. Also, the computation of this spectrum of networks is usually more feasible and more efficient due to the much lower order of its matrix of link-state than its adjacent matrix in practice. Some estimates for the bounds of the key eigenvalues in the spectrum are obtained, the corresponding inequalities are presented and proved. For the sake of its application, the authors define spectrum of networks in two ways, and all theorems are given in parallel for both kinds of definition. In addition, the authors find a symmetry in the spectrum, which is relative to the characteristic of structure of its network to some extent. This research is supported by the Key Project for Fundamental Research of STCSM under Grant No. 06JC14057.     

Robust Consensus and Soft Control of Multi-Agent Systems with Noises*

This paper considers the problem of robust consensus for a basic class of multi-agent systems with bounded disturbances and with directed information flow. A necessary and sufficient condition on the robust consensus is first presented, which is then applied to the analysis, control and decision making problems in the noise environments. In particular, the authors show how a soft control technique will synchronize a group of autonomous mobile agents without changing the existing local rule of interactions, and without assuming any kind of connectivity conditions on the system trajectories.     

Cluster Synchronization in a Complex Dynamical Network with Two Nonidentical Clusters

This paper further investigates cluster synchronization in a complex dynamical network with two-cluster. Each cluster contains a number of identical dynamical systems, however, the subsystems composing the two clusters can be different, i.e., the individual dynamical system in one cluster can differ from that in the other cluster. Complete synchronization within each cluster is possible only if each node from one cluster receives the same input from nodes in other cluster. In this case, the stability condition of one-cluster synchronization is known to contain two terms： the first accounts for the contribution of the inner-cluster coupling structure while the second is simply an extra linear term, which can be deduced by the ＂same-input＂ condition. Applying the connection graph stability method, the authors obtain an upper bound of input strength for one cluster if the first account is known, by which the synchronizability of cluster can be scaled. For different clusters, there are different upper bound of input strength by virtue of different dynamics and the corresponding cluster structure. Moreover, two illustrative examples are presented and the numerical simulations coincide with the theoretical analysis.     

Remarks on Network Community Properties

This paper discusses a popular community definition in complex network research in terms of the conditions under which a community is minimal, that is, the community cannot be split into several smaller communities or split and reorganized with other network elements into new communities. The result provides a base on which further optimization computation of the quantitative measure for community identification can be realized.     

网络结构熵及其在非标度网络中的应用

为了定量地刻画复杂网络的非标度性,提出了节点重要度、网络结构熵、标准网络结构熵的概念,阐述了网络结构熵与连接度分布的关系.以世界贸易网为实例,比较了随机网络与非标度网络的网络结构熵.最后指出网络结构熵将是研究复杂网络的一个重要工具.     

The projective plane crossing numbers of circular graphs*

The authors give an upper bound for the projective plane crossing number of a circular graph. Also, the authors prove the projective plane crossing numbers of circular graph C （8, 3） and C （9, 3） are 2 and 1, respectively.     

A multiyear lags input-holding-output model on education with excluding idle capital

This paper develops a multi-year lag Input-Holding-Output (I-H-O) Model on education with exclusion of the idle capital to address the reasonable education structure in support of a sustainable development strategy in China. First, the model considers the multiyear lag of human capital because the lag time of human capital is even longer and more important than that of fixed capital. Second, it considers the idle capital resulting from the output decline in education, for example, student decrease in primary school. The new generalized Leonitief dynamic inverse is deduced to obtain a positive solution on education when output declines as well as expands. After compiling the 2000 I-H-O table on education, the authors adopt modifications-by-step method to treat nonlinear coefficients, and calculate education scale, the requirement of human capital, and education expenditure from 2005 to 2020. It is found that structural imbalance of human capital is a serious problem for Chinese economic development. This research was supporting by the Key Project of National Natural Science Foundation of China under Grant No. 60874119, Innovation Funds of Chinese Academy of Sciences, Research Fund for Humanities and Social Sciences in colleges under Grant No. 06BJY102, Key project in Jiangxi Soft Science Project under Grant No. [2006]188, Jiangxi Research Fund for Humanities and Social Sciences in colleges under Grant No. 03JJ01, and Henan Research Fund for Humanities and Social Sciences in colleges under Grant No. 2008-ZD-002.     

Nonmonotonic Reduced Projected Hessian Method Via an Affine Scaling Interior Modified Gradient Path for Bounded-Constrained Optimization

The authors propose an affine scaling modified gradient path method in association with reduced projective Hessian and nonmonotonic interior backtracking line search techniques for solving the linear equality constrained optimization subject to bounds on variables. By employing the QR decomposition of the constraint matrix and the eigensystem decomposition of reduced projective Hes- sian matrix in the subproblem, the authors form affine scaling modified gradient curvilinear path very easily. By using interior backtracking line search technique, each iterate switches to trial step of strict interior feasibility. The global convergence and fast local superlinear/quadratical convergence rates of the proposed algorithm are established under some reasonable conditions. A nonmonotonic criterion should bring about speeding up the convergence progress in some ill-conditioned cases. The results of numerical experiments are reported to show the effectiveness of the proposed algorithm.     

Web Services Composing by Multiagent Negotiation

Composing web services is gained daily attention in Service Oriented Computing. It includes the dynamic discovery, interaction and coordination of agent-based semantic web services. The authors first follow Function Ontology and Automated Mechanism Design for service agents aggregating. Then the problem is formulated but it is ineffective to solve it from the traditional global view. Because the complexity is NP-complete and it is dii~cult or even impossible to get some personal information. This paper provides a multi-agent negotiation idea in which each participant negotiates under the condition of its reservation payoff being satisfied. Numerical experiment is given and well evaluates the negotiation.     

关键基础设施工程网络模体与超家族

基于模体和超家族理念自下而上揭示网络结构特征是复杂网络微观研究中的前沿领域. 辨析若干关键基础设施工程网络的子图(模体)特性和超家族特征, 表明工程网络模体表现为经济、技术和地理等因素约束下, 网络设计和建设预先明确的、非随机的特定结构形式, 依据给定分类规则将工程网络子图分为必要、非必要和特征子图三种形式; 基于已有子图比剖面, 以及研究提出的子图浓度和子图组合机制超家族分类方法, 辨析关键基础设施工程网络的家族特征和分类方法异同. 提供了复杂工程网络结构规划设计的系统方法.     

Testing serial correlation in semiparametric varying coefficient partially linear errors-in-variables model

The authors propose a V _{N, p} test statistic for testing finite-order serial correlation in a semiparametric varying coefficient partially linear errors-in-variables model. The test statistic is shown to have asymptotic normal distribution under the null hypothesis of no serial correlation. Some Monte Carlo experiments are conducted to examine the finite sample performance of the proposed V _{N, p} test statistic. Simulation results confirm that the proposed test performs satisfactorily in estimated size and power. This research is supported by the National Natural Science Foundation of China under Grant Nos. 10871217 and 40574003; the Science and Technology Project of Chongqing Education Committee under Grant No. KJ080609; the Doctor's Start-up Research Fund under Grant No. 08-52204; and the Youth Science Research Fund of Chongqing Technology and Business University under Grant No. 0852008.     

Multi-agent aggregation behavior analysis: The dynamic communication topology*

The authors extend the Gazi＇s swarm model with local neighbor rules and the dynamic communication topology, and study its aggregation properties. Results of analysis show that all agents in the models aggregate and eventually form a cohesive cluster of finite size around the swarm center or the appointed point. Finally, simulations are provided to testify some of the results. Models in the paper are more applicable to the reality for the advantage that each agent only needs the partial information of the entire dynamic system when making motion decision.     

A Priority-Based Negotiations Approach for Handling Inconsistencies in Multi-Perspective Software Requirements

Inconsistency of multi-perspective requirements specifications is a pervasive issue during the requirements process. However, managing inconsistency is not just a pure technical problem. It is always associated with a process of interactions and competitions among corresponding stakeholders. The main contribution of this paper is to present a negotiations approach to handling inconsistencies in multi-perspective software requirements. In particular, the priority of requirements relative to each perspective plays an important role in proceeding negotiation over resolving inconsistencies among different stakeholders. An algorithm of generating negotiation proposals and an approach to evaluating proposals are also presented in this paper, respectively.     

New results about the relationship between optimally weighted least squares estimate and linear minimum variance estimate

The optimally weighted least squares estimate and the linear minimum variance estimate are two of the most popular estimation methods for a linear model. In this paper, the authors make a comprehensive discussion about the relationship between the two estimates. Firstly, the authors consider the classical linear model in which the coefficient matrix of the linear model is deterministic, and the necessary and sufficient condition for equivalence of the two estimates is derived. Moreover, under certain conditions on variance matrix invertibility, the two estimates can be identical provided that they use the same a priori information of the parameter being estimated. Secondly, the authors consider the linear model with random coefficient matrix which is called the extended linear model; under certain conditions on variance matrix invertibility, it is proved that the former outperforms the latter when using the same a priori information of the parameter. This research is supported in part by the National Natural Science Foundation of China under Grant Nos. 60232010, 60574032, and the Project 863 under Grant No. 2006AA12A104.     

Asymptotic Solution of Activator Inhibitor Systems for Nonlinear Reaction Diffusion Equations

A nonlinear reaction diffusion equations for activator inhibitor systems is considered. Under suitable conditions, firstly, the outer solution of the original problem is obtained, secondly, using the variables of multiple scales and the expanding theory of power series the formal asymptotic expansions of the solution are constructed, and finally, using the theory of differential inequalities the uniform validity and asymptotic behavior of the solution are studied.     

Stochastic differential equations and stochastic linear quadratic optimal control problem with Lévy processes

In this paper, the authors first study two kinds of stochastic differential equations (SDEs) with Lévy processes as noise source. Based on the existence and uniqueness of the solutions of these SDEs and multi-dimensional backward stochastic differential equations (BSDEs) driven by Lévy processes, the authors proceed to study a stochastic linear quadratic (LQ) optimal control problem with a Lévy process, where the cost weighting matrices of the state and control are allowed to be indefinite. One kind of new stochastic Riccati equation that involves equality and inequality constraints is derived from the idea of square completion and its solvability is proved to be sufficient for the well-posedness and the existence of optimal control which can be of either state feedback or open-loop form of the LQ problems. Moreover, the authors obtain the existence and uniqueness of the solution to the Riccati equation for some special cases. Finally, two examples are presented to illustrate these theoretical results. This work was supported by the National Basic Research Program of China (973 Program) under Grant No. 2007CB814904, the Natural Science Foundation of China under Grant No. 10671112 and Shandong Province under Grant No. Z2006A01, and Research Fund for the Doctoral Program of Higher Education of China under Grant No. 20060422018.     

Recognition of Structure Similarities in Proteins

Protein fold structure is more conserved than its amino acid sequence and closely associated with biological function, so calculating the similarity of protein structures is a fundamental problem in structural biology and plays a key role in protein fold classification, fold function inference, and protein structure prediction. Large progress has been made in recent years in this field and many methods for considering structural similarity have been proposed, including methods for protein structure comparison, retrieval of protein structures from databases, and ligand binding site comparison. Most of those methods can be available on the World Wide Web, but evaluation of all the methods is still a hard problem. This paper summarizes some popular methods and latest methods for structure similarities, including structure alignment, protein structure retrieval, and ligand binding site alignment.     

Bilevel programming model and solution method for mixed transportation network design problem

By handling the travel cost function artfully, the authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer, nonlinear bilevel programming problem, in which the lower-level problem, comparing with that of conventional bilevel DNDP models, is not a side constrained user equilibrium assignment problem, but a standard user equilibrium assignment problem. Then, the bilevel programming model for MNDP is reformulated as a continuous version of bilevel programming problem by the continuation method. By virtue of the optimal-value function, the lower-level assignment problem can be expressed as a nonlinear equality constraint. Therefore, the bilevel programming model for MNDP can be transformed into an equivalent single-level optimization problem. By exploring the inherent nature of the MNDP, the optimal-value function for the lower-level equilibrium assignment problem is proved to be continuously differentiable and its functional value and gradient can be obtained efficiently. Thus, a continuously differentiable but still nonconvex optimization formulation of the MNDP is created, and then a locally convergent algorithm is proposed by applying penalty function method. The inner loop of solving the subproblem is mainly to implement an all-or-nothing assignment. Finally, a small-scale transportation network and a large-scale network are presented to verify the proposed model and algorithm. This research is supported by the National Basic Research Program of China under Grant No. 2006CB705500, the National Natural Science Foundation of China under Grant No. 0631001, the Program for Changjiang Scholars and Innovative Research Team in University, and Volvo Research and Educational Foundations.