• Title/Summary/Keyword: information overload

Search Result 522, Processing Time 0.028 seconds

An Efficient P2Proxy Caching Scheme for VOD Systems (VOD 시스템을 위한 효율적인 P2Proxy 캐싱 기법)

  • Kwon Chun-Ja;Choi Chi-Kyu;Lee Chi-Hun;Choi Hwang-Kyu
    • The KIPS Transactions:PartA
    • /
    • v.13A no.2 s.99
    • /
    • pp.111-122
    • /
    • 2006
  • As VOD service over the Internet becomes popular, a large sealable VOD system in P2P streaming environment has become increasing important. In this paper, we propose a new proxy caching scheme, called P2Proxy, to replace the traditional proxy with a sealable P2P proxy in P2P streaming environment. In the proposed scheme, each client in a group stores a different part of the stream from a server into its local buffer and then uses a group of clients as a proxy. Each client receives the request stream from other clients as long as the parts of the stream are available in the client group. The only missing parts of the stream which are not in the client group are directly received from the server. We represent the caching process between clients in a group and a server and then describe a group creation process. This paper proposes the directory structure to share the caching information among clients. By using the directory information, we minimize message exchange overload for a stream caching and playing. We also propose a recovery method for failures about the irregular behavior of P2P clients. In this paper, we evaluate the performance of our proposed scheme and compare the performance with the existing P2P streaming systems.

A User based Collaborative Filtering Recommender System with Recommendation Quantity and Repetitive Recommendation Considerations (추천 수량과 재 추천을 고려한 사용자 기반 협업 필터링 추천 시스템)

  • Jihoi Park;Kihwan Nam
    • Information Systems Review
    • /
    • v.19 no.2
    • /
    • pp.71-94
    • /
    • 2017
  • Recommender systems reduce information overload and enhance choice quality. This technology is used in many services and industry. Previous studies did not consider recommendation quantity and the repetitive recommendations of an item. This study is the first to examine recommender systems by considering recommendation quantity and repetitive recommendations. Only a limited number of items are displayed in offline stores because of their physical limitations. Determining the type and number of items that will be displayed is an important consideration. In this study, I suggest the use of a user-based recommender system that can recommend the most appropriate items for each store. This model is evaluated by MAE, Precision, Recall, and F1 measure, and shows higher performance than the baseline model. I also suggest a new performance evaluation measure that includes Quantity Precision, Quantity Recall, and Quantity F1 measure. This measure considers the penalty for short or excess recommendation quantity. Novelty is defined as the proportion of items in a recommendation list that consumers may not experience. I evaluate the new revenue creation effect of the suggested model using this novelty measure. Previous research focused on recommendations for customer online, but I expand the recommender system to cover stores offline.

Factors Related to Techno-stress Perceived by Elementary School Teachers in a Flipped Learning Environment (플립드러닝 환경에서 초등 교사가 지각하는 테크노스트레스 관련 변인)

  • Eom, Wooyong;Lee, Heemyeong;Lee, Seonga
    • Journal of The Korean Association of Information Education
    • /
    • v.24 no.2
    • /
    • pp.177-188
    • /
    • 2020
  • The purpose of this study was to examine the relationship between techno-stress perceived by elementary school teachers and related variables in a flipped learning environment. To achieve the purpose, the following research question have been established: First, what is the difference between techno-stress perceived by elementary school teachers? Second, what is the difference between techno-stress related variables perceived by elementary school teachers? Third, how do the TPACK, teacher effectiveness, and school environment support, perceived by elementary school teachers, affect technostress? 207 teachers at elementary school responded on a questionnaire to measure their perceived techno-stress, TPACK, teacher efficacy, and school environment support. Data were analyzed with using independent two-sample t-test, one-way ANOVA, and multiple regression analysis. The results were as follows: First, the elementary school teachers working on a leading school perceived higher techno-overload and techno-complexity more than those in ordinary school. Second, the elementary school teachers showed differences in the perception of TPACK, teacher efficacy, and school environment support according to the teacher's career, and leading school. Third, the elementary schools teachers perceived in TK, TCK, TPACK, educational support, and technology have a positive affect with techno-stress. The results are significant in that they provided data for reducing techno-stress of elementary school teachers in a flipped learning environment.

