• Title/Summary/Keyword: 북마크

Search Result 64, Processing Time 0.043 seconds

A Study on the Service Model of the Public Libraries for Dyslexics (공공도서관의 난독인 정보봉사 모델에 관한 연구)

  • Kim, Seon-Ho
    • Journal of Korean Library and Information Science Society
    • /
    • v.40 no.2
    • /
    • pp.183-206
    • /
    • 2009
  • At present there is a increasing interest on dyslexia, not only medical science, psychology and linguistics but also special education studies in Korea. Unfortunately that is not yet in library and information sciences. This study is intended to develop the service model of the public libraries for dylexics in Korea. In order to accomplish the intention, the service models of the public libraries are benchmarked in the northern European countries, namely, Sweden, Denmark, and Finland. The service model developed in the study is applicable in school and university libraries as well.

  • PDF

The DRAM Effects on The Performance of Multicore Processors (멀티코어 프로세서의 성능에 대한 DRAM의 영향)

  • Lee, Jongbok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.3
    • /
    • pp.203-208
    • /
    • 2017
  • Recently, the importance of DRAM is very significant in multicore processors which are widely used in computers, laptops, tablet PCs, and mobile devices. To keep up with this, both industry and academia have actively studied various types of future DRAMs. Therefore, accurate DRAM model is requisite when evaluating the multicore processor performance. In this paper, a multicore processor trace-driven simulator which can couple with the cycle-accurate DRAM simulator has been developed. Using SPEC 2000 benchmarks as input, the effect of cycle-accurate DDR3 model on the multicore processor performance has been evaluated.

Application for Personalized Advertisement (Personalized Advertisement 어플리케이션 개발)

  • Park Sung-Soo;Jung Moon-Ryul
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2004.11a
    • /
    • pp.137-141
    • /
    • 2004
  • 본 논문은 디지털방송 컨텐츠(드라마, 영화, 토크쇼)상에서 PPL(Product Placement) 간접광고를 보다 개인화 된 맞춤 광고로 구현한 어플리케이션을 기술한다. 이러한 애플리케이션은 개인의 취향에 최적화된 광고를 제공하고 방송사와 시청자간의 Interaction에 의해 전자상거래가 가능한 채널로 이동할 수 있는 기능을 제공한다. 다시 말해서 본 논문의 어플리케이션은 컨텐츠 시작 전에 개인이 선호하는 물품을 선택하여 컨텐츠 속에 나오는 PPL광고에서 시청자가 선택한 물품만이 컨텐츠 방영 중에 나타나고, 그 선택 물품의 상세 정보와 구매를 할 수 있는 DAL(Dedicated Advertisers Location)채널로 이동할 수 있도록 하였다. 따라서 시청자 측면에서는 개인화 된 방송 서비스를 이용하여 자신이 원하는 선별된 광고를 보는 효율적이고 능동적인 방송시청을 하게 되며, 방송 사업자 측면에서는 맞춤 방송 서비스로 효과적인 타겟 소비자를 정하여 효과적인 마케팅을 할 수 있다. 그리고 시청한 광고 물품들을 장바구니라는 일종의 북마크에 담을 수 있게 하였다. 시청자가 원할 때는 언제든지 광고된 물품의 T-Commerce채널로 이동 가능하도록 설계, 구현하였다. 이것은 개인화 된 맞춤형 방송과 쌍방향 Interaction이 가능한 새로운 데이터방송의 특성을 잘 보여주는 Interactive 광고로서 새로운 모델이 될 것이다. 본 논문의 어플리케이션(Xlet)은 우리나라 위성방송 데이터방송 표준인 MHP 미들웨어에 의해 구동되어지며, 데이터방송용 API인 JavaTV API, Havi & Davic API에 따라 구현되어졌다.

  • PDF

