Log in

Relevant bibliographies by topics / Hierarchical search / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Hierarchical search.

Dissertations / Theses on the topic 'Hierarchical search'

Author: Grafiati

Published: 23 June 2021

Last updated: 4 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 49 dissertations / theses for your research on the topic 'Hierarchical search.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Xu, Xin. "Interactive hierarchical generate and test search." Thesis, University of Ottawa (Canada), 1991. http://hdl.handle.net/10393/7934.

Full text

Abstract:

Most of the search methods used in AI are inflexible. Interactive search is a new kind of search in which the search system can communicate and cooperate with external agents. There are two kinds of agents: human agents and non-human agents. Through interaction with human agents (man-machine interaction), the search system can make use of the human talent of judging the quality of a solution. Through interaction with non-human agents (machine-machine interaction), the search system can automatically exploit knowledge from its environment. An interactive search system has the ability to take ad

APA, Harvard, Vancouver, ISO, and other styles

2

Shenoy, U. Nagaraj. "Automatic Data Partitioning By Hierarchical Genetic Search." Thesis, Indian Institute of Science, 1996. http://hdl.handle.net/2005/172.

Full text

Abstract:

CDAC<br>The introduction of languages like High Performance Fortran (HPF) which allow the programmer to indicate how the arrays used in the program have to be distributed across the local memories of a multi-computer has not completely unburdened the parallel programmer from the intricacies of these architectures. In order to tap the full potential of these architectures, the compiler has to perform this crucial task of data partitioning automatically. This would not only unburden the programmer but would make the programs more efficient since the compiler can be made more intelligent to take

APA, Harvard, Vancouver, ISO, and other styles

3

Normore, Lorraine Dombrowski. "Strategies in searching hierarchical data structures /." The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487265143147771.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Manabe, Tomohiro. "Web Search Based on Hierarchical Heading-Block Structure Analysis." 京都大学 (Kyoto University), 2016. http://hdl.handle.net/2433/215681.

Full text

Abstract:

The contents of Section 2.2 and Chapter 4 first appeared in proceedings of the 12th International Conference on Web Information Systems and Technologies, 2016 (www.webist.org). The contents of Section 2.3 and Chapter 5 first appeared in DBSJ Journal, vol. 14, article no. 2, March 2016. The contents of Section 2.5 and Chapter 7 first appeared in proceedings of the 11th Asia Information Retrieval Societies Conference, Lecture Notes in Computer Science, vol. 9460, pp. 188-200, 2015 (The final publication is available at link.springer.com).<br>Kyoto University (京都大学)<br>0048<br>新制・課程博士<br>博士(情報学)<

APA, Harvard, Vancouver, ISO, and other styles

5

Dickinson, Anthony R. "Hierarchical organisation in serial search tasks by Cebus apella monkeys." Thesis, University of Edinburgh, 1998. http://hdl.handle.net/1842/21198.

Full text

Abstract:

The thesis reports the first demonstration of two-level hierarchical and linear organisation in six monkeys (Cebus apella). In behaviours elaborated over a four-year period, the hypothesis tested (McGonigle and Chalmers, 1992) was that progressive increases in task difficulty would be compensated by data reducing, economic, organisational structures. Novel touch-screen based procedures required the seriation and search of each item in a test set which, when increased in size, lead to geometrical increases in difficulty. Whilst on one scenario the subject should begin to fail as the task increa

APA, Harvard, Vancouver, ISO, and other styles

6

Roshani, Asra. "Unsupervised segmentation of sequences using harmony search and hierarchical clustering techniques." Master's thesis, Université Laval, 2014. http://hdl.handle.net/20.500.11794/25350.

Full text

Abstract:

Dans le contexte de traitement automatique du langage naturel, les données le plus souvent sont présentées comme une longue séquence de caractères discrets. Donc, l'identification d'un modèle intéressant dans la longue séquence peut être une tâche difficile. En conséquence, la segmentation automatique de données serait extrêmement utile pour extraire les sous-séquences et les morceaux significatifs à partir d'une longue séquence de données. La segmentation de données est l'une des étapes de prétraitement les plus importantes dans plusieurs tâches de traitement du langage naturel. La segmentati

