El proceso contra Jato Tello (Vitoria 1485): ¿Error judicial o empleo de la justicia penal en la política antijudía?

[ES]El objeto de este artículo es saber hasta qué punto pudo emplearse la justicia penal como un instrumento más de la política de carácter antijudío desarrollada por las autoridades cristianas de la España medieval a finales del siglo XV, concretamente en los momentos previos a la expulsión. Para indagar sobre esta cuestión se tendrá presente el proceso penal por blasfemia al que fue sometido el judío de Vitoria (Álava) Jato Tello.

Tracking the evolution of waste recycling research using overlay maps of science

Tracking the evolution of research in waste recycling science (WRS) can be valuable for environmental agencies, as well as for recycling businesses. Maps of science are visual, easily readable representations of the cognitive structure of a branch of science, a particular area of research or the global spectrum of scientific production. They are generally built upon evidence collected from reliable sources of information, such as patent and scientific publication databases. This study uses the methodology developed by Rafols et al. (2010) to make a “double overlay map” of WRS upon a basemap reflecting the cognitive structure of all journal-published science, for the years 2005 and 2010. The analysis has taken into account the cognitive areas where WRS articles are published and the areas from where it takes its intellectual nourishing, paying special attention to the growing trends of the key areas. Interpretation of results lead to the conclusion that extraction of energy from waste will probably be an important research topic in the future, along with developments in general chemistry and chemical engineering oriented to the recovery of valuable materials from waste. Agricultural and material sciences, together with the combined economics, politics and geography field, are areas with which WRS shows a relevant and ever increasing cognitive relationship.

El vino de los héroes homéricos

(ES) El vino tiene un importante papel en el mundo idealizado de los héroes homéricos. El poeta ofrece las primeras descripciones de vinos griegos, principalmente procedentes del norte del Egeo, situándolos en contextos muy variados, como centro del banquete, bebida reconstituyente, elemento imprescindible en plegarias y juramentos e incluso símbolo de honor que distingue a los personajes más destacados.

Parodia épica y gastronomía: el Ἀττικὸν Δεῖπνον de Matrón de Pítane

[ES] En la antigua Grecia existió una floreciente literatura de tema gastronómico, poco conocida porque sólo se ha conservado una pequeña parte de ella. Uno de los escasos ejemplos que conservamos es el Ἀττικὸν Δεῖπνον de Matrón de Pítane, que, por medio de la parodia de los poemas homéricos, describe un pantagruélico banquete en el que predominan los platos de pescado. El anfitrión, los comensales, incluso los alimentos servidos adoptan las maneras de los héroes y los dioses, creándose un profundo contraste entre la forma seria y el contenido ligero, con el único propósito de divertir.

On Bounded Strictly Positive Operators of Closed Range and Some Applications to Asymptotic Hyperstability of Dynamic Systems

The problem discussed is the stability of two input-output feedforward and feedback relations, under an integral-type constraint defining an admissible class of feedback controllers. Sufficiency-type conditions are given for the positive, bounded and of closed range feed-forward operator to be strictly positive and then boundedly invertible, with its existing inverse being also a strictly positive operator. The general formalism is first established and the linked to properties of some typical contractive and pseudocontractive mappings while some real-world applications and links of the above formalism to asymptotic hyperstability of dynamic systems are discussed later on.

Effective and Robust Generalized Predictive Speed Control of Induction Motor

14 p.

Valuing a Natura 2000 network site to inform land use options using a discrete choice experiment: An illustration from the Basque Country

One of the main problems that public institutions face in the management of protected areas, such as the European Natura 2000 network, is determining how to design and implement sustainable management plans that account for the wide range of marketed and non-marketed benefits they provide to society. This paper presents an application of a stated preference valuation approach aimed at evaluating the social preferences of the population of the Basque Country, Spain, for the key attributes of a regional Natura 2000 network site. According to our results, individuals’ willingness-to-pay (WTP) is higher for attributes associated with non-use values (native tree species and biodiversity conservation) than for attributes associated with use values (agricultural development and commercial forestry). The paper concludes that management policies related to Natura 2000 network sites should account for both for the importance of non-use values and the heterogeneity of the population's preferences in order to minimize potential land use conflicts.

