• Title/Summary/Keyword: Searching Navigation

Search Result 135, Processing Time 0.02 seconds

Study on the Contact Response analysis Technique of Marine Slender Structure (수중세장체의 접촉응답해석 기법에 관한 연구)

  • Kim, Hyung-Woo;Hong, Sup;Choi, Jong-Su;Yeu, Tae-Kyeong
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.1
    • /
    • pp.211-216
    • /
    • 2006
  • Dynamic analysis of a marine slender structure is often involved with contacts among bodies or between bodies and seafloor. This paper presents an efficient and general contact search algorithm for dynamics in the context of the compliance contact model. A global detecting method that a bounding box is divided into several pieces in global coordinate system is presented in this paper. The method has an advantage that the number of contacting searching can be smaller than other methods for a system. The developed an efficient contact search algorithm is applied to the simulation program of 3D nonlinear dynamics of slender structure. Some examples are presented to show the validity of the proposed method.

  • PDF

A Study on the Contact Response Analysis Technique for Marine Slender Structure (수중세장체의 접촉응답해석 기법에 관한 연구)

  • Hong, Sup;Choi, Jong-Su;Yeu, Tae-Kyeong;Kim, Hyung-Woo
    • Journal of Navigation and Port Research
    • /
    • v.31 no.1 s.117
    • /
    • pp.15-20
    • /
    • 2007
  • Dynamic analysis of a marine slender structure is often involved with contacts among bodies or between bodies and seafloor. This paper presents an efficient and general contact search algorithm for dynamics in the context of the compliance contact model. A global detecting method that a bounding box is divided into several pieces in global coordinate system is presented in this paper. The method has an advantage that the number of contacting searching am be smaller than other methods for a system. The developed an efficient contact search algorithm is applied to the simulation program of 3D nonlinear dynamics of slender structure. Some examples are presented to show the validity of the proposed method.

Tangible Interaction : Application for A New Interface Method for Mobile Device -Focused on development of virtual keyboard using camera input - (체감형 인터랙션 : 모바일 기기의 새로운 인터페이스 방법으로서의 활용 -카메라 인식에 의한 가상 키보드입력 방식의 개발을 중심으로 -)

  • 변재형;김명석
    • Archives of design research
    • /
    • v.17 no.3
    • /
    • pp.441-448
    • /
    • 2004
  • Mobile devices such as mobile phones or PDAs are considered as main interlace tools in ubiquitous computing environment. For searching information in mobile device, it should be possible for user to input some text as well as to control cursor for navigation. So, we should find efficient interlace method for text input in limited dimension of mobile devices. This study intends to suggest a new approach to mobile interaction using camera based virtual keyboard for text input in mobile devices. We developed a camera based virtual keyboard prototype using a PC camera and a small size LCD display. User can move the prototype in the air to control the cursor over keyboard layout in screen and input text by pressing a button. The new interaction method in this study is evaluated as competitive compared to mobile phone keypad in left input efficiency. And the new method can be operated by one hand and make it possible to design smaller device by eliminating keyboard part. The new interaction method can be applied to text input method for mobile devices requiring especially small dimension. And this method can be modified to selection and navigation method for wireless internet contents on small screen devices.

  • PDF

Measurement of Port Service Quality in Container Transport Logistics Using Importance -Performance Analysis: A Case of Busan Port

  • Ha, Min-Ho;Ahn, Ki-Myung
    • Journal of Navigation and Port Research
    • /
    • v.41 no.5
    • /
    • pp.353-358
    • /
    • 2017
  • This study aims to propose an assessment tool of port service quality (PSQ) in the context of container transport logistics (CTLs), by taking the perspectives from port users. The CTLs defined in this study are the relevant activities of serving the physical flows of a container box from a point of origin via a container port to a point of destination. To address the ports' role in collaboration between its channel members in CTLs, the PSQ measures for all port user groups (i.e. common PSQ measures) are selected based on the relevant CTLs activities involved by port, and its users within terminal/port area as well as throughout the CTLs chain. An importance-performance analysis (IPA) is applied as a diagnostic tool to analyse the status quo of Busan Port in CTLs contexts, by comparing the importance and performance (IP ) scores against each individual CTLs criterion. The findings from the IPA reveal that port managers and policy makers at the Busan Port should concentrate on six PSQ measures (i.e. SR1, SR4, ITS1, VAS1, VAS4, ICI3) to enhance PSQ in CTLs. However, four measures (i.e. ITS2, ITS3, ITS4, VAS2) are identified as a possible overkill, indicating an area of inefficiency where a remedial action of the cost-cutting decision is necessary. On the other hand, the Busan port shows an outstanding performance on four measures such as SR2, SR3, ICI1 and ICI2. The measures are not only important but also high performance. The study findings provide managerial guidance to port managers in Busan Port, in view of searching for managerial and operational strategies for sustainable port growth.

Development of a Practical Algorithm for Airport Ground Movement Routing (공항 지상이동 경로 탐색을 위한 실용 알고리즘 개발)

  • Yun, Seokjae;Ku, SungKwan;Baik, Hojong
    • Journal of Advanced Navigation Technology
    • /
    • v.19 no.2
    • /
    • pp.116-122
    • /
    • 2015
  • Motivated by continuous increase in flight demand, awareness of the importance in developing ways to increase aircraft operational efficiency on the airport movement area has been raised. This paper proposes a new routing algorithm for providing the shortest path in a right time, enhancing the aircraft movement efficiency. Many researches on developing algorithms have been performed, for example, Dijkstra algorithm and $A^*$ algorithm. The Dijkstra algorithm provide optimal solution but could possibly provide it with a cost of relatively longer computation time. On the other hand, $A^*$ algorithm does not guarantee the optimality of a solution. In this paper, we suggest a Hybrid $A^*$ algorithm, incorporating both algorithms to eliminate the weaknesses. Rigorous test shows the proposed Hybrid $A^*$ algorithm may achieve shorter computing time and optimality in searching the shortest path.

