• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.501-504
• /
• 2003

This paper presents a new fractal coding scheme to find more optimal transformation by estimation of the optimal attractor. The conventional fractal coding schemes based on the collage theorem obtain the transformation to minimize the distance between an original image and its collage image. Heavy computation is why the schemes widely adopt the theorem. In other words, the optimal transformation can be obtained after the attractors of all the possible transformations are generated and then compared with an original image. It is clear that this process is not practical. Therefore, we introduce a sub-optimal scheme that provides better transformation than the conventional scheme, relieving the complexity problem in the optimal transformation. In a simple case, the optimal transformation can be obtained considering all the attractors and then our scheme is compared with the optimal. In general cases not to be able to find the optimal, our scheme is also evaluated and compared with the conventional schemes.

• 지적과 국토정보
• /
• 제49권2호
• /
• pp.109-122
• /
• 2019

맞벌이 가구의 증가로 육아에 대한 사회적 관심이 커지고 있다. 특히 자녀의 초등학교 입학은 상대적으로 이른 하교시간 때문에 돌봄의 공백이 생겨 출산과 더불어 여성의 경력단절에 주된 원인으로 꼽힌다. 본 연구는 이러한 정책적 기조에 부합하여 초등학생 대상 돌봄시설의 최적 입지선정 방안을 제안하였다. 돌봄시설의 후보로 기존 아이돌봄시설을 대상으로 하였으며, 최적입지 선정 시 수리적 최적화뿐만 아니라 입지적 특성을 고려하는 이중구조의 평가방법을 사용하였다. 실험은 서울시 송파구를 대상으로 진행하였으며, 총 258개의 후보시설 중 36개의 최적입지를 선정하였다. 먼저 공공데이터를 활용하여 돌봄시설의 특성에 맞는 평가기준을 세운 후 입지점수를 매겨 이에 해당하는 1차 후보시설을 선별하였으며, 이때 다양한 공공데이터를 하나로 통합하기 위하여 격자리샘플링 방법을 사용하였다. 다음으로 선별된 시설을 대상으로 공간 최적화 모델인 p-median 방법을 활용하여 최종 돌봄시설을 선정하였다. 이렇게 선정된 결과는 총 거리를 고려한 위치적 최적해 일뿐 아니라 돌봄시설의 특성을 고려한 다양한 입지적 기준을 만족하는 값이다. 본 연구에서 제안한 방법을 통해 공공데이터 융합 및 활용도를 높일 수 있고, 공공시설 최적입지 선정 시 정책 의사결정에 도움을 줄 것으로 기대한다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.380-383
• /
• 2003

In this paper, we propose a fuzzy group decision making method for multiple decision maker-multiple objective programming problems to obtain the agreeable solution. In the proposed method, considering the vague nature of human subjective judgement it is assumed that each of multiple decision makers has a fuzzy goal for each of his/her own objective functions. After eliciting the membership functions from the decision makers for their fuzzy goals, total M-Pareto optimal solution concept is defined in membership spaces in order to deal with multiple decision maker-multiple objective programming problems. For generating a candidate of the agreeable solution which is total M-Pareto optimal, the extended weighted minimax problem is formulated and solved for some weighting vector which is specified by the decision makers in their subjective manner, Given the total M-Pareto optimal solution, each of the derision makers must either be satisfied with the current values of the membership functions, or update his/her weighting vector, However, in general, it seems to be very difficult to find the agreeable solution with which all of the decision makers are satisfied perfectly because of the conflicts between their membership functions. In the proposed method, each of the decision makers is requested to estimate the degree of satisfaction for the candidate of the agreeable solution. Using the estimated values or satisfaction of each of the decision makers, the core concept is desnfied, which is a set of undominated candidates. The interactive algorithm is developed to obtain the agreeable solution which satisfies core conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권7호
• /
• pp.1252-1273
• /
• 2011

In Web Service Composition (WSC) area, services selection aims at selecting an appropriate candidate from a set of functionally-equivalent services to execute the function of each task in an abstract WSC according to their different QoS values. In despite of many related works, few of previous studies consider transactional constraints in QoS-aware WSC, which guarantee reliable execution of Composite Web Service (CWS) that is composed by a number of unpredictable web services. In this paper, we propose a novel global selection-optimal approach in WSC by considering both transactional constraints and end-to-end QoS constraints. With this approach, we firstly identify building rules and the reduction method to build layer-based Directed Acyclic Graph (DAG) model which can model transactional relationships among candidate services. As such, the problem of solving global optimal QoS utility with transactional constraints in WSC can be regarded as a problem of solving single-source shortest path in DAG. After that, we present Graph-building algorithms and an optimal selection algorithm to explain the specific execution procedures. Finally, comprehensive experiments are conducted based on a real-world web service QoS dataset. The experimental results show that our approach has better performance over other competing selection approaches on success ratio and efficiency.

• 융합신호처리학회논문지
• /
• 제21권2호
• /
• pp.55-60
• /
• 2020

