A LOCAL DYNAMIC CLUSTER SELF-ORGANIZATION ALGORITHM IN WIRELESS SENSOR NETWORKS FOR RAINFALL MONITORING

Wireless Sensor Networks for Rainfall Monitoring (RM-WSNs) is a sensor network for the large-scale regional and moving rainfall monitoring,which could be controlled deployment. Delivery delay and cross-cluster calculation leads to information inaccuracy by the existing dynamic collabo-rative self-organization algorithm in WSNs. In this letter,a Local Dynamic Cluster Self-organization algorithm (LDCS) is proposed for the large-scale regional and moving target monitoring in RM-WSNs. The algorithm utilizes the resource-rich node in WSNs as the cluster head,which processes target information obtained by sensor nodes in cluster. The cluster head shifts with the target moving in chance and re-groups a new cluster. The target information acquisition is limited in the dynamic cluster,which can reduce information across-clusters transfer delay and improve the real-time of information acquisition. The simulation results show that,LDCS can not only relieve the problem of "too frequent leader switches" in IDSQ,also make full use of the history monitoring information of target and con-tinuous monitoring of sensor nodes that failed in DCS.

A Self-organization Mapping Neural Network Algorithm and Its Application to Identify Ecosystem Service Zones

The self-organization mapping （SOM） neural network algorithm is a new method used to identify the ecosystem service zones at regional extent. According to the ecosystem assessment framework of Millennium Ecosystem Assessment （ MA）, this paper develops an indicator system and conducts a spatial cluster analysis at the 1km by I km grid pixel scale with the SOM neural network algorithm to sort the core ecosystem services over the vertical and horizontal dimensions. A case study was carried out in Xilingol League. The ecosystem services in Xilingol League could be divided to six different ecological zones. The SOM neural network algorithm was capable of identifying the similarities among the input data automatically. The research provides both spatially and temporally valuable information targeted sustainable ecosystem management for decision-makers.

An Energy-Efficient Routing and Self-Organization Algorithm in Wireless Sensor Networks

Energy efficiency is the most important goal in wireless sensor network routing and self-organization algorithms. To achieve this goal, our paper first presents a distributed energy-aware routing algorithm Nearest to Theoretical Point（NTP）. Then it applies NTP to self-organization of sensor networks to form an energy-efficient self-organization algorithm Shortest Path Tree-NTP（SPT-NTP）. Theoretic analysis and simulation show that NTP and SPT-NTP can ensure less network energy consumption than other related algorithms.

Spatial Protection and Development of Traditional Mountain Settlements from the Perspective of Self-organization : A Case Study of Anju Ancient Town in Tongliang District, Chongqing

Through literature research, field research and urban design analysis methods, based on the self-organization theory, the evolution characteristics of the settlement space of Anju Ancient Town with significant characteristics of traditional mountain settlements were analyzed, and then its internal and external influencing factors were summarized. Finally, appropriate protection and development strategies were proposed, such as reasonably planning functional zones, breaking through the single structure, and creating a good living cultural environment. The innovation of this study is that it integrates the self-organization theory into the cognition of traditional mountain settlement space, and discusses the connection between the mountain settlement space and the traditional regional context under the modern development concept, so as to seek the benign protection and reasonable development of traditional mountain settlement space.

Clustering Algorithm of Quantum Self-Organization Network

To enhance the clustering ability of self-organization network, this paper introduces a quantum inspired self-organization clustering algorithm. First, the clustering samples and the weight values in the competitive layer are mapped to the qubits on the Bloch sphere, and then, the winning node is obtained by computing the spherical distance between sample and weight value. Finally, the weight values of the winning nodes and its neighborhood are updated by rotating them to the sample on the Bloch sphere until the convergence. The clustering results of IRIS sample show that the proposed approach is obviously superior to the classical self-organization network and the K-mean clustering algorithm.

Quantum Algorithm of Imperfect KB Self-organization Pt I: Smart Control-Information-Thermodynamic Bounds

