• Kyungpook Mathematical Journal
• /
• 제56권2호
• /
• pp.529-539
• /
• 2016

In this paper, we obtain solution for the first order matrix dynamical system and also we provide set of necessary and sufficient conditions for complete controllability and complete observability of the Sylvester matrix dynamical system.

• 한국인터넷방송통신학회논문지
• /
• 제17권4호
• /
• pp.155-161
• /
• 2017

본 논문은 지금까지 NP-완전 문제로 다항시간 알고리즘이 존재하지 않는 스도쿠 퍼즐 문제의 해를 다항시간으로 구하는 알고리즘을 제안하였다. 제안된 알고리즘은 빈칸들에 [$1,2,{\cdots},9$] 중에서 행, 열과 블록에 존재하는 실마리 숫자를 제외한 후보 집합을 초기치로 설정하였다. 빈칸의 후보 집합에 대해 Stuart이 제시한 기본적인 규칙들과 더불어 2개의 추가 규칙을 제시하고, 마지막으로 이진 역추적 기법(BBT)을 적용하였다. 다양한 부류의 해를 갖는 실험데이터들에 대해 적용한 결과 제안된 BBT 알고리즘은 어떠한 부류의 해를 갖던지에 상관없이 주어진 스도쿠 퍼즐을 풀 수 있음을 보였다.

• 한국물환경학회지
• /
• 제24권1호
• /
• pp.118-122
• /
• 2008

Degradations of phenol and chlorinated compounds mixtures were studied with ultrasound of 20 kHz and 0.57, 1.14 W/mL. In presence of carbon tetrachloride (CT), degradation rate of phenol is faster than chloroform (CF), dichloromethane (DCM) and phenol solution. It is due to that CT generates of free chlorine (HOCl and $OCl^-$) from the sonochemical degradation and plays a role of hydrogen atom scavenger. CF and DCM are react with free chlorine, so amount of free chlorine is smaller than CT solution. The degradation rates of chlorinated compounds decreased with co-presence of phenol in the solution due to the distribution ultrasonic energy to both compounds. The measured chloride ion was lower than the theoretical concentration assuming complete degradation. This means not all the contaminants destructed went through complete degradation.

• 한국컴퓨터정보학회논문지
• /
• 제20권4호
• /
• pp.111-117
• /
• 2015

시험 일정 계획 수립 문제는 정확한 해를 다항시간으로 구하는 알고리즘이 알려져 있지 않은 NP-완전이다. 이 문제에 대해, Gu${\acute{e}}$ret et al.은 $O(m^4)$ 수행 복잡도의 선형계획법으로 해를 얻고자 하였다. 반면에, 본 논문에서는 O(m) 복잡도의 채색 수 알고리즘을 제안하였다. 제안된 방법은 원 데이터를 교과목에 대한 부적합성 행렬과 그래프로 변환시켰다. 다음으로, 부적합성 제약조건을 충족하면서 최소의 시간으로 시험을 치루기 위해, 최소 차수 정점(교과목)부터 인접하지 않은 정점들을 $C_i$ 색으로 배정하여 $B_i$ 상자에 채웠다. 실험 결과, 제안된 알고리즘은 시험 일정 계획 수립 문제에 대해 선형계획법의 $O(m^4)$를 O(m)으로 단축시키면서도 동일한 해를 얻었다.

• 대한치과의사협회지
• /
• 제11권3호
• /
• pp.199-203
• /
• 1973

Various concentration of formaldehyde solution (1%, 5%, 10%) were applied to cut pulp surface, for 3 minutes and the remaining pulp were carefully examined histo-pathologically. The result were as follows, 1. One week survival group which were treated by 1% formaldehyde solution showed seperation of odontoblast layer randomly and the weil's zone was undistinguishable. Deeper portion of this area was necrotic or coagulated. 2. Two week survival group which were treated 1% formaldehyde solution showed necrotic appearance spread from odontoblastic layer to weil's zone. 3. One and two week survival group which were treated 5% formaldehyde solution showed the odontoblastic layer was highly necrotic, under this zone empty net-work was seen. 4. One and two week survival group treated 10% formaldehyde solution showed complete destruction of pulp.

• 산업경영시스템학회지
• /
• 제27권4호
• /
• pp.42-48
• /
• 2004

This paper concerns on a multiprocessor task scheduling problem with precedence relation, in which each task requires several processors simultaneously. Meta-heuristic generally finds a good solution if it starts from a good solution. In this paper, a tabu search is presented to find a schedule of minimal time to complete all tasks. A modified tabu search is also presented which uses a new initial solution based on the best solution during the previous run as the new starting solution for the next iteration. Numerical results show that a tabu search and a modified tabu search yield a better performance than the previous studies.

• Journal of applied mathematics & informatics
• /
• 제8권1호
• /
• pp.181-197
• /
• 2001

A heuristic method TABU-CSP using Tabu Search (TS) is described for solving Constraint Satisfaction Problems (CSPs). The method is started with a complete but inconsistent solution of a binary CSP and obtained in prespecified number of iterations either a consistent solution or a near optimal solution with an acceptable number of conflicts. The repair in the solution at each iterative step is done by using two heuristics alternatively. The first heuristic is a min-conflicts heuristic that chooses a variable with the maximum number of conflicts and reassigns it the value which leads to the minimum number of conflicts. If the acceptable solution is not reached after the search continued for a certain number of iterations, the min-conflict heuristic is changed and the variable selected least number of times is chosen for repair. If an acceptable solution is not reached, the method switches back to the min-conflict heuristic and proceeds further. This allowed the method to explore a different region of search space space for the solution as well as to prevent cycling. The demonstration of the method is shown on a toy problem [9]which has no solution. The method is then tested on various randomly generated CSPs with different starting solutions. The performance of the proposed method in terms of the average number of consistency is checked and the average number of conflicts is conflicts is compared with that of the Branch and Bound(BB) method used to obtain the same solution. In almost all cases, the proposed method moves faster to the acceptable solution than BB.

• 경영과학
• /
• 제13권1호
• /
• pp.1-12
• /
• 1996

This paper deals with production scheduling of block assembly shop in shipbuilding company. The Objectives of the schedule are leveling of daily total workload and fair assignment of workload to each department of the shop. Optimizing the objectives, we consider some restrictions which consisit of block due dates, workability of each department, and space restriction. We formulate the problem in mathematical form. But the model is too complex to find the optimal solution (the problem is NP-complete) and we use the genetic algorithm to find a good solution.

• 한국세라믹학회지
• /
• 제30권9호
• /
• pp.740-746
• /
• 1993

TiO2-SnO2 fine powders prepared by coprecipitation from TiCl4-SnCl4 aqueous solution, and their crystal structures were studied. All the TiO2-SnO2 fine powders calcined at 180~$700^{\circ}C$ showed the complete solid solution between TiO2(rutile structure) and SnO2(rutile structure). This crystal structure of TiO2-SnO2 powders is thought to be originated mainly from the heterogeneous nucleation of Ti-hydroxde on the Sn-hydroxide with coherent structure.

• 한국초전도ㆍ저온공학회논문지
• /
• 제4권1호
• /
• pp.114-118
• /
• 2002

We introduce a design technique for homogeneous magnets using evolution strategy. The method has several advantages over existing techniques including: it allows complete flexibility in geometric constraints on the shape of both the coil and the homogeneous volume; it guarantees a globally optimal solution, and it automatically searches the minimum number of coils that satisfies given constraints.