Search

On the basis of investigating the statistical data of bus transport networks of three big cities in China, we propose that each bus route is a clique (maximal complete subgraph) and a bus transport network (BTN) consists of a lot of cliques, which intensively connect and overlap with each other. We study the network properties, which include the degree distribution, multiple edges' overlapping time distribution, distribution of the overlap size between any two overlapping cliques, distribution of the number of cliques that a node belongs to. Naturally, the cliques also constitute a network, with the overlapping nodes being their multiple links. We also research its network properties such as degree distribution, clustering, average path length, and so on. We propose that a BTN has the properties of random clique increment and random overlapping clique, at the same time, a BTN is a small-world network with highly clique-clustered and highly clique-overlapped. Finally, we introduce a BTN evolution model, whose simulation results agree well with the statistical laws that emerge in real BTNs.

Open Vehicle Routing Problem with Time Dependent Travel Time (OVRPTD) is different from most variants of vehilce routing problems from the liteture in that the vehicle dosen't return to the depot after serving the last customer and the travle time is time dependent. The travle time is presented by a continuous dynamic network time dependent function. Particle Swarm Optimization with self-adaptive inertia weight is presented. Each particle regulates its inertia weight according to the corresponding position with itself and the best particle in the population. Different updating rules are applied to the excellence particles and the inferior particles. For the excellence particles, compute their information entropy after server iterations, and update their position according to the new position updating function. And for the inferior particles, record them in the bulletin board, then after several iteration, use the new particles displace the inferior according the appearance frequency in the board. In the experiment, the influence of the population, iteration, inertia weight for the optimization result is discussed. By the experiment, give the field of the parameter. Compare the particle swarm optimization with other algorithms by the benchmark. The result shows the algorithm in the paper is the efficiency for the OVRPTD.

The aim of the paper is mainly to introduce and study I type of strong connectivity in L-fuzzy topological space. It preserves many good properties of connected sets in general topological spaces: The sets between I type of strongly connected set and its semiclosure are I type of strongly connected. Any union of I type of strongly connected sets with non-null intersection is I type of strongly connected. The images of irresolute order-homomorphisms of I type of strongly connected sets are I type of strongly connected. For I type of strong connectivity the K. Fan's Theorem holds.

The aim of the paper is mainly to introduce and study fuzzy pre-semi-open mapping, fuzzy pre-semi-irresolute mapping, fuzzy pre-semi-separation axioms and fuzzy pre-semi-connectedness in fuzzy topological spaces.

Sustainable energy development always involves complex optimization problems of design, planning, and control, which are often computationally difficult for conventional optimization methods. Fortunately, the continuous advances in artificial intelligence have resulted in an increasing number of heuristic optimization methods for effectively handling those complicated problems. Particularly, algorithms that are inspired by the principles of natural biological evolution and/or collective behavior of social colonies have shown a promising performance and are becoming more and more popular nowadays. In this paper we summarize the recent advances in bio-inspired optimization methods, including artificial neural networks, evolutionary algorithms, swarm intelligence, and their hybridizations, which are applied to the field of sustainable energy development. Literature reviewed in this paper shows the current state of the art and discusses the potential future research trends.

Protocol with QoS guarantee in unidirectional MANET is very important. Many of the classical routing protocols are put forward on the basis of two-way communication. While there exits unidirectional link because of differences in transmission power in each terminals as well as environmental factors such as topography and so on. This paper studies and applies the shortest path method based on graph theory and advances a new routing protocol with QoS guarantee in unidirectional MANET. In order to analyze its performance, adopt MANET to simulate the new routing model and compare it with DSR.

Privacy area protection has become more important than before in networked video surveillance. In this paper, we address privacy area protection related issues. First, the characteristics of security camera with pan/tilt rotation mechanism are introduced and the privacy problems of video surveillance in public areas are analyzed. Then, a new method of protecting privacy areas is proposed to automatically adapt the panning rotation and tilting rotation of security camera. This method contains two steps to calculate the masked area matrix from predetermined privacy area matrix and some static/dynamic basic parameters. Experimental results have shown that the proposed method could work well in real-systems and protect the privacy areas efficiently.

In order to reduce the local environment impact, the improved methods of optimal scheduling small hydropower are discussed and the sustainability optimal scheduling models which composed of optimal objectives and constraints are presented. The controlled reservoir releases for hydropower generation which based on float coding is used as the decision variable of the model and the reserved minimum flow and reservoir water level as special constraints. The controlled reservoir water level compared with maximal energy output during the period of dispatching is considered as objective. An improved PSO, resilient particle swarm optimization (RPSO), is adopted to the optimization. In RPSO, the velocity of a particle is not dependent on the size of distance between the individual and the optimal particle but only dependent on its direction. An adaptive scheme is adopted to adjust the magnitude of the velocity resiliently. A simulation operation of RPSO Matlab program for a factual small hydropower plant show that the sustainability optimum scheduling models and the technology based RPSO is viable and efficient. RPSO performance was compared with PSO and APSO on the same case, the results show that RPSO performed better.

Evolutionary algorithms approach to solution of the jobshop scheduling problems (JSP) is studied. Different from the existing genetic algorithm approach to JSP, the approach proposed in this paper is based upon the mixed integer model of the JSP, and casts the JSP as a mixed integer linear or nonlinear programming (MINLP) problem. With genetic algorithm and evolution strategy, the procedures for solution of MINLP problems are presented respectively. Constraints of the MINLP problems are dealt with easily by using the penalty function method and the Deb approach. At the end of the paper, computer simulations for a numerical example are made, and the results show that the proposed approach is effective.

The cooperation mode based on fractal-agent of the networked cooperative manufacturing system is introduced. According to the task executing principle of the fractal-agent, the dynamic task is bound to the corresponding dynamic role. It leads to raise the fractal-agent based Web access control approach, security policy and the relating access control matrix. Furthermore, the approach is carried out to enable the secure access, administration and control of the cooperative manufacturing system. The experimental results show that the research can meet the requirement of the Web access security of the enterprise cooperative manufacturing system.

To improve ATM network survivability level, a discrete Hopfield neural network algorithm with transient chaos for VP routing in ATM network was put forward. The computational energy function of VP routing and the motion equation of the discrete Hopfield neural network with transient chaos were also given. Compared with the VP routing algorithms exited, the simulation results show that it is both faster and more effective to achieve VP routing.