• Title/Summary/Keyword: Service Retrieval Algorithm

Search Result 52, Processing Time 0.026 seconds

Development of Metacognitive-Based Online Learning Tools Website for Effective Learning (효과적인 학습을 위한 메타인지 기반의 온라인 학습 도구 웹사이트 구축)

  • Lee, Hyun-June;Bean, Gi-Bum;Kim, Eun-Seo;Moon, Il-Young
    • Journal of Practical Engineering Education
    • /
    • v.14 no.2
    • /
    • pp.351-359
    • /
    • 2022
  • In this paper, this app is an online learning tool web application that helps learners learn efficiently. It discusses how learners can improve their learning efficiency in these three aspects: retrieval practice, systematization, metacognition. Through this web service, learners can proceed with learning with a flash card-based retrieval practice. In this case, a method of managing a flash card in a form similar to a directory-file system using a composite pattern is described. Learners can systematically organize their knowledge by converting flash cards into a mind map. The color of the mind map varies according to the learner's learning progress, and learners can easily recognize what they know and what they do not know through color. In this case, it is proposed to build a deep learning model to improve the accuracy of an algorithm for determining and predicting learning progress.

The Study of Sensor Network for Information Retrieval and Communication Protocol High Performance Algorithm (센서 네트워크의 정보검색 및 통신프로토콜 성능향상 알고리즘에 관한 연구)

  • Kang, Jeong-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5B
    • /
    • pp.816-823
    • /
    • 2010
  • Recently research efforts for ubiquitous technology that includes RFID(Radio Frequency Deification and sensor networks are conducted very actively The architectural framework of the USN sensor network discovery service. The survey of the USN technology is conducted on four technological visions that contain USN system technology USN networking technology and USN middleware along with the service platform, With respect to each technological division domestic and worldwide leading research projects are primarily explored with their technical features and research projects are primarily explored with their technical features and research outputs. Boasted on the result of the survey we establish a USN software model that includes data sensing, sensor data storage sensor data storage sensor data naming and sensor feed name service. This main objective of this model is to provide a reference model for the facilitation of USN application developments.

A Study on Design and Implementation of Personalized Information Recommendation System based on Apriori Algorithm (Apriori 알고리즘 기반의 개인화 정보 추천시스템 설계 및 구현에 관한 연구)

  • Kim, Yong
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.23 no.4
    • /
    • pp.283-308
    • /
    • 2012
  • With explosive growth of information by recent advancements in information technology and the Internet, users need a method to acquire appropriate information. To solve this problem, an information retrieval and filtering system was developed as an important tool for users. Also, users and service providers are growing more and more interested in personalized information recommendation. This study designed and implemented personalized information recommendation system based on AR as a method to provide positive information service for information users as a method to provide positive information service. To achieve the goal, the proposed method overcomes the weaknesses of existing systems, by providing a personalized recommendation method for contents that works in a large-scaled data and user environment. This study based on the proposed method to extract rules from log files showing users' behavior provides an effective framework to extract Association Rule.

Optimal Storage Capacity under Random Storage Assignment and Class-based Assignment Storage Policies (임의 저장 방식과 급별 저장 방식하에서의 최적 저장 규모)

  • Lee, Moon-Kyu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.2
    • /
    • pp.274-281
    • /
    • 1999
  • In this paper, we determine the required storage capacity of a unit-load automated storage/retrieval system(AS/RS) under random storage assignment(RAN) and n-class turnover-based storage assignment(CN) policies. For each of the storage policies, an analytic model to determine the optimal storage capacity of the AS/RS is formulated so that the total cost related to storage space and space shortage is minimized while satisfying a desired service level. A closed form of optimal solutions for the RAN policy is derived from the model. For the CN policy, an optimal storage capacity is shown to be determined by applying the existing iterative search algorithm developed for the full turnover-based storage(FULL) policy. Finally, an application of the approach to the standard economic-order-quantity inventory model is provided.

  • PDF

Extracting Melodies from Polyphonic Piano Solo Music Based on Patterns of Music Structure (음악 구조의 패턴에 기반을 둔 다음(Polyphonic) 피아노 솔로 음악으로부터의 멜로디 추출)

  • Choi, Yoon-Jae;Lee, Ho-Dong;Lee, Ho-Joon;Park, Jong C.
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.725-732
    • /
    • 2009
  • Thanks to the development of the Internet, people can easily access a vast amount of music. This brings attention to application systems such as a melody-based music search service or music recommendation service. Extracting melodies from music is a crucial process to provide such services. This paper introduces a novel algorithm that can extract melodies from piano music. Since piano can produce polyphonic music, we expect that by studying melody extraction from piano music, we can help extract melodies from general polyphonic music.

  • PDF

Auto Detection System of Personal Information based on Images and Document Analysis (이미지와 문서 분석을 통한 개인 정보 자동 검색 시스템)

  • Cho, Jeong-Hyun;Ahn, Cheol-Woong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.5
    • /
    • pp.183-192
    • /
    • 2015
  • This paper proposes Personal Information Auto Detection(PIAD) System to prevent leakage of Personal informations in document and image files that can be used by mobile service provider. The proposed system is to automatically detect the images and documents that contain personal informations and shows the result to the user. The PIAD is divided into the selection step for fast and accurate retrieval images and analysis which is composed of SURF, erosion and dilation, FindContours algorithm. The result of proposed PIAD system showed more than 98% accuracy by selection and analysis steps, 267 images detection of 272 images.

Design and Implementation of an XML-based Planning Agent for Internet Marketplaces (인터넷 마켓플레이스를 위한 XML 기반 계획 에이전트의 설계와 구현)

  • Lee, Yong-Ju
    • The KIPS Transactions:PartD
    • /
    • v.8D no.3
    • /
    • pp.211-220
    • /
    • 2001
  • A planning agent supporting customers plays a distinguished role in internet marketplaces. Although several internet marketplaces have been built with the maturity of tools based on internet and distributed technologies, there has been no actual study up to now with respect to the implementation of the planning agent. This paper describes the design and implementation of an XML-based planning agent for internet marketplaces. Since implementing internet marketplaces encounter problems similar to those in other fields such as multidatabase or workflow management systems, we first compare those features. Next we identify functions and roles of the planning agent. The planning agent is implemented using COM+, ASP, and XML, and demonstrated using real data used in an existing system.

  • PDF

A Study on Similar Trademark Search Model Using Convolutional Neural Networks (합성곱 신경망(Convolutional Neural Network)을 활용한 지능형 유사상표 검색 모형 개발)

  • Yoon, Jae-Woong;Lee, Suk-Jun;Song, Chil-Yong;Kim, Yeon-Sik;Jung, Mi-Young;Jeong, Sang-Il
    • Management & Information Systems Review
    • /
    • v.38 no.3
    • /
    • pp.55-80
    • /
    • 2019
  • Recently, many companies improving their management performance by building a powerful brand value which is recognized for trademark rights. However, as growing up the size of online commerce market, the infringement of trademark rights is increasing. According to various studies and reports, cases of foreign and domestic companies infringing on their trademark rights are increased. As the manpower and the cost required for the protection of trademark are enormous, small and medium enterprises(SMEs) could not conduct preliminary investigations to protect their trademark rights. Besides, due to the trademark image search service does not exist, many domestic companies have a problem that investigating huge amounts of trademarks manually when conducting preliminary investigations to protect their rights of trademark. Therefore, we develop an intelligent similar trademark search model to reduce the manpower and cost for preliminary investigation. To measure the performance of the model which is developed in this study, test data selected by intellectual property experts was used, and the performance of ResNet V1 101 was the highest. The significance of this study is as follows. The experimental results empirically demonstrate that the image classification algorithm shows high performance not only object recognition but also image retrieval. Since the model that developed in this study was learned through actual trademark image data, it is expected that it can be applied in the real industrial environment.

A Study on the Secure Database Controlled Under Cloud Environment (클라우드 환경하에서의 안전한 데이터베이스 구축에 관한 연구)

  • Kim, SungYong;Kim, Ji-Hong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.23 no.6
    • /
    • pp.1259-1266
    • /
    • 2013
  • Nowadays, the databases are getting larger and larger. As the company has difficulty in managing the database, they want to outsource the database to the cloud system. In this case the database security is more important because their database is managed by the cloud service provider. Among database security techniques, the encryption method is a well-certified and established technology for protecting sensitive data. However, once encrypted, the data can no longer be easily queried. The performance of the database depends on how to encrypt the sensitive data, and on the approach for searching, and the retrieval efficiency that is implemented. In this paper we propose the new suitable mechanism to encrypt the database and lookup process on the encrypted database under control of the cloud service provider. This database encryption algorithm uses the bloom filter with the variable keyword based index. Finally, we demonstrate that the proposed algorithm should be useful for database encryption related research and application activities.

Closest Pairs and e-distance Join Query Processing Algorithms using a POI-based Materialization Technique in Spatial Network Databases (공간 네트워크 데이터베이스에서 POI 기반 실체화 기법을 이용한 Closest Pairs 및 e-distance 조인 질의처리 알고리즘)

  • Kim, Yong-Ki;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.3
    • /
    • pp.67-80
    • /
    • 2007
  • Recently, many studies on query processing algorithms has been done for spatial networks, such as roads and railways, instead of Euclidean spaces, in order to efficiently support LBS(location-based service) and Telematics applications. However, both a closest pairs query and an e-distance join query require a very high cost in query processing because they can be answered by processing a set of POIs, instead of a single POI. Nevertheless, the query processing cost for closest pairs and e-distance join queries is rapidly increased as the number of k (or the length of radius) is increased. Therefore, we propose both a closest pairs query processing algorithm and an e-distance join query processing algorithm using a POI-based materialization technique so that we can process closest pairs and e-distance join queries in an efficient way. In addition, we show the retrieval efficiency of the proposed algorithms by making a performance comparison of the conventional algorithms.

  • PDF