A Large-Scale Group Decision Making Model Based on Trust Relationship and Social Network Updating

With the development of big data and social computing,large-scale group decisionmaking(LGDM)is nowmerging with social networks.Using social network analysis(SNA),this study proposes an LGDM consensus model that considers the trust relationship among decisionmakers(DMs).In the process of consensusmeasurement:the social network is constructed according to the social relationship among DMs,and the Louvain method is introduced to classify social networks to form subgroups.In this study,the weights of each decision maker and each subgroup are computed by comprehensive network weights and trust weights.In the process of consensus improvement:A feedback mechanism with four identification and two direction rules is designed to guide the consensus of the improvement process.Based on the trust relationship among DMs,the preferences are modified,and the corresponding social network is updated to accelerate the consensus.Compared with the previous research,the proposedmodel not only allows the subgroups to be reconstructed and updated during the adjustment process,but also improves the accuracy of the adjustment by the feedbackmechanism.Finally,an example analysis is conducted to verify the effectiveness and flexibility of the proposed method.Moreover,compared with previous studies,the superiority of the proposed method in solving the LGDM problem is highlighted.

The enlightenment of artificial intelligence large-scale model on the research of intelligent eye diagnosis in traditional Chinese medicine

Eye diagnosis is a method for inspecting systemic diseases and syndromes by observing the eyes.With the development of intelligent diagnosis in traditional Chinese medicine(TCM);artificial intelligence(AI)can improve the accuracy and efficiency of eye diagnosis.However;the research on intelligent eye diagnosis still faces many challenges;including the lack of standardized and precisely labeled data;multi-modal information analysis;and artificial in-telligence models for syndrome differentiation.The widespread application of AI models in medicine provides new insights and opportunities for the research of eye diagnosis intelli-gence.This study elaborates on the three key technologies of AI models in the intelligent ap-plication of TCM eye diagnosis;and explores the implications for the research of eye diagno-sis intelligence.First;a database concerning eye diagnosis was established based on self-su-pervised learning so as to solve the issues related to the lack of standardized and precisely la-beled data.Next;the cross-modal understanding and generation of deep neural network models to address the problem of lacking multi-modal information analysis.Last;the build-ing of data-driven models for eye diagnosis to tackle the issue of the absence of syndrome dif-ferentiation models.In summary;research on intelligent eye diagnosis has great potential to be applied the surge of AI model applications.

Long Short-Term Memory Recurrent Neural Network-Based Acoustic Model Using Connectionist Temporal Classification on a Large-Scale Training Corpus

A Long Short-Term Memory(LSTM) Recurrent Neural Network(RNN) has driven tremendous improvements on an acoustic model based on Gaussian Mixture Model(GMM). However, these models based on a hybrid method require a forced aligned Hidden Markov Model(HMM) state sequence obtained from the GMM-based acoustic model. Therefore, it requires a long computation time for training both the GMM-based acoustic model and a deep learning-based acoustic model. In order to solve this problem, an acoustic model using CTC algorithm is proposed. CTC algorithm does not require the GMM-based acoustic model because it does not use the forced aligned HMM state sequence. However, previous works on a LSTM RNN-based acoustic model using CTC used a small-scale training corpus. In this paper, the LSTM RNN-based acoustic model using CTC is trained on a large-scale training corpus and its performance is evaluated. The implemented acoustic model has a performance of 6.18% and 15.01% in terms of Word Error Rate(WER) for clean speech and noisy speech, respectively. This is similar to a performance of the acoustic model based on the hybrid method.

A Game-Theoretic Perspective on Resource Management for Large-Scale UAV Communication Networks

As a result of rapid development in electronics and communication technology,large-scale unmanned aerial vehicles(UAVs)are harnessed for various promising applications in a coordinated manner.Although it poses numerous advantages,resource management among various domains in large-scale UAV communication networks is the key challenge to be solved urgently.Specifically,due to the inherent requirements and future development trend,distributed resource management is suitable.In this article,we investigate the resource management problem for large-scale UAV communication networks from game-theoretic perspective which are exactly coincident with the distributed and autonomous manner.By exploring the inherent features,the distinctive challenges are discussed.Then,we explore several gametheoretic models that not only combat the challenges but also have broad application prospects.We provide the basics of each game-theoretic model and discuss the potential applications for resource management in large-scale UAV communication networks.Specifically,mean-field game,graphical game,Stackelberg game,coalition game and potential game are included.After that,we propose two innovative case studies to highlight the feasibility of such novel game-theoretic models.Finally,we give some future research directions to shed light on future opportunities and applications.

