Partition, independence, and population geography in Bengal

This study quantitatively explores the changing population geography in Bengal, with a particular focus on Partition in India in 1947 and Independence of Bangladesh in 1971. Based on decadal census data from 1901 to 2001 at the district level, this paper explores how trends in regional population growth evolved with such historical events. Following Redding and Sturm (2008), Differences-in-Differences estimation is also employed. Estimation results show that there were different shocks on both sides and from both events. In West Bengal, the change in the regional population trends occurred in 1947 and remained similar thereafter. On the other hand, in East Bengal, the population growth became statistically significant after 1971. Further robustness checks show that the impacts were not uniform with respect to the distance from the border. Overall analyses show that the emergence of the international border in Bengal had asymmetric impacts on both sides.

Independence in CLP Languages

Studying independence of goals has proven very useful in the context of logic programming. In particular, it has provided a formal basis for powerful automatic parallelization tools, since independence ensures that two goals may be evaluated in parallel while preserving correctness and eciency. We extend the concept of independence to constraint logic programs (CLP) and prove that it also ensures the correctness and eciency of the parallel evaluation of independent goals. Independence for CLP languages is more complex than for logic programming as search space preservation is necessary but no longer sucient for ensuring correctness and eciency. Two additional issues arise. The rst is that the cost of constraint solving may depend upon the order constraints are encountered. The second is the need to handle dynamic scheduling. We clarify these issues by proposing various types of search independence and constraint solver independence, and show how they can be combined to allow dierent optimizations, from parallelism to intelligent backtracking. Sucient conditions for independence which can be evaluated \a priori" at run-time are also proposed. Our study also yields new insights into independence in logic programming languages. In particular, we show that search space preservation is not only a sucient but also a necessary condition for ensuring correctness and eciency of parallel execution.

Exploiting goal independence in the analysis of logic programs

This paper illustrates the use of a top-down framework to obtain goal independent analyses of logic programs, a task which is usually associated with the bottom-up approach. While it is well known that the bottomup approach can be used, through the magic set transformation, for goal dependent analysis, it is less known that the top-down approach can be used for goal independent analysis. The paper describes two ways of doing the latter. We show how the results of a goal independent analysis can be used to speed up subsequent goal dependent analyses. However this speed-up may result in a loss of precisión. The influence of domain characteristics on this precisión is discussed and an experimental evaluation using a generic top-down analyzer is described.

Effectiveness of global analysis in strict independence-based automatic program parallelization

This paper presents a study of the effectiveness of global analysis in the parallelization of logic programs using strict independence. A number of well-known approximation domains are selected and tlieir usefulness for the application in hand is explained. Also, methods for using the information provided by such domains to improve parallelization are proposed. Local and global analyses are built using these domains and such analyses are embedded in a complete parallelizing compiler. Then, the performance of the domains (and the system in general) is assessed for this application through a number of experiments. We argüe that the results offer significant insight into the characteristics of these domains, the demands of the application, and the tradeoffs involved.

Independence in constraint logic programs

Studying independence of literals, variables, and substitutions has proven very useful in the context of logic programming (LP). Here we study independence in the broader context of constraint logic programming (CLP). We show that a naive extrapolation of the LP definitions of independence to CLP is unsatisfactory (in fact, wrong) for two reasons. First, because interaction between variables through constraints is more complex than in the case of logic programming. Second, in order to ensure the efUciency of several optimizations not only must independence of the search space be considered, but also an orthogonal issue - "independence of constraint solving." We clarify these issues by proposing various types of search independence and constraint solver independence, and show how they can be combined to allow different independence-related optimizations, from parallelism to intelligent backtracking. Sufficient conditions for independence which can be evaluated "a-priori" at run-time are also proposed. Our results suggest that independence, provided a suitable definition is chosen, is even more useful in CLP than in LP.

Independence and search space preservation in dynamically scheduled constraint logic languages

This paper performs a further generalization of the notion of independence in constraint logic programs to the context of constraint logic programs with dynamic scheduling. The complexity of this new environment made necessary to first formally define the relationship between independence and search space preservation in the context of CLP languages. In particular, we show that search space preservation is, in the context of CLP languages, not only a sufficient but also a necessary condition for ensuring that both the intended solutions and the number of transitions performed do not change. These results are then extended to dynamically scheduled languages and used as the basis for the extension of the concepts of independence. We also propose several a priori sufficient conditions for independence and also give correctness and efficiency results for parallel execution of constraint logic programs based on the proposed notions of independence.

Independence, Global analysis, and parallelism, in dinamically scheduled constraint logic programming.

El punto de vista de muchas otras aplicaciones que modifican las reglas de computación. En segundo lugar, y una vez generalizado el concepto de independencia, es necesario realizar un estudio exhaustivo de la efectividad de las herramientas de análisis en la tarea de la paralelizacion automática. Los resultados obtenidos de dicha evaluación permiten asegurar de forma empírica que la utilización de analizadores globales en la tarea de la paralelizacion automática es vital para la consecución de una paralelizarían efectiva. Por último, a la luz de los buenos resultados obtenidos sobre la efectividad de los analizadores de flujo globales basados en la interpretación abstracta, se presenta la generalización de las herramientas de análisis al contexto de los lenguajes lógicos restricciones y planificación dinámica.

The TRANSPLANTA collection of Arabidopsis lines: a resource for functional analysis of transcription factors based on their conditional overexpression.

