LGN | 2019 paper : A Lexicon-based Graph Neural Network | Machine Learning library

I am trying to find an algorithm for this problem that is given in my homework:

Assume that you have m jobs and n machines. Each machine i has a nondecreasing latency function li : N → R that only depends on the number of jobs assigned to machine i. To illustrate, if lj(5) = 7, then machine j needs to work 7 units of time if it is assigned (any) five of the jobs. Assume that li(0) = 0 for all machines i.

Given a set of m jobs, and n machines, where each machine is associated with a nondecreasing latency function as described above. You are asked to give a O(m · lgn) algorithm that assigns each job to a machine such that the makespan(the maximum amount of time any machine executes) is minimized. Needless to say, but just in case, you need to prove that your algorithm is correct.

I am allowed to get some help so this is not cheating.

I am stuck in where and how to start to find an algorithm for this problem, could you help me please?

So I have the following question:

You have of set of numbers, S, that you are storing in a red-black tree. You are trying to add minDiff to the red-black tree which gives you the absolute difference between the two closest numbers in S. For example if S = {1, 18, 23, 62, 79, 100} minDiff would return 5 (|23 - 18|)

A) Show how to augment a red-black tree to support this operation efficiently while maintaining the O(lgn) running time for Insert, Search and Delete.

B) Show how to output the values of two numbers that created the MinDiff. For the example above you would output 23 and 18.

My confusion:

I am stuck on the very beginning parts of the question, namely what to augment. I can think of simple and inefficient solutions such as having each node hold the absolute difference between itself and its parent. However, it seems like there should be some elegant solution that doesn't require you looking at every value of the tree to determine the solution.

I wish I could show more of my work, but I am completely stumped and don't know where to start!

I'm currently developing a React application using HERE Maps Javascript SDK.

My Problem:
I want to open an info bubble on a marker when I click on it.

Instead
This strange artifact gets rendered, and the map ends up going kaputt:

Here is the relevant source code:

I am trying to create an Angular 8 project with asp.net Core 2.1. Whenever I try to add migration using command

cmd command: dotnet ef migrations add init --project ../Lgn.DAL

The terminal throws error : Unable to create an object of type 'ApplicationDbContext'. Add an implementation of 'IDesignTimeDbContextFactory' to the project, or see https://go.microsoft.com/fwlink/?linkid=851728 for additional patterns supported at design time.

Startup.cs

`` public class Startup { public Startup(IConfiguration configuration) { Configuration = configuration; }

I am new to Angular. I am trying to change the layout of the my webpage based on whether a user is logged in or logged out. However this can be done only when the 'true' of 'false' is retrieved from the server. How can I do that? The TS code snippet is:

I am trying my hand on interpolating data using a simple linear function, Lagrange Interpolating Polynomial. I have managed to get the required equations, however, I am not able to figure out how to plot it piece-wise. I do understand using sympy is not the best way forward, but I am a noob and I wanted to see how my equations look.

How can I make it plot in matplotlib without having the need to manually type the equations at the end?

I'm trying to implement Prim's Minimum Spanning Tree algorithm using Balanced BST instead of a Priority Queue. My implementation is in Java. And since Java already has a library implementation of Red-Black Tree in the form of TreeSet, I thought to use that instead of having my own custom implementation.

A typical implementation of Prim's using Min Priority Queue takes O(ElogE), and my intention behind this implementation was to reduce the time complexity to O(ElogV). I believe this can also be done using an Indexed Priority Queue (IPQ), but I went with BST version as there are library implementations of Self-Balancing BST available (Both in Java and in C++).

For the examples I have tested this implementation with, it seems to work fine, and is producing correct results. But when I did a deeper inspection to make sure that the TC was actually O(ElogV), I found that Java TreeSet is behaving weirdly for me for some reason.

Here is my implementation:

I want to draw Morris chart in my MVC View but my data are dynamic and more than 30 item i have, but morris chart just colors chart by 12 colors and repeat remaining slice and for my legend which i had create just for 12 colors display color like image which o attached. how can i use unlimited color for my chart?!

I am trying to compare data of two api's responses. One of them returns xml. The issue is one of the tag in xml response is null. I can't find the way to check if the value exist or not.

Here is xml response