Kontrol esparruan ikasketa eta garapenerako oinarrizko ingurune praktiko, ireki eta askea

Embedded system design (VHDL description) based on Xilinx's Spartan3E Development Kit to perform real-time PID control and monitoring of DC motors.

Envejecimiento, caserío y atención social: la familia asume el cuidado del mayor

[ES] La desestructuración familiar que en España ha supuesto un éxodo rural intensivo queda en evidencia varias décadas después, una vez que la población que decidió continuar residiendo en el medio rural ha envejecido. El anciano que habita en el medio rural carece a menudo del apoyo familiar necesario para hacer frente a las barreras físicas y sociales que la edad y el aislamiento le imponen mientras los servicios públicos no se adecúan a los caracteres propios de este medio. El habitante del caserío vasco, dada la proximidad del medio urbano, ha sufrido en menor medida las consecuencias del éxodo rural, manteniéndose más íntegra la red de apoyo familiar o, en todo caso, viéndose completada con la presencia del que acudió al medio urbano. Como consecuencia, es la familia la que asume el cuidado del mayor, cumpliendo éste su deseo de residir en casa hasta el final de su vida.

用于多无人机编队飞行的PIDA+逆飞行控制器

设计了一种结合PIDA控制及逆控制的多无人机编队飞行控制器.分析了多无人机编队飞行中飞行耦合气流的估计范围,针对个体无人机的轨迹控制模型讨论了其飞行控制器需求,结合逆控制的解耦性能和PIDA控制器低模型依赖、简单结构、快速性等优点,设计了一种PIDA+逆的飞行控制器,最后,以控制器输出约束、飞行气动力参数变化以及气动耦合扰动为指标对PID控制和PIDA+逆控制的控制效果进行了对比仿真,仿真结果表明,PIDA十逆控制能够有效的抑制模型参数不确定性带来的影响,并且在控制器输出约束条件下仍能保持较好的动态性、准确性和鲁棒性.

Design, specification, and synthesis of aircraft electric power systems control logic

Cyber-physical systems integrate computation, networking, and physical processes. Substantial research challenges exist in the design and verification of such large-scale, distributed sensing, ac- tuation, and control systems. Rapidly improving technology and recent advances in control theory, networked systems, and computer science give us the opportunity to drastically improve our approach to integrated flow of information and cooperative behavior. Current systems rely on text-based spec- ifications and manual design. Using new technology advances, we can create easier, more efficient, and cheaper ways of developing these control systems. This thesis will focus on design considera- tions for system topologies, ways to formally and automatically specify requirements, and methods to synthesize reactive control protocols, all within the context of an aircraft electric power system as a representative application area.

This thesis consists of three complementary parts: synthesis, specification, and design. The first section focuses on the synthesis of central and distributed reactive controllers for an aircraft elec- tric power system. This approach incorporates methodologies from computer science and control. The resulting controllers are correct by construction with respect to system requirements, which are formulated using the specification language of linear temporal logic (LTL). The second section addresses how to formally specify requirements and introduces a domain-specific language for electric power systems. A software tool automatically converts high-level requirements into LTL and synthesizes a controller.

The final sections focus on design space exploration. A design methodology is proposed that uses mixed-integer linear programming to obtain candidate topologies, which are then used to synthesize controllers. The discrete-time control logic is then verified in real-time by two methods: hardware and simulation. Finally, the problem of partial observability and dynamic state estimation is ex- plored. Given a set placement of sensors on an electric power system, measurements from these sensors can be used in conjunction with control logic to infer the state of the system.

Distributed optimization in power networks and general multi-agent systems

The dissertation studies the general area of complex networked systems that consist of interconnected and active heterogeneous components and usually operate in uncertain environments and with incomplete information. Problems associated with those systems are typically large-scale and computationally intractable, yet they are also very well-structured and have features that can be exploited by appropriate modeling and computational methods. The goal of this thesis is to develop foundational theories and tools to exploit those structures that can lead to computationally-efficient and distributed solutions, and apply them to improve systems operations and architecture.

