Überfällige Google-Kritik: Based on billions of daily queries and an estimated share of about 49% of the total Web queries allows predicting with astonishing accuracy what is going to happen in a number of areas of economic importance.
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, multisets, finite functions, permutations binary decision diagrams, graphs, hypergraphs, parenthesis languages, dyadic rationals, DNA sequences etc.) and their extension to hereditary finite universes through hylomorphisms derived from ranking/unranking and pairing/unpairing operations. An embedded higher order combinator language provides any-to-any encodings automatically. Besides applications to experimental mathematics, a few examples of "free algorithms" obtained by transferring operations between data types are shown. Other applications range from stream iterators on combinatorial objects to self-delimiting codes, succinct data representations and generation of random instancs. The paper covers 47 data types and, through the use of the embedded combinator language, provides 2162 distinct bijective transformations between them.
This is a list of 100 important natural language processing (NLP) papers that serious students and researchers working in the field should probably know about and read.
I am fascinated by technology and its application to data analysis in finance, especially investing. Below is a compiled list of freely available academic papers published in 2017 on deep learning…
Get tips from ACS Editors, staff, and 2016’s most-read author to share their thoughts on the essential elements of a highly-read chemistry research paper.
We introduce a new lambda calculus with futures, Lambda(fut), that models the operational semantics of concurrent statically typed functional programming languages with mixed eager and lazy threads such as Alice ML, a concurrent extension of Standard ML. Lambda(fut) is a minimalist extension of the call-by-value lambda-calculus that is sufficiently expressive to define and combine a variety of standard concurrency abstractions, such as channels, semaphores, and ports. Despite its minimality, the basic machinery of Lambda(fut) is sufficiently powerful to support explicit recursion and call-by-need evaluation. We present a static type system for Lambda(fut) and distinguish a fragment of Lambda(fut) that we prove to be uniformly confluent. This result confirms our intuition that reference cells are the sole source of indeterminism.
This article will discuss the uproar over privacy issues in social networks by describing a privacy paradox; private versus public space; and, social networking privacy issues.
A Tutorial Implementation of a Dependently Typed Lambda Calculus Andres Löh, Conor McBride and Wouter Swierstra We present the type rules for a dependently-typed core calculus together with a straightforward implementation in Haskell. We explicitly highlight the changes necessary to shift from a simply-typed lambda calculus to the dependently-typed lambda calculus. We also describe how to extend our core language with data types and write several small example programs. The paper is accompanied by an executable interpreter and example code that allows immediate experimentation with the system we describe. Download Draft Paper (submitted to FI) Haskell source code (executable Haskell file containing all the code from the paper plus the interpreter; automatically generated from the paper sources) prelude.lp (prelude for the LambdaPi interpreter, containing several example programs) Instructions (how to get started with the LambdaPi interpreter)
This paper explores how modern technologies like cloud-services and mobile
devices can improve existing transcription methods. After a brief exploration of
existing projects in the field of access, organisation, transcription and analysis of
digital representations of cultural heritage, this paper introduces a new approach,
unlike XML technology, to TEI data storage and organisation
A. Mousavian, D. Anguelov, J. Flynn, и J. Kosecka. (2016)cite arxiv:1612.00496Comment: To appear in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) 2017.
P. Wu, Y. Lee, H. Tseng, H. Ho, M. Yang, и S. Chien. 2017 IEEE International Symposium on Mixed and Augmented Reality (ISMAR-Adjunct), стр. 186-191. IEEE Computer Society, (2017)
T. Omori, и K. Maruyama. MSR '08: Proceedings of the 2008 international workshop on Mining software repositories, стр. 31--34. New York, NY, USA, ACM, (мая 2008)
J. Lumsden, и R. Maclean. Proceedings of the OTM Confederated International Workshops and Posters on On the Move to Meaningful Internet Systems: 2008 Workshops: ADI, AWeSoMe, COMBEK, EI2N, IWSSA, MONET, OnToContent + QSI, ORM, PerSys, RDDS, SEMELS, and SWWS, стр. 538--547. Monterrey, Mexico, Springer-Verlag, (2008)