APA, Harvard, Vancouver, ISO, and other styles

7

Anguelov, Bobby. "Video game pathfinding and improvements to discrete search on grid-based maps." Diss., University of Pretoria, 2011. http://hdl.handle.net/2263/22940.

Full text

Abstract:

The most basic requirement for any computer controlled game agent in a video game is to be able to successfully navigate the game environment. Pathfinding is an essential component of any agent navigation system. Pathfinding is, at the simplest level, a search technique for finding a route between two points in an environment. The real-time multi-agent nature of video games places extremely tight constraints on the pathfinding problem. This study aims to provide the first complete review of the current state of video game pathfinding both in regards to the graph search algorithms employed as w

APA, Harvard, Vancouver, ISO, and other styles

8

Zheng, Li. "Towards Next Generation Vertical Search Engines." FIU Digital Commons, 2014. http://digitalcommons.fiu.edu/etd/1517.

Full text

Abstract:

As the Web evolves unexpectedly fast, information grows explosively. Useful resources become more and more difficult to find because of their dynamic and unstructured characteristics. A vertical search engine is designed and implemented towards a specific domain. Instead of processing the giant volume of miscellaneous information distributed in the Web, a vertical search engine targets at identifying relevant information in specific domains or topics and eventually provides users with up-to-date information, highly focused insights and actionable knowledge representation. As the mobile device

APA, Harvard, Vancouver, ISO, and other styles

9

Fang, Qijun. "Model search strategy when P >> N in Bayesian hierarchical setting." View electronic thesis (PDF), 2009. http://dl.uncw.edu/etd/2009-2/fangq/qijunfang.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Salomatin, Konstantin. "Large-scale hierarchical optimization for online advertising and wind farm planning." Research Showcase @ CMU, 2013. http://repository.cmu.edu/dissertations/337.

Full text

Abstract:

This thesis develops a framework to investigate and design novel optimization methods for two important problems: computational advertising (particularly, sponsored search) and wind farm turbine-layout planning. Whereas very different in specifics, both problems share some common abstractions. The existing solution in sponsored search is based on a greedy pay-per-click auction and is suitable only for advertisers seeking a direct response. It does not apply to advertisers who target certain numbers of clicks in a predefined time period. To address this new challenge, we introduce a unified opt

APA, Harvard, Vancouver, ISO, and other styles

11

Douglas-Brown, Denise. "In search of syntactic symmetry : on the parallels between clausal and nominal hierarchical structure." Thesis, Durham University, 1996. http://etheses.dur.ac.uk/1461/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Zhu, Dengya. "Improving the relevance of search results via search-term disambiguation and ontological filtering." Curtin University of Technology, School of Information Systems, 2007. http://espace.library.curtin.edu.au:80/R/?func=dbin-jump-full&object_id=9348.

Full text

Abstract:

With the exponential growth of the Web and the inherent polysemy and synonymy problems of the natural languages, search engines are facing many challenges such as information overload, mismatch of search results, missing relevant documents, poorly organized search results, and mismatch of human mental model of clustering engines. To address these issues, much effort including employing different information retrieval (IR) models, information categorization/clustering, personalization, semantic Web, ontology-based IR, and so on, has been devoted to improve the relevance of search results. The m

APA, Harvard, Vancouver, ISO, and other styles

13

Mayorova, Olga Vladislavovna. "Social Capital and Institutional Transition: Regional Context for Network Use in Job Search in Russia, 1985-2001." Diss., The University of Arizona, 2008. http://hdl.handle.net/10150/193995.

Full text

Abstract:

Current research on network use in the labor market focuses primarily on network morphology. In this dissertation, I use hierarchical regression to examine the influence of macro-level context on network use in job search.This study relies on a unique data set that combines individual job history data for years 1985 through 2001 collected by the Survey of Social Dynamics and Migration in Russia (SSMDR) in 40 regions in 2001-2002 and corresponding regional macro-economic data published by Goskomstat, the State Statistical Committee of the Russian Federation.The first question of this study focu

APA, Harvard, Vancouver, ISO, and other styles

14

Cowlagi, Raghvendra V. "Hierarchical motion planning for autonomous aerial and terrestrial vehicles." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/41066.

Full text

Abstract:

Autonomous mobile robots - both aerial and terrestrial vehicles - have gained immense importance due to the broad spectrum of their potential military and civilian applications. One of the indispensable requirements for the autonomy of a mobile vehicle is the vehicle's capability of planning and executing its motion, that is, finding appropriate control inputs for the vehicle such that the resulting vehicle motion satisfies the requirements of the vehicular task. The motion planning and control problem is inherently complex because it involves two disparate sub-problems: (1) satisfaction of th

APA, Harvard, Vancouver, ISO, and other styles

15

Watchravesringkan, Kittichai. "A hierarchical model of values, price perception, ongoing search and shopping behaviors: A cross-cultural comparison." Diss., The University of Arizona, 2005. http://hdl.handle.net/10150/280776.

Full text

Abstract:

A considerable degree of cross-cultural research has recognized the impact of cultural values of individualism and collectivism on individuals' consumption behavior. Recently, the impact of international market expansion and modernization may have helped transform values of materialism among Asians. It is evident that values have a hierarchical influence on consumption behavior through higher-order cognition (e.g., perceptions and attitudes). In this study, we argue that materialism, individualism, and collectivism have an impact on consumers' ongoing search and shopping behaviors through cons

APA, Harvard, Vancouver, ISO, and other styles

16

Elkawkagy, Mohamed Mohamed Nabil Mohamed Shams Eldeen [Verfasser]. "Hierarchical landmarks - a means to reduce search effort in hybrid planning / Mohamed Mohamed Nabil Mohamed Shams Eldeen Elkawkagy." Ulm : Universität Ulm. Fakultät für Ingenieurwissenschaften und Informatik, 2011. http://d-nb.info/1016716524/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Bolin, Jakob, and Nico Palmroos. "Monte-Carlo Tree Search Used for Fortification in the Game of Risk." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-297698.

Full text

Abstract:

The strategy game Risk is a very popular boardgame, requiring little effort to learn but lots of skill to master.The aim of this project is to explore the fortification phase of thegame, where the player’s troops are moved between territories.Our method is based on adapting Monte Carlo tree search(MCTS) to Risk. To improve the troop movements, we proposetwo techniques, hierarchical search and progressive bias. Thesemethods, combined with other extensions of MCTS are thencompared against a baseline player of the game. Our results showthat hierarchical search improved the MCTS agent’s playingpow

APA, Harvard, Vancouver, ISO, and other styles

18

CASTRO, RENER PEREIRA DE. "STATISTICAL OPTIMIZATION OF SPATIAL HIERARCHICAL STRUCTURES SEARCHS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2008. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=11695@1.

Full text

Abstract:

COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Este trabalho surgiu da seguinte observação: os clássicos algoritmos de busca em 2d-tree começam da raiz para acessar dados armazenados nas folhas. Entretanto, como as folhas são os nós mais distantes da raiz, por que começar as buscas pela raiz? Com representações clássicas de 2d-trees, não existe outra forma de acessar uma folha. Existem 2d- trees, porém, que permitem acessar em tempo constante qualquer nó, dado sua posição e seu nível. Para o algoritmo de busca, a posição é conhecida, mas o nível não. Para estimar o nível

APA, Harvard, Vancouver, ISO, and other styles

19

Hinz, Joel. "Clustering the Web : Comparing Clustering Methods in Swedish." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-95228.

Full text

Abstract:

Clustering -- automatically sorting -- web search results has been the focus of much attention but is by no means a solved problem, and there is little previous work in Swedish. This thesis studies the performance of three clustering algorithms -- k-means, agglomerative hierarchical clustering, and bisecting k-means -- on a total of 32 corpora, as well as whether clustering web search previews, called snippets, instead of full texts can achieve reasonably decent results. Four internal evaluation metrics are used to assess the data. Results indicate that k-means performs worse than the other tw

APA, Harvard, Vancouver, ISO, and other styles

20

Kamenieva, Iryna. "Research Ontology Data Models for Data and Metadata Exchange Repository." Thesis, Växjö University, School of Mathematics and Systems Engineering, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-6351.

Full text

Abstract:

<p>For researches in the field of the data mining and machine learning the necessary condition is an availability of various input data set. Now researchers create the databases of such sets. Examples of the following systems are: The UCI Machine Learning Repository, Data Envelopment Analysis Dataset Repository, XMLData Repository, Frequent Itemset Mining Dataset Repository. Along with above specified statistical repositories, the whole pleiad from simple filestores to specialized repositories can be used by researchers during solution of applied tasks, researches of own algorithms and scienti

APA, Harvard, Vancouver, ISO, and other styles

21

ASNAGHI, COSTANZA. "Un'Analisi della Variazione Lessicale Regionale Nell’Inglese di California Attraverso le Ricerche in Rete Limitate per Sito." Doctoral thesis, Università Cattolica del Sacro Cuore, 2013. http://hdl.handle.net/10280/1811.

Full text

Abstract:

Lo studio esamina la variazione lessicale regionale in forma scritta nell’inglese standard in California. Attraverso ricerche in rete limitate a 336 siti di giornali online con sede in 270 città in California, vengono raccolti i valori di 45 variabili continue di alternanze lessicali e quindi calcolati come proporzioni. Tecniche statistiche di autocorrelazione spaziale globale e locale analizzano i valori. I risultati delle analisi, riportati in 90 mappe, confermano la distribuzione regionale delle variabili in California. Le 45 variabili lessicali sono poi esaminate con tecniche statistiche m

APA, Harvard, Vancouver, ISO, and other styles

22

"A probabilistic cooperative-competitive hierarchical search model." 1998. http://library.cuhk.edu.hk/record=b5889641.

Full text

Abstract:

by Wong Yin Bun, Terence.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 1998.<br>Includes bibliographical references (leaves 99-104).<br>Abstract also in Chinese.<br>List of Figures --- p.ix<br>List of Tables --- p.xi<br>Chapter I --- Preliminary --- p.1<br>Chapter 1 --- Introduction --- p.2<br>Chapter 1.1 --- Thesis themes --- p.4<br>Chapter 1.1.1 --- Dynamical view of landscape --- p.4<br>Chapter 1.1.2 --- Bottom-up self-feedback algorithm with memory --- p.4<br>Chapter 1.1.3 --- Cooperation and competition --- p.5<br>Chapter 1.1.4 --- Contributions to genetic algorithms ---

APA, Harvard, Vancouver, ISO, and other styles

23

Wu, Chia-lu, and 巫佳錄. "Construct Hierarchical User Search Goals by Using Search Result Snippets to Improve Web Search Performance." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/09524627498980122130.

Full text

Abstract:

碩士<br>國立成功大學<br>資訊工程學系碩博士班<br>96<br>The invention of the Internet brings much convenience for human community. There are more and more useful and divers data on the web. However the length of submitted queries by users are usually no more than 3 words, so that a lot of search result snippets returned by search engines cause users to spend much time in browsing them one by one. In fact, we consider that users will have potential search goals in their mind when they submit queries to search engines, and there are three classes of user search goals, including resource-seeking, informational, and

APA, Harvard, Vancouver, ISO, and other styles

24

Kelly, Stephen. "ON DEVELOPMENTAL VARIATION IN HIERARCHICAL SYMBIOTIC POLICY SEARCH." 2012. http://hdl.handle.net/10222/15376.

Full text

Abstract:

A hierarchical symbiotic framework for policy search with genetic programming (GP) is evaluated in two control-style temporal sequence learning domains. The symbiotic formulation assumes each policy takes the form of a cooperative team between multiple symbiont programs. An initial cycle of evolution establishes a diverse range of host behaviours with limited capability. The second cycle uses these initial policies as meta actions for reuse by symbiont programs. The relationship between development and ecology is explored by explicitly altering the interaction between learning agent and enviro

APA, Harvard, Vancouver, ISO, and other styles

25

Fan, Kai-Ting, and 范凱婷. "A Hierarchical-Search Block Matching Motion Estimation Processor." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/14184443855276779465.

Full text

Abstract:

碩士<br>國立交通大學<br>電子工程學系<br>85<br>In this thesis, a VLSI architecture for motion estimation baed on a hierarchical-search block matching algorithm (HSBMA) is developed. The proposed architecture can deal with the full- search block matching algorithm(FSBMA) as well. To meet the real-time requirement of MPEG-2 MP@ML, parallelprocessing is in great demand. Adopting semi-systolic array (SSA) architecture, 100% hardware efficiency can be achieved within processingelement (PE) array. This proposed