Design and Development of a Personalized News Recommendation System (개인 맞춤형 뉴스 추천 시스템의 설계 및 개발)

  • Yu, YoungSeo;Lee, Jimin;Lee, Ki Yong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2016.04a
    • /
    • pp.599-602
    • /
    • 2016
  • 실시간으로 뉴스 기사를 제공하는 온라인 뉴스 시스템이 널리 사용되면서, 사람들은 매 순간 속보와 새로운 뉴스 등 대량의 뉴스 기사에 노출되어 있다. 하지만 방대한 뉴스들로부터 사용자가 원하는 뉴스를 찾는 것은 매우 어려운 일이다. 따라서 개인 관심사에 따라 뉴스를 추천해주는 개인 맞춤형 뉴스 추천 시스템의 필요성이 증가되고 있다. 본 논문에서는 사용자의 관심사를 분석하여, 사용자의 관심사에 따라 관련된 뉴스를 자동으로 추천해주는 뉴스 추천 시스템을 설계 및 개발한다. 제안 시스템은 각 사용자가 북마크한 뉴스 기사와 읽은 뉴스 기사를 클러스터링하여 사용자별 프로파일을 생성한다. 또한 전체 뉴스 기사들을 클러스터링하여 주제 별로 분류한다. 사용자에게 뉴스를 추천하기 위해, 제안 시스템은 해당 사용자 프로파일에 포함된 각 클러스터에 대해 전체 뉴스 기사에 대한 클러스터들 중 가장 가까운 클러스터를 찾아 해당 클러스터 내의 뉴스 기사들을 거리 순으로 추천한다. 실제 구현된 시스템을 통해, 제안한 뉴스 추천 시스템이 각 개인에게 뉴스를 효과적으로 추천함을 보인다.

A Design on the Multimedia Fingerprinting code based on Feature Point for Forensic Marking (포렌식 마킹을 위한 특징점 기반의 동적 멀티미디어 핑거프린팅 코드 설계)

  • Rhee, Kang-Hyeon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.4
    • /
    • pp.27-34
    • /
    • 2011
  • In this paper, it was presented a design on the dynamic multimedia fingerprinting code for anti-collusion code(ACC) in the protection of multimedia content. Multimedia fingerprinting code for the conventional ACC, is designed with a mathematical method to increase k to k+1 by transform from BIBD's an incidence matrix to a complement matrix. A codevector of the complement matrix is allowanced fingerprinting code to a user' authority and embedded into a content. In the proposed algorithm, the feature points were drawing from a content which user bought, with based on these to design the dynamical multimedia fingerprinting code. The candidate codes of ACC which satisfied BIBD's v and k+1 condition is registered in the codebook, and then a matrix is generated(Below that it calls "Rhee matrix") with ${\lambda}+1$ condition. In the experimental results, the codevector of Rhee matrix based on a feature point of the content is generated to exist k in the confidence interval at the significance level ($1-{\alpha}$). Euclidean distances between row and row and column and column each other of Rhee matrix is working out same k value as like the compliment matrices based on BIBD and Graph. Moreover, first row and column of Rhee matrix are an initial firing vector and to be a forensic mark of content protection. Because of the connection of the rest codevectors is reported in the codebook, when trace a colluded code, it isn't necessity to solve a correlation coefficient between original fingerprinting code and the colluded code but only search the codebook then a trace of the colluder is easy. Thus, the generated Rhee matrix in this paper has an excellent robustness and fidelity more than the mathematically generated matrix based on BIBD as ACC.

