In the educational hypermedia domain, adaptive systems try to adapt educational materials according to the required properties of a user. The adaptability of these systems becomes more effective once the system has the knowledge about how a student can learn better. Studies suggest that, for effective personalization, one of the important features is to know precisely the learning style of a student. However, learning styles are dynamic and may vary domain-wise. To address such aspects of learning styles, we have proposed (...) a computationally efficient solution that considers the dynamic and nondeterministic nature of learning styles, effect of the subject domain, and nonstationary aspect during the learning process. The proposed model is novel, robust, and flexible to optimize students’ domain-wise learning style preferences for better content adaptation. We have developed a web-based experimental prototype for assessment and validation. The proposed model is compared with the existing available learning style-based model, and the experimental results show that personalization based on incorporating discipline-wise learning style variations becomes more effective. (shrink)

Cooper (1983) pioneered underspecified scope representation in formal and computational semantics through his introduction of quantifier storage into Montague semantics as an alternative to the syntactic operation of quantifying-in. In this paper we address an important issue in the development of an adequate formal theory of underspecified semantics. The tension between expressive power and computational tractability poses an acute problem for any such theory. Ebert (2005) shows that any reasonable current treatment of underspecified semantic representation either suffers from (...) expressive incompleteness or produces a combinatorial explosion that is equivalent to generating the full set of possible scope readings in the course of disambiguation. In previous work we have presented an account of underspecified scope representations within Property Theory with Curry Typing (PTCT), an intensional first-order theory for natural language semantics. Here we show how filters applied to the underspecified-scope terms of PTCT permit both expressive completeness and the reduction of computational complexity in a significant class of non-worst case scenarios. (shrink)

The tension between expressive power and computational tractability poses an acute problem for theories of underspecified semantic representation. In previous work we have presented an account of underspecified scope representations within Property Theory with Curry Typing, an intensional first-order theory for natural language semantics. Here we show how filters applied to the underspecified-scope terms of PTCT permit both expressive completeness and the reduction of computational complexity in a significant class of non-worst case scenarios.

A central problem in the cognitive sciences is identifying the link between consciousness and neural computation. The key features of consciousness—including the emergence of representative information content and the initiation of volitional action—are correlated with neural activity in the cerebral cortex, but not computational processes in spinal reflex circuits or classical computing architecture. To take a new approach toward considering the problem of consciousness, it may be worth re‐examining some outstanding puzzles in neuroscience, focusing on differences between the cerebral (...) cortex and spinal reflex circuits. First, the mammalian cerebral cortex exhibits exascale computational power, a feature that is not strictly correlated with the number of binary computational units; second, individual computational units engage in noisy coding, allowing random electrical events to gate signaling outcomes; third, this noisy coding results in the synchronous firing of statistically random populations of cells across the neural network, at a range of nested frequencies; fourth, the system grows into a more ordered state over time, as it encodes the predictive value gained through observation; and finally, the cerebral cortex is extraordinarily energy efficient, with very little free energy lost to entropy during the work of information processing. Here, I argue that each of these five key features suggest the mammalian brain engages in probabilistic computation. Indeed, by modeling the physical mechanisms of probabilistic computation, we may find a better way to explain the unique emergent features arising from cortical neural networks. (shrink)

Internet of Things is expanding and evolves into all aspects of the society. Research and developments in the field of IoT have shown the possibility of producing huge volume of data and computation among different devices of the IoT. The data collected from IoT devices are transferred to a central server which can further be retrieved and accessed by the service providers for analyzing, processing, and using. Industrial Internet of Health Things is the expansion of the Internet of Health Things (...) which plays an important role in observing, consulting, monitoring, and treatment process of remote exchange data processes. The linkage of computation and interoperability are supported through various intelligent sensors, controllers, and actuators. The role of parallel computing for efficient and Intelligent Industrial Internet of Health Things is obvious to analyze and process different healthcare situations. A detailed overview of this existing literature is needed through which the research community will provide new solutions for efficient healthcare with the help of IoT based on parallel computing. Therefore, the current study presents a detailed overview of the existing literature for facilitating IIoHT. (shrink)

This book brings together the latest technological research in computational intelligence and fuzzy logic as a way to care for our environment, highlighting current advances and future trends in environmental sustainability using the principles of soft computing.

