• 제목/요약/키워드: Priority data

검색결과 1,804건 처리시간 0.029초

파운데이션 필드버스에서 두 개의 우선순위 데이터를 갖는 노드의 데이터 전송지연시간에 관한 연구 (Study on the Transmission Delay of Two Priority Classes in One Node in the Foundation Fieldbus)

  • 이용희;홍승호
    • 전기학회논문지
    • /
    • 제58권2호
    • /
    • pp.407-414
    • /
    • 2009
  • The foundation fieldbus(FF) is one of the fieldbuses most widely used for process control and automation, In order for system designer to optimize medium management, it is imperative to predict transmission delay time of data. In a former research, mathematical modeling to analyze transmission delay of FF token-passing system has been developed based on the assumption that a device node has only one priority data(1Q model), From 1Q model, all of the device nodes, which are connected on the FF system, are defined priority level in advance, and as system operates, data are generated based on given priority level. However, in practice, some non-periodic data can have different priority levels from one device. Therefore, new mathematical model is necessary for the case where different priority levels of data are created under one device node(2Q model). In this research, the mathematical model for 2Q model is developed using the equivalent queue model. Furthermore, the characteristics of transmission delay of 2Q model which is presented in this paper were compared with 1Q model. The validity of the analytical model was verified by using a simulation experiment.

Short Bus contention 방식의 Priority Output Queuing Model의 분석 (The Analysis of Priority Output Queuing Model by Short Bus Contention Method)

  • 정용주
    • 한국정보처리학회논문지
    • /
    • 제6권2호
    • /
    • pp.459-466
    • /
    • 1999
  • I broadband ISDN every packet will show different result if it would be processed according to its usage by the server. That is, normal data won't show big differences if they would be processed at normal speed. But it will improve the quality of service to process some kinds of data - for example real time video or voice type data or some data for a bid to by something through the internet - more fast than the normal type data. solution for this problem was suggested - priority packets. But the analyses of them are under way. Son in this paper a switching system for an output queuing model in a single server was assumed and some packets were given priorities and analysed. And correlation, simulating real life situation, was given too. These packets were analysed through three cases, first packets having no correlation, second packets having only correlation and finally packets having priority three cases, first packets having no correlation, second packets having only correlation and finally packets having priority and correlation. The result showed that correlation doesn't affect the mean delay time and the high priority packets have improved mean delay time regardless of the arrival rate. Those packets were assumed to be fixed-sized like ATM fixed-sized cell and the contention strategy was assumed to be short bus contention method for the output queue, and the mean delay length and the maximum 버퍼 length not to lose any packets were analysed.

  • PDF

Rating and Comments Mining Using TF-IDF and SO-PMI for Improved Priority Ratings

  • Kim, Jinah;Moon, Nammee
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권11호
    • /
    • pp.5321-5334
    • /
    • 2019
  • Data mining technology is frequently used in identifying the intention of users over a variety of information contexts. Since relevant terms are mainly hidden in text data, it is necessary to extract them. Quantification is required in order to interpret user preference in association with other structured data. This paper proposes rating and comments mining to identify user priority and obtain improved ratings. Structured data (location and rating) and unstructured data (comments) are collected and priority is derived by analyzing statistics and employing TF-IDF. In addition, the improved ratings are generated by applying priority categories based on materialized ratings through Sentiment-Oriented Point-wise Mutual Information (SO-PMI)-based emotion analysis. In this paper, an experiment was carried out by collecting ratings and comments on "place" and by applying them. We confirmed that the proposed mining method is 1.2 times better than the conventional methods that do not reflect priorities and that the performance is improved to almost 2 times when the number to be predicted is small.

Product Recommendation System based on User Purchase Priority

  • Bang, Jinsuk;Hwang, Doyeun;Jung, Hoekyung
    • Journal of information and communication convergence engineering
    • /
    • 제18권1호
    • /
    • pp.55-60
    • /
    • 2020
  • As personalized customer services create a society that emphasizes the personality of an individual, the number of product reviews and quantity of user data generated by users on the internet in mobile shopping apps and sites are increasing. Such product review data are classified as unstructured data. Unstructured data have the potential to be transformed into information that companies and users can employ, using appropriate processing and analyses. However, existing systems do not reflect the detailed information they collect, such as user characteristics, purchase preference, or purchase priority while analyzing review data. Thus, it is challenging to provide customized recommendations for various users. Therefore, in this study, we have developed a product recommendation system that takes into account the user's priority, which they select, when searching for and purchasing a product. The recommendation system then displays the results to the user by processing and analyzing their preferences. Since the user's preference is considered, the user can obtain results that are more relevant.

