• Title/Summary/Keyword: 특정 지속시간

Search Result 204, Processing Time 0.022 seconds

A New RED Algorithm Adapting Automatically in Various Network Conditions (다양한 네트워크 환경에 자동적으로 적응하는 RED 알고리즘)

  • Kim, Dong-Choon
    • Journal of Advanced Navigation Technology
    • /
    • v.18 no.5
    • /
    • pp.461-467
    • /
    • 2014
  • Active queue management (AQM) algorithms run on routers and detect incipient congestion by typically monitoring the instantaneous or average queue size. When the average queue size exceeds a certain threshold, AQM algorithms infer congestion on the link and notify the end systems to back off by proactively dropping some of the packets arriving at a router or marking the packets to reduce transmission rate at the sender. Among the existing AQM algorithms, random early detection (RED) is well known as the representative queue-based management scheme by randomizing packet dropping. To reduce the number of timeouts in TCP and queuing delay, maintain high link utilization, and remove bursty traffic biases, the RED considers an average queue size as a degree of congestions. However, RED do not well in the specified networks conditions due to the fixed parameters($P_{max}$ and $TH_{min}$) of RED. This paper addresses a extended RED to be adapted in various networks conditions. By sensing network state, $P_{max}$ and $TH_{min}$ can be automatically changed to proper value and then RED do well in various networks conditions.

A Rule-Based Database Verification System Based on the Integrity Constranints (무결성 제약에 기초한 규칙 기반 데이타베이스 검증 시스템)

  • Ryu, Myeong-Chun;Park, Chang-Hyeon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.1
    • /
    • pp.77-86
    • /
    • 1996
  • In managing a certain database, the integrity of data is very important. The important. The integrity constrains thus should be considered carefully when a database is designed and, after the database is created, it is required for a database manager to check continuously if some data contained in the database violate the integrity constraints considered. It is however not easy to check the violateion of integrity constraints when the size and the complexity of database are increased. This paper suggests a rule-based database verification system to relax the difficulty of checking the integrity violation, in which a database is coupled with a rule-based system including the knowledge about the integrity constraints. The rule-database verification system suggested accepts the model descriptions of an application domain, generates the knowledge base consisting of rules and facts by analyzing the model description and proceeds the verification process to check the integrity of the database.

  • PDF

A Study on the Thesaurus Construction Using the Topic Map (토픽맵을 이용한 시소러스의 구조화 연구)

  • Nam, Young-Joon
    • Journal of the Korean Society for information Management
    • /
    • v.22 no.3 s.57
    • /
    • pp.37-53
    • /
    • 2005
  • The terminology management is absolutely necessary for maintaining the efficiency of thesaurus. This is because the creating, differentiating, disappearing, and other processes of the descriptor become accomplished dynamically, making effective management of thesaurus a very difficult task. Therefore, a device is required for accomplishing methods to construct and maintain the thesaurus. This study proposes the methods to construct the thesaurus management using the basic elements of a topic map which are topic, occurrence, and association. Second, the study proposes the methods to represent the basic and specific instances using the systematic mapping algorithm and merging algorithm. Also, using a hub document as a standard, this study gives the methods to expand and subsitute the descriptors using the topic type. The new method applying fixed concept for double layer management on terms is developed, too. The purpose of this method is to fix the conceptual term which represents independent concept of time and space, and to select the descriptor freely by external information circumstance.

Cinematic Methods of Expression in The Film (영화 <어톤먼트>에 나타난 영상표현방법)

  • Yoon, Soo-In
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.9
    • /
    • pp.569-579
    • /
    • 2016
  • , 2007 firm by Joe Wright, deals with tragic love of Cecilia and Robbie. While the 2001 novel of the same name focuses on Briony narrative the movie is seen through romantic relationship of two lovers. However, Briony's narrative in the movie helps to accent the two's love story. The director's emphasis on the love story is unfortunately from Briony tragic story. The continuous build up of misunderstanding and irreconcilable regrets begins to materialize and explodes in the middle of the film. The director manages to use just one day and uses the same location to illustrate the background of the characters as well as build up of the plot's misunderstanding. The study will focus on the beginning of the film that enabled the beautiful love story through effect and symbolic visual expression and techniques- especially the use of mise-en-scene, camera movement, framing, and lighting and how it emphasis and use of specific color and sound.

Scalable Re-detection for Correlation Filter in Visual Tracking

  • Park, Kayoung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.7
    • /
    • pp.57-64
    • /
    • 2020
  • In this paper, we propose an scalable re-detection for correlation filter in visual tracking. In real world, there are lots of target disappearances and reappearances during tracking, thus failure detection and re-detection methods are needed. One of the important point for re-detection is that a searching area must be large enough to find the missing target. For robust visual tracking, we adopt kernelized correlation filter as a baseline. Correlation filters have been extensively studied for visual object tracking in recent years. However conventional correlation filters detect the target in the same size area with the trained filter which is only 2 to 3 times larger than the target. When the target is disappeared for a long time, we need to search a wide area to re-detect the target. Proposed algorithm can search the target in a scalable area, hence the searching area is expanded by 2% in every frame from the target loss. Four datasets are used for experiments and both qualitative and quantitative results are shown in this paper. Our algorithm succeed the target re-detection in challenging datasets while conventional correlation filter fails.

