• Title/Summary/Keyword: technology ranking

Search Result 397, Processing Time 0.022 seconds

Object Detection in a Still FLIR Image using Intensity Ranking Feature (밝기순위 특징을 이용한 적외선 정지영상 내 물체검출기법)

  • Park Jae-Hee;Choi Hak-Hun;Kim Seong-Dae
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.2 s.302
    • /
    • pp.37-48
    • /
    • 2005
  • In this paper, a new object detection method for FLIR images is proposed. The proposed method consists of intensity ranking feature and a classification algerian using the feature. The intensity ranking feature is a representation of an image, from which intensity distribution is regularized. Each object candidate region is classified as object or non-object by the proposed classification algorithm which is based on the intensity ranking similarity between the candidate and object training images. Using the proposed algorithm pixel-wise detection results can be obtained without any additional candidate selection algorithm. In experimental results, it is shown that the proposed ranking feature is appropriate for object detection in a FLIR image and some vehicle detection results in the situation of existing noise, scale variation, and rotation of the objects are presented.

A New Explanation of Some Leiden Ranking Graphs Using Exponential Functions

  • Egghe, Leo
    • Journal of Information Science Theory and Practice
    • /
    • v.1 no.3
    • /
    • pp.6-11
    • /
    • 2013
  • A new explanation, using exponential functions, is given for the S-shaped functional relation between the mean citation score and the proportion of top 10% (and other percentages) publications for the 500 Leiden Ranking universities. With this new model we again obtain an explanation for the concave or convex relation between the proportion of top $100{\theta}%$ publications, for different fractions of ${\theta}$.

MFM-based alarm root-cause analysis and ranking for nuclear power plants

  • Mengchu Song;Christopher Reinartz;Xinxin Zhang;Harald P.-J. Thunem;Robert McDonald
    • Nuclear Engineering and Technology
    • /
    • v.55 no.12
    • /
    • pp.4408-4425
    • /
    • 2023
  • Alarm flood due to abnormality propagation is the most difficult alarm overloading problem in nuclear power plants (NPPs). Root-cause analysis is suggested to help operators in understand emergency events and plant status. Multilevel Flow Modeling (MFM) has been extensively applied in alarm management by virtue of the capability of explaining causal dependencies among alarms. However, there has never been a technique that can identify the actual root cause for complex alarm situations. This paper presents an automated root-cause analysis system based on MFM. The causal reasoning algorithm is first applied to identify several possible root causes that can lead to massive alarms. A novel root-cause ranking algorithm can subsequently be used to isolate the most likely faults from the other root-cause candidates. The proposed method is validated on a pressurized water reactor (PWR) simulator at HAMMLAB. The results show that the actual root cause is accurately identified for every tested operating scenario. The automation of root-cause identification and ranking affords the opportunity of real-time alarm analysis. It is believed that the study can further improve the situation awareness of operators in the alarm flooding situation.

Video Ranking Model: a Data-Mining Solution with the Understood User Engagement

  • Chen, Yongyu;Chen, Jianxin;Zhou, Liang;Yan, Ying;Huang, Ruochen;Zhang, Wei
    • Journal of Multimedia Information System
    • /
    • v.1 no.1
    • /
    • pp.67-75
    • /
    • 2014
  • Nowadays as video services grow rapidly, it is important for the service providers to provide customized services. Video ranking plays a key role for the service providers to attract the subscribers. In this paper we propose a weekly video ranking mechanism based on the quantified user engagement. The traditional QoE ranking mechanism is relatively subjective and usually is accomplished by grading, while QoS is relatively objective and is accomplished by analyzing the quality metrics. The goal of this paper is to establish a ranking mechanism which combines the both advantages of QoS and QoE according to the third-party data collection platform. We use data mining method to classify and analyze the collected data. In order to apply into the actual situation, we first group the videos and then use the regression tree and the decision tree (CART) to narrow down the number of them to a reasonable scale. After that we introduce the analytic hierarchy process (AHP) model and use Elo rating system to improve the fairness of our system. Questionnaire results verify that the proposed solution not only simplifies the computation but also increases the credibility of the system.

  • PDF

Ranking Quality Evaluation of PageRank Variations (PageRank 변형 알고리즘들 간의 순위 품질 평가)

  • Pham, Minh-Duc;Heo, Jun-Seok;Lee, Jeong-Hoon;Whang, Kyu-Young
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.5
    • /
    • pp.14-28
    • /
    • 2009
  • The PageRank algorithm is an important component for ranking Web pages in Google and other search engines. While many improvements for the original PageRank algorithm have been proposed, it is unclear which variations (and their combinations) provide the "best" ranked results. In this paper, we evaluate the ranking quality of the well-known variations of the original PageRank algorithm and their combinations. In order to do this, we first classify the variations into link-based approaches, which exploit the link structure of the Web, and knowledge-based approaches, which exploit the semantics of the Web. We then propose algorithms that combine the ranking algorithms in these two approaches and implement both the variations and their combinations. For our evaluation, we perform extensive experiments using a real data set of one million Web pages. Through the experiments, we find the algorithms that provide the best ranked results from either the variations or their combinations.

