Distributing the system workload and balancing all incoming requests among all processing nodes in cloud computing environments is one of the important challenges in today cloud computing world. Many load balancing algorithms and approaches have been proposed for distributed and cloud computing systems. In addition the broker policy for distributing the workload among different datacenters in a cloud environment is one of the important factors for improving the system performance. In this paper we present an analytical comparison for the combinations (...) of VM load balancing algorithms and different broker policies. We evaluate these approaches by simulating on CloudAnalyst simulator and the final results are presented based on different parameters. The results of this research specify the best possible combinations. (shrink)

In this paper, building on these previous works, we propose to go deeper into the understanding of crowd behavior by proposing an approach which integrates ontologi- cal models of crowd behavior and dedicated computer vision algorithms, with the aim of recognizing some targeted complex events happening in the playground from the observation of the spectator crowd behavior. In order to do that, we first propose an ontology encoding available knowledge on spectator crowd behavior, built as a spe- cialization of the (...) DOLCE foundational ontology, which allows the representation of categories belonging both to the physical and to the social realms. We then propose a simplified and tractable version of such ontology in a new temporal extension of a description logic, which is used for temporally coupling events happening on the play- ground and spectator crowd behavior. At last, computer vision algorithms provide the input information concerning what is observed on the stands and ontological reasoning delivers the output necessary to perform complex event recognition. (shrink)

To study climate change, scientists employ computer models, which approximate target systems with various levels of skill. Given the imperfection of climate models, how do scientists use simulations to generate knowledge about the causes of observed climate change? Addressing a similar question in the context of biological modelling, Levins (1966) proposed an account grounded in robustness analysis. Recent philosophical discussions dispute the confirmatory power of robustness, raising the question of how the results of computer modelling studies contribute to the (...) body of evidence supporting hypotheses about climate change. Expanding on Staley’s (2004) distinction between evidential strength and security, and Lloyd’s (2015) argument connecting variety-of-evidence inferences and robustness analysis, I address this question with respect to recent challenges to the epistemology robustness analysis. Applying this epistemology to case studies of climate change, I argue that, despite imperfections in climate models, and epistemic constraints on variety-of-evidence reasoning and robustness analysis, this framework accounts for the strength and security of evidence supporting climatological inferences, including the finding that global warming is occurring and its primary causes are anthropogenic. (shrink)

Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the practice. It then shows how this account can be fruitfully applied (...) in the evaluation of major foundational approaches by a careful examination of two case studies: a partial realization of Hilbert’s program due to Simpson [1988], and predicativism in the extended form due to Feferman and Schütte. -/- Shore [2010, 2013] proposes that equivalences in reverse mathematics be proved in the same way as inequivalences, namely by considering only omega-models of the systems in question. Shore refers to this approach as computational reverse mathematics. This paper shows that despite some attractive features, computational reverse mathematics is inappropriate for foundational analysis, for two major reasons. Firstly, the computable entailment relation employed in computational reverse mathematics does not preserve justification for the foundational programs above. Secondly, computable entailment is a Pi-1-1 complete relation, and hence employing it commits one to theoretical resources which outstrip those available within any foundational approach that is proof-theoretically weaker than Pi-1-1-CA0. (shrink)

Human innovation is the basis of human survival and development, and scientific and technological innovation are the precursors of industrial evolution. What is the role of cognition in innovative activity? What are the characteristics of the process of its development in a creative environment? This paper proposes the internal mechanism of class creation as an innovative activity from the point of view of industrial evolution and argues that class creation occurs on the basis of cognition. Taking the history of the (...) computer industry as an example, the paper analyses the position of class creation in the process of technological innovation and discusses the role of cognitive activities in the innovation process. It is pointed out that various class-creation activities are the important reasons that drive the evolution of the computer industry. (shrink)

What structure of scientific communication and cooperation, between what kinds of investigators, is best positioned to lead us to the truth? Against an outline of standard philosophical characteristics and a recent turn to social epistemology, this paper surveys highlights within two strands of computational philosophy of science that attempt to work toward an answer to this question. Both strands emerge from abstract rational choice theory and the analytic tradition in philosophy of science rather than postmodern sociology of science. The first (...) strand of computational research models the effect of communicative networks within groups, with conclusions regarding the potential benefit of limited communication. The second strand models the potential benefits of cognitive diversity within groups. Examples from each strand of research are used in analyzing what makes modeling of this sort both promising and distinctly philosophical, but are also used to emphasize possibilities for failure and inherent limitations as well. (shrink)

Despite their success in describing and predicting cognitive behavior, the plausibility of so-called ‘rational explanations’ is often contested on the grounds of computational intractability. Several cognitive scientists have argued that such intractability is an orthogonal pseudoproblem, however, since rational explanations account for the ‘why’ of cognition but are agnostic about the ‘how’. Their central premise is that humans do not actually perform the rational calculations posited by their models, but only act as if they do. Whether or not the problem (...) of intractability is solved by recourse to ‘as if’ explanations critically depends, inter alia, on the semantics of the ‘as if’ connective. We examine the five most sensible explications in the literature, and conclude that none of them circumvents the problem. As a result, rational ‘as if’ explanations must obey the minimal computational constraint of tractability. (shrink)

