• 제목/요약/키워드: Hierarchical Network

검색결과 975건 처리시간 0.029초

Single Image Super Resolution Based on Residual Dense Channel Attention Block-RecursiveSRNet (잔여 밀집 및 채널 집중 기법을 갖는 재귀적 경량 네트워크 기반의 단일 이미지 초해상도 기법)

  • Woo, Hee-Jo;Sim, Ji-Woo;Kim, Eung-Tae
    • Journal of Broadcast Engineering
    • /
    • 제26권4호
    • /
    • pp.429-440
    • /
    • 2021
  • With the recent development of deep convolutional neural network learning, deep learning techniques applied to single image super-resolution are showing good results. One of the existing deep learning-based super-resolution techniques is RDN(Residual Dense Network), in which the initial feature information is transmitted to the last layer using residual dense blocks, and subsequent layers are restored using input information of previous layers. However, if all hierarchical features are connected and learned and a large number of residual dense blocks are stacked, despite good performance, a large number of parameters and huge computational load are needed, so it takes a lot of time to learn a network and a slow processing speed, and it is not applicable to a mobile system. In this paper, we use the residual dense structure, which is a continuous memory structure that reuses previous information, and the residual dense channel attention block using the channel attention method that determines the importance according to the feature map of the image. We propose a method that can increase the depth to obtain a large receptive field and maintain a concise model at the same time. As a result of the experiment, the proposed network obtained PSNR as low as 0.205dB on average at 4× magnification compared to RDN, but about 1.8 times faster processing speed, about 10 times less number of parameters and about 1.74 times less computation.

Multi-level Analysis of the Antecedents of Knowledge Transfer: Integration of Social Capital Theory and Social Network Theory (지식이전 선행요인에 관한 다차원 분석: 사회적 자본 이론과 사회연결망 이론의 결합)

  • Kang, Minhyung;Hau, Yong Sauk
    • Asia pacific journal of information systems
    • /
    • 제22권3호
    • /
    • pp.75-97
    • /
    • 2012
  • Knowledge residing in the heads of employees has always been regarded as one of the most critical resources within a firm. However, many tries to facilitate knowledge transfer among employees has been unsuccessful because of the motivational and cognitive problems between the knowledge source and the recipient. Social capital, which is defined as "the sum of the actual and potential resources embedded within, available through, derived from the network of relationships possessed by an individual or social unit [Nahapiet and Ghoshal, 1998]," is suggested to resolve these motivational and cognitive problems of knowledge transfer. In Social capital theory, there are two research streams. One insists that social capital strengthens group solidarity and brings up cooperative behaviors among group members, such as voluntary help to colleagues. Therefore, social capital can motivate an expert to transfer his/her knowledge to a colleague in need without any direct reward. The other stream insists that social capital provides an access to various resources that the owner of social capital doesn't possess directly. In knowledge transfer context, an employee with social capital can access and learn much knowledge from his/her colleagues. Therefore, social capital provides benefits to both the knowledge source and the recipient in different ways. However, prior research on knowledge transfer and social capital is mostly limited to either of the research stream of social capital and covered only the knowledge source's or the knowledge recipient's perspective. Social network theory which focuses on the structural dimension of social capital provides clear explanation about the in-depth mechanisms of social capital's two different benefits. 'Strong tie' builds up identification, trust, and emotional attachment between the knowledge source and the recipient; therefore, it motivates the knowledge source to transfer his/her knowledge to the recipient. On the other hand, 'weak tie' easily expands to 'diverse' knowledge sources because it does not take much effort to manage. Therefore, the real value of 'weak tie' comes from the 'diverse network structure,' not the 'weak tie' itself. It implies that the two different perspectives on strength of ties can co-exist. For example, an extroverted employee can manage many 'strong' ties with 'various' colleagues. In this regards, the individual-level structure of one's relationships as well as the dyadic-level relationship should be considered together to provide a holistic view of social capital. In addition, interaction effect between individual-level characteristics and dyadic-level characteristics can be examined, too. Based on these arguments, this study has following research questions. (1) How does the social capital of the knowledge source and the recipient influence knowledge transfer respectively? (2) How does the strength of ties between the knowledge source and the recipient influence knowledge transfer? (3) How does the social capital of the knowledge source and the recipient influence the effect of the strength of ties between the knowledge source and the recipient on knowledge transfer? Based on Social capital theory and Social network theory, a multi-level research model is developed to consider both the individual-level social capital of the knowledge source and the recipient and the dyadic-level strength of relationship between the knowledge source and the recipient. 'Cross-classified random effect model,' one of the multi-level analysis methods, is adopted to analyze the survey responses from 337 R&D employees. The results of analysis provide several findings. First, among three dimensions of the knowledge source's social capital, network centrality (i.e., structural dimension) shows the significant direct effect on knowledge transfer. On the other hand, the knowledge recipient's network centrality is not influential. Instead, it strengthens the influence of the strength of ties between the knowledge source and the recipient on knowledge transfer. It means that the knowledge source's network centrality does not directly increase knowledge transfer. Instead, by providing access to various knowledge sources, the network centrality provides only the context where the strong tie between the knowledge source and the recipient leads to effective knowledge transfer. In short, network centrality has indirect effect on knowledge transfer from the knowledge recipient's perspective, while it has direct effect from the knowledge source's perspective. This is the most important contribution of this research. In addition, contrary to the research hypothesis, company tenure of the knowledge recipient negatively influences knowledge transfer. It means that experienced employees do not look for new knowledge and stick to their own knowledge. This is also an interesting result. One of the possible reasons is the hierarchical culture of Korea, such as a fear of losing face in front of subordinates. In a research methodology perspective, multi-level analysis adopted in this study seems to be very promising in management research area which has a multi-level data structure, such as employee-team-department-company. In addition, social network analysis is also a promising research approach with an exploding availability of online social network data.

  • PDF

