• Title/Summary/Keyword: 이웃리스트

Search Result 19, Processing Time 0.02 seconds

Neighbor List Management to enable Fast Scanning and Efficient Handover in IEEE 802.16e-Based Femto-cell Systems (IEEE 802.16e 기반의 펨토셀 시스템에서 빠른 스캐닝 및 효율적인 핸드오버를 위한 이웃 기지국 리스트 관리 기법)

  • Nam, Ji-Hee;Shin, Jung-Chae;Yoon, Cul-Sik;Cho, Ho-Shin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.6A
    • /
    • pp.445-457
    • /
    • 2009
  • Recently, there are growing interests in femto-cell for providing indoor users with various broadband multimedia services more efficiently. The technical issues regarding femto-cell such as interference management, self-organization, and resource allocation are now being intensively studied and investigated by researchers worldwide. In this paper, two novel schemes of neighboring cell list(NCL) management are proposed for the IEEE 802.16e system where a macro-cell and huge number of femto-cells coexist. The proposed schemes, named MS location-based neighboring cell list management and BS type-based neighboring cell list management, enable a mobile station(MS) to perform fast scanning and efficient handover by means of preselecting the candidate target femto-cells with high possibility for handover. The simulation result shows that the proposed schemes improve the MS's handover-related performance in terms of scanning power and scanning time compared with the conventional managements scheme of IEEE 802.16e system.

Time-aware Collaborative Filtering with User- and Item-based Similarity Integration

  • Lee, Soojung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.9
    • /
    • pp.149-155
    • /
    • 2022
  • The popularity of e-commerce systems on the Internet is increasing day by day, and the recommendation system, as a core function of these systems, greatly reduces the effort to search for desired products by recommending products that customers may prefer. The collaborative filtering technique is a recommendation algorithm that has been successfully implemented in many commercial systems, but despite its popularity and usefulness in academia, the memory-based implementation has inaccuracies in its reference neighbor. To solve this problem, this study proposes a new time-aware collaborative filtering technique that integrates and utilizes the neighbors of each item and each user, weighting the recent similarity more than the past similarity with them, and reflecting it in the recommendation list decision. Through the experimental evaluation, it was confirmed that the proposed method showed superior performance in terms of prediction accuracy than other existing methods.

A Learning Agent for Automatic Bookmark Classification (북 마크 자동 분류를 위한 학습 에이전트)

  • Kim, In-Cheol;Cho, Soo-Sun
    • The KIPS Transactions:PartB
    • /
    • v.8B no.5
    • /
    • pp.455-462
    • /
    • 2001
  • The World Wide Web has become one of the major services provided through Internet. When searching the vast web space, users use bookmarking facilities to record the sites of interests encountered during the course of navigation. One of the typical problems arising from bookmarking is that the list of bookmarks lose coherent organization when the the becomes too lengthy, thus ceasing to function as a practical finding aid. In order to maintain the bookmark file in an efficient, organized manner, the user has to classify all the bookmarks newly added to the file, and update the folders. This paper introduces our learning agent called BClassifier that automatically classifies bookmarks by analyzing the contents of the corresponding web documents. The chief source for the training examples are the bookmarks already classified into several bookmark folders according to their subject by the user. Additionally, the web pages found under top categories of Yahoo site are collected and included in the training examples for diversifying the subject categories to be represented, and the training examples for these categories as well. Our agent employs naive Bayesian learning method that is a well-tested, probability-based categorizing technique. In this paper, the outcome of some experimentation is also outlined and evaluated. A comparison of naive Bayesian learning method alongside other learning methods such as k-Nearest Neighbor and TFIDF is also presented.

  • PDF

A Novel K-hop Cluster-based Ad hoc Routing Scheme with Delegation Functions (위임 기능을 이용한 새로운 K-hop 클러스터 기반 Ad hoc 라우팅 구조)

  • Kim Tae-yeon;Wang Ki-cheoul
    • Journal of Internet Computing and Services
    • /
    • v.5 no.5
    • /
    • pp.27-37
    • /
    • 2004
  • The existing ad hoc network protocols suffer the scalability problem due to the inherent characteristics of node mobility. Cluster-based routing protocols divide the member nodes into a set of clusters and perform a hierarchical routing between these clusters. This hierarchical feature help to improve the scalability of ad hoc network routing. However, previous k-hop cluster-based routing protocols face another problems, that is, control overhead of the cluster headers. This paper proposes a novel k-hop cluster-based routing scheme with delegation functions for mobile ad hoc networks. The scheme employs is based on tree topology to manage cluster members in effectively. The cluster headers do not manage the routing table for whole members, while the header keeps the routing table for its neighbor members and the member list for one hop over nodes within k-hop cluster. Then the in-between leveled nodes manage the nested nodes which is structured in the lower level. Therefore, the proposed mechanism can reduce some control overhead of the cluster leaders.

  • PDF

K-Nearest Neighbor Course Recommender System using Collaborative Filtering (협동적 필터링을 이용한 K-최근접 이웃 수강 과목 추천 시스템)

  • Sohn, Ki-Rack;Kim, So-Hyun
    • Journal of The Korean Association of Information Education
    • /
    • v.11 no.3
    • /
    • pp.281-288
    • /
    • 2007
  • Collaborative filtering is a method to predict preference items of a user based on the evaluations of items provided by others with similar preferences. Collaborative filtering helps general people make smart decisions in today's information society where information can be easily accumulated and analyzed. We designed, implemented, and evaluated a course recommendation system experimentally. This system can help university students choose courses they prefer to. Firstly, the system needs to collect the course preferences from students and store in a database. Users showing similar preference patterns are considered into similar groups. We use Pearson correlation as a similarity measure. We select K-nearest students to predict the unknown preferences of the student and provide a ranked list of courses based on the course preferences of K-nearest students. We evaluated the accuracy of the recommendation by computing the mean absolute errors of predictions using a survey on the course preferences of students.

  • PDF