SCSMRD: A database for single-cell skeletal muscle regeneration

Skeletal muscle regeneration is a complex process where various cell types and cytokines are involved.Single-cell RNA-sequencing (scRNA-seq) provides the opportunity to deconvolute heterogeneous tissue into individual cells based on their transcriptomic profiles.Recent scRNA-seq studies on mouse muscle regeneration have provided insights to understand the transcriptional dynamics that underpin muscle regeneration.However,a database to investigate gene expression profiling during skeletal muscle regeneration at the single-cell level is lacking.Here,we collected over 105 000 cells at 7 key regenerative time-points and non-injured muscles and developed a database,the Singlecell Skeletal Muscle Regeneration Database (SCSMRD).SCSMRD allows users to search the dynamic expression profiles of genes of interest across different cell types during the skeletal muscle regeneration process.It also provides a network to show the activity of regulons in different cell types at different time points.Pesudotime analysis showed the state changes trajectory of muscle stem cells (MuSCs) during skeletal muscle regeneration.This database is freely available at https://scsmrd.fengs-lab.com.

Efficient Routing Protection Algorithm in Large-Scale Networks

With an increasing urgent demand for fast recovery routing mechanisms in large-scale networks,minimizing network disruption caused by network failure has become critical.However,a large number of relevant studies have shown that network failures occur on the Internet inevitably and frequently.The current routing protocols deployed on the Internet adopt the reconvergence mechanism to cope with network failures.During the reconvergence process,the packets may be lost because of inconsistent routing information,which reduces the network’s availability greatly and affects the Internet service provider’s(ISP’s)service quality and reputation seriously.Therefore,improving network availability has become an urgent problem.As such,the Internet Engineering Task Force suggests the use of downstream path criterion(DC)to address all single-link failure scenarios.However,existing methods for implementing DC schemes are time consuming,require a large amount of router CPU resources,and may deteriorate router capability.Thus,the computation overhead introduced by existing DC schemes is significant,especially in large-scale networks.Therefore,this study proposes an efficient intra-domain routing protection algorithm(ERPA)in large-scale networks.Theoretical analysis indicates that the time complexity of ERPA is less than that of constructing a shortest path tree.Experimental results show that ERPA can reduce the computation overhead significantly compared with the existing algorithms while offering the same network availability as DC.

Robust Virtual Network Embedding Based on Component Connectivity in Large-Scale Network

Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization. Compared with other studies which focus on designing heuristic algorithms to reduce the hardness of the NP-hard problem we propose a robust VNE algorithm based on component connectivity in large-scale network. We distinguish the different components and embed VN requests onto them respectively. And k-core is applied to identify different VN topologies so that the VN request can be embedded onto its corresponding component. On the other hand, load balancing is also considered in this paper. It could avoid blocked or bottlenecked area of substrate network. Simulation experiments show that compared with other algorithms in large-scale network, acceptance ratio, average revenue and robustness can be obviously improved by our algorithm and average cost can be reduced. It also shows the relationship between the component connectivity including giant component and small components and the performance metrics.

Sewage flow optimization algorithm for large-scale urban sewer networks based on network community division

By considering the flow control of urban sewer networks to minimize the electricity consumption of pumping stations, a decomposition-coordination strategy for energy savings based on network community division is developed in this paper. A mathematical model characterizing the steady-state flow of urban sewer networks is first constructed, consisting of a set of algebraic equations with the structure transportation capacities captured as constraints. Since the sewer networks have no apparent natural hierarchical structure in general, it is very difficult to identify the clustered groups. A fast network division approach through calculating the betweenness of each edge is successfully applied to identify the groups and a sewer network with arbitrary configuration could be then decomposed into subnetworks. By integrating the coupling constraints of the subnetworks, the original problem is separated into N optimization subproblems in accordance with the network decomposition. Each subproblem is solved locally and the solutions to the subproblems are coordinated to form an appropriate global solution. Finally, an application to a specified large-scale sewer network is also investigated to demonstrate the validity of the proposed algorithm.

Spanning tree-based algorithm for hydraulic simulation of large-scale water supply networks

