• Title/Summary/Keyword: complex network

Search Result 2,205, Processing Time 0.03 seconds

CO-CLUSTER HOMOTOPY QUEUING MODEL IN NONLINEAR ALGEBRAIC TOPOLOGICAL STRUCTURE FOR IMPROVING POISON DISTRIBUTION NETWORK COMMUNICATION

  • V. RAJESWARI;T. NITHIYA
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.4
    • /
    • pp.861-868
    • /
    • 2023
  • Nonlinear network creates complex homotopy structural communication in wireless network medium because of complex distribution approach. Due to this multicast topological connection structure, the queuing probability was non regular principles to create routing structures. To resolve this problem, we propose a Co-cluster homotopy queuing model (Co-CHQT) for Nonlinear Algebraic Topological Structure (NLTS-) for improving poison distribution network communication. Initially this collects the routing propagation based on Nonlinear Distance Theory (NLDT) to estimate the nearest neighbor network nodes undernon linear at x(a,b)→ax2+bx2 = c. Then Quillen Network Decomposition Theorem (QNDT) was applied to sustain the non-regular routing propagation to create cluster path. Each cluster be form with co variance structure based on Two unicast 2(n+1)-Z2(n+1)-Z network. Based on the poison distribution theory X(a,b) ≠ µ(C), at number of distribution routing strategies weights are estimated based on node response rate. Deriving shorte;'l/st path from behavioral of the node response, Hilbert -Krylov subspace clustering estimates the Cluster Head (CH) to the routing head. This solves the approximation routing strategy from the nonlinear communication depending on Max- equivalence theory (Max-T). This proposed system improves communication to construction topological cluster based on optimized level to produce better performance in distance theory, throughput latency in non-variation delay tolerant.

A Method to Find the Core Node Engaged in Malware Propagation in the Malware Distribution Network Hidden in the Web (웹에 숨겨진 악성코드 배포 네트워크에서 악성코드 전파 핵심노드를 찾는 방안)

  • Kim Sung Jin
    • Convergence Security Journal
    • /
    • v.23 no.2
    • /
    • pp.3-10
    • /
    • 2023
  • In the malware distribution network existing on the web, there is a central node that plays a key role in distributing malware. If you find and block this node, you can effectively block the propagation of malware. In this study, a centrality search method applied with risk analysis in a complex network is proposed, and a method for finding a core node in a malware distribution network is introduced through this approach. In addition, there is a big difference between a benign network and a malicious network in terms of in-degree and out-degree, and also in terms of network layout. Through these characteristics, we can discriminate between malicious and benign networks.

Organizational-Economic Mechanism of the Development of the Agro-Industrial Complex in Modern Conditions

  • Ivanko, Anatolii;Vasylenko, Nataliia;Bushovska, Lesia;Makedon, Halyna;Dvornyk, Inna
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.2
    • /
    • pp.107-114
    • /
    • 2022
  • The main purpose of this study is to substantiate the theoretical and methodological foundations of the organizational and economic mechanism of development of the agro-industrial complex in modern conditions. Organizational and economic mechanism is presented as a complex organizational structure of the system type, which is aimed at performing specific functions, the characteristic feature of which is the constant support of process changes without which the organizational and economic mechanism can not exist. There are four components of the agro-industrial complex, represented by agriculture and the national economy, which ensure its operation, including industry, processing of agricultural products, its storage and transportation, sale and repair and maintenance of agricultural machinery and more. It is proved that the organizational and economic mechanism of development of agro-industrial complex in modern conditions it is expedient to consider: from the point of view of system and process approaches; as a set of economic levers and organizational measures to influence the agro-industrial complex; constituent components of organizational influence on the development of the complex; a set of components, elements that are integrated into the system of economic relations of the subjects of the agro-industrial complex; a set of purposeful stimulators of agro-industrial complex development. The functions of the organizational component of the mechanism of agro-industrial complex include: redistributive, planning, interaction, control, integration and regulatory functions, the functions of the economic component include consumer, investment and innovation, social, incentive, monitoring functions of the mechanism. The symbiosis of the functions of organizational and economic components ensure the effectiveness of the organizational and economic mechanism of the organizational and economic mechanism through its functionalities as a whole.

Development of a program to predict the airflow rate and pollutant concentration in complex network-type tunnels (네트워크형 터널의 풍량 및 농도해석 프로그램 개발연구)

  • Kim, Hyo-Gyu;Choi, Pan-Gyu;Ryu, Ji-Oh;Lee, Chang-Woo
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.19 no.2
    • /
    • pp.213-229
    • /
    • 2017
  • Recently, in urban areas there is a tendency to construct more complex network-type tunnels including entrance and exit ramps. At the same time, various one-dimensional programs based on the network theory have been proposed for tunnel ventilation analysis. This paper aims at developing a program that can analyze the ventilation flow rate and pollutants concentration in complex network-type tunnels based on the none hardy-cross method. The flow analysis in the branch was carried out on the basis of the Gradient method, while for the concentration analysis a new logic has been developed to calculate the inflow and outflow concentration automatically in a complex network-type structure. Additionally, in the tunnel segments showing low flow rate, proper grid interval sizes were proposed to reduce numerical error. To verify the applicability of the program, flow rates predicted in the straight tunnels were compared with the classical velocity-diagram method by Stokic and the TVSDM program. The results showed that the errors were within 1%. In addition, the program was applied to the recent ventilation system adopted in the complex network-type urban tunnels.

