• 대한전자공학회논문지
• /
• 제21권5호
• /
• pp.1-6
• /
• 1984

본 논문에서는 여러 경우의 발견적함수가 논의되었다. 경로 찾기 알고리즘에 있어서는 목표까지 거리의 정확한 평가자를 구하는 것이 중요하다. 정확한 평가자가 존재하는 한 어느 공간이든 문제가 풀리는 영역이지만, 부정확한 평가자들로서도 가능한 영역에 흥미가 있으며 따라서 이 논문은 발견적정보의 효과적인 사용의 필요성을 느끼게 하여주는 경우들을 다루었으며, 이것은 최단경로 문제에 있어서 계산적인 접근에 사용하면 좋다.

• 한국멀티미디어학회논문지
• /
• 제22권6호
• /
• pp.684-694
• /
• 2019

Information spread in networks is universal in many real-world phenomena such as propagation of infectious diseases, diffusion of a new technology, computer virus/spam infection in the internet, and tweeting and retweeting of popular topics. The problem of finding the information source is to pick out the true source if information spread. It is of practical importance because harmful diffusion can be mitigated or even blocked e.g., by vaccinating human or installing security updates. This problem has been much studied, where it has been shown that the detection probability cannot be beyond 31% even for regular trees if the number of infected nodes is sufficiently large. In this paper, we study the impact of an anti-information spreading on the original information source detection. We consider an active defender in the network who spreads the anti-information against to the original information simultaneously and propose an inverse Voronoi partition based inference approach, called Voronoi Inference to find the source. We perform various simulations for the proposed method and obtain the detection probability that outperforms to the existing prior work.

• 한국정밀공학회지
• /
• 제12권8호
• /
• pp.156-167
• /
• 1995

In this paper, we propose a 3-D range finding method for situation that stereo camera has small translational motion. Binocular stereo generally tends to produce stereo correspondence errors and needs huge amount of computation. The former drawback is because the additional constraints to regularize the correspondence problem are not always true for every scene. The latter drawback is because they use either correlation or optimization to find correct disparity. We present a method which overcomes these drawbacks by moving the stereo camera actively. The method utilized a motion parallax acquired by monocular motion stereo to restrict the search range of binocular disparity. Using only the uniqueness of disparity makes it possible to find reliable binocular disparity. Experimental results with real scene are presented to demonstrate the effectiveness of this method.

• 정보처리학회논문지C
• /
• 제10C권3호
• /
• pp.367-376
• /
• 2003

본 연구는 로컬 네트워크의 토폴로지를 설계하거나 루트 노드로부터 여러 개의 통신 경로를 구하는 데 사용될 수 있는 DCMST(Delay constrained Capacitated Minimum Spanning Tree) 문제를 다룬다. 기존의 CMST 문제는 루트 노드의 한 포트가 담당하는 트래픽의 용량에만 제한이 있는 데 비해 DCMST 문제에는 네트워크 평균 지연 시간의 제약 조건이 추가된다. 이 문제는 종단 노드의 트래픽 요구량과 네트워크의 평균 지연 시간을 만족시키는 스패닝 트리의 집합을 구하는 것으로 목적 함수는 전체 링크 비용을 최소로 하는 것이다. 본 연구에서는 트레이드-오프에 기준한 노드 교환 알고리즘과 노드 이동 알고리즘 그리고 평균 지연 알고리즘으로 구성되는 2 단계 휴리스틱을 제시한다. 실제 계산 경험과 성능 분석을 통해 제안한 알고리즘이 평균 지연을 고려한 기존의 CMST 알고리즘보다 비용 측면에 있어 더 우수한 해를 생성할 수 있음을 보였다.

• 산업공학
• /
• 제13권3호
• /
• pp.479-485
• /
• 2000

