Digital Commons Network^™

Preparing For Life In A Digital World: The Iea International Computer And Information Literacy Study 2018 International Report, Julian Fraillon, John Ainley, Wolfram Schulz, Tim Friedman, Daniel Duckworth

ICT - Digital Literacy

The second cycle of ICILS in 2018 (ICILS 2018) continued to investigate students’ computer and information literacy (CIL) and also investigated students’ computational thinking (CT). This dimension involves conceptualising problems (through algorithmic or systems thinking) and operationalising solutions (creating, implementing, and evaluating computer-based responses to problems). The inclusion of CT as an option in ICILS 2018 reflects recent interest by educators, researchers, and policymakers in the value of CT in schooling. ICILS 2018 studied how these components of digital competence related to each other and to the school and out-of-school contexts that support learning with and about computer technology. This …

Ecological Network Metrics: Opportunities For Synthesis, Matthew K. Lau, Stuart R. Borrett, Benjamin Baiser, Nicholas J. Gotelli, Aaron M. Ellison

College of Arts and Sciences Faculty Publications

Network ecology provides a systems basis for approaching ecological questions, such as factors that influence biological diversity, the role of particular species or particular traits in structuring ecosystems, and long-term ecological dynamics (e.g., stability). Whereas the introduction of network theory has enabled ecologists to quantify not only the degree, but also the architecture of ecological complexity, these advances have come at the cost of introducing new challenges, including new theoretical concepts and metrics, and increased data complexity and computational intensity. Synthesizing recent developments in the network ecology literature, we point to several potential solutions to these issues: integrating network metrics …

Computer Science Education At The Claremont Colleges: The Building Of An Intuition, Lauren Burke

Scripps Senior Theses

In this thesis, I discuss how the undergraduate computer scientist is trained, and how they learn what I am calling computational intuition. Computational intuition describes the methodology in which computer scientists approach their problems and solve them through the use of computers. Computational intuition is a series of skills and a way of thinking or approaching problems that students learn throughout their education. The main way that computational intuition is taught to students is through the experience they gain as they work on homework and classwork problems. To develop computational intuition, students learn explicit knowledge and techniques as well as …

How Can We Build A Moral Robot?, Kristen E. Clark

Capstones

Artificial intelligence is already starting to drive our cars and make choices that affect the world economy. One day soon, we’ll have robots that can take care of our sick and elderly, and even rescue us in rescue us in emergencies. But as robots start to make decisions that matter—it’s raising questions that go far beyond engineering. We’re stating to think about ethics.

Bertram Malle and Matthias Scheutz are part of a team funded by the department of defense. It's their job to answer a question that seems straight out of a sci-fi novel: How can we build a moral …

Indeterminacy In Stochastic Overlapping Generations Models: Real Effects In The Long Run, Zhigang Feng, Matthew Hoelle

Economics Faculty Publications

Indeterminate equilibria are known to exist for overlapping generations models, though recent research has been limited to deterministic settings in which all equilibria converge to a steady state in the long run. This paper analyzes stochastic overlapping generations models with 3-period lived representative consumers and adopts a novel computational algorithm to numerically approximate the entire set of competitive equilibria. In a stochastic setting with incomplete markets, indeterminacy has real effects in the long run. Our numerical simulations reveal that indeterminacy is an order of magnitude more important than endowment shocks in explaining long-run consumption and asset price volatility.

Canine Haiku: Yellow Ball, Julie Andreyev, Tom (Canine)

The Goose

Poetry by Julie Andreyev and Tom.

Evidentiary Power And Propriety Of Digital Identifiers And The Impact On Privacy Rights In The United States, Michael Losavio, Deborah Keeling

Journal of Digital Forensics, Security and Law