A GRAPHICAL ALGORITHM FOR CALCULATING THE RANKS OF COMPLEX REACTION NETWORKS

  • Choo, S.M.;Lee, N.Y.
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.5_6
    • /
    • pp.787-792
    • /
    • 2012
  • We present a graphical algorithm and theorems for calculating the ranks of reaction networks. The ranks are needed to study behaviors of the networks from their structures. This approach can graphically simplify complex networks for the calculation. We show an example of a large network for the practical advantage.

Forecasting High-Level Ozone Concentration with Fuzzy Clustering (퍼지 클러스터링을 이용한 고농도오존예측)

  • 김재용;김성신;왕보현
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2001.05a
    • /
    • pp.191-194
    • /
    • 2001
  • The ozone forecasting systems have many problems because the mechanism of the ozone concentration is highly complex, nonlinear, and nonstationary. Also, the results of prediction are not a good performance so far, especially in the high-level ozone concentration. This paper describes the modeling method of the ozone prediction system using neuro-fuzzy approaches and fuzzy clustering. The dynamic polynomial neural network (DPNN) based upon a typical algorithm of GMDH (group method of data handling) is a useful method for data analysis, identification of nonlinear complex system, and prediction of a dynamical system.

  • PDF

Multiparameter Flow Cytometry: Advances in High Resolution Analysis

  • O'Donnell, Erika A.;Ernst, David N.;Hingorani, Ravi
    • IMMUNE NETWORK
    • /
    • v.13 no.2
    • /
    • pp.43-54
    • /
    • 2013
  • Over the past 40 years, flow cytometry has emerged as a leading, application-rich technology that supports high-resolution characterization of individual cells which function in complex cellular networks such as the immune system. This brief overview highlights advances in multiparameter flow cytometric technologies and reagent applications for characterization and functional analysis of cells modulating the immune network. These advances significantly support highthroughput and high-content analyses and enable an integrated understanding of the cellular and molecular interactions that underlie complex biological systems.

Study on Automatic Generation of Platform Configuration Register in FlexRay Protocol (FlexRay 프로토콜에서 플랫폼 구성 변수의 자동 생성에 관한 연구)

  • Yang, Jae-Sung;Park, Jee-Hun;Lee, Suk;Lee, Kyung-Chang;Choi, GwangHo
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.7 no.1
    • /
    • pp.41-52
    • /
    • 2012
  • Recently, FlexRay was developed to replace controller area network (CAN) protocol in chassis networking systems, to remedy the shortage of transmission capacity and unsatisfactory real-time transmission delay of conventional CAN. FlexRay network systems require correct synchronization and complex scheduling parameters. However, because platform configuration register (PCR) setting and message scheduling is complex and bothersome task, FlexRay is more difficult to implement in applications than CAN protocol. To assist a network designer for implementing FlexRay cluster, this paper presents an analysis of FlexRay platform configuration register and automatic generation program of PCR. To demonstrate the feasibility of the automatic generation program, we evaluated its performance using experimental testbed.

Distributed estimation over complex adaptive networks with noisy links

  • Farhid, Morteza;Sedaaghi, Mohammad H.;Shamsi, Mousa
    • Smart Structures and Systems
    • /
    • v.19 no.4
    • /
    • pp.383-391
    • /
    • 2017
  • In this paper, we investigate the impacts of network topology on the performance of a distributed estimation algorithm, namely combine-then-adaptive (CTA) diffusion LMS, based on the data with or without the assumptions of temporal and spatial independence with noisy links. The study covers different network models, including the regular, small-world, random and scale-free whose the performance is analyzed according to the mean stability, mean-square errors, communication cost (link density) and robustness. Simulation results show that the noisy links do not cause divergence in the networks. Also, among the networks, the scale free network (heterogeneous) has the best performance in the steady state of the mean square deviation (MSD) while the regular is the worst case. The robustness of the networks against the issues like node failure and noisier node conditions is discussed as well as providing some guidelines on the design of a network in real condition such that the qualities of estimations are optimized.

Distributed Prevention Mechanism for Network Partitioning in Wireless Sensor Networks

  • Wang, Lili;Wu, Xiaobei
    • Journal of Communications and Networks
    • /
    • v.16 no.6
    • /
    • pp.667-676
    • /
    • 2014
  • Connectivity is a crucial quality of service measure in wireless sensor networks. However, the network is always at risk of being split into several disconnected components owing to the sensor failures caused by various factors. To handle the connectivity problem, this paper introduces an in-advance mechanism to prevent network partitioning in the initial deployment phase. The approach is implemented in a distributed manner, and every node only needs to know local information of its 1-hop neighbors, which makes the approach scalable to large networks. The goal of the proposed mechanism is twofold. First, critical nodes are locally detected by the critical node detection (CND) algorithm based on the concept of maximal simplicial complex, and backups are arranged to tolerate their failures. Second, under a greedy rule, topological holes within the maximal simplicial complex as another potential risk to the network connectivity are patched step by step. Finally, we demonstrate the effectiveness of the proposed algorithm through simulation experiments.