• 제목/요약/키워드: Computer Network Engineering

검색결과 6,605건 처리시간 0.033초

Siamese Network의 특징맵을 이용한 객체 추적 알고리즘 (Object Tracking Algorithm using Feature Map based on Siamese Network)

  • 임수창;박성욱;김종찬;류창수
    • 한국멀티미디어학회논문지
    • /
    • 제24권6호
    • /
    • pp.796-804
    • /
    • 2021
  • In computer vision, visual tracking method addresses the problem of localizing an specific object in video sequence according to the bounding box. In this paper, we propose a tracking method by introducing the feature correlation comparison into the siamese network to increase its matching identification. We propose a way to compute location of object to improve matching performance by a correlation operation, which locates parts for solving the searching problem. The higher layer in the network can extract a lot of object information. The lower layer has many location information. To reduce error rate of the object center point, we built a siamese network that extracts the distribution and location information of target objects. As a result of the experiment, the average center error rate was less than 25%.

RFID 망과 이동통신망의 연동 구조를 기반으로 한 위치기반서비스 모델 연구 (Location Service Model Based On Integrated Architecture of RFID Network and Cellular Network)

  • 엄정현;우시남;안순신
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2007년도 한국컴퓨터종합학술대회논문집 Vol.34 No.1 (D)
    • /
    • pp.100-104
    • /
    • 2007
  • 라디오 주파수를 이용하여 사물의 정보를 인식할 수 있는 RFID 기술은 다양한 분야에 활용되고 있는데 이러한 RFID 망을 All-IP 기반의 이동통신망과 연동할 경우 RFID의 각종정보와 휴대단말기의 위치정보 및 이동성, 그리고 다양한 IP 기반의 정보서버를 활용한 새로운 형태의 위치기반 서비스의 창출이 가능하다. 즉, RFID 태그에 태그 리더기 역할을 하는 단말기의 위치를 부여하고 이를 RFID 서버에서 지속적으로 관리함으로써 RFID 태그의 Code와 위치를 기반으로 한 위치기반서비스를 제공할 수 있다. 본 연구에서는 RFID망과 이동통신망의 연동을 기반으로 한 위치기반서비스 모델로 Mobile Information Retrieval Service (MIRS), Mobile Location Tracking Service (MLTS), Localization Service by Fixed Tag (LSFT) 세 가지 모델을 제시하였으며 이러한 서비스 모델은 실제 서비스를 개발하는데 있어 다양한 방식으로 활용될 수 있다.

  • PDF

Distributing Network Loads in Tree-based Content Distribution System

  • Han, Seung Chul;Chung, Sungwook;Lee, Kwang-Sik;Park, Hyunmin;Shin, Minho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권1호
    • /
    • pp.22-37
    • /
    • 2013
  • Content distribution to a large number of concurrent clients stresses both server and network. While the server limitation can be circumvented by deploying server clusters, the network limitation is far less easy to cope with, due to the difficulty in measuring and balancing network load. In this paper, we use two useful network load metrics, the worst link stress (WLS) and the degree of interference (DOI), and formulate the problem as partitioning the clients into disjoint subsets subject to the server capacity constraint so that the WLS and the DOI are reduced for each session and also well balanced across the sessions. We present a network load-aware partition algorithm, which is practicable and effective in achieving the design goals. Through experiments on PlanetLab, we show that the proposed scheme has the remarkable advantages over existing schemes in reducing and balancing the network load. We expect the algorithm and performance metrics can be easily applied to various Internet applications, such as media streaming, multicast group member selection.

Introducing 'Meta-Network': A New Concept in Network Technology

  • Gaur, Deepti;Shastri, Aditya;Biswas, Ranjit
    • Journal of information and communication convergence engineering
    • /
    • 제6권4호
    • /
    • pp.470-474
    • /
    • 2008
  • A well-designed computer network technology produces benefits on several fields within the organization, between the organizations(suborganizations) or among different organizations(suborganizations). Network technology streamlines business processes, decision process. Graphs are useful data structures capable of efficiently representing a variety of networks in the various fields. Metagraph is a like graph theoretic construct introduced recently by Basu and Blanning in which there is set to set mapping in place of node to node as in a conventional graph structure. Metagraph is thus a new type of data structure occupying its popularity among the computer scientists very fast. Every graph is special case of Metagraph. In this paper the authors introduce the notion of Meta-Networking as a new network technological representation, which is having all the capabilities of crisp network as well as few additional capabilities. It is expected that the notion of meta-networking will have huge applications in due course. This paper will play the role of introducing this new concept to the network technologists and scientists.

NAC(Network Access Control)을 이용한 컴퓨터 네트워크 보안 플랫폼 구성 (Computer Network Security Platform Configuration with NAC)

  • 노철우;강경태;이지웅;전재현
    • 한국콘텐츠학회:학술대회논문집
    • /
    • 한국콘텐츠학회 2009년도 춘계 종합학술대회 논문집
    • /
    • pp.8-11
    • /
    • 2009
  • 본 논문에서는 Extreme 스위치와 Cisco 라우터를 이용하여 가상의 네트워크를 구현하였으며 PIX 방화벽을 통해 외부 네트워크로부터의 보안을 강화하였고 내부 네트워크에 대한 보안 문제점은 802.1X 기반의 인증방식을 사용한 NAC를 적용시켜 구현함으로써 외부와 내부 네트워크의 통합적인 보안 플랫폼을 구성하였다.

  • PDF

분산 게이트웨이 환경에서의 Neural Network를 이용한 센서 데이터 할당 (Sensor Data Allocation using Neural Network in Distributed-Gateway System)

  • 이태호;김동현;이병준;김경태;윤희용
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2018년도 제58차 하계학술대회논문집 26권2호
    • /
    • pp.39-40
    • /
    • 2018
  • 본 논문에서는 IIoT(Industrial IoT) 환경의 분산 게이트웨이 시스템(Distributed-gateway System)에서 하위의 수 천 개 이상의 센서로부터 데이터를 전송받는 각 게이트웨이의 작업부하(Workload)를 감소시키고 데이터 처리 속도를 향상시키기 위하여 신경망(Neural network) 알고리즘을 이용한 센서 데이터 할당 기법을 소개한다. 각 센서의 중요도에 따른 Weight와 측정 간격에 따른 Bias를 설정하고 학습과정을 통해 Output weight를 산출하여 데이터를 효율적으로 게이트웨이에 할당시킴으로써 신뢰성과 정확성, 신속성을 확보한다.

  • PDF

Neural Network를 이용한 강화학습 기반의 잡샵 스케쥴링 접근법 (An Neural Network Approach to Job-shop Scheduling based on Reinforcement Learning)

  • 정현석;김민우;이병준;김경태;윤희용
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2018년도 제58차 하계학술대회논문집 26권2호
    • /
    • pp.47-48
    • /
    • 2018
  • 본 논문에서는 NP-hard 문제로 알려진 잡샵 스케쥴링에 대하여 강화학습적 측면에서 접근하는 방식에 대해 제안한다. 다양한 시간이 소요되는 업무들이 가지는 특징들을 최대한 state space aggregation에 고려하고, 이를 neural network를 통해 최적화 시간을 줄이는 방식이다. 잡샵 스케쥴링에 대한 솔루션은 미래에 대한 예측이 불가능하고 다양한 시간이 소요되는 스케쥴링 문제를 최적화하는 것에 대한 가능성을 제시할 것으로 기대된다.

  • PDF

Prevention of DDoS Attacks for Enterprise Network Based on Traceback and Network Traffic Analysis

  • Ma, Yun-Ji;Baek, Hyun-Chul;Kim, Chang-Geun;Kim, Sang-Bok
    • Journal of information and communication convergence engineering
    • /
    • 제7권2호
    • /
    • pp.157-163
    • /
    • 2009
  • With the wide usage of internet in many fields, networks are being exposed to many security threats, such as DDoS attack and worm/virus. For enterprise network, prevention failure of network security causes the revealing of commercial information or interruption of network services. In this paper, we propose a method of prevention of DDoS attacks for enterprise network based on traceback and network traffic analysis. The model of traceback implements the detection of IP spoofing attacks by the cooperation of trusted adjacent host, and the method of network traffic analysis implements the detection of DDoS attacks by analyzing the traffic characteristic. Moreover, we present the result of the experiments, and compare the method with other methods. The result demonstrates that the method can effectively detect and block DDoS attacks and IP spoofing attacks.

EBKCCA: A Novel Energy Balanced k-Coverage Control Algorithm Based on Probability Model in Wireless Sensor Networks

  • Sun, Zeyu;Zhang, Yongsheng;Xing, Xiaofei;Song, Houbing;Wang, Huihui;Cao, Yangjie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권8호
    • /
    • pp.3621-3640
    • /
    • 2016
  • In the process of k-coverage of the target node, there will be a lot of data redundancy forcing the phenomenon of congestion which reduces network communication capability and coverage, and accelerates network energy consumption. Therefore, this paper proposes a novel energy balanced k-coverage control algorithm based on probability model (EBKCCA). The algorithm constructs the coverage network model by using the positional relationship between the nodes. By analyzing the network model, the coverage expected value of nodes and the minimum number of nodes in the monitoring area are given. In terms of energy consumption, this paper gives the proportion of energy conversion functions between working nodes and neighboring nodes. By using the function proportional to schedule low energy nodes, we achieve the energy balance of the whole network and optimizing network resources. The last simulation experiments indicate that this algorithm can not only improve the quality of network coverage, but also completely inhibit the rapid energy consumption of node, and extend the network lifetime.

Capacity Analysis of UWB Networks in Three-Dimensional Space

  • Cai, Lin X.;Cai, Lin;Shen, Xuemin;Mark, Jon W.
    • Journal of Communications and Networks
    • /
    • 제11권3호
    • /
    • pp.287-296
    • /
    • 2009
  • Although asymptotic bounds of wireless network capacity have been heavily pursued, the answers to the following questions are still critical for network planning, protocol and architecture design: Given a three-dimensional (3D) network space with the number of active users randomly located in the space and using the wireless communication technology, what are the expected per-flow throughput, network capacity, and network transport capacity? In addition, how can the protocol parameters be tuned to enhance network performance? In this paper, we focus on the ultra wideband (UWB) based wireless personal area networks (WPANs) and provide answers to these questions, considering the salient features of UWB communications, i.e., low transmission/interference power level, accurate ranging capability, etc. Specifically, we demonstrate how to explore the spatial multiplexing gain of UWB networks by allowing appropriate concurrent transmissions. Given 3D space and the number of active users, we derive the expected number of concurrent transmissions, network capacity and transport capacity of the UWB network. The results reveal the main factors affecting network (transport) capacity, and how to determine the best protocol parameters, e.g., exclusive region size, in order to maximize the capacity. Extensive simulation results are given to validate the analytical results.