APA, Harvard, Vancouver, ISO, and other styles

26

Lin, Jia-Jeng, and 林家正. "Search Engine with Hierarchical Structures for Incomplete Queries." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/pyss2u.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>資訊工程系<br>94<br>In recent decades, Internet grows up quickly and provides very much information. It’s hard for us to find useful information because information is increasing rapidly. There are limited information on Internet before, so we can find information with few URL. However, the information that we can find are limited. Until now, the information on the Internet is so much that it is impossible to use few URL to present these information. Furthermore, users couldn’t remember too much URL. As a result, users need search engine. We can find the information we needed quic

APA, Harvard, Vancouver, ISO, and other styles

27

李忠耕. "Hierarchical Bitmap Search for Non-Fixed Transform-Based Vector Quantization." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/06669171169842531000.

Full text

Abstract:

碩士<br>國立成功大學<br>電機工程學系<br>85<br>In recent years, vector quantization (VQ) and transform coding have been treated as the most efficient techniques for image compression. The combinations of vector quantization and transformation techniques, including discrete cosine transform VQ, optimal vector transform VQ, and singular value decomposition VQ, achieve better image quality at the expense of computation complexity. In this thesis, we introduce a hierarchical bitmap search method to reduce their computation loads. All the transformations involved with the bitmaps, even for the multiplicationsk

APA, Harvard, Vancouver, ISO, and other styles

28

Yang, Wun-Chih, and 楊文馳. "A Hierarchical Content Search Engine Based on Unstructured P2P Topology." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/20282067281490922915.

Full text

Abstract:

碩士<br>國立中正大學<br>資訊管理所<br>96<br>Peer-to-Peer (P2P) networks are useful and have applied to many fields. In order to quickly retrieve resources on a P2P network, a hierarchical search engine based, on three proposals: NICE protocol, parallel crawler, and distributed PageRank, is proposed. In our method, tasks of document fetching and indexing are distributed to nodes, and these nodes are organized into a hierarchical architecture. Since documents and their indexes are stored locally among nodes, updates on these documents are relatively. In addition, executing queries using the hierarchy can imp

APA, Harvard, Vancouver, ISO, and other styles

29

Sun, Chjen-Cheng, and 孫建成. "A hierarchical clustering system to enhance personalized web-snippet search." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/k6m789.

Full text

Abstract:

碩士<br>國立中央大學<br>資訊管理研究所<br>94<br>This paper provides a hierarchical web-snippet clustering system with the personalized ability on search engines. According to the user’s query string, the system collects snippets and formulates the corresponding browsing hierarchy to describe contents of snippets. In the browsing hierarchy, every snippet is clustered into fit clusters and the concept of every cluster is described by its label. At the last phase, the system sorts all snippets and labels according to the user’s preferences in the user profile, and outputs the personalized browsing hierarchy. Th

APA, Harvard, Vancouver, ISO, and other styles

30

Swartz, Michael D. "Stochastic search gene suggestion: Hierarchical Bayesian model selection meets gene mapping." Thesis, 2004. http://hdl.handle.net/1911/18711.

Full text

Abstract:

This dissertation introduces a novel approach for addressing the complexities of mapping a complex disease by adjusting a Bayesian Model Selection method. Mapping the genes for a complex disease, such as Rheumatoid Arthritis, involves finding multiple genetic loci that may contribute to the onset of the disease. Pairwise testing of the loci leads to the problem of multiple testing. To avoid multiple tests, one can look at haplotypes, or linear sets of loci, but this results in a contingency table with sparse counts, especially when using marker loci with multiple alleles. In order to jointly c

APA, Harvard, Vancouver, ISO, and other styles

31

何俊岳. "= Hierarchical search and vector smooth in motion estimation for interframe coding." Thesis, 1992. http://ndltd.ncl.edu.tw/handle/63540525625861082919.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

黃淑華. "Designed hierarchical semantic categorizaiton for the knowledge management via search engine." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/45589468236681650182.

Full text

Abstract:

碩士<br>國立中正大學<br>電機工程研究所<br>92<br>With the huge amount of information available on the World Wide Web, Web servers provide a fertile ground for information searches. The Problem that knowledge workers face today is not lack of information any more. Instead, they are in the situation of information overload. People can not quickly and efficiently find out the wanted information among such huge data. Therefore a lots of information technology were still on developed. The traditionally search technology is by understanding the document experts assign specific categories to the document. However, i

APA, Harvard, Vancouver, ISO, and other styles

33

Liu, Ssu-Wei, and 劉思微. "Efficient Search Using Hierarchical Clustering in Mobile Peer-to-Peer Networks." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/95384620286018945621.

Full text

Abstract:

碩士<br>輔仁大學<br>資訊工程學系<br>95<br>With the quick advancement of both the ad hoc network technology and peer to peer technology, there have been are applications slowly emerging which try to combine those two aspects in the same existing network. It is important to find a suitable method for it. A distributed peer-to-peer network architecture without network client and server seems best suited for execution on a mobile ad hoc network. However, mobile peers suffer from some problems such as limited power capacity and dynamic topology change caused by the mobility of nodes. In this paper, we proposed

APA, Harvard, Vancouver, ISO, and other styles

34

Yang, Chao-Hsiang, and 楊朝翔. "A Fast Keyword Search Structured P2P Network with Hierarchical Resource Classification." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/3theu8.

Full text

Abstract:

碩士<br>朝陽科技大學<br>資訊工程系碩士班<br>93<br>Nowadays, people became more rely to internet due to the rapid growth of internet. Users need to access to specify servers to search for required services or documents before obtain the resources from the providing server. This method was the common centralized architecture in obtaining resources. However, there are several potential drawbacks of centralized architecture like expanding problems, extra costs, vulnerable to attack and reliability problems. Hence, the proposed of peer-to-peer computing was well discussed and pay attention by everyone. In peer-to-

APA, Harvard, Vancouver, ISO, and other styles

35

Liu, Kaihua. "Query on Knowledge Graphs with Hierarchical Relationships." 2017. https://scholarworks.umass.edu/masters_theses_2/560.

Full text

Abstract:

The dramatic popularity of graph database has resulted in a growing interest in graph queries. Two major topics are included in graph queries. One is based on structural relationship to find meaningful results, such as subgraph pattern match and shortest-path query. The other one focuses on semantic-based query to find question answering from knowledge bases. However, most of these queries take knowledge graphs as flat forms and use only normal relationship to mine these graphs, which may lead to mistakes in the query results. In this thesis, we find hierarchical relationship in the knowledge

APA, Harvard, Vancouver, ISO, and other styles

36

Hsiao, Hsin-Wei, and 蕭新維. "An Entropy-Based Hierarchical Search Result Clustering Method by Utilizing Augmented Information." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/22828825352958479082.

Full text

Abstract:

碩士<br>國立成功大學<br>資訊工程學系碩博士班<br>95<br>Because of the improvement of the technology of search engines, and the massively increase of the number of web pages, the results returned by the search engines are always mixed and disordered. Especially for the queries with multiple topics, the mixed and disorderly situation of the search results would be more obvious. The technology of clustering search results with different topics has therefore been extensively developed. For traditional clustering methods, some researchers clustered the document sets using the similarity between two or more documents,

APA, Harvard, Vancouver, ISO, and other styles

37

Yang, Zhong-Kai, and 楊仲凱. "EEG Source Estimation using Overlapping-Sphere Forward Model and Hierarchical-Search Beamforming." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/69366193387668346426.

Full text

Abstract:

碩士<br>國立交通大學<br>資訊工程系所<br>93<br>Brain is the most important and complicated apparatus of human beings. EEG has been widely applied in functional brain studies due to its high temporal resolution and low cost. In this work, we focus on the development of an accurate and efficient EEG forward model as well as the inverse solution for neuronal source estimation from the EEG measurements. Our forward model successfully gains its accuracy by fitting an overlapping sphere for each EEG sensor. The computation of the overlapping sphere requires only the multi-shell geometry, instead of boundary eleme

APA, Harvard, Vancouver, ISO, and other styles

38

