BEADS | A framework for automated vulnerability discovery in SDNs

I'm trying to do the following..

Not represent JSON in a POCO

Find and Deserialize only the value of a particular property hidden deep within a large JSON using Utf8JsonReader.

Filter for JSON tokens : working

Following is the code that is working.

I'm trying to make a simple Python Kivy app (using a kv file for the layout) that I will use to keep inventory of my parts for work. I am very new to python and kivy, so I need a little bit of direction on this.

One of the basic functions will be to allow the user to input a new part on the "Add Part to Inventory" screen (one of four screens). The user input consists of four items (part name, serial number, on-hand quantity, and the minimum amount needed).

Once the user enters this info and presses the 'Submit' button, I would like that data to be appended to a new row in a google sheet that I'm using as a backend database using the Google Drive/Sheets API (which I was able to get working).

Most of the example apps that I've found online only have one screen, and are only dealing with one type of user input (usually text, whereas my input will be text and integers).

I'm confused as to where I need to put my ids in the kv file (I'm assuming under the AddPartWindow layout), how to call a function when a button is pressed that is not in the root class, how to store the user input into a list since I'm not sure what the ObjectProperty function is really doing, and finally, how to append that list to a new row in my google sheet.

I'm not looking for a cut and paste answer, just some direction would be nice as I have not been able to find a good reference for exactly what I'm trying to do. My main confusion lies in having multiple screens, and how to transfer data between the different screens and their respective classes. Should data only be funneled through a single root class? Or can each class be used to handle data coming from their respective screens (windows) in the app? What exactly is the ObjectProperty function doing? I find the kivy website to be a bit convoluted when describing the properties class.

Any help/direction woud be greatly appreciated.

Here is the main.py code:

I am building a counter-based android application using motion layout. I have built this scene using motion layout where you can slide the bead and it'll add +1 to the counter. The initial scene of moving the bead from one place to another on swipe works great but now I don't know how to make the bead start from the initial position it was on and then swipe it to the final position which will then add another +1 to the counter.

I want the process to be continuous as if you're counting on real beads. The code below so far works great. I need help to make the counting process to continue and how to know when that the bead has reached its final position to add +1.

counter_fragment.xml

I'm trying to graph two normal distributions over two histograms in the same plot in R. Here is an example of what I would like it to look like:

Here is my current code but I'm not getting the second Normal distribution to properly overlay:

I have this code :

Suppose we have 1,000 beads 900 red and 100 blue ones. When I run the problem through SKlearn classifier ensembles,

score = clf.score(X_test, y_test)

They come up with scores of around .9 however, when I look at the predictions I see that it has predicted all of them to be Red and this is how it comes up with %90 accuracy! Please tell me what I'm doing wrong? Better yet, what does it mean when this happens? Is there a better way to measure accuracy?

I have issue on using "enabled" with j:Button.

I know that I must add functionality with this bead :

I've been trying to solve MIT's Mathematics for Computer Science problem sets and here's one of the problems:

Each monk entering the Temple of Forever is given a bowl with 15 red beads and 12 green beads. Each time the Gong of Time rings, a monk must do one of two things:

1. Exchange: If he has 3 red beads in his bowl, then he may exchange 3 red beads for 2 green beads.
2. Swap: He may replace each green bead in his bowl with a red bead and replace each red bead in his bowl with a green bead. That is, if he starts with i red beads and j green beads, then after he performs this operation, he will have j red beads and i green beads.

A monk may leave the Temple of Forever only when he has exactly 5 red beads and 5 green beads in his bowl.

There are sub-problems to this:

1. Prove that no one ever leaves the temple. This I proved using mathematical induction.
2. Prove that there are only a finite number of states that can be reached by this problem. This proof was also done by using mathematical induction and proving that the sum of number of red beads and green beads can only ever reduce or stay the same.
3. (This is where I am stuck) What is the true maximal number of unique states a monk can visit in any execution of the Temple of Forever machine?

After spending a considerable amount of time trying to think of sub-problem #3, I gave up and decided to write a program to count the number of unique states.

As a foreword, this problem has been asked about before. However, it's either been asked using different languages or different approaches, and I'd rather understand the problem with my code as opposed to copy-pasting the accepted solution.

So, for context, the problem goes something like this:

Given a string of beads like rwbbwrbwbrwbrb, find the maximum length of consecutive beads of one color (letter) followed by beads of the other color (letter) with the caveat that white can be counted as red or white.

For example, wwwbbrwrbrbrrbrbrwrwwrbwrwrrb should return 11 because you could break the necklace after wwwbbrwrbrbrrbrbrwrwwrbto have wrwrrbwwwbb (keeping in mind that a necklace loops over itself, not like a list) which would end up being rrrrrbbbbbb in terms of color.

My code(I've stripped all the I/O parts to simplify it) with the test case rwrwrwrwrwrwrwrwrwrwrwrwbwrwbwrwrwrwrwrwrwrwrwrwrwrwrwrwrwrwrwrwrwrwrwrwrwrwr of length 77: