• 제목/요약/키워드: Hop

검색결과 1,600건 처리시간 0.034초

Cascaded-Hop For DeepFake Videos Detection

  • Zhang, Dengyong;Wu, Pengjie;Li, Feng;Zhu, Wenjie;Sheng, Victor S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권5호
    • /
    • pp.1671-1686
    • /
    • 2022
  • Face manipulation tools represented by Deepfake have threatened the security of people's biological identity information. Particularly, manipulation tools with deep learning technology have brought great challenges to Deepfake detection. There are many solutions for Deepfake detection based on traditional machine learning and advanced deep learning. However, those solutions of detectors almost have problems of poor performance when evaluated on different quality datasets. In this paper, for the sake of making high-quality Deepfake datasets, we provide a preprocessing method based on the image pixel matrix feature to eliminate similar images and the residual channel attention network (RCAN) to resize the scale of images. Significantly, we also describe a Deepfake detector named Cascaded-Hop which is based on the PixelHop++ system and the successive subspace learning (SSL) model. By feeding the preprocessed datasets, Cascaded-Hop achieves a good classification result on different manipulation types and multiple quality datasets. According to the experiment on FaceForensics++ and Celeb-DF, the AUC (area under curve) results of our proposed methods are comparable to the state-of-the-art models.

M-hop 가상경로 흐름제어기법을 이용한 부하의 변화에 따른 효율 및 시간지연의 관계 비교 (A Comparison of the Relationship between the Time Delay and Throughput using the M-hop Virtual Route Pacing Control Mechanism)

  • 이훈;정필원
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
    • /
    • pp.962-964
    • /
    • 1987
  • In this paper a virtual route pacing control mechanism is introduced to the flow control of M-hop virtual route in the packet data network. The results described in this paper show us a comparison of the relationship between the throughput and the time-delay with the variation of the parameter, the normalized applied load. for the fixed window size.

  • PDF

차륜 진동을 고려한 능동 현가계 제어 (Control of Active Suspension System Considering Wheel-Hop)

  • 이동락;한기봉;이시복
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 1994년도 추계학술대회 논문집
    • /
    • pp.420-424
    • /
    • 1994
  • In this paper, an active suspension system considering the wheel hop is studied for a quarter car model. A LQ controller controls an active suspension system in which a vibration absorber is attached to the wheel axis. The vibration absorber is adopted to reduce the vibration near the natural frequency of the unsprung mass, and the LQ controller is used to control the vibration near the natural frequency of the sprung mass. The perfomance of the control system considering the wheel hop is compared with that of a LQ control system.

  • PDF

호프 왜화바이로이드 Kh 계통 (HSVd-Kh)의 염기서열 (Nucleotide Sequence of Hop Stunt Viroid Kh Strain (HSVd-Kh))

  • 이재열;김경숙;정동수
    • 한국식물병리학회지
    • /
    • 제14권6호
    • /
    • pp.612-613
    • /
    • 1998
  • The nucleotide sequence of hop stunt viroid HHSVd) Kh strain was sequenced by the reverse transcription and polymerase chain reaction. It consists of 296 nucleotides, and differs by one nucleotide deletion of cytosine at the position of 295 from the HSVd-K strain which consists of 297 nucletoides.

  • PDF

무선 Ad-­hoc망에서 N­-hop 기반의 효율적 Flooding 기법 (An Efficient Flooding Scheme of N-­hop base in Mobile Ad hoc Networks)

  • 최종혁;한승진;오임걸;이균하
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2003년도 가을 학술발표논문집 Vol.30 No.2 (3)
    • /
    • pp.442-444
    • /
    • 2003
  • Ad­hoc망은 기존 유선 및 무선망과 같이 안정된(고정된) 하부구조를 필요로 하지 않는 무선 단말들의 그룹으로 구성된 네트워크이다. 현재 라우팅을 위해 제시된 on­demand 방식의 라우팅 프로토콜은 이동성에 따른 신뢰도를 높이기 위해 flooding을 수행하는데, 이동성이 커질 경우 경로발견과 이를 유지하기 위한 오버 헤드가 크다. 따라서 본 논문에서는 각 노드의 다양한 이동성향이 설정된 노드간의 경로유지에 영향을 적게 미치도록 하고 오버헤드가 적은 경로설정을 위한 N­hop기반의 효율적인 flooding 기법을 제안하고 노드 이동성에 따른 최적의 N값을 제시한다.

  • PDF

블루투스 베이스밴드 홉 시퀀스의 효율적 구현 방안 (The efficient implementation of the Hop Sequence in Bluetooth Baseband)

  • 김현미;김진숙;임재윤
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
    • /
    • pp.299-302
    • /
    • 2002
  • This paper has been understanded the whole concept of hop sequence in bluetooth baseband and studied algorithm of its each type. It is implemented and verified both hardware and firmware of hop sequence according to Sepcification ver.1.1, and compared and examined two schemes with performance, size, cost, and time-to-market, etc. This paper is suggested that it is the efficient system division to design optimum system depending on developing environment.

  • PDF

MIMO Ad Hoc Networks: Medium Access Control, Saturation Throughput, and Optimal Hop Distance

  • Hu, Ming;Zhang, Junshan
    • Journal of Communications and Networks
    • /
    • 제6권4호
    • /
    • pp.317-330
    • /
    • 2004
  • In this paper, we explore the utility of recently discovered multiple-antenna techniques (namely MIMO techniques) for medium access control (MAC) design and routing in mobile ad hoc networks. Specifically, we focus on ad hoc networks where the spatial diversity technique is used to combat fading and achieve robustness in the presence of user mobility. We first examine the impact of spatial diversity on the MAC design, and devise a MIMO MAC protocol accordingly. We then develop analytical methods to characterize the corresponding saturation throughput for MIMO multi-hop networks. Building on the throughout analysis, we study the impact of MIMO MAC on routing. We characterize the optimal hop distance that minimizes the end-to-end delay in a large network. For completeness, we also study MAC design using directional antennas for the case where the channel has a strong line of sight (LOS) component. Our results show that the spatial diversity technique and the directional antenna technique can enhance the performance of mobile ad hoc networks significantly.

SIP 프로토콜을 기반으로한 VOIP 네트워크를 위한 Secure Framework (Secure Framework for SIP-based VoIP Network)

  • 한경헌;최성종;최동유;배용근
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2008년도 춘계종합학술대회 A
    • /
    • pp.295-297
    • /
    • 2008
  • Session Initiation Protocol (SIP) has become the call control protocol of choice for Voice over IP (VoIP) networks because of its open and extensible nature. However, the integrity of call signaling between sites is of utmost importance, and SIP is vulnerable to attackers when left unprotected. Currently a hop-by-hop security model is prevalent, wherein intermediaries forward a request towards the destination user agent server (UAS) without a user agent client (UAC) knowing whether or not the intermediary behaved in a trusted manner. This paper presents an integrated security model for SIP-based VoIP network by combining hop-by-hop security and end-to-end security.

  • PDF

멀티홉 센서 네트워크에서 에너지 상황을 고려한 시스템 수명 최대화 알고리즘 (Energy-Aware System Lifetime Maximization Algorithm in Multi-Hop Sensor Network)

  • 김태림;김범수;박화규
    • 대한임베디드공학회논문지
    • /
    • 제8권6호
    • /
    • pp.339-345
    • /
    • 2013
  • This paper addresses the system lifetime maximization algorithm in multi-hop sensor network system. A multi-hop sensor network consists of many battery-driven sensor nodes that collaborate with each other to gather, process, and communicate information using wireless communications. As sensor-driven applications become increasingly integrated into our lives, we propose a energy-aware scheme where each sensor node transmits informative data with adaptive data rate to minimize system energy consumption. We show the optimal data rate to maximize the system lifetime in terms of remaining system energy. Furthermore, the proposed algorithm experimentally shows longer system lifetime in comparison with greedy algorithm.

Performance of Prioritized Service Discipline Based on Hop Count for Optical Burst Switched Networks

  • 김동옥
    • 정보통신설비학회논문지
    • /
    • 제6권3호
    • /
    • pp.1-7
    • /
    • 2007
  • In this paper, we propose a new prioritized Optical Burst Switching (OBS) protocol based on a hop count, which can provide efficient utilization in optical networks. Under several legacy schemes, a switch drops the burst with the shortest time regardless of its traversed hop count. As a result, a dropped burst that have been traversed many hops might cause increased bandwidth waste compared to one that has traversed a few hops. To improve this problem, we propose the Just Enough Time (JET) with a hop counting scheme which can reduce the wasted bandwidth by prioritizing the burst traversed many hops over others. From the simulation result, it is preyed, we show that the proposed scheme has advantages against legacy schemes in terms of the burst blocking probability and the link utilization.

  • PDF