• Title/Summary/Keyword: list

Search Result 4,273, Processing Time 0.027 seconds

Annotated List of the Korean Triphoridae (Gastropoda), with a New Record of Mastonia rubra

  • Lee, Yucheol;Shin, Youngheon;Park, Jina;Park, Joong-Ki
    • Animal Systematics, Evolution and Diversity
    • /
    • v.34 no.3
    • /
    • pp.168-173
    • /
    • 2018
  • The family Triphoridae Gray, 1847 is a group of marine microgastropods characterized by sinistral (left-coiled) shells except for the subfamily Metaciinae, which has dextral shell coiling. We report a new record of Mastonia rubra (Hinds, 1843) collected from the intertidal zone from Jeju Island, Korea and revise species list for Korean Triphoridae species. Mastonia rubra is distinguished from Inforis fusiformis(Kosuge, 1961) by the purple color of the first and second whorls of the teleoconch, whereas they are light colored and nearly white corresponding whorls in I. fusiformis. Including this new record, the Korean Triphoridae comprises 20 species from 15 genera.

Excluding Technique Design for Duplicated Results of Search (검색엔진의 중복된 검색결과 배제 기법설계)

  • Lee Seo-Jeong
    • Journal of Digital Contents Society
    • /
    • v.2 no.2
    • /
    • pp.139-145
    • /
    • 2001
  • As e-commerce has been activated and internet has been used as usual, higher efficient search engine must be used to promote the value of information and take possession of the market place. all e-commerce user seller and buyer want to competitive goods Although these needs, search results are still much to be desired. In this paper, I will suppose two ideas which are abbreviation result and making blacklist. Abbreviation result is to hide results with common factors and making blacklist is to reduce null links of search results, which makes many useless results. This routine is made of making blacklist, check list, reduce list and append list.

  • PDF

UIL:A Novel Indexing Method for Spatial Objects and Moving Objects

  • Huang, Xuguang;Baek, Sung-Ha;Lee, Dong-Wook;Chung, Weon-Il;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.2
    • /
    • pp.19-26
    • /
    • 2009
  • Ubiquitous service based on Spatio-temporal dataspaces requires not only the moving objects data but also the spatial objects. However, existing methods can not handle the moving objects and spatial objects together. To overcome the limitation of existing methods, we propose a new index structure called UIL (Union Indexing Lists) which contains two parts: MOL (Moving Object List) and SOL (Spatial Object List) to index the moving objects and spatial objects together. In addition, it can suppose the flexible queries on these data. We present the results of a series of tests which indicate that the structure perform well.

  • PDF

List of Korean Species of Freshwater Rotifera (한국 담수산 윤형동물의 총목록)

  • 송민옥
    • Animal Systematics, Evolution and Diversity
    • /
    • v.5 no.2
    • /
    • pp.257-268
    • /
    • 1989
  • Hada(1936) reported thelist of 14 species of Korean freshwater Rotifer for the first time. Since his report, there have been no taxonomic studies on the Korean except some sporadical reports which contained lists of species as a partial result of limnological study. The author made a list of 145 species of Korean freshwater Rotifera reported until 1988 with reference as convenient compendium for further taxonomic research.

  • PDF

An Efficient List Scheduling Algorithm for Multiprocesor Systems (다중 처리기 시스템을 위한 효율적인 리스트 스케줄링 알고리듬)

  • Park, Gyeong-Rin;Chu, Hyeon-Seung;Lee, Jeong-Hun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.7
    • /
    • pp.2060-2071
    • /
    • 2000
  • Scheduling parallel tasks, represented as a Directed Acyclic Graph (DAG) or task graph, on a multiprocessor system has been an important research area in the past decades. List scheduling algorithms assign priorities to a node or an edge in an input DAG, and then generate a schedule according to the assigned priorities. This appear proposes a list scheduling algorithms with effective method of priority assignments. The paper also analyzes the worst case performance and optimality condition for the proposed algorithm. The performance comparison study shows that the proposed algorithms outperforms existing scheduling algorithms especially for input DAGs with high communication overheads. The performance improvement over existing algorithms becomes larger as the input DAG becomes more dense and the level of parallelism in the DAG is increased.

  • PDF