This book illustrates the program of Logical-Informational Dynamics. Rational agents exploit the information available in the world in delicate ways, adopt a wide range of epistemic attitudes, and in that process, constantly change the world itself. Logical-Informational Dynamics is about logical systems putting such activities at center stage, focusing on the events by which we acquire information and change attitudes. Its contributions show many current logics of information and change at work, often in multi-agent settings where social behavior is essential, (...) and often stressing Johan van Benthem's pioneering work in establishing this program. However, this is not a Festschrift, but a rich tapestry for a field with a wealth of strands of its own. The reader will see the state of the art in such topics as information update, belief change, preference, learning over time, and strategic interaction in games. Moreover, no tight boundary has been enforced, and some chapters add more general mathematical or philosophical foundations or links to current trends in computer science. (shrink)

The integration of computer science, biology, and engineering has resulted in the emergence of rapidly growing interdisciplinary fields such as bioinformatics, bioengineering, DNA computing, and systems and synthetic biology. Ideas derived from computer science and engineering can provide innovative solutions to biological problems and advance research in new directions. Although interdisciplinary research has become increasingly prevalent in recent years, the scientists contributing to these efforts largely remain specialists in their original disciplines and are not fully capable of covering the many (...) facets of multidisciplinary problems, which impedes the development of truly integrated solutions. It would be .. (shrink)

Recent new paradigms of computation, based on biological and physical models, address in a radically new way questions of efficiency and challenge assumptions ...

A distinguishing feature of neural computation and information processing is that it fits models that describe the most efficient strategies for performing different cognitive tasks. Efficiency determines a distinctive sense of teleology involving optimal performance and resource management through a specific strategy. I articulate this kind of teleology and call it efficient teleological function. I argue that efficient teleological function is compatible with mechanistic explanation and, most likely, neural computational mechanisms are efficiently functional in this sense. They are (...) members of a distinctive class of computational mechanisms whose efficiency is intertwined with their functionality. This is illustrated by widely discussed approaches to mind, such as Barlow’s efficient coding hypothesis or the ones associated with the so-called “predictive mind”, which propose that the brain employs highly efficient coding strategies to save energy resources that are critical to the organism’s survival. (shrink)

The computer’s effect on our understanding of causation has been enormous. By the mid‐1980s, philosophical and social‐scientific work on the topic had left us with (1) no reasonable reductive account of causation and (2) a class of statistical causal models tied to linear regression. At this time, computer scientists were attacking the problem of equipping robots with models of the external that included probabilistic portrayals of uncertainty. To solve the problem of efficiently storing such knowledge, they introduced Bayes Networks and (...) directed graphs. By attaching a causal interpretation to Bayes Networks, the philosophy of causation changed dramatically. We are now able to be extremely general about how causal structure connects to data, and systematic about when causal structures are empirically indistinguishable. In this essay I try to motivate and describe this synthesis. (shrink)

We introduce a notion of relative efficiency for axiom systems. Given an axiom system Aβ for a theory T consistent with S12, we show that the problem of deciding whether an axiom system Aα for the same theory is more efficient than Aβ is II2-hard. Several possibilities of speed-up of proofs are examined in relation to pairs of axiom systems Aα, Aβ, with Aα ⊇ Aβ, both in the case of Aα, Aβ having the same language, and in the (...) case of the language of Aα extending that of Aβ: in the latter case, letting Prα, Prβ denote the theories axiomatized by Aα, Aβ, respectively, and assuming Prα to be a conservative extension of Prβ, we show that if Aα — Aβ contains no nonlogical axioms, then Aα can only be a linear speed-up of Aβ; otherwise, given any recursive function g and any Aβ, there exists a finite extension Aα of Aβ such that Aα is a speed-up of Aβ with respect to g. (shrink)

To explain why, in scientific problem solving, a diagram can be “worth ten thousand words,” Jill Larkin and Herbert Simon (1987) relied on a computer model: two representations can be “informationally” equivalent but differ “computationally,” just as the same data can be encoded in a computer in multiple ways, more or less suited to different kinds of processing. The roots of this proposal lay in cognitive psychology, more precisely in the “imagery debate” of the 1970s on whether there are image-like (...) mental representations. Simon (1972, 1978) hoped to solve this debate by thoroughly reducing the differences between forms of mental representations (e.g., between images and sentences) to differences in computational efficiency; to carry out this reduction, he borrowed from computer science the concepts of data type and of data structure. I argue that, in the end, his account amounted to nothing more than characterizing representations by the fast operations on them. This analysis then allows me to assess what Simon’s approach actually achieves when transported from psychology to the study of scientific representations, as in Larkin and Simon (1987): it allows comparing, not representations in and of themselves, but rather the computational roles they play in particular problem-solving processes—that is, representations together with a particular way of using them. (shrink)