The Effects of Whole-task Sequencing Emphasis Manipulation on Expertise Acquisition in Web Based Complex Task (웹기반 복합적 과제에서 전체과제 계열화 강조변화 방법이 전문성 향상에 미치는 영향)

  • Kim, Kyung-Jin;Kim, Kyung
    • Journal of The Korean Association of Information Education
    • /
    • v.20 no.6
    • /
    • pp.629-644
    • /
    • 2016
  • The purpose of this study was to investigate the effects of whole-task sequencing emphasis manipulation on expertise acquisition in web based complex task. To achieve the purpose, emphasis manipulation sequencing type is composed of a simple emphasis manipulation, a snowballing manipulation, and a full emphasis manipulation sequencing and participants was drawn from a pool of 93 undergraduate students sampled for the study. According to the findings, a snowballing manipulation group invested significantly lower cognitive load than a full emphasis manipulation group but did not a simple emphasis manipulation group. Based on these findings, though complex task is included of high interactivity owing to real task, learner cannot suffer cognitive overload because emphasis manipulation which can view the whole task and the part task in parallel provides meta cognition for learner. And whole-task sequencing emphasis manipulation affects to transfer. The snowballing emphasis manipulation group invested significantly higher than simple emphasis manipulation group and full emphasis manipulation group. Based on these findings, the snowballing manipulation which learner use whole-task sequencing and part-task sequencing simultaneously contribute to understandings and ability to solve problems for complex task and it will in turn, lead to expertise acquisition.

Load balancing of a deployment server using P2P (P2P를 이용한 배포 서버의 부하 분산)

  • Son Sei-Il;Lee Suk-Kyoon
    • The KIPS Transactions:PartA
    • /
    • v.13A no.1 s.98
    • /
    • pp.45-52
    • /
    • 2006
  • To perform on-line maintenance for Distributed Information System, it is indispensable to disseminate files to participant nodes in the network. When users' requests for file deployment occur simultaneously in a short period a deployment server falls into overload phase, which is often called Flash Crowds. h common solution to avoid Flash Crowds is to increase hardware capacity. In this paper, we propose a software solution based on P2P, which does not cost any additional expense. In the proposed solution, nodes in the network are grouped into subnetworks one of which is composed of only neighboring nodes. In each subnetwork, copies of deployment files can be transferred to each other. Consequently, it brings about the effect of load balancing in deployment server. To raise the effectiveness, target files for deployment are packed into one package. Before being transferred, each package is divided into multiple equal-sized segments. A deployment server in a normal phase transmits a package requested from nodes in segment units. However a deployment server is overloaded, if segments already exist in the subnetwork participant nodes in the subnetwork receive necessary segments from neighboring nodes. In this paper, we propose data structures and algorithm for this approach and show performance improvement through simulation.

Fast Fingerprint Alignment Method and Weighted Feature Vector Extraction Method in Filterbank-Based Fingerprint Matching (필터뱅크 기반 지문정합에서 빠른 지문 정렬 방법 및 가중치를 부여한 특징 벡터 추출 방법)

  • 정석재;김동윤
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.1
    • /
    • pp.71-81
    • /
    • 2004
  • Minutiae-based fingerprint identification systems use minutiae points, which cannot completely characterize local ridge structures. Further, this method requires many methods for matching two fingerprint images containing different number of minutiae points. Therefore, to represent the fired length information for one fingerprint image, the filterbank-based method was proposed as an alternative to minutiae-based fingerprint representation. However, it has two shortcomings. One shortcoming is that similar feature vectors are extracted from the different fingerprints which have the same fingerprint type. Another shortcoming is that this method has overload to reduce the rotation error in the fingerprint image acquisition. In this paper, we propose the minutia-weighted feature vector extraction method that gives more weight in extracting feature value, if the region has minutiae points. Also, we Propose new fingerprint alignment method that uses the average local orientations around the reference point. These methods improve the fingerprint system's Performance and speed, respectively. Experimental results indicate that the proposed methods can reduce the FRR of the filterbank-based fingerprint matcher by approximately 0.524% at a FAR of 0.967%, and improve the matching performance by 5% in ERR. The system speed is over 1.28 times faster.

A Study of Wireless LAN Cryptosystem for Supporting Realtime Mutual Authentication (실시간 상호인증 지원을 위한 무선랜 보안시스템에 관한 연구)

  • Lee Sang-Ryul
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.5 s.37
    • /
    • pp.161-170
    • /
    • 2005
  • The Certificate Revocation List(CRL) or the Online Certificate Status Protocol(OCSP)has been used to validate certificates. However, the CRL cannot validate certificates in realtime because of the Time-Gap problem and the OCSP server overloads in a large scale secure system. In addition, the client cannot access a wired LAN until the client has been authenticated by the authentication server on the IEEE 802. 1x framework. Therefore, the client cannot validate the authentication server's certificate using a certificate validation server. Thus, the client cannot authenticate the authentication server in realtime. To solve these problems this paper designed a secure system that can protect the content of communications and authenticate users in realtime on a wireless LAN The designed certificate validation protocol was proved that the stability and efficiency of the system was very high, the result of the validation had the presence, the speed of the validation was not affected by the system scale, the number of authorities user must trust was reduced to one, and the overload of the validation server was Protected. And the designed user authentication and key exchange protocols were Proved that the mutual authentication was possible in realtime and the fact of the authentication could be authorized by the CA because of using the authorized certificates.

  • PDF

