• Breaking News

    Thursday, January 17, 2019

    Home Unlabelled Measuring AI's ability to learn can be difficult. Computer Science

    Measuring AI's ability to learn can be difficult. Computer Science

    January 17, 2019

    Measuring AI's ability to learn can be difficult. Computer Science

    Measuring AI's ability to learn can be difficult.

    Posted: 17 Jan 2019 12:04 AM PST

    Detection of cyberbullying with the aid of deep learning method.

    Posted: 16 Jan 2019 10:50 AM PST

    Multi-factor sorting algorithms

    Posted: 16 Jan 2019 09:22 PM PST

    Hello, I recently came across this article http://www.evanmiller.org/how-not-to-sort-by-average-rating.html. The article covers a few ways to create sorting scores. However, the examples are only for 2 factors, positive vs negative comments or positive vs all comments. What if I have 10 factors I want to consider?

    ​

    I checked my algorithms book for weighted sorting algorithms, but didn't find anything.

    ​

    I'm curious about how I could come up with a sorting score for something with n factors? In addition, how do I handle factors that are more desirable in different ways? For example:

    • factor A is more desirable if it's closer to 0
    • factor B is more desirable if it's bigger
    • factor C is more desirable if it's closer to 3
    • factor D is more desirable if it's more negative

    Are there standard ways of doing stuff like this?

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

    How does one parse a Lisp expression?

    Posted: 16 Jan 2019 08:21 PM PST

    Hello r/compsci!

    I originally posted this question on r/learnprogramming but I received feedback that this might be more suitable for this community.

    I am trying write a simple parser for restricted Lisp expressions, but I just can't wrap my head around a good solution. Please see the details here. I know there are a lot of solution out there, but I don't understand them unfortunately.

    I think the grammar is the following:
    E = aE | mE | lE | int | var
    aE = E0 + E1
    mE = E0 * E1
    lE = var_0 E_0 var_1 E_1 ... var_N-1 E_N-1 E_N

    where
    E stands for expression,
    aE add-expression,
    mE mult-expression,
    lE let-expression,
    int integer, and
    var stands for variable.

    I parsed the input to a list of strings but then I wasn't able to create the abstract syntax tree. I'm not even sure if need to create it. For example if the input is "(add 1 (mult 2 3))" AST would be ["add", "1", ["mult", "2", "3"]].

    Conceptually if I can do recursive evaluation, I should be able to solve this problem, but how do I implement this? If someone could point me to the right direction, that would greatly be appreciated.

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

    Parallelize Database synchronization

    Posted: 17 Jan 2019 01:50 AM PST

    I am not sure if this is the right place to post this, but I think you guys may help me find some literature on this subject. If it is not, please tell me, I will delete this post.

    I want to synchronize the information of one database into another database. This sync then repeats itself every hour and only updates those values who have changed.

    Some tables (lets call one of those tables "Persons") contain lots of foreign keys, so that means the tables which they refer to have to be synchronized first. Some tables even contain circular references. One way to fix this, is to first sync all the data that is not a foreign key. The DMS has now created keys for every entry, and now it is guaranteed that every entry exists. Now you can first sync Persons and then its dependencies, and then their dependencies etc.

    However, when Persons has more than 100.000 entries, this becomes rather cumbersome. People accessing the data during that sync would see a lot of dirty data.

    To fix this, one would suggest to subdivide the sync of Persons into smaller chunks of, for instance, 100 entries. This has 2 advantages:

    1. The process becomes highly parallelizable
    2. Would one error occur during one of the syncs, not a lot of data has been compromised

    Now here we come at the core of my problem: how do we synchronize the dependencies? It is not guaranteed that the foreign keys are already in the new database and if not, we have to synchronize those values too. Continuously querying the sync-to-database and the sync-from-database during the process to see if a value is already there (and if not, adding it) would add a lot of traffic and completely annihilate
    I do not believe I am the first one who has to tackle this problem. However searching on Google I cannot find general design patterns or solutions. I think I am using the wrong terminology.

    So my question is, do you have any knowledge concerning this problem? Can someone help me find information about this kind of problem? Or at least supply me with some terminology I want to look for?

    TL;DR: I need to synchronize a whole database to another database, how do you divide this process into smaller chunks if a lot of tables refer to others?

    ​

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

    How easy is it to code an auto email if a certain value is not entered in an online form?

    Posted: 17 Jan 2019 03:07 AM PST

    Say a embassy needs a specific city entered in a field in a form that applicant fills out online. If a different city is entered, an auto email is sent, saying sorry you can't book here.

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

    Women here, what's the sexism like?

    Posted: 16 Jan 2019 04:23 PM PST

    So I'm starting my computer science degree in about 2 weeks.

    I'm really scared that Comp Sci is a bad fit for me in terms of the environment and people. I don't see myself being happy in a male-dominated field and I'm scared of creepy weird guys (things have happened to me before and I highly doubt it'll stop).

    So women who studied comp sci/ work in the comp sci field, please tell me about your experiences with sexism? If you're not a woman, you can still give your opinion lol, I don't really mind.

    Also I really don't want to be the diversity hire...

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

    Is 9 month enough time for an EE with a day job to transition to software engineering

    Posted: 16 Jan 2019 04:59 PM PST

    I majored in EE so I have some basic programming skills. I'm familar with Python and Java, but haven't coded enough to call myself fluent.

    I also know basic data structures and algorithms, but again, need to study more to be truly good.

    I also lack any repositories on Github.

    I hope to transition to a software engr job at a respectable company in 9-10 month, so I've been studying everyday after work.

    Just wanna know is that time frame realistic and what advice you have.

    Thanks

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

    Fast Unsupervised Image Categorization Algorithm

    Posted: 16 Jan 2019 02:45 PM PST

    In this post, I'm going to show how we can combine the image feature recognition algorithm I presented a few months ago, with the categorization and prediction algorithms I presented in the two posts below, to produce an algorithm that can quickly categorize images, without any supervision. The final algorithm I'll present is O(n), where n is the number of pixels in the image we're attempting to categorize.

    This algorithm works so well that it can distinguish between paintings by different artists, in just a few seconds. It can also distinguish between articles of clothing, and other objects, but the focus of this post will be on its ability to distinguish between artists, because, in my opinion, this shows that the algorithm is capable of unsupervised abstraction, allowing it to say without any guidance, what it is that distinguishes a Van Gogh from a Caravaggio.

    These algorithms use the same underlying categorization and prediction algorithms that I used below to imitate complex three-dimensional shapes, predict data, and approximate complex functions. In this case, I've added some additional scripts that allow the underlying algorithms to analyze images. As a result, the underlying categorization and prediction algorithms are shaping up to be a set of generalized AI algorithms that appear to only require a "hook" into the subject matter in question.

    Finally, note that all of the algorithms I'll present in this post are worst-case polynomial in time as a function of the number of pixels in the image. That is, even the algorithms we'll use to construct categories in the first instance are polynomial in time as a function of the number of pixels / images in the database. As a result, these algorithms allow for what I believe to be industrial quality image recognition to be implemented on a consumer device, and can probably allow industrial machines to conduct real-time analysis of high-resolution video.

    Code, examples, and theory, available here:

    https://www.researchgate.net/project/Information-Theory-SEE-PROJECT-LOG

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

    Request-Review for P versus NP paper

    Posted: 16 Jan 2019 08:39 PM PST

    P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? A precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Given a positive integer x and a collection S of positive integers, MAXIMUM is the problem of deciding whether x is the maximum of S. We prove this problem is complete for P. Another major complexity classes are LOGSPACE, LOGTIME and coNP. Whether LOGSPACE = P is a fundamental question that it is as important as it is unresolved. We show the problem MAXIMUM can be decided in logarithmic space. Consequently, we demonstrate the complexity class LOGSPACE is equal to P. Moreover, we define a problem called SUCCINCT-MAXIMUM. SUCCINCT-MAXIMUM contains the instances of MAXIMUM that can be represented by an exponentially more succinct way. We show this succinct version of MAXIMUM is in coNP-complete under logarithmic reductions. Hence, under the assumption of P = NP, we obtain the padded version of SUCCINCT-MAXIMUM is in LOGTIME and P-hard. However, this is not possible according to LOGTIME is strictly contained in LOGSPACE, because that result would imply LOGTIME = LOGSPACE. In this way, we demonstrate the assumption of several computer scientists whom fully expect that P is not equal to NP.

    ​

    https://www.academia.edu/38165921/P_versus_NP

    https://zenodo.org/record/2542348

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

    Why didn’t AI evolve to become what it is today earlier?

    Posted: 16 Jan 2019 02:29 PM PST

    So I'm watching this video on YouTube about AI and the guy who's describing how a neural network work in its most basic form. He is saying that a neuron in your brain takes different inputs generated from your body and produces an output.

    Example

    Input: breathing/pulse Answer yes/no

    Output: alive/dead

    AI works the same but with other inputs and I wonder why this hasn't gone faster, is it because of weak computers (few transistors)? Or is it because the software 'the code' has become so mature now that we are beginning to see broad application?

    I'm new to this place, like Reddit as a whole but I love the community. With that said this might be the wrong subreddit but I'll give it a try here and if not maybe you guys can give directions. Thanks!

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

    Auto-DeepLab: Fei-Fei Li & Alan Yuille on Semantic Image Segmentation

    Posted: 16 Jan 2019 08:54 AM PST
    Read more
    at

    No comments:

    Post a Comment