Combining physics, mathematics and computer science, quantum computing and its sister discipline of quantum information have developed in the past few decades from visionary ideas to two of the most fascinating areas of quantum theory. General interest and excitement in quantum computing was initially triggered by Peter Shor (1994) who showed how a quantum algorithm could exponentially “speed-up” classical computation and factor large numbers into primes far more efficiently than any (known) classical algorithm. Shor’s algorithm was soon followed by several (...) other algorithms that aimed to solve combinatorial and algebraic problems, and in the years since theoretical study of quantum systems serving as computational devices has achieved tremendous progress. Common belief has it that the implementation of Shor’s algorithm on a large scale quantum computer would have devastating consequences for current cryptography protocols which rely on the premise that all known classical worst-case algorithms for factoring take time exponential in the length of their input (see, e.g., Preskill 2005). Consequently, experimentalists around the world are engaged in attempts to tackle the technological difficulties that prevent the realisation of a large scale quantum computer. But regardless whether these technological problems can be overcome (Unruh 1995; Ekert and Jozsa 1996; Haroche and Raimond 1996), it is noteworthy that no proof exists yet for the general superiority of quantum computers over their classical counterparts. -/- The philosophical interest in quantum computing is manifold. From a social-historical perspective, quantum computing is a domain where experimentalists find themselves ahead of their fellow theorists. Indeed, quantum mysteries such as entanglement and nonlocality were historically considered a philosophical quibble, until physicists discovered that these mysteries might be harnessed to devise new efficient algorithms. But while the technology for harnessing the power of 50–100 qubits (the basic unit of information in the quantum computer) is now within reach (Preskill 2018), only a handful of quantum algorithms exist, and the question of whether these can truly outperform any conceivable classical alternative is still open. From a more philosophical perspective, advances in quantum computing may yield foundational benefits. For example, it may turn out that the technological capabilities that allow us to isolate quantum systems by shielding them from the effects of decoherence for a period of time long enough to manipulate them will also allow us to make progress in some fundamental problems in the foundations of quantum theory itself. Indeed, the development and the implementation of efficient quantum algorithms may help us understand better the border between classical and quantum physics (Cuffaro 2017, 2018a; cf. Pitowsky 1994, 100), and perhaps even illuminate fundamental concepts such as measurement and causality. Finally, the idea that abstract mathematical concepts such as computability and complexity may not only be translated into physics, but also re-written by physics bears directly on the autonomous character of computer science and the status of its theoretical entities—the so-called “computational kinds”. As such it is also relevant to the long-standing philosophical debate on the relationship between mathematics and the physical world. (shrink)

Almost from the inception of Hilbert's program, foundational and structural efforts in proof theory have been directed towards the goal of clarifying the computational content of modern mathematical methods. This essay surveys various methods of extracting computational information from proofs in classical first-order arithmetic, and reflects on some of the relationships between them. Variants of the Godel-Gentzen double-negation translation, some not so well known, serve to provide canonical and efficient computational interpretations of that theory.

L’analisi informatica di testi filosofici, la creazione di database, ipertesti o edizioni elettroniche non costituiscono più unicamente una ricerca di frontiera, ma sono da molti anni una risorsa preziosa per gli studi umanistici. Ora, non si tratta di richiedere alle macchine un ulteriore sforzo per comprendere il linguaggio umano, quanto piuttosto di perfezionare gli strumenti affinché esse possano essere a tutti gli effetti collaboratori di ricerca. Questo articolo è concepito come il resoconto di un esperimento finalizzato a documentare come le (...) associazioni lessicali di un gruppo selezionato di testi medievali possa offrire qualche suggerimento in merito ai loro contenuti teorici. Computer analysis of texts, creation of databases hypertexts and digital editions are not the final frontier of research anymore. Quite the contrary, from many years they have been representing a significant contribution to medieval studies. Therefore, we do not mean to make the computer able to grasp the meaning of human language and penetrate its secrets, but rather we aim at improving their tools, so that they will become an even more efficient equipment employed in research activities. This paper is thought as a sort of technical report with the proposed task to verify if an automatic identification of some word associations within a selected groups of medieval writings produces suggestions on the subject of the processed texts, able to be used in a theoretical inquiry. (shrink)

