Transnational Marriage: Modern Imaginings, Relational Realignments, and Persistent Inequalities

In the context of shifting cultural anchors as well as unstable global economic conditions, new practices of intimacy and sexuality may become tactics in an individual’s negotiation of conflicting desires and potentials. This article offers reflection on the interface between global forces, powerful transcultural narratives, and state policies, on the one hand, and local, even individual, constructions and tactics in regard to sexuality, marriage, migration, and work, on the other. The article focuses on the life trajectory of Gudiya, an ambitious young Hindu woman who started out life with little social capital and few economic resources in a dusty corner of what was then the tiny kingdom of Nepal. Gudiya’s story highlights the ways in which she has engaged in relational realignments aimed at bringing her closer to the life she imagines, even as she has encountered new and persistent forms of inequality both local and transnational in scale.

Computer algebra for x-ray spectral reconstruction between 6 and 25 MV

A previously presented algorithm for the reconstruction of bremsstrahlung spectra from transmission data has been implemented into MATHEMATICA. Spectra vectorial algebra has been used to solve the matrix system A * F = T. The new implementation has been tested by reconstructing photon spectra from transmission data acquired in narrow beam conditions, for nominal energies of 6, 15, and 25 MV. The results were in excellent agreement with the original calculations. Our implementation has the advantage to be based on a well-tested mathematical kernel. Furthermore it offers a comfortable user interface.

A Process Model of Complementarity and Substitution of Contractual and Relational Governance in IS Outsourcing

This paper develops a process model of how and why complementarity and substitution form over time between contractual and relational governance in the context of information systems outsourcing. Our analysis identifies four distinct process patterns that explain this formation as the outcome of interaction processes between key elements of both contractual and relational governance. These patterns unveil the dynamic nature of complementarity and substitution. In particular, we show that the relationship between contractual and relational governance oscillates between complementarity and substitution. Those oscillations are triggered mainly by three types of contextual events (goal fuzziness, goal conflict, and goal misalignment). Surprisingly, substitution of informal control did not occur as an immediate reaction to external events but emerged as a consequence of preceding complementarity. Thus, our study challenges the prevailing view of an either/or dichotomy of complementarity and substitution by showing that they are causally connected over time.

THE INTERACTION BETWEEN INTERNAL AND EXTERNAL INFORMATION ON RELATIONAL DATA SEARCH

People often use tools to search for information. In order to improve the quality of an information search, it is important to understand how internal information, which is stored in user’s mind, and external information, represented by the interface of tools interact with each other. How information is distributed between internal and external representations significantly affects information search performance. However, few studies have examined the relationship between types of interface and types of search task in the context of information search. For a distributed information search task, how data are distributed, represented, and formatted significantly affects the user search performance in terms of response time and accuracy. Guided by UFuRT (User, Function, Representation, Task), a human-centered process, I propose a search model, task taxonomy. The model defines its relationship with other existing information models. The taxonomy clarifies the legitimate operations for each type of search task of relation data. Based on the model and taxonomy, I have also developed prototypes of interface for the search tasks of relational data. These prototypes were used for experiments. The experiments described in this study are of a within-subject design with a sample of 24 participants recruited from the graduate schools located in the Texas Medical Center. Participants performed one-dimensional nominal search tasks over nominal, ordinal, and ratio displays, and searched one-dimensional nominal, ordinal, interval, and ratio tasks over table and graph displays. Participants also performed the same task and display combination for twodimensional searches. Distributed cognition theory has been adopted as a theoretical framework for analyzing and predicting the search performance of relational data. It has been shown that the representation dimensions and data scales, as well as the search task types, are main factors in determining search efficiency and effectiveness. In particular, the more external representations used, the better search task performance, and the results suggest the ideal search performance occurs when the question type and corresponding data scale representation match. The implications of the study lie in contributing to the effective design of search interface for relational data, especially laboratory results, which are often used in healthcare activities.

Unconscious relational inference recruits the hippocampus

Relational inference denotes the capacity to encode, flexibly retrieve, and integrate multiple memories to combine past experiences to update knowledge and improve decision-making in new situations. Although relational inference is thought to depend on the hippocampus and consciousness, we now show in young, healthy men that it may occur outside consciousness but still recruits the hippocampus. In temporally distinct and unique subliminal episodes, we presented word pairs that either overlapped (“winter–red”, “red–computer”) or not. Effects of unconscious relational inference emerged in reaction times recorded during unconscious encoding and in the outcome of decisions made 1 min later at test, when participants judged the semantic relatedness of two supraliminal words. These words were either episodically related through a common word (“winter–computer” related through “red”) or unrelated. Hippocampal activity increased during the unconscious encoding of overlapping versus nonoverlapping word pairs and during the unconscious retrieval of episodically related versus unrelated words. Furthermore, hippocampal activity during unconscious encoding predicted the outcome of decisions made at test. Hence, unconscious inference may influence decision-making in new situations.