본 논문에서는 우선순위와 문턱치를 가지고 최적 후보의 조기 탐지를 이용한 움직임 추정의 고속 블록 매칭 알고리즘을 제안한다. 전 영역 탐색(full search) 알고리즘의 계산량을 줄이기 위해 많은 고속 움직임 추정 알고리즘이 발표되었지만, 여전히 움직임 추정 성능을 향상시키기 위한 많은 연구가 보고되고 있다. 제안된 알고리즘은 이전 부분 매칭 오류에서 우선순위가 높은 각 후보에 대한 블록 매칭 오류를 계산한다. 제안된 알고리즘은 대부분의 기존 고속 블록 매칭 알고리즘에 추가적으로 적용하여 속도를 높일 수 있다. 그렇게 함으로써 최소 오류 지점을 조기에 찾고 불가능한 후보에 대한 불필요한 계산을 줄임으로써 속도를 높일 수 있다. 제안된 알고리즘은 전 영역 탐색 알고리즘과 동일한 예측 화질을 가지면서 기존의 고속 무손실 탐색 알고리즘보다 적은 계산을 사용한다. 실험결과로서, 제안된 알고리즘은 예측 화질 저하 없이 PDE 및 전 영역 탐색 방법의 계산에 비해 30 ~ 70%까지 줄일 수 있으며, 다른 고속 손실 알고리즘을 사용하면 더욱 감소시키는 것으로 나타났다.

• 산업경영시스템학회지
• /
• 제23권59호
• /
• pp.1-10
• /
• 2000

The traveling salesman problem is a representative NP-Complete problem. It needs lots of time to get a solution as the number of city increase. So, we need an efficient heuristic algorithm that gets good solution in a short time. Almost edges that participate in optimal path have somewhat low value cost. This paper discusses the property of nearest neighbor and 3-opt. This paper uses nearest neighbor's property to select candidate edge. Candidate edge is a set of edge that has high probability to improve cycle path. We insert edge that is one of candidate edge into intial cycle path. As two cities are connected. It does not satisfy hamiltonian cycle's rule that every city must be visited and departed only one time. This paper uses 3-opt's method to sustain hamiltonian cycle while inserting edge into cycle path. This paper presents a highly efficient heuristic algorithm verified by numerous experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4771-4787
• /
• 2019

Aimed at the disclosure risk of mobile terminal user's location privacy in location-based services, a location-privacy protection scheme based on similar trajectory substitution is proposed. On the basis of the anonymized identities of users and candidates who request LBS, this scheme adopts trajectory similarity function to select the candidate whose trajectory is the most similar to user's at certain time intervals, then the selected candidate substitutes user to send LBS request, so as to protect user's privacy like identity, query and trajectory. Security analyses prove that this scheme is able to guarantee such security features as anonymity, non-forgeability, resistance to continuous query tracing attack and wiretapping attack. And the results of simulation experiment demonstrate that this scheme remarkably improve the optimal candidate' trajectory similarity and selection efficiency.

• 한국통신학회논문지
• /
• 제34권1C호
• /
• pp.37-47
• /
• 2009

본 논문은 무선망과 같이 패킷 손실이 많은 환경에 H.264 부호화 영상이 전송될 때 복호기 단말기에서 손실된 움직임 벡터를 효율적으로 에러은닉 방법에 대하여 2가지를 제안한다. 첫째, 손실된 블록(매크로블록)에 대하여 후보벡터집합(candidate vector set)을 선정하는 방법으로는 손실된 블록에 인접한 주변 블록의 움직임벡터들의 높은 상관성을 착안하여 후보벡터를 선정한다. 이때 제안한 알고리즘은 주변 블록의 움직임벡터들 간에 거리를 이용하여 클러스터한다. 클리스터된 움직임 벡터 집합(클러스터 집합)에서 최적의 후보벡터 선택방법은 중앙값을 선택한다. 둘째, 손실된 블록의 최종의 후보벡터를 선정하는 방법으로는 후보벡터집합에서 주변에 인접한 픽셀간의 방향성을 고려하여 왜곡 값이 최소인 벡터를 후보벡터로 결정한다. 패킷이 손실되는 환경에서 실험한 결과, 제안한 에러 은닉 방법은 기존 방법에 비하여 후보벡터 개수가 평균적으로 $23%{\sim}61%$까지 감소하였고, 디코딩 시간이 평균적으로 $3{\sim}4$(sec) 감소하였다. 또한 화질에 대한 객관적 평가 기준인 PSNR은 평균적으로 기존 방법들과 거의 비슷하였다.

• 전기학회논문지
• /
• 제67권7호
• /
• pp.846-853
• /
• 2018

In this paper, an improved model predictive control (MPC) method is proposed, which reduces the amount of calculations caused by the increased number of candidate voltage vectors with the increased voltage level in multi-level inverters. When the conventional MPC method is used for multi-level inverters, all candidate voltage vectors are considered to predict the next-step current value. However, in the case that the sampling time is short, increased voltage level makes it difficult to consider the all candidate voltage vectors. In this paper, the improved MPC method which can get a fast transient response is proposed with a small amount of the computation by adding new candidate voltage vectors that are set to find the optimal vector. As a result, the proposed method shows faster transient response than the method that considers the adjacent vectors and reduces the computational burden compared to the method that considers the whole voltage vector. the performance of the proposed method is verified through simulations and experiments.

• Smart Structures and Systems
• /
• 제10권6호
• /
• pp.573-591
• /
• 2012

In this study, a procedure to design an optimal LCVA that maximizes the equivalent damping ratio added to the primary structure subjected to along-wind excitation is proposed. That design procedure does not only consider the natural frequency and damping ratio of the LCVA, but also the proportion of the U-shaped liquid, which is closely related to the participation ratio of the liquid mass in inertial force. In addition, constraints to ensure the U-shape of the liquid are considered in the design process, so that suboptimal solutions that violate the optimal tuning law partly are adopted as a candidate of the optimal LCVA. The proposed design procedure of the LCVA is applied to the control of the 76-story benchmark building, and the optimal proportions of the liquid shape under various design conditions are compared.