• Title/Summary/Keyword: Search theory

Search Result 569, Processing Time 0.031 seconds

A Research about The Effective Search Strategy Through Marine-time Search Theory Application (해상 탐지이론 적용을 통한 효과적 탐색 전략에 관한 연구)

  • Jeong, Ha-Ryong
    • 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.

  • PDF

Entrepreneurial·Job Search Education's Effects on the Antecedents of University Students' Entrepreneurial·Job Search Intention (창업·취업교육이 대학생의 창업·취업의도 영향요인에 미치는 효과)

  • Kim, Sungwoo;Kang, Minhyung
    • Journal of Engineering Education Research
    • /
    • v.19 no.4
    • /
    • pp.47-59
    • /
    • 2016
  • This paper explores antecedents of entrepreneurial and job search intentions based on the theory of planned behavior. Additionally, it examines the impact of entrepreneurship and job search education on these antecedents of entrepreneurial and job search intentions. The research model has been validated by analyzing 1,432 responses from undergraduate students in South Korea. The results of analysis provide several findings: First, entrepreneurship attitude, entrepreneurship subjective norm, and entrepreneurship self efficacy showed significant positive effects on entrepreneurial intention, but their effects on job search intention were insignificant. Second, while job search attitude showed significant positive effects on both intentions, job search subjective norm showed a significant effect only on job search intention, and job search self efficacy showed a significant effect only on entrepreneurial intention. Third, entrepreneurship education increased all the antecedents of entrepreneurial intention, and reduced job search attitude. These results imply that entrepreneurship and job search education should be managed comprehensively, considering their cross-effects on the antecedents of entrepreneurial and job search intentions.

A Study of Student Search Behavior in an Academic Library: Using Theory of Planned Behavior (대학생의 대학도서관 학술정보 탐색행동 연구 - 계획된 행동이론을 기반으로 -)

  • Kwak, Chul-Wan
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.51 no.2
    • /
    • pp.157-178
    • /
    • 2017
  • The objective of this study is to investigate college student search behavior in an academic library. The theory of planned behavior was applied for identifying relationship among variables on search behavior. Data were collected in an university. For data analysis, ANOVA, factor analysis, regression analysis, cluster analysis were used. The result shows: the theory of planned behavior can be used for finding search intention in an academic library. Student major and library use frequency are different statistically in attitudes, perceived behavioral control, behavioral intention. Student characteristics are divided into four types: conservative, independent, friendship, fashion. Friendship type of students influences search behavior. From cluster analysis, the cluster included friendship and independent types of students and students who have high frequency of library use has more active intention for search in academic library.

A Study of Decision-Making Support Plan of SAR Through Maritime Search Theory Application (탐지이론 적용을 통한 해상탐색 및 구조작전 의사결정 지원방안)

  • Jung, Ha-Loung;Lee, Jae-Yeong
    • Journal of the military operations research society of Korea
    • /
    • v.34 no.3
    • /
    • pp.67-77
    • /
    • 2008
  • In the 21st century, it is highly required to develop a better security management system to prevent many severe accidents occurred in the sea because it has been growing both size and importance for industries and global business which are heavily related to the sea. In this paper, we proposed a new theoretical criteria for three core decisions to make for SAR(search and rescue). These are three decisions for search scope, search assets, and search duration. We first brought up several issues and problems of current SAR system, and then studies all related factors of these three decisions for SAR operations. This paper provides a theoretical foundation of SAR operations by applying a theoretical approach and reasonable standards.

A Study on the Target Search Logic in the ASW Decision Support System (대잠전 의사결정지원 시스템에서 표적 탐색 논리 연구)

  • Cho, Sung-Jin;Choi, Bong-Wan;Jeon, Jae-Hyo
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.5
    • /
    • pp.824-830
    • /
    • 2010
  • It is not easy job to find a underwater target using sonar system in the ASW operations. Many researchers have tried to solve anti-submarine search problem aiming to maximize the probability of detection under limited searching conditions. The classical 'Search Theory' deals with search allocation problem and search path problem. In both problems, the main issue is to prioritize the searching cells in a searching area. The number of possible searching path that is combination of the consecutive searching cells increases rapidly by exponential function in the case that the number of searching cells or searchers increases. The more searching path we consider, the longer time we calculate. In this study, an effective algorithm that can maximize the probability of detection in shorter computation time is presented. We show the presented algorithm is quicker method than previous algorithms to solve search problem through the comparison of the CPU computation time.

