Abstract Redundancy needs more precise characterization as it is a major factor in the evolution and robustness of networks multivariate interactions. We investigate complexity such interactions by inferring connection transitivity that includes all possible measures path length for weighted graphs. The result, without breaking graph into smaller components, distance backbone subgraph sufficien...

In order to adapt the development needs and optimise oral communication ability, TV programme hosts need start from audience, grasp degree of educational literacy, insist on popularization spoken language meet new requirements contemporary communication. Re-conceptualisation basic principles by clarifying purpose communication, ensuring its effectiveness focusing normativity. At same time, pres...

The most famous one for finding the shortest path is the Dijkstra, but it has some limitations. For example, when there are more than one shortest path between the source node and one special node, Dijkstra could find only one of them. Besides, the algorithm is quite complex. This article introduce a conception of coding graph, abstracting the problem of shortest paths and critical paths into t...

As routes in MANET are composed of only mobile terminals based on a multi-hop mechanism, MANET may encounter severe situations where intermediate nodes disturb delivering packets adversely. Accordingly, the stability of routing protocols is very important for operating the ad hoc networks efficiently and securely. However finding a secure end-to-end path is not easy, since the nodes in MANET ar...

We discuss control strategies for communication networks such as the Internet. We advocate the goal of welfare maximization as a paradigm for network resource allocation. We explore the application of this paradigm to the case of parallel network paths. We show that welfare maximization requires active balancing across paths by data sources, and potentially requires implementation of novel tran...

Routing is gaining prime importance in our increasingly mobile and highly Information Technology enabled world. The shortest path problem is widely applied in transportation, communication and computer networks. It addresses the challenges of determining a path with minimum distance, time or cost from a source to the destination. This paper introduces a novel Genetic Algorithm (GA) approach to ...

trajectories generally used to describe the space and time required to perform a desired motion task for a mobile robot or manipulator system. in this paper, we considered a cubic polynomial trajectory for the problem of moving a mobile robot from its initial position to a goal position in over a continuous set of time. along the path, the robot requires to observe a certain acceleration profil...