907 resultados para Third orders
Resumo:
Woods, T. (2003). Giving and Receiving: Nuruddin Farah's Gifts, or, the Postcolonial Logic of Third World Aid. Journal of Commonwealth Literature, 38 (1), 91-112.
Resumo:
http://www.archive.org/details/amemoirofedwards00heanuoft
Resumo:
We give an explicit and easy-to-verify characterization for subsets in finite total orders (infinitely many of them in general) to be uniformly definable by a first-order formula. From this characterization we derive immediately that Beth's definability theorem does not hold in any class of finite total orders, as well as that McColm's first conjecture is true for all classes of finite total orders. Another consequence is a natural 0-1 law for definable subsets on finite total orders expressed as a statement about the possible densities of first-order definable subsets.
Resumo:
Nearest neighbor retrieval is the task of identifying, given a database of objects and a query object, the objects in the database that are the most similar to the query. Retrieving nearest neighbors is a necessary component of many practical applications, in fields as diverse as computer vision, pattern recognition, multimedia databases, bioinformatics, and computer networks. At the same time, finding nearest neighbors accurately and efficiently can be challenging, especially when the database contains a large number of objects, and when the underlying distance measure is computationally expensive. This thesis proposes new methods for improving the efficiency and accuracy of nearest neighbor retrieval and classification in spaces with computationally expensive distance measures. The proposed methods are domain-independent, and can be applied in arbitrary spaces, including non-Euclidean and non-metric spaces. In this thesis particular emphasis is given to computer vision applications related to object and shape recognition, where expensive non-Euclidean distance measures are often needed to achieve high accuracy. The first contribution of this thesis is the BoostMap algorithm for embedding arbitrary spaces into a vector space with a computationally efficient distance measure. Using this approach, an approximate set of nearest neighbors can be retrieved efficiently - often orders of magnitude faster than retrieval using the exact distance measure in the original space. The BoostMap algorithm has two key distinguishing features with respect to existing embedding methods. First, embedding construction explicitly maximizes the amount of nearest neighbor information preserved by the embedding. Second, embedding construction is treated as a machine learning problem, in contrast to existing methods that are based on geometric considerations. The second contribution is a method for constructing query-sensitive distance measures for the purposes of nearest neighbor retrieval and classification. In high-dimensional spaces, query-sensitive distance measures allow for automatic selection of the dimensions that are the most informative for each specific query object. It is shown theoretically and experimentally that query-sensitivity increases the modeling power of embeddings, allowing embeddings to capture a larger amount of the nearest neighbor structure of the original space. The third contribution is a method for speeding up nearest neighbor classification by combining multiple embedding-based nearest neighbor classifiers in a cascade. In a cascade, computationally efficient classifiers are used to quickly classify easy cases, and classifiers that are more computationally expensive and also more accurate are only applied to objects that are harder to classify. An interesting property of the proposed cascade method is that, under certain conditions, classification time actually decreases as the size of the database increases, a behavior that is in stark contrast to the behavior of typical nearest neighbor classification systems. The proposed methods are evaluated experimentally in several different applications: hand shape recognition, off-line character recognition, online character recognition, and efficient retrieval of time series. In all datasets, the proposed methods lead to significant improvements in accuracy and efficiency compared to existing state-of-the-art methods. In some datasets, the general-purpose methods introduced in this thesis even outperform domain-specific methods that have been custom-designed for such datasets.
Resumo:
Stress can be understood in terms of the meaning of stressful experiences for individuals. The meaning of stressful experiences involves threats to self-adequacy, where self-adequacy is considered a basic human need. Appropriate research methods are required to explore this aspect of stress. The present study is a qualitative exploration of the stress experienced by a group of 27 students at the National Institute of Higher Education, Limerick (since renamed the University of Limerick). The study was carried out by the resident student counsellor at the college. A model of student stress was explored, based on student developmental needs. The data consist of a series of interviews recorded with each of the 27 students over a 3 month period. These interviews were transcribed and the resulting transcripts are the subject of detailed analysis. The analysis of the data is an account of the sense-making process by the student counsellor of the students' reported experiences. The aim of the analysis was to reduce the large amounts of data to their most salient aspects in an ordered fashion, so as to examine the application of a developmental model of stress with this group of students. There were two key elements to the analysis. First, the raw data were edited to identify the key statements contained in the interviews. Second, the statements were categorised, as a means of summarising the data. The results of the qualitative dataanalysis were then applied to the developmental model. The analysis of data revealed a number of patterns of stress amongst the sample of students. Patterns of academic over-identification, parental conflict and social inadequacy were particularly noteworthy. These patterns consisted of an integration of academic, family and social stresses within a developmental framework. Gender differences with regard to the need for separateness and belonging are highlighted. Appropriate student stress intervention strategies are discussed. Based on the present results, the relationship between stress and development has been highlighted and is recommended as a firm basis for future studies of stress in general and student stress in particular.
Resumo:
Regions of the hamster alpha 1-adrenergic receptor (alpha 1 AR) that are important in GTP-binding protein (G protein)-mediated activation of phospholipase C were determined by studying the biological functions of mutant receptors constructed by recombinant DNA techniques. A chimeric receptor consisting of the beta 2-adrenergic receptor (beta 2AR) into which the putative third cytoplasmic loop of the alpha 1AR had been placed activated phosphatidylinositol metabolism as effectively as the native alpha 1AR, as did a truncated alpha 1AR lacking the last 47 residues in its cytoplasmic tail. Substitutions of beta 2AR amino acid sequence in the intermediate portions of the third cytoplasmic loop of the alpha 1AR or at the N-terminal portion of the cytoplasmic tail caused marked decreases in receptor coupling to phospholipase C. Conservative substitutions of two residues in the C terminus of the third cytoplasmic loop (Ala293----Leu, Lys290----His) increased the potency of agonists for stimulating phosphatidylinositol metabolism by up to 2 orders of magnitude. These data indicate (i) that the regions of the alpha 1AR that determine coupling to phosphatidylinositol metabolism are similar to those previously shown to be involved in coupling of beta 2AR to adenylate cyclase stimulation and (ii) that point mutations of a G-protein-coupled receptor can cause remarkable increases in sensitivity of biological response.
Resumo:
The third wave of the National Congregations Study (NCS-III) was conducted in 2012. The 2012 General Social Survey asked respondents who attend religious services to name their religious congregation, producing a nationally representative cross-section of congregations from across the religious spectrum. Data about these congregations was collected via a 50-minute interview with one key informant from 1,331 congregations. Information was gathered about multiple aspects of congregations’ social composition, structure, activities, and programming. Approximately two-thirds of the NCS-III questionnaire replicates items from 1998 or 2006-07 NCS waves. Each congregation was geocoded, and selected data from the 2010 United States census or American Community Survey have been appended. We describe NCS-III methodology and use the cumulative NCS dataset (containing 4,071 cases) to describe five trends: more ethnic diversity, greater acceptance of gays and lesbians, increasingly informal worship styles, declining size (but not from the perspective of the average attendee), and declining denominational affiliation.
Resumo:
The number of studies examining visual perspective during retrieval has recently grown. However, the way in which perspective has been conceptualized differs across studies. Some studies have suggested perspective is experienced as either a first-person or a third-person perspective, whereas others have suggested both perspectives can be experienced during a single retrieval attempt. This aspect of perspective was examined across three studies, which used different measurement techniques commonly used in studies of perspective. Results suggest that individuals can experience more than one perspective when recalling events. Furthermore, the experience of the two perspectives correlated differentially with ratings of vividness, suggesting that the two perspectives should not be considered in opposition of one another. We also found evidence of a gender effect in the experience of perspective, with females experiencing third-person perspectives more often than males. Future studies should allow for the experience of more than one perspective during retrieval.
Resumo:
In 1938, in Düsseldorf, the Nazis put on an exhibit entitled "Entartete Musik” (degenerate music), which included composers on the basis of their “racial origins” (i.e. Jews), or because of the “modernist style” of their music. Performance, publication, broadcast, or sale of music by composers deemed “degenerate” was forbidden by law throughout the Third Reich. Among these composers were some of the most prominent composers of the first half of the twentieth-century. They included Stravinsky, Schoenberg, Webern, Berg, Mahler, Ernst Krenek, George Gershwin, Kurt Weill, Erwin Schulhoff, and others. The music of nineteenth-century composers of Jewish origin, such as Mendelssohn and Meyerbeer, was also officially proscribed. In each of the three recitals for this project, significant works were performed by composers who were included in this exhibition, namely, Mendelssohn, Webern, Berg, Weill, and Hans Gal. In addition, as an example of self-censorship, a work of Karl Amadeus Hartmann was included. Hartmann chose “internal exile” by refusing to allow performance of his works in Germany during the Nazi regime. One notable exception to the above categories was a work by Beethoven that was presented as a bellwether of the relationship between music and politics. The range of styles and genres in these three recitals indicates the degree to which Nazi musical censorship cut a wide swath across Europe’s musical life with devastating consequences for its music and culture.
Resumo:
Reviews of: [1] James E. Hoch, Semitic Words in Egyptian Texts of the New Kingdom and Third Intermediate Period, (1994), Princeton University Press. [2] Daniel Sivan and Zipora Cochavi-Rainey, West Semitic Vocabulary in Egyptian Script of the 14th to the 10th Centuries BCE, (1992), Ben-Gurion University of the Negev Press.
Resumo:
The paper deals with the determination of an optimal schedule for the so-called mixed shop problem when the makespan has to be minimized. In such a problem, some jobs have fixed machine orders (as in the job-shop), while the operations of the other jobs may be processed in arbitrary order (as in the open-shop). We prove binary NP-hardness of the preemptive problem with three machines and three jobs (two jobs have fixed machine orders and one may have an arbitrary machine order). We answer all other remaining open questions on the complexity status of mixed-shop problems with the makespan criterion by presenting different polynomial and pseudopolynomial algorithms.