We consider a Location-Allocation Problem with the Cost of Land(LAPCL). LAPCL has extremely huge size of problem and complex characteristic of location and allocation problem. Heuristics and decomposition approaches on simple Location-Allocation Problem were well developed in last three decades. Recently, genetic algorithm(GA) is used widely at combinatorics and NLP fields. A lot of research shows that GA has efficiency for finding good solution. Our main motive of this research is developing of a package for LAPCL. We found that LAPCL could be reduced to trivial problem, if locations were given. In this case, we can calculate fitness function by simple technique. We built a database constructed by zipcode, latitude, longitude, administrative address and posted land price. This database enables any real field problem to be coded into a mathematical location problem. We developed a package for a class of multi-location problem at PC. The package allows for an interactive interface between user and computer so that user can generate various solutions easily.

• Korean Journal of Mathematics
• /
• 제27권2호
• /
• pp.297-327
• /
• 2019

In this paper, we introduce and study a general iterative algorithm to approximate a common solution of split generalized equilibrium problem, variational inequality problem and fixed point problem for a finite family of nonexpansive mappings in real Hilbert spaces. Further, we prove a strong convergence theorem for the sequences generated by the proposed iterative scheme. Finally, we derive some consequences from our main result. The results presented in this paper extended and unify many of the previously known results in this area.

• 한국산업융합학회 논문집
• /
• 제20권5호
• /
• pp.385-393
• /
• 2017

The purpose of this study is explore stress, problem solving and emotional intelligence in nursing students. Participants were recruited from December 2016 to February 2017 by web base survey. The participants were 237 who nursing students in university. Stress, problem solving and emotional intelligence were assessed using two questionnaires; Korean version of the Perceived stress inventory (PSI), problem solving, and Wong and Law Emotional Intelligence Scale (WLEIS). The responses 237 students were analyzed statistically. Significantly emotional intelligence was a correlation stress and problem solving (p>.001). The findings showed that problem solving (${\beta}=.386$), stress (${\beta}=-.259$, empathy ability (${\beta}=.144$), and satisfaction with a major in nursing (${\beta}=.129$). Our finding show that stress levels of low and the problem solving levels of above moderate in emotional intelligence. Especially, the problem solving was important factor in emotional intelligence.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.613-616
• /
• 2000

This paper considers the problem of subway crew scheduling. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper, we propose two basic techniques that solve the problem in a reasonable time, though the optimality of the solution is not guaranteed. To reduce the number of variables, we adopt column-generation technique. We could develop an algorithm that solves column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational results show column-generation makes the problem of treatable size, and variable fixing enables us to solve LP relaxation in shorter time without a considerable increase in the optimal value. Finally, we were able to obtain an integer optimal solution of a real instance within a reasonable time.

• 한국산학기술학회논문지
• /
• 제12권8호
• /
• pp.3706-3714
• /
• 2011

본 연구는 주어진 시간 내에 현재의 열차운행계획을 바꾸지 않고 추가적으로 수송할 수 있는 화물의 최대량과 수송 일정을 찾고자 하는 알고리즘에 관한 것이다. 이를 위해 시간전개형 네트워크로 주어진 문제를 표현한 후, 전처리 절차를 통해 불필요한 호들을 제거하는 방법으로 정적네트워크에 반복적인 최대유통문제를 적용하여 기존 열차운행계획을 고려한 화물의 최대량과 수송일정을 제시하는 절차를 예시와 함께 제시하였다.

• Journal of applied mathematics & informatics
• /
• 제41권3호
• /
• pp.647-656
• /
• 2023

In this work, we are concerned by the problem of identification of noisy terms which arise in singular problem as for remote sensing problems, and which are modeled by a linear singular parabolic equation. For the reason of missing some data that could be arisen when using the traditional sentinel method, the later will be changed by a new sentinel method for attaining the same purpose. Such new method is a particular least square-like method which permits one to distinguish between the missing terms and the pollution terms. In particular, a sentinel method will be given here in its more realistic setting for singular parabolic problems, where in this case, the observation and the control have their support in different open sets. The problem of finding a new sentinel is equivalent to finding singular optimality system of the least square control for the parabolic equation that we solve.