Connecting: the use of information and communication technologies by older adults in a retirement community

This is a long-term study of the use of information and communication technologies by 30 older adults (ages 70–97) living in a large retirement community. The study spanned the years of 1996 to 2008, during which time the research participants grappled with the challenges of computer use while aging 12 years. The researcher, herself a ‘mature learner,’ used a qualitative research design which included observations and open-ended interviews. Using a strategy of “intermittent immersion,” she spent an average of two weeks per visit on site and participated in the lives of the research population in numerous ways, including service as their computer tutor. With e-mail and telephone contact, she was able to continue her interactions with participants throughout the 12-year period. A long-term perspective afforded the view of the evolution, devolution or cessation of the technology use by these older adults, and this process is chronicled in detail through five individual “profiles.” Three research questions dominated the inquiry: What function do computers serve in the lives of older adults? Does computer use foster or interfere with social ties? Is social support necessary for success in the face of challenging learning tasks? In answer to the first question, it became clear that computers were valued as a symbol of competence and intelligence. Some individuals brought their computers with them when transferred to the single-room residences of assisted living or nursing care facilities. Even when use had ceased, their computers were displayed to signal that their owners were or had once been keeping up to date. In answer to the second question, computer owners socialized around computing use (with in-person family members or friends) more than, or as much as, they socialized through their computers in the digital realm of the Internet. And in answer to the third question, while the existence of social support did facilitate computer exploration, more important was the social support network generated and developed among fellow computer users.

Approximation Algorithms for Network Design and Orienteering

This thesis presents approximation algorithms for some NP-Hard combinatorial optimization problems on graphs and networks; in particular, we study problems related to Network Design. Under the widely-believed complexity-theoretic assumption that P is not equal to NP, there are no efficient (i.e., polynomial-time) algorithms that solve these problems exactly. Hence, if one desires efficient algorithms for such problems, it is necessary to consider approximate solutions: An approximation algorithm for an NP-Hard problem is a polynomial time algorithm which, for any instance of the problem, finds a solution whose value is guaranteed to be within a multiplicative factor of the value of an optimal solution to that instance. We attempt to design algorithms for which this factor, referred to as the approximation ratio of the algorithm, is as small as possible. The field of Network Design comprises a large class of problems that deal with constructing networks of low cost and/or high capacity, routing data through existing networks, and many related issues. In this thesis, we focus chiefly on designing fault-tolerant networks. Two vertices u,v in a network are said to be k-edge-connected if deleting any set of k − 1 edges leaves u and v connected; similarly, they are k-vertex connected if deleting any set of k − 1 other vertices or edges leaves u and v connected. We focus on building networks that are highly connected, meaning that even if a small number of edges and nodes fail, the remaining nodes will still be able to communicate. A brief description of some of our results is given below. We study the problem of building 2-vertex-connected networks that are large and have low cost. Given an n-node graph with costs on its edges and any integer k, we give an O(log n log k) approximation for the problem of finding a minimum-cost 2-vertex-connected subgraph containing at least k nodes. We also give an algorithm of similar approximation ratio for maximizing the number of nodes in a 2-vertex-connected subgraph subject to a budget constraint on the total cost of its edges. Our algorithms are based on a pruning process that, given a 2-vertex-connected graph, finds a 2-vertex-connected subgraph of any desired size and of density comparable to the input graph, where the density of a graph is the ratio of its cost to the number of vertices it contains. This pruning algorithm is simple and efficient, and is likely to find additional applications. Recent breakthroughs on vertex-connectivity have made use of algorithms for element-connectivity problems. We develop an algorithm that, given a graph with some vertices marked as terminals, significantly simplifies the graph while preserving the pairwise element-connectivity of all terminals; in fact, the resulting graph is bipartite. We believe that our simplification/reduction algorithm will be a useful tool in many settings. We illustrate its applicability by giving algorithms to find many trees that each span a given terminal set, while being disjoint on edges and non-terminal vertices; such problems have applications in VLSI design and other areas. We also use this reduction algorithm to analyze simple algorithms for single-sink network design problems with high vertex-connectivity requirements; we give an O(k log n)-approximation for the problem of k-connecting a given set of terminals to a common sink. We study similar problems in which different types of links, of varying capacities and costs, can be used to connect nodes; assuming there are economies of scale, we give algorithms to construct low-cost networks with sufficient capacity or bandwidth to simultaneously support flow from each terminal to the common sink along many vertex-disjoint paths. We further investigate capacitated network design, where edges may have arbitrary costs and capacities. Given a connectivity requirement R_uv for each pair of vertices u,v, the goal is to find a low-cost network which, for each uv, can support a flow of R_uv units of traffic between u and v. We study several special cases of this problem, giving both algorithmic and hardness results. In addition to Network Design, we consider certain Traveling Salesperson-like problems, where the goal is to find short walks that visit many distinct vertices. We give a (2 + epsilon)-approximation for Orienteering in undirected graphs, achieving the best known approximation ratio, and the first approximation algorithm for Orienteering in directed graphs. We also give improved algorithms for Orienteering with time windows, in which vertices must be visited between specified release times and deadlines, and other related problems. These problems are motivated by applications in the fields of vehicle routing, delivery and transportation of goods, and robot path planning.