An Efficient Network Resource Reservation Mechanism with Mobility in Nested Heterogeneous Mobile Networks (중첩 이종 무선 망 환경에서 단말의 이동 속도를 고려한 효과적인 망 자원 예약)

  • Park, In-Soo;Tak, Dong-Kuk;Kim, Won-Tae;Park, Yong-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.83-98
    • /
    • 2007
  • The handover between different radio access networks, especially where their coverage overlaps, suffers various complications since the different access networks provide different service characteristics. One way to reduce service interruptions and QoS (i.e., bandwidth, throughput, delay) degradations during the inter-technology handover is to reserve the required resource in advance. The resource reservation algorithm should minimize the handover latency and maximize the resource utilization based on the accurate estimation on mobile's location, velocity, movement pattern and service requirements. In this paper, we propose a resource reservation algorithm based on the mobile terminal velocity and the cell selection probability, which maximizes resource utilization ana reduces network overhead. We compare the proposed algorithm with PMS(Predictive Mobility Support) and VCDS(Velocity and Call Duration Support scheme) based on 3-layer network model under various scenarios.

An Improved Tracking Parameter File Generation Method using Azimuth Fixing Method (방위각 고정 기법을 이용한 개선된 Tracking Parameter File 생성 방법)

  • Jeon, Moon-Jin;Kim, Eunghyun;Lim, Seong-Bin
    • Aerospace Engineering and Technology
    • /
    • v.12 no.2
    • /
    • pp.1-6
    • /
    • 2013
  • A LEO satellite transmits recorded images to a ground station using an X-band antenna during contact. The X-band antenna points to the ground station according to a TPF (tracking parameter file) during communication time. A TPF generation software generates azimuth and elevation profile which make the antenna point to the ground station using satellite orbit and attitude information and mission information including recording and downlink operation. When the satellite passes above the ground station, azimuth velocity increases rapidly so that jitter may occur if the azimuth velocity is in specific range. In case of realtime mission in which the satellite perform recording and downlink simultaneously, azimuth velocity must be lower than specific value to prevent image blur due to jitter effect. The method to point one virtual ground station has limitation of azimuth velocity reduction. In this paper, we propose the azimuth fixing method to reduce azimuth velocity of X-band antenna. The experimental results show that azimuth velocity of the X-band antenna is remarkably reduced using proposed method.

Optimal path planning and analysis for the maximization of multi UAVs survivability for missions involving multiple threats and locations (다수의 위협과 복수의 목적지가 존재하는 임무에서 복수 무인기의 생존율 극대화를 위한 최적 경로 계획 및 분석)

  • Jeong, Seongsik;Jang, Dae-Sung;Park, Hyunjin;Seong, Taehyun;Ahn, Jaemyung
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.43 no.6
    • /
    • pp.488-496
    • /
    • 2015
  • This paper proposes a framework to determine the routes of multiple unmanned aerial vehicles (UAVs) to conduct multiple tasks in different locations considering the survivability of the vehicles. The routing problem can be formulated as the vehicle routing problem (VRP) with different cost matrices representing the trade-off between the safety of the UAVs and the mission completion time. The threat level for a UAV at a certain location was modeled considering the detection probability and the shoot-down probability. The minimal-cost path connecting two locations considering the threat level and the flight distance was obtained using the Dijkstra algorithm in hexagonal cells. A case study for determining the optimal routes for a persistent multi-UAVs surveillance and reconnaissance missions given multiple enemy bases was conducted and its results were discussed.

Review of Hazard Test of Combustion Gas and Exhaust Temperature of Acrylic Fire Protection Paint (아크릴계 내화도료 연소가스의 유해성 평가와 배기온도에 대한 고찰)

  • Jeon, Soo-Min;Kim, Jae-Jun
    • Fire Science and Engineering
    • /
    • v.31 no.4
    • /
    • pp.1-6
    • /
    • 2017
  • A fire resistance certification needs to be obtained before fire protection paint can be used in Korea. In the case of paint, the tests for certification are fire, gas hazard and bond strength. According to the hazard test standard of combustion gas, 16 mice are sacrificed every test. Therefore, there are ethical problems for the experimenter and legal problems for the laboratory. Accordingly, many alternatives are being assessed, such as combustion gas analysis, but they have not replaced animal testing yet. With gas hazard testing, the exhaust gas temperature can be measured. The property of the initial reaction of a specific fire paint can be characterized by this temperature. The purpose of this study was to consider the improvement point for a gas hazard test through comparative analysis of the exhaust temperature and the time of death of the mice.

Graph-Based Word Sense Disambiguation Using Iterative Approach (반복적 기법을 사용한 그래프 기반 단어 모호성 해소)

  • Kang, Sangwoo
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.13 no.2
    • /
    • pp.102-110
    • /
    • 2017
  • Current word sense disambiguation techniques employ various machine learning-based methods. Various approaches have been proposed to address this problem, including the knowledge base approach. This approach defines the sense of an ambiguous word in accordance with knowledge base information with no training corpus. In unsupervised learning techniques that use a knowledge base approach, graph-based and similarity-based methods have been the main research areas. The graph-based method has the advantage of constructing a semantic graph that delineates all paths between different senses that an ambiguous word may have. However, unnecessary semantic paths may be introduced, thereby increasing the risk of errors. To solve this problem and construct a fine-grained graph, in this paper, we propose a model that iteratively constructs the graph while eliminating unnecessary nodes and edges, i.e., senses and semantic paths. The hybrid similarity estimation model was applied to estimate a more accurate sense in the constructed semantic graph. Because the proposed model uses BabelNet, a multilingual lexical knowledge base, the model is not limited to a specific language.