• Title/Summary/Keyword: complexities

Search Result 489, Processing Time 0.022 seconds

Development of Production Management System for Medium and Small Companies (중소제조업을 위한 생산관리시스템의 개발)

  • 임수경;오근태
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.18 no.36
    • /
    • pp.193-203
    • /
    • 1995
  • The production management system software which can be applied In the medium and small companies is developed. Since the medium and small companies hesitate to install the computer system for production management owing to the lack of funds and the complexities of operation, the system is made to be used in PC and only requires minimum input data. This system is composed of interrelated modules for receive/order release, inventory management MRP, new product registration, document management and production scheduling. In this paper the architecture of the system, functions of each module, and information processing procedures of each funtion are discussed.

  • PDF

Evaluation of the Complexity of the Product According to Access and Handling (취급성과 접근성을 고려한 제품의 복잡도 평가)

  • Mok, Hak-Soo;Shin, Hyun-Chang
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.14 no.10
    • /
    • pp.91-101
    • /
    • 1997
  • In this paper, the complexity of the product is evaluated quantitatively regarding to access of assembly tools and handling of part. To evaluate the complexity of the product, we grasped factors that could influence on the complexity of the product with access and handling, and then we determined the criteria of comparison for each complexity factor. The criteria compare the complexities of product alternatives on each access and handling.

  • PDF

Realizing TDNN for Word Recognition on a Wavefront Toroidal Mesh-array Neurocomputer

  • Hong Jeong;Jeong, Cha-Gyun;Kim, Myung-Won
    • Journal of Electrical Engineering and information Science
    • /
    • v.1 no.1
    • /
    • pp.98-107
    • /
    • 1996
  • In this paper, we propose a scheme that maps the time-delay neural network (TDNN) into the neurocomputer called EMIND-II which has the wavefront toroidal mesh-array structure. This neurocomputer is scalable, consists of many timeshared virtual neurons, is equipped with programmable on-chip learning, and is versatile for building many types of neural networks. Also we define the programming model of this array and derive the parallel algorithms about TDNN for the proposed neurocomputer EMIND-II. In addition, the computational complexities for the parallel and serial algorithms are compared. Finally, we introduce an application of this neurocomputer to word recognition.

  • PDF

Design of Robust Fuzzy-Logic Tracker for Noise and Clutter Contaminated Trajectory based on Kalman Filter

  • Byeongil Kim
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.27 no.2_1
    • /
    • pp.249-256
    • /
    • 2024
  • Traditional methods for monitoring targets rely heavily on probabilistic data association (PDA) or Kalman filtering. However, achieving optimal performance in a densely congested tracking environment proves challenging due to factors such as the complexities of measurement, mathematical simplification, and combined target detection for the tracking association problem. This article analyzes a target tracking problem through the lens of fuzzy logic theory, identifies the fuzzy rules that a fuzzy tracker employs, and designs the tracker utilizing fuzzy rules and Kalman filtering.

DFT를 사용한 고속 constant modulus algorithm 의 성능분석

  • Yang, Yoon-Gi;Lee, Chang-Su;Yang, Soo-Mi
    • Journal of IKEEE
    • /
    • v.13 no.1
    • /
    • pp.1-10
    • /
    • 2009
  • Recently, some frequency domain CMA (Constant Modulus Algorithm) have been introduced in an effort to reduce computational complexities [1,2]. In [1], a fast algorithm that minimizing cost function designed for block input signal is employed, while in [2], a novel cost function that minimizing sample by sample input is used. Although, the two fast algorithm save computational complexities as compared to CMA, the convergence behaviors of the two fast algorithm show different results with repsect to CMA. Thus, in this paper, some analytical results on the error surface of the fast frequency domain CMA are introduced. From the analytical results, we show that the more recent algorithm [2] outperforms the previous algorithm [1]. Simulation results reveals that the recent algorithm [2] shows 50% enhanced convergence with respect to the old fast algorithm [1]. Also, we show that the recent fast algorithm [2] has comparable convergence performance with respect to conventional CMA algorithm.

  • PDF

The Liability System and the Legal Nature of the Seller's Liability for Defective Goods under Korean Law and the PELS (유럽매매법원칙과 한국법상 결함상품에 대한 매도인의 책임의 법적성격과 책임제도)

  • Lee, Byung-Mun
    • THE INTERNATIONAL COMMERCE & LAW REVIEW
    • /
    • v.44
    • /
    • pp.31-55
    • /
    • 2009
  • This study attempts to provide a comparative overview of the liability systems Korean law and the PELS adopt, that is, the approaches taken by Korean law and the PELS to deal with various irregularities of contractual performance. In addition, it examines in a comparative way the questions of what is the position of the seller's liability for his delivery of defective goods under the chosen liability system and what is the legal nature of the seller's liability. The study finds that the dual liability system taken by Korean law has caused some complexities as to the matter of which liability is applicable in some borderline cases. The problem in such complexities is originated in that the remedies available and the limitation period applicable are differentiated in accordance with one's different categorization among three types of default under the general liability and defective performance under the seller's guarantee liability. In this light, the study argues that the unified liability system under the PELS is superior because its concept of non-performance embraces in a unitary manner all the aspects of default including defects in quality, quantity and title. In addition, it finds that Korean law has suffered endless debates on the question of what are the true contents of the same remedies of rescission and damages provided under the seller's guarantee liability as under the general liability. The debates have been come along on the basis of the traditional presumption among some of civil law jurisdictions that two liabilities be different in terms of not only their legal nature but also their contents of remedies. The study argues that the problem may be circumvented, first, by another way of thinking that the unified liability in Korean law is inferred from the specification of the identical remedies for both the general liability and the seller's guarantee liability under the KCC, second, by the preposition that the requirement of fault be depended upon what remedy the buyer seeks to claim rather than what liability he does to rely on.

  • PDF

