Ethical concerns in e-social science are often raised with respect to privacy, confidentiality, anonymity and the ethical and legal requirements that govern research. In this article, the authors focus on ethical aspects of e-research that are not directly related to ethical regulatory framework or requirements. These frameworks are often couched in terms of benefits or harms that can be incurred by participants in the research. The authors shift the focus to the sources of value in terms of which benefits or (...) harms are understood in real social situations. A central claim of this paper is that the technologies that are used for research are not value neutral, but serve to reinforce some values at the expense of others. The authors discuss databases, modelling and simulation, network analysis as examples of technologies which affect the articulation of values. A view of e-social science as a techno-scientific constellation of researchers, technologies and society, in which values are always already embedded, is put forward as a basis for a view of ethics as reflexive and active engagement, conducted with awareness. Methodological pluralism and proactive openness are also proposed as responses to this view of the ethical dimensions of e-social science. (shrink)

The Adverse Outcome Pathway (AOP) concept is a knowledge assembly and communication tool to facilitate the transparent translation of mechanistic information into outcomes meaningful to the regulatory assessment of chemicals. The AOP framework and associated knowledgebases (KBs) have received significant attention and use in the regulatory toxicology community. However, it is increasingly apparent that the potential stakeholder community for the AOP concept and AOP KBs is broader than scientists and regulators directly involved in chemical safety assessment. In this paper we (...) identify and describe those stakeholders who currently—or in the future—could benefit from the application of the AOP framework and knowledge to specific problems. We also summarize the challenges faced in implementing pathway-based approaches such as the AOP framework in biological sciences, and provide a series of recommendations to meet critical needs to ensure further progression of the framework as a useful, sustainable and dependable tool supporting assessments of both human health and the environment. Although the AOP concept has the potential to significantly impact the organization and interpretation of biological information in a variety of disciplines/applications, this promise can only be fully realized through the active engagement of, and input from multiple stakeholders, requiring multi-pronged substantive long-term planning and strategies. (shrink)

Abstract: In a former paper [21], an exact image compression based on bit-planes blocking was proposed. The proposed algorithm uses two bit codes for block representation. The outcome of the encoding process is two streams: Main Bit Stream, MBS and Residual Bit Stream, RBS. The algorithm core is searching for the greatest block of Unicode to encode in main stream and if not found until size of two by two then it will be kept as is in residual stream. In (...) this paper, a lossy version of that algorithm is presented. The change in the base algorithm is in the definition of the unary-code-block is eased to be above certain percent. The percent is varied from plane to another as their contribution to image power varies. The testing of the proposed algorithm shows comparable results. Image degradations seems restorable even for high compression ratios. (shrink)

In this paper, we examine a number of relevant logics’ variable sharing properties from the perspective of theories of topic or subject-matter. We take cues from Franz Berto’s recent work on topic to show an alignment between families of variable sharing properties and responses to the topic transparency of relevant implication and negation. We then introduce and defend novel variable sharing properties stronger than strong depth relevance—which we call cn-relevance and lossless cn-relevance—showing that the properties are satisfied by the weak (...) relevant logics and , respectively. We argue that such properties address a sort of semantic lossiness of strong depth relevance. (shrink)

What is the relationship between complexity in the world and complexity in the mind? Intuitively, increasingly complex objects and events should give rise to increasingly complex mental representations (or perhaps a plateau in complexity after a certain point). However, a counterintuitive possibility with roots in information theory is an inverted U-shaped relationship between the “objective” complexity of some stimulus and the complexity of its mental representation, because excessively complex patterns might be characterized by surprisingly short computational descriptions (e.g., if they (...) are represented as having been generated “randomly”). Here, we demonstrate that this is the case, using a novel approach that takes the notion of “description” literally. Subjects saw static and dynamic visual stimuli whose objective complexity could be carefully manipulated, and they described these stimuli in their own words by giving freeform spoken descriptions of them. Across three experiments totaling over 10,000 speech clips, spoken descriptions of shapes (Experiment 1), dot-arrays (Experiment 2), and dynamic motion-paths (Experiment 3) revealed a striking quadratic relationship between the raw complexity of these stimuli and the length of their spoken descriptions. In other words, the simplest and most complex stimuli received the shortest descriptions, while those stimuli with a “medium” degree of complexity received the longest descriptions. Follow-up analyses explored the particular words used by subjects, allowing us to further explore how such stimuli were represented. We suggest that the mind engages in a kind of lossy compression for overly complex stimuli, and we discuss the utility of such freeform responses for exploring foundational questions about mental representation. (shrink)

