An analysis of modern computer network intrusion detection systems was carried out. The application of machine and deep learning methods for classification problems has been investigated. The UNSW-NB15 dataset, develo...
详细信息
This paper describes the process of identifying the state of a computer system based on tracking changes in the file system under the condition that there is no reliable information about the state of objects in the e...
详细信息
An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference betw...
详细信息
An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference between the labels assigned to any two vertices which are at distance two is at least one. The span of an L(0,1)-labelling is the maximum label number assigned to any vertex of G. The L(0,1)-labelling number of a graph G, denoted by λ0.1(G) is the least integer k such that G has an L(0,1)-labelling of span k. This labelling has an application to a computer code assignment problem. The task is to assign integer control codes to a network of computer stations with distance restrictions. A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we label the vertices of a cactus graph by L(0,1)-labelling and have shown that, △-1≤λ0.1(G)≤△ for a cactus graph, where △ is the degree of the graph G.
The theoretical concepts of graphs are highly utilized by computer science applications, social sciences, and medical sciences, especially in computer science for applications such as data mining, image segmentation, ...
详细信息
The theoretical concepts of graphs are highly utilized by computer science applications, social sciences, and medical sciences, especially in computer science for applications such as data mining, image segmentation, clustering, image capturing, and networking. Fuzzy graphs, bipolar fuzzy graphs and the recently developed m -polar fuzzy graphs are growing research topics because they are generalizations of graphs (crisp). In this paper, three new operations, i.e., direct product, semi-strong product and strong product, are defined on m -polar fuzzy graphs. It is proved that any of the products of m -polar fuzzy graphs are again an m -polar fuzzy graph. Sufficient conditions are established for each to be strong, and it is proved that the strong product of two complete m -polar fuzzy graphs is complete. If any of the products of two m -polar fuzzy graphs G 1 and G 2 are strong, then at least G 1 or G 2 must be strong. Moreover, the density of an m -polar fuzzy graph is defined, the notion of balanced m -polar fuzzy graph is studied, and necessary and sufficient conditions for the preceding products of two m -polar fuzzy balanced graphs to be balanced are established. Finally, the concept of product m -polar fuzzy graph is introduced, and it is shown that every product m -polar fuzzy graph is an m -polar fuzzy graph. Some operations, like union, direct product, and ring sum are defined to construct new product m -polar fuzzy graphs.
We illustrate the difference between sequential composition in process algebra axiomatisations like ACP and action prefixing in process calculi like CCS. We define both early and late input in a general framework exte...
详细信息
Long-term predictions of time series is a task with multiple applications. Exploiting neural networks for such problem has not been studied enough for financial purposes. An empirical study of specific cases with real...
详细信息
We present novel concepts, technologies and potentials of optical data communication, especially for future computer architectures. The WDM (wavelength division multiplexing) and the optical wiring technologies are ex...
详细信息
In this paper definite Horn clause programs are investigated within a proof-theoretic framework;program clauses being considered rules of a formal system. Based on this approach, the soundness and completeness of SLD-...
详细信息
IEEEXtreme is an IEEE Student Activities Committee initiative to create a worldwide programming contest for IEEE Student Branches. The success of the past editions and the way IEEEXtreme is evolving, suggests that it ...
详细信息
暂无评论