• Title/Summary/Keyword: Sub-Network

Search Result 1,459, Processing Time 0.03 seconds

Emergence and Structure of Complex Mutualistic Networks

  • Lee, KyoungEun;Jung, Nam;Lee, Hyun Min;Maeng, Seung Eun;Lee, Jae Woo
    • Proceedings of the National Institute of Ecology of the Republic of Korea
    • /
    • v.3 no.3
    • /
    • pp.149-153
    • /
    • 2022
  • The degree distribution of the plant-pollinator network was identified by analyzing the data in the ecosystem and reproduced by a model of the growing bipartite mutualistic networks. The degree distribution of pollinator shows power law or stretched exponential distribution, while plant usually shows stretched exponential distribution. In the growth model, the plant and the pollinator are selected with probability Pp and PA=1-Pp, respectively. The number of incoming links for the plant and the pollinator is lp and lA, respectively. The probability that the link of the plant selects the pollinator of the existing network given as $A_{k_i}=k^{{\lambda}_A}_i/{\sum}_i\;k^{{\lambda}_A}_i$, and the probability that the pollinator selects the plant is $P_{k_i}=k^{{\lambda}_p}_i/{\sum}_i\;k^{{\lambda}_p}_i$. When the nonlinear growth index is 𝛌X=1 (X=A or P), the degree distribution follows a power law, and if 0≤𝛌X<1, the degree distribution follows a stretched exponential distribution. The cumulative degree distributions of plants and pollinators of 14 empirical plant-pollinators included in Interaction Web Database were calculated. A set of parameters (PA,PP,lA,lP) that reproduces these cumulative degree distributions and a growth index 𝛌X (X=A or P) were obtained. We found that animal takes very heterogenous connections, whereas plant takes a more flexible connection network.

The Design of SNMP SubManager Model Considering Characteristic of Network Traffics (Network 부하 특성을 고려한 SNMP SubManager Model 설계)

  • 하경재;신복덕;강임주
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10c
    • /
    • pp.183-185
    • /
    • 2000
  • 본 논문에서는 SNMP를 이용한 Nerwork Management System(NMS)이 Network을 사용하는 Application에 영향을 주지 않도록 하는 Polling 전략과 Model을 설계하였다. 제안된 System은 Network의 각 Client 정보를 처리하는 Agent와 Data 수집 및 제어를 담당하는 Server로 구성된다. Agent는 SNMP Agent 부분과 Network 상태를 Monitoring 하는 SubManager로 구성되어, Server는 SNMP Agent와의 Polling 및 Polling 정책을 결정하는 부분으로 구성된다. 제안 Model은 SNMP를 이용한 NMS를 도입할 경우, 기존 Network Service에 영향을 주지 않도록 하는 것이 목적이다. 제안된 System에 대한 성능평가를 위해 실존하는 Network을 대상으로 SNMP의 Polling 및 Service의 부하량을 측정하였다.

  • PDF

Sub-Network based Dynamic Restoration Schemes and Its Characteristics on GMPLS Network (GMPLS에서 Sub-Network을 이용한 동적 복구 방식 및 특성)

  • 권호진;이상화;김영부;한치문
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.5
    • /
    • pp.53-61
    • /
    • 2004
  • This paper proposes two types of sub-network based on dynamic restoration schemes to improve survivability of GMPLS networks and analyzes characteristics of these two schemes. The first proposed scheme divides with a whole GMPLS network into several sub-networks, applies a mixture of both restoration and protection methods according to fault location. The other scheme divides a whole GMPLS network into primary and secondary sub-networks, applies a restoration method in each sub-network according to fault location. In our simulation, we evaluate the performances of network resource utilization, restoration success rate, and mean restoration time and conduct its comparative analysis with conventional schemes. The simulation results show that the efficiency of network resource utilization in the proposed schemes is increased as compared with conventional restoration schemes (l+l, 1:1, 1:N) in case of single-failed link. By contrast, we found that the performances of restoration success rate and mean restoration time in case of multi-failed link is lower than conventional restoration schemes. However, the probability that multi-failed link is occurred is very low so that the problem in practical GMPLS network is negligible.