This paper describes a theory that explains both the creativity and the efficiency of people's conceptual combination. In the constraint theory, conceptual combination is controlled by three constraints of diagnosticity, plausibility, and informativeness. The constraints derive from the pragmatics of communication as applied to compound phrases. The creativity of combination arises because the constraints can be satisfied in many different ways. The constraint theory yields an algorithmic model of the efficiency of combination. The C3 model admits the full (...) creativity of combination and yet efficiently settles on the best interpretation for a given phrase. The constraint theory explains many empirical regularities in conceptual combination, and makes various empirically verified predictions. In computer simulations of compound phrase interpretation, the C3 model has produced results in general agreement with people's responses to the same phrases. (shrink)

Normative positions are sometimes illustrated in diagrams, in particular in didactic contexts. Traditional examples are the Aristotelian polygons of opposition for deontic modalities (squares, triangles, hexagons, etc.), and the Hohfeldian squares for obligative and potestative concepts. Relying on previous work, we show that Hohfeld’s framework can be used as a basis for developing several Aristotelian polygons and more complex diagrams. Then, we illustrate how logical theories of increasing strength can be built based on these diagrams, and how those theories enable (...) us to determine in a computably efficient way whether a set of normative positions can be derived from another set of normative positions. (shrink)

This essay argues that through a new and radical relationship with digital technologies that are oriented towards networking and automaticity, humans have become estranged from what philosopher Arnold Gehlen termed the ‘circle of action’ that expressed our ancient adaptation to tool use and constituted the basis for our capacity for reflective consciousness. The objectification of the material and analogue relationship that enabled humans to ‘act’ upon the world and to construct the basis for our collective endeavours, this paper shows, is (...) beginning to redirect the social orientation that tool use enabled, back to a form of individualism I term a ‘post-modern vanity’. Computer-driven automation on a networked and global scale is engendering a new illusion regarding our relationship with technology. Greek philosophy, later religion, and then the Enlightenment all saw our relation to technology as evidence of either our ‘specialness’ or our inherent ‘mastery over nature’. These perspectives resulted in our acquiring a ‘reasoned self-delusion’ wherein for the individual life had meaning and was ontologically tolerable—we thought ourselves to be of a realm beyond raw nature. Automation, however, to an unprecedented degree, objectifies and exteriorizes the processes of technology use, alienating the individual from the ‘circle of action’. This process is throwing us back to another form of what this essay terms a ‘reasoned self-delusion’ where we increasingly believe that we no longer need each other so much. The cult of computer efficiency and the virtual sphere of the network that it has spawned, I argue, is a largely barren sphere of radical individualism, a post-modern vanity, where we exist at a borderland closer to nature and to the animals than we have been for thousands of years. (shrink)

I describe a pedagogical scheme devised to teach efficiently to computer scientists just enough quantum mechanics to permit them to understand the theoretical developments of the last decade going under the name of ''quantum computation.'' I then note that my offbeat approach to quantum mechanics, designed to be maximally efficacious for this specific educational purpose, is nothing other than the Copenhagen interpretation.

The debate between the amodal and the grounded views of cognition seems to be stuck. Their only substantial disagreement is about the vehicle or format of concepts. Amodal theorists reject the grounded claim that concepts are couched in the same modality-specific format as representations in sensory systems. The problem is that there is no clear characterization of format or its neural correlate. In order to make the disagreement empirically meaningful and move forward in the discussion we need a neurocognitive criterion (...) for representational format. I argue that efficient coding models in computational neuroscience can be used to characterize modal codes: These are codes which satisfy special informational demands imposed by sensory tasks. Additionally, I examine recent studies on neural coding and argue that although they do not provide conclusive evidence for either the grounded or the amodal views, they can be used to determine what predictions these approaches can make and what experimental and theoretical developments would be required to settle the debate. (shrink)

Recent work on the evolution of social contracts and conventions has often used models of bargaining games, with reinforcement learning. A recent innovation is the requirement that every strategy must be invented either through through learning or reinforcement. However, agents frequently get stuck in highly-reinforced “traps” that prevent them from arriving at outcomes that are efficient or fair to the both players. Agents face a trade-off between exploration and exploitation, i.e. between continuing to invent new strategies and reinforcing strategies that (...) have already become highly reinforced by yielding high rewards. In this paper I systematically study the relationship between rates of invention and the efficiency and fairness of outcomes in two-player, repeated bargaining games. I use a basic reinforcement learning model with invention, and five variations of this model, designed introduce various forms of forgetting, to prioritize more recent reinforcement, or to maintain a higher rate of invention. I use computer simulations to investigate the outcomes of each model. Each models shows qualitative similarities in the relationship between the efficiency and fairness of outcomes, and the relative amount of exploration or exploitation that takes place. Surprisingly, there are often trade-offs between the efficiency and the fairness of the outcomes. (shrink)

