• 한국정보통신학회논문지
• /
• 제8권2호
• /
• pp.365-370
• /
• 2004

본 논문에서는 복잡계를 이용한 비밀통신 방법을 제시한다. 복잡계 회로는 N-Double Scroll CNN 회로를 이용하였다. 동일한 여러 개의 셀을 가진 N-Double Scroll 회로를 이용하여 복잡계의 송ㆍ수신부를 구성하고 이 복잡계 송ㆍ수신부 사이에 임베딩 동기화 기법을 이용하여 동기화를 이루고, 송신부에서 정보 신호를 복잡계 신호에 합성하여 채널을 통하여 수신부에 송신 한 후 수신부에서 정보 신호와 복잡계 신호를 분리하는 기법을 제시하여 비밀 통신 가능성을 확인하였다.

• 시스템엔지니어링학술지
• /
• 제17권2호
• /
• pp.69-81
• /
• 2021

The human performance issues and increased automation issues in advanced Small Modular Reactors (SMRs) are critical to numerous stakeholders in the nuclear industry, due to the undesirable implications targeting the Man Machine Interface Systems (MMIS) complexity of (Generation IV) SMRs. It is imperative that the design of future SMRs must address these problems. Nowadays, Multi Agent Systems (MAS) are used in the industrial sector to solve multiple complex problems; therefore incorporating this technology in the proposed innovative SMR (I-SMR) design will contribute greatly in the decision making process during plant operations, also reduce the number MCR operating crew and human errors. However, it is speculated that an increased level of complexity will be introduced. Prior to achieving the objectives of this research, the tools used to analyze the system for complexity reduction, are the McCabe's Cyclomatic complexity metric and the Henry-Kafura Information Flow metric. In this research, the systems engineering approach is used to guide the engineering process of complexity reduction concept of the system in its entirety.

• Nuclear Engineering and Technology
• /
• 제54권11호
• /
• pp.4170-4180
• /
• 2022

The task complexity (TACOM) measure was previously developed to quantify the complexity of proceduralized tasks conducted by nuclear power plant operators. Following the development of the TACOM measure, its appropriateness has been validated by investigating the relationship between TACOM scores and three kinds of human performance data, namely response times, human error probabilities, and subjective workload scores. However, the information reflected in quantified TACOM scores is still insufficient to determine the levels of complexity of proceduralized tasks for human reliability analysis (HRA) applications. In this regard, the objective of this study is to suggest criteria for determining the levels of task complexity based on logistic regression between human error occurrences in digitalized main control rooms and TACOM scores. Analysis results confirmed that the likelihood of human error occurrence according to the TACOM score is secured. This result strongly implies that the TACOM measure can be used to identify the levels of task complexity, which could be applicable to various research domains including HRA.

• The Journal of the Acoustical Society of Korea
• /
• 제17권3E호
• /
• pp.53-57
• /
• 1998

Spectral information at a speech coder should be quantized with sufficient accuracy to keep perceptually transparent output speech. Spectral information at a low bit rate speech coder is usually transformed into corresponding line spectrum pair parameters and is often quantized with a vector quantization algorithm. As the vector quantization algorithm generally has high complexity in the optimal code vector searching routine, the complexity reduction in that routine is investigated using the ordering property of the line spectrum pair. When the proposed complexity reduction algorithm is applied to the well-known split vector quantization algorithm, the 46% complexity reduction is achieved in the distortion measure compu-tation.

• 한국멀티미디어학회논문지
• /
• 제21권8호
• /
• pp.813-820
• /
• 2018

This paper proposes new frame rate up-conversion algorithms. Adaptive motion estimation based on block complexity information are used to obtain more accurate motion vectors. Because the information on block complexity is extracted from the motion estimation prediction size from the original frame, additional computational complexity is not imparted. In experimental results, the proposed algorithms provide robust frame interpolation performance for whole test sequences. Also, the computational complexity of the proposed algorithm is reduced to a benchmark algorithm.

• Journal of applied mathematics & informatics
• /
• 제8권3호
• /
• pp.959-973
• /
• 2001

We shall discuss one of some techniques needed to analyze algorithms. It is called a big-O function technique. The measures of efficiency of an algorithm have two cases. One is the time used by a computer to solve the problem using this algorithm when the input values are of a specified size. The other one is the amount of computer memory required to implement the algorithm when the input values are of a specified size. Mainly, we will restrict our attention to time complexity. To figure out the Time Complexity in nonlinear problems of Numerical Analysis seems to be almost impossible.

• 대한수학회지
• /
• 제45권1호
• /
• pp.221-228
• /
• 2008

In this paper, we study the complexity of semigroup actions using complexity functions of open covers. The main results are as follows: (1) A dynamical system is equicontinuous if and only if any open cover has bounded complexity; (2) Weak-mixing implies scattering; (3) We get a criterion for the scattering property.

• ETRI Journal
• /
• 제5권3호
• /
• pp.16-25
• /
• 1983

Increasing importance is being attached to the idea of measuring software characteristics. This paper deals with following things. First, a relation of program and flow graph is discussed. It describes a theoretic complexity measure and illustrates how it can be used to manage and control program complexity. Second, cyclomatic complexity measure is discussed. The complexity is independent of physical size and depends only on the decision structure of a program. Third, consider a knot which defines crossing point and provide the ordering of the nodes to make the transition from a two dimensional graph to a one dimensional program. A program modules that can improve FORTRAN IV program text is tested by knot counting and its control complexity is improved.

• 보건행정학회지
• /
• 제24권4호
• /
• pp.380-388
• /
• 2014

Background: The volume of surgery has been examined as a major source of variation in outcome after surgery. This study investigated the direct effect of surgery volume to in hospitals mortality and the moderating effect of structural complexity-the level of diversity and sophistication of technology a hospital applied in patient care-to the volume outcome relationship. Methods: Discharge summary data of 11,827 cancer patients who underwent surgery and were discharged during a month period in 2010 and 2011 were analyzed. The analytic model included the independent variables such as surgery volume of a hospital, structural complexity measured by the number of diagnosis a hospital examined, and their interaction term. This study used a hierarchical logistic regression model to test for an association between hospital complexity and mortality rates and to test for the moderating effect in the volume outcome relationship. Results: As structural complexity increased the probability of in-hospital mortality after cancer surgery reduced. The interaction term between surgery volume and structural complexity was also statistically significant. The interaction effect was the strongest among the patients group who had surgery in low volume hospitals. Conclusion: The structural complexity and volume of surgery should be considered simultaneously in studying volume outcome relationship and in developing policies that aim to reduce mortality after cancer surgery.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제20권2호
• /
• pp.107-121
• /
• 2016

We analyze the complexity of the LLL algorithm, invented by Lenstra, Lenstra, and $Lov{\acute{a}}sz$ as a a well-known lattice reduction (LR) algorithm which is previously known as having the complexity of $O(N^4{\log}B)$ multiplications (or, $O(N^5({\log}B)^2)$ bit operations) for a lattice basis matrix $H({\in}{\mathbb{R}}^{M{\times}N})$ where B is the maximum value among the squared norm of columns of H. This implies that the complexity of the lattice reduction algorithm depends only on the matrix size and the lattice basis norm. However, the matrix structures (i.e., the correlation among the columns) of a given lattice matrix, which is usually measured by its condition number or determinant, can affect the computational complexity of the LR algorithm. In this paper, to see how the matrix structures can affect the LLL algorithm's complexity, we derive a more tight upper bound on the complexity of LLL algorithm in terms of the condition number and determinant of a given lattice matrix. We also analyze the complexities of the LLL updating/downdating schemes using the proposed upper bound.