• Title/Summary/Keyword: 부류

Search Result 355, Processing Time 0.027 seconds

Incremental Design of MIN using Unit Module (단위 모듈을 이용한 MIN의 점증적 설계)

  • Choi, Chang-Hoon;Kim, Sung-Chun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.2
    • /
    • pp.149-159
    • /
    • 2000
  • In this paper, we propose a new class of MIN (Multistage Interconnection Network) called SCMIN(ShortCut MIN) which can form a cheap and efficient packet switching interconnection network. SCMIN satisfies full access capability(FAC) and has multiple redundant paths between processor-memory pairs even though SCMIN is constructed with 2.5N-4 SEs which is far fewer SEs than that of MINs. SCMIN can be constructed suitable for localized communication by providing the shortcut path and multiple paths inside the processor-memory cluster which has frequent data communications. Therefore, SCMIN can be used as an attractive interconnection network for parallel applications with a localized communication pattern in shared-memory multiprocessor systems.

  • PDF

Simultaneous Analysis of Several Non-Steroidal Anti-Inflammatory Drugs in Urine by Gas Chromatograph/Negative Chemical Ionization-Mass Spectrometry (기체 크로마토그래프-질량분석법을 이용한 뇨중 비스테로이드성 소염진통제 (NSAIDs)의 동시 분석법)

  • Myung, Seung-Woon;Park, Joon-Ho;Kim, Myung-Soo;Cho, Hyun-Woo
    • Analytical Science and Technology
    • /
    • v.12 no.6
    • /
    • pp.571-576
    • /
    • 1999
  • Screening method for NSAIDs (Hon-Steroidal Anti-Inflammatory Drugs) in urine was developed using GC/NCI-MS. Derivatized six fenamates with pentafluoropropionic anhydride showed high sensitivity in NCI-MS. The conditions of the derivatization reaction and chromatographic conditions were established for screening with a trace analysis. Limit of detection was in the range of 4-25 pg/mL. This method may be used to the equine doping analysis for NSAIDs and forensic analysis.

  • PDF

Limiting Behavior of Tail Series of Independent Random Variable (독립인 확률변수들의 Tail 합의 극한 성질에 대하여)

  • Jang Yoon-Sik;Nam Eun-Woo
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.4
    • /
    • pp.63-68
    • /
    • 2006
  • For the almost co티am convergent series $S_n$ of independent random variables, by investigating the limiting behavior of the tail series, $T_n=S-S_{n-1}=\sum_{i=n}^{\infty}X_i$, the rate of convergence of the series $S_n$ to a random variable S is studied in this paper. More specifically, the equivalence between the tail series weak law of large numbers and a limit law is established for a quasi-monotone decreasing sequence, thereby extending a result of Previous work to the wider class of the norming constants.

  • PDF

Diagnosis and Treatment of the Peroneal Tendon and Tibialis Anterior Tendon Disorders (비골 건 및 전방 경골 건 질환의 진단 및 치료)

  • Jung, Hong Geun
    • The Journal of Korean Orthopaedic Ultrasound Society
    • /
    • v.1 no.1
    • /
    • pp.58-63
    • /
    • 2008
  • Mechanism of the peroneal tendon dislocation is mainly the ankle trauma and commonly caused by severe peroneal tendon contraction at ankle dorsiflexion state. Peroneal tendon tears are frequently combined in recurrent dislocation. The peroneal tendon dislocation from the fibula groove can be confirmed with ultrasound scanning. Recurrent dislocation needs surgical treatment and usually gains good clinical outcome with fibula groove deepening procedure. Tibialis anterior tendon rupture is frequently found in old age but active patients who had tendency of tendon weakness due to chronic tendon attrition, repeated steroid injection, diabetic tendinopathy or inflammatory arthropathy.

  • PDF