The quantum self-organization algorithm model of wise knowledge base design for intelligent fuzzy controllers with required robust level considered.Background of the model is a new model of quantum inference based on quantum genetic algorithm.Quantum genetic algorithm applied on line for the quantum correlation’s type searching between unknown solutions in quantum superposition of imperfect knowledge bases of intelligent controllers designed on soft computing.Disturbance conditions of analytical information-thermodynamic trade-off interrelations between main control quality measures(as new design laws)discussed in Part I.The smart control design with guaranteed achievement of these trade-off interrelations is main goal for quantum self-organization algorithm of imperfect KB.Sophisticated synergetic quantum information effect in Part I(autonomous robot in unpredicted control situations)and II(swarm robots with imperfect KB exchanging between“master-slaves”)introduced:a new robust smart controller on line designed from responses on unpredicted control situations of any imperfect KB applying quantum hidden information extracted from quantum correlation.Within the toolkit of classical intelligent control,the achievement of the similar synergetic information effect is impossible.Benchmarks of intelligent cognitive robotic control applications considered.

Quantum Algorithm of Imperfect KB Self-organization. Pt II: Robotic Control with Remote Knowledge Base Exchange

The technology of knowledge base remote design of the smart fuzzy con­trollers with the application of the"Soft/quantum computing optimizer"toolkit software developed.The possibility of the transmission and commu­nication the knowledge base using remote connection to the control object considered.Transmission and communication of the fuzzy controller’s knowledge bases implemented through the remote connection with the control object in the online mode apply the Bluetooth or WiFi technologies.Remote transmission of knowledge bases allows designing many different built-in intelligent controllers to implement a variety of control strategies under conditions of uncertainty and risk.As examples,two different models of robots described(mobile manipulator and(“cart-pole”system)inverted pendulum).A comparison of the control quality between fuzzy controllers and quantum fuzzy controller in various control modes is presented.The ability to connect and work with a physical model of control object without using than mathematical model demonstrated.The implemented technol­ogy of knowledge base design sharing in a swarm of intelligent robots with quantum controllers.It allows to achieve the goal of control and to gain additional knowledge by creating a new quantum hidden information source based on the synergetic effect of combining knowledge.Develop­ment and implementation of intelligent robust controller’s prototype for the intelligent quantum control system of mega-science project NICA(at the first stage for the cooling system of superconducted magnets)is discussed.The results of the experiments demonstrate the possibility of the ensured achievement of the control goal of a group of robots using soft/quantum computing technologies in the design of knowledge bases of smart fuzzy controllers in quantum intelligent control systems.The developed software toolkit allows to design and setup complex ill-defined and weakly formal­ized technical systems on line.

Hierarchical Self-organization of Complex Systems

Researches on organization and structure in complex systems are academic and industrial fronts in modern sciences. Though many theories are tentatively proposed to analyze complex systems, we still lack a rigorous theory on them. Complex systems possess various degrees of freedom, which means that they should exhibit all kinds of structures. However, complex systems often show similar patterns and structures. Then the question arises why such similar structures appear in all kinds of complex systems. The paper outlines a theory on freedom degree compression and the existence of hierarchical self-organization for all complex systems is found. It is freedom degree compression and hierarchical self-organization that are responsible for the existence of these similar patterns or structures observed in the complex systems.

A Fairness Resource Allocation Algorithm for Coverage and Capacity Optimization in Wireless Self-Organized Network

To achieve the higher resource efficiency, Coverage and Capacity Optimization(CCO) as an important role of the network self-healing and self-optimization, has become a focus topic in wireless Self-Organized Network(SON). In this paper, a novel CCO scheme is proposed to maximize utility function of the integrated coverage and capacity. It starts with the analysis on the throughput proportional fairness(PF) algorithm and then proposes the novel Coverage and Capacity Proportional Fairness(CCPF) allocation algorithm along with a proof of the algorithms convergence. This proposed algorithm is applied in a coverage capacity optimization scheme which can guarantee the reasonable network capacity by the coverage range accommodation. Next, we simulate the proposed CCO scheme based on telecom operators' real network data and compare with three typical resource allocation algorithms: round robin(RR), proportional fairness(PF) and max C/I. In comparison of the PF algorithm, the numerical results show that our algorithm increases the average throughput by 1.54 and 1.96 times with constructed theoretical data and derived real network data respectively.

Evolution of technology management system based on self-organization theory

Industrial and academic interest in how to effectively manage technology resources is increasing as it becomes more and more important.Effective managing of technology resources depends on technology management system,and thus understanding how such system evolves becomes an ongoing research topic.Based on the self-organization theory,this paper constructs an evolution model of technology management system.The simulation results show that the evolution of each of the technology management subsystem is affected by the knowledge growth rate of its own,and it is also affected by the coupling and synergy relationship with other subsystems.Moreover,the coupling and synergy relationship can make the speed of evolution higher than the knowledge growth rate of the subsystem itself.