Design of Reference Picture List Based on GPB for DPB of Scalable Multi-view Video Coding (스케일러블 다시점 비디오 부호화의 DPB를 위한 GPB 기반의 Reference Picture List 설계)

  • Jung, Tae-Jun;Lee, Hong-rae;Kim, Chang Ki;Seo, Kwang-dook
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2013.11a
    • /
    • pp.178-181
    • /
    • 2013
  • 본 논문에서는 SVC와 MVC의 부호화 구조를 결합하여 구현된 스케일러블 다시점 비디오 부호화의 움직임 추정 기법과 DPB를 위한 GPB 기반의 RPL (reference picture list) 설계를 제안한다. 제안된 움직임 추정 기법에서는 부호화 과정에서 필요한 예측 부호화의 성능 향상을 위해서 서로 다른 시점 (view)의 픽처 정보를 참조픽처의 후보로서 사용한다. 또한, B픽처 예측의 경우 HEVC에서 사용하는 HEVC GPB 기술을 통해 참조화면에서 두 개의 움직임 벡터를 활용한다. 제안된 움직임 예측 구조에 의해서 압축된 비디오 데이터의 크기를 감소시켜 압축 효율을 증대시킬 수 있다. 다양한 실험을 통해서 제안된 예측 구조를 적용함으로써 스케일러블 다시점 비디오 부호화에서의 압축 효율의 향상을 얻어낼 수 있음을 확인하였다.

  • PDF

Economic Design of Tree Network Using Tabu List Coupled Genetic Algorithms (타부 리스트가 결합된 유전자 알고리즘을 이용한 트리형 네트워크의 경제적 설계)

  • Lee, Seong-Hwan;Lee, Han-Jin;Yum, Chang-Sun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.35 no.1
    • /
    • pp.10-15
    • /
    • 2012
  • This paper considers an economic design problem of a tree-based network which is a kind of computer network. This problem can be modeling to be an objective function to minimize installation costs, on the constraints of spanning tree and maximum traffic capacity of sub tree. This problem is known to be NP-hard. To efficiently solve the problem, a tabu list coupled genetic algorithm approach is proposed. Two illustrative examples are used to explain and test the proposed approach. Experimental results show evidence that the proposed approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic algorithm approach.

Research on optimal FCL (Frequently Called List) table sizes in a circuit-switched network including wireless subscribers (무선 가입자를 포함한 회선교환망에서의 최적의 FCL (Frequently Called List) 테이블 크기에 관한 연구)

  • 김재현;이종규
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.10
    • /
    • pp.1-9
    • /
    • 1994
  • In this paper, we have studied optimal FCL(Frequently Called List) table sizes in a grid topology circuit-switched network including wireless subscribers. The FCL table gives the position information of a destination subscriber for a call. When the call is generated in a node, this call is routed by the referenced position information of the destination subscriber in FCL table. In this paper, we have proposed an efficient routing algorithm, mixed FSR(Flood Search Routing) and DAR(Dynamic Adaptive Routing), considering moving wireless subscribers. Also, we have simulated hit ratio and incorrect ratio as performance parameters, consequently proposed the object function composed of table search time, hit ratio, incorrect ratio, FSR time and DAR time, and derived the optimal FCL table size by using it.

  • PDF

A Certificate Revocation List Distribution Scheme over the eMBMS for Vehicular Networks

  • Kim, Hyun-Gon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.10
    • /
    • pp.77-83
    • /
    • 2016
  • To verify the trustworthiness of messages, public key certificates and certificate revocation list(CRL) has been standardized for vehicular networks. However, timely distribution of large CRLs to vehicles should be more elaborated with low bandwidth utilization from a practical point of view. To address this concern, we propose a CRL distribution scheme using long term evolution(LTE) point-to-multicast transmission, namely the enhanced multimedia broadcast multicast service(eMBMS). The schem is much more resource efficient than the existing unicast CRL distribution schemes for vehicular networks and it allows realizing the regional CRL distribution schemes efficiently in LTE network. By means of ns-3 simulation, we analyze the performance, latency, and execution time of the scheme in terms of varying coverage of the multimedia broadcast multicast service over single frequency network (MBFSN).

A Novel Certificate Revocation List Distribution for Vehicle Communications in Mobile Communication Networks

  • Dan, Du Anh;Kim, Hyun-Gon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.12
    • /
    • pp.109-116
    • /
    • 2017
  • Short-lived pseudonym certificates as vehicle identities could satisfy both security and privacy requirements. However, to remove revoked certificates especially in vehicle communications, pseudonym certificate revocation list (CRL) should be distributed resource-efficiently from a practical deployment point of view and in a timely manner. In this paper, we propose a novel CRL distribution scheme capable of CRL multicast to only activated vehicles registered to the CRL multicast group using the group communication system enabler, namely, the GCSE which is being standardized. The scheme is resource efficient by using CRL distribution paths instead of paging processes to find out multicast vehicle(s) within a certain region. The analyzed results show that the proposed scheme outperforms in terms of paging cost, packets transmission cost, and the processing cost at the respective entities compared to the existing four schemes in the literature.