NMinimize for searching global minimum

I have been trying to find global minimum for this equation for some time now.

The equation is quite easy to understand. It is made with sumation of stress equations of points on the border where $ σ_{rr,i} = σ_{r\varphi,i} = 0$ , where $ i$ stand for $ i$ -th hole of $ n$ holes. So I have multiple points with those two equations and I sum them in equation below:

$ eq=σ_{rr,i}^2 + σ_{r\varphi,i}^2+σ_{rr,i+1}^2 + σ_{r\varphi,i+1}^2 +…$

Each of the functions has coefficients $ A_{1}, B_{1}, C_{1}, D_{1}, A_{2} … $ Then I use Simplify on $ eq$ and get something like:

$ K_1 A_1 + K_2 B_1 …$ where $ K_j$ is real number and value of $ A, B, C, D$ is what I am looking for. Below is a picture of this equation.

enter image description here

Now I use the function as follows:

$ NMinimize[eq, kList]$ where $ kList=[A_1, B_1 …]$ .

The lowest result that I get is around 100 000, and values are not correct. I know there is a solution and if I plot the function I can tell if results are correct.

Everything works with only one set of points, with two sets of points NMinimize doesnt find the minimum. There are 14 coefficients in the $ kList$ . What am I doing wrong?

How to deal with players that wants their characters to do automatic perception, stealth and searching for traps/secret doors?

Every time my players are exploring a dungeon, they want their characters to do perception checks for monsters, perception checks for traps and/or secret passages while being on stealth mode, all at the same time. If a monster comes or if they activate a trap, they get mad because “my character is always looking for traps”. If I say they need to declare their actions, the game goes like this:

[me describing a area, like a corridor they’re walking in]

player: I check for traps and secret doors in the wall, the floor and the ceiling. I also want to hear anything unusual and walk silently.

They want to be on “automatic mode”, expecting me to roll for their PCs every time they enter a new area. Otherwise they always have this phrase “I check for traps and secret doors in the wall, the floor…” that they say EVERYTIME I introduce a new area. I can’t put them in “automatic” for this kind of roll. We’re playing D&D 5e, but this happen in other campaigns, and it has always been a problem to me.

How do I deal with it?

Searching for demo data of wordpress themes [closed]

I like to have demo data of some WordPress site like Real Estate Website site as you can see here: enter image description here

So Do yo know any mechanism to scrap the demo data of one wordpress online demo site, or i must find and upload the demo files into the word press by googling and finding those data?

Is there any website as reference for demo data of WordPress sites to do that faster?


Searching for substring in field that contains variable length of arrays of json objects

I am trying to construct a sql query, that searches for a substring within a field. The issue is that the field contains an array of one or more json objects.

For example the table looks like so:

day     |   items ____________________ Sunday  | [{"apples":5, "bananas":2}, {"pears":12, "cucumbers":9}, ...] Monday  | [{"apples":6, "bananas":1}, {"watermelon": 1}] Tuesday | [{"apples":4, "bananas":3}, {"tomatoes": 1}] 

How do I construct a SQL query that searches for a substring in items given it is not a string ?


searching for free youtube subscribers?

I'm not trying to spam or anything, i tried to grow my youtube channel using a lot of softwares and programs, and i can make it easy on you by saying that Ytmonster is the best site so far.
You can earn coins easily by subscribing to other channels or liking their videos and a lot more, and you can use more than one youtube account, if you don't want to subscribe to a lot of channels using your main account.

Searching a 2D array of binary Data

I’m working on optimizing the structure of an optical metadevice. I have a randomly generated 2D matrix, where 0,1 represents the presence/absence of a hole. Each structure manipulates light in a different way, thus giving rise to a unique spectrum.

The problem I wish to solve is to maximize the efficiency of this structure. Given the large size of the solution space ($ 2^{100}$ in this case), it isn’t possible to simulate each structure. Is there any search method I could use to complete this optimization?

A General workflow would be:

  1. Generate a random hole structure
  2. Flip one or some bits (based on the optimization algorithm)
  3. Compute the spectrum
  4. Go back to step 2 and make decision based on the previously computed spectrum.

Here’s a link to a sample hole array.

Apologies for the vague statement of the problem. Thanks in advance!

Animal Companions hiding, searching, and readying an action

The PHB has this to say about Animal Companions:

The beast obeys your commands as best as it can. It takes its turn on your initiative. On your turn, you can verbally command the beast where to move (no action required by you). You can use your action to verbally command it to take the Attack, Dash, Disengage, or Help action. If you don’t issue a command, the beast takes the dodge action.

My question is, although it specifies that movement takes no action while a list of actions take your actions, can a Ranger also verbally command the beast to hide, search, or ready an action (that isn’t in the list of actions that take your actions)? Nothing in the feature specifies that you can’t order the beast to take any of the other actions listed.

What are recognized ways for searching a specific string like “video234.mp4” in the DOM of a large indexing site with pre-existing pages?

I’m trying to search off a whole site for specific string in the source code of a specific page that exists on the site, I’m thinking of a scrawler to do this, is a scrawler intended to do this or are there more efficient way?

Unlike indexing sites like Google etc, which results can vary even if the same request is made another time, this site does only have pages created by the user which makes it a bit more easier to make it possible to search off the site. The content isn’t served by javascript so this isn’t an obstacle.

Amount of expected loop iterations when searching an array by random index

Lets say we have an array A of size n. It has 1 as its first index and n as its last index. It contains a value x, with x occurring k times in A where 1<=k<=n

If we have a search algorithm like so:

while true:   i := random(1, n)   if A[i] == x     break 

random(a,b) picks a number uniformly from a to b

From this we know that the chances of finding x and terminating the program is k/n with each iteration. However what I would like to know is what would be the expected value for the number of iterations or more specifically the amount of times the array was accessed in this program given the array A as described above.