Specifically, the thesis focuses on two concrete areas. The first one is to design distributed rules to manage distributed energy resources in the power network. The power network is undergoing a fundamental transformation. The future smart grid, especially on the distribution system, will be a large-scale network of distributed energy resources (DERs), each introducing random and rapid fluctuations in power supply, demand, voltage and frequency. These DERs provide a tremendous opportunity for sustainability, efficiency, and power reliability. However, there are daunting technical challenges in managing these DERs and optimizing their operation. The focus of this dissertation is to develop scalable, distributed, and real-time control and optimization to achieve system-wide efficiency, reliability, and robustness for the future power grid. In particular, we will present how to explore the power network structure to design efficient and distributed market and algorithms for the energy management. We will also show how to connect the algorithms with physical dynamics and existing control mechanisms for real-time control in power networks.

The second focus is to develop distributed optimization rules for general multi-agent engineering systems. A central goal in multiagent systems is to design local control laws for the individual agents to ensure that the emergent global behavior is desirable with respect to the given system level objective. Ideally, a system designer seeks to satisfy this goal while conditioning each agent’s control on the least amount of information possible. Our work focused on achieving this goal using the framework of game theory. In particular, we derived a systematic methodology for designing local agent objective functions that guarantees (i) an equivalence between the resulting game-theoretic equilibria and the system level design objective and (ii) that the resulting game possesses an inherent structure that can be exploited for distributed learning, e.g., potential games. The control design can then be completed by applying any distributed learning algorithm that guarantees convergence to the game-theoretic equilibrium. One main advantage of this game theoretic approach is that it provides a hierarchical decomposition between the decomposition of the systemic objective (game design) and the specific local decision rules (distributed learning algorithms). This decomposition provides the system designer with tremendous flexibility to meet the design objectives and constraints inherent in a broad class of multiagent systems. Furthermore, in many settings the resulting controllers will be inherently robust to a host of uncertainties including asynchronous clock rates, delays in information, and component failures.

Control of dynamical systems with temporal logic specifications

This thesis is motivated by safety-critical applications involving autonomous air, ground, and space vehicles carrying out complex tasks in uncertain and adversarial environments. We use temporal logic as a language to formally specify complex tasks and system properties. Temporal logic specifications generalize the classical notions of stability and reachability that are studied in the control and hybrid systems communities. Given a system model and a formal task specification, the goal is to automatically synthesize a control policy for the system that ensures that the system satisfies the specification. This thesis presents novel control policy synthesis algorithms for optimal and robust control of dynamical systems with temporal logic specifications. Furthermore, it introduces algorithms that are efficient and extend to high-dimensional dynamical systems.

The first contribution of this thesis is the generalization of a classical linear temporal logic (LTL) control synthesis approach to optimal and robust control. We show how we can extend automata-based synthesis techniques for discrete abstractions of dynamical systems to create optimal and robust controllers that are guaranteed to satisfy an LTL specification. Such optimal and robust controllers can be computed at little extra computational cost compared to computing a feasible controller.

The second contribution of this thesis addresses the scalability of control synthesis with LTL specifications. A major limitation of the standard automaton-based approach for control with LTL specifications is that the automaton might be doubly-exponential in the size of the LTL specification. We introduce a fragment of LTL for which one can compute feasible control policies in time polynomial in the size of the system and specification. Additionally, we show how to compute optimal control policies for a variety of cost functions, and identify interesting cases when this can be done in polynomial time. These techniques are particularly relevant for online control, as one can guarantee that a feasible solution can be found quickly, and then iteratively improve on the quality as time permits.

The final contribution of this thesis is a set of algorithms for computing feasible trajectories for high-dimensional, nonlinear systems with LTL specifications. These algorithms avoid a potentially computationally-expensive process of computing a discrete abstraction, and instead compute directly on the system's continuous state space. The first method uses an automaton representing the specification to directly encode a series of constrained-reachability subproblems, which can be solved in a modular fashion by using standard techniques. The second method encodes an LTL formula as mixed-integer linear programming constraints on the dynamical system. We demonstrate these approaches with numerical experiments on temporal logic motion planning problems with high-dimensional (10+ states) continuous systems.

