• 제목/요약/키워드: information priority

Search Result 2,388, Processing Time 0.028 seconds

User Review Prioritization Analysis using Metadata

  • Neung-Hoe Kim
    • International journal of advanced smart convergence
    • /
    • v.13 no.2
    • /
    • pp.44-47
    • /
    • 2024
  • With the advancement of Internet technology, online sales and purchases of products have become active. Along with this, the importance of user reviews is also being highlighted. Although user reviews are actively utilized for product sales and purchases, it is difficult to quickly and easily obtain useful information due to the abundance of user reviews. Therefore, prioritizing user reviews is a necessary service for customers that requires careful consideration. Metadata, which contains important information, can be effectively used to prioritize user reviews. However, it is crucial to select and use metadata appropriately according to the purpose. Lean Startup proposes a strategy of repeatedly correcting the problems of ideas or making early transitions to continue trying different approaches. In this paper, we propose a three-step method applying the Lean Startup process to analyze ways to prioritize user reviews using metadata: Build Priority, Measure Priority, Learn Priority.

A Low-Complexity ML Detector for Generalized Spatial Modulation Based on Priority (GSM을 위한 우선순위 기반 저복잡도 ML 검출 기법)

  • Lee, Man Hee;Shin, Soo Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.4
    • /
    • pp.731-738
    • /
    • 2017
  • In this paper, we proposed a modified ML detector for generalized spatial modulation which is a method among Multiple-input Multiple-output. This proposed method detects signal applying modified channel statement information based on priority. Complexity in conventional methods increases as increasing the number of active antennas. To solve this problem, we proposed a new ML method using static channel information decided by the number of transmit antennas and the number of receive antennas. This method detects active antennas one by one through priority. The proposed method has proved benefit on complexity compared with conventional method through simulations. When the number of transmit antennas is equal to 10, there is approximately 45% complexity reduction.

A Study on the Satisfaction Analysis of Smart Traffic Safety Systems using Importance-Performance Analysis (IPA를 이용한 스마트 교통안전 시스템의 만족도 분석 연구)

  • Kiman Hong;Jonghoon Kim;Jungah Ha;Gwangho Kim;Jonghoon Kim
    • Journal of the Society of Disaster Information
    • /
    • v.18 no.4
    • /
    • pp.754-768
    • /
    • 2022
  • Purpose: The purpose of this study is to derive improvements through user satisfaction analysis for the smart traffic safety system being applied to improve traffic safety. Method: A survey-based IPA analysis was used to derive system and service improvements for groups of drivers and pedestrians. Result: As a result of the analysis, both drivers and pedestrian groups showed that Quadrant 1(Keep up the Good Work) was 'Perception of risk information', and Quadrant 3(Low Priority) was 'Reliability of warning information'. On the other hand, 'AI display suitability', which was analyzed as Quadrant 1(Keep up the Good Work) in the driver group, was found to be Quadrant 3(Low priority) in the pedestrian group. Conclusion: Satisfaction factors for smart pedestrian safety systems may vary depending on users, and it is judged that user-centered system construction and service provision are necessary.

A New Image Completion Method Using Hierarchical Priority Belief Propagation Algorithm (계층적 우선순위 BP 알고리즘을 이용한 새로운 영상 완성 기법)

  • Kim, Moo-Sung;Kang, Hang-Bong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.5
    • /
    • pp.54-63
    • /
    • 2007
  • The purpose of this study is to present a new energy minimization method for image completion with hierarchical approach. The goal of image completion is to fill in missing part in a possibly large region of an image so that a visually plausible outcome is obtained. An exemplar-based Markov Random Field Modeling(MRF) is proposed in this paper. This model can deal with following problems; detection of global features, flexibility on environmental changes, reduction of computational cost, and generic extension to other related domains such as image inpainting. We use the Priority Belief Propagation(Priority-BP) which is a kind of Belief propagation(BP) algorithms for the optimization of MRF. We propose the hierarchical Priority-BP that reduces the number of nodes in MRF and to apply hierarchical propagation of messages for image completion. We show that our approach which uses hierarchical Priority-BP algorithm in image completion works well on a number of examples.

