• Breaking News

    Sunday, December 13, 2020

    Home Unlabelled Book recommendations for artificial intelligence and deployment Computer Science

    Book recommendations for artificial intelligence and deployment Computer Science

    December 13, 2020

    Book recommendations for artificial intelligence and deployment Computer Science

    Book recommendations for artificial intelligence and deployment

    Posted: 12 Dec 2020 05:06 PM PST

    Hey so I just finished University and I didn't take AI electives but would like to read about it for interest. Also at my school there's no real course on taking a prototype/POC and deploying it to be a live website/mobile app. Does anyone have recommendations for books (or other sources) for these two topics that they found useful? Thanks!

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

    Article "Perceus: Garbage Free Reference Counting with Reuse"

    Posted: 12 Dec 2020 10:12 AM PST

    Free browser extension for ML community that thousands of machine learning engineers/data scientists use everyday! Drop a comment for any questions/feature requests you may have!

    Posted: 12 Dec 2020 07:08 PM PST

    Why nothing comes out when there's supposed to be a chart?

    Posted: 12 Dec 2020 10:10 PM PST

    The problem is to parse a series of commands that instruct a robot arm on how to manipulate blocks that lie on a flat table. Initially, there are n blocks on the table (numbered from 0 to n − 1) with block bi adjacent to block bi+1 for all 0 ≤ i < n − 1 as shown in the diagram below:

    https://ibb.co/WpWQBYT

    The valid commands for the robot arm that manipulates blocks are:

    • move a onto b

    where a and b are block numbers, puts block a onto block b after returning any blocks that are stacked on top of blocks a and b to their initial positions.

    • move a over b

    where a and b are block numbers, puts block a onto the top of the stack containing block b, after returning any blocks that are stacked on top of block a to their initial positions.

    • pile a onto b

    where a and b are block numbers, moves the pile of blocks consisting of block a, and any blocks that are stacked above block a, onto block b. All blocks on top of block b are 0: 0 1: 1 9 2 4 2: 3: 3 4: 5: 5 8 7 6 6: 7: 8: 9: moved to their initial positions prior to the pile taking place. The blocks stacked above block a retain their order when moved.

    • pile a over b

    where a and b are block numbers, puts the pile of blocks consisting of block a, and any blocks that are stacked above block a, onto the top of the stack containing block b. The blocks stacked above block a retain their original order when moved.

    • quit

    terminates manipulations in the block world. Any command in which a = b or in which a and b are in the same stack of blocks is an illegal command. All illegal commands should be ignored and should have no effect on the configuration of blocks.

    Input:

    https://ibb.co/pWJ9c7Q

    Output:

    https://ibb.co/Nt03mm3

    [I only type the first command for now.]

    my code:

    #include<stdio.h> #include<string.h> int main(){ int noi=0; printf("please input n:"); int n; scanf(" %d",&n); int arr[n][n]; int i,j; for(i=0;i<n;i++){ for(j=0;j<n;j++){ arr[i][j]=-1; } arr[i][0]=i; } char str1[5],str2[5]; int s,d; while(strcmp(str1,"quit")!=0){ s=0; d=0; while(!(s>=1&&s<=n&&d>=1&&d<=n)){ scanf(" %s %d %s %d",str1,&s,str2,&d); } if(strcmp(str1,"move")==0){ if(strcmp(str2,"onto"==0)){ //empty s for(i=0;i<n&&arr[s][i]!=-1;i++){ arr[arr[s][i]][0]=arr[s][i]; arr[s][i]=-1; } //empty d for(i=0;i<n&&arr[d][i]!=-1;i++){ arr[arr[d][i]][0]=arr[d][i]; arr[d][i]=-1; } //now move s to d i=1; while(arr[d][i]!=-1){ i++; } arr[d][i]=arr[s][0]; arr[s][0]=-1; }else if(strcmp(str2,"over")==0){ }else{ continue; } }else if(strcmp(str2,"pile")==0){ }else{ continue; } } //print results for(i=0;i<n;i++){ printf("%d:",i); for(j=0;j<n&&arr[i][j]!=-1;j++){ printf("%d ",arr[i][j]); } printf("\n"); } }
    submitted by /u/JacksonSteel
    [link] [comments]

    (Rational Function)

    Posted: 12 Dec 2020 10:23 AM PST

    ​

    The maximum time, T, in minutes a scuba diver without stopping for decompression on the way up the surface is defined by the T(d) =525/d-10 with d>10, where d is the depth of the dive, in meters. For the maximum tie to be less than 30 minutes, how deep can the diver dive?

    1. Show a full algebraic solution with conclusion.

    2)State all asymptotes and their meaning in the context of the problem.

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

    No comments:

    Post a Comment