Time plays a significant role in science and everyday life. Despite being experienced as a continuous flow, computational models of consciousness are typically restricted to a sequential temporal structure. This difference poses a serious challenge for computational phenomenology—a novel field combining phenomenology and computational modelling. By analysing the temporal structure of the active inference framework, we show that an integrated continuity of time can be achieved by merging Husserlian temporality with a sequential order of time. We also show that a (...) Markov blanket of the present moment integrates past and future moments of both subjective temporality and objective time in an asynchronous manner. By applying the integrated continuity, it is clear that active inference makes use of both subjective temporality and objective time in an integrated fashion. We conclude that active inference, on a temporal note, qualifies as a computational model for phenomenological investigations. (shrink)

Modern webpages consist of many rich objects dynamically produced by servers and client terminals at diverse locations, so we face an increase in web response time. To reduce the time, edge computing, in which dynamic objects are generated and delivered from edge nodes, is effective. For ISPs and CDN providers, it is desirable to estimate the effect of reducing the web response time when introducing edge computing. Therefore, in this paper, we derive a simple formula that estimates the lower bound (...) of the reduction of the response time by modeling flows obtaining objects of webpages. We investigate the effect of edge computing in each webpage category, e.g., News and Sports, using data measured by browsing about 1,000 popular webpages from 12 locations in the world on PlanetLab. (shrink)

This dissertation examines aspects of the interplay between computing and scientific practice. The appropriate foundational framework for such an endeavour is rather real computability than the classical computability theory. This is so because physical sciences, engineering, and applied mathematics mostly employ functions defined in continuous domains. But, contrary to the case of computation over natural numbers, there is no universally accepted framework for real computation; rather, there are two incompatible approaches --computable analysis and BSS model--, both claiming to (...) formalise algorithmic computation and to offer foundations for scientific computing. -/- The dissertation consists of three parts. In the first part, we examine what notion of 'algorithmic computation' underlies each approach and how it is respectively formalised. It is argued that the very existence of the two rival frameworks indicates that 'algorithm' is not one unique concept in mathematics, but it is used in more than one way. We test this hypothesis for consistency with mathematical practice as well as with key foundational works that aim to define the term. As a result, new connections between certain subfields of mathematics and computer science are drawn, and a distinction between 'algorithms' and 'effective procedures' is proposed. -/- In the second part, we focus on the second goal of the two rival approaches to real computation; namely, to provide foundations for scientific computing. We examine both frameworks in detail, what idealisations they employ, and how they relate to floating-point arithmetic systems used in real computers. We explore limitations and advantages of both frameworks, and answer questions about which one is preferable for computational modelling and which one for addressing general computability issues. -/- In the third part, analog computing and its relation to analogue (physical) modelling in science are investigated. Based on some paradigmatic cases of the former, a certain view about the nature of computation is defended, and the indispensable role of representation in it is emphasized and accounted for. We also propose a novel account of the distinction between analog and digital computation and, based on it, we compare analog computational modelling to physical modelling. It is concluded that the two practices, despite their apparent similarities, are orthogonal. (shrink)

Embedding ethics modules within computer science courses has become a popular response to the growing recognition that CS programs need to better equip their students to navigate the ethical dimensions of computing technologies like AI, machine learning, and big data analytics. However, the popularity of this approach has outpaced the evidence of its positive outcomes. To help close that gap, this empirical study reports positive results from Northeastern’s program that embeds values analysis modules into CS courses. The resulting data (...) suggest that such modules have a positive effect on students’ moral attitudes and that students leave the modules believing they are more prepared to navigate the ethical dimensions they’ll likely face in their eventual careers. Importantly, these gains were accomplished at an institution without a philosophy doctoral program, suggesting this strategy can be effectively employed by a wider range of institutions than many have thought. (shrink)

This Master’s thesis explores the relationship between Brain-Computer Interfaces (BCIs) and their human users from a functional, epistemological and phenomenological perspective. The analysis has four steps. I start out with a technical description of BCI systems in which I conceptually analyze different types of BCI applications. This results in the development of a taxonomy of applications which is the point of departure for further philosophical analysis. Thereafter, I explore the functional relationship between BCI applications and their users. That (...) is to say, I analyze functions of BCI applications, relate them to abilities of their users and explore how they extend these abilities. After that, the epistemological relation between BCI systems and their users is conceptualized by analyzing how they contribute to cognitive processes of their users, which is done by using the distributed cognition framework. And lastly, a postphenomenological framework is adapted to investigate how BCIs mediate the experiences of their users. This thesis ends with a reflection in which (1) possible developments in BCI research are placed in a broader historical-anthropological perspective, and (2) a moral consideration is given on the desirability of BCIs. (shrink)

