haul | An Extensible Image Crawler | Crawler library

I am in need of help proving that an algorithm has greedy choice property and optimal substructure.

Context of the problem:

Consider a problem where a company owns n gas stations that are connected by a highway. Each gas station has a limited supply g_i of gas-cans. Since the company don't know which gas station is most visited they want all of them to have the same amount of gas.

So they hire a fueling-truck to haul gas between the stations in their truck. However, truck also consumes 1 gas-can per kilometer driven.

Your task will be to help the chain calculate the largest amount of gas-cans g_bar they can have at all Stations.

Consider the example: Here we have g = (20, 40, 80, 10, 20) and p = (0, 5, 13, 33, 36) (in kilometers). In order to send one gas-can from station 3 to station 4 we need to put 41 gas-cans in the truck, as the fueling-truck will consume 40 before reaching their destination (to send two gas-cans we need to put 42 in the truck). The optimal g_bar for the example is 21 and can be achieved as follows:

1. Station 2 sends 11 gas-cans towards Station 1. One gas-can arrives while ten are consumed on the way.

2. Station 3 sends 59 gas-cans towards Station 4. 19 arrive while 40 are consumed on the way.

3. Station 4 now has 29 gas-cans and send eight towards Station 5. Two of these arrive and six are consumed on the way.

4. The final distribution of gas-cans is: (21, 29, 21, 21, 22).

Given an integer g_bar. Determine whether it is possible to get at least g_bar gas-cans in every Gas Station.

in order for the greedy choice property and optimal substructure to make sense for a decision problem, you can define an optimal solution to be a solution with at least g_bar gas-cans in every gas station if such a solution exists; otherwise, any solution is an optimal solution.

Input: The position p_i and gas-can supply g_i of each bar. Here g_i is the supply for the bar at position p_i. You may assume that the positions are in sorted order – i.e. p_1 < p_2 < . . . < p_n.

Output: The largest amount g_bar, such that each gas-station can have a gas-can supply of at least g_bar after the truck have transferred gas-cans between the stations.

How can i prove Greedy Choice and Optimal Substructure for this?

I looked for a solution in the forum but I didn´t get any.

I´m working with a fish database and I´m trying to transform my data frame from this (MRE):

I have two dataframes, the one contains Reviews for cars and the second one contains the car make and car model. What I would like to do is use the car model df_brand['name'] to be used to lookup every word in the Review sentence df['Review'] and remove matching words. I would like to remove all the words that contain car brands in them.

Input data df['Review']:

I am trying to convert a input sentence Review into a CountVectorizer. I am struggling to handle the sentences that are passed through. How do I deal with the sentences and add vectors to these? Any assistance will be highly appreciated.

Input Data:

I am trying to run sentences through the Porter Stemmer algorithm, however am getting and error: AttributeError: 'list' object has no attribute 'lower'. can anyone assist, as I am not able to identify the problem:

Here is my input:

Need help in React…I converted the complex xml file into js object format. After converting the xml file, the js object are stored in ress variable that is showing in the picture. We are storing the different partial transcript in different variables. Is there any way to do it using loop and split it with regular expression in each iteration. So it would he easy for me to use map method instead of calling the component again and again for each partial transcript.

I have a data frame with three columns (Category, Sub.category and Acitivty). I need a nested list, with these three levels to put into shinyTree.

I'm trying to match the format of this .Rds file to create a shinyTree.

My full table is 99 lines, I've included 30 below, but may need to do over 100+ in the same way.

So far I've got

I have a trained and saved a model. I am trying to further train the model on new data but it gives error. Relevant part of the code:

I thought I had everything covered, but I'm now having issues with flip boxes working on Mac. I was able to make them compatible with different browsers on phones. I had someone with a Mac say that they were having problems with the animation. I heard that they saw a weird blinking and can see the front of the card through the back. I'm not sure what I'm missing. The last time I had this issue was with iOS, but I was just missing one line of code. Any suggestions? Honestly, I'm winging this as I go and can use any guidance.