Image segmentation algorithm based on high-dimension fuzzy character and restrained clustering network

An image segmentation algorithm of the restrained fuzzy Kohonen clustering network （RFKCN） based on high- dimension fuzzy character is proposed. The algorithm includes two steps. The first step is the fuzzification of pixels in which two redundant images are built by fuzzy mean value and fuzzy median value. The second step is to construct a three-dimensional （3-D） feature vector of redundant images and their original images and cluster the feature vector through RFKCN, to realize image seg- mentation. The proposed algorithm fully takes into account not only gray distribution information of pixels, but also relevant information and fuzzy information among neighboring pixels in constructing 3- D character space. Based on the combination of competitiveness, redundancy and complementary of the information, the proposed algorithm improves the accuracy of clustering. Theoretical anal- yses and experimental results demonstrate that the proposed algorithm has a good segmentation performance.

Network Traffic Clustering with QoS-Awareness

Network traffic classification is essential in supporting network measurement and management.Many existing traffic classification approaches provide application-level results regardless of the network quality of service(QoS)requirements.In practice,traffic flows from the same application may have irregular network behaviors that should be identified to various QoS classes for best network resource management.To address the issues,we propose to conduct traffic classification with two newly defined QoSaware features,i.e.,inter-APP similarity and intraAPP diversity.The inter-APP similarity represents the close QoS association between the traffic flows that originate from the different Internet applications.The intra-APP diversity describes the QoS variety of the traffic even among those originated from the same Internet application.The core of performing the QoS-aware feature extraction is a Long-Short Term Memory neural network based Autoencoder(LSTMAE).The QoS-aware features extracted by the encoder part of the LSTM-AE are then clustered into the corresponding QoS classes.Real-life data from multiple applications are collected to evaluate the proposed QoS-aware network traffic classification approach.The evaluation results demonstrate the efficacy of the extracted QoS-aware features in supporting the traffic classification,which can further contribute to future network measurement and management.

Optimal Energy Efficiency Resource Allocation Strategy for Cognitive Clustering Network under PUEA Attack

5G has pushed the use of radio spectrum to a new level,and cognitive clustering network can effectively improve the utilization of radio spectrum,which is a feasible way to solve the growing demand for wireless communications.However,cognitive clustering network is vulnerable to PUEA attack,which will lead to the degradation of system detection performance,thereby reducing the energy efficiency.Aiming at these problems,this paper investigates the optimal energy efficiency resource allocation scheme for cognitive clustering network under PUEA attack.A cooperative user selection algorithm based on selection factor is proposed to effectively resist PUEA user attack and improve detection performance.We construct the energy efficiency optimization problem under multi-constraint conditions and transform the nonlinear programming problem into parametric programming problem,which is solved by Lagrangian function and Karush-Kuhn-Tucker condition.Then the sub-gradient iterative algorithm based on optimal energy efficiency under PUEA attack is proposed and its complexity is analyzed.Simulation results indicate that proposed method is effective when subjected to PUEA attacks,and the impact of different parameters on energy efficiency is analyzed.

Exact Solution for Clustering Coefficient of Random Apollonian Networks

By means of the series method, we obtain the exact analytical solution of clustering coefficient in random Apollonian networks [Phys. Rev. E 71 （2005）046141]. Our exact analytical result is identical with the simulation, whereas in the original work, there is a deviation of about 4% between their approximate analytical result and the simulation.

Blockchain-Based Data Acquisition with Privacy Protection in UAV Cluster Network

The unmanned aerial vehicle(UAV)self-organizing network is composed of multiple UAVs with autonomous capabilities according to a certain structure and scale,which can quickly and accurately complete complex tasks such as path planning,situational awareness,and information transmission.Due to the openness of the network,the UAV cluster is more vulnerable to passive eavesdropping,active interference,and other attacks,which makes the system face serious security threats.This paper proposes a Blockchain-Based Data Acquisition(BDA)scheme with privacy protection to address the data privacy and identity authentication problems in the UAV-assisted data acquisition scenario.Each UAV cluster has an aggregate unmanned aerial vehicle(AGV)that can batch-verify the acquisition reports within its administrative domain.After successful verification,AGV adds its signcrypted ciphertext to the aggregation and uploads it to the blockchain for storage.There are two chains in the blockchain that store the public key information of registered entities and the aggregated reports,respectively.The security analysis shows that theBDAconstruction can protect the privacy and authenticity of acquisition data,and effectively resist a malicious key generation center and the public-key substitution attack.It also provides unforgeability to acquisition reports under the Elliptic Curve Discrete Logarithm Problem(ECDLP)assumption.The performance analysis demonstrates that compared with other schemes,the proposed BDA construction has lower computational complexity and is more suitable for the UAV cluster network with limited computing power and storage capacity.