Clustering Method based on Genre Interest for Cold-Start Problem in Movie Recommendation (영화 추천 시스템의 초기 사용자 문제를 위한 장르 선호 기반의 클러스터링 기법)

  • You, Tithrottanak;Rosli, Ahmad Nurzid;Ha, Inay;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.1
    • /
    • pp.57-77
    • /
    • 2013
  • Social media has become one of the most popular media in web and mobile application. In 2011, social networks and blogs are still the top destination of online users, according to a study from Nielsen Company. In their studies, nearly 4 in 5active users visit social network and blog. Social Networks and Blogs sites rule Americans' Internet time, accounting to 23 percent of time spent online. Facebook is the main social network that the U.S internet users spend time more than the other social network services such as Yahoo, Google, AOL Media Network, Twitter, Linked In and so on. In recent trend, most of the companies promote their products in the Facebook by creating the "Facebook Page" that refers to specific product. The "Like" option allows user to subscribed and received updates their interested on from the page. The film makers which produce a lot of films around the world also take part to market and promote their films by exploiting the advantages of using the "Facebook Page". In addition, a great number of streaming service providers allows users to subscribe their service to watch and enjoy movies and TV program. They can instantly watch movies and TV program over the internet to PCs, Macs and TVs. Netflix alone as the world's leading subscription service have more than 30 million streaming members in the United States, Latin America, the United Kingdom and the Nordics. As the matter of facts, a million of movies and TV program with different of genres are offered to the subscriber. In contrast, users need spend a lot time to find the right movies which are related to their interest genre. Recent years there are many researchers who have been propose a method to improve prediction the rating or preference that would give the most related items such as books, music or movies to the garget user or the group of users that have the same interest in the particular items. One of the most popular methods to build recommendation system is traditional Collaborative Filtering (CF). The method compute the similarity of the target user and other users, which then are cluster in the same interest on items according which items that users have been rated. The method then predicts other items from the same group of users to recommend to a group of users. Moreover, There are many items that need to study for suggesting to users such as books, music, movies, news, videos and so on. However, in this paper we only focus on movie as item to recommend to users. In addition, there are many challenges for CF task. Firstly, the "sparsity problem"; it occurs when user information preference is not enough. The recommendation accuracies result is lower compared to the neighbor who composed with a large amount of ratings. The second problem is "cold-start problem"; it occurs whenever new users or items are added into the system, which each has norating or a few rating. For instance, no personalized predictions can be made for a new user without any ratings on the record. In this research we propose a clustering method according to the users' genre interest extracted from social network service (SNS) and user's movies rating information system to solve the "cold-start problem." Our proposed method will clusters the target user together with the other users by combining the user genre interest and the rating information. It is important to realize a huge amount of interesting and useful user's information from Facebook Graph, we can extract information from the "Facebook Page" which "Like" by them. Moreover, we use the Internet Movie Database(IMDb) as the main dataset. The IMDbis online databases that consist of a large amount of information related to movies, TV programs and including actors. This dataset not only used to provide movie information in our Movie Rating Systems, but also as resources to provide movie genre information which extracted from the "Facebook Page". Formerly, the user must login with their Facebook account to login to the Movie Rating System, at the same time our system will collect the genre interest from the "Facebook Page". We conduct many experiments with other methods to see how our method performs and we also compare to the other methods. First, we compared our proposed method in the case of the normal recommendation to see how our system improves the recommendation result. Then we experiment method in case of cold-start problem. Our experiment show that our method is outperform than the other methods. In these two cases of our experimentation, we see that our proposed method produces better result in case both cases.

A Two-Phase On-Device Analysis for Gender Prediction of Mobile Users Using Discriminative and Popular Wordsets (모바일 사용자의 성별 예측을 위한 식별 및 인기 단어 집합 기반 2단계 기기 내 분석)

  • Choi, Yerim;Park, Kyuyon;Kim, Solee;Park, Jonghun
    • The Journal of Society for e-Business Studies
    • /
    • v.21 no.1
    • /
    • pp.65-77
    • /
    • 2016
  • As respecting one's privacy becomes an important issue in mobile device data analysis, on-device analysis is getting attention, in which the data analysis is conducted inside a mobile device without sending data from the device to outside. One possible application of the on-device analysis is gender prediction using text data in mobile devices, such as text messages, search keyword, website bookmarks, and contact, which are highly private, and the limited computing power of mobile devices can be addressed by utilizing the word comparison method, where words are selected beforehand and delivered to a mobile device of a user to determine the user's gender by matching mobile text data and the selected words. Moreover, it is known that performing prediction after filtering instances using definite evidences increases accuracy and reduces computational complexity. In this regard, we propose a two-phase approach to on-device gender prediction, where both discriminability and popularity of a word are sequentially considered. The proposed method performs predictions using a few highly discriminative words for all instances and popular words for unclassified instances from the previous prediction. From the experiments conducted on real-world dataset, the proposed method outperformed the compared methods.

