Showing papers in "EAI Endorsed Transactions on Collaborative Computing in 2020"

Nash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix

Abstract: A distributed Nash equilibrium seeking algorithm is presented for networked games. We assume an incomplete information available to each player about the other players' actions. The players communicate over a strongly connected digraph to send/receive the estimates of the other players' actions to/from the other local players according to a gossip communication protocol. Due to asymmetric information exchange between the players, a non-doubly (row) stochastic weight matrix is defined. We show that, due to the non-doubly stochastic property, the total average of all players' estimates is not preserved for the next iteration which results in having no exact convergence. We present an almost sure convergence proof of the algorithm to a Nash equilibrium of the game. Then, we extend the algorithm for graphical games in which all players' cost functions are only dependent on the local neighboring players over an interference digraph. We design an assumption on the communication digraph such that the players are able to update all the estimates of the players who interfere with their cost functions. It is shown that the communication digraph needs to be a superset of a transitive reduction of the interference digraph. Finally, we verify the efficacy of the algorithm via a simulation on a social media behavioral case.

A Framework for Predicting Network Security Situation Based on the Improved LSTM

Abstract: In recent years, raw security situation data cannot be utilized well by fully connected neural networks. Generally, a cyber infiltration is a gradual process and there are logical associations between future situation and historical information. Taking the factors into account, this paper proposes a framework to predict network security situation. According the needs of this framework, we improve Long Short-Term Memory (LSTM) with Cross-Entropy function, Rectified Linear Unit and appropriate layer stacking. Modules are designed in the framework to transform raw data into quantitative results. Finally, the performance is evaluated on KDD CUP 99 dataset and UNSW-NB15 dataset. Experiments prove that the framework built with the improved LSTM has better performance to predict network security situation in the near future. The framework achieves a relatively practical prediction of network security situation, helping provide advanced measures to improve network security.

Analysis and improvement of evaluation indexes for clustering results

Abstract: Clustering algorithm is the main field in collaborative computing of social network. How to evaluate clustering results accurately has become a hot spot in clustering algorithm research. Commonly used evaluation indexes are SC, DBI and CHI. There are two shortcomings in the calculation of three indexes. (1) Keep the number of clusters and the objects in the cluster unchanged. When transforming the feature vector, the three indexes will change greatly; (2) Keep the feature vector and the number of clusters unchanged. When changing the objects in the cluster, the three indexes will change tinily. This shows that the three indexes unable to evaluate the clustering results very well. Therefore, based on the calculation process of the three indexes, the paper proposes new three indexes - NSC, NDBI and NCHI. Through testing on standard data sets, three new indexes can better evaluate clustering results.

An effective method for calculating crossed span distance of overhead line based on three-dimensional inclination algorithm

Abstract: In order to safely operate the electric transmission lines, to monitoring the crossed span distance of the overhead lines is one of the key measures. Since the current measurement methods of crossed span distance of overhead line has high cost, low accuracy, and traditional measurement methods has low efficiency, the monitoring model of overhead line in threedimensional space is constructed, and based on oblique parabola equation. The algorithm for detecting the crossed span distance based on three-dimensional inclination under the windless and windy conditions is studied, which are applied to the on-line monitoring system. Through actual measurement, the accuracy and practicability of the three-dimensional model and algorithm are verified which provides reliable algorithm support for traverse crossing distance measurement and on-line monitoring system, and improves work efficiency.

A Power Optimized Method for Mode Switching in Android Systems

Abstract: How the Suspend/Resume mechanism of smartphone influences the power consumption is examined in the dissertation. Specifically, various unimportant and not so urgent network packets keep awakening the operating system (OS) at the time it is under suspend mode, and switch it from suspend to resume mode continually, which results in more power consumption. Accordingly, an innovative optimization technique was suggested in this paper in order that the awakening of OS can be postponed and the lasting hour of suspend mode can be lengthened to decrease power consumption. Some experiments are also carried out, with the result data suggesting that such technique is an effective way to reduce power consumption by greater than 7.63%. It proves that this technique is workable.