• 품질경영학회지
• /
• 제31권2호
• /
• pp.131-142
• /
• 2003

QFD(Quality Function Deployment) is design method which is focused to guarantee of quality and function to satisfy for customer’s need. QFD are used entire manufacturing, specially new production development and design. HOQ(House of Quality) are important tool of QFD, which is implement that complex function and communications of customer. Actually implementation of HOQ are difficult by HOQ's size. It is well known that complexity of HOQ are exponentially increasing by increasing of HOQ’s size. In this Paper, we study of HOQ Complexity reduction by Quantification Method of Type Ⅲ. That method is efficiency and minimize of loss information by reduction HOQ. We give example and prove our suggestion method is better than other methods.

• 한국전자통신학회논문지
• /
• 제10권11호
• /
• pp.1231-1238
• /
• 2015

본 논문에서는 노드 모니터링(NM)과 Piecewise Linear Function Approximation(: NP)을 사용하여 LDPC 디코딩 알고리듬의 계산복잡도를 감소시키는 알고리듬을 제안한다. 이 알고리듬은 기존의 알고리듬보다도 더 효율적이다. 제안된 알고리즘이 기존의 방법보다도 개선되었다는 것을 확인하기 위해서 모의실험을 하였다. 실험결과, 제안된 알고리즘의 계산은 기존의 방법에 비해 약 20 % 향상되었음을 확인하였다.

• 대한수학회지
• /
• 제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.

• 한국안전학회지
• /
• 제20권1호
• /
• pp.126-132
• /
• 2005

The purpose of this study is to propose a method to evaluate task complexity using CIFs(Complexity Influencing Factors). We developed a method that CIFs can be used in the evaluation of task complexity using fuzzy linguistic approach. That is, a fuzzy linguistic multi-criteria method to assess task complexity in a specific task situation was proposed. The CIFs luting was assessed in linguistic terms, which are described by fuzzy numbers with triangular and trapezoidal membership function. A fuzzy weighted average algorithm, based on the extension principle, was employed to aggregate these fuzzy numbers. Finally, the method was validated by experimental approach. In the result, it was validated that TCIM(Tink Complexity Index Method) is an efficient method to evaluate task complexity because the correlation coefficient between task performance time and TCI(Task Complexity Index) was 0.699.

• Nuclear Engineering and Technology
• /
• 제45권2호
• /
• pp.141-150
• /
• 2013

There is mounting evidence that complex computer system displays in control rooms contribute to cognitive complexity and, thus, to the probability of human error. Research shows that reaction time increases and response accuracy decreases as the number of elements in the display screen increase. However, in terms of supporting the control room operator, approaches focusing on addressing display complexity solely in terms of information density and its location and patterning, will fall short of delivering a properly designed interface. This paper argues that information complexity and semantic complexity are mandatory components when considering display complexity and that the addition of these concepts assists in understanding and resolving differences between designers and the preferences and performance of operators. This paper concludes that a number of simplified methods, when combined, can be used to estimate the impact that a particular display may have on the operator's ability to perform a function accurately and effectively. We present a mixed qualitative and quantitative approach and a method for complexity estimation.

• Journal of applied mathematics & informatics
• /
• 제29권3_4호
• /
• pp.547-562
• /
• 2011

We establish a new formalism of the non-periodic autocorrelation function (NPAF) of two sequences, which is suitable for the computation of the NPAF of any two sequences. It is shown, that this encoding of NPAF is efficient for sequences of small weight. In particular, the check for two sequences of length n having weight w to have zero NPAF can be decided in $O(n+w^2{\log}w)$. For n > w^2{\log}w$, the complexity is O(n) thus we cannot expect asymptotically faster algorithms.

• Journal of Information Processing Systems
• /
• 제2권3호
• /
• pp.153-158
• /
• 2006

In this paper, we propose an image interpolator for low computational complexity. The proposed image interpolator supports the image scaling using a modified cubic convolution interpolation between the input and output resolutions for a full screen display. In order to reduce the computational complexity, we use the difference in value of the adjacent pixels for selecting interpolation methods and linear function of the cubic convolution. The proposed image interpolator is compared with the conventional one for the computational complexity and image quality. The proposed image interpolator has been designed and verified by Verilog HDL(Hardware Description Language). It has been synthesized using the Xilinx VirtexE FPGA, and implemented using an FPGA-based prototype board.

• East Asian mathematical journal
• /
• 제29권3호
• /
• pp.279-292
• /
• 2013

It is well known that each kernel function defines a primal-dual interior-point method(IPM). Most of polynomial-time interior-point algorithms for linear optimization(LO) are based on the logarithmic kernel function([2, 11]). In this paper we define a new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has ${\mathcal{O}}((log\;p){\sqrt{n}}\;log\;n\;log\;{\frac{n}{\epsilon}})$ and ${\mathcal{O}}((q\;log\;p)^{\frac{3}{2}}{\sqrt{n}}\;log\;{\frac{n}{\epsilon}})$ iteration bound for large- and small-update methods, respectively. These are currently the best known complexity results.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -1
• /
• pp.30-33
• /
• 2002

To obtain good performance of radial basis function (RBF) neural networks, it needs very careful consideration in design. The selection of several parameters such as the number of centers and widths of the radial basis functions must be considered carefully since they critically affect the network's performance. We propose a learning algorithm for growing of complexity of RBF neural networks which is adapted automatically according to the complexity of tasks. The algorithm generates a new basis function based on the errors of network, the percentage of decreasing rate of errors and the nearest distance from input data to the center of hidden unit. The RBF's center is located at the point where the maximum of absolute interference error occurs in the input space. The width is calculated based on the standard deviation of distance between the center and inputs data. The steepest descent method is also applied for adjusting the weights, centers, and widths. To demonstrate the performance of the proposed algorithm, general problem of function estimation is evaluated. The results obtained from the simulation show that the proposed algorithm for RBF neural networks yields good performance in terms of convergence and accuracy compared with those obtained by conventional multilayer feedforward networks.

• 조명전기설비학회논문지
• /
• 제27권8호
• /
• pp.42-50
• /
• 2013

The reactionary responses to control human standing dynamics were estimated under the assumption that postural complexity mainly occurs in the mid-sagittal plane. During the experiment, the subject was exposed to continuous horizontal perturbation. The ankle and hip joint rotations of the subject mainly contributed to maintaining standing postural control. The designed mobile platform generated anterior/posterior (AP) motion. Non-predictive random translation was used as input for the system. The mean acceleration generated by the platform was measured as $0.44m/s^2$. The measured data were analyzed in the frequency domain by the coherence function and the frequency response function to estimate its dynamic responses. The significant correlation found between the input and output of the postural control system. The frequency response function revealed prominent resonant peaks within its frequency spectrum and magnitude. Subjects behaved as a non-rigid two link inverted pendulum. The analyzed data are consistent with the outcome hypothesized for this study.