Ein Symposium der Forschung [Rezension] : Occident and Orient. Being Studies in Semitic Philology and Literature, Jewish History, Philosophy and Folklore in the widest sense. In Honour of Haham Dr. Gasters 80. Birthday ed. by Bruno Schindler and A. Marmorstein. Taylors Foreign Press, London 1937

-ss.

Relationships of impulsivity and physical fighting history to alcohol -induced aggression in women

Research suggests women respond to the aggression-inducing effects of alcohol in a manner similar to men. Highly aggressive men are more prone to alcohol-induced aggression, but this relationship is less clear for women. This study examined whether alcohol consumption would differentially affect laboratory-measured aggression in a sample of aggressive and non-aggressive women and how those differences might be related to components of impulsive behavior. In 39 women recruited from the community (two groups: with and without histories of physical fighting) ages 21–40, laboratory aggressive behavior was assessed following placebo and 0.80 g/kg alcohol consumption (all women experienced both conditions). Baseline laboratory impulsive behavior of three impulsivity models was later assessed in the same women. In the aggression model (PSAP), participants were provoked by periodic subtractions of money, which were blamed on a fictitious partner. Aggression was operationalized as the responses the participant made to subtract money from that partner. The three components of impulsivity that were tested included: (1) response initiation (IMT/DMT), premature responses made prior to the completion of stimulus processing, (2) response inhibition (GoStop), a failure to inhibit an already initiated response, and (3) consequence sensitivity (SKIP and TCIP), the choice for a smaller-sooner reward over a larger-later reward. I hypothesized that, compared to women with no history of physical fighting, women with a history of physical fighting would exhibit higher rates of alcohol-induced laboratory aggression and higher rates of baseline impulsive responding (particularly for the IMT/DMT), which would also be related to the alcohol-induced increases aggression. Consistent with studies in men, the aggressive women showed strong associations between laboratory aggression and self-report measures, while the non-aggressive women did not. However, unlike men, following alcohol consumption it was the non-aggressive women's laboratory aggression that was related to their self-reports of aggression and impulsivity. Additionally, response initiation measures of impulsivity distinguished the two groups, while response inhibition and consequence sensitivity measures did not; commission error rates on the IMT/DMT were higher in the aggressive women compared to the non-aggressive women. Regression analyses of the behavioral measures showed no relationship between the aggression and impulsivity performance of the two groups. These results suggest that the behavioral (and potentially biological) mechanism underlying aggressive behavior of women is different than that of men. ^

Relating data—parallelism and (and—) parallelism in logic programs

Much work has been done in the áreas of and-parallelism and data parallelism in Logic Programs. Such work has proceeded to a certain extent in an independent fashion. Both types of parallelism offer advantages and disadvantages. Traditional (and-) parallel models offer generality, being able to exploit parallelism in a large class of programs (including that exploited by data parallelism techniques). Data parallelism techniques on the other hand offer increased performance for a restricted class of programs. The thesis of this paper is that these two forms of parallelism are not fundamentally different and that relating them opens the possibility of obtaining the advantages of both within the same system. Some relevant issues are discussed and solutions proposed. The discussion is illustrated through visualizations of actual parallel executions implementing the ideas proposed.

Strict and non-strict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions.

This paper presents some fundamental properties of independent and-parallelism and extends its applicability by enlarging the class of goals eligible for parallel execution. A simple model of (independent) and-parallel execution is proposed and issues of correctness and efficiency discussed in the light of this model. Two conditions, "strict" and "non-strict" independence, are defined and then proved sufficient to ensure correctness and efñciency of parallel execution: if goals which meet these conditions are executed in parallel the solutions obtained are the same as those produced by standard sequential execution. Also, in absence of failure, the parallel proof procedure does not genérate any additional work (with respect to standard SLD-resolution) while the actual execution time is reduced. Finally, in case of failure of any of the goals no slow down will occur. For strict independence the results are shown to hold independently of whether the parallel goals execute in the same environment or in sepárate environments. In addition, a formal basis is given for the automatic compile-time generation of independent and-parallelism: compile-time conditions to efficiently check goal independence at run-time are proposed and proved sufficient. Also, rules are given for constructing simpler conditions if information regarding the binding context of the goals to be executed in parallel is available to the compiler.

Annotation algorithms for unrestricted independent and-parallelism in logic programs

We present two new algorithms which perform automatic parallelization via source-to-source transformations. The objective is to exploit goal-level, unrestricted independent and-parallelism. The proposed algorithms use as targets new parallel execution primitives which are simpler and more flexible than the well-known &/2 parallel operator. This makes it possible to genérate better parallel expressions by exposing more potential parallelism among the literals of a clause than is possible with &/2. The difference between the two algorithms stems from whether the order of the solutions obtained is preserved or not. We also report on a preliminary evaluation of an implementation of our approach. We compare the performance obtained to that of previous annotation algorithms and show that relevant improvements can be obtained.

