• Title/Summary/Keyword: 우선순위검색

Search Result 117, Processing Time 0.025 seconds

Progressive Wavelet Transform Coding for Image Communication (영상통신을 위한 점진적 웨이브렛 변환 부호화)

  • 김정일;유재휘
    • Journal of the Korea Society of Computer and Information
    • /
    • v.3 no.3
    • /
    • pp.89-98
    • /
    • 1998
  • In this paper, we propose new image coding using wavelet transform. The new method constructs hierarchical bit plane and progressively transports each bit plane. The proposed algorithm not only supports multi-resolution, dividing original image into special band and various resolution but also reduces blocking effects that come into JPEG In encoding time, this algorithm considers each band characters and priority of transport order, and applies to fast search of image.

  • PDF

정보기술 이용태도에 관한 실증적 연구 : 지역 정보센터를 중심으로

  • 김상욱;신말숙
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.1 no.1
    • /
    • pp.87-109
    • /
    • 1996
  • 본격적인 정보화시대를 맞아 정부에서는 정보화사회를 조기에 구현, 정착시키고자 행정,금융, 교육/연구, 국방, 복지등 5개 분야에 걸친 국가 기간망 구축사업을 위시하여 각종 정보화 정책 및 사업을 추진하고 있다. 그러나 국가정보화사회를 성공적으로 구현하기 위해서는 그의 인프라(Infra)인 지역별 정보화가 추진되어야 한다. 지역정보화는 이제 국가정보화사회를 구현하는데 필수적으로 거쳐야 할 중간단계로 인식되고 있다. 충북지역에서도 청주/청원 지역을 정보화의거점으로 삼아 지역데이타베이스를 구축하고 이를 공중통신망에 접속하여 주민들이 가정이나 직장에서 컴퓨터 단말기를 통하여 필요한 정보를 검색하고,주민간 상호정보교류는 물론 의견이나 제안을 해당 기관 및 단체에 알릴 수 있는 본격적인 지역정보통신 시대를 개막하고자 하는 계획을 추진하고 있다. 그러나 지역정보란 개념과 범위가 방대하고 이용집단에 따라 정보 수요가 다양한 차이를 보일 수 있기 때문에 단번에 지역의 모든 집단의 정보수요를 충족시킬 수 있는 데이터베이스를 구축한다는 것은 불가능한 것이다. 따라서 지역 데이터베이스는 단계적이며 일관성을 유지한 추진 계획과 지속적인 구축노력이 필수적이다. 이러한 배경하에 본 소고에서는 정보항목별 데이터베이스 구축의 우선순위를 파악하고 데이비스의 기술수용모델을 중심으로 사용자에 대한 기술 수용태도를 알아보기 위해 검증을 시도하였다.

  • PDF

A Study of Factors Influencing on Consumer Trust in Internet Shopping Mall (인터넷 쇼핑몰에 대한 신뢰도 형성요인에 관한 실증연구)

  • 한대문;김영렬
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.8 no.2
    • /
    • pp.54-61
    • /
    • 2003
  • This study tried to identify factors influencing on consumer trust of Internet Shopping Mall. There found five factors; transaction security, Validation & contact, company image, nevigation & convenience and consumer style. These factors were correlated with internet shopping variables and there were difference of mean factor scores among consumer groups classified by frequency of online buying.

  • PDF

Progressive Image Coding using Wavelet Transform (웨이브렛 변환을 이용한 점진적 영상 부호화)

  • Kim, Jeong-Il;An, Kwang-Tae;Kim, Jae-Cheol;Yoo, Choong-Yeol;Lee, Kwang-Bae;Kim, Hyen-Ug
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.10
    • /
    • pp.2640-2650
    • /
    • 1997
  • In this paper we propose new image coding using wavelet transform. The new method constructs hierarchical bit plane and progressively transports each bit plane. The proposed algorithms not only supports multi-resolution, dividing original image into special band and various resolution but also reduces blocking effects that come int JPEG. In encoding time this algorithm considers each band characters and priority of transport order, and applies to fast search of image.

  • PDF

An Efficient Processing of Top-k(g) skyline group queries for Incomplete Data (불완전 데이터를 위한 효율적 top-k(g) 스카이라인 그룹 질의 처리 기법)

  • Park, Mi-Ra;Min, Jun-Ki
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.282-285
    • /
    • 2009
  • 대부분의 스카이라인 질의에 대한 연구는 완전한 데이터에 관하여 이루어지고 있다. 하지만, 우리가 웹이나 기타 다른 도구로 데이터베이스에 자료를 입력할 때는 null을 허용하는 부분이 존재한다. 현재 이런 불완전한 데이터를 처리하기 위한 많은 연구가 이루어지고 있다. 본 논문에서는 이러한 문제를 해결하기 위하여 기존에 제안되었던 불완전한 데이터를 처리하는 기법과 차원의 저주를 해결하기 위한 기법을 고려하여 이를 바탕으로 완전한 데이터와 동등하거나 혹은 더 좋을지도 모르는 데이터를 우선순위가 높은 순서대로 k(g)개 검색해주는 스카이라인 그룹 질의를 도입하고 이를 처리하는 방법을 제안한다.