Sexuality in the media and emotional well-being among lesbian, gay, & bisexual adolescents

LGB teens’ feelings, desires, and physical attractions run contrary to the heteronormative standards of American society. As such, LGB youth often experience feelings of sadness and dejection that can lead to depression and suicidal tendencies (Russell & Joyner, 2001). Evaluating the factors that could possibly influence the emotional well-being of LGB youth would be an important undertaking given the hindrances LGB adolescents face during sexual socialization. The purpose of this dissertation was to study the portrayal of sexuality in media popular with LGB adolescents and to assess the relationship between media exposure and emotional well-being among LGB teens. In particular, this dissertation distinguished between mainstream media and gay- and lesbian-oriented (GLO) media. GLO media were defined as any media outlet specifically designed, produced, and marketed for gay and lesbian audiences. Two studies were conducted to serve as the initial investigation in a program of research that will be designed to better understand the role of media in the lives of LGB individuals. The first study of this dissertation was a content analysis of the television programs, films, songs, and magazines most popular with LGB teens as determined by self-reports of media consumption in a survey of media use. A total of 96 media vehicles composed the content analysis sample, including 48 television programs, 22 films, 25 musical artists, and 6 magazines. Using a coding scheme that was adapted from previous media sex research, Study 1 measured the frequency of sexual instances as well as the type, nature, and source characteristics for each sexual instance. Results of the content analysis suggest that heterosexuality reigns supreme in mainstream media. When LGB sexuality is depicted in mainstream media, it is often sanitized. LGB sexual talk is rarely sexual; rather it is primarily about the social or cultural components of being lesbian, gay, or bisexual. LGB sexual behavior is also rare in mainstream media, which tend to depict LGB individuals as non-sexually as possible. LGB sexuality in mainstream media exists, but is more about proclaiming LGB identity than actually living it. GLO media depicted LGB sexuality more frequently than mainstream media did. GLO media often depict LGB sexuality in a more realistic manner. LGB sexual talk is about LGB identity, as well as the relational and sexual aspects of being a sexual minority. LGB sexual behavior is commonplace in GLO media, depicting LGB individuals as sexual beings. LGB sexuality in GLO media is prevalent and relatively authentic. The second study was a survey that assessed the relationship between media exposure (both mainstream media and GLO media) and LGB teens’ emotional well-being, considering self-discrepancy as an important mediating variable in that relationship. Study 2 also considered age, sex, and sexual identity commitment as possible moderating variables in the relationship between media exposure and emotional well-being. In Study 2, emotional well-being was defined as lower levels of dejection-related emotions. LGB adolescents (N = 573) completed a questionnaire that was used to investigate the relationships between media exposure and emotional well-being. Results of the survey indicated that mainstream media exposure was not significantly associated with dejection-related emotions. In contrast, GLO media exposure was negatively related to feelings of dejection even when controlling for age, sex, race, perceived social support, school climate, religiosity, geographical location, sexuality of peers, and motivation for viewing LGB inclusive media content. Neither age nor sex moderated the relationships between media exposure variables and dejection, but sexual identity commitment did act as a moderator in the relationship between GLO media exposure and dejection. The negative relationship between GLO media exposure and dejection was stronger for participants lower in sexual identity commitment than for participants higher in sexual identity commitment. In addition, the magnitude of discrepancies between the actual self and the ideal self mediated the relationship between GLO media exposure and dejection for LGB adolescents low in sexual identity commitment. However, self-discrepancy did not mediate the relationship between GLO media exposure and dejection for LGB teens highly committed to their sexual identities. Results of both the content analysis and the survey are discussed in terms of implications for theory and method. Practical implications of this dissertation’s findings are also discussed, as well as directions for future research.