Bookmarks for August 24th through August 27th

These are my links for August 24th through August 27th:

  • Andrew Wayne & Michal Arciszewski, Emergence in physics | PhilPapers – This paper begins by tracing interest in emergence in physics to the work of condensed matter physicist Philip Anderson. It provides a selective introduction to contemporary philosophical approaches to emergence. It surveys two exciting areas of current work that give good reason to re-evaluate our views about emergence in physics. One area focuses on physical systems wherein fundamental theories appear to break down. The other area is the quantum-to-classical transition, where some have claimed that a complete explanation of the behaviors and features of the objects of classical physics entirely in quantum terms is now within our grasp. We suggest that the most useful way to approach the emergent/non-emergent distinction is in epistemic terms, and more specifically that the failure of reductive explanation is constitutive of emergence in physics.
  • SISA allows you to do statistical analysis directly on the Internet. – SISA allows you to do statistical analysis directly on the Internet. Click on one of the procedure names below, fill in the form, click the button, and the analysis will take place on the spot. Study the user friendly guides to statistical procedures to see what procedure is appropriate for your problem.
  • Wrong Tomorrow – time vs. pundits – What does this site do?It keeps track of predictions of the future by public figures.

    How does it work?

    When someone makes a prediction, people post it to the site along with a brief description and a URL. We monitor it and change its status to true or false when appropriate.

    What are the submission criteria?

    1. The prediction needs to make an empirically testable claim about the world.

    2. The prediction should be significant.

    3. The prediction must be by a public figure.

    4. The prediction should be testable within five years.

    5. Negative predictions (about things that are never expected to happen) are allowed.

    What is the purpose of this site?

    Research has shown that experts make predictions at a rate worse than chance. This site exists in order to hold people and media outlets accountable for pretending to see into an unpredictable future.

  • OpenSecrets.org: Money in Politics — See Who’s Giving & Who’s Getting – OpenSecrets.org is your nonpartisan guide to money’s influence on U.S. elections and public policy. Whether you’re a voter, journalist, activist, student or interested citizen, use our free site to shine light on your government. Count cash and make change.

Bookmarks for July 8th through July 29th

