vs140580

495 Reputation

8 Badges

4 years, 224 days

MaplePrimes Activity


These are questions asked by vs140580

Is it possible to do machine learning using maplesoft I have 2020 for now

Say I have an excel sheet with one dependent variable and n number of independent variables. I can ask for the number of hidden layers we need.

Then i want to traing the data with 70% of the data for training ,  15% of the data for validation and 15% of the data for testing.

I want some charts may be on the performance of the neural networks.

and get the regression equation formed by this training would be looking to repeat the training until MSE has certain approximation.

 

If this is not possible in maplesoft kindly help me with some other code way to do this. Please help. I will surely acknowledge please advice me.

Kind help with Function given two graphs G1 and G2 then co-normal product be the graph G3 given by the function

conormal(G1,G2)

Defination is explained in youtube link  https://www.youtube.com/watch?v=qz1StIvzrAI

If any other explanation will surely give kind help please will surely acknowlege

Given a graph G say and a positive integer k

I am in look out how to remove

 edge-disjoint copies of G in G^k

That is edge disjoint copies of G into its power graph all possible ways 

Again it is the maximum number of copies I means 

Keeping this particular way can someone help kind help please

I will surely acknowledge it 

G into to GraphPower(G,k)

Problem 1)   Give graph G1 and a graph G2  the problem is to extract maximum isomorphic copies of G1 from G2 such that it has no edge intersection maximum number is floor((number of edges of G2)/(number of edges of G1)) and display the Edge sets of those isomorphic graphs and the graph formed by the remaining edges sometimes their may be no remaing edges too.  Need all possible such copies.

Problem 2) Give graph G1 and a graph G2  the problem is to extract maximum isomorphic copies of G1 from G2 such that each copy has  exactly one edge intersection with each of the copies and that one edge intersection occurs only between those two copies and  display the Edge sets of those isomorphic graphs . Need all possible such copies.

If any more examples or explation will give kind help please I can give more examples or more kind please help.

I had written this c++ code years back for problem 2 which i have forgotten kind help if possible to make it better with maplesoft.

Please take your time. Kind help help plese it will be very helpful it is of real help.

orthogonal.txt

I had written this c++ code years back for problem 1 which i have forgotten kind help if possible to make it better with maplesoft.

Please take your time. Kind help help plese it will be very helpful it is of real help.

decom.txt

Need to maintain memory space as graph size is a little big may be 

would usage of database or any other be useful dont know I had done those code in c++ long back which i forgotten logic too.

Please please help based on latest technology please take your time and kind help I apologize disturb you kind help.

I would surely acknowledge for this great work as much as I can much more than I can acknowlege too

I am using Maple 2020

 I have a set of edges like this

{{1:1,1:2},{1:1,2:1}.........}  like this several may be 300 like this or more

i want it to be converted to

{{"1:1","1:2"},{"1:1","2:1"},......}  like inside double qoutes only

kind help

First 10 11 12 13 14 15 16 Last Page 12 of 25