• Title/Summary/Keyword: E-Metrics

Search Result 194, Processing Time 0.028 seconds

A study on the characterization and traffic modeling of MPEG video sources (MPEG 비디오 소스의 특성화 및 트래픽 모델링에 관한 연구)

  • Jeon, Yong-Hee;Park, Jung-Sook
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.11
    • /
    • pp.2954-2972
    • /
    • 1998
  • It is expected that the transport of compressed video will become a significant part of total network traffic because of the widespread introduction of multimedial services such as VOD(video on demand). Accordingly, VBR(variable bit-rate) encoded video will be widely used, due to its advantages in statistical multiplexing gain and consistent vido quality. Since the transport of video traffic requires larger bandwidth than that of voice and data, the characterization of video source and traffic modeling is very important for the design of proper resource allocation scheme in ATM networks. Suitable statistical source models are also required to analyze performance metrics such as packet loss, delay and jitter. In this paper, we analyzed and described on the characterization and traffic modeling of MPEG video sources. The models are broadly classified into two categories; i.e., statistical models and deterministic models. In statistical models, the models are categorized into five groups: AR(autoregressive), Markov, composite Marko and AR, TES, and selfsimilar models. In deterministic models, the models are categorized into $({\sigma},\;{\rho}$, parameterized model, D-BIND, and Empirical Envelopes models. Each model was analyzed for its characteristics along with corresponding advantages and shortcomings, and we made comparisons on the complexity of each model.

  • PDF

Study for Prediction System of Learning Achievements of Cyber University Students using Deep Learning based on Autoencoder (오토인코더에 기반한 딥러닝을 이용한 사이버대학교 학생의 학업 성취도 예측 분석 시스템 연구)

  • Lee, Hyun-Jin
    • Journal of Digital Contents Society
    • /
    • v.19 no.6
    • /
    • pp.1115-1121
    • /
    • 2018
  • In this paper, we have studied a data analysis method by deep learning to predict learning achievements based on accumulated data in cyber university learning management system. By predicting learner's academic achievement, it can be used as a tool to enhance learner's learning and improve the quality of education. In order to improve the accuracy of prediction of learning achievements, the autoencoder based attendance prediction method is developed to improve the prediction performance and deep learning algorithm with ongoing evaluation metrics and predicted attendance are used to predict the final score. In order to verify the prediction results of the proposed method, the final grade was predicted by using the evaluation factor attendance data of the learning process. The experimental result showed that we can predict the learning achievements in the middle of semester.

Criticality benchmarking of ENDF/B-VIII.0 and JEFF-3.3 neutron data libraries with RMC code

  • Zheng, Lei;Huang, Shanfang;Wang, Kan
    • Nuclear Engineering and Technology
    • /
    • v.52 no.9
    • /
    • pp.1917-1925
    • /
    • 2020
  • New versions of ENDF/B and JEFF data libraries have been released during the past two years with significant updates in the neutron reaction sublibrary and the thermal neutron scattering sublibrary. In order to get a more comprehensive impression of the criticality quality of these two latest neutron data libraries, and to provide reference for the selection of the evaluated nuclear data libraries for the science and engineering applications of the Reactor Monte Carlo code RMC, the criticality benchmarking of the two latest neutron data libraries has been performed. RMC was employed as the computational tools, whose processing capability for the continuous representation ENDF/B-VIII.0 thermal neutron scattering laws was developed. The RMC criticality validation suite consisting of 116 benchmarks was established for the benchmarking work. The latest ACE format data libraries of the neutron reaction and the thermal neutron scattering laws for ENDF/B-VIII.0, ENDF/B-VII.1, and JEFF-3.3 were downloaded from the corresponding official sites. The ENDF/B-VII.0 data library was also employed to provide code-to-code validation for RMC. All the calculations for the four different data libraries were performed by using a parallel version of RMC, and all the calculated standard deviations are lower than 30pcm. Comprehensive analyses including the C/E values with uncertainties, the δk/σ values, and the metrics of χ2 and < |Δ| >, were conducted and presented. The calculated keff eigenvalues based on the four data libraries generally agree well with the benchmark evaluations for most cases. Among the 116 criticality benchmarks, the numbers of the calculated keff eigenvalues which agree with the benchmark evaluations within 3σ interval (with a confidence level of 99.6%) are 107, 109, 112, and 113 for ENDF/B-VII.0, ENDF/B-VII.1, ENDF/B-VIII.0 and JEFF-3.3, respectively. The present results indicate that the ENDF/B-VIII.0 neutron data library has a better performance on average.

Improvement of a Context-aware Recommender System through User's Emotional State Prediction (사용자 감정 예측을 통한 상황인지 추천시스템의 개선)

  • Ahn, Hyunchul
    • Journal of Information Technology Applications and Management
    • /
    • v.21 no.4
    • /
    • pp.203-223
    • /
    • 2014
  • This study proposes a novel context-aware recommender system, which is designed to recommend the items according to the customer's responses to the previously recommended item. In specific, our proposed system predicts the user's emotional state from his or her responses (such as facial expressions and movements) to the previous recommended item, and then it recommends the items that are similar to the previous one when his or her emotional state is estimated as positive. If the customer's emotional state on the previously recommended item is regarded as negative, the system recommends the items that have characteristics opposite to the previous item. Our proposed system consists of two sub modules-(1) emotion prediction module, and (2) responsive recommendation module. Emotion prediction module contains the emotion prediction model that predicts a customer's arousal level-a physiological and psychological state of being awake or reactive to stimuli-using the customer's reaction data including facial expressions and body movements, which can be measured using Microsoft's Kinect Sensor. Responsive recommendation module generates a recommendation list by using the results from the first module-emotion prediction module. If a customer shows a high level of arousal on the previously recommended item, the module recommends the items that are most similar to the previous item. Otherwise, it recommends the items that are most dissimilar to the previous one. In order to validate the performance and usefulness of the proposed recommender system, we conducted empirical validation. In total, 30 undergraduate students participated in the experiment. We used 100 trailers of Korean movies that had been released from 2009 to 2012 as the items for recommendation. For the experiment, we manually constructed Korean movie trailer DB which contains the fields such as release date, genre, director, writer, and actors. In order to check if the recommendation using customers' responses outperforms the recommendation using their demographic information, we compared them. The performance of the recommendation was measured using two metrics-satisfaction and arousal levels. Experimental results showed that the recommendation using customers' responses (i.e. our proposed system) outperformed the recommendation using their demographic information with statistical significance.

An Adaptive AODV Algorithm for Considering Node Mobility (노드 이동성을 고려한 적응형 AODV 알고리즘)

  • Hong, Youn-Sik;Hong, Jun-Sik;Lim, Hwa-Seok
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.6
    • /
    • pp.529-537
    • /
    • 2008
  • AODV routing protocol is intended for use by mobile' nodes in an ad-hoc network. In AODV nodes create routes on an on-demand basis. As the degree of node mobility becomes high, however, the number of the control packets, RREQ and RREP messages, have increased so rapidly. The unexpected increases in the number of the control packets cause the destination node to decrease the packet receiving rate and also to increase the overall energy consumption of such a network. In this paper, we propose a novel method of adaptively controlling the occurrences of such RREQ messages based on AIAD (additive increase additive decrease) under a consideration of the current network status. We have tested our proposed method with the conventional AODV and the method using timestamp based on the three performance metrics, i.e.. how long does node moves, node velocity, and node density, to compare their performance.

Gateway Discovery Algorithm Based on Multiple QoS Path Parameters Between Mobile Node and Gateway Node

  • Bouk, Safdar Hussain;Sasase, Iwao;Ahmed, Syed Hassan;Javaid, Nadeem
    • Journal of Communications and Networks
    • /
    • v.14 no.4
    • /
    • pp.434-442
    • /
    • 2012
  • Several gateway selection schemes have been proposed that select gateway nodes based on a single Quality of Service (QoS) path parameter, for instance path availability period, link capacity or end-to-end delay, etc. or on multiple non-QoS parameters, for instance the combination of gateway node speed, residual energy, and number of hops, for Mobile Ad hoc NETworks (MANETs). Each scheme just focuses on the ment of improve only a single network performance, i.e., network throughput, packet delivery ratio, end-to-end delay, or packet drop ratio. However, none of these schemes improves the overall network performance because they focus on a single QoS path parameter or on set of non-QoS parameters. To improve the overall network performance, it is necessary to select a gateway with stable path, a path with themaximum residual load capacity and the minimum latency. In this paper, we propose a gateway selection scheme that considers multiple QoS path parameters such as path availability period, available capacity and latency, to select a potential gateway node. We improve the path availability computation accuracy, we introduce a feedback system to updated path dynamics to the traffic source node and we propose an efficient method to propagate QoS parameters in our scheme. Computer simulations show that our gateway selection scheme improves throughput and packet delivery ratio with less per node energy consumption. It also improves the end-to-end delay compared to single QoS path parameter gateway selection schemes. In addition, we simulate the proposed scheme by considering weighting factors to gateway selection parameters and results show that the weighting factors improve the throughput and end-to-end delay compared to the conventional schemes.

2-Polling Feedback Scheme for Stable Reliable Broadcast in CSMA Wireless Networks (CSMA 무선 네트워크에서 안정성 있는 신뢰적 브로드캐스트를 위한 2-폴링 피드백 방법)

  • Yoon, Wonyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.12
    • /
    • pp.1208-1218
    • /
    • 2012
  • Disseminating broadcast information stably and reliably in IEEE 802.11-like CSMA wireless networks requires that a source should seek collision-free transmission to multiple receivers and keep track of the reception state of the multiple receivers. We propose a simple yet efficient feedback scheme for stable reliable broadcast in wireless networks, called 2-polling feedback, where the state of two receivers are checked by a source before its broadcast transmission attempt We present a performance analysis of the class of reliable broadcast feedback schemes in terms of two performance metrics (packet transmission delay and packet stable time). The analysis results show that the proposed 2-polling feedback scheme outperforms the current existing classes of feedback schemes in the literature, i.e., all-polling feedback and 1-polling feedback. The 2-polling feedback scheme has lower asymptotic complexity than the all-polling feedback, and has the same asymptotic complexity as the 1-polling feedback but exhibits almost 50 % reduction in packet stable time.

A Metamodel for Creation and Maintenance of Evaluation Set of Software Package Evaluation (소프트웨어 패키지 평가를 위한 평가집합의 생성 및 유지를 위한 메타 모델)

  • Oh, Jae-Won;Lee, Chong-Won;Park, Dong-Chul;Lee, Byung-Jeong;Wu, Chi-Su;Kim, Soon-Yong;Song, Gi-Pyeung
    • The KIPS Transactions:PartD
    • /
    • v.11D no.3
    • /
    • pp.577-590
    • /
    • 2004
  • Today, the growth of software industry leads to e quantitative expansion of software package products. Due to this rapid increase of software package products, qualify certification has been required fur software products which users select. Unlike the quality certification of industrial products, the history of software product certification has not been so long. For this reason, software quality evaluation and certification methods have not matured yet. When certifying software products, one of most important factors is the systematic generation of evaluation sets. The evaluation sets include checklists with metrics, and criteria for the software quality certification according to the classification of software product type. This paper presents a metamodel for the systematic generation and maintenance of the evaluation sets. Then, we construct prototype level evaluation sets to show the validity of the metamodel.

Novel Incremental Spectrum Sensing in Cooperative Cognitive Radio Networks (협력 인지 통신 네트워크에서 새로운 증분형 스펙트럼 검출)

  • Ha, Nguyen Vu;Kong, Hyung-Yun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9A
    • /
    • pp.859-867
    • /
    • 2010
  • In this paper, we consider a novel spectrum sensing system in which firstly, the fusion center (FC) senses and makes the own decision then if its sensing result is not useful for achieving the final decision, the local observations from the cognitive users (CUs) will be required. Moreover, in case that FC needs the results from CUs, we will choose only CU having the highest collected energy to send its local decision to FC. Based on this selecting method, the number of sensing bits can be reduced; hence, we can save the power and the bandwidth for reporting stage in the cognitive radio network (CRN). The mathematical analysis of the key metrics of the sensing schemes (probability of detection, false alarm, e.g.) will be investigated and confirmed by the Monte-Carlo simulation results to show the performance enhancement of the proposed schemes.

An Insight Study on Keyword of IoT Utilizing Big Data Analysis (빅데이터 분석을 활용한 사물인터넷 키워드에 관한 조망)

  • Nam, Soo-Tai;Kim, Do-Goan;Jin, Chan-Yong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.10a
    • /
    • pp.146-147
    • /
    • 2017
  • Big data analysis is a technique for effectively analyzing unstructured data such as the Internet, social network services, web documents generated in the mobile environment, e-mail, and social data, as well as well formed structured data in a database. The most big data analysis techniques are data mining, machine learning, natural language processing, and pattern recognition, which were used in existing statistics and computer science. Global research institutes have identified analysis of big data as the most noteworthy new technology since 2011. Therefore, companies in most industries are making efforts to create new value through the application of big data. In this study, we analyzed using the Social Matrics which a big data analysis tool of Daum communications. We analyzed public perceptions of "Internet of things" keyword, one month as of october 8, 2017. The results of the big data analysis are as follows. First, the 1st related search keyword of the keyword of the "Internet of things" has been found to be technology (995). This study suggests theoretical implications based on the results.

  • PDF