• Title/Summary/Keyword: Miss Korea

Search Result 313, Processing Time 0.061 seconds

A Survey on Qualitative Analysis of Directional VANET MAC Protocols

  • Kim, Bongjae;Cho, Kwangsu;Nam, Choonsung
    • International Journal of Contents
    • /
    • v.10 no.2
    • /
    • pp.9-17
    • /
    • 2014
  • Since vehicles' trajectories are so complex and dense traffic changes in nature frequently, the VANET (Vehicles Ad-hoc Network), using Omni-directional Antenna, has many channel collisions (or overlapping) on Data Link phrases (MAC layers). It is not easy to keep a good seamless communication status for VANET because of its unpredictable network environment. Among VANET research, Directional Antenna have been proposed as one of the most common systematical solutions to reduce (or to mitigate) this miss-communication problems by narrowing communicational ranges and making use of its customized error-detection process. However, even though Directional Antennas help VANET keep good seamless communication, many VANET researchers have reported that Directional VANET still has miss-communicational problems - this has lead to problems like 'Directional Hidden Terminal Problem', 'Deafness', 'Un-accuracy Lobe Scopes' and 'High Deployment Cost' being reported in various papers. To establish well-organized design assessments for a good Directional VANET MAC protocol to overcome these problems, we rearranged and grouped current Directional VANET' qualitative criteria from several current survey papers using these categories- 'Directional Discovery', 'Directional Forwarding' and 'Directional Handover'. In addition, based on the results of the following analysis, we show the essential design concerns that need to be looked at in order to develop a well-designed Directional-VANET MAC protocol.

A Hybrid Prefix Cashing Scheme for Efficient IP Address Lookup

  • Kim, Jinsoo;Kim, Junghwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.12
    • /
    • pp.45-52
    • /
    • 2015
  • We propose a hybrid prefix caching scheme to enable high speed IP address lookup. All prefixes loaded in a prefix cache should not be overlapped in address range for correct IP lookup. So, every non-leaf prefix needs to be expanded not so as to be overlapped. The shorter expanded prefix is more preferable because it can cover wider address range just as an single entry in a prefix cache. We exploits advantages of two dynamic prefix expansion techniques, bounded prefix expansion technique and bitmap-based prefix expansion technique. The proposed scheme uses dual bound values whereas just one bound value is used in bounded prefix expansion. Our elaborated technique make the dual bound values be associated with several subtries flexibly using bitmap information, rather than with fixed subtries. We evaluate the performance of the proposed scheme in terms of the average length of the expanded prefixes and cache miss ratio. The experiment results show the proposed scheme has lower cache miss ratio than other previous schemes including both bounded prefix expansion and bitmap-based expansion irrespective of the cache size.

An Implementation of Selection Algorithm for Efficient Scheduling on Real-Time Linux Environment (실시간 Linux 환경에서 효율적인 스케쥴링을 위한 선택 알고리즘의 구현)

  • 김성락
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.2
    • /
    • pp.1-8
    • /
    • 2002
  • By now, Schedulers for RMS and EDF are implemented for real-time Linux Scheduler. These Schedulers are used for do not consider there's characteristics. Missing Schedulability-test cause result that increase deadline miss rate. Also The present real-time Linux causes system halt Because of scheduling for unschedulable tasks . These appearances are very fatal for real-time system. Therefor, In this paper The peaceful schedulability-test use scheduler which is proper characteristics of RMS and EDF scheduling methods. This scheduler keeps deadline and eliminates system halt from scheduling unschedulable tasks. In this paper, we propose the schedulability-test algorithm and scheduler select algorithm for the effective management of tasks sets.

  • PDF

