797 research outputs found

    Reconciling current approaches to blindsight

    No full text
    After decades of research, blindsight is still a mysterious and controversial topic in consciousness research. Currently, many researchers tend to think of it as an ideal phenomenon to investigate neural correlates of consciousness, whereas others believe that blindsight is in fact a kind of degraded vision rather than "truly blind". This article considers both perspectives and finds that both have difficulties understanding all existing evidence about blindsight. In order to reconcile the perspectives, we suggest two specific criteria for a good model of blindsight, able to encompass all evidence. We propose that the REF-CON model (Overgaard & Mogensen, 2014) may work as such a model. © 2014 Elsevier Inc. All rights reserved

    Fortolkningens forrang: Henrik Stangerups forfatterskab belyst ved analyser af Manden der ville være skyldig og Vejen til Lagoa Santa

    No full text
    English summary Based on the assumption that it makes sense to talk about ’the essence’ of a literary work, I present an analytical approach which claims that works of literature can be read and under-stood as interpretations of the fictional universe they present. By means of the Scottish phi-losopher Gregory Currie’s distinction between text and work and his theory of fiction as pre-sented in his book The Nature of Fiction (1990) I explain this approach theoretically. I show how the works own interpretation of the fictional universe can be described as the belief set of the fictional author, which again can be determined as the paradigm of propositions that are true in the story. Since it follows that the interpretation of this belief set is always relational to an overall interpretation of the work as a whole, the most important consequence of these theoretical considerations is that my analytical method turns the normal order of literary analysis upside down: Instead of going from analytical observations to interpretation, I (more or less) begin with an overall interpretation which I then support by emphasizing salient ele-ment in the work. I employ this approach in the analysis of two of the central novels in the Danish author Hen-rik Stangerups production. In relation to the short (and at the time of its publication in 1973 very controversial) novel The Man Who Wanted to Be Guilty from the early part of his writ-ings, I demonstrate that this novel is a story of the dehumanizing consequences of a govern-mental system that aims to abolish concepts such as guilt, responsibility and punishment. It shows that these seemingly attractive and harmless intentions can only be carried out by ob-taining total control of the public – a control that only those in power can avoid. The novel furthermore reveals that recreation – or even elimination – of both the individual and reality is inevitable when constructing such a society. From the later part of Stangerups production I analyse his in my view best novel, The road to Lagoa Santa from 1981, which is a (fictionalised) biographical story about the life of the historical Danish zoologist and palaeontologist Peter Wilhelm Lund (1801-1880), who lived most of his life in the Brazilian village Lagoa Santa. I argue that this work in essence is an existential story of a mans transformation from a rationalistic creature trying to explain life itself by means of scientific systems to a man who reconciles with life and settles with the demands of the given and concrete reality. I conclude that the most significant strength of the suggested analytical approach is that it brings forward the essence and meaning in works of literature and thereby insures that this aspect is not understated or even neglected in the analytical treatment of fictions

    Broiler growth optimization using norm optimal terminal iterative learning control

    No full text
    Broiler (chicken for meat production) growth maximization reduces the amount of feed, water and electricity required to produce a mature broiler where temperature control is one of the most influential factors. Iterative learning control provides a potential solution given the repeated nature of the production process, as it has been especially developed for systems that make repeated executions of the same finite duration task. Dynamic neural network models are used given the absence of mathematical models of the growth process. Traditional ILC is modified to maximize the terminal broiler weight and better cope with the uncertain nature of the data driven model. To evaluate the proposed algorithm in simulation, a heuristic broiler growth model based on the knowledge of a broiler application expert is formalized. This paper gives the first results on the application of optimization based iterative learning control.</p

    Picard - an electrostatic particle in cell simulation code

    No full text
    This is a particle-in-cell plasma code 'picard' that was developed by Jesper Lindkvist and Herbert Gunell with start in 2016 using resources provided by the Swedish National Infrastructure for Computing (SNIC) at the High Performance Computing Center North (HPC2N), Umeå University, Sweden. Jesper Lindkvist was funded by the Swedish National Space Board (SNSB project 201/15) and Herbert Gunell by the Swedish National Space Agency (SNSA project 108/18). A paper based on the first version was published in A&A . The present version has been updated to include ionisation as a source of cometary ions, and hdf5 files are used for writing the output. The changes in this version were made by Herbert Gunell. The files included are: picard.tgz Package containing all source file, some matlab m-files that can be used for plotting of the results, and an input file that was used for a simulation that will be used in an upcoming publication by Herbert Gunell and Charlotte Götz. fig-cur.mp4 Videoclip showing results from the simulation defined by the input file, specifically three-dimensional current paths from different angles. @author : Jesper Lindkvist Email : [email protected] @author : Herbert Gunell Email : [email protected]

    Broiler FCR Optimization using Norm Optimal Terminal Iterative Learning Control

    No full text
    Broiler feed conversion rate (FCR) optimization reduces the amount of feed, water, and electricity required to produce a mature broiler, where temperature control is one of the most influential factors. Iterative learning control (ILC) provides a potential solution given the repeated nature of the production process, as it has been especially developed for systems that make repeated executions of the same finite duration task. Dynamic neural network models provide a basis for control synthesis, as no first-principle mathematical models of the broiler growth process exist. The final FCR at slaughter is one of the primary performance parameters for broiler production, and it is minimized using a modified terminal ILC law in this article. Simulation evaluation of the new designs is undertaken using a heuristic broiler growth model based on the knowledge of a broiler application expert and experimentally on a state-of-the-art broiler house that produces approximately 40,000 broilers per batch.</p

    Type Theory Unchained: Extending Agda with User-Defined Rewrite Rules

    No full text
    Dependently typed languages such as Coq and Agda can statically guarantee the correctness of our proofs and programs. To provide this guarantee, they restrict users to certain schemes a- such as strictly positive datatypes, complete case analysis, and well-founded induction a- that are known to be safe. However, these restrictions can be too strict, making programs and proofs harder to write than necessary. On a higher level, they also prevent us from imagining the different ways the language could be extended. In this paper I show how to extend a dependently typed language with user-defined higher-order non-linear rewrite rules. Rewrite rules are a form of equality reflection that is applied automatically by the typechecker. I have implemented rewrite rules as an extension to Agda, and I give six examples how to use them both to make proofs easier and to experiment with extensions of type theory. I also show how to make rewrite rules interact well with other features of Agda such as-equality, implicit arguments, data and record types, irrelevance, and universe level polymorphism. Thus rewrite rules break the chains on computation and put its power back into the hands of its rightful owner: Yours.Programming Language
    corecore