• 한국정보통신학회논문지
• /
• 제8권5호
• /
• pp.1108-1113
• /
• 2004

‘집합’은 컴퓨터 프로그램의 설계에 자주 사용되는 도구이다. 이런 이유 때문에 최근 ‘집합 제한 언어’도 등장하였다. 본 연구에서는 ‘(Ab)(Cl) 집합 일치화’ 문제를 소개하고 ‘집합 등식 다시쓰기(rewrite)’를 사용하여 집합 일치화를 Prolog 언어를 사용하여 구현하였다. 본 연구에서는 순차적 언어에서는 구현하기 힘들었던 집합 일치화가 Prolog 언어와 같은 논리 언어에서는 비결정성 제어 구조와 리스트 자료 구조를 사용하여 쉽게 구현 가능함을 보였다. 본 연구는 기존 구현이 고가의 상업용 Prolog를 사용한 것과는 달리 GNU 일반 공용 라이센스(GPL)를 가지는 Ciao Prolog를 사용하였기 때문에 누구나 무료로 사용할 수 있다는 장점도 가지고 있다. 현재 본 연구의 결과를 사용하여 ‘집합제한 언어’가 구현 중이다.

• 제어로봇시스템학회논문지
• /
• 제17권2호
• /
• pp.176-182
• /
• 2011

Industrial network, often referred to as fieldbus, becomes an indispensable component for intelligent manufacturing systems. Thus, in order to satisfy the real-time requirements of field devices such as sensors, actuators, and controllers, numerous fieldbus protocols have been developed. But, the application of fieldbus has been limited due to the high cost of hardware and the difficulty in interfacing with multi-vendor products. As an alternative to fieldbus, the Ethernet (IEEE 802.3) technology is being adapted to the industrial environment. However, the crucial technical obstacle of Ethernet is its non-deterministic behavior that cannot satisfy the real-time requirements. Recently, the EtherCAT protocol becomes a very promising alternative for real-time industrial application due to the elimination of uncertainties in Ethernet. This paper focuses on the implementation of the IEC 61800 based real-time EtherCAT network for multi-axis smart driver. To demonstrate the feasibility of the implemented EtherCAT slave module, its synchronization performance is evaluated on the experimental EtherCAT testbed with a single axis smart driver.

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

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

• Structural Engineering and Mechanics
• /
• 제44권1호
• /
• pp.73-84
• /
• 2012

This paper strongly addresses to the problem of the mechanical systems in which parameters are uncertain and bounded. Interval calculation is used to find sharp bounds of the structural parameters for infilled frame system modeled with finite element method. Infill walls are generally treated as non-structural elements considerably to improve the lateral stiffness, strength and ductility of the structure together with the frame elements. Because of their complex nature, they are often neglected in the analytical model of building structures. However, in seismic design, ignoring the effect of infill wall in a numerical model does not accurately simulate the physical behavior. In this context, there are still some uncertainties in mechanical and also geometrical properties in the analysis and design procedure of infill walls. Structural uncertainties can be studied with a finite element formulation to determine sharp bounds of the structural parameters such as wall thickness and Young's modulus. In order to accomplish this sharp solution as much as possible, interval finite element approach can be considered, too. The structural parameters can be considered as interval variables by using the interval number, thus the structural stiffness matrix may be divided into the product of two parts which correspond to the interval values and the deterministic value.

• 한국지반공학회논문집
• /
• 제18권6호
• /
• pp.117-127
• /
• 2002

사면의 파괴면 형태를 간단한 비선형 함수로 모델링하여 해석하는 결정론적인 사면안정 해석은 지층의 복합 특성과 불연속적인 특성을 효과적으로 반영하지 못하는 단점이 있다. 따라서, 본 연구에서는 결정론적인 방법 보다 지층의 제반조건들을 다양하게 반영할 수 있는 임의 탐색기법인 유전자 알고리즘을 이용한 사면안정 해석 방법을 제시하였다. 제시된 방법의 적합성을 확인하기 위해 단일지층 및 복합지층을 대상으로 하여 제안된 방법과 결정론적인 방법을 비교.검토하였으며, 검토결과 유전자 알고리즘을 이용한 사면안정해석 방법의 적용성을 검증할 수 있었다. 또한 제시된 사면안정 해석 방법에 강우강도에 따른 지하수위의 변화 예측모델을 적용하여 보다 합리적인 사면안정 해석 방법을 제시하였다.

• Journal of applied mathematics & informatics
• /
• 제19권1_2호
• /
• pp.397-414
• /
• 2005

