Automated Design of Network Security Metrics

Many abstract security measurements are based on characteristics of a graph that represents the network. These are typically simple and quick to compute but are often of little practical use in making real-world predictions. Practical network security is often measured using simulation or real-world exercises. These approaches better represent realistic outcomes but can be costly and time-consuming. This work aims to combine the strengths of these two approaches, developing efficient heuristics that accurately predict attack success. Hyper-heuristic machine learning techniques, trained on network attack simulation training data, are used to produce novel graph-based security metrics. These low-cost metrics serve as an approximation for simulation when measuring network security in real time. The approach is tested and verified using a simulation based on activity from an actual large enterprise network. The results demonstrate the potential of using hyper-heuristic techniques to rapidly evolve and react to emerging cybersecurity threats

Prediction Approach of Critical Node Based on Multiple Attribute Decision Making for Opportunistic Sensor Networks

Predicting critical nodes of Opportunistic Sensor Network (OSN) can help us not only to improve network performance but also to decrease the cost in network maintenance. However, existing ways of predicting critical nodes in static network are not suitable for OSN. In this paper, the conceptions of critical nodes, region contribution, and cut-vertex in multiregion OSN are defined. We propose an approach to predict critical node for OSN, which is based on multiple attribute decision making (MADM). It takes RC to present the dependence of regions on Ferry nodes. TOPSIS algorithm is employed to find out Ferry node with maximum comprehensive contribution, which is a critical node. The experimental results show that, in different scenarios, this approach can predict the critical nodes of OSN better

Texture Analysis of Stereograms of Diffuse-Porous Hardwood: Identification of Wood Species Used in Tripitaka Koreana

Tripitaka Koreana is a collection of over 80, 000 Buddhist texts carved on wooden blocks. In this study, we investigated whether six hardwood species used as blocks could be recognized by image recognition. An image dataset comprising stereograms in transverse section was acquired at 10× magnification. After auto-rotation, cropping, and filtering processes, the dataset was analyzed by an image recognition system, which comprised a gray level co-occurrence matrix method for feature extraction and a weighted neighbor distance algorithm for classification. The estimated accuracy obtained by leave-one-out cross-validation was up to 100% after optimizing the pretreatments and parameters, thereby indicating that the proposed system may be useful for the non-destructive analysis of all wooden carvings. We also examined the specific anatomical features represented by textures in the images. Many of the texture features were apparently related to the density of vessels and others were associated with the ray intervals. However, some anatomical features that are helpful for visual inspection were ignored by the proposed system despite its perfect accuracy. In addition to the high analytical accuracy of this system, a deeper understanding of the relationships between the calculated and actual features is essential for the further development of automated recognition