Ü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.
K. Kamei, K. Shinozawa, T. Ikeda, A. Utsumi, T. Miyashita, und N. Hagita. Proceedings of the 12th International Conference on Multimodal Interfaces and the 7th Workshop on Machine Learning for Multimodal Interfaces (IMCI-MLMI 2010), Beijing, China, Seite 19:1--19:8. (2010)
H. Kagermann, W. Wahlster, und J. Helbig. Final Report of the Industrie 4.0 Working Group, acatech -- National Academy of Science and Engineering, München, (April 2013)
T. Strohman, W. Croft, und D. Jensen. Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, Seite 705--706. New York, NY, USA, ACM, (2007)