데이타 우선순의에 기초한 트랜잭션 스체줄링 알고리즘의 제안 및 실시간 DBMS에서의 성능 비교연구 (A Proposal on Data Priority Based Transaction Scheduling Algorithm and the Comparative Performance Evaluation in Real Time Database Management System)

  • 윤석환;이재영;박치항
    • 한국정보처리학회논문지
    • /
    • 제3권4호
    • /
    • pp.803-816
    • /
    • 1996
  • 본 논문에서는 기존의 알고리즘들이 트랜잭션에 부여하였던 우선순의를 특정 데이 타 항목에 부여하여 접근하는 트랜잭션중 가장 높은 우선순의 트랜잭션을 먼저 수행토 록 함으로써 교착상태(deadlock)를 쉽게 예방할 수 있는 점에 착안하여 데이타 항목에 우선순위를 부여하는 데이타 우선순위에 기초한 잠금 프로토콜 (DPLP:Data-Priority Based Locking Protocol)을 제안하고, 이 알고리즘의 성능을 실시간 데이타베이스 시스템에서 기존 잠금 프로토콜의 성능과 비교분석하였다. 비교 기준으로는 트랜잭션 도착 시간차(IAT:inter arrival time) 에 따른 트랜잭션의 성공 비율(success ratio), 평균 지연(average-lateness),충돌 비율(conflict-ratio), 재시작 비율(restart-ratio) 을 채택하였다. 성능 비교의 결과는 본 논문에서 제안하는 데이타 우선순위에 기초한 잠금 프로토콜이 기존의 잠금 프로토콜들보다 우수한 성능을 보임을 확인하였다.

  • PDF

홈 네트워크에서 적응적 차등화 서비스를 위한 동적 우선순위 조절 기법 (A Dynamic Priority Control Method to Support an Adaptive Differentiated Service in Home Networks)

  • 정광모;임승옥;민상원
    • 한국통신학회논문지
    • /
    • 제29권7B호
    • /
    • pp.641-649
    • /
    • 2004
  • 홈 네트워크에서 다양한 응용(application) 트래픽(traffic) 간의 차등화 된 서비스를 제공하기 위해서 트래픽 변화에 따라 적응적으로 우선순위(priority)를 재할당하는 알고리즘을 제안하고, FPGA를 이용하여 구현하였다. 제안된 구조는 QoS를 위한 부가적인 시그널링 프로토콜이 없이도 네트워크 트래픽 조절이 가능하도록 설계되었고, 또한 홈 네트워크 트래픽을 그 특징에 따라 제어 데이터 트래픽, 일반 인터넷이나 데이터 트래픽, 그리고 멀티미디어 데이터 트래픽으로 분류하고 이를 네트워크 트래픽 상황에 적응적으로 차등화 서비스를 제공할 수 있도록 설계되었다. 시뮬레이션을 통하여 제시한 알고리즘의 성능을 검증하고 FPGA구현을 통하여 실현가능성을 제시하였다.

의료의 질 평가 우선순위 설정 (Priority Areas for National Health Care Quality Evaluation in Korea)

  • 신숙연;박춘선;김선민;김남순;이상일
    • 보건행정학회지
    • /
    • 제19권3호
    • /
    • pp.1-26
    • /
    • 2009
  • Objectives : To identify target areas and set priorities among those areas identified for national quality evaluation. Methods : Target areas were identified from: i) analysis of the national health insurance claims data, mortality and prevalence data ii) various group surveys, including representatives from 22 medical specialty associations, 19 physician associations, QI staffs in hospital, civil organizations, and commissioners of Health Insurance Review and Assessment Service(HIRA) ⅲ) literature reviews and RAM(RAND/UCLA appropriateness method). The priority areas for national quality evaluation represented the full spectrum of health care and the entire life span. The criteria for selecting the priority areas were impact, improvability, and measurability. The priority areas were divided into three categories : short-term, mid-term, long-term. Results: Based on the group surveys and the data analysis, 46 candidates were selected as quality evaluation priority areas. 13 areas were selected as having a short-term priority areas: tuberculosis, community acquired pneumonia, stroke, ischaemic heart disease, diabetes, hypertension, chronic lower respiratory disease(asthma, chronic obstructive pulmonary disease), intensive care unit, emergency room, nosocomial infection, use of antibiotics, multiple medication and renal failure. This results suggested that we need to enlarge the target priority areas to the chronic diseases in short-term. Conclusions: The priority areas identified from the study will assist healthcare quality associated institutions as well as HIRA in selecting quality evaluation areas. It is required to develope and implement strategies for improving the quality of care within the next 5 years.

