Loading...

Table of Content

    25 August 2014, Volume 27 Issue 4
    article
    CONTROL OF VEHICLE PLATOONS FOR HIGHWY SAFETY AND EFFICIENT UTILITY: CONSENSUS WITH COMMUNICATIONS AND VEHICLE DYNAMICS
    WANG Le Yi, SYED Ali ,YIN Gang George, PANDYA Abhilash,ZHANG Hongwei
    2014, 27(4):  605-631.  DOI: 10.1007/s11424-014-2115-z
    Asbtract ( 442 )   PDF (829KB) ( 698 )  
    Related Articles | Metrics
    Platoon formation of highway vehicles is a critical foundation for autonomous or semiautonomous vehicle control for enhanced safety, improved highway utility, increased fuel economy, and reduced emission toward intelligent transportation systems. Platoon control encounters great challenges from vehicle control, communications, team coordination, and uncertainties. This paper introduces a new method for coordinated control of platoons by using integrated network consensus decisions and vehicle control. To achieve suitable coordination of the team vehicles based on terrain and environmental conditions, the emerging technology of network consensus control is modified to a weighted and constrained consensus-seeking framework. Algorithms are introduced and their convergence properties are established. The methodology employs neighborhood information through on-board sensors and V2V or V2I communications, but achieves global coordination of the entire platoon. The ability of the  methods in terms of robustness, disturbance rejection, noise attenuation, and cyber-physical interaction is analyzed and demonstrated with simulated case studies.
    GROUP CONSENSUS FOR MULTIPLE NETWORKED EULER-LAGRANGE SYSTEMS WITH PARAMETRIC UNCERTAINTIES
    HU Hongxiang, ZHANG Zhe , YU Li , YU Wenwu , XIE Guangming
    2014, 27(4):  632-649.  DOI: 10.1007/s11424-014-2149-2
    Asbtract ( 630 )   PDF (1367KB) ( 431 )  
    Related Articles | Metrics
    In this paper, a group consensus problem is investigated for multiple networked agents with parametric uncertainties where all the agents are governed by the Euler-Lagrange system with uncertain parameters. In the group consensus problem, the agents asymptotically reach several different states rather than one consistent state. A novel group consensus protocol and a time-varying estimator of the uncertain parameters are proposed for each agent in order to solve the couple-group consensus problem. It is shown that the group consensus is reachable even when the system contains the uncertain parameters. Furthermore, the multi-group consensus is discussed as an extension of the couple-group consensus, and then the group consensus with switching topology is considered. Simulation results are finally provided to validate the effectiveness of the theoretical analysis.
    IDENTIFYING INFLUENTIAL SPREADERS IN ARTIFICIAL COMPLEX NETWORKS
    WANG Pei, TIAN Chengeng , LU Jun-an
    2014, 27(4):  650-665.  DOI: 10.1007/s11424-014-2236-4
    Asbtract ( 636 )   PDF (1646KB) ( 495 )  
    Related Articles | Metrics
    A long-term common belief in complex networks is that, the most connected nodes are the most efficient spreaders. However, recent investigations on real-world complex networks show that the most influential spreaders are those with the highest k-shell values. It is well-known that, many real-world complex networks have scale free (SF), small world (SW) properties, therefore, identification of influential spreaders in general artificial SF, SW as well as random networks will be more appealing. This research finds that, for artificial ER and SW networks, degree is more reliable than k-shell in predicting the outcome of spreading. However, for artificial SF networks, k-shell is remarkably reliable than degree and betweeness, which indicate that the four recently investigated real-world networks [Kitsak M, Gallos L K, Havlin S, Liljeros F, Muchnik L, Stanley H E, Makse H A, Identification of influential spreaders in complex networks, Nat. Phys., 2010, 6: 888–893.] are more similar to scale free ones. Moreover, the investigations also indicate us an optimal dissemination strategy in networks with scale free property. That is, starting from moderate-degree-nodes will be ok and even more economical, since one can derive roughly similar outcome with starting from hubs.
    ON THE OBSERVABILITY OF FREE BOOLEAN NETWORKS VIA THE SEMI-TENSOR PRODUCT METHOD
    LI Haitao, WANG Yuzhen, LIU Zhenbin
    2014, 27(4):  666-678.  DOI: 10.1007/s11424-014-2058-4
    Asbtract ( 535 )   PDF (203KB) ( 366 )  
    Related Articles | Metrics
    This paper investigates the observability of free Boolean networks by using the semi-tensor product method, and presents some new results. First, the concept of observability for free Boolean networks is proposed, based on which and the algebraic form of Boolean networks, a kind of observability matrix is constructed. Second, by the observability matrix, a new necessary and sufficient condition is given for the observability of Boolean networks. Third, the concept of observability index for observable Boolean networks is defined, and an algorithm is established to calculate the observability index. Finally, a practical example of D. Melanogaster segmentation polarity gene networks is studied to support our new results. The study of the illustrative example shows that the new results obtained in this paper are very effective in investigating the observability of free Boolean networks.
    TRAJECTORY TRACKING THEORY OF QUANTUM SYSTEMS
    CONG Shuang , LIU Jianxiu
    2014, 27(4):  679-693.  DOI: 10.1007/s11424-014-2013-4
    Asbtract ( 631 )   PDF (511KB) ( 287 )  
    Related Articles | Metrics
    The orbit tracking problem of a free-evolutionary target system in closed quantum systems is solved by changing it into the state transferring problem with the help of unitary transformation. The control law designed by the Lyapunov stability theorem employs a carefully constructed virtual mechanical quantity P to ensure the system convergence. The virtual mechanical quantity P is chosen by two approaches according to the forms of limit set, where P = −ρf is suitable for regular limit set and a new different P is constructed for irregular one. The proposed tracking control theory is demonstrated on a four-level quantum system by means of numerical simulation experiments.
    LINEAR CHAOS IN THE QUANTUM HARMONIC OSCILLATOR
    WU Xinxing , ZHU Peiyong
    2014, 27(4):  694-700.  DOI: 10.1007/s11424-014-2022-3
    Asbtract ( 511 )   PDF (163KB) ( 304 )  
    Related Articles | Metrics
    In this note, it is proved that for the annihilation operator B of the unforced quantum harmonic oscillator, Bn is mixing and generically δ-chaotic with any 0 < δ < 2 for each positive integer n. Besides, by using the result in [Wu X and Zhu P, J. Phys. A: Math. Theor., 2011, 44: 505101], the authors obtain that the principal measure of Bn is equal to 1 for each positive integer n.
    CONSENSUS DESIGN FOR CONTINUOUS-TIME MULTI-AGENT SYSTEMS WITH COMMUNICATION DELAY
    WANG Zhenhua , YOU Keyou , XU Juanjuan, ZHANG Huanshui
    2014, 27(4):  701-711.  DOI: 10.1007/s11424-014-3334-z
    Asbtract ( 436 )   PDF (247KB) ( 346 )  
    Related Articles | Metrics
    This paper investigates a consensus design problem for continuous-time first-order multiagent systems with uniform constant communication delay. Provided that the agent dynamic is unstable and the diagraph is undirected, sufficient conditions are derived to guarantee consensus. The key technique is the adoption of historical input information in the protocol. Especially, when agent’s own historical input information is used in the protocol design, the consensus condition is constructed in terms of agent dynamic, communication delay, and the eigenratio of the network topology. Simulation result is presented to validate the effectiveness of the theoretical result.
    OPTIMIZING CHINA’S EXPORT STRUCTURE COMBINING GOAL PROGRAMMING AND NON-COMPETITIVE INPUT-OUTPUT MODEL
    MU Zhirui,YANG Cuihong
    2014, 27(4):  712-728.  DOI: 10.1007/s11424-014-1112-6
    Asbtract ( 539 )   PDF (217KB) ( 368 )  
    Related Articles | Metrics
    Based on a non-competitive input-output model capturing China’s processing exports, this paper establishes a goal programming model to optimize China’s export structure. In this model, China’s domestic production is divided into three parts: Production for domestic use, processing exports,
    and non-processing exports and product on for other foreign invested enterprises. This division enables differentiation of the effects of various trade patterns, on the basis of which the authors conduct  an empirical analysis using 2002 data, to obtain a Pareto optimality.
    TESTING LINEAR AND NONLINEAR GRANGER CAUSALITY IN CSI300 FUTURES AND SPOT MARKETS BASED ON NEW CONCEPTS OF NONLINEAR POSITIVE/NEGATIVE SPILLOVER
    ZHOU Pu , LU Fengbin , WANG Shouyang
    2014, 27(4):  729-742.  DOI: 10.1007/s11424-014-2261-3
    Asbtract ( 611 )   PDF (204KB) ( 435 )  
    Related Articles | Metrics
    Hiemstra and Jones (1994) argued that a significant negative value of their nonlinear Granger causality test (H-J test) means there is a confounding effect in the prediction. However, from the theoretical analysis and Monte Carlo simulations, the authors find that H-J test is significantly negative under the circumstance of negative volatility spillover. Furthermore, the authors put forward the conceptions of positive/negative nonlinear spillover, and apply H-J test to examine positive/negative nonlinear spillover effect. The empirical study on China stock futures and spot markets shows that: 1) There is significant positive nonlinear spillover from futures to spot market; 2) There is significant negative nonlinear spillover from spot to futures market. The authors argue that there is “risk absorption” mechanism in information spillover from the spot market to the futures market, which is due to the temporal transfer of speculative trading from the analysis.
    COMPLEX SYSTEM ANALYSIS OF MARKET RETURN PERCOLATION MODEL ON SIERPINSKI CARPET LATTICE FRACTAL
    DONG Yanfang , WANG Jun
    2014, 27(4):  743-759.  DOI: 10.1007/s11424-014-2073-5
    Asbtract ( 641 )   PDF (1296KB) ( 374 )  
    Related Articles | Metrics
    This paper investigates the statistical behaviors of fluctuations of price changes in a stock market. The Sierpinski carpet lattice fractal and the percolation system are applied to develop a new random stock price for the financial market. The Sierpinski carpet is an infinitely ramified fractal and the percolation theory is usually used to describe the behavior of connected clusters in a random graph. The authors investigate and analyze the statistical behaviors of returns of the price model by some analysis methods, including multifractal analysis, autocorrelation analysis, scaled return interval analysis. Moreover, the authors consider the daily returns of Shanghai Stock Exchange Composite  Index, and the comparisons of return behaviors between the actual data an the simulation data are
    exhibited.
    SYSTEM SIMULATION AND RELIABILITY ASSESSMENT OF CHINESE CARBON SEQUESTRATION MARKET
    TANG Bo , GAO Jianzhong
    2014, 27(4):  760-776.  DOI: 10.1007/s11424-014-2126-9
    Asbtract ( 520 )   PDF (417KB) ( 348 )  
    Related Articles | Metrics
    This study builds a simulation of Chinese carbon sequestration market (CSM) based on the Swarm platform and complex adaptive system (CAS) theory. The simulation results represent that the total assets and profits of the carbon sequestration project (CSP) buyer and seller are steadily on the increase in the carbon trading market. The market regulatory efficiency is determined by the market investment and the improvement of regulation policy. Furthermore, the real sample simulation of Sichuan Daduhe Forest CSP demonstrates that the profit of CSP traded in the CSM is higher than the profit from the transactions of outside exchange. It implies that establishing CSM is an effective way to improve the CSP business for investors and a positive action to response to global warming as well. Finally, this study applies an Analytic Hierarchy Process-Fuzzy Comprehensive Evaluation (AHPFCE) approach to evaluate the reliability of CSM simulation. It concludes that the CSM simulation is “more creditable”, which indicates that the CSM simulation results can be used as a proxy to observe  the market uncertainties.
    SOME SEMI-BENT FUNCTIONS WITH POLYNOMIAL TRACE FORM
    CHEN Hao , CAO Xiwang
    2014, 27(4):  777-784.  DOI: 10.1007/s11424-014-2090-4
    Asbtract ( 554 )   PDF (183KB) ( 234 )  
    Related Articles | Metrics
    This paper is devoted to the study of semi-bent functions with several parameters flexible on the finite field F2n. Boolean functions defined on F2n of the form
    f(r) a,b (x) = Trn1 (axr(2m−1)) + Tr41 (bx 2n−1 5 ) and the form g(r,s) a,b,c,d(x) = Trn1 (axr(2m−1)) +Tr41 (bx 2n−1  5 ) +Trn1(cx(2m−1)12 +1) + Trn1 (dx(2m−1)s+1), where n = 2m, m ≡ 2 (mod 4), a, c ∈ F2n, and b ∈ F16, d ∈ F2, are investigated in constructing new classes of semi-bent functions. Some  characteristic sums such as Kloosterman sums and Weil sums are employed to determine whether the above functions are semi-bent or not.
    A NOTE ON TWO CLASSES OF BOOLEAN FUNCTIONS WITH OPTIMAL ALGEBRAIC IMMUNITY
    WU Baofeng , LIU Zhuojun , JIN Qingfang , ZHANG Xiaoming
    2014, 27(4):  785-794.  DOI: 10.1007/s11424-014-2132-y
    Asbtract ( 507 )   PDF (189KB) ( 287 )  
    Related Articles | Metrics
    Tu and Deng proposed a class of bent functions which are of optimal algebraic immunity under the assumption of a combinatorial conjecture. In this paper, the authors compute the dual of the Tu-Deng functions and then show that they are still of optimal algebraic immunity under the assumption of the same conjecture. For another class of Boolean functions constructed by Tang, et al. which are of optimal algebraic immunity with similar forms to Tu-Deng functions, the authors show that they are not bent functions by using some basic properties of binary complete Kloosterman sums.
    OPTIMAL BINARY CODES FROM ONE-LEE WEIGHT CODES AND TWO-LEE WEIGHT PROJECTIVE CODES OVER Z4
    SHI Minjia , WANG Yu
    2014, 27(4):  795-810.  DOI: 10.1007/s11424-014-2188-8
    Asbtract ( 620 )   PDF (251KB) ( 408 )  
    Related Articles | Metrics
    This paper investigates the structures and properties of one-Lee weight codes and two-Lee weight projective codes over Z4. The authors first give the Pless identities on the Lee weight of linear codes over Z4. Then the authors study the necessary conditions for linear codes to have one-Lee weight and two-Lee projective weight respectively, the construction methods of one-Lee weight and two-Lee weight projective codes over Z4 are also given. Finally, the authors recall the weight-preserving Gray map from (Zn4 , Lee weight) to (F2n 2 , Hamming weight), and produce a family of binary optimal oneweight linear codes and a family of optimal binary two-weight projective linear codes, which reach the Plotkin bound and the Griesmer bound.
    (1 − uv)-CONSTACYCLIC CODES OVER Fp + uFp + vFp + uvFp
    YU Haifeng , ZHU Shixin, KAI Xiaoshan
    2014, 27(4):  811-816.  DOI: 10.1007/s11424-014-3241-3
    Asbtract ( 800 )   PDF (160KB) ( 540 )  
    Related Articles | Metrics
    Constacyclic codes are an important class of linear codes in coding theory. Many optimal linear codes are directly derived from constacyclic codes. In this paper, (1 − uv)-constacyclic codes over the local ring Fp + uFp + vFp + uvFp are studied. It is proved that the image of a (1 − uv)- constacyclic code of length n over Fp + uFp + vFp + uvFp under a Gray map is a distance invariant quasi-cyclic code of index p2 and length p3n over Fp. Several examples of optimal linear codes over Fp from (1 − uv)-constacyclic codes over Fp + uFp + vFp + uvFp are given.