COST | Single-threaded graph computation in Rust

I'm using React and Next.js with Firestore. On one page I get data from Firebase with useEffect only once the page is rendered. But since the get is kind of costly (lots of read), I want to persist the data fetched even when the user navigates to other pages and back to this page, so that I don't need to fetch again. How can I do that? Thanks!

I am new to rust and I was reading up on using futures and async / await in rust, and built a simple tcp server using it. I then decided to write a quick benchmark, by sending requests to the server at a constant rate, but I am having some strange issues.

The below code should send a request every 0.001 seconds, and it does, except the program reports strange run times. This is the output:

I am trying to extract information from a message on an android application using regex which I am not quite good at yet.

The information I need is highlighted in bold from the following string.

PFEDDTYGD Confirmed.on 14/6/21 at 12:46PMKsh260.00 received from 254725400049 JOHN DOE. New Account balance is Ksh1,666. Transaction cost, Ksh1

code: PFEDDTYGD, date: 14/6/21, time:12:46, amountreceived: 260.00, phone no:254725400049 customer: JOHN DOE

here is my code: NB: the string is in multiline format.

I am modeling a Time-constrained CVRP. The problem is to minimize the total travel time (not including the package dropping time) subject to vehicle (delivery) capacity and total time spent (per vehicle) constraints. The package dropping time refers to an additional time to be spent at each node, and the total time spent equals to the travel time plus this additional time. I have the below model that works for a single vehicle-type case. I would like to introduce two-vehicle type concept in there, meaning that I have a set of V1 type vehicles and another set of V2 type vehicles. The only difference of the vehicle-types is the per time cost of travel. Let x denote the per time unit cost of travel by V1, and y denote the per time unit travel cost of V2. How can I design the model so that it incorporates this additional aspect?

Is it possible to use Google ML-Kit On-Device Text Recognition in Flutter? All of the tutorials and resources I am finding online are all firebase_ml_vision, but I am looking for one that uses the no-cost OCR from Google ML-Kit. How would I do this in Flutter?

EDIT: SOLVED - when I posted this the package was not there, but now it is.

the customer where I'm working at the moment (and hopefully in the future...), posses an Azure Subscription for Startup. This is the tipical plan which gives you two years of free Azure credit.

I would like to analyze the cost of the Azure Infrastructure (for example: how much credit I consumed last day using the "storage account", or how much for ADB2C). Microsoft gave us a link where we can download an "excel" file which contains a "cost summary". But I didn't have access to such file. It's for "admin" only and is not "user/architect-friendly".

What are the best practice and tools to analyze the Azure Cost? I tried to use the "Cost Management" but, as you can see from the following screenshot, many "buttons" are "greyed out" and there is the following warning:

Cost Management requires access to a supported billing account or subscription. Please select a supported scope or create a new subscription to use Cost Management

Do you know if is possible to let this service "works" with a "free" subscription of azure for startup? Thanks for reading

I have a SQLite table like this:

I want a new SQLite table to show share of each person. It needs to do the calculation to split the cost for each item between the people.

Please advise what query I need to run on sql to get this new table.

File - Bike.cs

I am new to zimpl and I am currently trying to modell the GTSP. The setting is that we have nodes which are grouped into clusters. My problem is i dont know how to implement in zimpl which node belongs to which cluster.

What I did so far:

set V:= {1..6}; set A:= { in V*V with i < j};
set C:= {1,2,3};
set W:= { in C*C with p < q};
set P[]:= powerset(C); set K:= indexset(P);

I am guessing something is missing because i want to group node 1,2 in cluster 1, 3,4 in cluster 2 and 5,6 in cluster 3.

Some background Information:

Let G = (V, A) be a graph where V=1,2,...,n is the set of nodes and A = {(i, j): i, j ∈ V, i ≠ j} is the set of directed arcs (or edges), and let c_ij be the travel distance (or cost or time) from node i to node j. Let V1, V2, ... , Vk be disjoint subsets of V such that union of these subsets equals to V. These subsets are called clusters. The GTSP is to find the tour that (i) starts from a node and visits exactly one node from each cluster and turns back to the starting node (ii) never visit a node more than once and (iii) has the minimum total tour length. Associated with each arc, let x_ij be a binary variable equal to “1” if the traveler goes from node i to node j, and “0” otherwise.

Thats the mathematicl model I want to model: min∑i∈V ∑j∈V\{i} cijxij subject to: ∑i∈Vp ∑j∈V\Vp xij = 1 (p= 1, ..., k) ∑i∈V\Vp ∑j∈Vp xij = 1 (p= 1, ..., k) ∑j∈V\{i} xji − ∑j∈V\{i} xij = 0 (∀i∈V) xij∈{0,1} ∀(i, j)A up−uq+k ∑i∈Vp ∑j∈Vq xij+(k−2)∑i∈Vq ∑j∈Vp xij ≤ k−1 (p≠q;p,q=2,...,k) up≥0 (p=2, ..., k) (Thats the link for the paper: http://www.wseas.us/e-library/conferences/2012/Vouliagmeni/MMAS/MMAS-09.pdf)

Maybe someone can help! thanks