Composite Measures of Supercomputer Technology

  • Kim, Nam-Gyu;On, Noo Ri;Koh, Myoung-Ju;Lee, JongSuk Ruth;Cho, Keun-Tae
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.8
    • /
    • pp.4142-4159
    • /
    • 2019
  • We have developed composite measures of supercomputer technology, reflecting various factors of supercomputers using Martino's scoring model. CPUs, accelerators, memory, interconnection networks, and power consumption are chosen as factors of the model. The weight values of the factors are derived based on a survey of 129 domestic and international experts. The measured values are then standardized to integrate measurement units of the factors in the model. This model has been applied to 50 supercomputers, and rank correlation analysis was performed using representative measures. As a consequence, the ranking drastically changes except for the 1st and 2nd supercomputers on the TOP500. In addition, the characteristics of memory and interconnection networks influence the ranking, and the results demonstrate that the proposed model has low correlations with HPL and HPCG but a high correlation with Green500. This indicates that power consumption is an important factor that has a significant effect on the measures of supercomputer technology. In addition, it is determined that the differences between the HPL ranking and the proposed model ranking are influenced by power consumption, CPU theoretical peak performance, and main memory bandwidth in order of significance. In conclusion, the composite measures proposed in this study are more suitable for comprehensively describing supercomputer technology than existing performance measures. The findings of this study are expected to support decision making related to management and policy in the procurement and operation of supercomputers.

Soccer Transfer Gossip Analysis using Keyword Ranking

  • Sinn, Seung-Woo;Kang, Dae-Ki
    • International Journal of Advanced Culture Technology
    • /
    • v.5 no.4
    • /
    • pp.51-56
    • /
    • 2017
  • In every Summer and Winter, there open soccer transfer markets. And these markets draw huge attention from soccer fans and other ordinary people all around world. This phenomenon might indicate great interest of people from the amount of news, blog articles, public messages and replies from online community and forums about popular players and clubs of many leagues. Especially, transfer markets in the year 2017 have generated many gossips than before. In this research, we performed keyword analysis and ranking of news and messages collected and analyzed from online news sites and online forum sites, in order to investigate who and what clubs are mainly discussed.

N-Best Reranking for Improving Automatic Speech Recognition of Korean (N-Best Re-ranking에 기반한 한국어 음성 인식 성능 개선)

  • Joung Lee;Mintaek Seo;Seung-Hoon Na;Minsoo Na;Maengsik Choi;Chunghee Lee
    • Annual Conference on Human and Language Technology
    • /
    • 2022.10a
    • /
    • pp.442-446
    • /
    • 2022
  • 자동 음성 인식(Automatic Speech Recognition) 혹은 Speech-to-Text(STT)는 컴퓨터가 사람이 말하는 음성 언어를 텍스트 데이터로 전환하는 일련의 처리나 기술 등을 일컫는다. 음성 인식 기술이 다양한 산업 전반에 걸쳐 적용됨에 따라 높은 수준의 정확도와 더불어 다양한 분야에 적용할 수 있는 음성 인식 기술에 대한 필요성이 점차 증대되고 있다. 다만 한국어 음성 인식의 경우 기존 선행 연구에 비해 예사말/높임말의 구분이나 어미, 조사 등의 인식에 어려움이 있어 음성 인식 결과 후처리를 통한 성능 개선이 중요하다. 따라서 본 논문에서는 N-Best 음성 인식 결과가 구성되었을 때 Re-ranking을 통해 한국어 음성 인식의 성능을 개선하는 모델을 제안한다.

  • PDF

Analysis and Improvement of Ranking Algorithm for Web Mining System on the Hierarchical Web Environment

  • Heebyung Yoon;Lee, Kil-Seup;Kim, Hwa-Soo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.455-458
    • /
    • 2003
  • The variety of document ranking algorithms have developed to provide efficient mining results for user's query on the web environment. The typical ranking algorithms are the Vector-Space Model based on the text, PsgeRank and HITS algorithms based on the hyperlink structures and other several improvement algorithms. All these are for the user's convenience and preference. However, these algorithms are usually developed on then Horizontal and non-hierarchial web environments and are not suitable for the hierarchial web environments such as enterprise and defense networks. Thus, we must consider the special environment factors in order to improve the ranking algorithms. In this paper, we analyze the several typical algorithms used by hyperlink structures on the web environment. We, then suggest a configuration of the hierarchical web environment and also give the relations between agents of the web mining system. Next, we propose an improved ranking algorithm suitable to this kind of special environments. The proposed algorithm is considered both the hyperlink structures of the documents and the location of the user of the hierarchical web.

  • PDF

Ranking Artificial Bee Colony for Design of Wireless Sensor Network (랭킹인공벌군집을 적용한 무선센서네트워크 설계)

  • Kim, Sung-Soo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.42 no.1
    • /
    • pp.87-94
    • /
    • 2019
  • A wireless sensor network is emerging technology and intelligent wireless communication paradigm that is dynamically aware of its surrounding environment. It is also able to respond to it in order to achieve reliable and efficient communication. The dynamical cognition capability and environmental adaptability rely on organizing dynamical networks effectively. However, optimally clustering the cognitive wireless sensor networks is an NP-complete problem. The objective of this paper is to develop an optimal sensor network design for maximizing the performance. This proposed Ranking Artificial Bee Colony (RABC) is developed based on Artificial Bee Colony (ABC) with ranking strategy. The ranking strategy can make the much better solutions by combining the best solutions so far and add these solutions in the solution population when applying ABC. RABC is designed to adapt to topological changes to any network graph in a time. We can minimize the total energy dissipation of sensors to prolong the lifetime of a network to balance the energy consumption of all nodes with robust optimal solution. Simulation results show that the performance of our proposed RABC is better than those of previous methods (LEACH, LEACH-C, and etc.) in wireless sensor networks. Our proposed method is the best for the 100 node-network example when the Sink node is centrally located.