Self-Organization Approaches for Optimization in Cognitive Radio Networks

Cognitive radio(CR) is regarded as a promising technology for providing a high spectral efficiency to mobile users by using heterogeneous wireless network architectures and dynamic spectrum access techniques.However,cognitive radio networks(CRNs)may also impose some challenges due to the ever increasing complexity of network architecture,the increasing complexity with configuration and management of large-scale networks,fluctuating nature of the available spectrum,diverse Quality-of-Service(QoS)requirements of various applications,and the intensifying difficulties of centralized control,etc.Spectrum management functions with self-organization features can be used to address these challenges and realize this new network paradigm.In this paper,fundamentals of CR,including spectrum sensing,spectrum management,spectrum mobility and spectrum sharing,have been surveyed,with their paradigms of self-organization being emphasized.Variant aspects of selforganization paradigms in CRNs,including critical functionalities of Media Access Control(MAC)- and network-layer operations,are surveyed and compared.Furthermore,new directions and open problems in CRNs are also identified in this survey.

Self-organization of Reconfigurable Protocol Stack for Networked Control Systems

In networked control systems （NCS）,the control performance depends on not only the control algorithm but also the communication protocol stack.The performance degradation introduced by the heterogeneous and dynamic communication environment has intensified the need for the reconfigurable protocol stack.In this paper,a novel architecture for the reconfigurable protocol stack is proposed,which is a unified specification of the protocol components and service interfaces supporting both static and dynamic reconfiguration for existing industrial communication standards.Within the architecture,a triple-level self-organization structure is designed to manage the dynamic reconfiguration procedure based on information exchanges inside and outside the protocol stack.Especially,the protocol stack can be self-adaptive to various environment and system requirements through the reconfiguration of working mode,routing and scheduling table.Finally,the study on the protocol of dynamic address management is conducted for the system of controller area network （CAN）.The results show the efficiency of our self-organizing architecture for the implementation of a reconfigurable protocol stack.

Self-Organizing Genetic Algorithm Based Method for Constructing Bayesian Networks from Databases

The typical characteristic of the topology of Bayesian networks (BNs) is the interdependence among different nodes (variables), which makes it impossible to optimize one variable independently of others, and the learning of BNs structures by general genetic algorithms is liable to converge to local extremum. To resolve efficiently this problem, a self-organizing genetic algorithm (SGA) based method for constructing BNs from databases is presented. This method makes use of a self-organizing mechanism to develop a genetic algorithm that extended the crossover operator from one to two, providing mutual competition between them, even adjusting the numbers of parents in recombination (crossover/recomposition) schemes. With the K2 algorithm, this method also optimizes the genetic operators, and utilizes adequately the domain knowledge. As a result, with this method it is able to find a global optimum of the topology of BNs, avoiding premature convergence to local extremum. The experimental results proved to be and the convergence of the SGA was discussed.

A Self-Organizing RBF Neural Network Based on Distance Concentration Immune Algorithm

Radial basis function neural network(RBFNN) is an effective algorithm in nonlinear system identification. How to properly adjust the structure and parameters of RBFNN is quite challenging. To solve this problem, a distance concentration immune algorithm(DCIA) is proposed to self-organize the structure and parameters of the RBFNN in this paper. First, the distance concentration algorithm, which increases the diversity of antibodies, is used to find the global optimal solution. Secondly,the information processing strength(IPS) algorithm is used to avoid the instability that is caused by the hidden layer with neurons split or deleted randomly. However, to improve the forecasting accuracy and reduce the computation time, a sample with the most frequent occurrence of maximum error is proposed to regulate the parameters of the new neuron. In addition, the convergence proof of a self-organizing RBF neural network based on distance concentration immune algorithm(DCIA-SORBFNN) is applied to guarantee the feasibility of algorithm. Finally, several nonlinear functions are used to validate the effectiveness of the algorithm. Experimental results show that the proposed DCIASORBFNN has achieved better nonlinear approximation ability than that of the art relevant competitors.

Improve Fractal Compression Encoding Speed Using Feature Extraction and Self-organization Network

Image compression consists of two main parts: encoding and decoding. One of the important problems of the fractal theory is the long encoding implementation time, which hindered the acceptance of fractal image compression as a practical method. The long encoding time results from the need to perform a large number of domain-range matches, the total encoding time is the product of the number of matches and the time to perform each match. In order to improve encoding speed, a hybrid method combining features extraction and self-organization network has been provided, which is based on the feature extraction approach the comparison pixels by pixels between the feature of range blocks and domains blocks. The efficiency of the new method was been proved by examples.