Is the mathematical function being computed by a given physical system determined by the system’s dynamics? This question is at the heart of the indeterminacy of computation phenomenon (Fresco et al. [unpublished]). A paradigmatic example is a conventional electrical AND-gate that is often said to compute conjunction, but it can just as well be used to compute disjunction. Despite the pervasiveness of this phenomenon in physical computational systems, it has been discussed in the philosophical literature only indirectly, mostly with reference (...) to the debate over realism about physical computation and computationalism. A welcome exception is Dewhurst’s ([2018]) recent analysis of computational individuation under the mechanistic framework. He rejects the idea of appealing to semantic properties for determining the computational identity of a physical system. But Dewhurst seems to be too quick to pay the price of giving up the notion of computational equivalence. We aim to show that the mechanist need not pay this price. The mechanistic framework can, in principle, preserve the idea of computational equivalence even between two different enough kinds of physical systems, say, electrical and hydraulic ones. (shrink)

Focusing on the history of prehistoric archaeology in the 20th century, this papers shows (1) that statistical multidimensional analyses were carried out by a new kind of actors who challenged the previous common language shared by prehistorians. This fundamental change was important, considering that (2) language is a fundamental point for the epistemology of archaeology. However, a comparison of multidimensional analyses applications over time shall make clear that (3) the differences are mostly a generational matter: the transmission processes between them (...) will be addressed. (shrink)

Why should moral philosophers, moral psychologists, and machine ethicists care about computational complexity? Debates on whether artificial intelligence (AI) can or should be used to solve problems in ethical domains have mainly been driven by what AI can or cannot do in terms of human capacities. In this paper, we tackle the problem from the other end by exploring what kind of moral machines are possible based on what computational systems can or cannot do. To do so, we analyze normative (...) ethics through the lens of computational complexity. First, we introduce computational complexity for the uninitiated reader and discuss how the complexity of ethical problems can be framed within Marr’s three levels of analysis. We then study a range of ethical problems based on consequentialism, deontology, and virtue ethics, with the aim of elucidating the complexity associated with the problems themselves (e.g., due to combinatorics, uncertainty, strategic dynamics), the computational methods employed (e.g., probability, logic, learning), and the available resources (e.g., time, knowledge, learning). The results indicate that most problems the normative frameworks pose lead to tractability issues in every category analyzed. Our investigation also provides several insights about the computational nature of normative ethics, including the differences between rule- and outcome-based moral strategies, and the implementation-variance with regard to moral resources. We then discuss the consequences complexity results have for the prospect of moral machines in virtue of the trade-off between optimality and efficiency. Finally, we elucidate how computational complexity can be used to inform both philosophical and cognitive-psychological research on human morality by advancing the moral tractability thesis. (shrink)

Abstract: Lotteries have long been a source of fascination and intrigue, offering the tantalizing prospect of unexpected fortunes. In this research paper, we delve into the world of lottery predictions, employing cutting-edge AI techniques to unlock the secrets of lottery outcomes. Our dataset, obtained from Kaggle, comprises historical lottery draws, and our goal is to develop predictive models that can anticipate future winning numbers. This study explores the use of deep learning and time series analysis to achieve this elusive (...) feat. Through rigorous experimentation and data-driven approaches, we seek to determine the viability of AI in the realm of lottery predictions. Our findings reveal both the promise and limitations of AI in this context, shedding light on the complexities of lottery data and the potential need for quantum computing as a last resort. (shrink)

Researchers interested in player’s experience would assumedly, across disciplines, agree that the goal behind enquiries into player’s experience is to understand the how games’ features end up affecting the player’s experience. Much of the contemporary interdisciplinary research into player’s experience leans toward the empirical-scientific, in the forms psychology, sociology and cognitive science, to name a few. In such approaches, for example demonstrating correlation between physiological symptoms and an in-game event may amount to ‘understanding’. However, the experience of computer game play (...) is a viable topic also for computer game studies within the general tradition of humanities. In such context, the idea of ‘understanding an experience’ invites an approach focusing on the experienced significance of events and objects within computer game play. This focus, in turn, suggests turning to the principles associated with phenomenology, among which is the idea of describing things as they appear, or as they are given, in the experience, from the first-person perspective. From the first-person perspective the challenge lies not in the subjective experience’s inaccessibility but in the inherent personal richness of the experience’s content. Rather than trying to embrace the richness by engaging in direct introspection, it makes sense to focus the search on the conditions of the player’s experience. In this paper, I discuss the idea of “firstperson perspective” in the context of computer game studies. I propose that conditions for player’s experience could be sought from the materiality of the computer game artefact, rather than from the ‘processual’ or ‘ideal game’. I derive the notion of gameplay condition3 from the overlap of the player’s “lusory attitude” and the materiality of the single-player computer game artefact as it appears in the player’s experience. (shrink)

The paper analyses six ethical challenges posed by cloud computing, concerning ownership, safety, fairness, responsibility, accountability and privacy. The first part defines cloud computing on the basis of a resource-oriented approach, and outlines the main features that characterise such technology. Following these clarifications, the second part argues that cloud computing reshapes some classic problems often debated in information and computer ethics. To begin with, cloud computing makes possible a complete decoupling of ownership, possession and use of data and this helps (...) to explain the problems occurring when different providers of cloud computing retain or relinquish the right to use or own users‘ data. The problem of safety in cloud computing is coupled to that of reliability, insofar as users have to trust providers to preserve their data, applications and content in a reliable manner. It is argued that, in this context, data insurance could play an important role. Regarding fairness, the paper argues that cloud computing is already reshaping the nature of the Digital. Responsibility, accountability and privacy close the ethical analysis of cloud computing. In this case, the thesis is that the necessity to account for the actions of cloud computing users imposes delicate trade-offs between users‘ privacy and the traceability of their operations. (shrink)

