• 디자인학연구
• /
• 제18권4호
• /
• pp.139-146
• /
• 2005

지금까지의 애니메이션 작업은 애니메이터의 객관적 감성과 경험에 의해 이루어져 왔다. 소프트웨어 디자인에 있었어도 지성적인 데이터들을 바탕으로 제작되어져 왔다. 이는 객관화하기 용이한 자료로서 데이터화하기가 쉬웠기 때문 일 것으로 보인다. 이와는 반대로 인간의 감성은 객관화하고 디지털화하기 어려운 요소들이 많이 존재한다. 본 연구는 디지털화하기 어려운 인간의 감성적 데이터를 객관화하고 이를 정량적 데이터로 활용할 수 있는 방법에 대한 부분으로 나는(flying) 궤적(path)을 연구 대상으로 하였다. 실험에 있어 인간이 나는 제적에 대해 어떻게 표현하는지에 대한 감성어를 수집하였다. 수집한 감성어를 통해 감성 평가어를 추출하고 추출한 감성 평가어에서 느껴지는 나는 궤적에 대한 스케치 이미지를 수집하였다. 수집한 스케치 이미지를 기초로 본 연구의 핵심이 되는 실험 동영상 샘플을 제작하였다. 다음으로 나는 궤적을 나타내는 감성어에 대한 물리적 요소와 동영상 샘플과의 상관관계를 분석하기 위해 수량화이론III류와 수량화이론I류를 각각 이용하였다. 그 결과 감성어와 동영상 샘플과의 구조를 파악 할 수 있었고, 나는 궤적에 대한 감성반응의 물리적 자극요소 또한 분석 할 수 있었다. 나는 궤적은 오브젝트(object)가 지나간 경로(path)에 해당한다. 이러한 경로(궤적)를 보고 감성자극 요소들이 복합적으로 작용하여 독특한 감성어로 표현되어 지는 것으로 보인다. 여기엔 감성을 자극하는 요소들이 존재하는데, 그 요소로는 속도, 회전, 규칙 그리고 호의 길이가 그 물리적 요소인 것으로 파악되었다. 본 연구를 통해 나는 궤적의 애니메이션을 표현하는데 있어 애니메이터들의 주관적인 감성 표현들을 객관화, 정량화 시키고자 하였으며, 본 연구의 데이터는 감성 애니메이션 시스템 설계에 있어 기본 데이터로 적용되는 것을 목표로 하고 있다.

• 한국항해항만학회지
• /
• 제47권1호
• /
• pp.10-17
• /
• 2023

최근 자율운항선박 개발을 위한 연구가 국내외에서 추진 중에 있다. 자율운항선박 개발에서 핵심기술 중 하나는 항로추종인데, 항로추종은 선박의 안전성 확보에 중요하기 때문에 자율운항선박 설계 시 사전평가 해야 한다. 본 연구의 목적은 자율운항선박 설계 시 항로추정성능의 시각적 및 정량적 평가기법을 개발하기 위한 것이다. 이 평가기법은 전산유체역학 기반의 자유 항주 모델과 LOS(Line-of-Sight) 알고리즘을 연계하여 개발하였다. 평가기법 중, 시각적 평가는 항로추종 중인 선박에 의해 생성되는 파계를 전산유체역학 소프트웨어를 이용하여 가시화하여 평가하고, 정량적 평가는 목표 선수방위각과 추정 선수방위각 사이의 차이 값과 계획항로와 추종항로 사이의 거리 차이 값을 이용하여 평가하였다. 항로추종성능 평가 결과, 항로추종 중 변침지점 부근에서 항로이탈편차가 크게 발생함을 알았고, 또한 선박 주위 유동의 시각화를 통해 선박 주위 유체 현상을 쉽게 파악할 수 있었다. 본 연구에서 제안한 평가기법은 자율운항선박 설계 시 항로추정성능 평가에 관한 시각적 및 정량적 평가에 기여할 것으로 기대된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권2호
• /
• pp.678-690
• /
• 2014

The current networks do not disclose information about a management domain due to scalability, manageability and commercial reasons. Therefore, it is very hard to calculate an optimal path to the destination. Also, due to poor information sharing, if an error occurs in the intermediate path, it is very difficult to re-search the path and find the best path. Hence, to manage each domain more efficiently, an architecture with top-level path computation node which can obtain information of separate nodes are highly needed This study aims to investigate a federation of a united network around NRN(National Research Network) that could allow resource sharing between countries and also independent resource management for each country. Considering first the aspects that can be accessed from the perspective of a national research network, ICE(Information Control Element) and GFO(Global Federation Organizer)-based architecture is designed as a top-level path computation element to support traffic engineering and applied to the multi-domain network. Then, the federation for the independent management of resources and resource information sharing among national research networks have been examined.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.759-762
• /
• 2005

Recently, Intelligent Transportation System(ITS) has been applied to satisfy increasing traffic demand every year and to solve many traffic problems. Especially, Advanced Traveller Information System(ATIS) is a transportation system to optimize the trip of each other vehicle. It is important to provide the driver with quick and comfortable path from source to destination. However, it is difficult to provide a shortest path in a road network with dynamic cost. Because the existing research has a static cost. Therefore, in this paper we propose an operator for searching traffic dependent shortest path. The proposed operator finds the shortest path from source to destination using a current time cost and a difference cost of past time cost. Such a method can be applied to the road status with time. Also, we can expect a predicted arrival time as well as the shortest path from source to destination. It can be applied to efficiently application service as ITS and have the advantages of using the road efficiently, reducing the distribution cost, preparing an emergency quickly, reducing the trip time, and reducing an environmental pollution owing to the saving the fuel.