On the correctness and efficiency of independent and-parallelism in logic programs

This paper presents and proves some fundamental results for independent and-parallelism (IAP). First, the paper treats the issues of correctness and efficiency: after defining strict and non-strict goal independence, it is proved that if strictly independent goals are executed in parallel the solutions obtained are the same as those produced by standard sequential execution. It is also shown that, in the absence of failure, the parallel proof procedure doesn't genérate any additional work (with respect to standard SLDresolution) while the actual execution time is reduced. The same results hold even if non-strictly independent goals are executed in parallel, provided a trivial rewriting of such goals is performed. In addition, and most importantly, treats the issue of compile-time generation of IAP by proposing conditions, to be written at compile-time, to efficiently check strict and non-strict goal independence at run-time and proving the sufficiency of such conditions. It is also shown how simpler conditions can be constructed if some information regarding the binding context of the goals to be executed in parallel is available to the compiler trough either local or program-level analysis. These results therefore provide a formal basis for the automatic compile-time generation of IAP. As a corollary of such results, the paper also proves that negative goals are always non-strictly independent, and that goals which share a first occurrence of an existential variable are never independent.

Estrategias Avanzadas de Tabulación y Paralelismo en Programas Lógicos = Advanced Evaluation Strategies for Tabling and Parallelism in Logic Programs