Media and network systems capture and store data about electronic activity in new, sometimes unprecedented ways; computational systems make for new means of analysis and knowledge development. These new forms offer new, powerful tactical tools for investigations of electronic malfeasance under traditional legal regulation of state power, particular that of Fourth Amendment limitations on police searches and seizures under the U.S. Constitution. But autonomy, identity and authenticity concerns with electronic data raise issues of public policy, privacy and proper police oversight of civil society. We examine those issues and their implications for digital and computational forensics

The Instructional Information Processing Account Of Digital Computation, Nir Fresco, Marty J. Wolf

Faculty of Engineering and Information Sciences - Papers: Part A

What is nontrivial digital computation?It is the processing of discrete data through discrete state transitions in accordance with finite instructional information. The motivation for our account is that many previous attempts to answer this question are inadequate, and also that this account accords with the common intuition that digital computation is a type of information processing. We use the notion of reachability in a graph to defend this characterization in memory-based systems and underscore the importance of instructional information for digital computation. We argue that our account evaluates positively against adequacy criteria for accounts of computation.

Numerical Simulation Of Nonoptimal Dynamic Equilibrium Models, Zhigang Feng, Jianjun Miao, Adrian Peralta-Alva, Manuel S. Santos

Economics Faculty Publications

In this paper we propose a recursive equilibrium algorithm for the numerical simulation of nonoptimal dynamic economies. This algorithm builds upon a convergent operator over an expanded set of state variables. The fixed point of this operator defines the set of all Markovian equilibria. We study approximation properties of the operator. We also apply our recursive equilibrium algorithm to various models with heterogeneous agents, incomplete financial markets, endogenous and exogenous borrowing constraints, taxes, and money.

A Critical Survey Of Some Competing Accounts Of Concrete Digital Computation, Nir Fresco

Faculty of Engineering and Information Sciences - Papers: Part A

This paper deals with the question: what are the key requirements for a physical system to perform digital computation? Oftentimes, cognitive scientists are quick to employ the notion of computation simpliciter when asserting basically that cognitive activities are computational. They employ this notion as if there is a consensus on just what it takes for a physical system to compute. Some cognitive scientists in referring to digital computation simply adhere to Turing computability. But if cognition is indeed computational, then it is concrete computation that is required for explaining cognition as an embodied phenomenon. Three accounts of computation are examined …

Information Processing As An Account Of Concrete Digital Computation, Nir Fresco

Faculty of Engineering and Information Sciences - Papers: Part A

It is common in cognitive science to equate computation (and in particular digital computation) with information processing. Yet, it is hard to find a comprehensive explicit account of concrete digital computation in information processing terms. An information processing account seems like a natural candidate to explain digital computation. But when 'information' comes under scrutiny, this account becomes a less obvious candidate. Four interpretations of information are examined here as the basis for an information processing account of digital computation, namely Shannon information, algorithmic information, factual information and instructional information. I argue that any plausible account of concrete computation has to …

Cognitive Systems For Revenge And Forgiveness, Michael E. Mccullough, Robert Kurzban, Benjamin A. Tabak

ESI Publications