A Power Efficient Aggregation of Encrypted Data in Wireless Sensor Network

In-network data aggregation in wireless sensor network has been shown to improve scalability, prolong sensor network lifetimes and diminish computational demands. However, the node that plays the role of data aggregation will consume much more energy than common nodes and may quit the mission in advance due to energy exhausting because of taxing decryption and re-encryption operation; moreover, it will bring complex key management to ensure the security of the data and corresponding keys. This paper was designed specifically to address above problem based on the thought of privacy homomorphism, It can achieve the perfect security level equal to one-time pad with much lower energy consumption; moreover, it can be proved to resist the attack of node capture. Using the simulation and analysis, we show that our scheme consume the energy only about 21% of AED scheme.

Distributed Satellite Cluster Network:a Survey

The ability of the monolithic satellite,satellite orbit(especially GEO),and radio resource are very limited,so the development of distributed satellite cluster network(DSCN) receives more and more worldwide attention.In this paper,DSCN is surveyed and the study status of DSCN architecture design is summarized.The formation flying of spacecrafts,reconfiguration,networking,and applied research on distributed satellite spacecraft are described in detail.The DSCN will provide a great technology innovation for space information network,satellite communications,satellite navigation,deep space exploration,and space remote sensing.In addition,this paper points out future trends of the DSCN development.

Effects of internal noise on the spiking regularity of a clustered Hodgkin–Huxley neuronal network

Spiking regularity in a clustered Hodgkin–Huxley（HH） neuronal network has been studied in this letter. A stochastic HH neuronal model with channel blocks has been applied as local neuronal model. Effects of the internal channel noise on the spiking regularity are discussed by changing the membrane patch size. We find that when there is no channel blocks in potassium channels, there exist some intermediate membrane patch sizes at which the spiking regularity could reach to a higher level. Spiking regularity increases with the membrane patch size when sodium channels are not blocked. Namely, depending on different channel blocking states, internal channel noise tuned by membrane patch size could have different influence on the spiking regularity of neuronal networks.

Reliability Evaluation of Mobile Communication Networks

A new reliability evaluation measure, global clustering reliability (GCR), is proposed. Firstly, the common measures used in invulnerability and survivability evaluation of mobile communication networks are discussed, and the shortcomings of these measures are pointed out. Then a new reliability evaluation measure, GCR, which is applicable to mobile communication networks, is proposed. And some properties and theorem about this measure are put forward. Finally, simulation calculation of reliability evaluation that uses this measure to 12 kinds of topological networks is accomplished. And the comparison between this measure and link connected factor (LCF) measure is also given. The results proved that the design of GCR is reasonable, its computation is rapid, moreover, it can take into account of invalidation of both nodes and links, and it has good physical meanings

Four Types of Percolation Transitions in the Cluster Aggregation Network Model

We study the percolation transition in a one-species cluster aggregation network model, in which the parameter α describes the suppression on the cluster sizes. It is found that the model can exhibit four types of percolation transitions, two continuous percolation transitions and two discontinuous ones. Continuous and discontinuous percolation transitions can be distinguished from each other by the largest single jump. Two types of continuous percolation transitions show different behaviors in the time gap. Two types of discontinuous percolation transitions are different in the time evolution of the cluster size distribution. Moreover, we also find that the time gap may also be a measure to distinguish different discontinuous percolations in this model.

Storage Assignment Optimization in a Multi-tier Shuttle Warehousing System

The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem（TSP）,which has been widely applied in the conventional automated storage and retrieval system（AS/RS）.However,the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems（MSWS） because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP.In this study,a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period（SWP） and lift idle period（LIP） during transaction cycle time.A mean arrival time difference matrix for pairwise stock keeping units（SKUs） is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation.The decomposition method is applied to analyze the interactions among outbound task time,SWP,and LIP.The ant colony clustering algorithm is designed to determine storage partitions using clustering items.In addition,goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane.This combination is derived based on the analysis results of the queuing network model and on three basic principles.The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry.The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center.

Joint Design of Clustering and In-cluster Data Route for Heterogeneous Wireless Sensor Networks

