• Title/Summary/Keyword: metric distance

Search Result 259, Processing Time 0.029 seconds

Utilizing Usability Metrics to Evaluate a Subway Map Design

  • Jung, Kwang Tae
    • Journal of the Ergonomics Society of Korea
    • /
    • v.36 no.4
    • /
    • pp.343-353
    • /
    • 2017
  • Objective: This study aims to evaluate the efficiency of two representative subway map design types, namely a diagram type and a geographical type using physiological metrics, performance metrics, and self-reported metrics, which are representative usability metrics. Background: Subway maps need to be designed in order for users to quickly search and recognize subway line information. Although most cities' subway maps currently use the diagram type designed by Henry Beck, New York City's subway map has recently been changed to the subway map type combined with the geographical type designed by Michael Hertz. However, not many studies on its efficiency are found, and the studies that are available mainly depend on questionnaire surveys or take on a subjective behavioral study type based on experts' experiences. In this regard, evaluation through a more objective method is needed. Method: This study employed usability metrics as a method to evaluate the efficiency of information search targeting the diagram type and geographical type subway maps used mostly as subway maps. To this end, physiological metrics obtained through eye tracking, task completion time, representative metric of task performance, and subjective evaluation metrics were used for the suitability evaluation of subway map designs. Results: In the result of gaze movement distance analysis, no significant difference was shown in the two design types in terms of a process finding a departure station from the starting point and a process finding a transfer station between the departure station and arrival station (destination). However, the gaze movement distance in the process finding the arrival station at the departure station was significantly shorter in the geographical type, rather than in the diagram type. The analysis of task completion time showed a result similar to the gaze movement distance analysis result. Task completion time was significantly shorter in the geographical type, rather than in the diagram type, which is in the process finding the arrival station at the departure station. In other information search processes, no significant difference was shown. As a result of subjective evaluation metrics analysis, no significant difference was revealed in the two design types. Conclusion: An analysis on the two representative subway map design types was carried out via the adoption of usability metrics. As a result, although no significant difference was shown in some information search processes, it was revealed that information search was easier in the geographical type overall. Also, it was found that usability metrics can be effectively used to evaluate the design types of subway maps. Application: The study results can be used to set design direction to offer ease in information search on subway lines. The study also can be used as a method to evaluate a subway map's design type.

An Adaptive Relay Node Selection Scheme for Alert Message Propagation in Inter-vehicle Communication (차량간 통신에서 긴급 메시지 전파를 위한 적응적 릴레이 노드 선정기법)

  • Kim, Tae-Hwan;Kim, Hie-Cheol;Hong, Won-Kee
    • The KIPS Transactions:PartC
    • /
    • v.14C no.7
    • /
    • pp.571-582
    • /
    • 2007
  • Vehicular ad-hoc networks is temporarily established through inter-vehicle communication without any additional infrastructure aids. It requires a immediate message propagation because it mainly deals with critical traffic information such as traffic accidents. The distance-based broadcast scheme is one of the representative broadcast schemes for vehicular ad-hoc network. In this scheme, a node to disseminate messages is selected based on a distance from a source node. However, a message propagation delay will be increased if the relay nodes are not placed at the border of transmission range of the source node. In particular, when the node density is low, the message propagation delay is getting longer. In this paper, we propose a time-window reservation based relay node selection scheme. A node receiving the alert message from the source node has its time-window and randomly selects its waiting time within the given time-window range. A proportional time period of the given time-window is reserved in order to reduce the message propagation delay. The experimental results show that the proposed scheme has shorter message propagation delay than the distance-based broadcast scheme irrespective of node density in VANET. In particular, when the node density is low, the proposed scheme shows about 26% shorter delay and about 46% better performance in terms of compound metric, which is a function of propagation latency and network traffic.