A Study of Middle School Students' Perception regarding Territorial Identity: Assessing their Freehand Sketch Maps of Territory, National Border, and Neighboring Countries (중학생의 영토정체성에 관한 연구 -스케치맵에 나타난 영토, 국경, 이웃한 나라에 대한 인식을 바탕으로-)

  • Chun, Bo Ae
    • Journal of the Korean Geographical Society
    • /
    • v.47 no.6
    • /
    • pp.899-920
    • /
    • 2012
  • The purpose of this study is to examine and better understand student's perception of territory in the deterritorialized world. Students' sketch maps were analyzed to investigate the way of which they recognized the form of national territory, border, geographic location, and neighboring countries. In addition, students' values, attitudes, and affection for their homeland and other countries were observed through the awareness of North Korea, DMZ, and Dok-do island. Scrutinizing students' sketch maps and follow-up interviews provided much more in-depth context for understanding students' narratives about territorial identity than did the analysis of structured surveys since they can freely draw and sketch their cognition. A qualitative data analysis builded a code list with 67 codes generated from 626 quotations. These data were exported to CSV format to elicit and evaluate differential variances of territorial identity along with student's Social Studies score and Grade Point Average for inferential statistics and quantitative data analysis using SPSS. Based on the results of data analysis and discussion, some suggestions to build a model of territorial education and to develop teaching and learning materials in the domain of geography education were provided.

  • PDF

Design of A-GBSR Protocol Using Beacon Message in 802.11p WAVE (802.11p WAVE에서 비콘메시지를 이용한 A-GBSR 프로토콜 설계)

  • Jeong, Seon-Mi;Kim, Hyun-Ju;Kim, Chang-Geun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.7
    • /
    • pp.1554-1560
    • /
    • 2015
  • 802.11p WAVE is the next-generation wireless communication that can make Ad-hoc network communication possible for Vehicle-to-Vehicle. GBSR protocol, one of the 802.11p WAVE protocols, mainly focuses on improvements in networks that have a tendency to disconnect. However, it does not consider the transmission time and velocity of a packet thus, there is a disadvantage of there being a delay in the transmission velocity, in urgent situations like car accidents, emergency patients transportation and crimes. In this paper, we proposed A-GBSR protocol for transmission of a packet to mobile node which has a high speed through the improved beacon message and Adaptive Neighbor list Management that are considering of the GBSR protocol transmission velocity.

Clustering-based Hierarchical Scene Structure Construction for Movie Videos (영화 비디오를 위한 클러스터링 기반의 계층적 장면 구조 구축)

  • Choi, Ick-Won;Byun, Hye-Ran
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.5
    • /
    • pp.529-542
    • /
    • 2000
  • Recent years, the use of multimedia information is rapidly increasing, and the video media is the most rising one than any others, and this field Integrates all the media into a single data stream. Though the availability of digital video is raised largely, it is very difficult for users to make the effective video access, due to its length and unstructured video format. Thus, the minimal interaction of users and the explicit definition of video structure is a key requirement in the lately developing image and video management systems. This paper defines the terms and hierarchical video structure, and presents the system, which construct the clustering-based video hierarchy, which facilitate users by browsing the summary and do a random access to the video content. Instead of using a single feature and domain-specific thresholds, we use multiple features that have complementary relationship for each other and clustering-based methods that use normalization so as to interact with users minimally. The stage of shot boundary detection extracts multiple features, performs the adaptive filtering process for each features to enhance the performance by eliminating the false factors, and does k-means clustering with two classes. The shot list of a result after the proposed procedure is represented as the video hierarchy by the intelligent unsupervised clustering technique. We experimented the static and the dynamic movie videos that represent characteristics of various video types. In the result of shot boundary detection, we had almost more than 95% good performance, and had also rood result in the video hierarchy.

  • PDF

Multi-hop Routing Protocol based on Neighbor Conditions in Multichannel Ad-hoc Cognitive Radio Networks (인지 무선 애드혹 네트워크에서의 주변 상황을 고려한 협력적 멀티홉 라우팅 방법)

  • Park, Goon-Woo;Choi, Jae-Kark;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4A
    • /
    • pp.369-379
    • /
    • 2011
  • During the routing process between nodes on the CR(Cognitive Radio) network conducting for efficient use of limited frequency resources, spectrum handover process due to the appearance of the PU occupies most of the routing latency, and also decreases the reliability of the path. In this paper, a cooperative routing protocol in a multi-channel environment is proposed. The source node broadcasts a message with available channel lists and probability of PU appearance during its route guidance. The intermediate nodes re-transmit the message, received from the source node, and update and maintain the information, status table of the path. The destination node determines the optimal path and sends a reply message to the selected path after it receives the messages from the intermediate nodes. The average probability of the PU appearance and the average time of the PU appearance are updated while transferring data. During data transmission the channel with the lowest probability of appearance of the PU is selected dynamically and if a PU appears on the current channel partial repairment is performed. It is examined that reliability of the selected path considerably is improved and the routing cost is reduced significantly compared to traditional routing methods.