• 한국산업정보학회논문지
• /
• 제8권2호
• /
• pp.45-53
• /
• 2003

본 연구가 갖는 중요성은 두 가지로 요약된다. 첫째는 질의 확장 검색 방법으로 사전에서 나타나는 용어를 질의의 추가용어로 채택하는 것이다. 이 방법은 기존의 피드백 확정 방법이 갖는 2차적 검색 과정을 줄인다. 둘째는 초기 질의어와 추가용어 사이에 가중치를 달리 적용하여 재현율과 정확률을 동시에 높일 수 있는 최적의 모델을 제시하였다. 이렇게 함으로써 정보 검색의 성능을 크게 향상시킬 수 있는 방법을 제시하고 있다.

• 대한교통학회지
• /
• 제21권1호
• /
• pp.103-113
• /
• 2003

본 연구는 교통 경로 탐색 가운데, 우회 경로 탐색과 선호 경로 탐색을 하였으며, 계층 분석법을 적용한 퍼지비가법 제어기 사용을 제안한다. 이것은 기존의 경로 탐색과는 달리, 인간의 사고과정에 착안한 것으로, 애매한 주관적 판단을 정량적으로 분석, 평가하였다. 그리고 중요도를 운전 전문가로부터 의견 수렴한 것을 기초로 도출하였으며, 실제효용성을 진단하고자 경로 모델의 예를 사용하였다. 모델 평가는 평가 요소에 대한 속성 소속 함수화 및 평가치 규정, 계층 분석법에 의한 중요도 결정, $\lambda$-퍼지 척도에 의한 중요도의 비 가법적 표현, Choquet 퍼지 적분 등으로 수행하였다. 결국, 우회 경로 탐색 결과, 시시각각 변하는 교통환경에 적응할 수 있는 실 시간적인 교통 경로 제어가 가능하였으며, 선호 경로 탐색 결과, 본 연구의 알고리즘이 운전자 개인의 교통 경로 선택 성향을 잘 반영함을 보여 주었다. 논문은 5 가지의 중요한 의미가 있다. (1) 제안된 접근 방법은 운전자의 경로 선택 결정 과정과 유사하다. (2) 제안된 접근 방법은 다 속성의 경로 평가 기준을 제어 할 수 있다. (3) 제안된 접근 방법은 운전자의 주관적 판단을 비가법적으로 객관화 할 수 있다. (4) 제안된 접근 방법은 우회 경로 탐색에서 동적인 경로 탐색을 보여주고 있다 (5) 제안된 접근 방법은 선호 경로 탐색에서 개개 운전자 속성을 고려할 수 있다.

• 한국멀티미디어학회논문지
• /
• 제20권7호
• /
• pp.986-993
• /
• 2017

Object Tracking is a technique for tracking moving objects over time in a video image. Using object tracking technique, many research are conducted such a detecting dangerous situation and recognizing the movement of nearby objects in a smart car. However, it still remains a challenging task such as occlusion, deformation, background clutter, illumination variation, etc. In this paper, we propose a novel deep visual object tracking method that can be operated in robust to many challenging task. For the robust visual object tracking, we proposed a Convolutional Neural Network(CNN) which shares weight of the convolutional layers. Input of the CNN is a three; first frame object image, object image in a previous frame, and current search frame containing the object movement. Also we propose a method to consider the motion of the object when determining the current search area to search for the location of the object. Extensive experimental results on a authorized resource database showed that the proposed method outperformed than the conventional methods.

• 한국컴퓨터정보학회논문지
• /
• 제22권12호
• /
• pp.49-54
• /
• 2017

Pathfinding for pedestrians provided by various navigation programs is based on a shortest path search algorithm. There is no big difference in their guide results, which makes the path quality more important. Multiple criteria should be included in the search cost to calculate the path quality, which is called a multi-criteria pathfinding. In this paper we propose a user adaptive pathfinding algorithm in which the cost function for a multi-criteria pathfinding is defined as a weighted sum of multiple criteria and the weights are learned automatically by Perceptron learning. Weight learning is implemented in two ways: short-term weight learning that reflects weight changes in real time as the user moves and long-term weight learning that updates the weights by the average value of the entire path after completing the movement. We use the weight update method with momentum for long-term weight learning, so that learning speed is improved and the learned weight can be stabilized. The proposed method is implemented as an app and is applied to various movement situations. The results show that customized pathfinding based on user preference can be obtained.

• 보건행정학회지
• /
• 제28권2호
• /
• pp.119-127
• /
• 2018

