What is action-oriented perception?

Contemporary scientific and philosophical literature on perception often focuses on the relationship between perception and action, emphasizing the ways in which perception can be understood as geared towards action or ‘action-oriented’. In this paper I provide a framework within which to classify approaches to action-oriented perception, and I highlight important differences between the distinct approaches. I show how talk of perception as action-oriented can be applied to the evolutionary history of perception, neural or psychological perceptual mechanisms, the semantic content or phenomenal character of perceptual states, or to the metaphysical nature of perception. I argue that there are no straightforward inferences from one kind of action-oriented perception to another. Using this framework and its insights, I then explore the notion of action-oriented perceptual representation which plays a key role in some approaches to embodied cognitive science. I argue that the concept of action-oriented representation proposed by Clark and Wheeler is less straightforward than it might seem, because it seems to require both that the mechanisms of perceptual representation are action-oriented and that the content of these perceptual representations are action-oriented. Given that neither of these claims can be derived from the other, proponents of action-oriented representation owe us separate justification for each claim. I will argue that such justifications are not forthcoming in the literature, and that attempts to reconstruct them run into trouble: the sorts of arguments offered for the representational mechanisms being action-oriented seem to undermine the sorts of arguments offered for the representational content being action-oriented, and vice-versa

What is a logical diagram?

Robert Brandom’s expressivism argues that not all semantic content may be made fully explicit. This view connects in interesting ways with recent movements in philosophy of mathematics and logic (e.g. Brown, Shin, Giaquinto) to take diagrams seriously - as more than a mere “heuristic aid” to proof, but either proofs themselves, or irreducible components of such. However what exactly is a diagram in logic? Does this constitute a semiotic natural kind? The paper will argue that such a natural kind does exist in Charles Peirce’s conception of iconic signs, but that fully understood, logical diagrams involve a structured array of normative reasoning practices, as well as just a “picture on a page”

Crosscutting, what is and what is not? A Formal definition based on a Crosscutting Pattern

Crosscutting is usually described in terms of scattering and tangling. However, the distinction between these concepts is vague, which could lead to ambiguous statements. Sometimes, precise definitions are required, e.g. for the formal identification of crosscutting concerns. We propose a conceptual framework for formalizing these concepts based on a crosscutting pattern that shows the mapping between elements at two levels, e.g. concerns and representations of concerns. The definitions of the concepts are formalized in terms of linear algebra, and visualized with matrices and matrix operations. In this way, crosscutting can be clearly distinguished from scattering and tangling. Using linear algebra, we demonstrate that our definition generalizes other definitions of crosscutting as described by Masuhara & Kiczales [21] and Tonella and Ceccato [28]. The framework can be applied across several refinement levels assuring traceability of crosscutting concerns. Usability of the framework is illustrated by means of applying it to several areas such as change impact analysis, identification of crosscutting at early phases of software development and in the area of model driven software development

If physics is an information science, what is an observer?

Interpretations of quantum theory have traditionally assumed a "Galilean" observer, a bare "point of view" implemented physically by a quantum system. This paper investigates the consequences of replacing such an informationally-impoverished observer with an observer that satisfies the requirements of classical automata theory, i.e. an observer that encodes sufficient prior information to identify the system being observed and recognize its acceptable states. It shows that with reasonable assumptions about the physical dynamics of information channels, the observations recorded by such an observer will display the typical characteristics predicted by quantum theory, without requiring any specific assumptions about the observer's physical implementation.Comment: 30 pages, comments welcome; v2 significant revisions - results unchange

What is Holding Back Convnets for Detection?

Convolutional neural networks have recently shown excellent results in general object detection and many other tasks. Albeit very effective, they involve many user-defined design choices. In this paper we want to better understand these choices by inspecting two key aspects "what did the network learn?", and "what can the network learn?". We exploit new annotations (Pascal3D+), to enable a new empirical analysis of the R-CNN detector. Despite common belief, our results indicate that existing state-of-the-art convnet architectures are not invariant to various appearance factors. In fact, all considered networks have similar weak points which cannot be mitigated by simply increasing the training data (architectural changes are needed). We show that overall performance can improve when using image renderings for data augmentation. We report the best known results on the Pascal3D+ detection and view-point estimation tasks

Security of Supply for Natural Gas Markets. What is it and What is it not?

The issue of security of gas supplies is frequently discussed on the basis of intuitive and non-systematic arguments. Greater import dependence is normally equated with greater insecurity, and strategic stocks are the risk management tool most commonly considered. This paper strives to offer a systematic framework of analysis and shows that import dependence does not necessarily entail greater insecurity – actually, the opposite may well be the case. It also discusses several alternatives to strategic stocks for risk management, which are more interesting and promising.Natural gas market, Security of supply

Parallel symbolic state-space exploration is difficult, but what is the alternative?

State-space exploration is an essential step in many modeling and analysis problems. Its goal is to find the states reachable from the initial state of a discrete-state model described. The state space can used to answer important questions, e.g., "Is there a dead state?" and "Can N become negative?", or as a starting point for sophisticated investigations expressed in temporal logic. Unfortunately, the state space is often so large that ordinary explicit data structures and sequential algorithms cannot cope, prompting the exploration of (1) parallel approaches using multiple processors, from simple workstation networks to shared-memory supercomputers, to satisfy large memory and runtime requirements and (2) symbolic approaches using decision diagrams to encode the large structured sets and relations manipulated during state-space generation. Both approaches have merits and limitations. Parallel explicit state-space generation is challenging, but almost linear speedup can be achieved; however, the analysis is ultimately limited by the memory and processors available. Symbolic methods are a heuristic that can efficiently encode many, but not all, functions over a structured and exponentially large domain; here the pitfalls are subtler: their performance varies widely depending on the class of decision diagram chosen, the state variable order, and obscure algorithmic parameters. As symbolic approaches are often much more efficient than explicit ones for many practical models, we argue for the need to parallelize symbolic state-space generation algorithms, so that we can realize the advantage of both approaches. This is a challenging endeavor, as the most efficient symbolic algorithm, Saturation, is inherently sequential. We conclude by discussing challenges, efforts, and promising directions toward this goal

What is Hidden Within the Cloud?

Over the past few years cloud computing has become one of the most significant technological trends. The aim of this paper is to discuss the main characteristics of cloud computing, identify the challenges concerning the security and control of information within the cloud and finally to examine how secure information can be in it. Section one gives an overview of the technology by presenting its key aspects and architecture. The security issues about its adoption are explored briefly in section two followed by possible ways to prevent these threats on section three. Finally, in section four the research focuses on the future of cloud computing and closes with an evaluation of how secure the cloud is on section five