• Breaking News

    Saturday, February 27, 2021

    Home Unlabelled [AI application] AI agent plays Contra Computer Science

    [AI application] AI agent plays Contra Computer Science

    February 27, 2021

    [AI application] AI agent plays Contra Computer Science

    [AI application] AI agent plays Contra

    Posted: 26 Feb 2021 05:14 PM PST

    A Computer Architecture Built in Logicly (Fibonacci Sequence)

    Posted: 26 Feb 2021 07:43 AM PST

    [R] [P] Google AI Blog: Lyra: A New Very Low-Bitrate Codec for Speech Compression

    Posted: 26 Feb 2021 08:55 PM PST

    Google and Victoria University of Wellington recently published a paper Generative Speech Coding With Predictive Variance Regularization on arXiv.

    Abstract: The recent emergence of machine-learning based generative models for speech suggests a significant reduction in bit rate for speech codecs is possible. However, the performance of generative models deteriorates significantly with the distortions present in real-world input signals. We argue that this deterioration is due to the sensitivity of the maximum likelihood criterion to outliers and the ineffectiveness of modeling a sum of independent signals with a single autoregressive model. We introduce predictive-variance regularization to reduce the sensitivity to outliers, resulting in a significant increase in performance. We show that noise reduction to remove unwanted signals can significantly increase performance. We provide extensive subjective performance evaluations that show that our system based on generative modeling provides state-of-the-art coding performance at 3 kb/s for real-world speech signals at reasonable computational complexity.

    Yesterday Google AI Blog officially introduced the new method described in this paper - named Lyra, a high-quality, very low-bitrate speech codec that makes voice communication available even on the slowest networks.

    submitted by /u/Yuqing7
    [link] [comments]

    [N] Better Than Capsules? Geoffrey Hinton's GLOM Idea Represents Part-Whole Hierarchies in Neural Networks

    Posted: 26 Feb 2021 07:12 PM PST

    A research team lead by Geoffrey Hinton has created an imaginary vision system called GLOM that enables neural networks with fixed architecture to parse an image into a part-whole hierarchy with different structures for each image.

    Here is a quick read: Geoffrey Hinton's GLOM Idea Represents Part-Whole Hierarchies in Neural Networks

    The paper How to Represent Part-Whole Hierarchies in a Neural Network is on arXiv.

    submitted by /u/Yuqing7
    [link] [comments]

    Does a nondeterministic TM have different definitions of termination for computability and complexity?

    Posted: 26 Feb 2021 02:00 PM PST

    In Sisper's Introduction to Theory of Computation, Section 3.2 VARIANTS OF TURING MACHINES says

    The computation of a nondeterministic Turing machine is a tree whose branches correspond to different possibilities for the machine. If some branch of the computation leads to the accept state, the machine accepts its input.

    Section 7.1 MEASURING COMPLEXITY says

    DEFINITION 7.9 Let N be a nondeterministic Turing machine that is a decider. The running time of N is the function f : N→N , where f(n) is the maximum number of steps that N uses on any branch of its computation on any input of length n, as shown in the following figure

    Is it correct that all the branches of a nondeterministic TM are running in parallel?

    When some branch leads to the accept state, does the nondeterministic TM stop running by aborting all other branches which are still running? (It seems to me yes according to Section 3.2, but no according to Section 7.1)

    In the definition of a nondeterministic TM accepting an input, when some branch leads to the accept state, does it matter if some other branch doesn't lead to the accept state? (I guess not)

    In the definition of a nondeterministic TM's running time, if some branch leads to the accept state while there is still some other branch running (i.e. with more steps than the branch), is the branch not used for determining the running time of the nondeterminitic TM?

    Thanks!

    submitted by /u/timlee126
    [link] [comments]

    Mandelbrot Tutorial - Digital Logic

    Posted: 26 Feb 2021 03:30 PM PST

    Hey nerds, I made a YouTube tutorial series for building a circuit that will render the Mandelbrot set at 1024x768 resolution at 1024 iterations. The playlist can be found here: https://www.youtube.com/playlist?list=PLKdeRz8UZy3_gO3bYFKArmuEw10XRXsdX Let me know what you think.

    I'm using the sim called "digital" which can be downloaded here: https://github.com/hneemann/Digital

    Cheers

    -

    Jarvi

    submitted by /u/TheWildJarvi
    [link] [comments]

    [N] Facebook AI's Multitask & Multimodal Unified Transformer: A Step Toward General-Purpose Intelligent Agents

    Posted: 26 Feb 2021 09:19 AM PST

    A research team from Facebook AI has proposed a Unified Transformer (UniT) encoder-decoder model that jointly trains on multiple tasks across different modalities and achieves strong performance on seven tasks with a unified set of model parameters.

    Here is a quick read: Facebook AI's Multitask & Multimodal Unified Transformer: A Step Toward General-Purpose Intelligent Agents

    The paper Transformer is All You Need: Multimodal Multitask Learning with a Unified Transformer is on arXiv.

    submitted by /u/Yuqing7
    [link] [comments]

    Why use a rational database such as MySQL rather than just creating a data structure such as a hash table?

    Posted: 26 Feb 2021 03:10 PM PST

    I understand that security and safety is a concern, but why other than this would a web server use this rather than just building an API to work with their own data structure?

    Is it simply just because of security and safety, and no need to "reinvent the wheel"?

    submitted by /u/GrandNarrowPath
    [link] [comments]

    Intro to Bias in AI

    Posted: 26 Feb 2021 02:53 PM PST

    Tom Cruise deepfake videos are all over the internet and passing the best deepfake detectors!

    Posted: 26 Feb 2021 02:40 PM PST

    Senior Project Web Ideas

    Posted: 26 Feb 2021 12:50 PM PST

    Number theory and algorithms: An invitation to a collaborative study group

    Posted: 26 Feb 2021 08:26 AM PST

    Hello everyone, This is an invitation to a collaborative study group on Number theory and algorithms. Mainly, We rely upon Lewinter's text. No notable background is required, However, Solving more challenging problems, Even beyond the book's level, is encouraged.

    Here is a simple problem we were starting out with, Check it out.

    Send me a direct message with your email if you are interested in joining.

    submitted by /u/xTouny
    [link] [comments]

    Help understanding this code for creating a heap from an array

    Posted: 26 Feb 2021 07:36 AM PST

    public MyHeap(int[] items) { currentSize = items.length; array = new int[(currentSize + 2) * 11 / 10]; int i = 1; for (int x : items) { array[i++] = x; } buildHeap(); }

    This is code from my data structures and algorithms textbook. So the heap in this scenario is an encapsulated array where the elements of the heap start at index 1, not 0, and work as a dynamic array, where when the array is full, the elements of the array will be moved to a new array of about double the size of the old one.

    This is the constructor that specifically takes an array of items. So of course you need to make the encapsulated array able to take all of the items of the passed array. But why does the code do it this way?? I don't understand line 3. Why not just do array = items.clone() or array = new int[items.length] and then continue on filling array with the for loop and stuff below?

    Why is it new int[(currentSize + 2) * 11/10];???? This means that there is an extra little buffer of "slots" in the array, and the more items that are in the passed items, the more extra slots will be in the new array..... which doesn't make sense. Why not make it a constant amount of extra slots? Why not 1? Why not 10?

    Is this just a really strange and quirky way to do this, or is there actually a reason behind this?

    submitted by /u/Missing_Back
    [link] [comments]

    Shall a database system be wrapped in a RPC or web service, before serving other subsystems in a distributed system?

    Posted: 26 Feb 2021 06:09 AM PST

    Is it correct that to create a distributed system nowadays

    • subsystems within a network should communicate by RPC (e.g. gRPC) for efficiency?

    • subsystems over a internet should communicate by web service (e.g. REST) for interoperability and portability?

    A database system is commonly used in a distributed system, and has its own protocol (e.g. postgresql, mongodb, ... have their own protocols, which have been wrapped in JDBC, ODBC, or even ORM). How shall other subsystems communicate with it?

    • shall it be wrapped into a RPC or a web service server, to server other subsystems inside the same network or over an internet?

    • shall all other subsystems within the same network as the database system or even outside the same network communicate with the database system directly using its protocol (or JDBC, ODBC, or even ORM)?

    Thanks.

    submitted by /u/timlee126
    [link] [comments]

    P=NP proved by polynomial time algorithm for #2SAT

    Posted: 26 Feb 2021 07:19 AM PST

    Hello,

    I present a #2SAT polynomial time algorithm as per my academia.edu paper here:

    Academia Paper on P=NP

    which proves P=NP. The idea is to index the counts of pairs of variables at each clause moving from 1st to last clause in the complete CNF file, and simultaneously populating the total Satisfiability count.

    Tell me your thoughts/remarks/suggestions/critics on this.

    Thanks

    Vinay

    submitted by /u/vinaych
    [link] [comments]
    Read more
    at

    No comments:

    Post a Comment