A Comparative Analysis on the Handover Latencies of IPv6 Mobility Support Protocols (IPv6 이동성 지원 프로토콜들의 핸드오버 지연시간에 대한 비교 분석)

  • Kong, Ki-Sik
    • Journal of Digital Contents Society
    • /
    • 제11권3호
    • /
    • pp.341-348
    • /
    • 2010
  • Unlike host-based IPv6 mobility support protocols such as Mobile IPv6 (MIPv6), Hierarchical Mobile IPv6 (HMIPv6), and Fast handover for Mobile IPv6 (FMIPv6), Proxy Mobile IPv6 (PMIPv6) is expected to accelerate the real deployment of IPv6 mobility support protocol by using only collaborative operations between the network entities without mobile node (MN) being involved. In this paper, we analyze and compare the handover latency of network-based IPv6 mobility support protocol (i.e., PMIPv6) with the representative host-based IPv6 mobility support protocols such as MIPv6, HMIPv6, and FMIPv6. Analytical results show that the handover latency of PMIPv6 is considerably lower than those of MIPv6 and HMIPv6, and the handover latency of PMIPv6 becomes lower than that of FMIPv6 in case the wireless link delay is greater than the delay between mobile access gateway (MAG) and local mobility anchor (LMA).

A Pedestrian Detection Method using Deep Neural Network (심층 신경망을 이용한 보행자 검출 방법)

  • Song, Su Ho;Hyeon, Hun Beom;Lee, Hyun
    • Journal of KIISE
    • /
    • 제44권1호
    • /
    • pp.44-50
    • /
    • 2017
  • Pedestrian detection, an important component of autonomous driving and driving assistant system, has been extensively studied for many years. In particular, image based pedestrian detection methods such as Hierarchical classifier or HOG and, deep models such as ConvNet are well studied. The evaluation score has increased by the various methods. However, pedestrian detection requires high sensitivity to errors, since small error can lead to life or death problems. Consequently, further reduction in pedestrian detection error rate of autonomous systems is required. We proposed a new method to detect pedestrians and reduce the error rate by using the Faster R-CNN with new developed pedestrian training data sets. Finally, we compared the proposed method with the previous models, in order to show the improvement of our method.

Implement of Call blocking Probabilities in Mobile Communication Networks (이동통신 네트워크에서 호 블록킹 확률의 개선 방안)

  • Park, Sang-Hyun;Oh, Youn-Chil;Lee, Young-Seok;Yang, Hae-Kwon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • 제13권1호
    • /
    • pp.67-74
    • /
    • 2009
  • This paper presents a method of improving the service availability by distributing the traffic of voice/data calls over the multi-layer cells in a mobile communication network. The traffic model is described and the call handling performance is analyzed. In our method, a fast moving call is moved to and serviced in the upper layer cell. A call is also moved upward when an overflow occurs. But unlike other methods, the call that is moved upward in the overflow case is the one which has the longest sojourn time in the cell. Moreover, when the call that was moved upward due to overflow condition stays longer than a certain period of time in the upper layer cell, the system moves the call back to the lower layer in order to save the more expensive resources of the upper layer cell. Call handling performance of this method evaluated from M/M/C/K models shows clear improvement with respect to call blocking probability and forced termination probability.