Minimizing the costs that others impose upon oneself and upon those in whom one has a fitness stake, such as kin and allies, is a key adaptive problem for many organisms. Our ancestors regularly faced such adaptive problems (including homicide, bodily harm, theft, mate poaching, cuckoldry, reputational damage, sexual aggression, and the infliction of these costs on one's offspring, mates, coalition partners, or friends). One solution to this problem is to impose retaliatory costs on an aggressor so that the aggressor and other observers will lower their estimates of the net benefits to be gained from exploiting the retaliator in …

The Explanatory Role Of Computation In Cognitive Science, Nir Fresco

Faculty of Engineering and Information Sciences - Papers: Part A

Which notion of computation (if any) is essential for explaining cognition? Five answers to this question are discussed in the paper. (1) The classicist answer: symbolic (digital) computation is required for explaining cognition; (2) The broad digital computationalist answer: digital computation broadly construed is required for explaining cognition; (3) The connectionist answer: subsymbolic computation is required for explaining cognition; (4) The computational neuroscientist answer: neural computation (that, strictly, is neither digital nor analogue) is required for explaining cognition; (5) The extreme dynamicist answer: computation is not required for explaining cognition. The first four answers are only accurate to a first …

Discounted Stochastic Games With Voluntary Transfers, Sebastian Kranz

Cowles Foundation Discussion Papers

This paper studies discounted stochastic games perfect or imperfect public monitoring and the opportunity to conduct voluntary monetary transfers. We show that for all discount factors every public perfect equilibrium payoff can be implemented with a simple class of equilibria that have a stationary structure on the equilibrium path and optimal penal codes with a stick and carrot structure. We develop algorithms that exactly compute or approximate the set of equilibrium payoffs and find simple equilibria that implement these payoffs.

Slides: Arctic Ecosystem Services Measurement And Modeling Project, Eric Biltonen

Best Management Practices (BMPs): What? How? And Why? (May 26)

Presenter: Eric Biltonen, PhD, Environment Economist, Houston Advanced Research Center

8 slides

Digital Computation As Information Processing, Nir Fresco

Faculty of Engineering and Information Sciences - Papers: Part A

It is common in cognitive science to equate computation (in particular digital computation) with information processing. Yet, it is hard to find a comprehensive explicit account of concrete digital computation in information processing terms. An Information Processing account seems like a natural candidate to explain digital computation. After all, digital computers traffic in data. But when 'information' comes under scrutiny, this account becomes a less obvious candidate. 'Information' may be interpreted semantically or nonsemantically, and its interpretation has direct implications for Information Processing as an objective account of digital computation. This paper deals with the implications of these interpretations for …

Concrete Digital Computation: What Does It Take For A Physical System To Compute?, Nir Fresco

Faculty of Engineering and Information Sciences - Papers: Part A

This paper deals with the question: what are the key requirements for a physical system to perform digital computation? Time and again cognitive scientists are quick to employ the notion of computation simpliciter when asserting basically that cognitive activities are computational. They employ this notion as if there was or is a consensus on just what it takes for a physical system to perform computation, and in particular digital computation. Some cognitive scientists in referring to digital computation simply adhere to Turing's notion of computability. Classical computability theory studies what functions on the natural numbers are computable and what mathematical …

Residential Modifications And Decline In Physical Function Among Community-Dwelling Older Ad, Sze Yan Liu, Kate L. Lapane

Department of Public Health Scholarship and Creative Works

Purpose: The purpose of this study is to quantify the effect of residential modification on decreasing the risk of physical function decline in 2 years.

Design: Cohort study using propensity scores method to control for baseline differences between individuals with residential modifications and those without residential modifications.

Participants: Participants (N = 9,447) were from the Second Longitudinal Study on Aging, a nationally representative sample of the civilian noninstitutionalized population, aged 70 years and older in the United States at the time of baseline interview in 1994-1995.

Methods: Participants self-reported residential modifications at baseline (e.g., railings, bathroom modifications). The decline in …

Computing Equilibria Of N-Player Games With Arbitrary Accuracy,, Srihari Govindan, Robert B. Wilson

Robert B Wilson

From a variant of Kuhn's triangulation we derive a discrete version of the Global Newton Method that yields an epsilon-equilibrium of an N-player game and then sequentially reduces epsilon toward zero to obtain any desired precision or the best precision for any number of iterations.

An Analysis Of The Criteria For Evaluating Adequate Theories Of Computation, Nir Fresco

Faculty of Engineering and Information Sciences - Papers: Part A

This paper deals with the question: What are the criteria that an adequate theory of computation has to meet? (1) Smith's answer: it has to meet the empirical criterion (i.e. doing justice to computational practice), the conceptual criterion (i.e. explaining all the underlying concepts) and the cognitive criterion (i.e. providing solid grounds for computationalism). (2) Piccinini's answer: it has to meet the objectivity criterion (i.e. identifying computation as a matter of fact), the explanation criterion (i.e. explaining the computer's behaviour), the right things compute criterion, the miscomputation criterion (i.e. accounting for malfunctions), the taxonomy criterion (i.e. distinguishing between different classes …

A Decomposition Algorithm For N-Player Games, Robert B. Wilson, Srihari Govindan

Robert B Wilson

An N-player game can be decomposed by adding a coordinator who interacts bilaterally with each player. The coordinator proposes profiles of strategies to the players, and his payoff is maximized when players' optimal replies agree with his proposal. When the feasible set of proposals is finite, a solution of an associated linear complementarity problem yields an equilibrium of the approximate game and thus an approximate equilibrium of the original game. Computational efficiency is improved by using vertices of a triangulation of the players' strategy space for the coordinator's pure strategies. Computational experience is reported.

Proceedings Of The 4th Acl-Sigsem Workshop On Prepositions At Acl-2007., Fintan Costello, John D. Kelleher, Martin Volk

Conference papers

This volume contains the papers presented at the Fourth ACL-SIGSEM Workshop on Prepositions. This workshop is endorsed by the ACL Special Interest Group on Semantics (ACL-SIGSEM), and is hosted in conjunction with ACL 2007, taking place on 28th June, 2007 in Prague, the Czech Republic.

Jmasm16: Pseudo-Random Number Generation In R For Some Univariate Distributions, Hakan Demirtas

Journal of Modern Applied Statistical Methods

An increasing number of practitioners and applied researchers started using the R programming system in recent years for their computing and data analysis needs. As far as pseudo-random number generation is concerned, the built-in generator in R does not contain some important univariate distributions. In this article, complementary R routines that could potentially be useful for simulation and computation purposes are provided.

Intelligent Computation For Association Rule Mining, Hong Liu, John Zeleznikow

Faculty of Commerce - Papers (Archive)

Although there have been several encouraging attempts at developing SQL-based methods for data mining, simplicity and efficiency still remain significant impediments for further development. In this paper, we develop a fixpoint operator for computing frequent itemsets and demonstrate three query paradigm solutions for association rule mining that use the idea of least fixpoint computation. We consider the generate-and-test and the frequent-pattern growth approaches and propose an novel method to represent a frequent-pattern tree in an object-relational table and exploit a new join operator developed in the paper. The results of our research provide theoretical foundation for intelligent computation of association …

Pseudo-Random Number Generation In R For Commonly Used Multivariate Distributions, Hakan Demirtas

Journal of Modern Applied Statistical Methods

An increasing number of practitioners and applied statisticians have started using the R programming system in recent years for their computing and data analysis needs. As far as pseudo-random number generation is concerned, the built-in generator in R does not contain multivariate distributions. In this article, R routines for widely used multivariate distributions are presented.

Decomposable Choice Under Uncertainty, Simon Grant, Atsushi Kajii, Ben Polak

Cowles Foundation Discussion Papers

Savage motivated his Sure Thing Principle by arguing that, whenever an act would be preferred if an event obtains and preferred if that event did not obtain, then it should be preferred overall. The idea that it should be possible to decompose and recompose decision problems in this way has normative appeal. We show, however, that it does not require the full separability across events implicit in Savage’s axiom. We formulate a weaker axiom that suffices for decomposability, and show that this implies an implicit additive representation. Our decomposability property makes local necessary conditions for optimality, globally sufficient. Thus, it …

The Effect Of Item Format On Computation Subtest Scores Of Standardized Mathematics Achievement Tests, Larry Carcelli

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The effect on childrens' scores of different item formats used in standardized mathematics achievement tests was investigated. Second grade students were given a mathematics computation test using formats derived from five standardized achievement tests. Identical content was tested with each format. Differences in test scores between types of formats were statistically significant at p < .001 (F = 45.25). These results indicate that what a student appears to know is substantially influenced by the format of the particular test used in measuring achievement. These differences are not accounted for by the normative scaling of the different tests. Greater attention should be given to the effect of test item format in selecting and administering achievement tests.