Genetic origin of the relationship between parental negativity and behavior problems from early childhood to adolescence: A longitudinal genetically sensitive study.

Little is known about how genetic and environmental factors contribute to the association between parental negativity and behavior problems from early childhood to adolescence. The current study fitted a cross-lagged model in a sample consisting of 4,075 twin pairs to explore (a) the role of genetic and environmental factors in the relationship between parental negativity and behavior problems from age 4 to age 12, (b) whether parent-driven and child-driven processes independently explain the association, and (c) whether there are sex differences in this relationship. Both phenotypes showed substantial genetic influence at both ages. The concurrent overlap between them was mainly accounted for by genetic factors. Causal pathways representing stability of the phenotypes and parent-driven and child-driven effects significantly and independently account for the association. Significant but slight differences were found between males and females for parent-driven effects. These results were highly similar when general cognitive ability was added as a covariate. In summary, the longitudinal association between parental negativity and behavior problems seems to be bidirectional and mainly accounted for by genetic factors. Furthermore, child-driven effects were mainly genetically mediated, and parent-driven effects were a function of both genetic and shared-environmental factors.

A parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics

This paper discusses the use of probabilistic or randomized algorithms for solving combinatorial optimization problems. Our approach employs non-uniform probability distributions to add a biased random behavior to classical heuristics so a large set of alternative good solutions can be quickly obtained in a natural way and without complex conguration processes. This procedure is especially useful in problems where properties such as non-smoothness or non-convexity lead to a highly irregular solution space, for which the traditional optimization methods, both of exact and approximate nature, may fail to reach their full potential. The results obtained are promising enough to suggest that randomizing classical heuristics is a powerful method that can be successfully applied in a variety of cases.

Exploiting fitness distance correlation of set covering problems

The set covering problem is an NP-hard combinatorial optimization problemthat arises in applications ranging from crew scheduling in airlines todriver scheduling in public mass transport. In this paper we analyze searchspace characteristics of a widely used set of benchmark instances throughan analysis of the fitness-distance correlation. This analysis shows thatthere exist several classes of set covering instances that have a largelydifferent behavior. For instances with high fitness distance correlation,we propose new ways of generating core problems and analyze the performanceof algorithms exploiting these core problems.

A qualitative study of the impact of electronic journals on scholarly information behavior

A qualitative study of the impact of electronic journals on the information behavior of academics at Catalan universities shows that academics now read more, and more widely. However, their reading is becoming more superficial; they are compelled to improve their discrimination skills in order to decide what to read in more depth. The electronic accessibility of journals means that academics now make fewer library visits. Web browsing and TOC e-mail alerts are replacing physical browsing, and searching is a very popular option for keeping up to date with developments. Internet search engines, especially Google and Google Scholar, are becoming important sources of information for academics. However, they face problems in managing their personal scientific information.

Internal and external fluctuations around nonequilibrium steady states in one-dimensional heat-conduction problems

Thermal fluctuations around inhomogeneous nonequilibrium steady states of one-dimensional rigid heat conductors are analyzed in the framework of generalized fluctuating hydrodynamics. The effect of an external source of noise is also considered. External fluctuations come from temperature and position fluctuations of the source. Contributions of each kind of noise to the temperature correlation function are computed and compared through the study of its asymptotic behavior.

Exact long-time behavior of a network of oscillators under random fields

We present an exact solution for the order parameters that characterize the stationary behavior of a population of Kuramotos phase oscillators under random external fields [Y. Kuramoto, in International Symposium on Mathematical Problems in Theoretical Physics, Lecture Notes in Physics, Vol. 39 (Springer, Berlin, 1975), p. 420]. From these results it is possible to generate the phase diagram of models with an arbitrary distribution of random frequencies and random fields.

Generating highly balanced sudoku problems as hard problems

Sudoku problems are some of the most known and enjoyed pastimes, with a never diminishing popularity, but, for the last few years those problems have gone from an entertainment to an interesting research area, a twofold interesting area, in fact. On the one side Sudoku problems, being a variant of Gerechte Designs and Latin Squares, are being actively used for experimental design, as in [8, 44, 39, 9]. On the other hand, Sudoku problems, as simple as they seem, are really hard structured combinatorial search problems, and thanks to their characteristics and behavior, they can be used as benchmark problems for refining and testing solving algorithms and approaches. Also, thanks to their high inner structure, their study can contribute more than studies of random problems to our goal of solving real-world problems and applications and understanding problem characteristics that make them hard to solve. In this work we use two techniques for solving and modeling Sudoku problems, namely, Constraint Satisfaction Problem (CSP) and Satisfiability Problem (SAT) approaches. To this effect we define the Generalized Sudoku Problem (GSP), where regions can be of rectangular shape, problems can be of any order, and solution existence is not guaranteed. With respect to the worst-case complexity, we prove that GSP with block regions of m rows and n columns with m = n is NP-complete. For studying the empirical hardness of GSP, we define a series of instance generators, that differ in the balancing level they guarantee between the constraints of the problem, by finely controlling how the holes are distributed in the cells of the GSP. Experimentally, we show that the more balanced are the constraints, the higher the complexity of solving the GSP instances, and that GSP is harder than the Quasigroup Completion Problem (QCP), a problem generalized by GSP. Finally, we provide a study of the correlation between backbone variables – variables with the same value in all the solutions of an instance– and hardness of GSP.

Intermediate asymptotics beyond homogeneity and self-similarity: long time behavior for [formula]

"Vegeu el resum a l'inici del document del fitxer adjunt."

Consumers' behavior and the Bertrand paradox: an ACE approach

We analyze the classical Bertrand model when consumers exhibit some strategic behavior in deciding from which seller they will buy. We use two related but different tools. Both consider a probabilistic learning (or evolutionary) mechanism, and in the two of them consumers' behavior in uences the competition between the sellers. The results obtained show that, in general, developing some sort of loyalty is a good strategy for the buyers as it works in their best interest. First, we consider a learning procedure described by a deterministic dynamic system and, using strong simplifying assumptions, we can produce a description of the process behavior. Second, we use nite automata to represent the strategies played by the agents and an adaptive process based on genetic algorithms to simulate the stochastic process of learning. By doing so we can relax some of the strong assumptions used in the rst approach and still obtain the same basic results. It is suggested that the limitations of the rst approach (analytical) provide a good motivation for the second approach (Agent-Based). Indeed, although both approaches address the same problem, the use of Agent-Based computational techniques allows us to relax hypothesis and overcome the limitations of the analytical approach.

The behavior of money velocity in low and high inflation countries

This paper presents a general equilibrium model of money demand where the velocity of money changes in response to endogenous fluctuations in the interest rate. The parameter space can be divided into two subsets: one where velocity is constant as in standard cash-in-advance models, and another one where velocity fluctuates as in Baumol (1952). The model provides an explanation of why, for a sample of 79 countries, the correlation between the velocity of money and the inflation rate appears to be low, unlike common wisdom would suggest. The reason is the diverse transaction technologies available in different economies.

Resource-monotonicity for house allocation problems

We study a simple model of assigning indivisible objects (e.g., houses, jobs, offices, etc.) to agents. Each agent receives at most one object and monetary compensations are not possible. We completely describe all rules satisfying efficiency and resource-monotonicity. The characterized rules assign the objects in a sequence of steps such that at each step there is either a dictator or two agents "trade" objects from their hierarchically specified "endowments."