Unpaired Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks (하이퍼큐브형 상호연결망의 비쌍형 다대다 서로소인 경로 커버)

  • Park, Jung-Heum
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.10
    • /
    • pp.789-796
    • /
    • 2006
  • An unpaired many-to-many k-disjoint nth cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct sources and sinks in which each vertex of G is covered by a path. Here, a source can be freely matched to a sink. In this paper, we investigate unpaired many-to-many DPC's in a subclass of hpercube-like interconnection networks, called restricted HL-graphs, and show that every n-dimensional restricted HL-graph, $(m{\geq}3)$, with f or less faulty elements (vertices and/or edges) has an unpaired many-to-many k-DPC for any $f{\geq}0\;and\;k{\geq}1\;with\;f+k{\leq}m-2$.

Performance comparison of SVM and neural networks for large-set classification problems (대용량 분류에서 SVM과 신경망의 성능 비교)

  • Lee Jin-Seon;Kim Young-Won;Oh Il-Seok
    • The KIPS Transactions:PartB
    • /
    • v.12B no.1 s.97
    • /
    • pp.25-30
    • /
    • 2005
  • In this paper, we analyzed and compared the performances of modular FFMLP(feedforward multilayer perceptron) and SVUT(Support Vector Machine) for the large-set classification problems. Overall, SVM dominated modular FFMLP in the correct recognition rate and other aspects Additionally, the recognition rate of SVM degraded more slowly than neural network as the number of classes increases. The trend of the recognition rates depending on the rejection rate has been analyzed. The parameter set of SVM(kernel functions and related variables) has been identified for the large-set classification problems.

Performance Improvement Strategies on Minimum Distance Classification for Large-Set handwritten Character Recognition (대용량 필기 문자인식을 위한 최소거리 분류법의 성능 개선 전략)

  • Kim, Soo-Hyung
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.10
    • /
    • pp.2600-2608
    • /
    • 1998
  • This paper proposes an algorithm for off line recognition of handwritten characters, especially effective for large-set characters such as Korean and Chinese characters. The algorithm is based on a minimum distance dlassification method which is simple and easy to implement but suffers from low recognition performance. Two strategies have been developed to improve its performance; one is multi-stage pre-classification and the other is candicate reordering. Effectiveness of the algorithm has been proven by and experimet with the samples of 574 classes in a handwritten Korean character catabase named PE02, where 86.0% of recognition accuracy and 15 characters per second of processing speed have been obtained.

  • PDF

BIODEGRADATION PATHWAYS OF TRICHLOROETHYLENE (TCE) AND METHYL BROMIDE (MeBr)

  • Chung, Keun-Yook
    • Journal of environmental and Sanitary engineering
    • /
    • v.16 no.3
    • /
    • pp.1-13
    • /
    • 2001
  • 트리클로로에틸렌 (trichloroethylene, TCE)는 오랜 시간동안 자연환경에서 잔류할 뿐만 아니라 TCE보다 더욱 더 독성이 강한 중간 생성물들을 만들기 때문에 미국과 대부분의 전세계 국가들로부터 주요 1차 환경오염물질로 분류되었다. 그러한 독성물질들은 혐기성 상태에서는 다이클로로 에틸렌(dichloroethylene, DCE)과 바이닐 클로라이드 (vinyl chloride, VC)와 같은 독성물질들이 생성되고 호기성 상태에서는 TCE epoxide계통의 물질들이 생성된다. 또한 훈증제인 메틸 브로마이드 (methyl bromide)는 대기의 오존층을 파괴하는 것으로 알려져 있고, 2001년경에 미국환경보호청 (USEPA)에 의해 사용이 금지될 것이다. TCE는 혐기성 조건하에서 연속적으로 탈염소화되고, 이어서 호기성 조건하에서 완전 산화될 수 있다. 그리하여 연속적인 혐기성 및 호기성 조건하에서 궁극적으로 TCE의 완전분해를 이루게된다. 메틸브로마이드는 화학적으로 가수분해되어 메틸 알콜 (methyl alcohol)로 되거나 유기물에 강하게 결합 (bound)된다. 또한 그것은 생물학적으로 포름알데하이드 (formaldehyde)로 산화되거나 메틸알콜로 가수분해된다. 수많은 연구자들에 의해 행해진 연구들은 TCE와 MeBr은 메탄 혹은 암모니아 산화 세균에 의한 공동대사과정 (cometabolism)을 통해 분해가 증진될 수 있다는 것을 보여주었다. 두 부류의 세균들이 두 화합물들을 분해시킬 수 있는 monooxygenase를 생산한다는 것은 잘 알려져 있다. 이 연구 논문에서 TCE와 MeBr의 생분해와 관련된 가장 최근의 연구논문들로부터 나온 핵심 연구결과들이 요약 검토된다. TCE와 MeBr로 오염된 현장을 정화하기 위해 이러한 기초연구결과들을 토대로 더욱 더 많은 연구가 필요 할 것으로 사료된다.

  • PDF

