Unity – Why should running the WebGL app in Edge improve performance in Firefox?

I have a WebGL app (created with Unity 2019) that I test locally in Firefox and Edge. If the app is only running in one tab in Firefox, it runs at 25 to 50 fps and shows a noticeable jerk. If I run the app in Firefox and Edge at the same time (each browser on its own monitor), the performance in Firefox improves considerably – it jumps to 50 to 60 fps and stuttering is eliminated.

Frankly, the results sound ridiculous even to me, but I've tried them over and over again and they're 100% consistent. Opening the app on a tab in Edge instantly improves performance in Firefox. Closing the tab in Edge immediately reduces performance in Firefox.

I'm super on Windows 10 with a GTX 2070.

connected – strategy for determining the minimum expected costs in a series diagram with the edge probability pi and the search costs ci

Every edge in a series diagram $ e_i $ exists with probability $ p_i $. And if you want to investigate the existence of edges $ e_i $, It will cost you $ c_i $. I want to test connectivity between source $ s $ and goal $ d $ with the minimum expected cost.

I have found that the expected cost can be calculated below if the edge detection sequence is $ e_1, e_2, cdots e_n $::

$$ E (cost) = c_1 + p_1 * (c_2 + p_2 * (c_3 + p_3 * ( cdots (c_ {n-1} + p_ {n-1} * c_n) cdots))) $$

So is there a strategy or an algorithm to find out the minimum expected costs and the edge detection sequence?

Enter the image description here

random – MySQL order by edge, but the result must have a different specific value

I'm trying to get random values ​​from SQL, but I want the results to have at least one specific value from a column. How can I do that?

For example;

TABLE;

id  |  category  |  name
----------------------------
1   |      1     |  A
2   |      2     |  B
3   |      3     |  C
4   |      1     |  D
5   |      3     |  E
6   |      3     |  F
7   |      2     |  G
8   |      3     |  H

When I query four random dates with the category ID, the results do not all have different categories. Sometimes the result is like this.

SELECT * FROM table WHERE category IN (1,2,3) ORDER BY RAND LIMIT 4

id  |  category  |  name
----------------------------
1   |      1     |  A
4   |      1     |  D
3   |      3     |  C
8   |      3     |  H

Category 2 is missing from this example, but I want each category to have such results.

id  |  category  |  name
----------------------------
3   |      3     |  C <-- One from category 3
4   |      1     |  D <-- One from category 1
7   |      2     |  G <-- One from category 2
5   |      3     |  E <-- All categories ok, it can be random from any of them

Sorry for my english, i hope i could explain what i wanted. The results must contain at least one line from the where clause "Category IN (X, Y, Z)".

Thank you very much.

java – name of the application at the edge of the form

How do I make the application name appear at the edge of the window (top left) when I start running? I am using Netbeans and want to know how to do it, if possible with the graphical resource, not with code.

Insert picture description here

Left navigation edge – SharePoint Stack Exchange

I'm creating a SharePoint site in 2013. I used CSS code to remove the quick start in the left navigation area. I then added a table. However, my table is still indented over where the quick start would have ended. I need to know how to move this margin to use the space. Any help is greatly appreciated !!
Example:

Quick start removed – The table still starts high up here, although the quick start has been removed.

Graphics – Remove imperfections in the circle with a gradient edge

I'm trying to draw a red circle with a gradient that changes to white on the edge. I am currently defining a smooth step function and drawing a rectangular block with a gradient that is defined by the smooth step function:

smoothstep(x_) := Piecewise({{0, x <= -(1/2)}, {-20*(x + 1/2)^7 + 70*(x + 1/2)^6 - 84*(x + 1/2)^5 + 35*(x + 1/2)^4, -(1/2) < x < 1/2}, {1, x >= 1/2}})

img = Rasterize(DensityPlot(smoothstep(x), {x, 0, 4}, {y, -4, 4}, ColorFunction -> Function({x, y}, Hue(1, x, 1)), Frame -> False, PlotRangePadding -> None)

that seems to be successful

Enter the image description here

Then I applied this gradient as a texture to a circle

ParametricPlot({r*Cos(t), r*Sin(t)}, {r, 0, 1}, {t, 0, 2 Pi}, Mesh -> False, BoundaryStyle -> None, Axes -> False, Frame -> False, PlotStyle -> {Opacity(1), Texture(img)})

Enter the image description here

This is mostly successful except for 1) the white dot in the center of the circle and 2) the faint concentric red line outside.

How do I remove these imperfections in the resulting image? Should I change my approach?

Algorithms – Random linear arrangement of a tree with limited edge lengths

To let $ T $ be a tree with $ V $ and edges $ E $. Let a linear arrangement $ pi $ of $ T $ a bijective mapping of nodes to integers in the range $ {1, dots, | V | } $. you can imagine $ pi $ as defining the position of each node in an array on a line.

Now define the length an edge $ E = {u, v } $ in the $ T $ under $ pi $ be the absolute value of the position difference for $ u $ and $ v $ according to the linear arrangement $ pi $::
begin {equation}
l_ pi (u, v) = | pi (u) – pi (v) |.
end {equation}

Linear arrangements of this kind are examined, for example, in the problem of optimal linear arrangement (Chung, 1984), where the goal is to find a $ pi $ for a firm $ T $ which minimizes $ sum _ { {u, v } in E} l_ pi (u, v) $.

My problem is: given a tree $ T $ and a linear arrangement $ pi $, create new linear arrangement $ pi ^ prime $ randomly uniform from the set of possible linear arrangements of $ T $ while maintaining the same distribution over the edge lengths as in the original $ pi $.

An example tree with a linear arrangement $ pi $ is shown below. Each edge is marked with its length. The distribution of edge lengths in this tree is under this particular linear arrangement $ (1, 1, 1, 2, 2) $ (3 of length 1 and 2 of length 2).

Example tree

Here is the same tree under a different linear arrangement $ pi ^ prime $that has the same distribution of edge lengths $ (1,1,1,2,2) $.

Example tree 2

I'm looking for an efficient algorithm to generate random linear arrays that maintain the distribution over edge lengths. Here is a basic algorithm for rejecting samples:

  1. Start with the tree $ T $ With $ n $ Knot and linear arrangement $ pi $Calculate the list of edge lengths for $ T $ under $ pi $. Call that $ L $.
  2. Generate a random linear arrangement $ pi ^ prime $ by drawing from the set of $ n! $ linear arrangements of $ T $.
  3. Calculate the list of edge lengths for $ T $ under $ pi ^ prime $. Call that $ L ^ prime $. If $ L ^ prime = L $, take the sample. If $ L ^ prime neq L $, reject the sample and go to step 2.

This question relates to my previous question, but differs from this one: Generate a randomly labeled tree with restricted edge lengths. In this question I looked for random trees. In this question, I am looking for random linear arrangements of a fixed tree, while maintaining the topology of the tree.