Computer and information ethics, as well as other fields of applied ethics, need ethical theories which coherently unify deontological and consequentialist aspects of ethical analysis. The proposed theory of just consequentialism emphasizes consequences of policies within the constraints of justice. This makes just consequentialism a practical and theoretically sound approach to ethical problems of computer and information ethics.

This work addresses a broad range of questions which belong to four fields: computation theory, general philosophy of science, philosophy of cognitive science, and philosophy of mind. Dynamical system theory provides the framework for a unified treatment of these questions. ;The main goal of this dissertation is to propose a new view of the aims and methods of cognitive science--the dynamical approach . According to this view, the object of cognitive science is a particular set of dynamical systems, which I (...) call "cognitive systems". The goal of a cognitive study is to specify a dynamical model of a cognitive system, and then use this model to produce a detailed account of the specific cognitive abilities of that system. The dynamical approach does not limit a-priori the form of the dynamical models which cognitive science may consider. In particular, this approach is compatible with both computational and connectionist modeling, for both computational systems and connectionist networks are special types of dynamical systems. ;To substantiate these methodological claims about cognitive science, I deal first with two questions in two different fields: What is a computational system? What is a dynamical explanation of a deterministic process? ;Intuitively, a computational system is a deterministic system which evolves in discrete time steps, and which can be described in an effective way. In chapter 1, I give a formal definition of this concept which employs the notions of isomorphism between dynamical systems, and of Turing computable function. In chapter 2, I propose a more comprehensive analysis which is based on a natural generalization of the concept of Turing machine. ;The goal of chapter 3 is to develop a theory of the dynamical explanation of a deterministic process. By a "dynamical explanation" I mean the specification of a dynamical model of the system or process which we want to explain. I start from the analysis of a specific type of explanandum--dynamical phenomena--and I then use this analysis to shed light on the general form of a dynamical explanation. Finally, I analyze the structure of those theories which generate explanations of this form, namely dynamical theories. (shrink)

Arguments for extended cognition and the extended mind are typically directed at human-centred forms of cognitive extension—forms of cognitive extension in which the cognitive/mental states/processes of a given human individual are subject to a form of extended or wide realization. The same is true of debates and discussions pertaining to the possibility of Web-extended minds and Internet-based forms of cognitive extension. In this case, the focus of attention concerns the extent to which the informational and technological elements of the online (...) environment form part of the machinery of the (individual) human mind. In this paper, we direct attention to a somewhat different form of cognitive extension. In particular, we suggest that the Web allows human individuals to be incorporated into the computational/cognitive routines of online systems. These forms of computational/cognitive extension highlight the potential of the Web and Internet to support bidirectional forms of computational/cognitive incorporation. The analysis of such bidirectional forms of incorporation broadens the scope of philosophical debates in this area, with potentially important implications for our understanding of the foundational notions of extended cognition and the extended mind. (shrink)

The mainstream view in cognitive science is that computation lies at the basis of and explains cognition. Our analysis reveals that there is no compelling evidence or argument for thinking that brains compute. It makes the case for inverting the explanatory order proposed by the computational basis of cognition thesis. We give reasons to reverse the polarity of standard thinking on this topic, and ask how it is possible that computation, natural and artificial, might be based on cognition and (...) not the other way around. (shrink)

Traditional computers work with finite numbers. Situations where the usage of infinite or infinitesimal quantities is required are studied mainly theoretically. In this paper, a recently introduced computational methodology (that is not related to the non-standard analysis) is used to work with finite, infinite, and infinitesimal numbers numerically. This can be done on a new kind of a computer – the Infinity Computer – able to work with all these types of numbers. The new computational tools both give possibilities (...) to execute computations of a new type and open new horizons for creating new mathematical models where a computational usage of infinite and/or infinitesimal numbers can be useful. A number of numerical examples showing the potential of the new approach and dealing with divergent series, limits, probability theory, linear algebra, and calculation of volumes of objects consisting of parts of different dimensions are given. (shrink)

Natural Computing is a field of research in Computer Science aimed at reinterpreting biological phenomena as computing mechanisms. This allows unconventional computing architectures to be proposed in which computations are performed by atoms, DNA strands, cells, insects or other biological elements. Membrane Computing is a branch of Natural Computing in which biological phenomena of interest are related with interactions between molecules inside cells. The research in Membrane Computing has lead to very important theoretical results that show how, in principle, cells (...) could be used to solve any (computable) computational problem with performances that cannot be obtained by conventional computers. However, the implementation of a cell-based computational architecture seems not easily achievable. On the other hand, models of Membrane Computing have found an alternative application to the description of biological systems, with the aim of developing simulators and other analysis tools for the study of biological problems. (shrink)

