Traducción comentada de Guidelines Governing the Adoption of Children, 2011 in India

En este trabajo se analiza la variación discursiva y los diferentes criterios de estilo entre textos jurídicos normativos en inglés y español; se establecen fenómenos lingüísticos propios del discurso jurídico que generan problemas de traducción; y se comparan algunas diferencias entre sistemas jurídicos y políticos para analizar su repercusión en la traducción.

Computational problems in perfect phylogeny haplotyping: Typing without calling the allele

A haplotype is an m-long binary vector. The XOR-genotype of two haplotypes is the m-vector of their coordinate-wise XOR. We study the following problem: Given a set of XOR-genotypes, reconstruct their haplotypes so that the set of resulting haplotypes can be mapped onto a perfect phylogeny (PP) tree. The question is motivated by studying population evolution in human genetics and is a variant of the PP haplotyping problem that has received intensive attention recently. Unlike the latter problem, in which the input is '' full '' genotypes, here, we assume less informative input and so may be more economical to obtain experimentally. Building on ideas of Gusfield, we show how to solve the problem in polynomial time by a reduction to the graph realization problem. The actual haplotypes are not uniquely determined by the tree they map onto and the tree itself may or may not be unique. We show that tree uniqueness implies uniquely determined haplotypes, up to inherent degrees of freedom, and give a sufficient condition for the uniqueness. To actually determine the haplotypes given the tree, additional information is necessary. We show that two or three full genotypes suffice to reconstruct all the haplotypes and present a linear algorithm for identifying those genotypes.

Equilibrium points and central configurations for the Lennard-Jones 2-and 3-body problems