Shen, Heng Tao, Yan Feng Shu, and Bei Yu. "Efficient Semantic-based Content Search in P2P Network." 2003. http://hdl.handle.net/1721.1/3858.

Full text

Abstract:

Most existing Peer-to-Peer (P2P) systems support only title-based searches and are limited in functionality when compared to today’s search engines. In this paper, we present the design of a distributed P2P information sharing system that supports semantic-based content searches of relevant documents. First, we propose a general and extensible framework for searching similar documents in P2P network. The framework is based on the novel concept of Hierarchical Summary Structure. Second, based on the framework, we develop our efficient document searching system, by effectively summarizing and ma

APA, Harvard, Vancouver, ISO, and other styles

39

Shongwe, Nonhlanhla, and 熊薇. "A Multi-level Hierarchical Index Structure for Supporting Efficient Similarity Search of Tagsets." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/88829320408607936394.

Full text

Abstract:

碩士<br>國立臺灣師範大學<br>資訊工程研究所<br>99<br>In this thesis, we propose a multi-level hierarchical index structure to support efficient similarity search for tagsets. The proposed method is designed based on a previous method which supports similarity search in transaction databases with a two-level bounding mechanism. Similar to the previous method, the tagsets are incrementally grouped into clusters. However, a cluster may have sub-clusters in our approach. The tagsets in a leaf-cluster are grouped into batches. Three different thresholds are used to control the degree of similarity at each level of

APA, Harvard, Vancouver, ISO, and other styles

40

Lin, Chih-Lu, and 林致祿. "Query Result Distillation by Hierarchical Clustering and Result Aggregation on Multiple Search Engines." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/89589171792821861918.

Full text

Abstract:

碩士<br>國立成功大學<br>資訊工程學系碩博士班<br>94<br>As the rapid development of the network environment in recent years, we could get more and more Web resources, however some problems happened as followed, e.g., Lacking of the effective method of finding the Web resources. This problem is solved as the birth of the search engines, but there are some other problems and issues needed to be resolved. For some examples that will be mentioned in this paper: (1) for a short query, it is difficult for search engines to understand what users’ goal of the Web search. As a result, search engines are difficult to provi

APA, Harvard, Vancouver, ISO, and other styles

41

Li, Wei-Cheng, and 李韋承. "Toward An Ontology-based Hierarchical Knowledge Map and its Effective Knowledge Search Approach." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/72400371358939852034.

Full text

Abstract:

碩士<br>國立成功大學<br>資訊管理研究所<br>93<br>Since the emergence of the Internet, the amount of information has been grown exponentially. Everyone, as a member of knowledge society, is eager for the assistance and advantage brought by information. However, such a huge amount of information not only results in information overloading but also makes traditional information-retrieval tools incapable of dealing with this situation effectively. Thus, a more intelligent information searching and browsing methodology becomes the key issue in digging out useful knowledge in the so-called information smoke. In par

APA, Harvard, Vancouver, ISO, and other styles

42

Po-Hung, Chen, and 陳柏宏. "A SUBSAMPLING HIERARCHICAL SEARCH ALGORITHM FOR FAST BLOCK MOTION ESTIMATION AND IT'S VLSI ARCHITECTURE." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/56652623777472299686.

Full text

Abstract:

碩士<br>大同工學院<br>電機工程研究所<br>86<br>Due to the limitation of transmission bandwidth, low-bit rate motionvideo coding and transmitting for integrated service digital networks (ISDN) and high definition television (HDTV) systems has an important andgrowing research area. To realize a high-compression codec (coder and decoder), several image coding techniques have been proposed. Among these, motion compensated image coding is widely used to reduce the temporal redundancy, and the key to success of such scheme is to develop a good motion estimation technique to predict the current frame based on the p

APA, Harvard, Vancouver, ISO, and other styles

43

Ansari, Rifqi, and Rifqi Ansari. "Developing a Hybrid Particle Swarm Optimization – Tabu Search for a Hierarchical Facility Location Problem." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/6752vv.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>工業管理系<br>102<br>Hierarchical facility location problem (HFLP) is an extended version of facility layout problem which aims to determine the location of facilities in a way that facilities in higher level can serve lower level efficiently. Particle swarm optimization (PSO) algorithms have been applied to a number of classical and real-world problems. However, since PSO is a stochastic search algorithm, it is likely to be failed to reach global value at the end of a run when the problem is too complicated. This study proposes a combination of PSO and TS for solving the hierarch