Development of User Oriented Geographic Information Retrieval Service Module Based on Personalized Service (개인화 서비스 기반 사용자 지향형 지리정보 검색 서비스 모듈 개발)

  • Lee, Seok-Cheol;Kim, Chang-Soo
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.14 no.1
    • /
    • pp.49-58
    • /
    • 2011
  • Recently, GIS(Geographic Information System) has been developed to personalized service for providing the specialized services that is aimed to personal user based on mobile communication. The existing GIS system provides comprehensive and simple information but GIS System for personalized service must provide the adjustive information through the personal interest profile based on POI(PoInt of Interest). This paper describes the intelligent retrieval geographical information service module for providing personal oriented geographic information service. Our proposal model consists of user preference profile, acquisition of POI through hybrid network (Wireless LAN, CDMA), service platform and implementation of prototype system. Implementation model can apply to the life information service like restaurant, oil station, convenient store and etc.

A Study on the Curation Factors through Reverse Engineering Design of YouTube Algorithm - Focusing on Gender Keyword Search (유튜브 알고리즘의 역공학설계를 통한 큐레이션 요인 연구 - 성별 키워드 검색을 중심으로)

  • Bae, Seung-Ju;Lee, Sang-Ho
    • Journal of the Korea Convergence Society
    • /
    • v.13 no.3
    • /
    • pp.133-146
    • /
    • 2022
  • Despite the fact that Internet users around the world watch YouTube every day, very few users accurately recognize the recommendation algorithm for search results, and Google and YouTube are not disclosing it. Researchers tried to explore the undisclosed algorithm of YouTube in a reverse engineering design method, find key factors, and check the logical structure in which media platform operators recommend keyword search results and arrange them on the screen. Therefore, researchers studied the basic content priority factors through several months of discussion and data collection, and tried to reverse engineer the influencing factors based on the recommendation results according to male and female gender among the collected keyword search results. Although researchers' design only analyzed some of the almost infinite level of data uploaded and viewed for more than hundreds of hours every hour, these exploratory attempts will study media platform algorithms in the future, understand the intentions of operators, and protect users. thought it could be done.

An Empirical Study on Statistical Optimization Model for the Portfolio Construction of Sponsored Search Advertising(SSA) (키워드검색광고 포트폴리오 구성을 위한 통계적 최적화 모델에 대한 실증분석)

  • Yang, Hognkyu;Hong, Juneseok;Kim, Wooju
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.2
    • /
    • pp.167-194
    • /
    • 2019
  • This research starts from the four basic concepts of incentive incompatibility, limited information, myopia and decision variable which are confronted when making decisions in keyword bidding. In order to make these concept concrete, four framework approaches are designed as follows; Strategic approach for the incentive incompatibility, Statistical approach for the limited information, Alternative optimization for myopia, and New model approach for decision variable. The purpose of this research is to propose the statistical optimization model in constructing the portfolio of Sponsored Search Advertising (SSA) in the Sponsor's perspective through empirical tests which can be used in portfolio decision making. Previous research up to date formulates the CTR estimation model using CPC, Rank, Impression, CVR, etc., individually or collectively as the independent variables. However, many of the variables are not controllable in keyword bidding. Only CPC and Rank can be used as decision variables in the bidding system. Classical SSA model is designed on the basic assumption that the CPC is the decision variable and CTR is the response variable. However, this classical model has so many huddles in the estimation of CTR. The main problem is the uncertainty between CPC and Rank. In keyword bid, CPC is continuously fluctuating even at the same Rank. This uncertainty usually raises questions about the credibility of CTR, along with the practical management problems. Sponsors make decisions in keyword bids under the limited information, and the strategic portfolio approach based on statistical models is necessary. In order to solve the problem in Classical SSA model, the New SSA model frame is designed on the basic assumption that Rank is the decision variable. Rank is proposed as the best decision variable in predicting the CTR in many papers. Further, most of the search engine platforms provide the options and algorithms to make it possible to bid with Rank. Sponsors can participate in the keyword bidding with Rank. Therefore, this paper tries to test the validity of this new SSA model and the applicability to construct the optimal portfolio in keyword bidding. Research process is as follows; In order to perform the optimization analysis in constructing the keyword portfolio under the New SSA model, this study proposes the criteria for categorizing the keywords, selects the representing keywords for each category, shows the non-linearity relationship, screens the scenarios for CTR and CPC estimation, selects the best fit model through Goodness-of-Fit (GOF) test, formulates the optimization models, confirms the Spillover effects, and suggests the modified optimization model reflecting Spillover and some strategic recommendations. Tests of Optimization models using these CTR/CPC estimation models are empirically performed with the objective functions of (1) maximizing CTR (CTR optimization model) and of (2) maximizing expected profit reflecting CVR (namely, CVR optimization model). Both of the CTR and CVR optimization test result show that the suggested SSA model confirms the significant improvements and this model is valid in constructing the keyword portfolio using the CTR/CPC estimation models suggested in this study. However, one critical problem is found in the CVR optimization model. Important keywords are excluded from the keyword portfolio due to the myopia of the immediate low profit at present. In order to solve this problem, Markov Chain analysis is carried out and the concept of Core Transit Keyword (CTK) and Expected Opportunity Profit (EOP) are introduced. The Revised CVR Optimization model is proposed and is tested and shows validity in constructing the portfolio. Strategic guidelines and insights are as follows; Brand keywords are usually dominant in almost every aspects of CTR, CVR, the expected profit, etc. Now, it is found that the Generic keywords are the CTK and have the spillover potentials which might increase consumers awareness and lead them to Brand keyword. That's why the Generic keyword should be focused in the keyword bidding. The contribution of the thesis is to propose the novel SSA model based on Rank as decision variable, to propose to manage the keyword portfolio by categories according to the characteristics of keywords, to propose the statistical modelling and managing based on the Rank in constructing the keyword portfolio, and to perform empirical tests and propose a new strategic guidelines to focus on the CTK and to propose the modified CVR optimization objective function reflecting the spillover effect in stead of the previous expected profit models.