The standard view about counterfactuals is that a counterfactual (A > C) is true if and only if the A-worlds most similar to the actual world @ are C-worlds. I argue that the worlds conception of counterfactuals is wrong. I assume that counterfactuals have non-trivial truth-values under physical determinism. I show that the possible-worlds approach cannot explain many embeddings of the form (P > (Q > R)), which intuitively are perfectly assertable, and which must be true if the contingent falsity (...) of (Q > R) is to be explained. If (P > (Q > R)) has a backtracking reading then the contingent facts that (Q > R) needs to be true in the closest P-worlds are absent. If (P > (Q > R)) has a forwardtracking reading, then the laws required by (Q > R) to be true in the closest P-worlds will be absent, because they are violated in those worlds. Solutions like lossy laws or denial of embedding won't work. The only approach to counterfactuals that explains the embedding is a pragmatic metalinguistic approach in which the whole idea that counterfactuals are about a modal reality, be it abstract or concrete, is given up. (shrink)

It has been argued that the fundamental laws of physics do not face a ‘problem of provisos’ equivalent to that found in other scientific disciplines (Earman, Roberts and Smith 2002) and there is only the appearance of exceptions to physical laws if they are confused with differential equations of evolution type (Smith 2002). In this paper I argue that even if this is true, fundamental laws in physics still pose a major challenge to standard Humean approaches to lawhood, as they (...) are not in any obvious sense about regularities in behaviour. A Humean approach to physical laws with exceptions is possible, however, if we adopt a view of laws that takes them to be the algorithms in the algorithmic compressions of empirical data. When this is supplemented with a distinction between lossy and lossless compression, we can explain exceptions in terms of compression artefacts present in the application of the lossy laws. (shrink)

Is quantum mechanics about ‘states’? Or is it basically another kind of probability theory? It is argued that the elementary formalism of quantum mechanics operates as a well-justified alternative to ‘classical’ instantiations of a probability calculus. Its providing a general framework for prediction accounts for its distinctive traits, which one should be careful not to mistake for reflections of any strange ontology. The suggestion is also made that quantum theory unwittingly emerged, in Schrödinger’s formulation, as a ‘lossy’ by-product of a (...) quantum-mechanical variant of the Hamilton-Jacobi equation. As it turns out, the effectiveness of quantum theory qua predictive algorithm makes up for the computational impracticability of that master equation. (shrink)

European Computing and Philosophy conference, 2–4 July Barcelona The Seventh ECAP (European Computing and Philosophy) conference was organized by Jordi Vallverdu at Autonomous University of Barcelona. The conference started with the IACAP (The International Association for CAP) presidential address by Luciano Floridi, focusing on mechanisms of knowledge production in informational networks. The first keynote delivered by Klaus Mainzer made a frame for the rest of the conference, by elucidating the fundamental role of complexity of informational structures that can be analyzed (...) on different levels of organization giving place for variety of possible approaches which converge in this cross-disciplinary and multi-disciplinary research field. Keynotes by Kevin Warwick about re-embodiment of rats’ neurons into robots, Raymond Turner on syntax and semantics in programming languages, Roderic Guigo on Biocomputing Sciences and Francesco Subirada on the past and future of supercomputing presented different topics of philosophical as well as practical aspects of computing. Vonference tracks included: Philosophy of Information (Patrick Allo), Philosophy of Computer Science (Raymond Turner), Computer and Information Ethics (Johnny Søraker and Alison Adam), Computational Approaches to the Mind (Ruth Hagengruber), IT and Cultural Diversity (Jutta Weber and Charles Ess), Crossroads (David Casacuberta), Robotics, AI & Ambient Intelligence (Thomas Roth-Berghofer), Biocomputing, Evolutionary and Complex Systems (Gordana Dodig Crnkovic and Søren Brier), E-learning, E-science and Computer-Supported Cooperative Work (Annamaria Carusi) and Technological Singularity and Acceleration Studies (Amnon Eden). (shrink)