The present volume is an introduction to the use of tools from computability theory and reverse mathematics to study combinatorial principles, in particular Ramsey's theorem and special cases such as Ramsey's theorem for pairs. It would serve as an excellent textbook for graduate students who have completed a course on computability theory.

Interactive theorem provers might seem particularly impractical in the history of philosophy. Journal articles in this discipline are generally not formalized. Interactive theorem provers involve a learning curve for which the payoffs might seem minimal. In this article I argue that interactive theorem provers have already demonstrated their potential as a useful tool for historians of philosophy; I do this by highlighting examples of work where this has already been done. Further, I argue that interactive theorem provers can continue to (...) be useful tools for historians of philosophy in the future; this claim is defended through a more conceptual analysis of what historians of philosophy do that identifies argument reconstruction as a core activity of such practitioners. It is then shown that interactive theorem provers can assist in this core practice by a description of what interactive theorem provers are and can do. If this is right, then computer verification for historians of philosophy is in the offing. (shrink)

Organisations are computing systems. The university’s sports centre is a computing system for managing sports teams and facilities. The tenure committee is a computing system for assigning tenure status. Despite an increasing number of publications in group ontology, the computational nature of organisations has not been recognised. The present paper is the first in this debate to propose a theory of organisations as groups structured for computing. I begin by describing the current situation in group ontology and by spelling out (...) the thesis in more detail. I then present the example of a sports centre to illustrate why one might intuitively think of organisations as computing systems. To substantiate the thesis, I introduce Piccinini’s restrictive analysis of physical computation. As I show, organisations meet all criteria for being computing systems. Organisations are structured groups with the function of manipulating medium-independent vehicles according to rules. Furthermore, I argue for the modal claim that this is a necessary feature of organisations. Having sketched the computational account of organisations, I compare it to other proposals in the literature. (shrink)

Interactions between an intelligent software agent and a human user are ubiquitous in everyday situations such as access to information, entertainment, and purchases. In such interactions, the ISA mediates the user’s access to the content, or controls some other aspect of the user experience, and is not designed to be neutral about outcomes of user choices. Like human users, ISAs are driven by goals, make autonomous decisions, and can learn from experience. Using ideas from bounded rationality, we frame these interactions (...) as instances of an ISA whose reward depends on actions performed by the user. Such agents benefit by steering the user’s behaviour towards outcomes that maximise the ISA’s utility, which may or may not be aligned with that of the user. Video games, news recommendation aggregation engines, and fitness trackers can all be instances of this general case. Our analysis facilitates distinguishing various subcases of interaction, as well as second-order effects that might include the possibility for adaptive interfaces to induce behavioural addiction, and/or change in user belief. We present these types of interaction within a conceptual framework, and review current examples of persuasive technologies and the issues that arise from their use. We argue that the nature of the feedback commonly used by learning agents to update their models and subsequent decisions could steer the behaviour of human users away from what benefits them, and in a direction that can undermine autonomy and cause further disparity between actions and goals as exemplified by addictive and compulsive behaviour. We discuss some of the ethical, social and legal implications of this technology and argue that it can sometimes exploit and reinforce weaknesses in human beings. (shrink)

Most formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion for deciding between them is needed. The aim of this paper is to investigate an inherent and autonomous comparison criterion, based on specificity as defined in [POO 85, SIM 92]. In contrast to other approaches, we consider not only defeasible, but also strict knowledge. Our criterion is context-sensitive, i. e., preference among defeasible rules is determined dynamically (...) during the dialectical analysis.We show how specificity can be defined in terms of two different approaches: activation sets and derivation trees. This allows us to get a syntactic criterion that can be implemented in a computationally attractive way. The resulting definitions may be applied in general rulebased formalisms. We present theorems linking both characterizations. Finally we discuss other frameworks for defeasible reasoning in which preference handling is considered explicitly. (shrink)

Computers may help us to better understand (not just verify) arguments. In this article we defend this claim by showcasing the application of a new, computer-assisted interpretive method to an exemplary natural-language ar- gument with strong ties to metaphysics and religion: E. J. Lowe’s modern variant of St. Anselm’s ontological argument for the existence of God. Our new method, which we call computational hermeneutics, has been particularly conceived for use in interactive-automated proof assistants. It aims at shedding light on the (...) meanings of words and sentences by framing their inferential role in a given argument. By employing automated theorem reasoning technology within interactive proof assistants, we are able to drastically reduce (by several orders of magnitude) the time needed to test the logical validity of an argu- ment’s formalization. As a result, a new approach to logical analysis, inspired by Donald Davidson’s account of radical interpretation, has been enabled. In computational hermeneutics, the utilization of automated reasoning tools ef- fectively boosts our capacity to expose the assumptions we indirectly commit ourselves to every time we engage in rational argumentation and it fosters the explicitation and revision of our concepts and commitments. (shrink)

This paper presents the first bibliometric mapping analysis of the field of computer and information ethics (C&IE). It provides a map of the relations between 400 key terms in the field. This term map can be used to get an overview of concepts and topics in the field and to identify relations between information and communication technology concepts on the one hand and ethical concepts on the other hand. To produce the term map, a data set of over thousand (...) articles published in leading journals and conference proceedings in the C&IE field was constructed. With the help of various computer algorithms, key terms were identified in the titles and abstracts of the articles and co-occurrence frequencies of these key terms were calculated. Based on the co-occurrence frequencies, the term map was constructed. This was done using a computer program called VOSviewer. The term map provides a visual representation of the C&IE field and, more specifically, of the organization of the field around three main concepts, namely privacy, ethics, and the Internet. (shrink)