Study of Optimum Parameters for Improving QoS in Wireless LAN (무선랜 QoS의 성능향상을 위한 최적 파라미터에 관한 연구)

  • Jin, Hyunjoon
    • Journal of IKEEE
    • /
    • v.17 no.2
    • /
    • pp.96-103
    • /
    • 2013
  • Since multimedia data takes large part of realtime transmission in wireless communication environments such as IEEE 802.11, QoS issues became one of the important problems with network performance. 802.11e MAC provides differentiated services based on priority schemes to solve existing 802.11 MAC problems. The TXOP is an important factor with the priority to improve network performance and QoS because it defines the time duration in which multiple frames can be transferred at one time for each station. In this paper, therefore frame sizes, TXOP Limit, and Priority values in accordance with the number of stations are experimented and derived for best network performance and QoS. Using 802.11e standard parameters, simulation results show the best throughput when the number of stations is 5 and TXOP Limit value is 6.016ms. For fairness, the best result is achieved at 3.008ms of TXOP Limit value and 15-31 of CW(Contention Window) that is lower priority than CW 7-15.

Downlink Wireless Adaptive Modulation and Coding Scheme (AMC)-based Priority Queuing Scheduling Algorithm for Multimedia Services

  • Park, Seung-Young;Kim, Dong-Hoi
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.12
    • /
    • pp.1622-1631
    • /
    • 2007
  • To realize the wireless packet scheduler which efficiently considers both the effect of adaptive modulation and coding (AMC) scheme due to variable wireless communication channel information from physical layer and the QoS differentiation of multimedia services from internet protocol (IP) layer, this paper proposes a new downlink AMC-based priority queuing (APQ) scheduler which combines AMC scheme and service priority method in multimedia services at the same time. The result of numerical analysis shows that the proposed APQ algorithm plays a role in increasing the number of services satisfying the mean waiting time requirements per each service in multimedia services because the APQ scheme allows the mean waiting time of each service to be reduced much more than existing packet scheduler having only user selection processor.

  • PDF

Sojourn Times in a Multiclass Priority Queue with Random Feedback

  • Hong, Sung-Jo;Hirayama, Tetsuji
    • Management Science and Financial Engineering
    • /
    • v.2 no.1
    • /
    • pp.123-145
    • /
    • 1996
  • We consider a priority-based multiclass queue with probabilistic feed-back. There are J service stations. Each customer belongs to one of the several priority classes, and the customers of each class arrive at each station in a Poisson process. A single server serves queued customers on a priority basis with a nonpreemptive scheduling discipline. The customers who complete their services feed back to the system instantaneously and join one of the queues of the stations or depart from the system according to a given probability. In this paper, we propose a new method to simplify the analysis of these queueing systems. By the analysis of busy periods and regenerative processes, we clarify the underlying system structure, and systematically obtain the mean for the sojourn time, i.e., the time from the arrival to the departure from the system, of a customer at every station. The mean for the number of customers queued in each station at an arbitrary time is also obtained simultaneously.

  • PDF

A Space Merging Approach to the Analysis of the Performance of Queueing Models with Finite Buffers and Priority Jumps

  • Oh, Youngjin;Kim, Chesoong;Melikov, Agassi
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.3
    • /
    • pp.274-280
    • /
    • 2013
  • This paper proposes a space merging approach to studying the queuing models with finite buffers and jump priorities. Upon the arrival of a call with low priority, one call of such kind is assumed to be transferred to the end of the queue of high priority calls. The transfer probabilities depend on the state of the queue of the heterogeneous calls. We developed the algorithms to calculate the quality of service metrics of such queuing models, and the results of the numerical experiments are shown.

A priority scheme for IEEE 802.11 with guaranteeing QoS

  • Kim, Yong-Joong;Park, Hyo-Dal
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1594-1597
    • /
    • 2002
  • In this paper, we proposed the IEEE 802.11 CSMA/CA protocol with the priority scheme. The IEEE 802.11 CSMA/CA protocol is the standard in wireless LAN We applied the proposed method to the aeronautical mobile telecommunication environment. The CSMA/CA protocol has two frames : one is PCF frame for real time service like voice and image and the other DCF frame for contention services like data transmission. Now we proposed the priority scheme that has the different CW region according to the transmitted data. The simmulation results shows the proposed method's performance is improved, Because the collision probability is reduced by allowing the different CW between stations. And the time dalay results show the priority scheme is very appropriated.

  • PDF

A Fast and Scalable Priority Queue Hardware Architecture for Packet Schedulers (패킷 스케줄러를 위한 빠르고 확장성 있는 우선순위 큐의 하드웨어 구조)

  • Kim, Sang-Gyun;Moon, Byung-In
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.10
    • /
    • pp.55-60
    • /
    • 2007
  • This paper proposes a fast and scalable priority queue architecture for use in high-speed networks which supports quality of service (QoS) guarantees. This architecture is cost-effective since a single queue can generate outputs to multiple out-links. Also, compared with the previous multiple systolic array priority queues, the proposed queue provides fast output generation which is important to high-speed packet schedulers, using a special control block. In addition this architecture provides the feature of high scalability.