The demand for high-level management and professional talents has increased sharply nowadays. Besides training and retaining existing talents, reaching and attracting potential candidate is another important issue for corporate. The Human Resource department has worked hard to reach the talents through variety recruiting channels, and headhunting service has been one of channels in reaching the potentials. There are number of successful examples that corporate has recruited the elites through headhunting services. For example, Louis V. Gerstner from Nabisc has headhunted to IBM as the CEO in 1993; Carly Fiorina from AT&T was switched to HP as the Chairman and CEO; while the former Microsoft Global VP, Mr. Kai-Fu Lee, is working with Google because of headhunter¡¦s connection. As the headhunter could reach the core of a corporation, the headhunting process must be preceded unexpectedly. With the increasing demand for high-level management and professional talents, the headhunting business is expected to be prosperous in the future. The research in this paper is done by using qualitative method and focuses on multinational headhunting companies in Taiwan and the company where the researcher is from. Through depth interview, researching, examination and studies the information collected from domestic and overseas, the researcher is expecting to find the relationship between the nature of the companies and the service models, headhunting cases, database management, and customer relationship management. In this paper, the researcher has found that most headhunting companies have adopted similar service procedure, however, the sources of the cases, database, and recruiting and screening methods are different upon its company background and culture. The headhunting companies have set up its database in the computer systems after obtaining the relevant information though personal connection, cold-call with the potential talents while maintaining the relationship with the clients through telephone and in person visiting. The more information the headhunter could grape from the clients; the chance of a successful case is higher. Moreover, most of the headhunting companies have categorized the case by industry, nature of the vacancy and territory.

This dissertation, in its most general context, is an investigation into the modeling of markets with imperfectly informed agents. In such markets, there will invariably be incentives for informed agents to take advantage of information asymmetries by disseminating the relevant information to uninformed agents. Similarly, there will be incentives for uniformed agents to reduce the adverse effects of information asymmetries by acquiring the relevant information. The primary purpose of this dissertation is to demonstrate that the understanding of such markets can be greatly enhanced by explicit modeling both channels of information flow as omitting either channel could eliminate important interaction effects. The arguments in this dissertation are narrowly framed within a familiar differentiated market in which firms advertise and each consumer is imperfectly informed about which product is most suited to his taste. However, the conclusions drawn in the dissertation are applicable to more general economic systems in which it is costly for agents to acquire information relevant to the decision-making process. There is a long-standing debate in the literature about whether or not advertising is purely informative. Although there is extensive research on advertising models and consumer search models, little is known about differentiated markets in which firms advertise and consumers search. In modeling advertising and consumer search, this dissertation questions the relevance of two pieces of evidence that have been offered against the view that advertising is informative. In the first instance, I demonstrate that firms may use purely informative advertising and still maintain market power in the long-run in monopolistically competitive markets; this finding thus rejects the argument that firms rely on manipulating consumer preferences in order to maintain market power in these markets. In the second instance, I demonstrate that advertisements without any information about the product being advertised may still be informative to some consumers; this finding thus rejects the argument that the widespread use of uninformative television advertisements is inconsistent with the view that advertising is informative in nature. This dissertation shows that our understanding of the nature of advertising (information dissemination mechanism) is greatly enhanced by modeling consumer search (information acquisition mechanism).

Cell search of Third Generation Partnership Project Long Term Evolution (3GPP LTE) includes time synchronization and frequency synchronization of frames, and the acquisition of Cell Identity (Cell ID). The LTE systems use 504 Cell IDs divided into 168 unique Cell-Identity Groups (Cell-ID Groups), and each Cell-ID Group comprises three Sector Identities (Sector IDs). After reaching synchronization of time and frequency between frames, the Cell ID acquisition scheme provided by specification of 3GPP LTE is consisted of two steps, the first step must utilize three matched filters to detect one out of three Sector IDs, and then implement coherent correlation detection between 168 Pseudo Random Noise Sequences (PN sequences) to obtain the index of Cell-ID Group. So the cell search scheme provided by LTE standard has to detect correlation of all sequences, and computed complexity brings considerable processing time to effect the delay time of services power on, standby time, energy saved, and cost of manufacture. To reduce complexity, we propose a perfect sequence with special structure as preamble, and the sequence is linear combination of two base sequences. We put the sequences within Primary Synchronization Channel (P-SCH) and Secondary Synchronization Channel (S-SCH), and we utilize the phase rotation factors of the sequences as index to generate Cell ID, instead of the current scheme to generate Cell ID with the indexes between sequences and sequences. Based on the sequences in multipath channel model, simulation results verify the detection probability of Cell IDs by proposed scheme is 100% when SNR is -8dB, and it is 98.7% by the scheme in LTE specification after perfect time and frequency compensation. Except that, Cell ID detection performance is similar without channel compensation to reduce implement complexity. Index Terms- cell search, 3GPP LTE, 16n perfect sequence.

