To locate and to retrieve the needed information from the Internet is an important issue. Existing search engines may give too much useless and redundancy information. Due to the search feature is different for different search engines, it¡¦s very difficult to find an optimal search scheme for all subjects. In this paper, we propose a genetic programming web search system (GPWS) to generate exact query according to a user¡¦s interests. The system can retrieve the information from the search engines, filter the retrieved results and remove the redundancy and useless results. The filtered results are displayed on a uniform user interface. Compared with the queries generated by randomly, the degree of similarity of results and user¡¦s interests are improved.

This paper presents a search method of coupling between the laser and fiber , search method to make up through the fiber and the laser inter-position deviation caused optical transmission loss , this search method is applied in the array-alignment is different from the traditional single-alignment , the advantage for the method is simple, through the rough alignment then blind search and angle search , for fiber array find the coupling of the greatest optical power position. In the experiment there are four degrees of freedom to use precise stage to fine-tune the location of fiber array , to reduce losses due to tools to reach precise alignment of purpose ,so we prove our method can achieve the objective of the fiber-optic alignment in our experiments.

<p>Millions of people are using search engines every day when they are trying to find information on the Internet. The purpose of this report is to find out how people formulate search queries. The result in this report is based on an empirical study which is based on a search log from the Swedish search engine Seek.se.</p><p>One of the results in this thesis is that nearly all search queries are based on keywords.</p> / <p>Miljoner människor använder sökmotorer varje dag när de försöker hitta information på Internet. Syftet med den här uppsatsen är att ta reda på hur individer formulerar sökfraser. Resultatet i rapporten är baserad på en empirisk studie som är baserad på sökloggen för den svenska sökmotorn Seek.se.</p><p>Uppsatsen kommer bl.a. fram till att nästan alla sökningar som görs på Internet är nyckelordsbaserade.</p>

Thesis (M.A. in Security Studies (Homeland Security and Defense))--Naval Postgraduate School, December 2009. / Thesis Advisor(s): Gordon, Ellen. Second Reader: Bellavita, Chris. "December 2009." Description based on title screen as viewed on January 27, 2010. Author(s) subject terms: Urban search and rescue (US&R), urban search and rescue systems, Florida Urban Search and Rescue (FLUSAR), search and rescue, US&R task force, technical rescue teams, state emergency response, States Urban Search and Rescue Alliance (SUSAR), Florida State Fire Marshall, Marion County, FL Fire Rescue. Includes bibliographical references (p. 61-63). Also available in print.

Thesis (M.S.)--Brigham Young University. Dept. of Computer Science, 2009. / Includes bibliographical references (p. 47-49).

Thesis (Ph. D.)--University of Washington, 2001. / Vita. Includes bibliographical references (p. 156-164).

Thesis (Ph. D.)--Ohio State University, 2009. / Title from first page of PDF file. Includes bibliographical references (p. 102-105).

As a native of El Paso, Texas my work reflects on autobiographical narratives and violent events that have taken place along the US-Mexico border. For the past two years my research and artwork have focused on the Femicidios (women murders) in Ciudad Juárez (Chihuahua, Mexico). The specific case of Campo Algodón (2001), where eight young women were found in a mass grave in the center of the city, led me to investigate and produce a group of works in reference to loss, justice, memory and erasure. My purpose is to create works that inform the viewer of something that has occurred and continues to happen. My artistic approach involves concept, research and process, which eventually result in installations and sculptural objects. My aim in this thesis is to outline my research methodology and explore the intersections of my work with theoretical discourses in art, human rights, and neoliberalism. With a minimalist aesthetic, my work often masks the labor intensive process involved in research and production. By mining the archives of classified documents used in international human rights courts, I use this material as the base for my work. The nature of this material often dictates its visibility or illegibility as a classified source that cannot be revealed. This body of work requires collaboration across disciplines in which the research and communication with specialists have helped in the formation of each piece. / text

Given a graph G=(V,E), a vertex ordering of G is a total order v1,v2,...,vn of V. A graph search algorithm is a systematic method for visiting each vertex in a graph, naturally producing a vertex ordering of the graph. We explore the problem of determining whether a given vertex in a graph can be the end (last) vertex of a search ordering for various common graph search algorithms when restricted to various graph classes, as well as the related problem of determining if a vertex is an end-vertex when a start vertex is specified for the search. The former is referred to as the end-vertex problem, and the latter is the beginning-end-vertex problem. For the beginning-end-vertex problem, we show it is NP-complete on bipartite graphs as well as degree restricted bipartite graphs for Lexicographic Breadth First Search, but solvable in polynomial time on split graphs for Breadth First Search. We show that the end-vertex problem is tractable for Lexicographic Breadth First Search on proper interval bigraphs and for Lexicographic Depth First Search on chordal graphs. Further, we show that the problem is NP-complete for Lexicographic Breadth First Search and Depth First Search on bipartite graphs. / Graduate

The search engine has become one of the most popular tools used on the Internet. Most of the existing search engines locate information based on queries consisting of a small number of keywords provided by the users. Although those search engines can query their databases and retrieve documents in a timely manner, the quality of the results is often unsatisfactory. This problem, based on previous studies and our observation, is partially due to the lack of semantic interpretation of a search request, as well as the user's incapability to precisely express their information need in a short query. In this research, we propose a conceptual framework that classifies various types of context in a Web search environment and present a new semantics-based approach that disambiguates user queries by analyzing the "relationship" context associated with query concepts.Our multi-methodological research approach includes: (i) building a context framework by categorizing different types of context; (ii) proposing a search mechanism that discovers and utilizes semantic relationships among query terms; (iii) demonstrating the practical implications of our proposed model using a proof-of-concept prototype system; and (iv) evaluating the usefulness of "relationship" context through an experimental study. From a technical perspective, our approach integrates ideas from semantic network, ontology, and information retrieval techniques. The experimental study conducted in the medical domain shows that our approach is effective and outperforms an existing popular search engine on search tasks consisting of key semantic relationships.