The purpose of this paper is to argue against the claim that morphological computation is substantially different from other kinds of physical computation. I show that some (but not all) purported cases of morphological computation do not count as specifically computational, and that those that do are solely physical computational systems. These latter cases are not, however, specific enough: all computational systems, not only morphological ones, may (and sometimes should) be studied in various ways, including their energy (...) efficiency, cost, reliability, and durability. Second, I critically analyze the notion of “offloading” computation to the morphology of an agent or robot, by showing that, literally, computation is sometimes not offloaded but simply avoided. Third, I point out that while the morphology of any agent is indicative of the environment that it is adapted to, or informative about that environment, it does not follow that every agent has access to its morphology as the model of its environment. (shrink)

Ockham’s razor is the principle that, all other things being equal, scientists ought to prefer simpler theories. In recent years, philosophers have argued that simpler theories make better predictions, possess theoretical virtues like explanatory power, and have other pragmatic virtues like computational tractability. However, such arguments fail to explain how and why a preference for simplicity can help one find true theories in scientific inquiry, unless one already assumes that the truth is simple. One new solution to that problem (...) is the Ockham efficiency theorem, which states that scientists who heed Ockham’s razor retract their opinions less often and sooner than do their non-Ockham competitors. The theorem neglects, however, to consider competitors following random strategies and in many applications random strategies are known to achieve better worst-case loss than deterministic strategies. In this paper, we describe two ways to extend the result to a very general class of random, empirical strategies. The first extension concerns expected retractions, retraction times, and errors and the second extension concerns retractions in chance, times of retractions in chance, and chances of errors. (shrink)

I propose that empirical procedures, like computational procedures, are justified in terms of truth-finding efficiency. I contrast the idea with more standard philosophies of science and illustrate it by deriving Ockham's razor from the aim of minimizing dramatic changes of opinion en route to the truth.

Semantic categories in the world's languages often reflect a historical process of chaining: A name for one referent is extended to a conceptually related referent, and from there on to other referents, producing a chain of exemplars that all bear the same name. The beginning and end points of such a chain might in principle be rather dissimilar. There is also evidence supporting a contrasting picture: Languages tend to support efficient, informative communication, often through semantic categories in which all exemplars (...) are similar. Here, we explore this tension through computational analyses of existing cross-language naming and sorting data from the domain of household containers. We find formal evidence for historical semantic chaining, and evidence that systems of categories in this domain nonetheless support near-optimally efficient communication. Our results demonstrate that semantic chaining is compatible with efficient communication, and they suggest that chaining may be constrained by the functional need for efficient communication. (shrink)

Over the last few years, a new methodology to address the P versus NP problem has been developed, based on searching for borderlines between the nonefficiency of computing models and the presumed efficiency. These borderlines can be seen as frontiers of efficiency, which are crucial in this methodology. “Translating,” in some sense, an efficient solution in a presumably efficient model to an efficient solution in a nonefficient model would give an affirmative answer to problem P versus NP. In (...) the framework of Membrane Computing, the key of this approach is to detect the syntactic or semantic ingredients that are needed to pass from a nonefficient class of membrane systems to a presumably efficient one. This paper deals with tissue P systems with communication rules of type symport/antiport allowing the evolution of the objects triggering the rules. In previous works, frontiers of efficiency were found in these kinds of membrane systems both with division rules and with separation rules. However, since they were not optimal, it is interesting to refine these frontiers. In this work, optimal frontiers of the efficiency are obtained in terms of the total number of objects involved in the communication rules used for that kind of membrane systems. These optimizations could be easier to translate, if possible, to efficient solutions in a nonefficient model. (shrink)

