Acotaciones a la traducción de clásicos grecolatinos y modernos de José María Valverde

Este trabajo es un comentario a un diálogo-entrevista con José María Valverde (Valencia de Alcántara/Cáceres/1926-Barcelona, 1996), en su vertiente estrictamente traductora. La importancia del comentario estriba en el hecho de que muchas traducciones del eximio teórico de la literatura, poeta y traductor extremeño servirán, con el tiempo, de modelo de lengua y cultura. De ahí la importancia de leer en su contexto, reseñar y comentar sus opiniones. Así, pues en el trabajo se reproducen y se comentan hasta seis items: 1. Para traducir bien, hay que oír al autor original. 2. El traductor tiene que vivir de su trabajo. 3. En Italia se traduce bien. 4. Está por escribir una historia del sentido del humor. 5. Cuando no existe una tradición hay que inventarla. 6. Lo primero es hablar; después traducir.

El exilio leridano de los canónigos y diputados a Cortes liberales Francisco Martínez Marina y José Espiga Gadea

En el presente trabajo vamos a analizar la trayectoria política de dos canónigos, Francisco Martínez Marina y José Espiga y Gadea, partidarios del liberalismo en una época de cambios en la cual, cada uno a su manera, contribuyó a la construcción del Estado liberal constitucional español. Tras las Cortes de Cádiz, estos importantes pensadores fueron perseguidos por el absolutismo y compartieron estancia en la Catedral de Lérida, el seno de la cual abandonaron para participar en las Cortes del Trienio Liberal (1820­-1823)

The death receptor antagonist FAIM promotes neurite outgrowth by a mechanism that depends on ERK and NF-κB signaling

Fas apoptosis inhibitory molecule (FAIM) is a protein identified as an antagonist of Fas-induced cell death. We show that FAIM overexpression fails to rescue neurons from trophic factor deprivation, but exerts a marked neurite growth–promoting action in different neuronal systems. Whereas FAIM overexpression greatly enhanced neurite outgrowth from PC12 cells and sympathetic neurons grown with nerve growth factor (NGF), reduction of endogenous FAIM levels by RNAi decreased neurite outgrowth in these cells. FAIM overexpression promoted NF-κB activation, and blocking this activation by using a super-repressor IκBα or by carrying out experiments using cortical neurons from mice that lack the p65 NF-κB subunit prevented FAIM-induced neurite outgrowth. The effect of FAIM on neurite outgrowth was also blocked by inhibition of the Ras–ERK pathway. Finally, we show that FAIM interacts with both Trk and p75 neurotrophin receptor NGF receptors in a ligand-dependent manner. These results reveal a new function of FAIM in promoting neurite outgrowth by a mechanism involving activation of the Ras–ERK pathway and NF-κB.

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.

Automated monitoring of medical protocols: a secure and distributed architecture

The control of the right application of medical protocols is a key issue in hospital environments. For the automated monitoring of medical protocols, we need a domain-independent language for their representation and a fully, or semi, autonomous system that understands the protocols and supervises their application. In this paper we describe a specification language and a multi-agent system architecture for monitoring medical protocols. We model medical services in hospital environments as specialized domain agents and interpret a medical protocol as a negotiation process between agents. A medical service can be involved in multiple medical protocols, and so specialized domain agents are independent of negotiation processes and autonomous system agents perform monitoring tasks. We present the detailed architecture of the system agents and of an important domain agent, the database broker agent, that is responsible of obtaining relevant information about the clinical history of patients. We also describe how we tackle the problems of privacy, integrity and authentication during the process of exchanging information between agents.