Probabilistic robust control : theory and applications

In this work, the development of a probabilistic approach to robust control is motivated by structural control applications in civil engineering. Often in civil structural applications, a system's performance is specified in terms of its reliability. In addition, the model and input uncertainty for the system may be described most appropriately using probabilistic or "soft" bounds on the model and input sets. The probabilistic robust control methodology contrasts with existing H∞/μ robust control methodologies that do not use probability information for the model and input uncertainty sets, yielding only the guaranteed (i.e., "worst-case") system performance, and no information about the system's probable performance which would be of interest to civil engineers.

The design objective for the probabilistic robust controller is to maximize the reliability of the uncertain structure/controller system for a probabilistically-described uncertain excitation. The robust performance is computed for a set of possible models by weighting the conditional performance probability for a particular model by the probability of that model, then integrating over the set of possible models. This integration is accomplished efficiently using an asymptotic approximation. The probable performance can be optimized numerically over the class of allowable controllers to find the optimal controller. Also, if structural response data becomes available from a controlled structure, its probable performance can easily be updated using Bayes's Theorem to update the probability distribution over the set of possible models. An updated optimal controller can then be produced, if desired, by following the original procedure. Thus, the probabilistic framework integrates system identification and robust control in a natural manner.

The probabilistic robust control methodology is applied to two systems in this thesis. The first is a high-fidelity computer model of a benchmark structural control laboratory experiment. For this application, uncertainty in the input model only is considered. The probabilistic control design minimizes the failure probability of the benchmark system while remaining robust with respect to the input model uncertainty. The performance of an optimal low-order controller compares favorably with higher-order controllers for the same benchmark system which are based on other approaches. The second application is to the Caltech Flexible Structure, which is a light-weight aluminum truss structure actuated by three voice coil actuators. A controller is designed to minimize the failure probability for a nominal model of this system. Furthermore, the method for updating the model-based performance calculation given new response data from the system is illustrated.

Formal methods for control synthesis in partially observed environments : application to autonomous robotic manipulation

Modern robots are increasingly expected to function in uncertain and dynamically challenging environments, often in proximity with humans. In addition, wide scale adoption of robots requires on-the-fly adaptability of software for diverse application. These requirements strongly suggest the need to adopt formal representations of high level goals and safety specifications, especially as temporal logic formulas. This approach allows for the use of formal verification techniques for controller synthesis that can give guarantees for safety and performance. Robots operating in unstructured environments also face limited sensing capability. Correctly inferring a robot's progress toward high level goal can be challenging.

This thesis develops new algorithms for synthesizing discrete controllers in partially known environments under specifications represented as linear temporal logic (LTL) formulas. It is inspired by recent developments in finite abstraction techniques for hybrid systems and motion planning problems. The robot and its environment is assumed to have a finite abstraction as a Partially Observable Markov Decision Process (POMDP), which is a powerful model class capable of representing a wide variety of problems. However, synthesizing controllers that satisfy LTL goals over POMDPs is a challenging problem which has received only limited attention.

This thesis proposes tractable, approximate algorithms for the control synthesis problem using Finite State Controllers (FSCs). The use of FSCs to control finite POMDPs allows for the closed system to be analyzed as finite global Markov chain. The thesis explicitly shows how transient and steady state behavior of the global Markov chains can be related to two different criteria with respect to satisfaction of LTL formulas. First, the maximization of the probability of LTL satisfaction is related to an optimization problem over a parametrization of the FSC. Analytic computation of gradients are derived which allows the use of first order optimization techniques.

The second criterion encourages rapid and frequent visits to a restricted set of states over infinite executions. It is formulated as a constrained optimization problem with a discounted long term reward objective by the novel utilization of a fundamental equation for Markov chains - the Poisson equation. A new constrained policy iteration technique is proposed to solve the resulting dynamic program, which also provides a way to escape local maxima.

The algorithms proposed in the thesis are applied to the task planning and execution challenges faced during the DARPA Autonomous Robotic Manipulation - Software challenge.