A Study on the Effect of Altmetrics about Academic Papers on Citations and Moderating Effect of Open Access (학술논문 알트메트릭스의 피인용 영향과 오픈액세스의 조절효과에 관한 연구)

  • Cho, Jane
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.56 no.2
    • /
    • pp.35-55
    • /
    • 2022
  • As altmetrics has received a lot of attention as an muti-dimensional impact assessment tool, it is necessary to verify whether it can supplement the citation-based research performance evaluation system. This study analyzed and compared the effects of each altmetrics sources on citation by sampling 1,600 high-cited papers published in the last 10 years (Sample A) and non-year-limited papers (Sample B) indexed in Scopus. In addition, it was analyzed whether the OA of the paper had a moderating effect on the numbers of cited-by, and the difference according to the samples was verified. As a result of the analysis, only the number of Mendeley bookmark readers was analyzed to have a positive (+) effect on the numbers of cited-by, and OA status had a significant moderating effect in both groups. However, in sample A, OA showed a reinforcing effect on cited-by, whereas Sample B showed a weakening effect, showing a difference. On the other hand, social mention such as media reports do not have a significant effect on the cited-by regardless of OA conditions, but they can be used to understand the social impact of non-academic mass readers.

Cost-based Optimization of Block Recycling Scheme in NAND Flash Memory Based Storage System (NAND 플래시 메모리 저장 장치에서 블록 재활용 기법의 비용 기반 최적화)

  • Lee, Jong-Min;Kim, Sung-Hoon;Ahn, Seong-Jun;Lee, Dong-Hee;Noh, Sam-H.
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.7
    • /
    • pp.508-519
    • /
    • 2007
  • Flash memory based storage has been used in various mobile systems and now is to be used in Laptop computers in the name of Solid State Disk. The Flash memory has not only merits in terms of weight, shock resistance, and power consumption but also limitations like erase-before-write property. To overcome these limitations, Flash memory based storage requires special address mapping software called FTL(Flash-memory Translation Layer), which often performs merge operation for block recycling. In order to reduce block recycling cost in NAND Flash memory based storage, we introduce another block recycling scheme which we call migration. As a result, the FTL can select either merge or migration depending on their costs for each block recycling. Experimental results with Postmark benchmark and embedded system workload show that this cost-based selection of migration/merge operation improves the performance of Flash memory based storage. Also, we present a solution of macroscopic optimal migration/merge sequence that minimizes a block recycling cost for each migration/merge combination period. Experimental results show that the performance of Flash memory based storage can be more improved by the macroscopic optimization than the simple cost-based selection.

Comparative Study of Machine learning Techniques for Spammer Detection in Social Bookmarking Systems (소셜 복마킹 시스템의 스패머 탐지를 위한 기계학습 기술의 성능 비교)

  • Kim, Chan-Ju;Hwang, Kyu-Baek
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.5
    • /
    • pp.345-349
    • /
    • 2009
  • Social bookmarking systems are a typical web 2.0 service based on folksonomy, providing the platform for storing and sharing bookmarking information. Spammers in social bookmarking systems denote the users who abuse the system for their own interests in an improper way. They can make the entire resources in social bookmarking systems useless by posting lots of wrong information. Hence, it is important to detect spammers as early as possible and protect social bookmarking systems from their attack. In this paper, we applied a diverse set of machine learning approaches, i.e., decision tables, decision trees (ID3), $na{\ddot{i}}ve$ Bayes classifiers, TAN (tree-augment $na{\ddot{i}}ve$ Bayes) classifiers, and artificial neural networks to this task. In our experiments, $na{\ddot{i}}ve$ Bayes classifiers performed significantly better than other methods with respect to the AUC (area under the ROC curve) score as veil as the model building time. Plausible explanations for this result are as follows. First, $na{\ddot{i}}ve$> Bayes classifiers art known to usually perform better than decision trees in terms of the AUC score. Second, the spammer detection problem in our experiments is likely to be linearly separable.