Abstract. In this paper we study the relative equilibria and their stability for a system of three point particles moving under the action of a Lennard{Jones potential. A central con guration is a special position of the particles where the position and acceleration vectors of each particle are proportional, and the constant of proportionality is the same for all particles. Since the Lennard{Jones potential depends only on the mutual distances among the particles, it is invariant under rotations. In a rotating frame the orbits coming from central con gurations become equilibrium points, the relative equilibria. Due to the form of the potential, the relative equilibria depend on the size of the system, that is, depend strongly of the momentum of inertia I. In this work we characterize the relative equilibria, we nd the bifurcation values of I for which the number of relative equilibria is changing, we also analyze the stability of the relative equilibria.

A new heuristic method for solving spatially constrained forest planning problems based on mitigation of infeasibilities radiating outward from a forced choice

[Abstract]

Pediatric drug-related problems: a multicenter study in four French-speaking countries.

BACKGROUND: Pediatric intensive care patients represent a population at high risk for drug-related problems. There are few studies that compare the activity of clinical pharmacists between countries. OBJECTIVE: To describe the drug-related problems identified and interventions by four pharmacists in a pediatric cardiac and intensive care unit. SETTING: Four pediatric centers in France, Quebec, Switzerland and Belgium. METHOD: This was a six-month multicenter, descriptive and prospective study conducted from August 1, 2009 to January 31, 2010. Drug-related problems and clinical interventions were compiled from four pediatric centers in France, Quebec, Switzerland and Belgium. Data on patients, drugs, intervention, documentation, approval and estimated impact were compiled. MAIN OUTCOME MEASURE: Number and type of drug-related problems encountered in a large pediatric inpatient population. RESULTS: A total of 996 interventions were recorded: 238 (24 %) in France, 278 (28 %) in Quebec, 351 (35 %) in Switzerland and 129 (13 %) in Belgium. These interventions targeted 270 patients (median 21 months old, 53 % male): 88 (33 %) in France, 56 (21 %) in Quebec, 57 (21 %) in Switzerland and 69 (26 %) in Belgium. The main drug-related problems were inappropriate administration technique (29 %), untreated indication (25 %) and supra-therapeutic dose (11 %). The pharmacists' interventions were mostly optimizing the mode of administration (22 %), dose adjustment (20 %) and therapeutic monitoring (16 %). The two major drug classes that led to interventions were anti-infectives for systemic use (23 %) and digestive system and metabolism drugs (22 %). Interventions mainly involved residents and all clinical staff (21 %). Among the 878 (88 %) proposed interventions requiring physician approval, 860 (98 %) were accepted. CONCLUSION: This descriptive study illustrates drug-related problems and the ability of clinical pharmacists to identify and resolve them in pediatric intensive care units in four French-speaking countries.

First-passage and escape problems in the Feller process

The Feller process is an one-dimensional diffusion process with linear drift and state-dependent diffusion coefficient vanishing at the origin. The process is positive definite and it is this property along with its linear character that have made Feller process a convenient candidate for the modeling of a number of phenomena ranging from single-neuron firing to volatility of financial assets. While general properties of the process have long been well known, less known are properties related to level crossing such as the first-passage and the escape problems. In this work we thoroughly address these questions.

Axiomatization of the nucl eolus of assignment games

On the domain of general assignment games (with possible reservation prices) the core is axiomatized as the unique solution satisfying two consistency principles: projection consistency and derived consistency. Also, an axiomatic characterization of the nucleolus is given as the unique solution that satisfies derived consistency and equal maximum complaint between groups. As a consequence, we obtain a geometric characterization of the nucleolus. Maschler et al. (1979) provide a geometrical characterization for the intersection of the kernel and the core of a coalitional game, showing that those allocations that lie in both sets are always the midpoint of certain bargaining range between each pair of players. In the case of the assignment game, this means that the kernel can be determined as those core allocations where the maximum amount, that can be transferred without getting outside the core, from one agent to his / her optimally matched partner equals the maximum amount that he / she can receive from this partner, also remaining inside the core. We now prove that the nucleolus of the assignment game can be characterized by requiring this bisection property be satisfied not only for optimally matched pairs but also for optimally matched coalitions. Key words: cooperative games, assignment game, core, nucleolus

Odorant binding proteins of the red imported fire ant, Solenopsis invicta: an example of the problems facing the analysis of widely divergent proteins.

We describe the odorant binding proteins (OBPs) of the red imported fire ant, Solenopsis invicta, obtained from analyses of an EST library and separate 454 sequencing runs of two normalized cDNA libraries. We identified a total of 18 putative functional OBPs in this ant. A third of the fire ant OBPs are orthologs to honey bee OBPs. Another third of the OBPs belong to a lineage-specific expansion, which is a common feature of insect OBP evolution. Like other OBPs, the different fire ant OBPs share little sequence similarity (∼ 20%), rendering evolutionary analyses difficult. We discuss the resulting problems with sequence alignment, phylogenetic analysis, and tests of selection. As previously suggested, our results underscore the importance for careful exploration of the sensitivity to the effects of alignment methods for data comprising widely divergent sequences.

Local optima networks of hard combinatorial landscapes

Combinatorial optimization involves finding an optimal solution in a finite set of options; many everyday life problems are of this kind. However, the number of options grows exponentially with the size of the problem, such that an exhaustive search for the best solution is practically infeasible beyond a certain problem size. When efficient algorithms are not available, a practical approach to obtain an approximate solution to the problem at hand, is to start with an educated guess and gradually refine it until we have a good-enough solution. Roughly speaking, this is how local search heuristics work. These stochastic algorithms navigate the problem search space by iteratively turning the current solution into new candidate solutions, guiding the search towards better solutions. The search performance, therefore, depends on structural aspects of the search space, which in turn depend on the move operator being used to modify solutions. A common way to characterize the search space of a problem is through the study of its fitness landscape, a mathematical object comprising the space of all possible solutions, their value with respect to the optimization objective, and a relationship of neighborhood defined by the move operator. The landscape metaphor is used to explain the search dynamics as a sort of potential function. The concept is indeed similar to that of potential energy surfaces in physical chemistry. Borrowing ideas from that field, we propose to extend to combinatorial landscapes the notion of the inherent network formed by energy minima in energy landscapes. In our case, energy minima are the local optima of the combinatorial problem, and we explore several definitions for the network edges. At first, we perform an exhaustive sampling of local optima basins of attraction, and define weighted transitions between basins by accounting for all the possible ways of crossing the basins frontier via one random move. Then, we reduce the computational burden by only counting the chances of escaping a given basin via random kick moves that start at the local optimum. Finally, we approximate network edges from the search trajectory of simple search heuristics, mining the frequency and inter-arrival time with which the heuristic visits local optima. Through these methodologies, we build a weighted directed graph that provides a synthetic view of the whole landscape, and that we can characterize using the tools of complex networks science. We argue that the network characterization can advance our understanding of the structural and dynamical properties of hard combinatorial landscapes. We apply our approach to prototypical problems such as the Quadratic Assignment Problem, the NK model of rugged landscapes, and the Permutation Flow-shop Scheduling Problem. We show that some network metrics can differentiate problem classes, correlate with problem non-linearity, and predict problem hardness as measured from the performances of trajectory-based local search heuristics.

The Gaussian assumption in second-order estimation problems in digital communications

This paper deals with the goodness of the Gaussian assumption when designing second-order blind estimationmethods in the context of digital communications. The low- andhigh-signal-to-noise ratio (SNR) asymptotic performance of the maximum likelihood estimator—derived assuming Gaussiantransmitted symbols—is compared with the performance of the optimal second-order estimator, which exploits the actualdistribution of the discrete constellation. The asymptotic study concludes that the Gaussian assumption leads to the optimalsecond-order solution if the SNR is very low or if the symbols belong to a multilevel constellation such as quadrature-amplitudemodulation (QAM) or amplitude-phase-shift keying (APSK). On the other hand, the Gaussian assumption can yield importantlosses at high SNR if the transmitted symbols are drawn from a constant modulus constellation such as phase-shift keying (PSK)or continuous-phase modulations (CPM). These conclusions are illustrated for the problem of direction-of-arrival (DOA) estimation of multiple digitally-modulated signals.

A non-extensive maximum entropy based regulations method for bad conditioned inverse problems

A regularization method based on the non-extensive maximum entropy principle is devised. Special emphasis is given to the q=1/2 case. We show that, when the residual principle is considered as constraint, the q=1/2 generalized distribution of Tsallis yields a regularized solution for bad-conditioned problems. The so devised regularized distribution is endowed with a component which corresponds to the well known regularized solution of Tikhonov (1977).

More Money, Fewer Problems? Cross-Level Effects of Economic Deprivation on Political Representation

While equal political representation of all citizens is a fundamental democratic goal, it is hampered empirically in a multitude of ways. This study examines how the societal level of economic inequality affects the representation of relatively poor citizens by parties and governments. Using CSES survey data for citizens' policy preferences and expert placements of political parties, empirical evidence is found that in economically more unequal societies, the party system represents the preferences of relatively poor citizens worse than in more equal societies. This moderating effect of economic equality is also found for policy congruence between citizens and governments, albeit slightly less clear-cut.