A heterogeneous wireless sensor network comprises a number of inexpensive energy constrained wireless sensor nodes which collect data from the sensing environment and transmit them toward the improved cluster head in a coordinated way. Employing clustering techniques in such networks can achieve balanced energy consumption of member nodes and prolong the network lifetimes.In classical clustering techniques, clustering and in-cluster data routes are usually separated into independent operations. Although separate considerations of these two issues simplify the system design, it is often the non-optimal lifetime expectancy for wireless sensor networks. This paper proposes an integral framework that integrates these two correlated items in an interactive entirety. For that,we develop the clustering problems using nonlinear programming. Evolution process of clustering is provided in simulations. Results show that our joint-design proposal reaches the near optimal match between member nodes and cluster heads.

Realistic Efficiency Evaluations for Parallel Computations under Workstation Cluster

In recent years, high performance scientific computing under workstation cluster connected by local area network is becoming a hot point. Owing to both the longer latency and the higher overhead for protocol processing compared with the powerful single workstation capacity, it is becoming severe important to keep balance not only for numerical load but also for communication load, and to overlap communications with computations while parallel computing. Hence,our efficiency evaluation rules must discover these capacities of a given parallel algorithm in order to optimize the existed algorithm to attain its highest parallel efficiency. The traditional efficiency evaluation rules can not succeed in this work any more. Fortunately, thanks to Culler's detail discuss in LogP model about interconnection networks for MPP systems, we present a system of efficiency evaluation rules for parallel computations under workstation cluster with PVM3.0 parallel software framework in this paper. These rules can satisfy above acquirements successfully. At last, two typical synchronous,and asynchronous applications are designed to verify the validity of these rules under 4 SGIs workstations cluster connected by Ethernet.

Optimization of satellite searching strategy of the non-stationary antenna

The tiny searching step length and the satellite distribution density are the major factors to influence the efficiency of the satellite finder,so a scientific and reasonable method to calculate the tiny searching step length is proposed to optimize the satellite searching strategy. The pattern clustering and BP neural network are applied to optimize the tiny searching step length. The calculated tiny searching step length is approximately equal to the theoretic value for each satellite. In application,the satellite searching results will be dynamically added to the training samples to re-train the network to improve the generalizability and the precision. Experiments validate that the optimization of the tiny searching step length can avoid the error of locating target satellite and improve the searching efficiency.

Phytochemical interventions for post-traumatic stress disorder:A cluster co-occurrence network analysis using CiteSpace

Objective:This study investigated trends in the study of phytochemical treatment of post-traumatic stress disorder(PTSD).Methods:The Web of Science database(2007-2022)was searched using the search terms“phytochemicals”and“PTSD,”and relevant literature was compiled.Network clustering co-occurrence analysis and qualitative narrative review were conducted.Results:Three hundred and one articles were included in the analysis of published research,which has surged since 2015 with nearly half of all relevant articles coming from North America.The category is dominated by neuroscience and neurology,with two journals,Addictive Behaviors and Drug and Alcohol Dependence,publishing the greatest number of papers on these topics.Most studies focused on psychedelic intervention for PTSD.Three timelines show an“ebb and flow”phenomenon between“substance use/marijuana abuse”and“psychedelic medicine/medicinal cannabis.”Other phytochemicals account for a small proportion of the research and focus on topics like neurosteroid turnover,serotonin levels,and brain-derived neurotrophic factor expression.Conclusion:Research on phytochemicals and PTSD is unevenly distributed across countries/regions,disciplines,and journals.Since 2015,the research paradigm shifted to constitute the mainstream of psychedelic research thus far,leading to the exploration of botanical active ingredients and molecular mechanisms.Other studies focus on anti-oxidative stress and anti-inflammation.

Security and performance evaluation of master node protocol based reputation blockchain in the bitcoin network

Bitcoin is a digital currency based on a peer-to-peer network to propagate and verify transactions.Bitcoin is gaining wider adoption than any previous crypto-currency.However,the mechanism of peers randomly choosing logical neighbours without any knowledge about the underlying physical topology can cause a delay overhead in information propagation which makes the system vulnerable to double spend attacks.Aiming at alleviating the propagation delay problem,this paper introduces a proximity-aware extension to the current Bitcoin protocol,named Master Node Based Clustering(MNBC).The ultimate purpose of the proposed protocol,which is based on how clusters are formulated and how nodes can define their membership,is to improve the information propagation delay in the Bitcoin network.In the MNBC protocol,physical internet connectivity increases as well as the number of hops between nodes decreases through assigning nodes to be responsible for maintaining clusters based on physical Internet proximity.Furthermore,a reputation-based blockchain protocol is integrated with MNBC protocol in order to securely assign a master node for every cluster.We validate our proposed methods through a set of simulation experiments and the findings show how the proposed methods run and their impact in optimising the transaction propagation delay.

