Spelling suggestions: "subject:"3research"" "subject:"1research""
1 |
Case study of executive search firmCheng, Ching-Huei 06 September 2006 (has links)
Job referral business began in Europe in the 15th century. The purpose is to help the unemployed minority, or to fulfill certain market demand for human resources. In the early 19th century, the economy recovery in America supported the prosperity of job referral business. At this time job referral mainly served as a medium for referring jobs ¡V ie: finding jobs for work seekers.
In the early 1970's, there were two changes in job referral business. One is the payers shifted from job applicants to head recruiters. Its operation style also changed from a job referral agency to two new forms: one is retainer head hunting service, with down payment, and the other is contingency service.
Therefore, this paper intends to study the following questions: 1.With different types of head hunting operations and service charge standards, what are the different jobs and talents development strategies? 2. With different types of head hunting operations and service charge standards, what are the different interview and selection processes? 3. After an applicant reports to the job, what's the after-service role of a head hunter? 4. What is the operational difference between local head hunters and the foreign ones?
Although the study only interviewed four companies, these companies are carefully selected to represent a complete scope of the market. The conclusion of our study is as follows:
1. Foreign invested head hunters are easier to get retainer contracts.
2. Local head hunters mostly rely on the company owners to develop job market. Foreign invested companies leverage the operational system to do the same job.
3. High-level head hunters use telephone calls to source head list.
4. High-level head hunters evaluate talents mostly based on credit check and structured interview.
5. High-level head hunters have to pay for their service warranty.
Finally, this paper practically provides three suggestions for effectively running a head hunting business: 1.The establishment of a standard operation system. 2. The emphasis of internal employee training and development. 3. The establishment of company ethics and professional behavior guidelines.
|
2 |
Dynamic categorization a method for decreasing information overload /Pratt, Wanda M. January 1900 (has links)
Thesis (Ph.D)--Stanford University, 1999. / Title from pdf t.p. (viewed Mar. 27, 2002). "March 1999." "Adminitrivia V1/Prg/20000414"--Metadata.
|
3 |
Interference cancellation for cell search in WCDMAChen, Wei-zong 27 August 2004 (has links)
The competitions of communication systems are more drastic with the advance and implement of 3G communication systems. Because 3G communication systems can support many serves, it is necessary to provide communication quality. We will discuss the W-CDMA of 3G communication systems in this paper, and research the modify method for cell search on the environment of mutipath or muticell.
Because the cell search will be affected by the communication channel, it will produce the error of received signals, long cell search time and low working efficient. Thus, we propose an interference cancellation in the original system. The proposed system can strengthen the received signal and cancel the interference of signals. It also can reduce the cell search time and accelerate the searching speed.
|
4 |
A review of search theory.Chan, Richard W. L. January 1972 (has links)
No description available.
|
5 |
Optimal search for the best alternativeWeitzman, Martin Lawrence. 05 1900 (has links)
Prepared under Contract no. EX-76-A-01-2295, Task order 37.
|
6 |
A review of search theory.Chan, Richard W. L. January 1972 (has links)
No description available.
|
7 |
Critisearch for Scholarly SearchJoshi, Sarang G. 30 November 2018 (has links)
Online search has empowered users with access to vast amounts of information. However, current online interfaces do not permit users to manipulate the hits on a search engine result page (SERP). This leads to the user adapting his/her own search style to suit the search engine instead of being the other way round. We present Critisearch, an online search interface that allows users to manipulate hits by upvoting, downvoting and sorting them such that they can be arranged in a user-defined order. Critisearch was originally developed for middle school children. However, we found an interesting dearth of studies on how graduate students conduct searches. In order to evaluate how the manipulation of hits can benefit users, we conducted a longitudinal study with 10 graduate students who used Critisearch and/or other search engine/s of their choice for conducting the scholarly search over a three week period. Results indicate that using Critisearch for hit manipulation enabled metacognitive scaffolding (plan, filter, sort information) on the search engine interface especially in exploratory search contexts. Critisearch seems to facilitate a conversation with the interface by enabling marking of hits. In addition, Critisearch also appears to promote reflection with the upvote/downvote capabilities for marking of hits available to the user. The hit manipulation and metacognitive scaffolding on the Critisearch interface encourages users to conduct their search tasks in a more breadth-first fashion as opposed to the commonly used depth-first search strategy. Using qualitative analysis, we discovered three distinct types of search tasks that users perform in a scholarly context namely, specific exploration, needle-in-a-haystack and general exploration. This analysis provides a starting point for a better understanding information needs of users in a scholarly context and a classification of search tasks thus, adding to the existing body of literature on nature of online search tasks. / M.S. / Online search engines have been pivotal in ushering the information age which contributes to the rapid dissemination of electronic information. Today, online search engines empower users to access this vast amount of information using queries on the search engine interface. Over the years, the search engine capabilities have been growing richer in terms of personalized user experiences. However, users have limited agency when it comes to personalizing or ordering the actual results that are displayed on the search engine result page. Search engines do not allow the user to reorder or provide feedback regarding the results for a particular search term or set of keywords. Therefore, most users adapt to the interface in order to get the results that they desire, instead of the other way around. Critisearch is the first step in the direction of making the user interface adapt to the user's needs. It allows users to order and rank the search results as to how relevant they are to the search terms entered. Graduate students employ search engines in a technical and advanced sphere of learning but the researchers found that there weren't as many studies about how graduate students conduct searches. In order to evaluate the efficacy of the interface, a study with 10 graduate students was conducted who used Critisearch to conduct academic searches over a period of three weeks. Results indicate that Critisearch allows users to have a more interactive experience with the search engine interface and promotes an alternative style of online search.
|
8 |
Internet search techniques : using word count, links and directory structure as Internet search toolsMoghaddam, Mehdi Minachi January 2005 (has links)
As the Web grows in size it becomes increasingly important that ways are developed to maximise the efficiency of the search process and index its contents with minimal human intervention. An evaluation is undertaken of current popular search engines which use a centralised index approach. Using a number of search terms and metrics that measure similarity between sets of results, it was found that there is very little commonality between the outcome of the same search performed using different search engines. A semi-automated system for searching the web is presented, the Internet Search Agent (ISA), this employs a method for indexing based upon the idea of "fingerprint types". These fingerprint types are based upon the text and links contained in the web pages being indexed. Three examples of fingerprint type are developed, the first concentrating upon the textual content of the indexed files, the other two augment this with the use of links to and from these files. By looking at the results returned as a search progresses in terms of numbers and measures of content of results for effort expended, comparisons can be made between the three fingerprint types. The ISA model allows the searcher to be presented with results in context and potentially allows for distributed searching to be implemented.
|
9 |
A Study on Fine-Grained User Behavior Analysis in Web Search / Web検索における細粒度ユーザ行動の分析に関する研究Umemoto, Kazutoshi 23 March 2016 (has links)
京都大学 / 0048 / 新制・課程博士 / 博士(情報学) / 甲第19852号 / 情博第603号 / 新制||情||105(附属図書館) / 32888 / 京都大学大学院情報学研究科社会情報学専攻 / (主査)教授 田中 克己, 教授 石田 亨, 教授 吉川 正俊 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM
|
10 |
Embedded Local Search Approaches for Routing Optimisation.Cowling, Peter I., Keuthen, R. January 2005 (has links)
No / This paper presents a new class of heuristics which embed an exact algorithm within the framework of a local search heuristic. This approach was inspired by related heuristics which we developed for a practical problem arising in electronics manufacture. The basic idea of this heuristic is to break the original problem into small subproblems having similar properties to the original problem. These subproblems are then solved using time intensive heuristic approaches or exact algorithms and the solution is re-embedded into the original problem. The electronics manufacturing problem where we originally used the embedded local search approach, contains the Travelling Salesman Problem (TSP) as a major subproblem. In this paper we further develop our embedded search heuristic, HyperOpt, and investigate its performance for the TSP in comparison to other local search based approaches. We introduce an interesting hybrid of HyperOpt and 3-opt for asymmetric TSPs which proves more efficient than HyperOpt or 3-opt alone. Since pure local search seldom yields solutions of high quality we also investigate the performance of the approaches in an iterated local search framework. We examine iterated approaches of Large-Step Markov Chain and Variable Neighbourhood Search type and investigate their performance when used in combination with HyperOpt. We report extensive computational results to investigate the performance of our heuristic approaches for asymmetric and Euclidean Travelling Salesman Problems. While for the symmetric TSP our approaches yield solutions of comparable quality to 2-opt heuristic, the hybrid methods proposed for asymmetric problems seem capable of compensating for the time intensive embedded heuristic by finding tours of better average quality than iterated 3-opt in many less iterations and providing the best heuristic solutions known, for some instance classes.
|
Page generated in 0.0356 seconds