Thesis (M.A.)--Carleton University, 2001. / Includes bibliographical references (p. 90-96). Also available in electronic format on the Internet.

Thesis (Ph. D.)--Florida State University, 2005. / Advisor: Dr. Joey F. George, Florida State University, College of Business, Dept. of Management Information Systems. Title and description from dissertation home page (viewed Sept. 14, 2005). Document formatted into pages; contains ix, 119 pages. Includes bibliographical references.

Thesis (Ph. D.)--Columbia University, 1937. / Vita. Published also without thesis note. Bibliography: p. 92-94.

Thesis--Catholic Univ. of America. / Biographical note. Bibliography: p. 106-109.

No description available.

In Mobile Ad Hoc Networks (MANETs), nodes depend on each other for routing and forwarding packets. However, to save power and other resources, nodes belonging to independent authorities may behave selfishly, and may not be willing to help other nodes. Such selfish behavior poses a real threat to the proper functioning of MANETs. One way to foster node cooperation is to introduce punishment for selfish nodes. Based on neighbor-monitoring techniques, a fully distributed solution to detect, punish, and re-admit selfish nodes, is proposed here. This solution provides nodes the same opportunity to serve/and be served by others. A light-weight solution regarding battery status is also proposed here. This solution requires neighbor monitoring only when necessary, thereby saving nodes battery power. Another effective way to solve the selfish-node problem is to reward nodes for their service according to their cost. To force nodes to show their true cost, truthful protocols are needed. A low overhead truthful routing protocol to find optimal routes is proposed in this thesis. The most prominent feature of this protocol is the reduction of overhead from existing solutions O(n3) to O(n2). A light-weight scalable truthful routing protocol (LSTOP) is further proposed, which finds near-least-cost paths in dense networks. LSTOP reduces overhead to O(n) on average, and O(n2) in worst case scenarios. Multiple path routing protocols are an effective alternative to single path routing protocols. A generic mechanism that can turn any table-driven multipath routing protocol into a truthful one, is outlined here. A truthful multipath routing protocol (TMRP), based on well-known AOMDV protocol, is presented as an example. TMRP incurs an only 2n message overhead for a route discovery, and can also achieve load balancing without compromising truthfulness. To cope with the selfish-node problem in the area of position-based routing, a truthful geographic forwarding (TGF) algorithm is presented. TGF utilizes three auction-based forwarding schemes to stimulate node cooperation. The truthfulness of these schemes is proven, and their performance is evaluated through statistical analysis and simulation studies.

No description available.

During a crime event, witnesses may have to judge the veracity of a suspect. I hypothesized that, because performing this task is cognitively demanding, (a) it would impair subsequent memory for details about the suspect and (b) judging veracity while motivated to do so as accurately as possible would exaggerate this effect. These predictions were supported. Additionally, witnesses who judged veracity reported increased certainty about the accuracy of their description and message and their identification of the suspect compared to control witnesses, and they also said they had a better view of the suspect and paid more attention to him. Motivation further inflated some of these testimony-relevant judgments. Moreover, compared to control witnesses, motivated witnesses who judged veracity reported a greater willingness to testify and a clearer image of the suspect in their memory. / Department of Psychological Science

Thesis (Ph. D.)--University of Nevada, Reno, 2006. / "December 2006." Includes bibliographical references (leaves 66-73). Online version available on the World Wide Web. Library also has microfilm. Ann Arbor, Mich. : ProQuest Information and Learning Company, [2006]. 1 microfilm reel ; 35 mm.

Thesis (Ph. D.)--University of Chicago, Dept. of Philosophy, June 2003. / Includes bibliographical references. Also available on the Internet.