Meta-Path-Based Search and Mining in Heterogeneous Information Networks

Information networks that can be extracted from many domains are widely studied recently. Different functions for mining these networks are proposed and developed, such as ranking, community detection, and link prediction. Most existing network studies are on homogeneous networks, where nodes and links are assumed from one single type. In reality, however, heterogeneous information networks can better model the real-world systems, which are typically semi-structured and typed, following a network schema. In order to mine these heterogeneous information networks directly, we propose to explore the meta structure of the information network, i.e., the network schema. The concepts of meta-paths are proposed to systematically capture numerous semantic relationships across multiple types of objects, which are defined as a path over the graph of network schema. Meta-paths can provide guidance for search and mining of the network and help analyze and understand the semantic meaning of the objects and relations in the network. Under this framework, similarity search and other mining tasks such as relationship prediction and clustering can be addressed by systematic exploration of the network meta structure. Moreover, with user＇s guidance or feedback, we can select the best meta-path or their weighted combination for a specific mining task.

Fast Community Detection Based on Distance Dynamics

The distance dynamics model is excellent tool for uncovering the community structure of a complex network. However, one issue that must be addressed by this model is its very long computation time in large-scale networks. To identify the community structure of a large-scale network with high speed and high quality, in this paper, we propose a fast community detection algorithm, the F-Attractor, which is based on the distance dynamics model. The main contributions of the F-Attractor are as follows. First, we propose the use of two prejudgment rules from two different perspectives： node and edge. Based on these two rules, we develop a strategy of internal edge prejudgment for predicting the internal edges of the network. Internal edge prejudgment can reduce the number of edges and their neighbors that participate in the distance dynamics model. Second, we introduce a triangle distance to further enhance the speed of the interaction process in the distance dynamics model. This triangle distance uses two known distances to measure a third distance without any extra computation. We combine the above techniques to improve the distance dynamics model and then describe the community detection process of the F-Attractor. The results of an extensive series of experiments demonstrate that the F-Attractor offers high-speed community detection and high partition quality.

Applied Fault Detection and Diagnosis for Industrial Gas Turbine Systems

The paper presents readily implementable approaches for fault detection and diagnosis （FDD） based on measurements from multiple sensor groups, for industrial systems. Specifically, the use of hierarchical clustering （HC） and self-organizing map neural networks （SOMNNs） are shown to provide robust and user-friendly tools for application to industrial gas turbine （IGT） systems. HC fingerprints are found for normal operation, and FDD is achieved by monitoring cluster changes occurring in the resulting dendrograms. Similarly, fingerprints of operational behaviour are also obtained using SOMNN based classification maps （CMs） that are initially determined during normal operation, and FDD is performed by detecting changes in their CMs. The proposed methods are shown to be capable of FDD from a large group of sensors that measure a variety of physical quantities. A key feature of the paper is the development of techniques to accommodate transient system operation, which can often lead to false-alarms being triggered when using traditional techniques if the monitoring algorithms are not first desensitized. Case studies showing the efficacy of the techniques for detecting sensor faults, bearing tilt pad wear and early stage pre-chamber burnout, are included. The presented techniques are now being applied operationally and monitoring IGTs in various regions of the world.

Distributed Algorithms for Event Reporting in Mobile-Sink WSNs for Internet of Things

Wireless Sensor Networks（WSNs） have many applications, such as climate monitoring systems, fire detection, smart homes, and smart cities. It is expected that WSNs will be integrated into the Internet of Things（IoT）and participate in various tasks. WSNs play an important role monitoring and reporting environment information and collecting surrounding context. In this paper we consider a WSN deployed for an application such as environment monitoring, and a mobile sink which acts as the gateway between the Internet and the WSN. Data gathering is a challenging problem in WSNs and in the IoT because the information has to be available quickly and effectively without delays and redundancies. In this paper we propose several distributed algorithms for composite event detection and reporting to a mobile sink. Once data is collected by the sink, it can be shared using the IoT infrastructure. We analyze the performance of our algorithms using WSNet simulator, which is specially designed for event-based WSNs. We measure various metrics such as average residual energy, percentage of composite events processed successfully at the sink, and the average number of hops to reach the sink.