With the purpose of making calculation more efficient in practical hydraulic simulations, an improved algorithm was proposed and was applied in the practical water distribution field. This methodology was developed by expanding the traditional loop-equation theory through utilization of the advantages of the graph theory in efficiency. The utilization of the spanning tree technique from graph theory makes the proposed algorithm efficient in calculation and simple to use for computer coding. The algorithms for topological generation and practical implementations are presented in detail in this paper. Through the application to a practical urban system, the consumption of the CPU time and computation memory were decreased while the accuracy was greatly enhanced compared with the present existing methods.

Baseline Isolated Printed Text Image Database for Pashto Script Recognition

The optical character recognition for the right to left and cursive languages such as Arabic is challenging and received little attention from researchers in the past compared to the other Latin languages.Moreover,the absence of a standard publicly available dataset for several low-resource lan-guages,including the Pashto language remained a hurdle in the advancement of language processing.Realizing that,a clean dataset is the fundamental and core requirement of character recognition,this research begins with dataset generation and aims at a system capable of complete language understanding.Keeping in view the complete and full autonomous recognition of the cursive Pashto script.The first achievement of this research is a clean and standard dataset for the isolated characters of the Pashto script.In this paper,a database of isolated Pashto characters for forty four alphabets using various font styles has been introduced.In order to overcome the font style shortage,the graphical software Inkscape has been used to generate sufficient image data samples for each character.The dataset has been pre-processed and reduced in dimensions to 32×32 pixels,and further converted into the binary format with a black background and white text so that it resembles the Modified National Institute of Standards and Technology(MNIST)database.The benchmark database is publicly available for further research on the standard GitHub and Kaggle database servers both in pixel and Comma Separated Values(CSV)formats.

A Privacy Preservation Method for Attributed Social Network Based on Negative Representation of Information

Due to the presence of a large amount of personal sensitive information in social networks,privacy preservation issues in social networks have attracted the attention of many scholars.Inspired by the self-nonself discrimination paradigmin the biological immune system,the negative representation of information indicates features such as simplicity and efficiency,which is very suitable for preserving social network privacy.Therefore,we suggest a method to preserve the topology privacy and node attribute privacy of attribute social networks,called AttNetNRI.Specifically,a negative survey-based method is developed to disturb the relationship between nodes in the social network so that the topology structure can be kept private.Moreover,a negative database-based method is proposed to hide node attributes,so that the privacy of node attributes can be preserved while supporting the similarity estimation between different node attributes,which is crucial to the analysis of social networks.To evaluate the performance of the AttNetNRI,empirical studies have been conducted on various attribute social networks and compared with several state-of-the-art methods tailored to preserve the privacy of social networks.The experimental results show the superiority of the developed method in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topology disturbing and attribute hiding parts.The experimental results show the superiority of the developed methods in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topological interference and attribute-hiding components.

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.

Intelligent Networking Technology and Experimental Demonstration of Large-Scale Heterogeneous Optical Networks

A novel routing architecture named DREAMSCAPE is presented to solve the problem of path computation in multi-layer, multi-domain and multi-constraints scenarios, which includes Group Engine (GE) and Unit Engine (UE). GE, UE and their cooperation relationship form the main feature of DREAMSCAPE, i.e. Dual Routing Engine (DRE). Based on DRE, two routing schemes are proposed, which are DRE Forward Path Computation (DRE-FPC) and Hierarchical DRE Backward Recursive PCE-based Computation (HDRE-BRPC). In order to validate various intelligent networking technologies of large-scale heterogeneous optical networks, a DRE-based transport optical networks testbed is built with 1000 GMPLS-based control nodes and 5 optical transport nodes. The two proposed routing schemes, i.e. DRE-FPC and HDRE-BRPC, are validated on the testbed, compared with traditional Hierarchical Routing (HR) scheme. Experimental results show a good performance of DREAMSCAPE.

A Summary of the Large-Scale Access Convergence Network Structure

Under the requirement of everything over IP, network service shows the following characteristics:(1) network service increases its richness;(2) broadband streaming media becomes the mainstream. To achieve unified multi-service bearing in the IP network, the largescale access convergence network architecture is proposed. This flat access convergence structure with ultra-small hops, which shortens the service transmission path, reduces the complexity of the edge of the network, and achieves IP strong waist model with the integration of computation, storage and transmission. The key technologies are also introduced in this paper, including endto-end performance guarantee for real time interactive services, fog storing mechanism, and built-in safety transmission with integration of aggregation and control.