Comprehensive Analysis of Exposed Adverse Factors in Disaster Response Activities - Focused on Fire - (재난 대응 활동 시 노출가능 유해인자 종합분석 -화재 현장을 중심으로-)

  • Park, Chanseok
    • Journal of the Society of Disaster Information
    • /
    • v.10 no.3
    • /
    • pp.420-430
    • /
    • 2014
  • Firefighters performing disaster response activities such as Fire Suppression Rescue First Aid in fire are being exposed in various adverse factors, heat, smoke, toxic gases, emotional stress, biological toxic factors and physical overload by unnatural ergonomic posture required for firefighters. But so far, there is the study for this problem only separately. There is no study about comprehesive analysis of exposed adverse factors in fire-related disaster response activities and countermeasures. The purpose of this study is to contiribute to solving the health problems and prevention of accidents of firefighters by extracting hazardous agents in disaster such as fire and by proposing countermeasures. After analyzing circumstances such as fire-suppression, rescue first aid and life-environment, exposure factors of fire are derived and exposure status is suggested according to physical chemical biological psychological aspects. The countermeasure against the noise of the physical exposure factors are proposed. The countermeasures such as protective equipment and clean room in chemical factors, infection prevention education, vaccination and periodic check system in biological factors, PTSD alleviation booth and mentoring in psychological factors are proposed.

An Efficient Routing Algorithm Considering Packet Collisions in Cognitive Radio Ad-hoc Network (CR Ad-hoc Network에서 패킷 충돌을 고려한 효율적인 경로탐색 알고리즘)

  • Kim, Jin-Su;Choi, Jun-Ho;Shin, Myeong-Jin;Lee, Ji-Seon;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.9
    • /
    • pp.751-764
    • /
    • 2013
  • In cognitive radio ad-hoc networks, common control channel overload and packet collisions are occured due to indiscriminate broadcasting of control packets. So that the path reliability is reduced and control channel is easily saturated. In this paper, we propose a new routing algorithm considering the probability of appearance of primary user and channel status of neighbor nodes. When the source node needs to transmit a data packet to the destination, it performs route discovery process by exchanging control messages using a control channel in ADOV CR Ad-hoc networks. If any intermediate node doesn't have common data channel with previous node to transmit data, it doesn't rebroadcast control packet. And if it has common data channels with previous node, each node determines channel contribution factor with the number of common channels. Based on the channel contribution factor, each node performs different back-off broadcasting. In addition, each node controls control packet flooding by applying to proposed advanced mode using such as number of available channels and channel stability. With the proposed method, the number of control packets to find the data transmission path and the probability of collision among control packets can be decreased. While the path reliability can be increased. Through simulation, we show that our proposed algorithm reduces packet collisions in comparison with the traditional algorithm.

(Design and Implementation of Integrated Binding Service of Considering Loads in Wide-Area Object Computing Environments) (광역 객체 컴퓨팅 환경에서 부하를 고려한 통합 바인딩 서비스의 설계 및 구현)

  • 정창원;오성권;주수종
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.3
    • /
    • pp.293-306
    • /
    • 2003
  • In recent years, distributed computing environments have been radically changing to a structure of global, heterogeneous, federative and wide-area systems. This structure's environments consist of a let of objects which are implemented on telecommunication network to provide a wide range of services. Furthermore, all of objects existing on the earth have the duplicated characteristics according to how to categorize their own names or properties. But, the existing naming or trading mechanism has not supported the binding services of duplicated objects, because of deficiency of independent location service. Also, if the duplicated objects which is existing on different nodes provide the same service, it is possible to distribute the client requests considering each system's load. For this reason, we designed and implemented a new model that can not only support the location management of replication objects, but also provide the dynamic binding service of objects located in a system with minimum overload for maintaining load balancing among nodes in wide-area object computing environments. Our model is functionally divided into two parts; one part is to obtain an unique object handle of replicated objects with same property as a naming and trading service, and the other is to search one or more contact addresses by a location service using a given object handle. From a given model mentioned above, we present the procedures for the integrated binding mechanism in design phase, that is, Naming/Trading Service and Location Service. And then, we described in details the architecture of components for Integrated Binding Service implemented. Finally, we showed our implement environment and executing result of our model.