Dentro de los paradigmas de programación en el mundo de la informática tenemos la "Programación Lógica'', cuyo principal exponente es el lenguaje Prolog. Los programas Prolog se componen de un conjunto de predicados, cada uno de ellos definido en base a reglas que aportan un elevado nivel de abstracción y declaratividad al programador. Sin embargo, las formulación con reglas implica, frecuentemente, que un predicado se recompute varias veces para la misma consulta y además, Prolog utiliza un orden fijo para evaluar reglas y objetivos (evaluación SLD) que puede entrar en "bucles infinitos'' cuando ejecuta reglas recursivas declarativamente correctas. Estas limitaciones son atacadas de raiz por la tabulación, que se basa en "recordar'' en una tabla las llamadas realizadas y sus soluciones. Así, en caso de repetir una llamada tendríamos ya disponibles sus soluciones y evitamos la recomputación. También evita "bucles infinitos'' ya que las llamadas que los generan son suspendidas, quedando a la espera de que se computen soluciones para las mismas. La implementación de la tabulación no es sencilla. En particular, necesita de tres operaciones que no pueden ser ejecutadas en tiempo constante simultáneamente. Dichas operaciones son: suspensión de llamadas, relanzamiento de llamadas y {acceso a variables. La primera parte de la tesis compara tres implementaciones de tabulación sobre Ciao, cada una de las cuales penaliza una de estas operaciones. Por tanto, cada solución tiene sus ventajas y sus inconvenientes y se comportan mejor o peor dependiendo del programa ejecutado. La segunda parte de la tesis mejora la funcionalidad de la tabulación para combinarla con restricciones y también para evitar computaciones innecesarias. La programación con restricciones permite la resolución de ecuaciones como medio de programar, mecanismo altamente declarativo. Hemos desarrollado un framework para combinar la tabulación con las restricciones, priorizando objetivos como la flexibilidad, la eficiencia y la generalidad de nuestra solución, obteniendo una sinergia entre ambas técnicas que puede ser aplicada en numerosas aplicaciones. Por otra parte, un aspecto fundamental de la tabulación hace referencia al momento en que se retornan las soluciones de una llamada tabulada. Local evaluation devuelve soluciones cuando todas las soluciones de la llamada tabulada han sido computadas. Por contra, batched evaluation devuelve las soluciones una a una conforme van siendo computadas, por lo que se adapta mejor a problemas donde no nos interesa encontrar todas las soluciones. Sin embargo, su consumo de memoria es exponencialmente peor que el de local evaluation. La tesis presenta swapping evaluation, que devuelve soluciones tan pronto como son computadas pero con un consumo de memoria similar a la de local evaluation. Además, se implementan operadores de poda, once/1, para descartar la búsqueda de soluciones alternativas cuando encontramos la solución deseada. Por último, Prolog adopta con relativa facilidad soluciones para paralelismo gracias a su flexibilidad en el control de la ejecución y a que sus asignaciones son lógicas. La tercera parte de la tesis extiende el paralelismo conjuntivo de Ciao para trabajar con programas no deterministas, lo que presenta dos problemas principales: los objetivos atrapados y la recomputación de objetivos. Las soluciones clásicas para los objetivos atrapados rompían muchos invariantes de la ejecución Prolog, siendo soluciones difíciles de mantener y de extender, que la experiencia nos dice que han caído en desuso. Nosotros proponemos una solución modular (basada en la implementación de swapping evaluation), localizada y que no rompe los invariantes de la ejecución Prolog, pero que mantiene un alto rendimiento de la ejecución paralela. En referencia a la recomputación de objetivos paralelos en presencia de no determinismo hemos adaptado ténicas derivadas de la tabulación para memorizar computaciones de estos objetivos y evitar su recomputación.

Automatic unrestricted independent and-parallelism in logic programs

We present new algorithms which perform automatic parallelization via source-to-source transformations. The objective is to exploit goal-level, unrestricted independent andparallelism. The proposed algorithms use as targets new parallel execution primitives which are simpler and more flexible than the well-known &/2 parallel operator, which makes it possible to generate better parallel expressions by exposing more potential parallelism among the literals of a clause than is possible with &/2. The main differences between the algorithms stem from whether the order of the solutions obtained is preserved or not, and on the use of determinacy information. We briefly describe the environment where the algorithms have been implemented and the runtime platform in which the parallelized programs are executed. We also report on an evaluation of an implementation of our approach. We compare the performance obtained to that of previous annotation algorithms and show that relevant improvements can be obtained.

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.

Catalogue of type specimens in the Walker Museum of Paleontology and Chicago Natural History Museum: Radiolaria and Eurypterida / Matthew H. Nitecki, Walker Museum of Paleontology, University of Chicago. [Edited by Lillian A. Ross]

v.13:no.3(1963)

Tracking evolutionary paths in colonizing events temporal changes in life-history traits, microsatellites and inversions in Drosophila subobscura

Tese de doutoramento, Biologia (Biologia Evolutiva), Universidade de Lisboa, Faculdade de Ciências, 2016

Aristotelian predicables, universality and realism: the logic of comparison in topics as denying the view that Aristotle was a realist

Aristotle is reportedly held to have been a Moderate Realist in that he would maintain that a concept derives from an act of grasping a mind-independent universal object that exists somehow inside of the many different things which the concept is predicated of. As far as a universal is independent of mind, it would stand for the proper object of a concept that subsumes a given number of things as its own instantiations. But we claim that Aristotle rejected such a view and instead did perceive and comprehend universality as a feature of thought rather than as a feature of reality in its own right. As showed in the chapters of Topics regarding the so-called logic of comparison (with the support of Albert the Great’s commentary), each predicate can be more or less consistent with the attribute of the subject of which it may be predicated. Both essential and accidental attributes assume a definite degree of being related to the degree of belonging to substance. Unlike particular things, the universality of a concept is to be understood always in comparison with another concept according to a hierarchy of predicates in terms of universality degree arranged by comparative terms such as ‘more’, ‘less’, and ‘likewise’. What is really mind-independent are the truth conditions which make a universal true when exclusively referring to a set of things identically meant by the same predicate whose universality is given by the place occupied in the hierarchy of predicates.

Can the new refugee relocation system work? Perils in the Dublin logic and flawed reception conditions in the EU. CEPS Policy Brief No. 332, October 2015 Thursday, 1 October 2015

This Policy Brief argues that the newly adopted EU temporary relocation (quota) system constitutes a welcome yet timid step forward in addressing a number of central controversies of the current refugee debate in Europe. Two main challenges affect the effective operability of the new EU relocation model. First, EU member states’ asylum systems show profound (on-the-ground) weaknesses in reception conditions and judicial/administrative capacities. These prevent a fair and humane processing of asylum applications. EU states are not implementing the common standards enshrined in the EU reception conditions Directive 2013/33. Second, the new relocation system constitutes a move away from the much-criticised Dublin system, but it is still anchored to its premises. The Dublin system is driven by an unfair and unsustainable rule according to which the first EU state of entry is responsible for assessing asylum applications. It does not properly consider the personal, private and family circumstances or the preferences of asylum-seekers. Policy Recommendations In order to respond to these challenges, the Policy Brief offers the following policy recommendations: The EU should strengthen and better enforce member states’ reception capacities, abolish the current Dublin system rule of allocation of responsibility and expand the new relocation distribution criteria to include in the assessment (as far as possible) asylum-seekers’ preferences and personal/family links to EU member states. EU member countries should give priority to boosting their current and forward-looking administrative and judicial capacities to deal and welcome asylum applications. The EU should establish a permanent common European border and asylum service focused on ensuring the highest standards through stable operational support, institutional solidarity across all EU external borders and the practical implementation of new distribution relocation criteria.