Unconscious relational encoding depends on hippocampus

Textbooks divide between human memory systems based on consciousness. Hippocampus is thought to support only conscious encoding, while neocortex supports both conscious and unconscious encoding. We tested whether processing modes, not consciousness, divide between memory systems in three neuroimaging experiments with 11 amnesic patients (mean age = 45.55 years, standard deviation = 8.74, range = 23-60) and 11 matched healthy control subjects. Examined processing modes were single item versus relational encoding with only relational encoding hypothesized to depend on hippocampus. Participants encoded and later retrieved either single words or new relations between words. Consciousness of encoding was excluded by subliminal (invisible) word presentation. Amnesic patients and controls performed equally well on the single item task activating prefrontal cortex. But only the controls succeeded on the relational task activating the hippocampus, while amnesic patients failed as a group. Hence, unconscious relational encoding, but not unconscious single item encoding, depended on hippocampus. Yet, three patients performed normally on unconscious relational encoding in spite of amnesia capitalizing on spared hippocampal tissue and connections to language cortex. This pattern of results suggests that processing modes divide between memory systems, while consciousness divides between levels of function within a memory system.

A feasible theory of truth over combinatory algebra

We define an applicative theory of truth TPT which proves totality exactly for the polynomial time computable functions. TPT has natural and simple axioms since nearly all its truth axioms are standard for truth theories over an applicative framework. The only exception is the axiom dealing with the word predicate. The truth predicate can only reflect elementhood in the words for terms that have smaller length than a given word. This makes it possible to achieve the very low proof-theoretic strength. Truth induction can be allowed without any constraints. For these reasons the system TPT has the high expressive power one expects from truth theories. It allows embeddings of feasible systems of explicit mathematics and bounded arithmetic. The proof that the theory TPT is feasible is not easy. It is not possible to apply a standard realisation approach. For this reason we develop a new realisation approach whose realisation functions work on directed acyclic graphs. In this way, we can express and manipulate realisation information more efficiently.

Exceptional or just well connected? Political entrepreneurs and brokers in policy making

Policy brokers and policy entrepreneurs are assumed to have a decisive impact on policy outcomes. Their access to social and political resources is contingent on their influence on other agents. In social network analysis (SNA), entrepreneurs are often closely associated with brokers, because both are agents presumed to benefit from bridging structural holes; for example, gaining advantage through occupying a strategic position in relational space. Our aim here is twofold. First, to conceptually and operationally differentiate policy brokers from policy entrepreneurs premised on assumptions in the policy-process literature; and second, via SNA, to use the output of core algorithms in a cross-sectional analysis of political brokerage and political entrepreneurship. We attempt to simplify the use of graph algebra in answering questions relevant to policy analysis by placing each algorithm within its theoretical context. In the methodology employed, we first identify actors and graph their relations of influence within a specific policy event; then we select the most central actors; and compare their rank in a series of statistics that capture different aspects of their network advantage. We examine betweenness centrality, positive and negative Bonacich power, Burt’s effective size and constraint and honest brokerage as paradigmatic. We employ two case studies to demonstrate the advantages and limitations of each algorithm for differentiating between brokers and entrepreneurs: one on Swiss climate policy and one on EU competition and transport policy.

Algebra of Classical Theoretical Term Reductions in the Sciences

An elementary algebra identifies conceptual and corresponding applicational limitations in John Kemeny and Paul Oppenheim’s (K-O) 1956 model of theoretical reduction in the sciences. The K-O model was once widely accepted, at least in spirit, but seems afterward to have been discredited, or in any event superceeded. Today, the K-O reduction model is seldom mentioned, except to clarify when a reduction in the Kemeny-Oppenheim sense is not intended. The present essay takes a fresh look at the basic mathematics of K-O comparative vocabulary theoretical term reductions, from historical and philosophical standpoints, as a contribution to the history of the philosophy of science. The K-O theoretical reduction model qualifies a theory replacement as a successful reduction when preconditions of explanatory adequacy and comparable systematicization are met, and there occur fewer numbers of theoretical terms identified as replicable syntax types in the most economical statement of a theory’s putative propositional truths, as compared with the theoretical term count for the theory it replaces. The challenge to the historical model developed here, to help explain its scope and limitations, involves the potential for equivocal theoretical meanings of multiple theoretical term tokens of the same syntactical type.