• Title/Summary/Keyword: Valid and Invalid

Search Result 67, Processing Time 0.025 seconds

Trematodes of the family Opisthorchiidae: a minireview

  • King, Sandie;Scholz, Tomas
    • Parasites, Hosts and Diseases
    • /
    • v.39 no.3
    • /
    • pp.209-221
    • /
    • 2001
  • Examination of the original descriptions of genera placed within the family Oposthorchiidae has revealed that only 33 of the original 43 genera are valid members of this family Further study of these descriptions should also reveal that many of the subfamilies are also invalid. With reference to the original descriptions of these genera, and subsequent literature, a brief survey of the family has been compiled. Information on the spectrum of definitive hosts that these helminths parasitize is provided, as well as information on the life cycles, geographic distribution, and socioeconomic impacts of the family. More in-depth information is given on those species that are of particular medical importance; namely, Clonorchis sinensis, Opisthorchis viverrini and O. felineus. The final aims of this review are to provide information on the entire genera of the family Opisthorchiidae, which will aid understanding of the phylogenetic relationships not only within the family, but also within the Class Trematoda.

  • PDF

Design of Flash Memory Cleaning Policy based on Writing Patterns (쓰기 패턴 기반 플래시 메모리 지움 정책 설계)

  • Kang Seong-Goo;Noh Han-Young;Ko Kwang-Sun;Eom Young-Ik
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.05a
    • /
    • pp.1333-1336
    • /
    • 2006
  • 본 논문에서는 최근에 각광받고 있는 저장장치인 플래시 메모리의 특징과 플래시 메모리의 단점인 지움 횟수 제한과 느린 지움 속도를 극복하는 지움 정책의 종류를 살펴보고 그 중에서 CAT 기법의 랜덤 쓰기에서의 지움 횟수 증가와 지움 평준화를 위한 비효율성이라는 단점을 개선한 지움 정책을 제시한다. 개선된 지움 정책은 CAT 기법에 쓰기 패턴을 기반한 가중치를 부여해 랜덤 쓰기에서의 성능 하락과 지움 평준화의 비효율성을 보완하는 것이다. 이 때 사용되는 사용자의 쓰기 패턴 파악은 유효한(valid) 데이터 블록과 유효하지 않은(invalid) 데이터 블록의 리스트를 만들어 그 시간 값의 평균을 이용한다.

  • PDF

Validating the Applicability of a Simplified Correlation Method for Economic Evaluation of Cooling Plants (냉방열원기기의 경제성 평가를 위한 간이계산법의 적용성 검토)

  • 김영섭;김강수
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.14 no.10
    • /
    • pp.854-862
    • /
    • 2002
  • In the previous research, a simplified correlation method was developed as an easy prediction tool for comparing energy use of cooling plants. The purpose of this paper is to test the applicability of this method for economic evaluation with two zones of a 20-story commercial building in Seoul. The results of this method were compared with the DOE-2 simulation and actual measured data. Then, Comparisons of life cycle cost were carried out for three types of cooling plants. Testing of one zone showed good agreement of within 10% error in cooling energy use and within 2% error in LCC. But testing of the other zone indicated that the use of this method were invalid when input variables were used beyond its valid range.

The effect of Inhibition of Return on the spatial location of Focused-Attention (초점 주의의 공간 위치가 회귀억제에 미치는 영향)

  • 박찬희;심혜영;홍철운;김남균
    • Proceedings of the Korean Society for Emotion and Sensibility Conference
    • /
    • 2001.05a
    • /
    • pp.293-297
    • /
    • 2001
  • 본 연구는 공간상에서 초점 주의의 공간 위치가 인간의 감각 운동 협응에 의한 회귀억제에 미치는 영향을 정량적으로 분석하기 위하여 수행되었다. 본 실험은 20∼25세 나이의 성인 남·여를 대상으로 하였고, 자체 제작한 방음 암실에서 실시되었다. 지금까지의 회귀억제는 위치와 시간에 관련된 특이한 현상이라고 정의되어 왔다. 그러나 본 실험에서는 피험자의 주의가 집중되어 있는 공간에서는 시간에 관계없이 일어나지 않지만 피험자의 주의가 분산되었을 경우는 한 번 집중된 공간으로 주의를 옮기기가 어려운 회귀억제 현상이 일어났다. 본 연구에서는 회귀억제는 조건에 따라서는 자극 제시 간격(SOA)과 무관하며 초짐 주의 공간 위치와 관련된 현상임을 정량적으로 평가하였다.

  • PDF

Overlooked and invalidly published names of Korean woody plants (비합법적으로 발표된 국내 목본식물의 학명)

  • Chang, Chin-Sung;Kim, Hui
    • Korean Journal of Plant Taxonomy
    • /
    • v.32 no.3
    • /
    • pp.363-371
    • /
    • 2002
  • Several people called our attention to two books in which many new name were made by T. Nakai. Upon checking Mori and Handbook of Korea-Mandschurian Forestry, we found that there were more than 50 apparently overlooked and naked names for the Korean woody plants. Also, new combinations or avowed substitutes of some woody plants by several authors (Y. Lee, T. Lee and W. Lee) based on previously and validly published names were not validly published because their basionyms or the replaced synonyms were not clearly indicated and a full and direct reference was not given to their authors and places of valid publications, with pages or plate references and dates. These names should not be used any more. We consider it useful to summarize the results of this preliminary investigation and invalid names of woody plants are enlisted here. Hopefully, this note will alert other researchers to look into these works for other herbaceous Korean plants.