Exposure Assessment of Extremely Low Frequency Magnetic Fields by variable exposure matrices for the Selected Primary Schoolchildren Living Nearby and Away from a Overhead Transmission Power Line (다양한 노출 매트릭스를 통한 송전선로 주변과 비 주변 거주 초등학교 학생의 극저주파 자기장 노출량 평가에 관한 연구)

  • Kim, Yoon Shin;Hyun, Youn Joo;Choi, Seong Ho;Lee, Chul Min;Roh, Young Man;Cho, Yong Sung;Hong, Seung Cheol
    • Journal of Korean Society of Occupational and Environmental Hygiene
    • /
    • v.16 no.4
    • /
    • pp.334-345
    • /
    • 2006
  • The objectives of this study were to analyze and compare 24 hrs personal exposure levels of MF at microenvironments such as home, school, educational institute, internet pc game room, transportation, and other places according to time activity patterns using various metrics for children attending the primary schools located near and away from the power lines, and to characterize the major microenvironments and impact factors attributed personal exposure level. The study was carried out for 44 children attending a primary school away from the lines(school A) and 125 children attending a school away from 154 kV power lines(school B), all who aged 12 years and were 6 grade, from July 2003 to December 2003. All participants filled in a questionnaire about characteristics, residence, use of electrical appliances and others. Children wore a small satchel in which EMDEX II and Lite (Enertech, Co. Ltd) and a diary of activity list for period of registration in 20 minutes blocks. All statistical calculations were made with the SAS System, Releas 6.12. The summary of results was presented below. First, about the characteristics of subjects, there no differences between two groups. The subject almost spent about 56 % of their time at home and about 20~25 % of their time at school. Fifty percent of children spent 2 hours at private educational institutes. Second, the personal exposure measurements of children in school B was statistically higher than those of children in school A by various metrics such as arithmetic mean, geometric mean, percentile(5, 25, 50, 75, 95), maximum, rate of change metric, constant field metric. The arithmetic and geometric mean magnetic fields during the time the children were at school B were 0.98 and $0.86{\mu}T$ and were about 23 times higher than those of children were at school A. In conclusion, the significant major determinants of personal exposure level is the distance from the power line to microenvironments.

An Efficient Split Algorithm to Minimize the Overlap between Node Index Spaces in a Multi-dimensional Indexing Scheme M-tree (다차원 색인구조 M-트리에서 노드 색인 공간의 중첩을 최소화하기 위한 효율적인 분할 알고리즘)

  • Im Sang-hyuk;Ku Kyong-I;Kim Ki-chang;Kim Yoo-Sung
    • The KIPS Transactions:PartD
    • /
    • v.12D no.2 s.98
    • /
    • pp.233-246
    • /
    • 2005
  • To enhance the user response time of content-based retrieval service for multimedia information, several multi-dimensional index schemes have been proposed. M-tree, a well-known multidimensional index scheme is of metric space access method, and is based on the distance between objects in the metric space. However, since the overlap between index spaces of nodes might enlarge the number of nodes of M-tree accessed for query processing, the user response time for content-based multimedia information retrieval grows longer. In this paper, we propose a node split algorithm which is able to reduce the sire of overlap between index spaces of nodes in M-tree. In the proposed scheme, we choose a virtual center point as the routing object and entry redistribution as the postprocessing after node split in order to reduce the radius of index space of a node, and finally in order to reduce the overlap between the index spaces of routing nodes. From the experimental results, we can see the proposed split algorithm reduce the overlap between index space of nodes and finally enhance the user response time for similarity-based query processing.

The use of Local API(Anomaly Process Instances) Detection for Analyzing Container Terminal Event (로컬 API(Anomaly Process Instances) 탐지법을 이용한 컨테이너 터미널 이벤트 분석)

  • Jeon, Daeuk;Bae, Hyerim
    • The Journal of Society for e-Business Studies
    • /
    • v.20 no.4
    • /
    • pp.41-59
    • /
    • 2015
  • Information systems has been developed and used in various business area, therefore there are abundance of history data (log data) stored, and subsequently, it is required to analyze those log data. Previous studies have been focusing on the discovering of relationship between events and no identification of anomaly instances. Previously, anomaly instances are treated as noise and simply ignored. However, this kind of anomaly instances can occur repeatedly. Hence, a new methodology to detect the anomaly instances is needed. In this paper, we propose a methodology of LAPID (Local Anomaly Process Instance Detection) for discriminating an anomalous process instance from the log data. We specified a distance metric from the activity relation matrix of each instance, and use it to detect API (Anomaly Process Instance). For verifying the suggested methodology, we discovered characteristics of exceptional situations from log data. To demonstrate our proposed methodology, we performed our experiment on real data from a domestic port terminal.

A Novel Adaptive Routing Algorithm for Delay-Sensitive Service in Multihop LEO Satellite Network

  • Liu, Liang;Zhang, Tao;Lu, Yong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3551-3567
    • /
    • 2016
  • The Low Earth Orbit satellite network has the unique characteristics of the non-uniform and time-variant traffic load distribution, which often causes severe link congestion and thus results in poor performance for delay-sensitive flows, especially when the network is heavily loaded. To solve this problem, a novel adaptive routing algorithm, referred to as the delay-oriented adaptive routing algorithm (DOAR), is proposed. Different from current reactive schemes, DOAR employs Destination-Sequenced Distance-Vector (DSDV) routing algorithm, which is a proactive scheme. DSDV is extended to a multipath QoS version to generate alternative routes in active with real-time delay metric, which leads to two significant advantages. First, the flows can be timely and accurately detected for route adjustment. Second, it enables fast, flexible, and optimized QoS matching between the alternative routes and adjustment requiring flows and meanwhile avoids delay growth caused by increased hop number and diffused congestion range. In addition, a retrospective route adjustment requesting scheme is designed in DOAR to enlarge the alternative routes set in the severe congestion state in a large area. Simulation result suggests that DOAR performs better than typical adaptive routing algorithms in terms of the throughput and the delay in a variety of traffic intensity.