Algebraic Structure for the Recognition of Korean Characters (한글 문자의 인식을 위한 대수적 구조)

  • Lee, Joo-K.;Choo, Hoon
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.12 no.2
    • /
    • pp.11-17
    • /
    • 1975
  • The paper examined the character structure as a basic study for the recognition of Korean characters. In view of concave structure, line structure and node relationship of character graph, the algebraic structure of the basic Korean characters is are analized. Also, the degree of complexities in their character structure is discussed and classififed. Futhermore, by describing the fact that some equivalence relations are existed between the 10 vowels of rotational transformation group by Affine transformation of one element into another, it could be pointed out that the geometrical properting in addition to the topological properties are very important for the recognition of Korean characters.

  • PDF

Linear Complexities of Sequences over Unknown Symbol Sets and Constructions of Sequences over CF($p^k$) whose Characteristic Polynomials are over GF($p^{k}$ ) (임의의 심볼 집합 상의 수열의 선형복잡도와 GF(p)상의 특성다항식을 갖는 GF($p^k$)상의 수열 생성에 관한 연구)

  • Hong, Yun-Pyo;Eun, Yu-Chang;Kim, Jeong-Heon;Song, Hong-Yeop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5C
    • /
    • pp.443-451
    • /
    • 2003
  • We propose an appropriate approach of defining the linear complexities (LC) of sequences over unknown symbol set. We are able to characterize those p-ary sequences whose R-tuple versions now eve. GF($p^{R}$ ) have the same characteristic polynomial as the original with respect to any basis. This leads to a construction of $p^{R}$ -ary sequences whose characteristic polynomial is essentially over GF(p). In addition, we can characterize those $p^{R}$ -ary sequences whose characteristic polynomials are uniquely determined when symbols are represented as R-tuples over GF(p) with respect to any basis.

The subband adaptive filter with variable length adaptive filter (가변길이 적응필터를 사용한 부대역 적응필터)

  • Yang, Yoon-Gi
    • Journal of IKEEE
    • /
    • v.21 no.3
    • /
    • pp.202-210
    • /
    • 2017
  • Recently, some variable length adaptive filters which employ variable lengths taps for the input signal statistics are proposed [1-5]. In this paper, a new subband adaptive filter with variable filter tap length is proposed. The proposed subband variable length adaptive filters can optimize filter length for each subband which can result less computational complexities with respect to the conventional full band adaptive filters. When the signal in the full band has narrow spectrum, the conventional full band adaptive requires very long filter taps, whereas the proposed subband variable filter requires less taps with the spectrum split in subband. The computer simulation results reveals that in many case, in system identification with narrow band system estimation, the proposed adaptive filter has less computational complexities with faster convergence.

Quantifications of Intensity-Modulated Radiation Therapy Plan Complexities in Magnetic Resonance Image Guided Radiotherapy Systems

  • Chun, Minsoo;Kwon, Ohyun;Park, Jong Min;Kim, Jung-in
    • Journal of Radiation Protection and Research
    • /
    • v.46 no.2
    • /
    • pp.48-57
    • /
    • 2021
  • Background: In this study, the complexities of step-and-shoot intensity-modulated radiation therapy (IMRT) plans in magnetic resonance-guided radiation therapy systems were evaluated. Materials and Methods: Overall, 194 verification plans from the abdomen, prostate, and breast sites were collected using a 60Co-based ViewRay radiotherapy system (ViewRay Inc., Cleveland, OH, USA). Various plan complexity metrics (PCMs) were calculated for each verification plan, including the modulation complexity score (MCS), plan-averaged beam area (PA), plan-averaged beam irregularity, plan-averaged edge (PE), plan-averaged beam modulation, number of segments, average area among all segments (AA/Seg), and total beam-on time (TBT). The plan deliverability was quantified in terms of gamma passing rates (GPRs) with a 1 mm/2% criterion, and the Pearson correlation coefficients between GPRs and various PCMs were analyzed. Results and Discussion: For the abdomen, prostate, and breast groups, the average GPRs with the 1 mm/2% criterion were 77.8 ± 6.0%, 79.8 ± 4.9%, and 84.7 ± 7.3%; PCMs were 0.263, 0.271, and 0.386; PAs were 15.001, 18.779, and 35.683; PEs were 1.575, 1.444, and 1.028; AA/Segs were 15.37, 19.89, and 36.64; and TBTs were 18.86, 19.33, and 5.91 minutes, respectively. The various PCMs, i.e., MCS, PA, PE, AA/Seg, and TBT, showed statistically significant Pearson correlation coefficients of 0.416, 0.627, -0.541, 0.635, and -0.397, respectively, with GPRs. Conclusion: The area-related metrics exhibited strong correlations with GPRs. Moreover, the AA/Seg metric can be used to estimate the IMRT plan accuracy without beam delivery in the 60Co-based ViewRay radiotherapy system.