Los factores de transcripción (FTs) son reguladores clave de la expresión génica en todos los organismos. En eucariotas los FTs con frecuencia están representados por miembros funcionalmente redundantes de familias génicas de gran tamaño. La sobreexpresión de FTs puede representar una herramienta para revelar las funciones biológicas de FTs redundantes en plantas; sin embargo, la sobreexpresión constitutiva de FTs con frecuencia conlleva diversos defectos en el desarrollo, impidiendo su caracterización funcional. Sin embargo, aproximaciones de sobreexpresión condicional podrían ayudar a solventar este problema. En el consorcio TRANSPLANTA, en el que participan varios laboratorios del CBGP, hemos generado una colección de líneas transgénicas de Arabidopsis, cada una de las cuales expresa un FT bajo el control de un promotor inducible por ?estradiol. Hasta el momento se han generado 1636 líneas homocigotas independientes que corresponden a 634 FTs diferentes, lo que representa una media de 2,6 líneas por cada FT. Como confirmación de la utilidad de esta herramienta, el tratamiento con ?estradiol de líneas que expresaban condicionalmente FTs provoca alteraciones fenotípicas tales como proliferación de pelos radiculares, senescencia inducida por oscuridad, acumulación de antocianinas y enanismo, y que corroboran fenotipos previamente descritos debidos a la sobreexpresión de dichos FTs. Rastreos realizados posteriormente con otras líneas TRANSPLANTA han permitido la identificación de FTs implicados en diferentes procesos biológicos de plantas, confirmando que la colección es una herramienta valiosa para la caracterización funcional de FTs. Las semillas de las líneas TRANSPLANTA han sido depositadas en el Nottingham Arabidopsis Stock Centre para su distribución posterior.

Conditional density approximations with mixtures of polynomials

Mixtures of polynomials (MoPs) are a non-parametric density estimation technique especially designed for hybrid Bayesian networks with continuous and discrete variables. Algorithms to learn one- and multi-dimensional (marginal) MoPs from data have recently been proposed. In this paper we introduce two methods for learning MoP approximations of conditional densities from data. Both approaches are based on learning MoP approximations of the joint density and the marginal density of the conditioning variables, but they differ as to how the MoP approximation of the quotient of the two densities is found. We illustrate and study the methods using data sampled from known parametric distributions, and we demonstrate their applicability by learning models based on real neuroscience data. Finally, we compare the performance of the proposed methods with an approach for learning mixtures of truncated basis functions (MoTBFs). The empirical results show that the proposed methods generally yield models that are comparable to or significantly better than those found using the MoTBF-based method.

The TRANSPLANTA collection of Arabidopsis lines: a resource for functional analysis of transcription factors based on their conditional over-expression

Transcription factors (TFs) are key regulators of gene expression in all organisms. In eukaryotes, TFs are often represented by functionally redundant members of large gene families. Overexpression might prove a means to unveil the biological functions of redundant TFs; however, constitutive overexpression of TFs frequently causes severe developmental defects, preventing their functional characterization. Conditional overexpression strategies help to overcome this problem. Here, we report on the TRANSPLANTA collection of Arabidopsis lines, each expressing one of 949 TFs under the control of a β–estradiol-inducible promoter. Thus far, 1636 independent homozygous lines, representing an average of 2.6 lines for every TF, have been produced for the inducible expression of 634 TFs. Along with a GUS-GFP reporter, randomly selected TRANSPLANTA lines were tested and confirmed for conditional transgene expression upon β–estradiol treatment. As a proof of concept for the exploitation of this resource, β–estradiol-induced proliferation of root hairs, dark-induced senescence, anthocyanin accumulation and dwarfism were observed in lines conditionally expressing full-length cDNAs encoding RHD6, WRKY22, MYB123/TT2 and MYB26, respectively, in agreement with previously reported phenotypes conferred by these TFs. Further screening performed with other TRANSPLANTA lines allowed the identification of TFs involved in different plant biological processes, illustrating that the collection is a powerful resource for the functional characterization of TFs. For instance, ANAC058 and a TINY/AP2 TF were identified as modulators of ABA-mediated germination potential, and RAP2.10/DEAR4 was identified as a regulator of cell death in the hypocotyl–root transition zone. Seeds of TRANSPLANTA lines have been deposited at the Nottingham Arabidopsis Stock Centre for further distribution.

Conditional switching of vascular endothelial growth factor (VEGF) expression in tumors: Induction of endothelial cell shedding and regression of hemangioblastoma-like vessels by VEGF withdrawal

We have recently shown that VEGF functions as a survival factor for newly formed vessels during developmental neovascularization, but is not required for maintenance of mature vessels. Reasoning that expanding tumors contain a significant fraction of newly formed and remodeling vessels, we examined whether abrupt withdrawal of VEGF will result in regression of preformed tumor vessels. Using a tetracycline-regulated VEGF expression system in xenografted C6 glioma cells, we showed that shutting off VEGF production leads to detachment of endothelial cells from the walls of preformed vessels and their subsequent death by apoptosis. Vascular collapse then leads to hemorrhages and extensive tumor necrosis. These results suggest that enforced withdrawal of vascular survival factors can be applied to target preformed tumor vasculature in established tumors. The system was also used to examine phenotypes resulting from over-expression of VEGF. When expression of the transfected VEGF cDNA was continuously “on,” tumors became hyper-vascularized with abnormally large vessels, presumably arising from excessive fusions. Tumors were significantly less necrotic, suggesting that necrosis in these tumors is the result of insufficient angiogenesis.