In the existing literature, most of the purchasing models were developed only for retailers problem ignoring the constraint of storage capacity of retailers shop/showroom. In this paper, we have developed a deterministic model of wholesaler-retailers' problem of single product. The storage capacity of wholesaler's warehouse/showroom and retailers' showroom/shop are assumed to be finite. The items are transported from wholesaler's warehouse to retailers' Own Warehouse (OW) in a lot. The customer's demand is assumed to be displayed inventory level dependent. Demands are met from OW and that spaces of OW will immediately be filled by shifting the same amount from the Rented Warehouse (RW) till the RW is empty. The time duration between selling from OW and filling up its space by new ones from RW is negligible. According to relative size of the retailers' existing (own) warehouse capacity and the demand factors, different scenarios are identified. Our objectives are to optimize the cost functions of wholesaler and two retailers separately. To solve this problem, a real coded Genetic Algorithm (GA) with roulette wheel selection/reproduction, whole arithmetic crossover and non-uniform mutation is developed. Finally a numerical example is presented to illustrate the results for different scenarios. To compare the results of GA, Generalised Reduced Gradient Method has been used for the problem. Also, a sensitivity analysis has been performed to study the variations of the optimal average cost with respect to the different parameters.

• Management Science and Financial Engineering
• /
• 제14권1호
• /
• pp.23-34
• /
• 2008

In this study, we consider stationary waiting times in a Poisson driven single-server m-node queues in series. We assume that service times at nodes are independent, and are either deterministic or non-overlapped. Each node excluding the first node has a finite waiting line and every node is operated under a FIFO service discipline and a communication blocking policy (blocking before service). By applying (max, +)-algebra to a corresponding stochastic event graph, a special case of timed Petri nets, we derive the explicit expressions for stationary waiting times at all areas, which are functions of finite buffer capacities. These expressions allow us to compute the performance measures of interest such as mean, higher moments, or tail probability of waiting time. Moreover, as applications of these results, we introduce optimization problems which determine either the biggest arrival rate or the smallest buffer capacities satisfying probabilistic constraints on waiting times. These results can be also applied to bounds of waiting times in more general systems. Numerical examples are also provided.

• 한국정보통신학회논문지
• /
• 제16권3호
• /
• pp.391-398
• /
• 2012

병렬 프로그램은 의도되지 않은 비결정적인 수행을 야기하므로 공유 메모리를 사용하는 병렬 프로그램에서는 경합을 탐지하는 것은 매우 중요하다. 수행 중 기법에서 경합을 탐지하기 위해서 요구되는 기억장소의 부담은 매우크다. 특히 동기화가 있는 병렬 프로그램에서 경합 탐지에 필요한 기억 공간의 문제는 더욱 심각하다. 그래서, 본 논문에서는 원시 프로그램의 시멘틱을 유지하면서 동기화를 가지는 공유 메모리 병렬 프로그램의 디버깅을 위한 루프 분리 기법을 제시한다. 이것은 동기화를 가지는 병렬 프로그램의 수행 중 경합 탐지에 필요로 하는 기억공간의 복잡성을 줄일 수 있고, 루프 분리된 프로그램을 수행 중에 감시하여 최초 경합들을 탐지할 수 있다.

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.621-638
• /
• 2009

The linear system Ax = b will have (i) no solution, (ii) only one non-trivial (trivial) solution, or (iii) infinity of solutions. Our focus will be on cases (ii) and (iii). The mathematical models of many real-world problems give rise to (a) ill-conditioned linear systems, (b) singular linear systems (A is singular with all its linearly independent rows are sufficiently linearly independent), or (c) ill-conditioned singular linear systems (A is singular with some or all of its strictly linearly independent rows are near-linearly dependent). This article highlights the scope and need of a randomized algorithm for ill-conditioned/singular systems when a reasonably narrow domain of a solution vector is specified. Further, it stresses that with the increasing computing power, the importance of randomized algorithms is also increasing. It also points out that, for many optimization linear/nonlinear problems, randomized algorithms are increasingly dominating the deterministic approaches and, for some problems such as the traveling salesman problem, randomized algorithms are the only alternatives.

• Communications for Statistical Applications and Methods
• /
• 제25권5호
• /
• pp.471-488
• /
• 2018

In this paper, we propose extending proportional hazards frailty models to allow a discrete distribution for the frailty variable. Having zero frailty can be interpreted as being immune or cured. Thus, we develop a new survival model induced by discrete frailty with zero-inflated power series distribution, which can account for overdispersion. This proposal also allows for a realistic description of non-risk individuals, since individuals cured due to intrinsic factors (immunes) are modeled by a deterministic fraction of zero-risk while those cured due to an intervention are modeled by a random fraction. We put the proposed model in a Bayesian framework and use a Markov chain Monte Carlo algorithm for the computation of posterior distribution. A simulation study is conducted to assess the proposed model and the computation algorithm. We also discuss model selection based on pseudo-Bayes factors as well as developing case influence diagnostics for the joint posterior distribution through ${\psi}-divergence$ measures. The motivating cutaneous melanoma data is analyzed for illustration purposes.