Novel results on attractivity of a neoclassical growth system incorporating multiple pairs of time-varying delays

In this paper,we analyze the global dynamics of a neoclassical growth system incorporating patch structure and multiple pairs of time-varying delays.First,we derive the global existence,positiveness and boundedness of solutions for the addressed system.Then,by employing some novel differential inequality analyses and the fluctuation lemma,both delay-independent and delay-dependent criteria are established to ensure that all solutions are convergent to a unique positive equilibrium point vector,which does not possess the same components.Our results supplement and improve some existing results.Ultimately,some numerical examples are afforded to prove the effectiveness and feasibility of the theoretical findings.

ADJACENT MARTIX METHOD OF IDENTIFYING ISOMORPHISM TO PLANAR KINEMATIC CHAIN WITH MULTIPLE JOINTS AND HIGHER PAIRS

The adjacent matrix method for identifying isomorphism to planar kinematic chain with multiple joints and higher pairs is presented. The topological invariants of the planar kinematic chain can be calculated and compared by adjacent matrix. The quantity of calculation can be reduced effectively using the several divisions of bars and the reconfiguration of the adjacent matrix. As two structural characteristics of adjacent matrix, the number of division and division code are presented. It can be identified that two kinematic chains are isomorphic or not by comparing the structural characteristics of their adjacent matrixes using a method called matching row-to-row. This method may be applied to the planar linkage chain too. So, the methods of identifying isomorphism are unified in the planar kinematic chain that has or hasn＇t higher pairs with or without multiple joints. And it has some characters such as visual, simple and convenient for processing by computer, and so on.

Multiple-Constraint-Aware RWA Algorithms Based on a Comprehensive Evaluation Model:Use in Wavelength-Switched Optical Networks

Because of explosive growth in Internet traffic and high complexity of heterogeneous networks, improving the routing and wavelength assignment （RWA） algorithm in underlying optical networks has become very important. Where there are multiple links between different the node pairs, a traditional wavelength-assignment algorithm may be invalid for a wavelength-switched optical networks （WSON） that has directional blocking constraints. Also, impairments in network nodes and subsequent degradation of optical signals may cause modulation failure in the optical network. In this paper, we propose an RWA algorithm based on a novel evaluation model for a WSQN that has multiple constraints. The algorithm includes comprehensive evaluation model （CEM） and directional blocking constraint RWA based on CEM （DB-RWA）. Diverse constraints are abstracted into various constraint conditions in order to better assign routing and wavelength. We propose using the novel CEM to optimize routing according to an assessed value of constraints on transmission performance. This eliminates the effects of physical transmission impairments in a WSON. DB-RWA based on CEM abstracts directional blocking conditions in multiple links between network nodes into directional blocking constraints. It also satisfies rigorous network specifications and provides flexibility, scalability, and first-fit rate for the backbone, especially in multiple links between WSON nodes.