An Adaptive Sliding Mode Tracking Controller Using BP Neural Networks for a Class of Large-scale Nonlinear Systems

A new type controller, BP neural-networks-based sliding mode controller is developed for a class of large-scale nonlinear systems with unknown bounds of high-order interconnections in this paper. It is shown that decentralized BP neural networks are used to adaptively learn the uncertainty bounds of interconnected subsystems in the Lyapunov sense, and the outputs of the decentralized BP neural networks are then used as the parameters of the sliding mode controller to compensate for the effects of subsystems uncertainties. Using this scheme, not only strong robustness with respect to uncertainty dynamics and nonlinearities can be obtained, but also the output tracking error between the actual output of each subsystem and the corresponding desired reference output can asymptotically converge to zero. A simulation example is presented to support the validity of the proposed BP neural-networks-based sliding mode controller.

Network Analysis Modeling Towards GIS Based on Object-Relation Database

This paper compares the differences between the mathematical model in graph theory and GIS network analysis model. Thus it claims that the GIS network analysis model needs to solve. Then this paper introduces the spatial data management methods in object\|relation database for GIS and discusses its effects on the network analysis model. Finally it puts forward the GIS network analysis model based on the object\|relation database. The structure of the model is introduced in detail and research is done to the internal and external memory data structure of the model. The results show that it performs well in practice.

Design of High Precision Horizontal Control Network for Large-Scale Hydropower Project

A new solution of combination network of GPS and high precise distance measurements with EDM is proposed. Meanwhile, it’s inadvisable only using GPS network without distance measurements. Three schemes: terrestrial network, GPS network and combination network are discussed for horizontal control network design of Xiangjiaba Dam in view of precision, reliability, coordinate and outlay in detail.

ROBUST SLIDING MODE DECENTRALIZED CONTROL FOR A CLASS OF NONLINEAR INTERCONNECTED LARGE-SCALE SYSTEM WITH NEURAL NETWORKS

A new decentralized robust control method is discussed for a class of nonlinear interconnected largescale system with unknown bounded disturbance and unknown nonlinear function term. A decentralized control law is proposed which combines the approximation method of neural network with sliding mode control. The decentralized controller consists of an equivalent controller and an adaptive sliding mode controller. The sliding mode controller is a robust controller used to reduce the track error of the control system. The neural networks are used to approximate the unknown nonlinear functions, meanwhile the approximation errors of the neural networks are applied to the weight value updated law to improve performance of the system. Finally, an example demonstrates the availability of the decentralized control method.

Energy-Efficient Routing Algorithm Based on Multipath Routing in Large-Scale Networks

A reduction in network energy consumption and the establishment of green networks have become key scientific problems in academic and industrial research.Existing energy efficiency schemes are based on a known traffic matrix,and acquiring a real-time traffic matrix in current complex networks is difficult.Therefore,this research investigates how to reduce network energy consumption without a real-time traffic matrix.In particular,this paper proposes an intra-domain energy-efficient routing scheme based on multipath routing.It analyzes the relationship between routing availability and energy-efficient routing and integrates the two mechanisms to satisfy the requirements of availability and energy efficiency.The main research focus is as follows:(1)A link criticality model is evaluated to quantitatively measure the importance of links in a network.(2)On the basis of the link criticality model,this paper analyzes an energy-efficient routing technology based on multipath routing to achieve the goals of availability and energy efficiency simultaneously.(3)An energy-efficient routing algorithm based on multipath routing in large-scale networks is proposed.(4)The proposed method does not require a real-time traffic matrix in the network and is thus easy to apply in practice.(5)The proposed algorithm is verified in several network topologies.Experimental results show that the algorithm can not only reduce network energy consumption but can also ensure routing availability.

Active Queue Management within Large-Scale Wired Networks

Signal transmission control protocol sources with the objective of managing queue utilization and delay is actually a feedback control problem in active queue management (AQM) core routers. This paper extends AQM control design for single network systems to large-scale wired network systems with time delays at each communication channel. A system model consisted of several local networks is first constructed. The stability condition guaranteeing overall stability is subsequently derived using Lyapunov stability theory. The results developed have been successfully verified on a network simulator.