This study examined cognitive predictors of susceptibility to orientation illusions: Poggendorff, Ponzo, and Zöllner. It was assumed that lower efficiency of information processing in WM and higher field dependence are conducive to orientation illusions. 61 architects aged M = 29, +/- 1.6, and 49 university students aged M = 23.53, +/- 4.24, were tested with Witkin’s EFT to assess their field dependence; the SWATT method was used as a measure of WM efficiency, and susceptibility to visual illusions was (...) verified with a series of computer tasks. We obtained a small range of the explained variance in the regression models including FDI and WM indicators. On the basis of WM efficiency indicators, we managed to confirm the existence of memory predictors of susceptibility to illusions. Among the architects, lower efficiency of WM processing and higher field dependence are responsible for greater susceptibility to orientation illusions. (shrink)

Distributive justice decision making tends to require a trade off between different valued outcomes. The present study tracked computer mouse cursor movements in a forced-choice paradigm to examine for tension between different parameters of distributive justice during the decision-making process. Participants chose between set meal distributions, to third parties, that maximised either equality (the evenness of the distribution) or efficiency (the total number of meals distributed). Across different formulations of these dilemmas, responding was consistent with the notion that individuals (...) tend to base decisions in part on the magnitude of these parameters. In addition, dilemmas associated with inconsistent responding across the sample tended to elicit the greatest spatial deviation of the cursor, potentially reflecting dilemma difficulty. One interpretation of these results is that individuals value equality and efficiency in such a way that moral dilemmas are resolved by comparing the perceived value of these qualitatively different parameters, consistent with a value pluralistic framework of decision making. A post-hoc analysis indicated that individuals also incorporated sufficiency concerns during distributive justice decision making. The results are discussed in relation to political philosophy. (shrink)

This paper is motivated by the increasing popularity of efficient designs for stated choice experiments. The objective in efficient designs is to create a stated choice experiment that minimizes the standard errors of the estimated parameters. In order to do so, such designs require specifying prior values for the parameters to be estimated. While there is significant literature demonstrating the efficiency improvements of employing efficient designs, the bulk of the literature tests conditions where the priors used to generate the (...) efficient design are assumed to be accurate. However, there is substantially less literature that compares how different design types perform under varying degree of error of the prior. The literature that does exist assumes small fractions are used, which is in contrast to computer-aided surveys that readily allow for large fractions. Further, the results in the literature are abstract in that there is no reference point to provide clear insight on the magnitude of any issue. Our objective is to analyze the robustness of different designs within a typical stated choice experiment context of a trade-off between price and quality. We use as an example transportation mode choice, where the key parameter to estimate is the value of time. Within this context, we test many designs to examine how robust efficient designs are against a misspecification of the prior parameters. The simple mode choice setting allows for insightful visualizations of the designs themselves and also an interpretable reference point for the range in which each design is robust. Not surprisingly, the D-efficient design is most efficient in the region where the true population VOT is near the prior used to generate the design: the prior is $20/h and the efficient range is $10–$30/h. However, the D-efficient design quickly becomes the most inefficient outside of this range, and the estimation significantly degrades above $50/h. The orthogonal and random designs are robust for a much larger range of VOT. The robustness of Bayesian efficient designs varies depending on the variance that the prior assumes. Implementing two-stage designs that first use a small sample to estimate priors are also not robust relative to uninformative designs. Arguably, the random design performs as well as any design, and it will perform even better if data cleaning is done to remove choice tasks where one alternative dominates the other. (shrink)

A brain-computer interface technology that can decode the neural signals associated with attempted but unarticulated speech could offer a future efficient means of communication for people with severe motor impairments. Recent demonstrations have validated this approach. Here we assume that it will be possible in future to decode imagined (i.e., attempted but unarticulated) speech in people with severe motor impairments, and we consider the characteristics that could maximize the social utility of a BCI for communication. As a social interaction, communication (...) involves the needs and goals of both speaker and listener, particularly in contexts that have significant potential consequences. We explore three high-consequence legal situations in which neurally-decoded speech could have implications:Testimony, where decoded speech is used as evidence;Consent and Capacity, where it may be used as a means of agency and participation such as consent to medical treatment; andHarm, where such communications may be networked or may cause harm to others. We then illustrate how design choices might impact the social and legal acceptability of these technologies. (shrink)