Cascaded Residual Densely Connected Network for Image Super-Resolution

  • Zou, Changjun;Ye, Lintao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.2882-2903
    • /
    • 2022
  • Image super-resolution (SR) processing is of great value in the fields of digital image processing, intelligent security, film and television production and so on. This paper proposed a densely connected deep learning network based on cascade architecture, which can be used to solve the problem of super-resolution in the field of image quality enhancement. We proposed a more efficient residual scaling dense block (RSDB) and the multi-channel cascade architecture to realize more efficient feature reuse. Also we proposed a hybrid loss function based on L1 error and L error to achieve better L error performance. The experimental results show that the overall performance of the network is effectively improved on cascade architecture and residual scaling. Compared with the residual dense net (RDN), the PSNR / SSIM of the new method is improved by 2.24% / 1.44% respectively, and the L performance is improved by 3.64%. It shows that the cascade connection and residual scaling method can effectively realize feature reuse, improving the residual convergence speed and learning efficiency of our network. The L performance is improved by 11.09% with only a minimal loses of 1.14% / 0.60% on PSNR / SSIM performance after adopting the new loss function. That is to say, the L performance can be improved greatly on the new loss function with a minor loss of PSNR / SSIM performance, which is of great value in L error sensitive tasks.

An Empirical Study on the Sub-factors of Middle School Character Education using Social Network Analysis (사회 네트워크 분석을 이용한 중등 인성 교육의 세부요인에 관한 실증 연구)

  • Kim, Hyojung
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.13 no.2
    • /
    • pp.87-98
    • /
    • 2017
  • The advancements in scientific technology and information network in the 21st century allow us to easily acquire a desired knowledge. In the midst of today's informatization, globalization, and cultural diversification, adolescents experience emotional confusion while accommodating diverse cultures and information. This study aimed at examining three aspects of character suggested by the Ministry of Education, which are ethics, sociality, and emotion, and the actual sub-factors required for character education. To that end, a survey was conducted with adolescents who were at a character-building age, and social network analysis (SNA) was performed to determine the effect of character education on the sub-factors. The statistics program SPSS was used to investigate the general traits of the subjects and the validity of the research variables. The 2-mode data that were finally selected were converted to 2-mode data using NetMinder 4, which is a network analysis tool. Furthermore, a data network was established based on a quasi-network that represents the relationships between ethics, sociality, and emotion. The results of this study showed that the subjects considered honesty and justice to be the sub-domains of the ethics domain. In addition, they identified sympathy, communication, consideration for others, and cooperation as the sub-domains of the sociality domain. Finally, they believed that self-understanding and self-control were the sub-domains of the emotion domain.

MnO2 Nanowires Electrodeposited in a Porous Network of Agarose Gel as a Pseudocapacitor Electrode

  • Jin, Sohyun;Ryu, Ilhwan;Lim, Geo;Yim, Sanggyu
    • Journal of Electrochemical Science and Technology
    • /
    • v.11 no.4
    • /
    • pp.406-410
    • /
    • 2020
  • Despite a simple preparation of manganese oxide (MnO2) nanowires by electrodeposition, the improvement in specific capacitance (Csp) and voltammetric response of the MnO2 nanowire-based electrodes has been quite limited. This is attributed to the poor electrical conductivity of MnO2 and its dense bulk morphology due to the aggregation of the nanowires. This study investigated the capacitive performance of MnO2 nanowires electrodeposited on agarose thin films. The good ionic conductivity and porous network of the agarose film provided favorable growth conditions for the MnO2 nanowires with suppressed aggregation. A maximum Csp value of 686 F/g measured at a scan rate of 10 mV/s was obtained, which was significantly larger than that of 314 F/g for the agarose-free MnO2 electrode at the same scan rate. The rate capability was also improved. The Csp measured at a high scan rate of 100 mV/s retained 74.0% of the value measured at 10 mV/s, superior to the retention of 71.1% for the agarose-free MnO2 electrode.

