What's the Point of having a Relationship for you personally?

As a sex-repulsed aro-ace, I don’t have to have someone else make me happy, as I do always find something to do on my own, I’m stressed out in relationships for me personally.

compile – Accelerate the distance function of two point sets

I have two point sets point and impPoint. I want to calculate a distance function from each element in the point set to all elements in impoint sets. I have written a compiled version of the function, but its speed is a little slow. Is there any way to speed up the code?

w=0.1;
qs=0.1;
n=200;
nn=n*n;
nimp=0.1;
Nimp=IntegerPart(nimp*nn);
point=RandomReal(1,{nn,2});
impPoint=RandomSample(point,Nimp);
pm=ReplacePart(Table(1,Nimp),(RandomSample(Range(1,Nimp,1),Nimp/2)//Partition(#,1)&)->-1);
cf=Compile({{w,_Real},{qs,_Real},{pm,_Real,1},{Nimp,_Real},{impPoint,_Real,2},{point,_Real,1}},Total(Table(w/qs^2*Exp(-(((point((1))-impPoint((i,1)))^2+(point((2))-impPoint((i,2)))^2))/qs^2),{i,1,Nimp})*pm),CompilationTarget->"C",Parallelization->True,RuntimeAttributes->{Listable},RuntimeOptions->"Speed");
AbsoluteTiming(cf(w,qs,pm,Nimp,impPoint,point)//Total)

In fact, n takes 5000, so I don’t recommend using DistanceMatrix, because it saves time but costs a lot of memory.

dnd 5e – What is the point of the “Grasping Undergrowth” effect of the spell Druid Grove?

The 6th level spell Druid Grove (XGE p.154) lets the caster pick various effects for the targeted area. One of the possible effects is

Grasping Undergrowth: You can fill any number of 5-foot squares on the ground that aren’t filled with fog with grasping weeds and vines, as if they were affected by an entangle spell.

And the Entangle spell works the following way:

Grasping weeds and vines sprout from the ground in a 20-foot square
starting from a point within range. For the duration, these plants
turn the ground in the area into difficult terrain.

A creature in the area when you cast the spell must succeed on a
Strength saving throw or be restrained by the entangling plants until
the spell ends

Since Druid Grove has a casting time of 10 minutes, it seems unlikely that you could successfully cast it during a combat encounter to activate the restraining effect from the Entangle spell (which has a casting time of only one action) and instead only get the difficult terrain. But difficult terrain is also overshadowed by another feature of the Druid Grove, “Solid Fog” that among other effects also causes “every foot of movement through the fog costs 2 extra feet”, which overshadows the 1 extra foot caused by regular difficult terrain.

So, why would one choose to use the Grasping Undergrowth effect at all? (apart from the role-playing aspect of being able to use it as seats or a bed)

where on earth – From what point could you view the most countries?

I’ll take a stab at answering this.

The near-quadripoint works, you can see four countries. I’ve been there myself:

http://babakfakhamzadeh.com/article/from-zambia-to-botswana-nearly-a-quadripoint

But, there are a few more candidates.

The Wakhan corridor (in Afghanistan, http://en.wikipedia.org/wiki/Wakhan_Corridor) is so narrow (8 miles at its narrowest), that I presume there will be peaks from where you can see Afghanistan, China, Tajikistan and Pakistan.

The eastern edge of Kazakhstan and the western edge of Mongolia nearly meet, separated by a 30km gap where Russia and China border. The border here is fairly mountainous, so it’s likely there will be multiple points along this corridor where you will be able to see four countries.

Technically, if you stand on the south pole, you can see land claimed by 6 or 7 countries: http://en.wikipedia.org/wiki/Territorial_claims_in_Antarctica#mediaviewer/File:Antarctic_Region.png

There’s a road that connects Igdir (in Turkey) to Nakchivan (in an Azeri exclave). The road goes through a Turkish corridor that, at times, is only some 2k wide. There, Iran is one side, Armenia on the other.
Beyond a doubt, you’d be able to see four countries here, from multiple locations.

So, the question is, besides on the south pole, where can you see five countries from the ground?

SQL Server 2019: Two Aliases point to same instance

We have a SQL Server 2008 server that I successfully migrated to a new computer with SQL Server 2019.

The SQL Server 2008 server name is 123.123.123.123.

It has two instances named: 123.123.123.123 and 123.123.123.123ABC.

The SQL Server 2019 server name is CMP123456.

The instances are named: CMP123456 and CMP123456ABC.

I would like to use aliases on the 2019 server because unfortunately some programmers hardcoded the instance names into their code.

I created two aliases:

(123.123.123.123      TCP    1433    localhost)    
(123.123.123.123ABC  TCP    1433    localhostABC)

When I use SSMS to login, however both aliases connect me to CMP123456. I am unable to create an alias that will connect me to CMP123456ABC.

These are the aliases I have tried.

They all fail as “server not found” errors:

(123.123.123.123ABC  TCP    1434   localhostABC)   
(123.123.123.123ABC  TCP    1433   CMP123456ABC)    
(123.123.123.123ABC  TCP    1433   ABC)

((No Alias) In this case I was hoping the one localhost alias would work for both instances.)

Any ideas? Is not allowing two aliases a bug/feature of SQL Server 2019?

memory – Anyone can point out the issue?

I got a computer to repair, it has b250 board with ddr4 memory, its complaint was not booting, the CPU fan spin for a couple of seconds then stops… almost like a ram issue, so I replaced its ram with my computer ram, after still that shows the same… I left it with a motherboard issue, later I placed

Pegasus (spyware) – What is the point of unroot android device?

There are a few things that I think make the unroot android phone meaningless:

  1. Every year a new version of Android comes to market that unroot android phones can not have.

  2. It has recently been revealed that a spyware called pegasus has infiltrated unroot android phone.

What is the point of unroot android device!?

factoids – Where is the longest visible line of sight on Earth from point A to point B?

We’ve had some interesting questions on being able to see country A from B, and on visibility for miles in every direction.

For a 6 ft tall person, the horizon in a ‘flat’ area is meant to be about 5km. Obviously the higher you are, the further you can see, if nothing is obscuring your view.

So somewhere on Earth (point A) presumably, you can see all the way, unobscured to Point B, which is further away than any other two visible points on earth.

Where would this line be – that is, between which two points A and B?

How to plot a point in the intersection of two functions?

I’m trying to plot the intersection of a Sum function with a horizontal line and automatically highlight the intersection points.
The code below shows my knowledge of Mathematica and for different values of “d” I am calculating with Solve the intersection points (ex p1,p2 and p3) and manually typing the value in the Epilog option. I tried Point({p1,1}) but it doesn’t work. I also tried it with MeshFunctions -> {g(#) – f(#) &}, Mesh -> {{0}}, MeshStyle ->
PointSize(Large) but I get an error “functions must be pure functions”. I would also like to be able to define the ranges of “d” and “pc” as {d, {min,max,incr}} instead of a list.
Thanks in advance.

np = 2
f(pc_) := 1
q(d_, pc_) := (pc/(100*0.48)) * 
  Sum(((Pi/4)*(d - (2*n*0.48))^2), {n, 1, np})
p(d_) := Sum(Pi*(d - (2*n - 1)*0.48), {n, 1, np})
p1 = Solve(q(20, pc)/p(20) == f(pc), pc)
p2 = Solve(q(10, pc)/p(10) == f(pc), pc)
p3 = Solve(q(8, pc)/p(8) == f(pc), pc)
g(d_, pc_) := q(d, pc)/p(d)
Plot({Evaluate(Table(g(d, pc), {d, {8, 10, 20}})), f(pc)}, {pc, 0, 
  50}, PlotRange -> All, AxesLabel -> {"%", "li/lp"}, 
 FrameLabel -> {Style("pc", 12, Bold), Style("li/lp", 12, Bold)}, 
 PlotLabels -> {"d=8", "d=10", "d=20"}, PlotTheme -> "Scientific", 
 GridLines -> Automatic, PlotLabel -> "Razão comprimentos",
 Epilog -> {PointSize(0.02), Point({10.6053, 1}), Point({23.6134, 1}),
    Point({31.2426, 1})})

Find the DFS solution for the following graph if the starting point is vertex 3 and traces all vertice

Find the DFS solutionif the starting point is vertex 3 and traces all vertices
Find the DFS solution for the following graph if the starting point is vertex 3 and traces all vertice