Fast Motion Estimation Using Multiple Reference Pictures In H.264/Avc (H.264/AVC에서 다중 참조 픽처를 이용한 고속 움직임 추정)

  • Kim, Seong-Hee;Oh, Jeong-Su
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5C
    • /
    • pp.536-541
    • /
    • 2007
  • In video coding standard H.264/AVC, motion estimation using multiple reference pictures improves compression efficiency but the efficiency depends upon image content not the number of reference pictures. So, the motion estimation includes a large amount of computation of no worth according to image. This paper proposes fast motion estimation algorithm that removes worthless computation in the motion estimation using multiple reference pictures. The proposed algorithm classifies a block into valid and invalid blocks for the multiple reference pictures and removes the workless computation by applying a single reference picture to the invalid block. To estimate the proposed algorithm's performance, image quality, bit rate, and motion estimation time are compared with ones of the conventional algorithm in the reference software JM 9.5. The simulation results show that the proposed algorithm can considerably save about 38.67% the averaged motion estimation time while keeping the image quality and the bit rate, whose are average values are -0.02dB and -0.77% respectively, as good as the conventional algorithm.

Efficient Page Allocation Method Considering Update Pattern in NAND Flash Memory (NAND 플래시 메모리에서 업데이트 패턴을 고려한 효율적인 페이지 할당 기법)

  • Kim, Hui-Tae;Han, Dong-Yun;Kim, Kyong-Sok
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.5
    • /
    • pp.272-284
    • /
    • 2010
  • Flash Memory differs from the hard disk, because it cannot be overwritten. Most of the flash memory file systems use not-in-place update mechanisms for the update. Flash memory file systems execute sometimes block cleaning process in order to make writable space while performing not-in-place update process. Block cleaning process collects the invalid pages and convert them into the free pages. Block cleaning process is a factor that affects directly on the performance of the flash memory. Thus this paper suggests the efficient page allocation method, which reduces block cleaning cost by minimizing the numbers of block that has valid and invalid pages at a time. The result of the simulation shows an increase in efficiency by reducing more block cleaning costs than the original YAFFS.

Deductive Argument and Inductive Argument (연역논증과 귀납논증)

  • Jeon, Jae-won
    • Journal of Korean Philosophical Society
    • /
    • v.141
    • /
    • pp.187-202
    • /
    • 2017
  • The aim of this paper is to clarify the difference between the concept of deduction-induction and Aristotle's concept of syllogismos-epagoge. First, Aristotle does not use the expression 'invalid syllogismos'. But a valid deduction is distinguished from a invalid deduction in modern logic. Second, from Aristotle's point of view syllogismos is paralleled by epagoge. Because syllogismos is equivalent to epagoge in logical form. But a disturbing lack of parallelism exists between deduction and induction by which the standards for establishing inductive conclusions are more demanding than those for deductive ones. Third, instructors in introductory logic courses ordinarily stress the need to evaluate arguments first in terms of the strength of the conclusion relative to the premises. Accordingly, students may be told to assume that premises are true. But Aristotle does not assume that premises are true. A syllogismos start from the conceptually true premise and a epagoge start from the empirically true premise.

Temporal/Regional properties of inhibition/facilitation of return: ERP study (회귀억제와 촉진의 시간적, 공간적 속성: ERP 연구)

  • Seo, Jun-Ho;Li, Hyung-Chul O.
    • Korean Journal of Cognitive Science
    • /
    • v.20 no.1
    • /
    • pp.29-49
    • /
    • 2009
  • The purpose of the present research was to examine whether the parietal pathway and the temporal pathway were responsible for the phenomena of the inhibition of return and the facilitation of return respectively and at what stage of the information processing they occurred. The response time and the ERPs(event-related potentials) were examined in the two conditions(the valid condition and the invalid condition) while subjects were doing detection task, location discrimination task, color discrimination task and orientation discrimination task in separate sessions. No significant response time difference was found between the valid and the invalid conditions when subjects did the detection task as well as the location discrimination task. However, significant response time difference was found when they did the color discrimination as well as the orientation discrimination task. Futhermore, there was a significant difference of ERP difference between the two conditions in the Pz area when subjects were doing location discrimination task and significant difference was found in the T7 area when they were doing color discrimination task and marginal difference was found in T7/T8 area when they were doing orientation discrimination task just before they responded. These results imply the possibility that both the inhibition of return and the facilitation of return occur in the parietal and in the temporal pathway respectively in the late stage of information processing.

  • PDF

A Path-Finding Algorithm on an Abstract Graph for Extracting Estimated Search Space (탐색 영역 추출을 위한 추상 그래프 탐색 알고리즘 설계)

  • Kim, Ji-Soo;Lee, Ji-Wan;Moon, Dae-Jin;Cho, Dae-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.147-150
    • /
    • 2008
  • The real road network is regarded as a grid, and the grid is divided by fixed-sized cells. The path-finding is composed of two step searching. First searching travels on the abstract graph which is composed of a set of psuedo vertexes and a set of psuedo edges that are created by real road network and fixed-sized cells. The result of the first searching is a psuedo path which is composed of a set of selected psuedo edges. The cells intersected with the psuedo path are called as valid cells. The second searching travels with $A^*$ algorithm on valid cells. As pruning search space by removing the invalid cells, it would be possible to reduce the cost of exploring on real road network. In this paper, we present the method of creating the abstract graph and propose a path-finding algorithm on the abstract graph for extracting search space before traveling on real road network.

  • PDF