The self-organizing worm algorithm

A new multi-modal optimization algorithm called the self-organizing worm algorithm （SOWA） is presented for optimization of multi-modal functions. The main idea of this algorithm can be described as follows： disperse some worms equably in the domain; the worms exchange the information each other and creep toward the nearest high point; at last they will stop on the nearest high point. All peaks of multi-modal function can be found rapidly through studying and chasing among the worms. In contrast with the classical multi-modal optimization algorithms, SOWA is provided with a simple calculation, strong convergence, high precision, and does not need any prior knowledge. Several simulation experiments for SOWA are performed, and the complexity of SOWA is analyzed amply. The results show that SOWA is very effective in optimization of multi-modal functions.

Always-optimally-coordinated candidate selection algorithm for peer-to-peer files sharing system in mobile self-organized networks

In order to improve the performance of peer-to-peer files sharing system under mobile distributed en- vironments, a novel always-optimally-coordinated （AOC） criterion and corresponding candidate selection algorithm are proposed in this paper. Compared with the traditional min-hops criterion, the new approach introduces a fuzzy knowledge combination theory to investigate several important factors that influence files transfer success rate and efficiency. Whereas the min-hops based protocols only ask the nearest candidate peer for desired files, the selection algorithm based on AOC comprehensively considers users＇ preferences and network requirements with flexible balancing rules. Furthermore, its advantage also expresses in the independence of specified resource discovering protocols, allowing for scalability. The simulation results show that when using the AOC based peer selection algorithm, system performance is much better than the rain-hops scheme, with files successful transfer rate improved more than 50% and transfer time re- duced at least 20%.

Self-Organization of Charged Particulates in the Presence of External Force

Evolution of spatial distribution of charged particulates under the action of an external force is investigated. It is found that starting from a homogeneous Maxwellian distribution of particulates, clusters can form and aggregate. The evolution process, as well as the asymptotic number and configuration of the clusters formed, depends strongly on the strength of the external force. The particulates in most of the final clusters are in the crystal state, as can also be deduced from the corresponding velocity and auto-correlation functions.

On the Mechanism of Evolution for Enterprise＇s Sustainable Growth Based on the Theory of Self-organization

The capabilities of industry, technology, institution and market power form the model of four-capability structure for enterprise＇s sustainable growth. The firm＇s system has the characteristics of dissipative structure. The process of the formation for the sustainable growth capability is one of self-organization operations. The evolution and development of sustainable growth capability is the result of inter-functions and inter-operations among all the sub-systems. On the whole, the current level of sustainable growth capability, the four-capability structure and the random rise-and-fall elements of the external environment determine the direction, speed and level of transition of sustainable growth capability. The self-organization mechanism of the enterprise＇s sustainable growth can be illustrated by the instability of system evolution, the sequence parameter, the potential function and the nonequilibrium phase transition. Chinese firms must pay attention to industry selecting and positioning, technology innovation, institution reform and cultivation of market power, and accelerate the formation of self-organization and effective operation through the dynamic integration and inter-operation of industry, technology, institution and market power. Only in this way can firms cultivate and develop their sustainable growth capability and realize enterprises＇ sustainable growth finally.

Weighted Particle Swarm Clustering Algorithm for Self-Organizing Maps

The traditional K-means clustering algorithm is difficult to determine the cluster number,which is sensitive to the initialization of the clustering center and easy to fall into local optimum.This paper proposes a clustering algorithm based on self-organizing mapping network and weight particle swarm optimization SOM&WPSO(Self-Organization Map and Weight Particle Swarm Optimization).Firstly,the algorithm takes the competitive learning mechanism of a self-organizing mapping network to divide the data samples into coarse clusters and obtain the clustering center.Then,the obtained clustering center is used as the initialization parameter of the weight particle swarm optimization algorithm.The particle position of the WPSO algorithm is determined by the traditional clustering center is improved to the sample weight,and the cluster center is the“food”of the particle group.Each particle moves toward the nearest cluster center.Each iteration optimizes the particle position and velocity and uses K-means and K-medoids recalculates cluster centers and cluster partitions until the end of the algorithm convergence iteration.After a lot of experimental analysis on the commonly used UCI data set,this paper not only solves the shortcomings of K-means clustering algorithm,the problem of dependence of the initial clustering center,and improves the accuracy of clustering,but also avoids falling into the local optimum.The algorithm has good global convergence.