A Novel Active User Identification Method for Space based Constellation Network

  • Kenan, Zhang;Xingqian, Li;Kai, Ding;Li, Li
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.12
    • /
    • pp.212-216
    • /
    • 2022
  • Space based constellation network is a kind of ad hoc network in which users are self-organized without center node. In space based constellation network, users are allowed to enter or leave the network at any given time. Thus, the number of active users is an unknown and time-varying parameter, and the performance of the network depends on how accurately this parameter is estimated. The so-called problem of active user identification, which consists of determining the number and identities of users transmitting in space based constellation network is discussed and a novel active user identification method is proposed in this paper. Active user identification code generated by transmitter address code and receiver address code is used to spread spectrum. Subspace-based method is used to process received signal and judgment model is established to identify active users according to the processing results. The proposed method is simulated under AWGN channel, Rician channel and Rayleigh channel respectively. Numerical results indicate that the proposed method obtains at least 1.16dB Eb/N0 gains compared with reference methods when miss alarm rate reaches 10-3.

Efficient Processing of All-farthest-neighbors Queries in Spatial Network Databases

  • Cho, Hyung-Ju
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.12
    • /
    • pp.1466-1480
    • /
    • 2019
  • This paper addresses the efficient processing of all-farthest-neighbors (AFN) queries in spatial network databases. Given a set of data points P={p1,p2,…,p|p|} in a spatial network, where the distance between two data points p and s, denoted by dist (p,s), is the length of the shortest path between them, an AFN query is defined as follows: find the farthest neighbor ω(p)∈P of each data point p such that dist(p,ω(p)) ≥ dist(p,s) for all s∈P. In this paper, we propose a shared execution algorithm called FAST (for All-Farthest-neighbors Search in spatial neTworks). Extensive experiments on real-world roadmaps confirm the efficiency and scalability of the FAST algorithm, while demonstrating a speedup of up to two orders of magnitude over a conventional solution.

Deep Learning-based Prediction of PM10 Fluctuation from Gwanak-gu Urban Area, Seoul, Korea (서울 관악구 도심지역 미세먼지(PM10) 관측 값을 활용한 딥러닝 기반의 농도변동 예측)

  • Choi, Han-Soo;Kang, Myungjoo;Kim, Yong Cheol;Choi, Hanna
    • Journal of Soil and Groundwater Environment
    • /
    • v.25 no.3
    • /
    • pp.74-83
    • /
    • 2020
  • Since fine dust (PM10) has a significant influence on soil and groundwater composition during dry and wet deposition processes, it is of a vital importance to understand the fate and transport of aerosol in geological environments. Fine dust is formed after the chemical reaction of several precursors, typically observed in short intervals within a few hours. In this study, deep learning approach was applied to predict the fate of fine dust in an urban area. Deep learning training was performed by combining convolutional neural network (CNN) and recurrent neural network (RNN) techniques. The PM10 concentration after 1 hour was predicted based on three-hour data by setting SO2, CO, O3, NO2, and PM10 as training data. The obtained coefficient of determination value, R2, was 0.8973 between predicted and measured values for the entire concentration range of PM10, suggesting deep learning method can be developed into a reliable and viable tool for prediction of fine dust concentration.

Workplace Violence and Social Network Service Addiction

  • Choi, Young-Keun
    • The Journal of Industrial Distribution & Business
    • /
    • v.8 no.7
    • /
    • pp.21-29
    • /
    • 2017
  • Purpose - The purpose of this study is to investigate the impact of organizational politics on employees' social network service addiction and how it influences their job satisfaction and organizational citizenship behavior. And this study explores if leader-member exchange can moderate the relationship between organizational politics and social network service addiction. Research, design, data, and methodology - For this, this study collected data from 305 employees in Korean companies through a survey method and uses SPSS 18.0 for hierarchical regression analysis in the hypothesis test. Results - First, organizational politics increases immersion, compulsion and association among the sub-factors of social network service addiction. Second, each phenomena of social network service addiction such as salience, compulsion and association decrease each relevant factors of job satisfaction and organizational citizen behavior. Third, compulsion and association among the sub-factors of social network service addiction play the mediating roles between organizational politics and each relevant factors of job satisfaction/organizational citizen behavior. Finally, some of sub-factors of leader-member exchange decrease the effect of each characteristics of organizational politics on immersion, compulsion and association among the sub-factors of social network service addiction. Conclusions - This study provides some of managerial implications to corporate executives who try to manage organizational attitude.