基于关键闸坝优选的区域水网水量调控

为实现区域水网水量的高效调控,从水量、水生态、水质和闸坝管理等4个方面构建包含10个指标的闸坝优选评价指标体系,以廊坊市凤河-永定河区域水网为研究对象,计算区域内32座闸坝的综合关键指数并给出影响程度排序,采用水动力数学模型验证关键闸坝选取的合理性。结果表明：优选出的永丰闸和东张务闸是区域水网的关键闸坝,通过调节这两座闸坝的开度即可满足区域水网的生态需水和防洪排涝调度目标,保持区域水网较优的水力连通能力,提高区域水网水量调控效率。     

LPNet: A DNN based latency prediction technique for application mapping in Network-on-Chip design

Analytical models used for latency estimation of Network-on-Chip (NoC) are not producing reliable accuracy. This makes these analytical models difficult to use in optimization of design space exploration. In this paper, we propose a learning based model using deep neural network (DNN) for latency predictions. Input features for DNN model are collected from analytical model as well as from Booksim simulator. Then this DNN model has been adopted in mapping optimization loop for predicting the best mapping of given application and NoC parameters combination. Our simulations show that using the proposed DNN model, prediction error is less than 12% for both synthetic and application specific traffic. More than 108 times speedup could be achieved using DPSO with DNN model compared to DPSO using Booksim simulator.     

Bayesian network based general correspondence retrieval method for depth sensing with single-shot structured light

This study reinvestigated one of the most fundamental problems in structure light depth sensing field: correspondence retrieval of features between patterns and images. We formulate the global optimum correspondence retrieval by maximizing a conditional probability of correspondence given observed features, which is depicted by a Bayesian network. Different from traditional “code-only” based correspondence retrieval methods, the proposed Bayesian network based method exploits the positional correlations of correspondences of neighboring features, namely, the correspondences of poorly detected features are estimated with the aid of the correspondences of well detected features. The method performs especially well on challenging scenes with rich depth variations, abrupt depth changes, edges, etc. Experiments show that the proposed method increase the correspondence accuracy by about 40% on challenging scenes, compared with traditional “code-only” based correspondence retrieval methods.     

Analysis of oceanaut operating performance using an integrated Bayesian network aided by the fuzzy logic theory

Because the oceanaut plays a significant role in safety and capability during manned deep-diving scientific tasks, preventing oceanaut performance decline is of paramount importance. However, the factors responsible for oceanaut performance are almost entirely unexplored. To address the preceding issues, a quantitative method of fuzzy integrated Bayesian network (FIBN) was modeled within the limits of oceanaut operating procedures. To quantify the probabilities of the influencing factors, the probability of each node in the FIBN was calculated using integrated expert judgement, fuzzy logic theory, and Bayesian network. By considering a total of 28 factors related to oceanaut performance in the “Jiaolong” manned submersible, this study found that difficult sampling, long sampling times, cabin equipment failure, oceanaut physical decline, and declining decision-making ability are important factors that affect oceanaut performance. The FIBN proposed in our study fused the qualitative and quantitative methods and can be developed into a versatile tool for analysis of comprehensive systems that contain both static and dynamic factors.Relevance to industryThe results provide a powerful basis for the design of manned submersible and assignment of tasks to oceanauts, while the fuzzy integrated Bayesian network (FIBN) method proposed can be effectively applied to various quantitative assessment fields which direct researchers to deal with analysis problems of complex systems.     

Authority updating: An expert authority evaluation algorithm considering post‐evaluation and power indices in social networks

In group assessment, the focus is on finding high‐authority experts to improve the reliability of assessment results. In this study, we propose an authority updating algorithm while considering the power and judgement reliability of an expert on the basis of social networks and post‐evaluations. A network power index is established and used to reflect the power of an expert while considering social networks. The measurement of the judgement reliability of an expert considers the post‐evaluation of the objects selected by experts, thereby more scientifically reflecting the reliability of experts. The analysis shows the following: although the social‐network structure influences the authority of experts, the influence weakens when the assessment group is a highly or even fully connected group; the network effect may increase the authority of some experts and reduce that of others, and it will weaken as the network connectivity increases; moreover, the judgement reliability and authority of an expert while considering post‐evaluation can encourage him/her to make fair assessments and strive to reduce his/her motivation and cognitive biases.     

CoGCN: Combining co‐attention with graph convolutional network for entity linking with knowledge graphs

Entity linking is a fundamental task in natural language processing. The task of entity linking with knowledge graphs aims at linking mentions in text to their correct entities in a knowledge graph like DBpedia or YAGO2. Most of existing methods rely on hand‐designed features to model the contexts of mentions and entities, which are sparse and hard to calibrate. In this paper, we present a neural model that first combines co‐attention mechanism with graph convolutional network for entity linking with knowledge graphs, which extracts features of mentions and entities from their contexts automatically. Specifically, given the context of a mention and one of its candidate entities' context, we introduce the co‐attention mechanism to learn the relatedness between the mention context and the candidate entity context, and build the mention representation in consideration of such relatedness. Moreover, we propose a context‐aware graph convolutional network for entity representation, which takes both the graph structure of the candidate entity and its relatedness with the mention context into consideration. Experimental results show that our model consistently outperforms the baseline methods on five widely used datasets.     