Thesis (Ph. D.)--University of Washington, 2000. / Vita. Includes bibliographical references (leaves 89-93).

Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2002. / Includes bibliographical references (leaves 138-144). Also available in electronic version. Access restricted to campus users.

Text mining methods strive to make unstructured text more useful for decision making. As part of the mining process, language is processed prior to analysis. Processing techniques have often focused primarily on either text structure or text meaning in preparing documents for analysis. As approaches have evolved over the years, increases in the use of lexical semantic parsing usually have come at the expense of full syntactic parsing. This work explores the benefits of combining structure and meaning or syntax and lexical semantics to support the text mining process.Chapter two presents the Arizona Summarizer, which includes several processing approaches to automatic text summarization. Each approach has varying usage of structural and lexical semantic information. The usefulness of the different summaries is evaluated in the finding stage of the text mining process. The summary produced using structural and lexical semantic information outperforms all others in the browse task. Chapter three presents the Arizona Relation Parser, a system for extracting relations from medical texts. The system is a grammar-based system that combines syntax and lexical semantic information in one grammar for relation extraction. The relation parser attempts to capitalize on the high precision performance of semantic systems and the good coverage of the syntax-based systems. The parser performs in line with the top reported systems in the literature. Chapter four presents the Arizona Entity Finder, a system for extracting named entities from text. The system greatly expands on the combination grammar approach from the relation parser. Each tag is given a semantic and syntactic component and placed in a tag hierarchy. Over 10,000 tags exist in the hierarchy. The system is tested on multiple domains and is required to extract seven additional types of entities in the second corpus. The entity finder achieves a 90 percent F-measure on the MUC-7 data and an 87 percent F-measure on the Yahoo data where additional entity types were extracted.Together, these three chapters demonstrate that combining text structure and meaning in algorithms to process language has the potential to improve the text mining process. A lexical semantic grammar is effective at recognizing domain-specific entities and language constructs. Syntax information, on the other hand, allows a grammar to generalize its rules when possible. Balancing performance and coverage in light of the world's growing body of unstructured text is important.

No description available.

Our everyday interactions with the world are subject to affordance: the interaction that exists naturally between an object and the action possibilities inherent within it. Object affordances result from complex visuomotor interactions and are reflected in many processes, including reaching and grasping behaviours, distance judgments, and object identification. With the present study we extended current research on the use of affordances in visual searches of arrays to investigate whether guidance by affordance occurs in searches of real-world scenes and is the result of knowledge of target function (Experiment 1), and whether it is integrated with the use of scene context in guidance of search (Experiment 2). To investigate the contribution of object function to guidance by affordance in real-world scenes we tracked participants’ eye movements while they performed visual searches. The target objects were invented objects with invented functions that were learned by the participants prior to beginning search. By providing participants with information about only the features and functions of targets (and not about location) we omitted any effects on search from previously learned associations between the objects and their locations in the scene. This allowed us to examine guidance by affordance independently of traditional contextual effects. In Experiment 1 we compared the searches of participants who learned the functions of the targets to those who learned only the targets’ features. Results showed facilitation of visual search by knowledge of target function as compared against searches in which target function was not known. Experiment 2 compared searches for objects placed in locations congruent and incongruent with their function to show that guidance by affordance is benefitted by knowledge of target function in congruent searches. We concluded that guidance by affordance results from an understanding of the function of an object and the integration of that understanding into an understanding of the context of the scene as a whole / Thesis (Master, Psychology) -- Queen's University, 2012-08-30 16:36:26.184

No description available.

This research aims to improve the performance of the service of a Chemotherapy Treatment Unit by reducing the waiting time of patients within the unit. In order to fulfill the objective, initially, the chemotherapy treatment unit is deduced as an identical parallel machines scheduling problem with unequal release time and single resource. A mathematical model is developed to generate the optimum schedule. Afterwards, a Tabu search (TS) algorithm is developed. The performance of the TS algorithm is evaluated by comparing results with the mathematical model and the best results of benchmark problems reported in the literature. Later on, an additional resource is considered which converted the problem into a dual resources scheduling problem. Three approaches are proposed to solve this problem; namely, heuristics, a Tabu search algorithm with heuristic (TSHu), and Tabu search algorithm for dual resources (TSD).