A quantum algorithm succeeds not because the superposition principle allows ‘the computation of all values of a function at once’ via ‘quantum parallelism’, but rather because the structure of a quantum state space allows new sorts of correlations associated with entanglement, with new possibilities for information‐processing transformations between correlations, that are not possible in a classical state space. I illustrate this with an elementary example of a problem for which a quantum algorithm is more efficient than any classical algorithm. I (...) also introduce the notion of ‘pseudotelepathic’ games and show how the difference between classical and quantum correlations plays a similar role here for games that can be won by quantum players exploiting entanglement, but not by classical players whose only allowed common resource consists of shared strings of random numbers (common causes of the players’ correlated responses in a game). *Received October 2008. †To contact the author, please write to: Department of Philosophy, University of Maryland, College Park, MD 20742; e‐mail: jbub@umd.edu. (shrink)

Increasingly, biologists are using computers to model and to create biological representations. However, the exponential growth in available biological dataposes a challenge for experimental and theoretical researchers in both Biology and in Computer Science. In short, when even the simple retrieval of relevant biological information for a researcher becomes a complex task — its analysis and synthesis with other biological information will become even more daunting and unlikely. In this context, specially organized ‘structures of representation’ are needed for the efficient (...) interpretation of experimentally generated data. The “semantic Web” is a recent trend in networking techniques that we will examine here as a possible strategy for the computation of biological data — one that may allow us to take into account both the semiotic dimensions of biological processes, as well as their dynamic organization into stable and systemic levels. Thereupon, we propose that a semantic network for biology could benefit from principles rooted in such previous representation efforts as computer-generated ‘landscapes’ and ‘physical attractors’ — and that such principles could, in turn, then be better integrated into biological research through the development of a more semiotically informed user / computer interface design. (shrink)

With the development of mobile communication technology, location-based services are booming prosperously. Meanwhile privacy protection has become the main obstacle for the further development of LBS. The k-nearest neighbor search is one of the most common types of LBS. In this paper, we propose an efficient private circular query protocol with high accuracy rate and low computation and communication cost. We adopt the Moore curve to convert two-dimensional spatial data into one-dimensional sequence and encrypt the points of interest information with (...) the Brakerski-Gentry-Vaikuntanathan homomorphic encryption scheme for privacy-preserving. The proposed scheme performs the secret circular shift of the encrypted POIs information to hide the location of the user without a trusted third party. To reduce the computation and communication cost, we dynamically divide the table of the POIs information according to the value of k. Experiments show that the proposed scheme provides high accuracy query results while maintaining low computation and communication cost. (shrink)

In order to deal with high-dimensional distributed data, this article develops a novel and communication-efficient approach for sparse and high-dimensional data with the penalized quantile regression. In each round, the proposed method only requires the master machine to deal with a sparse penalized quantile regression which could be realized fastly by proximal alternating direction method of multipliers algorithm and the other worker machines to compute the subgradient on local data. The advantage of the proximal ADMM algorithm is that it could (...) make every parameter of iteration to have closed formula even in high-dimensional case, which greatly improves the speed of calculation. As for the communication efficiency, the proposed method does not sacrifice any statistical accuracy and provably improves the estimation error obtained by centralized method, provided the penalty levels are chosen properly. Moreover, the asymptotic properties of the proposed estimation and the convergence of the algorithm are convincible. Especially, it presents extensive experiments on both the numerical simulations and the HIV drug resistance data analysis, which all confirm the significant efficiency of our proposed method in quantile regression for distributed data by comparative and empirical analysis. (shrink)

Advances in artificial intelligence have raised a basic question about human intelligence: Is human reasoning best emulated by applying task‐specific knowledge acquired from a wealth of prior experience, or is it based on the domain‐general manipulation and comparison of mental representations? We address this question for the case of visual analogical reasoning. Using realistic images of familiar three‐dimensional objects (cars and their parts), we systematically manipulated viewpoints, part relations, and entity properties in visual analogy problems. We compared human performance to (...) that of two recent deep learning models (Siamese Network and Relation Network) that were directly trained to solve these problems and to apply their task‐specific knowledge to analogical reasoning. We also developed a new model using part‐based comparison (PCM) by applying a domain‐general mapping procedure to learned representations of cars and their component parts. Across four‐term analogies (Experiment 1) and open‐ended analogies (Experiment 2), the domain‐general PCM model, but not the task‐specific deep learning models, generated performance similar in key aspects to that of human reasoners. These findings provide evidence that human‐like analogical reasoning is unlikely to be achieved by applying deep learning with big data to a specific type of analogy problem. Rather, humans do (and machines might) achieve analogical reasoning by learning representations that encode structural information useful for multiple tasks, coupled with efficient computation of relational similarity. (shrink)