Background: This study aimed to examine (1) the patterns of online health information search with respect to seeking and scanning, and (2) how online search, along with eHealth literacy, predicts perceived information usefulness in the context of diet and weight control. Methods: Online survey was conducted with 299 adults from the consumer panel recruited for the purpose of quality assessment of the Korean National Health Information Portal in 2016. We conducted paired sample t-test and multiple logistic regression to address the research questions. Data analysis was performed using IBM SPSS Statistics ver. 24.0 (IBM Corp., Armonk, NY, USA) and SAS ver. 9.3 (SAS Institute Inc., Cary, NC, USA). Results: Of the respondents, 38.8% were 'high seek-high scanners,' 35.8% were 'low seek-low scanners,' 13.0% were 'high seek-low scanners,' and 12.4% were 'low seek-high scanners.' eHealth literacy was a significant, positive predictor of online information scanning (odds ratio [OR], 2.46; 95% confidence interval [CI], 1.41-4.29), but not for online information seeking (OR, 1.75; 95% CI, 1.00-3.05). With respect to perceived usefulness of online information seeking, online seeking (OR, 4.90; 95% CI, 2.19-11.00) and eHealth literacy (OR, 2.30; 95% CI, 1.11-4.75) were significant predictors. Perceived usefulness of online scanning had a significant association with online scanning (OR, 2.38; 95% CI, 1.08-5.22), but not with eHealth literacy. Conclusion: To increase the effectiveness of the health policy for online information search and related outcomes in the context of diet and weight control, it is important to develop education programs promoting eHealth literacy.

• Structural Engineering and Mechanics
• /
• 제29권4호
• /
• pp.391-410
• /
• 2008

In this article, a harmony search algorithm is presented for optimum design of steel frame structures. Harmony search is a meta-heuristic search method which has been developed recently. It is based on the analogy between the performance process of natural music and searching for solutions of optimization problems. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Load and Resistance Factor Design (LRFD) and AISC Allowable Stress Design (ASD) specifications, maximum (lateral displacement) and interstorey drift constraints, and also size constraint for columns were imposed on frames. The results of harmony search algorithm were compared to those of the other optimization algorithms such as genetic algorithm, optimality criterion and simulated annealing for two planar and two space frame structures taken from the literature. The comparisons showed that the harmony search algorithm yielded lighter designs for the design examples presented.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(3)
• /
• pp.13-16
• /
• 2000

In this paper, we propose hybrid control method of neural network using the 3-point search algorithm. Proposed control method is searched the weight using the 3-point search algorithm for off-line then control the on-line. In order to verify the usefulness of the proposed method, we simulated the proposed control method with one link manipulator system and confirmed the excellency.

• Structural Engineering and Mechanics
• /
• 제45권1호
• /
• pp.111-127
• /
• 2013

In this paper, a new version of gravitational search algorithm based on opposition-based learning (OBGSA) is introduced and applied for optimum design of reinforced concrete retaining walls. The new algorithm employs the opposition-based learning concept to generate initial population and updating agents' position during the optimization process. This algorithm is applied to minimize three objective functions include weight, cost and $CO_2$ emissions of retaining structure subjected to geotechnical and structural requirements. The optimization problem involves five geometric variables and three variables for reinforcement setups. The performance comparison of the new OBGSA and classical GSA algorithms on a suite of five well-known benchmark functions illustrate a faster convergence speed and better search ability of OBGSA for numerical optimization. In addition, the reliability and efficiency of the proposed algorithm for optimization of retaining structures are investigated by considering two design examples of retaining walls. The numerical experiments demonstrate that the new algorithm has high viability, accuracy and stability and significantly outperforms the original algorithm and some other methods in the literature.

• 한국컴퓨터정보학회논문지
• /
• 제22권6호
• /
• pp.49-55
• /
• 2017

Robots, games and life applications have been developed while computer areas are developed. Moreover, various applications have been utilized for various users including the early childhood. Recently, smart phones have been dramatically used by various users including early childhood. Many applications need to find a path from a starting point to destinations. For example, without using real maps, users can find the direct paths for the destinations in realtime. Specifically, path exploration in game programs is so important to have accurate results. Nowadays, with these techniques, diverse applications for educations of early childhood have been developed. To deal with the functions, necessity of efficient path search programs with high accuracy becomes much higher. In this paper, we design and develop a friendly maze program for early childhood based on a path searching algorithm. Basically, the path of lineal distance from a starting location to destination is considered. Moreover, weight values are calculated by considering heuristic weighted h(x). In our approach, A* algorithm searches the path considering weight values. Moreover, we utilize depth first search approach instead of breadth first search in order to reduce the search space. so it is proper to use A* algorithm in finding efficient paths although it is not optimized paths.

• Steel and Composite Structures
• /
• 제7권3호
• /
• pp.253-262
• /
• 2007

A methodology to design symmetrically laminated fibre-reinforced structures under transverse loads for minimum weight, with manufacturing uncertainty in the ply angle, is described. The ply angle and the ply thickness are the design variables, and the Tsai-Wu failure criteria is the design constraint implemented. It is assumed that the probability of any tolerance value occurring within the tolerance band, compared with any other, is equal, and thus the approach is a worst-case scenario approach. The finite element method, based on Mindlin plate and shell theory, is implemented, and thus effects like bending-twisting coupling are accounted for. The Golden Section method is used as the search algorithm, but the methodology is flexible enough to allow any appropriate finite element formulation, search algorithm and failure criterion to be substituted. In order to demonstrate the procedure, laminated plates with varying aspect ratios and boundary conditions are optimally designed and compared.