• 한국군사과학기술학회지
• /
• 제22권2호
• /
• pp.255-265
• /
• 2019

In the present study, the effect of opening patterns of a flow control valve on underwater discharge systems using a linear pump was investigated numerically. For that, a improved mathematical model was developed. The improvement is to separate a middle tank from a water cylinder because the cross-section area of the inlet of the middle tank is an important parameter. To validate the improved model, calculation results were compared with a previous study. The results showed that $2^{nd}$ order or more polynomial opening patterns had an advantage over ramp opening patterns. Higher an order of polynomial resulted in wider operating limits. An escape velocity and a maximum acceleration of underwater vehicle were affected by time derivative of the cross-section area of the flow control valve. Besides, as a velocity profile of the vehicle got closer to linearity, the escape velocity got faster and the maximum acceleration got smaller. And velocities of the vehicle and piston had similar variation trend.

• Journal of applied mathematics & informatics
• /
• 제29권1_2호
• /
• pp.451-457
• /
• 2011

The function f(z) = $e^{p(z)}$ where p(z) is a polynomial of degree n has 2n Julia lines. Julia lines of $e^{p(z)}$ divide the complex plane into 2n equal sectors with the same vertex at the origin. In each sector, $e^{p(z)}$ has radial limits of 0 or innity. Main results of the paper are concerned with maximum curves of $e^{p(z)}$. We deal with some properties of maximum curves of $e^{p(z)}$ and we give some examples of the maximum curves of functions of the form $e^{p(z)}$.

• 한국컴퓨터정보학회논문지
• /
• 제20권2호
• /
• pp.63-70
• /
• 2015

최대 지배집합의 수인 도메틱 수 문제 (DNP)는 정확한 해를 다항시간으로 구하는 알고리즘이 존재하지 않아 NP-완전 문제로 알려져 있다. 본 논문은 DNP의 해를 다항시간으로 구하는 알고리즘을 제안하였다. 그래프의 최대 차수 ${\Delta}(G)$ 정점 $v_i$를 $D_i,i=1,2,{\cdots},k$의 지배집합의 원소로 선택하는 방법을 적용하고, $V_{i+1}=V_i{\backslash}D_i$의 축소된 그래프에 대해 $D_{i+1}$을 구하였다. 또한 $V{\backslash}D_i=N_G(D_i)$로 $D_i$가 지배집합으로 되는지 여부를 검증하였다. 제안된 알고리즘을 15개의 다양한 그래프에 적용한 결과 정확한 해를 다항시간 복잡도 O(kn)으로 구하는데 성공하였다. 결국, 제안된 알고리즘은 도메틱 수 문제가 P-문제임을 보였다.

• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.419-432
• /
• 2005

In this paper we study the no-wait or no-idle permutation flowshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the five regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these five cases are solvable by presenting a polynomial-time solution algorithm for each case.

• 대한수학회보
• /
• 제54권3호
• /
• pp.1037-1067
• /
• 2017

Motzkin and Straus established a close connection between the maximum clique problem and a solution (namely graph-Lagrangian) to the maximum value of a class of homogeneous quadratic multilinear functions over the standard simplex of the Euclidean space in 1965. This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum clique problem in graphs. It is useful in practice if similar results hold for hypergraphs. In this paper, we develop a homogeneous multilinear function based on the structure of hypergraphs and their complement hypergraphs. Its maximum value generalizes the graph-Lagrangian. Specifically, we establish a connection between the clique number and the generalized graph-Lagrangian of 3-uniform graphs, which supports the conjecture posed in this paper.

• ETRI Journal
• /
• 제32권3호
• /
• pp.479-481
• /
• 2010

An optimal multiuser detection algorithm with a computational complexity of O(K log K) is proposed for the class of linear multiple-access systems which have constant cross-correlation values. Here the optimal multiuser detection is implemented by searching for a monotone sequence with maximum likelihood, under the ranking of sufficient statistics. The proposed algorithm is intuitive and concise. It is carried out in just two steps, and at each step only one kind of operation is performed. Also, the proposed algorithm can be extended to more complex systems having more than a single cross-correlation value.

• 제어로봇시스템학회논문지
• /
• 제8권8호
• /
• pp.691-697
• /
• 2002

Myocardial ischemia is a disorder of cardiac function caused by insuficient blood flow to the muscle tissue of the heart. We can diagnose myocardial ischemia by observing the change of ST-segment, but this change is temporary. Our primary purpose is to detect the temporary change of the 57-segment automatically In the signal processing, the wavelet transform decomposes the ECG(electrocardiogram) signal into high and low frequency components using wavelet function. Recomposing the high frequency bands including QRS complex, we can detect QRS complex more easily. Amplitude comparison method is adopted to detect QRS complex. Reducing the effect of noise to the minimum, we grouped ECG by 5 data and compared the amplitude of maximum value. To recognize the ECG .signal pattern, we adopted the polynomial approximation partially and statistical method. The polynomial approximation makes possible to compare some ECG signal with different frequency and sampling period. The ECG signal is divided into small parts based on QRS complex, and then, each part is approximated to the polynomials. After removing the distorted ECG by calculating the difference between the orignal ECG and the approximated ECG for polynomial, we compared the approximated ECG pattern with the database, and we detected and classified abnormality of ECG.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제3권2호
• /
• pp.137-145
• /
• 1999

In this paper, We consider two-dimensional Maximum Length Cellular Automata (2-D MLCA) as an extension of the 1-D MLCA. 2-D MLCA can display much better random patterns than those generated by 1-D CA and LFSR. To generate random pattern, a CA should have a maximum length cycle. So, it is necessary to find MLCA that the characteristic polynomial of the transition matrix is primitive. New boundary conditions of 3 types are proposed and some rules having primitive polynomials of 2-D MLCA are found.

• 한국경영과학회지
• /
• 제23권1호
• /
• pp.29-41
• /
• 1998

This paper addresses the problem of scheduling a set of jobs with a common due data on a single machine. The objective is to minimize the sum of the earliness and tardiness of jobs subject to $T_{max}{\le}{\Delta}\;for{\Delta}{\ge}0$. Properties for the $MAD/T_{max}$ problem are found and the problem is shown to be NP-complete in the ordinary sense. According to the range of Δ, the problem can be solved in polynomial time. Also, some special cases where an optimal schedule is found in polynomial time are discussed.

• 한국소음진동공학회논문집
• /
• 제15권6호
• /
• pp.712-717
• /
• 2005

This paper presents a system identification method for multi-input, multi-output (MIMO) systems, by which a rational polynomial transfer function model is identified from experimentally determined frequency response function data. Analytically determined information is incorporated in this method to obtain a more reliable model, even in the frequency range where the excitation energy is limited. To verify the suggested method, shaking table test for an actively controlled two-story, bench-scale building employing an active mass damper is conducted. The results show that the proposed method is quite effective and robust for system identification of MIMO systems.