In response to the ever-increasing spread of online disinformation and misinformation, several human–computer interaction tools to enhance data literacy have been developed. Among them, many employ elements of gamification to increase user engagement and reach out to a broader audience. However, there are no systematic criteria to analyze their relevance and impact for building fake news resilience, partly due to the lack of a common understanding of data literacy. In this paper we put forward an operationalizable definition of data literacy (...) as a form of multidimensional critical thinking. We then survey 22 existing tools and classify them according to a framework of 10 criteria pointing to their gameful design and educational features. Through a comparative/contrastive analysis informed by a focus group, we provide a principled set of guidelines to develop more efficient human–computer interaction tools to teach how to critically think in the current media ecosystem. (shrink)

Words are the essence of communication: They are the building blocks of any language. Learning the meaning of words is thus one of the most important aspects of language acquisition: Children must first learn words before they can combine them into complex utterances. Many theories have been developed to explain the impressive efficiency of young children in acquiring the vocabulary of their language, as well as the developmental patterns observed in the course of lexical acquisition. A major source of (...) disagreement among the different theories is whether children are equipped with special mechanisms and biases for word learning, or their general cognitive abilities are adequate for the task. We present a novel computational model of early word learning to shed light on the mechanisms that might be at work in this process. The model learns word meanings as probabilistic associations between words and semantic elements, using an incremental and probabilistic learning mechanism, and drawing only on general cognitive abilities. The results presented here demonstrate that much about word meanings can be learned from naturally occurring child-directed utterances (paired with meaning representations), without using any special biases or constraints, and without any explicit developmental changes in the underlying learning mechanism. Furthermore, our model provides explanations for the occasionally contradictory child experimental data, and offers predictions for the behavior of young word learners in novel situations. (shrink)

This paper has two primary aims. The first is to provide an introductory discussion of hyperset theory and its usefulness for modeling complex systems. The second aim is to provide a hyperset analysis of Robert Rosen’s metabolism-repair systems and his claim that living things are closed to efficient cause. Consequences of the hyperset models for Rosen’s claims concerning computability and life are discussed.

We study randomness beyond${\rm{\Pi }}_1^1$-randomness and its Martin-Löf type variant, which was introduced in [16] and further studied in [3]. Here we focus on a class strictly between${\rm{\Pi }}_1^1$and${\rm{\Sigma }}_2^1$that is given by the infinite time Turing machines introduced by Hamkins and Kidder. The main results show that the randomness notions associated with this class have several desirable properties, which resemble those of classical random notions such as Martin-Löf randomness and randomness notions defined via effective descriptive set theory such as${\rm{\Pi (...) }}_1^1$-randomness. For instance, mutual randoms do not share information and a version of van Lambalgen’s theorem holds.Towards these results, we prove the following analogue to a theorem of Sacks. If a real is infinite time Turing computable relative to all reals in some given set of reals with positive Lebesgue measure, then it is already infinite time Turing computable. As a technical tool towards this result, we prove facts of independent interest about random forcing over increasing unions of admissible sets, which allow efficient proofs of some classical results about hyperarithmetic sets. (shrink)

Bennett and Schumacher’s postselected quantum teleportation is a model of closed timelike curves (CTCs) that leads to results physically different from Deutsch’s model. We show that even a single qubit passing through a postselected CTC (P-CTC) is sufficient to do any postselected quantum measurement with certainty, and we discuss an important difference between “Deutschian” CTCs (D-CTCs) and P-CTCs in which the future existence of a P-CTC might affect the present outcome of an experiment. Then, based on a suggestion of Bennett (...) and Smith, we explicitly show how a party assisted by P-CTCs can distinguish a set of linearly independent quantum states, and we prove that it is not possible for such a party to distinguish a set of linearly dependent states. The power of P-CTCs is thus weaker than that of D-CTCs because the Holevo bound still applies to circuits using them, regardless of their ability to conspire in violating the uncertainty principle. We then discuss how different notions of a quantum mixture that are indistinguishable in linear quantum mechanics lead to dramatically differing conclusions in a nonlinear quantum mechanics involving P-CTCs. Finally, we give explicit circuit constructions that can efficiently factor integers, efficiently solve any decision problem in the intersection of NP and coNP, and probabilistically solve any decision problem in NP. These circuits accomplish these tasks with just one qubit traveling back in time, and they exploit the ability of postselected closed timelike curves to create grandfather paradoxes for invalid answers. (shrink)