• Journal of Internet Computing and Services
• /
• v.2 no.2
• /
• pp.51-63
• /
• 2001

In this paper, we design and implement a XML document retrieval system to support structure-based retrieval using the BRS/Search system that is a commercial search engine, The implemented system in this paper represents the logical structure of XML documents as the directory structure of the Unix file system. In addition, we define the database schema of BRS/Search system to store documents, We also implement a ETID extractor, a structure information extractor, a storage manager and a query processor additionally to support content retrieval, structure retrieval, mixed retrieval and attribute retrieval in the BRS/Search system.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.2
• /
• pp.637-647
• /
• 2018

In this paper, we propose a method to search candidates of network reconfiguration to restore distribution system with distributed energy resources using a level-based tree search algorithm. First, we introduce a method of expressing distribution network with distributed energy resources for fault restoration, and to represent the distribution network into a simplified graph. Second, we explain the tree search algorithm, and introduce a method of performing the tree search on the basis of search levels, which we call a level-based tree search in this paper. Then, we propose a candidate search method for fault restoration, and explain it using an example. Finally, we verify the proposed method using computer simulations.

• The Journal of Korean Academic Society of Nursing Education
• /
• v.18 no.3
• /
• pp.393-402
• /
• 2012

Purpose: This study was conducted to test the effect of a Career Search Program on career search efficacy, career search behavior, and career decision making for nursing students. Methods: A non-equivalent pre-post test of a quasi-experimental design was used. Fifty first grade nursing students participated in the study with 22 in the experimental group and 28 in the control group. We used a Career Search Program which was held 6 times over 6 weeks, 90 minutes per session. Descriptive statistics, ${\chi}^2$-test, and independent t-test were used for statistical analysis with SPSS 19.0. Results: There were significant increases in career search efficacy (t=2.07, p=.044) and career search behavior(t=2.65, p=.011) in the experimental group compared to the control group. However, career decision making was not significantly changed (t=0.96, p=.342). Conclusion: These results suggest that a Career grade Search Program has an effect on increasing career search efficacy and career search behavior in first grade nursing students. In addition, more programs to impact career decision making should be developed for nursing college students.

• Journal of the Korean Home Economics Association
• /
• v.32 no.5
• /
• pp.67-82
• /
• 1994

The major purpose of this study was to find the influencing factors in explaining information search patterns and to find if significant differences exist in search outcomes by search patterns. The data for this study were collected in a survey conducted in March of 1993. The final sample consisted of 327 respondents purchased refrigerator 340 purchased bed. The important findings of this study are as follows: First The variables related to search cost-benefit play an important role in identifying search patterns of consumers. Second search outcomes were different among four information search patterns for each of information sources. The overall search outcomes the level of purchase knowledge and of post-purchase satisfaction was relatively high for high-search and high-reliance group compared with other groups. And the results also indicate that although some consumers search less than others they still can make good purchase decision-making and can maximize their utility if they choose useful information sources selectively and use those selected information sources effectively. The findings of this study provide some implications regarding consumer education programs the consumer information providing policies and future research methods.

• IE interfaces
• /
• v.19 no.3
• /
• pp.225-235
• /
• 2006

In this paper, we propose an intelligent e-commerce meta-search engine which integrates distributed e-commerce sites and provides a unified search to the sites. The meta-search engine performs the following functions: (1) the user is able to create a category-based user query, (2) by using the WordNet, the query is semantically refined for increasing search accuracy, and (3) the meta-search engine recommends an e-commerce site which has the closest product information to the user’s search intention by matching the user query with the product catalogs in the e-commerce sites linked to the meta-search engine. An experiment shows that the performance of our model is better than that of general keyword-based search.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.353-358
• /
• 2008

The ocean has settled down in human mind as a territory and a leisure space from which anyone enjoys and takes a benefit under the national sovereignty, as the new era of Sea comes. In addition, because the population engaged in marine activities has rapidly increased, the number of marine accidents consequently has grown up as well. In this reason, currently it has been highlighted to devise safety measures to prevent large scale accidents or disasters on the oceans. Therefore, this thesis firstly points out issues and problems of current search and rescue operations, and secondly studies three primary factors of the search and rescue operations, which are decision of search range, decision of search asset, and decision of search duration. Finally, the thesis suggests a theoretical foundation of the search and rescue operations by applying the result of studies and the marine search theory through a theoretical approach to reasonable standards.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.43-45
• /
• 2000

For motion estimation, the block matching algorithm is widely used to improve the compression ratio of low bit-rate motion video. As a newly developed fast search algorithm, the nearest-neighbors search technique has a drawback of degrading video quality while providing fisher speed in search process. In this paper, a modified nearest-neighbors search algorithm is proposed in which a double rectangular shaped search-candidate area is used to improve video quality in encoding process with a small increasing of search time. To evaluate the proposed algorithm. other methods based on the nearest-neighbors search algorithm are investigated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.5171-5189
• /
• 2016

With the popularity of cloud computing, many data owners outsource their graph data to the cloud for cost savings. The cloud server is not fully trusted and always wants to learn the owners' contents. To protect the information hiding, the graph data have to be encrypted before outsourcing to the cloud. The adjacent vertex search is a very common operation, many other operations can be built based on the adjacent vertex search. A boolean adjacent vertex search is an important basic operation, a query user can get the boolean search results. Due to the graph data being encrypted on the cloud server, a boolean adjacent vertex search is a quite difficult task. In this paper, we propose a solution to perform the boolean adjacent vertex search over encrypted graph data in cloud computing (BASG), which maintains the query tokens and search results privacy. We use the Gram-Schmidt algorithm and achieve the boolean expression search in our paper. We formally analyze the security of our scheme, and the query user can handily get the boolean search results by this scheme. The experiment results with a real graph data set demonstrate the efficiency of our scheme.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.13-16
• /
• 2004

This paper deals with a one-searcher multi-target search problem where targets with different detection priorities move in Markov processes in each discrete time over a given space search area, and the total number of search time intervals is fixed. A limited search resource is available in each search time interval and an exponential detection function is assumed. The searcher can obtain a target detection award, if detected, which represents the detection priority of target and is non-increasing with time. The objective is to establish the optimal search plan which allocates the search resource effort over the search areas in each time interval in order to maximize the total detection award. In the analysis, the given problem is decomposed into intervalwise individual search problems each being treated as a single stationary target problem for each time interval. An associated iterative procedure is derived to solve a sequence of stationary target problems. The computational results show that the proposed algorithm guarantees optimality.

• Journal of Digital Contents Society
• /
• v.19 no.2
• /
• pp.301-307
• /
• 2018

Generally, search engine summarizes the main contents of the search results so that user can click the site providing the information of the contents to search first. In this study, we demonstrated whether the user clicks on the search results based on the summary content provided by the search engine or on the order of the search result placement through empirical studies through the presentation of search results. By using the API provided by the search engine company, a search site that presents the search results in a regular and inverse order is created, and the click action of each user's search result is displayed in the order of actual click order, click position, and the user's search type such as the route of movement. As a result of the analysis, most users account for more than 60% of users who click on the first and second exposed search results regardless of the search results. It is confirmed that the search priority of users is determined according to the order of search results regardless of the summary of search results.