In this paper, I first outline a model of Computer-Meditated Interaction (CMI) to distinguish between (1) CMI HCI-transparent (HCI = human-computer interaction) and (2) CMI HCI-dependent. Some main features of (1) are then analysed (data-radiation, data-tracking, internalisation of problem solving), while (2) is further divided into (2.1) CMI-HCI stand-alone and (2.2) CMI-HCI on-line. Some advantages and limits of (2.1) are suggested, together with an overview of the present and future strategies leading the production of new applications in the field. The (...) analysis of (2.2) provides a last distinction between communication-oriented and elaboration-oriented CMI-HCI on-line (i.e. CMC and NIA). A description of these two forms of CMI is then sketched, together with an interpretation of the new strategic view which should lead the projection of applications in the field, a possible agenda and a forecast of the chief effects of some present trends. (shrink)

This paper proposes an extensionalist analysis of computer simulations (CSs). It puts the emphasis not on languages nor on models, but on symbols, on their extensions, and on their various ways of referring. It shows that chains of reference of symbols in CSs are multiple and of different kinds. As they are distinct and diverse, these chains enable different kinds of remoteness of reference and different kinds of validation for CSs. Although some methodological papers have already underlined the role (...) of these various relationships of reference in CSs and of cross-validations, this diversity is still overlooked in the epistemological literature on CSs. As a consequence, a particular outcome of this analytical view is an ability to classify existing epistemological theses on CSs according to what their authors choose to select and put at the forefront: either the extensions of symbols, or the symbol-types, or the symbol-tokens, or the internal denotational hierarchies of the CS or the reference of these hierarchies to external denotational hierarchies. Through the adoption of this extensionalist view, it also becomes possible to explain more precisely the reasons why some complete reduction of CSs to classical epistemic paradigms such as “experiment” or “theoretical argument” remains doubtful. On this last point, in particular, this paper is in agreement with what many epistemologists already have acknowledged. (shrink)

In this paper, I revisit Frege's theory of sense and reference in the constructive setting of the meaning explanations of type theory, extending and sharpening a program–value analysis of sense and reference proposed by Martin-Löf building on previous work of Dummett. I propose a computational identity criterion for senses and argue that it validates what I see as the most plausible interpretation of Frege's equipollence principle for both sentences and singular terms. Before doing so, I examine Frege's implementation of (...) his theory of sense and reference in the logical framework of Grundgesetze, his doctrine of truth values, and views on sameness of sense as equipollence of assertions. (shrink)

Cloud computing has provided many opportunities to businesses and individuals. It enables global and on demand network access to a shared pool of resources with minimal management effort. However, this bliss has become a problem for latency-sensitive applications. To improve efficiency of cloud and to reduce the amount of data that needs to be transported to the cloud for data processing, analysis and storage, a new network architect technology 'Fog Computing' has been introduced. In fog computing, small applications and (...) resources are processed at the edge of the cloud, rather than processing entire applications on the cloud. (shrink)

Marr’s seminal distinction between computational, algorithmic, and implementational levels of analysis has inspired research in cognitive science for more than 30 years. According to a widely-used paradigm, the modelling of cognitive processes should mainly operate on the computational level and be targeted at the idealised competence, rather than the actual performance of cognisers in a specific domain. In this paper, we explore how this paradigm can be adopted and revised to understand mathematical problem solving. The computational-level approach applies methods (...) from computational complexity theory and focuses on optimal strategies for completing cognitive tasks. However, human cognitive capacities in mathematical problem solving are essentially characterised by processes that are computationally sub-optimal, because they initially add to the computational complexity of the solutions. Yet, these solutions can be optimal for human cognisers given the acquisition and enactment of mathematical practices. Here we present diagrams and the spatial manipulation of symbols as two examples of problem solving strategies that can be computationally sub-optimal but humanly optimal. These aspects need to be taken into account when analysing competence in mathematical problem solving. Empirically informed considerations on enculturation can help identify, explore, and model the cognitive processes involved in problem solving tasks. The enculturation account of mathematical problem solving strongly suggests that computational-level analyses need to be complemented by considerations on the algorithmic and implementational levels. The emerging research strategy can help develop algorithms that model what we call enculturated cognitive optimality in an empirically plausible and ecologically valid way. (shrink)

A large amount of data is maintained in every Social networking sites.The total data constantly gathered on these sites make it difficult for methods like use of field agents, clipping services and ad-hoc research to maintain social media data. This paper discusses the previous research on sentiment analysis.