Effective Web Crawling Orderings from Graph Search Techniques (그래프 탐색 기법을 이용한 효율적인 웹 크롤링 방법들)

  • Kim, Jin-Il;Kwon, Yoo-Jin;Kim, Jin-Wook;Kim, Sung-Ryul;Park, Kun-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.1
    • /
    • pp.27-34
    • /
    • 2010
  • Web crawlers are fundamental programs which iteratively download web pages by following links of web pages starting from a small set of initial URLs. Previously several web crawling orderings have been proposed to crawl popular web pages in preference to other pages, but some graph search techniques whose characteristics and efficient implementations had been studied in graph theory community have not been applied yet for web crawling orderings. In this paper we consider various graph search techniques including lexicographic breadth-first search, lexicographic depth-first search and maximum cardinality search as well as well-known breadth-first search and depth-first search, and then choose effective web crawling orderings which have linear time complexity and crawl popular pages early. Especially, for maximum cardinality search and lexicographic breadth-first search whose implementations are non-trivial, we propose linear-time web crawling orderings by applying the partition refinement method. Experimental results show that maximum cardinality search has desirable properties in both time complexity and the quality of crawled pages.

Applying Hebbian Theory to Enhance Search Performance in Unstructured Social-Like Peer-to-Peer Networks

  • Huang, Chester S.J.;Yang, Stephen J.H.;Su, Addison Y.S.
    • ETRI Journal
    • /
    • v.34 no.4
    • /
    • pp.591-601
    • /
    • 2012
  • Unstructured peer-to-peer (p2p) networks usually employ flooding search algorithms to locate resources. However, these algorithms often require a large storage overhead or generate massive network traffic. To address this issue, previous researchers explored the possibility of building efficient p2p networks by clustering peers into communities based on their social relationships, creating social-like p2p networks. This study proposes a social relationship p2p network that uses a measure based on Hebbian theory to create a social relation weight. The contribution of the study is twofold. First, using the social relation weight, the query peer stores and searches for the appropriate response peers in social-like p2p networks. Second, this study designs a novel knowledge index mechanism that dynamically adapts social relationship p2p networks. The results show that the proposed social relationship p2p network improves search performance significantly, compared with existing approaches.

A Daily Scheduling of Generator Maintenance using Fuzzy Set Theory combined with Genetic Algorithm (퍼지 집합이론과 유전알고리즘을 이용한 일간 발전기 보수유지계획의 수립)

  • Oh, Tae-Gon;Choi, Jae-Seok;Baek, Ung-Ki
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.7
    • /
    • pp.1314-1323
    • /
    • 2011
  • The maintenance of generating units is implicitly related with power system reliability and has a tremendous bearing on the operation of the power system. A technique using a fuzzy search method which is based on fuzzy multi-criteria function has been proposed for GMS (generator maintenance scheduling) in order to consider multi-objective function. In this study, a new technique using combined fuzzy set theory and genetic algorithm(GA) is proposed for generator maintenance scheduling. The genetic algorithm(GA) is expected to make up for that fuzzy search method might search the local solution. The effectiveness of the proposed approach is demonstrated by the simulation results on a practical size test systems.

Augmenting Quasi-Tree Search Algorithm for Maximum Homogenous Information Flow with Single Source/Multiple Sinks

  • Fujita, Koichi;Watanabe, Hitoshi
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.462-465
    • /
    • 2002
  • This paper presents a basic theory of information flow from single sending point to multiple receiving points, where new theories of algebraic system called "Hybrid Vector Space" and flow vector space play important roles. Based on the theory, a new algorithm for finding maximum homogenous information flow is proposed, where homogenous information flow means the flow of the same contents of information delivered to multiple clients at a time. Effective multi-routing algorithms fur tree-shape delivery rout search are presented.

  • PDF

A MARKOV DECISION PROCESSES FORMULATION FOR THE LINEAR SEARCH PROBLEM

  • Balkhi, Z.T.;Benkherouf, L.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.1
    • /
    • pp.201-206
    • /
    • 1994
  • The linear search problem is concerned with finding a hiden target on the real line R. The position of the target governed by some probability distribution. It is desired to find the target in the least expected search time. This problem has been formulated as an optimization problem by a number of authors without making use of Markov Decision Process (MDP) theory. It is the aim of the paper to give a (MDP) formulation to the search problem which we feel is both natural and easy to follow.

  • PDF