APA, Harvard, Vancouver, ISO, and other styles

44

Hsiao, Jen-Hui, and 蕭仁惠. "Using Hierarchical SVM Algorithm to Construct a Vocabulary Tree for Mobile Visual Search Applications." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/39578063997651257505.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Weng, Chuan-Chi, and 翁傳奇. "Hierarchical Resource Classification Overlay Network (HRCON) with Efficient Search in DHT-based Structure P2P Networks." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/02358941570327551044.

Full text

Abstract:

碩士<br>朝陽科技大學<br>資訊工程系碩士班<br>94<br>The most significant challenge in designing a P2P file sharing system is providing a keyword search mechanism that allows users to efficiently locate desired files with short duration. DHT-based systems are highly scalable for locating data items with unique item identifier; however, DHTs do not support keyword search. While unstructured P2P systems like Gnutella are flexible enough to support keyword search, however, this system achieve poor scalability due to query flooding. As described above, structured and unstructured P2P networks are lack with the abili

APA, Harvard, Vancouver, ISO, and other styles

46

Chang, Chun-Wei, and 張鈞偉. "Using Shortest Search Time to Plan Optimal Traffic Paths Based on Hierarchical Servers and Wireless Sensor Networks." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/68124413487900602562.

Full text

Abstract:

碩士<br>朝陽科技大學<br>資訊管理系碩士班<br>96<br>To avoid a traffic jam on the road with a heavy load, it is important to collect the information for a Car-Agent (CAG) to approach the destination. Specially, Real-Time information is significant to help CAG to achieve the purpose mentioned above. Using a hierarchical server structure located at different location and processing the received data from the wireless sensors on the road, this thesis proposes a scheme to describe a shortest path for the CAGs. Besides the short geometric path needed for the CAGs, the shortest time is also needed to describe an opti

APA, Harvard, Vancouver, ISO, and other styles

47

Doroodgar, Barzin. "A Learning-based Semi-autonomous Control Architecture for Robotic Exploration in Search and Rescue Environments." Thesis, 2011. http://hdl.handle.net/1807/30576.

Full text

Abstract:

Semi-autonomous control schemes can address the limitations of both teleoperation and fully autonomous robotic control of rescue robots in disaster environments by allowing cooperation and task sharing between a human operator and a robot with respect to tasks such as navigation, exploration and victim identification. Herein, a unique hierarchical reinforcement learning (HRL) -based semi-autonomous control architecture is presented for rescue robots operating in unknown and cluttered urban search and rescue (USAR) environments. The aim of the controller is to allow a rescue robot to continuous

APA, Harvard, Vancouver, ISO, and other styles

48

Adewumi, Aderemi Oluyinka. "Some improved genetic-algorithms based heuristics for global optimization with innovative applications." Thesis, 2010. http://hdl.handle.net/10539/8621.

Full text

Abstract:

The research is a study of the efficiency and robustness of genetic algorithm to instances of both discrete and continuous global optimization problems. We developed genetic algorithm based heuristics to find the global minimum to problem instances considered. In the discrete category, we considered two instances of real-world space allocation problems that arose from an academic environment in a developing country. These are the university timetabling problem and hostel space allocation problem. University timetabling represents a difficult optimization problem and finding a high qualit

APA, Harvard, Vancouver, ISO, and other styles

49

Huang, Wei-Yin, and 黃威穎. "Hierarchically Dynamic Clustering of Web Search Results." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/16206064099000268747.

Full text

Abstract:

碩士<br>元智大學<br>資訊管理學系<br>94<br>This study proposes a hierarchical clustering method for dynamic clustering of web search results. The resulting tree of clusters can help users efficiently locate the relevant web pages they are interested in. The proposed method extracts feature tokens from the page titles and snippets of search results, and based on an indicator calculated by the coverage and distinctiveness of these feature tokens, determines the clustering concepts, the cluster labels and the number of clusters. Additionally, the proposed method allows a web page to be grouped into several cl

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!