The impact of balancing on problem hardness in a highly structured domain

Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in ourunderstanding of problem hardness, beyond standard worst-case complexity. We consider random problem distributions from a highly structured problem domain that generalizes the Quasigroup Completion problem (QCP) and Quasigroup with Holes (QWH), a widely used domain that captures the structure underlying a range of real-world applications. Our problem domain is also a generalization of the well-known Sudoku puz- zle: we consider Sudoku instances of arbitrary order, with the additional generalization that the block regions can have rectangular shape, in addition to the standard square shape. We evaluate the computational hardness of Generalized Sudoku instances, for different parameter settings. Our experimental hardness results show that we can generate instances that are considerably harder than QCP/QWH instances of the same size. More interestingly, we show the impact of different balancing strategies on problem hardness. We also provide insights into backbone variables in Generalized Sudoku instances and how they correlate to problem hardness.

On balanced CSPs with high treewidth

Tractable cases of the binary CSP are mainly divided in two classes: constraint language restrictions and constraint graph restrictions. To better understand and identify the hardest binary CSPs, in this work we propose methods to increase their hardness by increasing the balance of both the constraint language and the constraint graph. The balance of a constraint is increased by maximizing the number of domain elements with the same number of occurrences. The balance of the graph is defined using the classical definition from graph the- ory. In this sense we present two graph models; a first graph model that increases the balance of a graph maximizing the number of vertices with the same degree, and a second one that additionally increases the girth of the graph, because a high girth implies a high treewidth, an important parameter for binary CSPs hardness. Our results show that our more balanced graph models and constraints result in harder instances when compared to typical random binary CSP instances, by several orders of magnitude. Also we detect, at least for sparse constraint graphs, a higher treewidth for our graph models.

Generating hard SAT/CSP instances using expander graphs

In this paper we provide a new method to generate hard k-SAT instances. We incrementally construct a high girth bipartite incidence graph of the k-SAT instance. Having high girth assures high expansion for the graph, and high expansion implies high resolution width. We have extended this approach to generate hard n-ary CSP instances and we have also adapted this idea to increase the expansion of the system of linear equations used to generate XORSAT instances, being able to produce harder satisfiable instances than former generators.

How hard is a commercial puzzle: the eternity II challenge

Recently, edge matching puzzles, an NP-complete problem, have received, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing several generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques.

Edge matching puzzles as hard SAT/CSP benchmarks

Recently, edge matching puzzles, an NP-complete problem, have rececived, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing several generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques.

Sobre Euphorbia baetica Boiss.

Euphorbia baetica Boiss., Cent. Euphorb.: 36 (1860) = Tithymalus baeticus (Boiss.) Samp. in Anais Fac. Sci. Porto 17:46 (1931) = E. trinervia Boiss., Elench. Pl. Nov.: 82 (1838), non E. trinervia Schum., Beskr. Guin. pl.: 253 (1827)

Internet y Odontopediatría

Internet se ha convertido en instrumento útil para la difusión y acceso a información, así como para facilitar la comunicación. La Odontología debe aprovecharse de esta infraestructura de alcance mundial. En este artículo se expone el potencial de Internet en el campo de la Odontopediatría, mostrando un catálogo comentado y actualizado de los recursos multimedia (páginas WWW) y sugiere una visión del futuro de dicha especialidad en Internet.

Historical first descriptions of Cajal-Retzius cells: from pioneer studies to current knowledge

Santiago Ramón y Cajal developed a great body of scientific research during the last decade of 19th century, mainly between 1888 and 1892, when he published more than 30 manuscripts. The neuronal theory, the structure of dendrites and spines, and fine microscopic descriptions of numerous neural circuits are among these studies. In addition, numerous cell types (neuronal and glial) were described by Ramón y Cajal during this time using this 'reazione nera' or Golgi method. Among these neurons were the special cells of the molecular layer of the neocortex. These cells were also termed Cajal cells or Retzius cells by other colleagues. Today these cells are known as Cajal-Retzius cells. From the earliest description, several biological aspects of these fascinating cells have been analyzed (e.g., cell morphology, physiological properties, origin and cellular fate, putative function during cortical development, etc). In this review we will summarize in a temporal basis the emerging knowledge concerning this cell population with specific attention the pioneer studies of Santiago Ramón y Cajal.