Separated Dual-layering Routing Scheme (SDRS) for Hierarchical Wireless Sensor Networks (계층형 무선센서네트워크를 위한 분리된 이중화 라우팅)

  • Choi, Hae-Won;Kim, Kyung-Jun;Kim, Hyun-Sung
    • Journal of Advanced Navigation Technology
    • /
    • 제13권4호
    • /
    • pp.551-558
    • /
    • 2009
  • Most of clustering schemes focusing on the energy efficiency have only a cluster head in each cluster, thus the energy consumption of cluster head in a cluster can rapidly increase. To reduce the energy consumption, recently, the dual-layered clustering which is separated a cluster ranges into two parts, i.e., data aggregation layer and data transmission layer, based on a sensor equipped with geographical positioning system (GPS), was proposed. However, the logical regions existing within the dual-layered clustering range can not distinguish efficiently. This scheme leads to many messages collision and transmission delay among member nodes. In this paper, to solve these problems, we propose a separated dual-layered routing scheme using the position information and the cluster radius. Proposed scheme clearly distinguish the dual-layered clustering range and gets the balanced number of member nodes in each cluster. Therefore, the proposed routing scheme could prolong the overall network life time about 10% compared to the previous two layered clustering scheme and LEACH.

  • PDF

An Integrated Intrusion Detection System for a Large-scale Network Environment (대규모 네트워크 환경을 위한 통합 침입탐지 시스템)

  • 안정모;조진성;정병수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제29권7C호
    • /
    • pp.985-996
    • /
    • 2004
  • In order to solve the increasing security problems, IDSs(Intrusion Detection System) have appeared. However, local IDSs have a limit to detect various intrusions in a large-scale network environment. So there are a lot of researches in progress which organize the elements of IDS in a distributed or hierarchical manner. In this paper, we design a integrated IDS which exchanges messages between them through the standardized message format (IDMEF) and communication protocol (IDXP). We also propose a policy profile for an effective control of IDSs, and employ the PKI mechanism for mutual authentication. We implement a prototype system for the proposed IDSs communicating with Snort and analyze its performance.

Activity Recognition based on Multi-modal Sensors using Dynamic Bayesian Networks (동적 베이지안 네트워크를 이용한 델티모달센서기반 사용자 행동인식)

  • Yang, Sung-Ihk;Hong, Jin-Hyuk;Cho, Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • 제15권1호
    • /
    • pp.72-76
    • /
    • 2009
  • Recently, as the interest of ubiquitous computing has been increased there has been lots of research about recognizing human activities to provide services in this environment. Especially, in mobile environment, contrary to the conventional vision based recognition researches, lots of researches are sensor based recognition. In this paper we propose to recognize the user's activity with multi-modal sensors using hierarchical dynamic Bayesian networks. Dynamic Bayesian networks are trained by the OVR(One-Versus-Rest) strategy. The inferring part of this network uses less calculation cost by selecting the activity with the higher percentage of the result of a simpler Bayesian network. For the experiment, we used an accelerometer and a physiological sensor recognizing eight kinds of activities, and as a result of the experiment we gain 97.4% of accuracy recognizing the user's activity.

Embedding algorithm among star graph and pancake graph, bubblesort graph (스타 그래프와 팬케익, 버블정렬 그래프 사이의 임베딩 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok;Kim, Sung-Won
    • The Journal of Korean Association of Computer Education
    • /
    • 제13권5호
    • /
    • pp.91-102
    • /
    • 2010
  • Star graph is a well-known interconnection network to further improve the network cost of Hypercube and has good properties such as node symmetry, maximal fault tolerance and strongly hierarchical property. In this study, we will suggest embedding scheme among star graph and pancake graph, bubblesort graph, which are variations of star graph. We will show that bubblesort graph can be embedded into pancake and star graph with dilation 3, expansion 1, respectively and pancake graph can be embedded into bubblesort graph with dilation cost O($n^2$). Additionally, we will show that star graph can be embedded into pancake graph with dilation 4, expansion 1. Also, with dilation cost O(n) we will prove that star graph can be embedded into bubblesort graph and pancake graph can be embedded into star graph.

  • PDF

An Energy-Efficient Clustering Protocol Based on The Cross-Layer Design in Wireless Sensor Networks (무선 센서 네트워크에서 크로스 레이어 기반의 에너지 효율적인 클러스터링 프로토콜)

  • Kim, Tae-Kon;Lee, Hyung-Keun
    • Journal of IKEEE
    • /
    • 제11권4호
    • /
    • pp.165-170
    • /
    • 2007
  • The main goal of research concerning clustering protocols is to minimize the energy consumption of each node and maximize the network lifetime of wireless sensor networks. However, most existing clustering protocols mainly focused on the design and formation of clusters, leaving the consideration of communication between the cluster head and the sink behind. In this paper, we propose efficient multi path routing algorithm by using MAC-NET Cross-layering. multi path needed only one tiny packet from sink to setup. In addition proposed algorithm can be used for any cluster-based hierarchical inter-clustering routing algorithm. The simulation results demonstrate that proposed algorithm extended the overall survival time of the network by reducing the load of cluster heads. The performance of proposed algorithm is less affected by the extension of sensing field than other inter-clustering operation.

  • PDF