Aggressive Slack Reclamation for Soft Real-Time Task Scheduling (연성 실시간 태스크들의 스케줄링을 위한 적극적인 슬랙 재활용)

  • Kim Yong-Seok
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.2 s.308
    • /
    • pp.12-20
    • /
    • 2006
  • In scheduling of real-time tasks, the required hardware performance for a given set of tasks is determined based on the worst case execution time. For soft real-time tasks as multimedia applications, a lower performance hardware can service the tasks. Since the execution time of a task can vary in time, we can reclaim the slacks of early completed tasks for those of longer than average execution times. Then, the average ratio of deadline-miss can be lowered. This paper presents an algorithm, Aggressive Slack Reclamation (ASR), that tasks share slacks aggressively. A simulation result shows that ASR enhances the deadline-miss ratio and number of context switches than previous results.

Cache Algorithm in Reverse Connection Setup Protocol(CRCP) for effective Location Management in PCS Network (PCS 네트워크 상에서 효율적인 위치관리를 위한 역방향 호설정 캐쉬 알고리즘(CRCP)에 관한 연구)

  • Ahn, Yun-Shok;An, Seok;Bae, Yun-Jeong;Jo, Jea-Jun;Kim, Jae-Ha;Kim, Byung-Gi
    • Proceedings of the KIEE Conference
    • /
    • 1998.11b
    • /
    • pp.630-632
    • /
    • 1998
  • The basic user location strategies proposed in current PCS(Personal Communication Services) Network are two-level Database strategies. These Databases which exist in the Signalling network always maintain user's current location information, and it is used in call setup process to a mobile user. As the number of PCS users are increasing, this strategies yield some problem such as concentrating signalling traffic on the Database, increasing Call setup Delay, and so on. In this paper, we proposed RCP(Reverse Connection setup Protocol) model, which apply RVC(Reverse Virtual Call setup) algorithm to PCS reference model, and CRCP(Cache algorithm in RCP) model, which adopt Caching strategies in the RCP model. When Cache-miss occur, we found that CRCP model require less miss-penalty than PCS model. Also we show that proposed models are always likely to yield better performance in terms of reduced Location Tracking Delay time.

  • PDF

"Nasty Old Cats": Sexual Politics of Spinster Detective Fiction ("거슬리는 늙은 고양이들" -노처녀탐정 추리소설의 성정치학)

  • Gye, Joengmeen
    • Journal of English Language & Literature
    • /
    • v.59 no.4
    • /
    • pp.511-526
    • /
    • 2013
  • Focusing on Anna Katharine Green's Amelia Butterworth series and Agatha Christie's Miss Marple mysteries, this paper aims to examine the contradictory representation of a detective in spinster detective fiction. The spinster detective fiction reveals distinct ways of representing a female detective from the earlier woman detective fiction. Unlike the earlier woman detective represented as submissive and desperate for survival, a spinster detective is a wealthy, intelligent, brave, and independent woman from an upper class family. Since a spinster detective's attributes honor such masculine qualities as independence, intelligence, courage, and capacity for leadership, the spinster detective fiction has a possibility to threaten the established patriarchal authority. The possibility of gender disruption in the spinster detective fiction is, however, contained by the spinster's marginal position in the patriarchal system. Since a spinster exists outside the normal expectation of a woman's life in patriarchal society, a spinster detective creates no conflict with the dominant gender ideology. Furthermore, a spinster detective is represented as a conservative elderly woman expressing reactionary views on social, political issues including women's problems. The spinster detective fiction reinforces the established gender norms rather than challenges and questions them.

Feature Extraction for Vision Based Micromanipulation

  • Jang, Min-Soo;Lee, Seok-Joo;Park, Gwi-Tae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.41.5-41
    • /
    • 2002
  • This paper presents a feature extraction algorithm for vision-based micromanipulation. In order to guarantee of the accurate micromanipulation, most of micromanipulation systems use vision sensor. Vision data from an optical microscope or high magnification lens have vast information, however, characteristics of micro image such as emphasized contour, texture, and noise are make it difficult to apply macro image processing algorithms to micro image. Grasping points extraction is very important task in micromanipulation because inaccurate grasping points can cause breakdown of micro gripper or miss of micro objects. To solve those problems and extract grasping points for micromanipulation...

  • PDF