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.     

Symmetry in world trade network

Symmetry of the world trade network provides a novel perspective to understand the world-wide trading system. However, symmetry in the world trade network (WTN) has been rarely studied so far. In this paper, the authors systematically explore the symmetry in WTN. The authors construct WTN in 2005 and explore the size and structure of its automorphism group, through which the authors find that WTN is symmetric, particularly, locally symmetric to a certain degree. Furthermore, the authors work out the symmetric motifs of WTN and investigate the structure and function of the symmetric motifs, coming to the conclusion that local symmetry will have great effect on the stability of the WTN and that continuous symmetry-breakings will generate complexity and diversity of the trade network. Finally, utilizing the local symmetry of the network, the authors work out the quotient of WTN, which is the structural skeleton dominating stability and evolution of WTN. This research was supported by the National Natural Science Foundation of China under Grant No. 70371070; Shanghai Leading Academic Discipline Project under Grant No. S30504; and Key Project for Fundamental Research of STCSM under Grant No. 06JC14057.     

基于SwissPdbViewer和MATLAB对人类SOX蛋白三级结构建模及分析

SOX蛋白具有一个与DNA特异结合的高保守HMG-box结合域。利用MATLAB的Sequence Analysis工具从Genbank中下载人类SOX蛋白序列信息,二次筛选获得22个有效的序列数据。以三级结构已知的SOX2、SRY、SOX5为模板,联合SwissPdbViewer与MATLAB,采用同源建模方法对SOX蛋白HMG-box进行建模、预测;利用MATLAB的Visualization Tool分析预测结果的三维结构。结果显示SOX蛋白HMG-box的三级结构极为相似,由3个α螺旋和2个热力学结构不稳定的loop区构成;表面静电分析显示SOX蛋白C端有一个可能与其它小分子或蛋白质的相互作用位点的N/C腔。SOX蛋白的上述空间结构可能与其活性与功能的调控有关。     

基于罗德里格斯参数的惯性系传递对准算法

针对传统的传递对准模型在大失准角下的强非线性问题以及由残余杆臂误差导致的传递对准精度下降问题, 提出了一种改进的惯性系传递对准算法。首先, 对子惯导姿态矩阵进行链式分解, 得到常值姿态矩阵; 然后, 利用罗德里格斯参数等价替代该常值姿态矩阵, 建立关于罗德里格斯参数和残余杆臂误差的具有弱非线性量测的传递对准模型; 最后, 利用非线性滤波对状态进行估计。基于摇摆运动的仿真实验表明, 在存在大安装误差角以及残余杆臂误差情况下, 算法相比于现有方法, 对准速度更快, 对准精度更高, 在5~10 s内即可完成传递对准。车载试验结果也间接说明算法具有更高的传递对准性能。     

车载导航系统动态高精度初始对准技术

针对载车在运动状态下的初始对准问题,提出了利用航位推算算法进行精对准的新方法,阐述了航位推算轨迹和真实轨迹相似的原理。在载车初始粗对准之后,行驶一段路程到达一位置已知点,由航位推算结果并运用相似性原理求出初始粗对准的航向误差角,从而修正航向角达到精对准的目的。最后通过跑车试验验证了对准方法的有效性,当载车起始点和位置已知点间距离为6 km左右时,初始对准航向角可达到角分级精度。     

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.     

支持向量回归机元参数优化方法

为了优化ε不敏感支持向量回归机（ε-support vector regression, ε-SVR）的三类元参数,根据其耦合程度将其优化问题分解为核参数优化和结构参数（即不敏感参数和正则化参数）优化两个子问题,并提出了相应的优化方法。首先,提出了一种新的核校准系数以优化核参数;其次,提出了一种基于期望训练误差的结构参数优化方法;最后,为准确估算ε-SVR的期望训练误差,还提出了一种根据实际训练误差分布特征评估和校正期望误差的方法。仿真结果表明,该文方法具有与交叉检验法近似的优化效果,且时间效率更高。     

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.     

Transfer alignment of shipborne inertial-guided weapon systems

The transfer alignment problem of the shipborne weapon inertial navigation system (INS) is addressed. Specifically, two transfer alignment algorithms subjected to the ship motions induced by the waves are discussed. To consider the limited maneuver level performed by the ship, a new filter algorithm for transfer alignment methods using velocity and angular rate matching is first derived. And then an improved method using integrated velocity and integrated angular rate matching is introduced to reduce the effect of the ship body flexure. The simulation results show the feasibility and validity of the proposed transfer alignment algorithms.     

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.     