Stock Price Forecasting: An Echo State Network Approach

Forecasting stock prices using deep learning models suffers from problems such as low accuracy, slow convergence, and complex network structures. This study developed an echo state network (ESN) model to mitigate such problems. We compared our ESN with a long short-term memory (LSTM) network by forecasting the stock data of Kweichow Moutai, a leading enterprise in China’s liquor industry. By analyzing data for 120, 240, and 300 days, we generated forecast data for the next 40, 80, and 100 days, respectively, using both ESN and LSTM. In terms of accuracy, ESN had the unique advantage of capturing nonlinear data. Mean absolute error (MAE) was used to present the accuracy results. The MAEs of the data forecast by ESN were 0.024, 0.024, and 0.025, which were, respectively, 0.065, 0.007, and 0.009 less than those of LSTM. In terms of convergence, ESN has a reservoir state-space structure, which makes it perform faster than other models. Root-mean-square error (RMSE) was used to present the convergence time. In our experiment, the RMSEs of ESN were 0.22, 0.27, and 0.26, which were, respectively, 0.08, 0.01, and 0.12 less than those of LSTM. In terms of network structure, ESN consists only of input, reservoir, and output spaces, making it a much simpler model than the others. The proposed ESN was found to be an effective model that, compared to others, converges faster, forecasts more accurately, and builds time-series analyses more easily.     

Layout Optimization for Greenhouse WSN Based on Path Loss Analysis

When wireless sensor networks (WSN) are deployed in the vegetable greenhouse with dynamic connectivity and interference environment, it is necessary to increase the node transmit power to ensure the communication quality, which leads to serious network interference. To offset the negative impact, the transmit power of other nodes must also be increased. The result is that the network becomes worse and worse, and node energy is wasted a lot. Taking into account the irregular connection range in the cucumber greenhouse WSN, we measured the transmission characteristics of wireless signals under the 2.4 Ghz operating frequency. For improving network layout in the greenhouse, a semi-empirical prediction model of signal loss is then studied based on the measured data. Compared with other models, the average relative error of this semi-empirical signal loss model is only 2.3%. Finally, by combining the improved network topology algorithm and tabu search, this paper studies a greenhouse WSN layout that can reduce path loss, save energy, and ensure communication quality. Given the limitation of node-degree constraint in traditional network layout algorithms, the improved algorithm applies the forwarding constraint to balance network energy consumption and constructs asymmetric network communication links. Experimental results show that this research can realize the energy consumption optimization of WSN layout in the greenhouse.     

A Network Security Risk Assessment Method Based on a B_NAG Model

Computer networks face a variety of cyberattacks. Most network attacks are contagious and destructive, and these types of attacks can be harmful to society and computer network security. Security evaluation is an effective method to solve network security problems. For accurate assessment of the vulnerabilities of computer networks, this paper proposes a network security risk assessment method based on a Bayesian network attack graph (B_NAG) model. First, a new resource attack graph (RAG) and the algorithm E-Loop, which is applied to eliminate loops in the B_NAG, are proposed. Second, to distinguish the confusing relationships between nodes of the attack graph in the conversion process, a related algorithm is proposed to generate the B_NAG model. Finally, to analyze the reachability of paths in B_NAG, the measuring indexs such as node attack complexity and node state transition are defined, and an iterative algorithm for obtaining the probability of reaching the target node is presented. On this basis, the posterior probability of related nodes can be calculated. A simulation environment is set up to evaluate the effectiveness of the B_NAG model. The experimental results indicate that the B_NAG model is realistic and effective in evaluating vulnerabilities of computer networks and can accurately highlight the degree of vulnerability in a chaotic relationship.     

Multi-indicator Active Queue Management Method

A considerable number of applications are running over IP networks. This increased the contention on the network resource, which ultimately results in congestion. Active queue management (AQM) aims to reduce the serious consequences of network congestion in the router buffer and its negative effects on network performance. AQM methods implement different techniques in accordance with congestion indicators, such as queue length and average queue length. The performance of the network is evaluated using delay, loss, and throughput. The gap between congestion indicators and network performance measurements leads to the decline in network performance. In this study, delay and loss predictions are used as congestion indicators in a novel stochastic approach for AQM. The proposed method estimates the congestion in the router buffer and then uses the indicators to calculate the dropping probability, which is responsible for managing the router buffer. The experimental results, based on two sets of experiments, have shown that the proposed method outperformed the existing benchmark algorithms including RED, ERED and BLUE algorithms. For instance, in the first experiment, the proposed method resides in the third-place in terms of delay when compared to the benchmark algorithms. In addition, the proposed method outperformed the benchmark algorithms in terms of packet loss, packet dropping, and packet retransmission. Overall, the proposed method outperformed the benchmark algorithms because it preserves packet loss while maintaining reasonable queuing delay.