Regenerating Bilbao: From "productive industries" to "productive services"

Producción CientíficaThis paper aims at analysing the maintenance, preservation, and (re)interpretation of the urban heritage of the industrial city of Bilbao (Spain). Particular attention will be paid to the effects of globalisation at the end of the xx century in Bilbao’s, the relationship between proposals and completed actions put forward by Bilbao’s strategic plan (Partial Territorial Plan), and their urban and socio-economic impacts on the city starting from the beginning of the 1990s. This work focuses on three of the most emblematic actions which have been carried out thus far in the Ria river territory to consider end discuss the treatment of the historical memory of the industrial legacy: the Abandoibarra’s abandoned shipyards, the Ametzola railway station, and eventually the Galindo River estuary. En italiano: Questo contributo analizza la gestione e la (re) interpretazione del patrimonio urbano della città di Bilbao (Spagna) e gli effetti della globalizzazione alla fine del xx secolo nel suo ambito urbano. Sarà prestata particolare attenzione al rapporto tra le proposte e le azioni completate del piano strategico di Bilbao (Piano territoriale parziale) e i suoi impatti socio-economici e urbani sulla città a partire dall’inizio degli anni ’90. Il saggio si concentra su tre delle azioni più emblematiche portate a termine ad oggi nel territorio fluviale per dimostrare come è stato impostato il trattamento della memoria storica dell’eredità industriale: le trasformazioni dei cantieri navali abbandonati di Abandoibarra, della stazione ferroviaria di Ametzola e infine dell’estuario del fiume Galindo.European Joint Doctorate “urbanHIST”. European Union. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 721933

Desarrollo turístico a largo plazo y políticas medioambientales: un análisis mediante técnicas de simulación.

Sin resume

An Eager Satisfiability Modulo Theories Solver for Algebraic Datatypes

Algebraic data types (ADTs) are a construct classically found in functional programming languages that capture data structures like enumerated types, lists, and trees. In recent years, interest in ADTs has increased. For example, popular programming languages, like Python, have added support for ADTs. Automated reasoning about ADTs can be done using satisfiability modulo theories (SMT) solving, an extension of the Boolean satisfiability problem with constraints over first-order structures. Unfortunately, SMT solvers that support ADTs do not scale as state-of-the-art approaches all use variations of the same \emph{lazy} approach. In this paper, we present an SMT solver that takes a fundamentally different approach, an \emph{eager} approach. Specifically, our solver reduces ADT queries to a simpler logical theory, uninterpreted functions (UF), and then uses an existing solver on the reduced query. We prove the soundness and completeness of our approach and demonstrate that it outperforms the state-of-theart on existing benchmarks, as well as a new, more challenging benchmark set from the planning domain

Coexistence of active and hydrodynamic turbulence in two dimensional active nematics

In active nematic liquid crystals, activity is able to drive chaotic spatiotemporal flows referred to as active turbulence. Active turbulence has been characterized through theoretical and experimental work as a low Reynolds number phenomenon. We show that, in two dimensions, the active forcing alone is able to trigger hydrodynamic turbulence leading to the coexistence of active and inertial turbulence. This type of flow develops for sufficiently active and extensile flow-aligning nematics. We observe that the combined effect of an extensile nematic and large values of the flow-aligning parameter leads to a broadening of the elastic energy spectrum that promotes a growth of kinetic energy able to trigger an inverse energy cascade

Proceso de atención de enfermería en una persona con infarto agudo al miocardio en áreas críticas

“En México, el Infarto Agudo al Miocardio (IAM) ocupa la primera causa de muerte en personas de 40-60 años con prevalencia en el género masculino, su letalidad radica en de 20 min a 4 horas en que ocurre el evento, la identificación de signos y síntomas, y la atención optima e inmediata es un desafío para las áreas críticas de los hospitales. Por lo que, para procurar la vida durante la atención de esta enfermedad, el profesional de salud que cuida de forma estrecha a este tipo de paciente como lo es enfermería, debe tener las competencias necesarias en salud. Una manera de realizar cuidados de calidad es a través del proceso de atención de enfermería con el cual se organizan las actividades de salud a realizar y optimizar la atención del paciente, con lo cual se garantiza un tratamiento efectivo e íntegro. Objetivo: Implementar un Proceso de Atención de Enfermería en un paciente con infarto agudo al miocardio durante su estancia en los servicios de urgencias, hemodinamia y unidad de cuidados intensivos de un Hospital de tercer nivel de atención del estado de Puebla, México.

MedleySolver: Online SMT Algorithm Selection

Satisfiability modulo theories (SMT) solvers implement a wide range of optimizations that are often tailored to a particular class of problems, and that differ significantly between solvers. As a result, one solver may solve a query quickly while another might be flummoxed completely. Predicting the performance of a given solver is difficult for users of SMT-driven applications, particularly when the problems they have to solve do not fall neatly into a well-understood category. In this paper, we propose an online algorithm selection framework for SMT called MedleySolver that predicts the relative performances of a set of SMT solvers on a given query, distributes time amongst the solvers, and deploys the solvers in sequence until a solution is obtained. We evaluate MedleySolver against the best available alternative, an offline learning technique, in terms of pure performance and practical usability for a typical SMT user. We find that with no prior training, MedleySolver solves 93.9% of the queries solved by the virtual best solver selector achieving 59.8% of the par-2 score of the most successful individual solver, which solves 87.3%. For comparison, the best available alternative takes longer to train than MedleySolver takes to solve our entire set of 2000 queries

Synthesis in Uclid5

We describe an integration of program synthesis into Uclid5, a formal modelling and verification tool. To the best of our knowledge, the new version of Uclid5 is the only tool that supports program synthesis with bounded model checking, k-induction, sequential program verification, and hyperproperty verification. We use the integration to generate 25 program synthesis benchmarks with simple, known solutions that are out of reach of current synthesis engines, and we release the benchmarks to the community

Genetic Algorithms for Searching a Matrix of Metagrammars for Synthesis

Syntax-guided synthesis is a paradigm in program synthesis in which the search space of candidate solutions is constrained by a syntactic template in the form of a grammar. These syntactic constraints serve two purposes: constraining the language to the space the user desires, but also rendering the search space tractable for the synthesizer. Given a well-written syntactic template, this is an extremely effective technique. However, this is highly dependent on the user providing such a template: a syntactic template that is too large results in a larger search space and slower synthesis, and a syntactic template that is too small may not contain the solution needed. In this work, we frame the space of syntactic templates as a matrix of rules, and demonstrate how this matrix can be searched effectively with little training data using simple search techniques such as genetic algorithms, giving improvements in both the number of benchmarks solved and solving time for the state-of-the-art synthesis solver.Comment: SYNT 2023, 4 Page