I leave the work I’ve done to classify all UKLO questions below, with the latest appendices for historical record. From my recollection, this was the first complete system to classify all UKLO questions. Attempts at classifying UKLO questions before accounted for some questions but not others, leaving some questions unclassified. The classifications then were more labelling rather than a systemic approach that applied to all questions. As a result, this made it difficult for competitors and test development to find the (...) questions they were looking for by subject area, and to find related questions. There was a need to provide an organised and clean system to classify not just some but all the questions in order to establish fundamental classification data, basic statistics, and enhanced usability for test development and competitors. The system is provided below and was displayed on the website under technical information. I’ve decided to leave the system unedited with further commentary and general thoughts about mistakes made, analysis of the scope of UKLO questions, and future projections. Further improvements are being made to the classification system for a greater user experience, but so far the system has been a huge success and is fully working and operational. (shrink)

The problem of emergence in physical theories makes necessary to build a general theory of the relationships between the observed system and the observing system. It can be shown that there exists a correspondence between classical systems and computational dynamics according to the Shannon-Turing model. A classical system is an informational closed system with respect to the observer; this characterizes the emergent processes in classical physics as phenomenological emergence. In quantum systems, the analysis based on the computation theory fails. (...) It is here shown that a quantum system is an informational open system with respect to the observer and able to exhibit processes of observational, radical emergence. Finally, we take into consideration the role of computation in describing the physical world. (shrink)

In the last 20 years, a stream of research emerged under the label of „complex problem solving“ (CPS). This research was intended to describe the way people deal with complex, dynamic, and intransparent situations. Complex computer-simulated scenarios were as stimulus material in psychological experiments. This line of research lead to subtle insights into the way how people deal with complexity and uncertainty. Besides these knowledge-rich, realistic, intransparent, complex, dynamic scenarios with many variables, a second line of research used more simple, (...) knowledge-lean scenarios with a low number of variables („minimal complex systems“, MCS) that have been proposed recently in problem-solving research for the purpose of educational assessment. In both cases, the idea behind the use of microworlds is to increase validity of problem solving tasks by presenting interactive environments that can be explored and controlled by participants while pursuing certain action goals. The main argument presented here is: both types of systems - CPS and MCS – can only be dealt with successfully if causal dependencies between input and output variables are identified and used for system control. System knowledge is necessary for control and intervention. But CPS and MCS differ in their way of how causal dependencies are identified and how the mental model is constructed; therefore, they cannot be compared directly to each other with respect to the cognitive processes that are necessary for solving the tasks. Knowledge-poor MCS tasks address only a small fraction of the cognitive processes and structures needed for knowledge-rich CPS situations. (shrink)

In the article I discuss functionalist interpretations of Husserlian phenomenology. The first one was coined in the discussion between Hubert Dreyfus and Ronald McIntyre. They argue that Husserl’s phenomenology shares similarities with computational functionalism, and the key similarity is between the concept of noema and the concept of mental representation. I show the weaknesses of that reading and argue that there is another available functionalist reading of Husserlian phenomenology. I propose to shift perspective and approach the relation between phenomenology and (...) functionalism from a methodological perspective, specifically taking into account the functionalist explanatory strategy called functional analysis. I discuss the notion of function in Husserl’s works and Husserl’s idea of functional phenomenology. The key argument I develop is that in functional phenomenology we can find an explanatory strategy which is analogous to the strategy of functional decomposition used in functional analysis. I conclude that the proposed functionalist reading of phenomenology opens a new approach to the integration of phenomenology with cognitive sciences. (shrink)

Cultural code-switching concerns how we adjust our overall behaviours, manners of speaking, and appearance in response to a perceived change in our social environment. We defend the need to investigate cultural code-switching capacities in artificial intelligence systems. We explore a series of ethical and epistemic issues that arise when bringing cultural code-switching to bear on artificial intelligence. Building upon Dotson’s (2014) analysis of testimonial smothering, we discuss how emerging technologies in AI can give rise to epistemic oppression, and specifically, (...) a form of self-silencing that we call “cultural smothering.” By leaving the sociodynamic features of cultural code-switching unaddressed, AI systems risk negatively impacting already-marginalised social groups by widening opportunity gaps and further entrenching social inequalities. (shrink)

Community detection is a major issue in network analysis. This paper combines a socio-historical approach with an experimental reconstruction of programs to investigate the early automation of clique detection algorithms, which remains one of the unsolved NP-complete problems today. The research led by the archaeologist Jean-Claude Gardin from the 1950s on non-numerical information and graph analysis is retraced to demonstrate the early contributions of social sciences and humanities. The limited recognition and reception of Gardin's innovative computer application to (...) the humanities are addressed through two factors, in addition to the effects of historiography and bibliographies on the recording, discoverability, and reuse of scientific productions: (1) funding policies, evidenced by the transfer of research effort on graph applications from temporary interdisciplinary spaces to disciplinary organizations related to the then-emerging field of computer science; and (2) the erratic careers of algorithms, in which efficiency, flaws, corrections, and authors’ status, were determining factors. (shrink)