Korean Electronic Dictionary of Encyclopedic Nouns I. - Nouns related to Human Names - (검색 엔진을 위한 '백과 명사' 전자 사전의 구축 (I) <인명 관련 백과 명사의 연구>)

  • Nam, Jee-Sun;Lee, Ju-Ho;Choi, Key-Sun
    • Annual Conference on Human and Language Technology
    • /
    • 1998.10c
    • /
    • pp.304-315
    • /
    • 1998
  • 정보 검색 시스템에서 가장 문제가 되는 어휘 클라스는 소위 '고유 명사'와 '합성 명사'로 분류되는 명사 유형이다. 이들 클라스는, 기존 대사전 및 전자 사전 (MRD)류에서, 그 어휘 목록을 체계적으로 제공하지 못하는 가장 대표적인 부류들인데, 실제 검색 시스템에서는 많은 경우 정보의 핵심어 (Key Word)가 된다. 본 연구에서는 신문, 잡지등 시사 문서류에서 가장 빈번히 발견되는 명사 유형의 하나인, '인명 관련 고유 명사' 유형에 대한 문제에 그 논의의 촛점을 두고, 이들 명사들의 체계적인 처리를 위해서 어떠한 형태로 사전을 구성해야 하는지를 검토할 것이다. '고유 명사'라는 개념 자체가 지니고 있는 외연적 정의상의 문제점을 극복하기 위해서 우리는 '백과 명사 (Encyclopedic Noun)'라는 용어를 사용하기로 하며, 이는 좁은 의미의 고유 명사 및, 전문어, 고유 명사 관련 파생-복합어류 등을 포함하는, 보다 확장된 개념으로 이해되어야 한다. <인명> 관련 백과 명사류의 하위 유형 분류 및 그 특징적 결합어 형태(Appropriate Particle)에 대한 연구 결과들이 소개된다.

  • PDF

Soft Sensor Design Using Image Analysis and its Industrial Applications Part 1. Estimation and Monitoring of Product Appearance (화상분석을 이용한 소프트 센서의 설계와 산업응용사례 1. 외관 품질의 수치적 추정과 모니터링)

  • Liu, J. Jay
    • Korean Chemical Engineering Research
    • /
    • v.48 no.4
    • /
    • pp.475-482
    • /
    • 2010
  • In this work, soft sensor based on image anlaysis is proposed for quantitatively estimating the visual appearance of manufactured products and is applied to quality monitoring. The methodology consists of three steps; (1) textural feature extraction from product images using wavelet transform, (2) numerical estimation of the product appearance through projection of the textural features on subspace, and (3) use of latent variables of textural features (i.e., numerical estimates of product appearance). The focus of this approach is on the consistent and quantitative estimation of continuous variations in visual appearance rather than on classification into discrete classes. This approach is illustrated through the application to the estimation and monitoring of the appearance of engineered stone countertops.