• 대한치과보철학회지
• /
• 제21권1호
• /
• pp.67-72
• /
• 1983

Path of insertion(1) can be defined that the direction of movement of an appliance from the point of initial contact of its rigid parts with the supporting teeth to the place of final rest. Krol(2) described that in the conventional path of insertion, all the rests are seated more or less simultaneously but in the use of the rotational path one segment of the partial denture is seated first then the remainder of the prosthesis is rotated into position. The rotational path of insertion is limited primarily to the tooth borne prosthesis. Its great advantages are the elimination of anterior clasps to improve ethetic and reduction of tooth coverage to minimize plaque accumulation. Either a rigid minor connector or proximal plate provides retention through its intimate contact with a proximal tooth surface below the height of contour as indicated at a o-degree tilt. A specially designed rest in conjunction with this retentive component satisfies the basic requirements of clasp design. The purpose of this study was a clinical evaluation of rotational path removable partial dentures. Author delivered rotational path removable partial dentures to three different cases of patients and evaluated function of the dentures, difficulties of removal and insertion of the dentures and supporting structures of the abutment teeth by means of clinical and X-ray examinations for eighteen months. According to the examination data author came to the conclusion that the prognosis of the rotational path removable partial dentures was excellent.

• Journal of Communications and Networks
• /
• 제8권2호
• /
• pp.228-233
• /
• 2006

Survivability is a very important requirement for the deployment of broadband networks because out of service links can affect volumes of traffic even if it is a very short time. And the data paths of broadband networks, which are critical for traffic engineering, are always necessary to be well protected. The procedure of protection or restoration for a path is initiated when failure is detected within the working path. In order to minimize the influence on transmission quality caused by the failure of links and to provide a definite time for the recovery from the failure, the protection switching time (PST) should be carefully considered in the path arrangement. Several researches have been devoted to construct the protection and restoration schemes of data paths over dense wavelength division multiplexing (DWDM) networks, however, there was rare research on the design of data paths with guaranteed protection switching time. In this paper, the PST-guaranteed scheme, which is based on the concept of short leap shared protection (SLSP), for the arrangement of data paths in DWDM networks is proposed. The proposed scheme provides an efficient procedure to determine a just-enough PST-guaranteed backup paths for a working path. In addition to selecting the PST-guaranteed path, the network cost is also considered in a heuristic manner. The experimental results demonstrate that the paths arranged by the proposed scheme can fully meet the desired PST and the required cost of the selected path is competitive with which of the shared path scheme.

• 한국IT서비스학회지
• /
• 제20권1호
• /
• pp.93-115
• /
• 2021

Various policy declarations and institutional experiments involving artificial intelligence are being made in most countries. Depending on how the artificial intelligence policy changes, the role of the government, the scope of the policy, and the policy means used may vary, which can lead to the success or failure of the policy. This study proposed a perspective on AI(Artificial Intelligence) in policy research, investigated the theory of path change, and derived the characteristics of path change in AI policy. Since AI policy is related to a wide range of policy areas and the policy making is at the start points, this study is based on the neo-institutional path theory about the types of institutional changes. As a result of this study, AI policy showed the characteristics of path creation, and in detail presented the conflict relationship between institutional design elements, the scalability of policy areas, policy stratification and policy mix, the top policy characteristics transcending the law, and the experiment for regulatory innovation. Since AI can also be used as a key tool for policy innovation in the future, research on the path and characteristics of AI policy will provide a new direction and approach to government policy or institutional innovation seeking digital transformation.

• 한국CDE학회논문집
• /
• 제17권4호
• /
• pp.246-252
• /
• 2012

The piping route of hydraulic hose is designed with avoiding interferences to surrounding components. However, in a real practice, the piping route is mostly decided with an expert's experiences on site due to the complexity of design. Thus, this paper proposes a design methodology of the optimized route of a hose. We use NURBS representation to describe the piping route, which is possible to be locally modified, and an energy minimization method is applied to avoid interferences to the surroundings. In other words, the NURBS curve describing a piping route is modified to meet the desired positions from minimizing the perturbation of the control points, and the strain energy of the curve is then optimized to make the curve natural. The proposed method is implemented and its feasibility is validated using the commercial CAD software, CATIA V5.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2007년도 추계학술대회 논문집
• /
• pp.47-48
• /
• 2007

• 한국CDE학회논문집
• /
• 제2권1호
• /
• pp.28-34
• /
• 1997

A swept volume is a useful tool for solving various types of interference problems. Previous works have concentrated on sweeping an object along an arbitrary path, that results in complex algorithms. This paper concerns the volume swept by translating an object along a linear path. After analyzing the structure of the swept volume, we present an incremental algorithm for constructing a swept volume. Our algorithm takes O(n/sup 2/ *.alpha.(n)+T/sub c/) time where n is the number of vertices in the original object and T/sub c/ is time for handling face cycles.