A Point-to-Point Shortest Path Search Algorithm for Digraph (방향그래프의 점대점 최단경로 탐색 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.7
    • /
    • pp.893-900
    • /
    • 2007
  • This paper suggests an algorithm that improves the disadvantages of the Dijkstra algorithm that is commonly used in GPS navigation system, searching for the shortest path. Dijkstra algorithm, first of all, requires much memory for the performance of the algorithm. It has to carry out number of node minus 1, since it determines the shortest path from all the nodes in the graph, starting from the first node. Therefore, Dijkstra algorithm might not be able to provide the information on every second, searching for the shortest path between the roads of the congested city and the destination. In order to solve these problems, this paper chooses a method of searching a number of nodes at once by means of choosing the shortest path of all the path nodes (select of minimum weight arc in-degree and out-degree), excluding the departure and destination nodes, and of choosing all the arcs that coincide with the shortest path of the path nodes, from all the node outgoing arcs starting from the departure node. On applying the suggested algorithm to 14 various digraphs, we succeeded to search the shortest path. In addition, the result was obtained at the speed of 2 to 3 times faster than that of Dijkstra algorithm, and the memory required was less than that of Dijkstra algorithm.

Design and Implementation of OASIS Considering Web Accessibility (웹 접근성을 고려한 전통의학정보포털 설계 및 구현)

  • Han, Jeong-Min;Jang, Hyun-Chul;Kim, Jin-Hyun;Yea, Sang-Jun;Kim, Sang-Kyun;Kim, Chul;Song, Mi-Young
    • Journal of Information Management
    • /
    • v.41 no.4
    • /
    • pp.187-204
    • /
    • 2010
  • This study shows evaluation of how much OASIS meets "the korean web content accessibility guidelines" and analysis of some of the accessibility problems and their solutions in OASIS(Oriental Medicine Advanced Searching Integrated System) which is the only web site that offers papers and project information related to Traditional Medicine in Korea. The evaluation criteria to determine if OASIS is accessible is classified into four sub items; Perceivable - if information and user interface components is presentable to users in ways they can perceive, Operable - if user interface components and navigation are operable, Understandable - if information and the operation of user interface are understandable, Robust - if content is robust enough that it can be interpreted reliably by a wide variety of user agents, including assistive technologies. Based on the measured results, OASIS has just been redesigned and implemented in more accessible and effective way. OASIS that improves web accessibility for the disabled is expected to help them study oriental medicine more easily and conveniently by providing equal access and equal opportunity to use the web.

VTA* Algorithm: A* Path-Finding Algorithm using Variable Turn Heuristic (VTA* 알고리즘: 가변적인 턴 휴리스틱을 적용한 A* 경로탐색 알고리즘)

  • Kim, Ji-Soo;Cho, Dae-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.3
    • /
    • pp.663-668
    • /
    • 2010
  • In driving a car, turns such as left turns, right turns, or u-turns, make the speed of the car decrease considerably. A more straight path, therefore, is probably faster to arrive at the destination than zig-zag path with same distance. In this paper, we have newly proposed the turn heuristic to make more straight path. The path navigation algorithm with turn heuristic(called as TA* algorithm) could enhance the straightness of a path by putting the turned-edges to the turn cost. It requires higher cost to use TA* algorithm than traditional A* algorithm because the straight-edge first searching have increased the search space. We have improved the TA* algorithm into the variable TA* algorithm(called as VTA* algorithm) which adopt the turn-heuristic during the a portion of the whole path.

A Case Study on the Next Generation Library Catalogs (차세대 도서관 목록 사례의 고찰)

  • Yoon, Cheong-Ok
    • Journal of Korean Library and Information Science Society
    • /
    • v.41 no.1
    • /
    • pp.5-28
    • /
    • 2010
  • The purpose of this study is to investigate the major features of Next Generation Library Catalogs. 'Next Generation Melvyl Pilot' of University of California Library System and 'SearchWorks' of Stanford University Library are examined. While the former is developed, based on OCLC WorldCat Local, the latter is based on the Blacklight, an Open Source Catalog Software. Both commonly provide the features, including enriched contents, facet navigation, keyword searching, relevancy ranking of search results, and user contribution, etc., but some functions vary in scopes and contents. Also, it seems that both are in process of development rather than complete implementations.

  • PDF

A Study on the Development of Usability Evaluation Criteria in Digital Library Website (디지털도서관 웹사이트 사용성 평가기준 개발에 관한 연구)

  • Lee, Eung-Bong;Lee, Ju-Hyurn
    • Journal of the Korean Society for information Management
    • /
    • v.20 no.3
    • /
    • pp.129-153
    • /
    • 2003
  • This study is to develope the usability evaluation criteria for improving quality of user services in digital library website. It compared and analyzed major eight studies concerning usability evaluation of library website in foreign and domestic. This paper was suggested 36 items of evaluation criteria that are belongs to six domain(quality of links, feedback mechanism, accessibility, design, navigation and searching). Usability evaluation criteria for digital library websites suggested in this paper is a item-based level, and to observe generally.