基于多核流处理器的BLAST并行化算法研究

序列比对是生物信息学中最基本、最重要的操作,通过序列比对可以发现生物序列中的功能、结构和进化的信息。BLAST算法是序列比对中应用广泛的算法之一。基于多核流处理器GPU和CPU的异构乎台,提出了BLAST算法构造单词表和单词匹配扩展的并行化实现方法。实验证明构造单词表的计算性能获得3倍以上的加速比;单词匹配扩展采用的混合并行方式可以获得7倍左右的加速比,内部并行方式可取得3～4倍的加速比。     

基于信息复用和算法融合的初始对准方法

对惯性系多矢量定姿法的误差特性进行了理论分析,同时分析了最优估计初始对准的可观测性和对准误差,得出静基座下两种方法的对准精度相当的结论,通过试验验证了该结论,并发现当对准时间较短时,多矢量定姿法存在较大波动,因此将对准阶段的所有数据均用于多矢量定姿,提高算法稳定性,并将最优估计对准扩展到整个对准阶段,从而提高了对准精度...     

New celestial assisted INS initial alignment method for lunar explorer

In the future lunar exploration programs of China,soft landing,sampling and returning will be realized.For lunar explorers such as Rovers,Landers and Ascenders,the inertial navigation system(INS) will be used to obtain high-precision navigation information.INS propagates position,velocity and attitude by integration of sensed accelerations,so initial alignment is needed before INS can work properly.However,traditional ground-based initial alignment methods cannot work well on the lunar surface because of its low rotation rate(0.55%).For solving this problem, a new autonomous INS initial alignment method assisted by celestial observations is proposed,which uses star observations to help INS estimate its attitude,gyroscopes drifts and accelerometer biases.Simulations show that this new method can not only speed up alignment,but also improve the alignment accuracy.Furthermore, the impact factors such as initial conditions,accuracy of INS sensors,and accuracy of star sensor on alignment accuracy are analyzed in details,which provide guidance for the engineering applications of this method.This method could be a promising and attractive solution for lunar explorer’s initial alignment.     

基于序列对齐的客户购买行为相似比较方法

序列对齐方法(SAM)是一种比较字符串序列间差异程度的方法。在SAM的基础上,提出了客户购买行为的相似比较标准,并给出了快速计算客户购买行为相似度的算法,从新的角度解决了客户的相似性比较问题。该方法可以发现客户购买产品和购买金额的差异,对基于客户购买行为的市场细分具有实际应用价值。     

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.     

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.     

A differential game model for a developing and a developed country

A differential game (DG) model for a developing and a developed country is considered. Each player makes decisions about how much resource to be used to restrict the opponent's development so as to maximize his weighted sum of current consumption and final output. Current consumption is assumed to be preferred to final output for both players. The developing country is assumed to have a higher economic growth rate and a higher preference to final output, whereas the developed country is assumed to have a higher initial income and a higher efficiency in restricting his opponent. This problem is investigated under three kinds of information structures, i.e., a zerosum, a nonzero-sum, and a Stackelberg game. Open-loop equilibrium solutions are obtained for all the three cases. Economic implications of the result are provided. The research is supported by the National Natural Science Foundation of China under Grant Nos. 70771118 and 70371030 and the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry under Grant No. 2006.331.     

STABILITY ANALYSIS OF TWO-SECTORS STOCHASTIC ECONOMIC GROWTH MODEL

In the paper, we investigate the stability of a two-sector economic growth model under stochastic case. A two-dimensional stochastic differential system is deduced by Ito＇s formula, by using Lyapunov function methods, whether the growth rates of physical capital and human capital are exponentially stable or unstable depends on the values for parameters. Finally, we also illustrate the results with two examples.     

FLOCKING OF MULTI-AGENT DYNAMIC SYSTEMS WITH GUARANTEED GROUP CONNECTIVITY*

This paper investigates distributed flocking problem where the information exchange among agents is modeled by the communication topology changing with time. Previous research on this problem establishes group stabilization by assuming that the dynamic topology is connected all the time, which however cannot be guaranteed by most proposed distributed control laws. In this paper, a distributed algorithm to distill a necessary subgraph of the initial communication topology is presented. This subgraph covers all the vertices of the communication topology and is proved to be connected as long as the initial communication topology is connected. A distributed control law is then designed to pursue the flocking motion while preserving all the edges in this subgraph. In this way, connectivity can be preserved all the time, and flocking problem is thus solved only provided the initial communication topology of multi-agent system is connected.