An Adaptive Priority-based Sequenced Route Query Processing Method in Road Networks (도로 네트워크 환경에서 적응적 우선순위 기반의 순차적 경로 처리 기법)

  • Ryu, Hyeongcheol;Jung, Sungwon
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.12
    • /
    • pp.652-657
    • /
    • 2014
  • Given a starting point, destination point and various Points Of Interest (POIs), which contain a full or partial order, for a user to visit we wish to create, a sequenced route from the starting point to the destination point that includes one member of each POI type in a particular order. This paper proposes a method for finding the approximate shortest route between the start point, destination point and one member of each POI type. There are currently two algorithms that perform this task but they both have weaknesses. One of the algorithms only considers the distance between the visited POI (or starting point) and POI to visit next. The other algorithm chooses candidate points near the straight-line distance between the start point and destination but does not consider the order of visits on the corresponding network path. This paper outlines an algorithm that chooses the candidate points that are nearer to the network path between the start point and destination using network search. The algorithm looks for routes using the candidate points and finds the approximate shortest route by assigning an adaptive priority to the route that visits more POIs in a short amount of time.

Ontology-based User Customized Search Service Considering User Intention (온톨로지 기반의 사용자 의도를 고려한 맞춤형 검색 서비스)

  • Kim, Sukyoung;Kim, Gunwoo
    • Journal of Intelligence and Information Systems
    • /
    • v.18 no.4
    • /
    • pp.129-143
    • /
    • 2012
  • Recently, the rapid progress of a number of standardized web technologies and the proliferation of web users in the world bring an explosive increase of producing and consuming information documents on the web. In addition, most companies have produced, shared, and managed a huge number of information documents that are needed to perform their businesses. They also have discretionally raked, stored and managed a number of web documents published on the web for their business. Along with this increase of information documents that should be managed in the companies, the need of a solution to locate information documents more accurately among a huge number of information sources have increased. In order to satisfy the need of accurate search, the market size of search engine solution market is becoming increasingly expended. The most important functionality among much functionality provided by search engine is to locate accurate information documents from a huge information sources. The major metric to evaluate the accuracy of search engine is relevance that consists of two measures, precision and recall. Precision is thought of as a measure of exactness, that is, what percentage of information considered as true answer are actually such, whereas recall is a measure of completeness, that is, what percentage of true answer are retrieved as such. These two measures can be used differently according to the applied domain. If we need to exhaustively search information such as patent documents and research papers, it is better to increase the recall. On the other hand, when the amount of information is small scale, it is better to increase precision. Most of existing web search engines typically uses a keyword search method that returns web documents including keywords which correspond to search words entered by a user. This method has a virtue of locating all web documents quickly, even though many search words are inputted. However, this method has a fundamental imitation of not considering search intention of a user, thereby retrieving irrelevant results as well as relevant ones. Thus, it takes additional time and effort to set relevant ones out from all results returned by a search engine. That is, keyword search method can increase recall, while it is difficult to locate web documents which a user actually want to find because it does not provide a means of understanding the intention of a user and reflecting it to a progress of searching information. Thus, this research suggests a new method of combining ontology-based search solution with core search functionalities provided by existing search engine solutions. The method enables a search engine to provide optimal search results by inferenceing the search intention of a user. To that end, we build an ontology which contains concepts and relationships among them in a specific domain. The ontology is used to inference synonyms of a set of search keywords inputted by a user, thereby making the search intention of the user reflected into the progress of searching information more actively compared to existing search engines. Based on the proposed method we implement a prototype search system and test the system in the patent domain where we experiment on searching relevant documents associated with a patent. The experiment shows that our system increases the both recall and precision in accuracy and augments the search productivity by using improved user interface that enables a user to interact with our search system effectively. In the future research, we will study a means of validating the better performance of our prototype system by comparing other search engine solution and will extend the applied domain into other domains for searching information such as portal.