These are my links for July 8th through July 29th:

  • Should Copyright Of Academic Works Be Abolished? – The conventional rationale for copyright of written works, that copyright is needed to foster their creation, is seemingly of limited applicability to the academic domain. For in
    a world without copyright of academic writing, academics would still benefit from publishing in the major way that they do now, namely, from gaining scholarly esteem.
    Yet publishers would presumably have to impose fees on authors, because publishers
    would not be able to profit from reader charges. If these publication fees would be borne
    by academics, their incentives to publish would be reduced. But if the publication fees
    would usually be paid by universities or grantors, the motive of academics to publish
    would be unlikely to decrease (and could actually increase) – suggesting that ending
    academic copyright would be socially desirable in view of the broad benefits of a
    copyright-free world…
  • BBC – Radio 4 In Our Time – Philosophy Archive – You can listen again to all the programmes online. The most recent programmes appear at the top of the page.
  • [0907.1579] The Computational Power of Minkowski Spacetime – The Lorentzian length of a timelike curve connecting both endpoints of a classical computation is a function of the path taken through Minkowski spacetime. The associated runtime difference is due to time-dilation: the phenomenon whereby an observer finds that another's physically identical ideal clock has ticked at a different rate than their own clock. Using ideas appearing in the framework of computational complexity theory, time-dilation is quantified as an algorithmic resource by relating relativistic energy to an $n$th order polynomial time reduction at the completion of an observer's journey. These results enable a comparison between the optimal quadratic \emph{Grover speedup} from quantum computing and an $n=2$ speedup using classical computers and relativistic effects. The goal is not to propose a practical model of computation, but to probe the ultimate limits physics places on computation.
  • How to choose a statistical test – This book has discussed many different statistical tests. To select the right test, ask yourself two questions: What kind of data have you collected? What is your goal? Then refer to Table 37.1.
  • NPWRC :: Statistical Significance Testing – Four basic steps constitute statistical hypothesis testing. First, one develops a null hypothesis about some phenomenon or parameter. This null hypothesis is generally the opposite of the research hypothesis, which is what the investigator truly believes and wants to demonstrate. Research hypotheses may be generated either inductively, from a study of observations already made, or deductively, deriving from theory. Next, data are collected that bear on the issue, typically by an experiment or by sampling. (Null hypotheses often are developed after the data are in hand and have been rummaged through, but that's another topic.)
  • Data Mining Techniques – Data Mining is an analytic process designed to explore data (usually large amounts of data – typically business or market related) in search of consistent patterns and/or systematic relationships between variables, and then to validate the findings by applying the detected patterns to new subsets of data. The ultimate goal of data mining is prediction – and predictive data mining is the most common type of data mining and one that has the most direct business applications.

Bookmarks for July 6th through July 8th

These are my links for July 6th through July 8th:

  • How to choose a statistical test – This book has discussed many different statistical tests. To select the right test, ask yourself two questions: What kind of data have you collected? What is your goal? Then refer to Table 37.1.
  • NPWRC :: Statistical Significance Testing – Four basic steps constitute statistical hypothesis testing. First, one develops a null hypothesis about some phenomenon or parameter. This null hypothesis is generally the opposite of the research hypothesis, which is what the investigator truly believes and wants to demonstrate. Research hypotheses may be generated either inductively, from a study of observations already made, or deductively, deriving from theory. Next, data are collected that bear on the issue, typically by an experiment or by sampling. (Null hypotheses often are developed after the data are in hand and have been rummaged through, but that’s another topic.)
  • Data Mining Techniques – Data Mining is an analytic process designed to explore data (usually large amounts of data – typically business or market related) in search of consistent patterns and/or systematic relationships between variables, and then to validate the findings by applying the detected patterns to new subsets of data. The ultimate goal of data mining is prediction – and predictive data mining is the most common type of data mining and one that has the most direct business applications.
  • An Overview of Data Mining Techniques – This overview provides a description of some of the most common data mining algorithms in use today. We have broken the discussion into two sections, each with a specific theme:* Classical Techniques: Statistics, Neighborhoods and Clustering
    * Next Generation Techniques: Trees, Networks and Rules

    Each section will describe a number of data mining algorithms at a high level, focusing on the “big picture” so that the reader will be able to understand how each algorithm fits into the landscape of data mining techniques. Overall, six broad classes of data mining algorithms are covered. Although there are a number of other algorithms and many variations of the techniques described, one of the algorithms from this group of six is almost always used in real world deployments of data mining systems.

  • MachineLearning.pdf (application/pdf Object) – Over the past 50 years the study of Machine Learning has grown from the efforts of a handful of computer engineers exploring whether computers could learn to play games, and a field of Statistics that largely ignored computational considerations, to a broad discipline that has produced fundamental statistical-computational theories of learning processes, has designed learning algorithms that are routinely used in commercial systems
    for speech recognition, computer vision, and a variety of other tasks, and has spun off an industry in data mining to discover hidden regularities in the growing volumes of online data. This document provides a brief and personal view of the discipline that has emerged as Machine Learning, the fundamental questions it addresses, its relationship to other sciences and society, and where it might be headed

Bookmarks for July 1st through July 6th

These are my links for July 1st through July 6th:

  • MachineLearning.pdf (application/pdf Object) – Over the past 50 years the study of Machine Learning has grown from the efforts of a handful of computer engineers exploring whether computers could learn to play games, and a field of Statistics that largely ignored computational considerations, to a broad discipline that has produced fundamental statistical-computational theories of learning processes, has designed learning algorithms that are routinely used in commercial systems
    for speech recognition, computer vision, and a variety of other tasks, and has spun off an industry in data mining to discover hidden regularities in the growing volumes of online data. This document provides a brief and personal view of the discipline that has emerged as Machine Learning, the fundamental questions it addresses, its relationship to other sciences and society, and where it might be headed
  • OJS Customizations | Public Knowledge Project – The Public Knowledge Project is dedicated to improving the scholarly and public quality of research. The partnership brings together faculty members, librarians, and graduate students dedicated to exploring whether and how new technologies can be used to improve the professional and public value of scholarly research. Its research program is investigating the social, economic, and technical issues entailed in the use of online infrastructure and knowledge management strategies to improve both the scholarly quality and public accessibility and coherence of this body of knowledge in a sustainable and globally accessible form. It continues to be an active player in the open access movement, as it provides the leading open source software for journal and conference management and publishing.
  • Home | American Statistical Association – The American Statistical Association (ASA), a scientific and educational society founded in Boston in 1839, is the second-oldest, continuously operating professional society in the United States. For 170 years, the ASA has provided its members and the public with up-to-date, useful information about statistics. The ASA has a proud tradition of service to statisticians, quantitative scientists, and users of statistics across a wealth of academic areas and applications.
  • Stock Market News, Opinion & Analysis, Investing Ideas — Seeking Alpha – Long and short investing ideas, stock quotes, market news, analysis, blogs, and free conference call transcripts
  • Solver Foundation – Solver Foundation’s intrinsic solvers are written in managed code , covering several families of numerical and symbolic programming:
    Revised Simplex Linear Programming (Primal and Dual Simplex)

    Interior Point Method Linear and Quadratic Programming
    Constraint Programming with Exhaustive Tree Search, Local Search, and Metaheuristic Techniques Compact, Quasi-Newton (L-BFGS), Unconstrained Nonlinear Programming
    Mixed Integer Programming

  • TDWI: Data Warehousing Education & Solutions | Data Warehouse Management | Business Intelligence | BI/DW – TDWI (The Data Warehousing Institute™) provides education, training, certification, news, and research for executives and information technology (IT) professionals worldwide.
  • Open Source Enterprise Content Management System (CMS) by Alfresco – * Freely downloadable open source CMS
    * Supported by an active community of developers
    * Ideal for developers and highly technical enthusiasts