• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5671-5693
• /
• 2017

With the rapid development of cloud computing, more and more data owners are motivated to outsource their data to cloud for various benefits. Due to serious privacy concerns, sensitive data should be encrypted before being outsourced to the cloud. However, this results that effective data utilization becomes a very challenging task, such as keyword search over ciphertexts. Although many searchable encryption methods have been proposed, they only support exact keyword search. Thus, misspelled keywords in the query will result in wrong or no matching. Very recently, a few methods extends the search capability to fuzzy keyword search. Some of them may result in inaccurate search results. The other methods need very large indexes which inevitably lead to low search efficiency. Additionally, the above fuzzy keyword search methods do not support access control. In our paper, we propose a searchable encryption method which achieves fuzzy search and access control through algorithm design and Ciphertext-Policy Attribute-based Encryption (CP-ABE). In our method, the index is small and the search results are accurate. We present word pattern which can be used to balance the search efficiency and privacy. Finally, we conduct extensive experiments and analyze the security of the proposed method.

• Journal of the Korean Home Economics Association
• /
• v.36 no.5
• /
• pp.29-46
• /
• 1998

This study investigates how the consumers utilize the elements of information search and how consumers are satisfied with them. For this study, drives who have bought their own cars in two years were chosen for subjects of investigation. And samples were interviewed with an organized questionaire from July 8 to July 27, 1996. 300 samples were used for the final analysis. The major results from this study are as follows. 1) In general information search, consumers get a great deal of information from a talk their friends, neighbors, or colleagues, and they obtain information from an experienced person or a professional. In using sources of information search, they made the best use of their experiences, which is the sources of internal information, and for the second, they used advertising and the explanation of a salesman. In using the contents of information search, they made the best use of information about the merits and demerits in each attribute. In using the method of information search, the mixed search 1 method was used the most, and the attribute search method was used. 2) The casual relationship between the general satisfaction for the products and the relative variable was investigated. An age, the time pressure, the information of the products had a direct and indirect influence on the general for the products. The perceived risk, the number of inquiring activity, a shop and the buying method had a direct influence on the general for the products. An indirect influence was showed in the general satisfaction for the products through the medium of inquiring activity, a shop, and buying method.

• Journal of the Korean Institute of Oriental Medical Informatics
• /
• v.15 no.1
• /
• pp.1-10
• /
• 2009

In these days everyone search the information easily with the Internet as the rapid distribution and active usage of the Internet. The search engines were developed specially to accuracy of information retrieval. User search the information more quickly and variously with them. The search portal system will be embossed with representation and basic services. The Internet user needs the result of text, image and video, knowledge search. The keyword based search is used generally for getting result of the information retrieval and another method is category based search. This paper investigates the classification of knowledge search structure for oriental medicine in market leader of search portal system by ranking web site. As a result, each classification system is unified and there is a possibility of getting up a many confusion to the user who approaches with classification systematic search method. This treatise proposed the improved oriental medicine classification system of internet information retrieval in knowledge search area. if the service provider amends about the classification system, there will be able to guarantee the compatibility of data. Also the proper access path of the knowledge which seeks is secured to user.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.47-49
• /
• 2000

In this paper we propose the multiple local search method(MLSM) based on the motion information of the neighbor blocks. In the proposed method motions are estimated from the multiple searches of many candidate local search regions. To reduce the additional search points we avoid to search the same candidate regions previously visited using the distance from the initial search point to the recently found vector points. In the simulation the proposed method shows more excellent results than that of other gradient based method especially in the search of motion boundary.

• International Journal of Knowledge Content Development & Technology
• /
• v.2 no.2
• /
• pp.17-29
• /
• 2012

All academic information on the web or elsewhere has its creator, that is, a subject who has created the information. The subject can be an individual, a group, or an institution, and can be a nation depending on the nature of the relevant information. Most information is composed of a title, an author, and contents. An essay which is under the academic information category has metadata including a title, an author, keyword, abstract, data about publication, place of publication, ISSN, and the like. A patent has metadata including the title, an applicant, an inventor, an attorney, IPC, number of application, and claims of the invention. Most web-based academic information services enable users to search the information by processing the meta-information. An important element is to search information by using the author field which corresponds to a personal name. This study suggests a method of efficient indexing and using the adjacent operation result ranking algorithm to which phrase search-based boosting elements are applied, and thus improving the accuracy of the search results of personal names. It also describes a method for providing the results of searching co-authors and related researchers in searching personal names. This method can be effectively applied to providing accurate and additional search results in the academic information services.

• Korean journal of food and cookery science
• /
• v.22 no.2 s.92
• /
• pp.213-221
• /
• 2006

Although motivation and information search have both been studied continuously and separately as important marketing strategies, the relation between cause and effect has received little research attention. Therefore the objective of this study was to research the causal relationships between motivation and information search method. Frequency analysis and reliability analysis, factor analysis, and SEM(Structure Equation Model) were adopted to analyze the data. Motivation was divided into 5 factors which significantly influenced information search method. Factor 1, 'Reception and congratulation', influenced information search positively through 'newspaper, magazine', and 'word of mouth' but negatively through 'TV-advertising' and 'Flyer, Press copy'. Factor 2, 'Change of dietary life', influenced positively 'TV-advertising'. Factor 3, 'Economic saving', influenced positively 'newspaper, magazine', and 'the e-mail's advertising' Factor 4, 'Preference motivation', influenced negatively 'word of mouth' Factor 5, 'Advertisement and companion's need', influenced positively 'newspaper, magazine', and 'the e-mail's advertising' but negatively 'TV-advertising' As a result, customers appeared to choose various information search methods according to their eating-out motivation. 'The e-mail's advertising', and 'word of mouth' are popular among customers' information search methods. Therefore, food-service corporations need to try eliminating negative images of various advertisements and activate positive word of mouth marketing, promotion through internet.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.239-254
• /
• 2006

An efficient descent method for unconstrained optimization problems is line search method in which the step size is required to choose at each iteration after a descent direction is determined. There are many ways to choose the step sizes, such as the exact line search, Armijo line search, Goldstein line search, and Wolfe line search, etc. In this paper we propose a new inexact line search for a general descent method and establish some global convergence properties. This new line search has many advantages comparing with other similar inexact line searches. Moreover, we analyze the global convergence and local convergence rate of some special descent methods with the new line search. Preliminary numerical results show that the new line search is available and efficient in practical computation.

• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2002.05a
• /
• pp.225-231
• /
• 2002

A specialized web search engine is an internet tool for detecting information in finite cyber world. It helps to retrieve necessary information in internet sites quickly In this paper, we design and implement a prototype search engine using method of mining for the association rule discovery. It consists of a search engine part and a search robot part. The search engine uses keyword method and is considered as various user oriented interface. The search robot fetches information related to ship parts n world wide web. The experiments show that our search engine(AISE) is superior to other search engines in collecting necessary informations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.634-640
• /
• 2013

Existing patterns and database search, string search unit search results for a lot of false positives, a simple search technique unreliable. In addition, the same conditions in addition to other search methods implemented due to wasted of resources and enforcement have been causing a waste of time. Therefore, regular expression and correlation analysis method by applying an integrated linkage information search module is to develop in this paper. From this, existing string search technique that has been noted as a problem by reducing the economic impact false positive and reliability to develop method that will information search secure.

• 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.