A Study on Adaptive Knowledge Automatic Acquisition Model from Case-Based Reasoning System (사례 기반 추론 시스템에서 적응 지식 자동 획득 모델에 관한 연구)

  • 이상범;김영천;이재훈;이성주
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2002.05a
    • /
    • pp.81-86
    • /
    • 2002
  • In current CBR(Case-Based Reasoning) systems, the case adaptation is usually performed by rule-based method that use rules hand-coded by the system developer. So, CBR system designer faces knowledge acquisition bottleneck similar to those found in traditional expert system design. In this thesis, 1 present a model for learning method of case adaptation knowledge using case base. The feature difference of each pair of cases are noted and become the antecedent part of an adaptation rule, the differences between the solutions in the compared cases become the consequent part of the rule. However, the number of rules that can possibly be discovered using a learning algorithm is enormous. The first method for finding cases to compare uses a syntactic measure of the distance between cases. The threshold fur identification of candidates for comparison is fixed th the maximum number of differences between the target and retrived case from all retrievals. The second method is to use similarity metric since the threshold method may not be an accurate measure. I suggest the elimination method of duplicate rules. In the elimination process, a confidence value is assigned to each rule based on its frequency. The learned adaptation rules is applied in riven target Problem. The basic. process involves search for all rules that handle at least one difference followed by a combination process in which complete solutions are built.

  • PDF

Construction of Theme Melody Index by Transforming Melody to Time-series Data for Content-based Music Information Retrieval (내용기반 음악정보 검색을 위한 선율의 시계열 데이터 변환을 이용한 주제선율색인 구성)

  • Ha, Jin-Seok;Ku, Kyong-I;Park, Jae-Hyun;Kim, Yoo-Sung
    • The KIPS Transactions:PartD
    • /
    • v.10D no.3
    • /
    • pp.547-558
    • /
    • 2003
  • From the viewpoint of that music melody has the similar features to time-series data, music melody is transformed to a time-series data with normalization and corrections and the similarity between melodies is defined as the Euclidean distance between the transformed time-series data. Then, based the similarity between melodies of a music object, melodies are clustered and the representative of each cluster is extracted as one of theme melodies for the music. To construct the theme melody index, a theme melody is represented as a point of the multidimensional metric space of M-tree. For retrieval of user's query melody, the query melody is also transformed into a time-series data by the same way of indexing phase. To retrieve the similar melodies to the query melody given by user from the theme melody index the range query search algorithm is used. By the implementation of the prototype system using the proposed theme melody index we show the effectiveness of the proposed methods.

Generating Test Cases of Stateflow Model Using Extended RRT Method Based on Test Goal (테스트 목표 기반의 향상된 RRT 확장 기법을 이용한 Stateflow 모델 테스트 케이스 생성)

  • Park, Hyeon Sang;Choi, Kyung Hee;Chung, Ki Hyun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.11
    • /
    • pp.765-778
    • /
    • 2013
  • This paper proposes a test case generation method for Stateflow model using the extended RRT method. The RRT method which has been popularly used for planning paths for complex systems also shows a good performance for test case generation. However, it does not consider the test coverage which is important for test case generation. The proposed extension method hires the concept of test goal achievement to increase test coverage and drives RRT extension in the direction that increases the goal achievement. Considering the concept, a RRT distance metric, random node generation method and modified RRT extension algorithm are proposed. The effectiveness of proposed algorithm is compared with that of the typical RRT algorithm through the experiment using the practical automotive ECUs.

Design and Implementation of RTLS using Active RFID (능동형 RFID를 이용한 RTLS의 설계 및 구현)

  • Jung, Dong-Ho;Kim, Jung-Hyo;Ji, Dong-Hwan;Baek, Yun-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12A
    • /
    • pp.1238-1245
    • /
    • 2006
  • Interest to the RTLS that is one of RFID applications is increasing in recent. The RTLS(Real Time Locating Systems) is one of applications for locating and tracking using RFID tags which are attached to something like container, pallet, or all the things. This paper presents the design and the implementation of an RTLS system using 433MHz active RFID tags and use radio frequency to provide the scalability. Our system we developed using RFID platform takes into account an RTLS standard. Also, in this paper a routing protocol is included to data delivery to server via each reader. In order to perform the evaluation, in addition, some experiments in out door are performed and results such as error metric and distance are also included. Furthermore, simulation for the routing protocol we supposed is also included.