Performance Modelling of Adaptive VANET with Enhanced Priority Scheme

  • Lim, Joanne Mun-Yee;Chang, YoongChoon;Alias, MohamadYusoff;Loo, Jonathan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권4호
    • /
    • pp.1337-1358
    • /
    • 2015
  • In this paper, we present an analytical and simulated study on the performance of adaptive vehicular ad hoc networks (VANET) priority based on Transmission Distance Reliability Range (TDRR) and data type. VANET topology changes rapidly due to its inherent nature of high mobility nodes and unpredictable environments. Therefore, nodes in VANET must be able to adapt to the ever changing environment and optimize parameters to enhance performance. However, there is a lack of adaptability in the current VANET scheme. Existing VANET IEEE802.11p's Enhanced Distributed Channel Access; EDCA assigns priority solely based on data type. In this paper, we propose a new priority scheme which utilizes Markov model to perform TDRR prediction and assign priorities based on the proposed Markov TDRR Prediction with Enhanced Priority VANET Scheme (MarPVS). Subsequently, we performed an analytical study on MarPVS performance modeling. In particular, considering five different priority levels defined in MarPVS, we derived the probability of successful transmission, the number of low priority messages in back off process and concurrent low priority transmission. Finally, the results are used to derive the average transmission delay for data types defined in MarPVS. Numerical results are provided along with simulation results which confirm the accuracy of the proposed analysis. Simulation results demonstrate that the proposed MarPVS results in lower transmission latency and higher packet success rate in comparison with the default IEEE802.11p scheme and greedy scheduler scheme.

사물인터넷 환경에서 센서데이터의 처리를 위한 적응형 우선순위 큐 기반의 작업 스케줄링 (Adaptive Priority Queue-driven Task Scheduling for Sensor Data Processing in IoT Environments)

  • 이미진;이종식;한영신
    • 한국멀티미디어학회논문지
    • /
    • 제20권9호
    • /
    • pp.1559-1566
    • /
    • 2017
  • Recently in the IoT(Internet of Things) environment, a data collection in real-time through device's sensor has increased with an emergence of various devices. Collected data from IoT environment shows a large scale, non-uniform generation cycle and atypical. For this reason, the distributed processing technique is required to analyze the IoT sensor data. However if you do not consider the optimal scheduling for data and the processor of IoT in a distributed processing environment complexity increase the amount in assigning a task, the user is difficult to guarantee the QoS(Quality of Service) for the sensor data. In this paper, we propose APQTA(Adaptive Priority Queue-driven Task Allocation method for sensor data processing) to efficiently process the sensor data generated by the IoT environment. APQTA is to separate the data into job and by applying the priority allocation scheduling based on the deadline to ensure that guarantee the QoS at the same time increasing the efficiency of the data processing.

기본지리정보 구축 우선순위 평가에 관한 연구 (A Study on Evaluation of the Priority Order about Framework Data Building)

  • 김건수;최윤수;조성길;이상미
    • 한국측량학회:학술대회논문집
    • /
    • 한국측량학회 2004년도 추계학술발표회 논문집
    • /
    • pp.361-366
    • /
    • 2004
  • Geographic Information has been used widely for landuse and management, city plan, and environment and disaster management, etc., But geographic information has been built for individual cases using various methods. Therefore, the discordancy in data, double investment, confusion of use and difficulty of decision supporting system have been occurred. In order to solve these problems, national government is need to framework database. This framework database was enacted for building and use of National Geographic Information System and focused on basic plan of the second national geographic information system. Also, the framework database was selected of eight fields by NGIS laws and 19 detailed items through meeting of framework committee since 2002. In this research, The 19 detailed items( road, railroad, coastline, surveying control point etc.,) of framework database consider a Priority order, In the result of this research, the framework database is obtain to a priority order for building and the national government will carry effectively out a budget for the framework database building. Each of 19 detailed items is grouping into using the priority order of the framework database by AHP analysis method and verified items by decision tree analysis method. The one of the highest priority order items is a road, which is important for building, continuous renovation, and maintain management for use.

  • PDF