The paper provides a critical review of the debate on the foundations of Computer Ethics (CE). Starting from a discussion of Moor’s classic interpretation of the need for CE caused by a policy and conceptual vacuum, five positions in the literature are identified and discussed: the “no resolution approach”, according to which CE can have no foundation; the professional approach, according to which CE is solely a professional ethics; the radical approach, according to which CE deals with absolutely unique issues, (...) in need of a unique approach; the conservative approach, according to which CE is only a particular applied ethics, discussing new species of traditional moral issues; and the innovative approach, according to which theoretical CE can expand the metaethical discourse with a substantially new perspective. In the course of the analysis, it is argued that, although CE issues are not uncontroversially unique, they are sufficiently novel to render inadequate the adoption of standard macroethics, such as Utilitarianism and Deontologism, as the foundation of CE and hence to prompt the search for a robust ethical theory. Information Ethics (IE) is proposed for that theory, as the satisfactory foundation for CE. IE is characterised as a biologically unbiased extension of environmental ethics, based on the concepts of information object/infosphere/entropy rather than life/ecosystem/pain. In light of the discussion provided in this paper, it is suggested that CE is worthy of independent study because it requires its own application-specific knowledge and is capable of supporting a methodological foundation, IE. (shrink)

We describe a software system for the analysis of defined benefit actuarial plans. The system uses a recursive formulation of the actuarial stochastic processes to implement precise and efficient computations of individual and group cash flows.

This paper makes a novel linkage between the multiple-computations theorem in philosophy of mind and Landauer’s principle in physics. The multiple-computations theorem implies that certain physical systems implement simultaneously more than one computation. Landauer’s principle implies that the physical implementation of “logically irreversible” functions is accompanied by minimal entropy increase. We show that the multiple-computations theorem is incompatible with, or at least challenges, the universal validity of Landauer’s principle. To this end we provide accounts of both ideas in terms of (...) low-level fundamental concepts in statistical mechanics, thus providing a deeper understanding of these ideas than their standard formulations given in the high-level terms of thermodynamics and cognitive science. Since Landauer’s principle is pivotal in the attempts to derive the universal validity of the second law of thermodynamics in statistical mechanics, our result entails that the multiple-computations theorem has crucial implications with respect to the second law. Finally, our analysis contributes to the understanding of notions, such as “logical irreversibility,” “entropy increase,” “implementing a computation,” in terms of fundamental physics, and to resolving open questions in the literature of both fields, such as: what could it possibly mean that a certain physical process implements a certain computation. (shrink)

In this paper, the notion of degree of inconsistency is introduced as a tool to evaluate the sensitivity of the Full Bayesian Significance Test (FBST) value of evidence with respect to changes in the prior or reference density. For that, both the definition of the FBST, a possibilistic approach to hypothesis testing based on Bayesian probability procedures, and the use of bilattice structures, as introduced by Ginsberg and Fitting, in paraconsistent logics, are reviewed. The computational and theoretical advantages of using (...) the proposed degree of inconsistency based sensitivity evaluation as an alternative to traditional statistical power analysis is also discussed. (shrink)

Philosophers have relied on visual metaphors to analyse ideas and explain their theories at least since Plato. Descartes is famous for his system of axes, and Wittgenstein for his first design of truth table diagrams. Today, visualisation is a form of ‘computer-aided seeing’ information in data. Hence, information is the fundamental ‘currency’ exchanged through a visualisation pipeline. In this article, we examine the types of information that may occur at different stages of a general visualization pipeline. We do so from (...) a quantitative and a qualitative perspective. The quantitative analysis is developed on the basis of Shannon’s information theory. The qualitative analysis is developed on the basis of Floridi’s taxonomy in the philosophy of information. We then discuss in detail how the condition of the ‘data processing inequality’ can be broken in a visualisation pipeline. This theoretic finding underlines the usefulness and importance of visualisation in dealing with the increasing problem of data deluge. We show that the subject of visualisation should be studied using both qualitative and quantitative approaches, preferably in an interdisciplinary synergy between information theory and the philosophy of information. (shrink)

In its origins educational neuroscience has started as an endeavor to discuss implications of neuroscience studies for education. However, it is now on its way to become a transdisciplinary field, incorporating findings, theoretical frameworks and methodologies from education, and cognitive and brain sciences. Given the differences and diversity in the originating disciplines, it has been a challenge for educational neuroscience to integrate both theoretical and methodological perspective in education and neuroscience in a coherent way. We present a multi-level framework for (...) educational neuroscience, which argues for integration of multiple levels of analysis, some originating in brain and cognitive sciences, others in education, as a roadmap for the future of educational neuroscience with concrete examples in moral education. (shrink)

This capstone project aimed to develop an offline computer-based assessment (CBA) tool that uses a computer instead of a traditional paper test in evaluating student learning. This addresses the difficulties faced by teachers in administering quarterly assessments. Incorporating technology into student assessment can increase student interest because of the immediate feedback generated automatically and can help teachers improve their work performance. This capstone project employed a developmental approach and utilized a modified ADDIE (Analysis, Design, and Development) model to design (...) the tool using Microsoft PowerPoint and Excel. Ten experts in mathematics, ICT, and assessment validated the face and content validity of the developed CBA tool. Based on the panel’s evaluation, the developed offline CBA tool in Statistics and Probability has passed all the assigned criteria, such as functionality, usability, efficiency, technicality, and accessibility. Overall, the developed CBA tool is suitable for use to address assessment-related issues. (shrink)