Inkscape: joining arcs and curves

I saw a similar question answered about 10 years ago. But I can’t get it to works. I want to join an elliptic arc to a bezier curve so they are a single path. I know SVG supports this. I want to use the "joint selected nodes" command. But when I try to select the two ends they don’t seem to be of the same "type" (see image) and I can’t select them both.

enter image description here

postgresql – Joining two tables partitioned tables having index with the partition key and joining columns does not help much

I have two partitioned tables that have an index created on the joining key and the partition/primary key (because on partitioned tables on Postgres the partition key must belong always to the index). When I run this query:

select
  mol.* 
from merchant_order_lines mol 
where
  mol.fk_x_orders_id = 552369076;

I get the next plan with explain analyze

 Nested Loop  (cost=0.71..3147351.05 rows=419 width=594) (actual time=0.106..727738.027 rows=1 loops=1)


 ->  Index Only Scan using merchant_orders_2017_pkey on merchant_orders_2017 mo  (cost=0.56..8.58 rows=1 width=8) (actual time=0.023..0.026 rows=1 loops=1)
         Index Cond: (sk_id = 552382076)
         Heap Fetches: 1
   ->  Append  (cost=0.14..3147338.27 rows=419 width=594) (actual time=0.079..727737.994 rows=1 loops=1)
         ->  Index Scan using merchant_order_lines_2016_0_sk_id_fk_x_orders_id_idx on merchant_order_lines_2016_0 mol  (cost=0.14..9.28 rows=1 width=514) (actual time=0.031..0.031 r
ows=0 loops=1)
               Index Cond: (fk_x_orders_id = 552382076)
         ->  Index Scan using merchant_order_lines_2016_1_sk_id_fk_x_orders_id_idx on merchant_order_lines_2016_1 mol_1  (cost=0.14..9.05 rows=1 width=632) (actual time=0.011..0.011
 rows=0 loops=1)
               Index Cond: (fk_x_orders_id = 552382076)
         ->  Index Scan using idx_fk_x_orders_id_merchant_order_lines_2017_0 on merchant_order_lines_2017_0 mol_2  (cost=0.56..33.25 rows=84 width=577) (actual time=0.037..0.038 row
s=1 loops=1)
               Index Cond: (fk_x_orders_id = 552382076)
         ->  Index Scan using merchant_order_lines_2017_1_sk_id_fk_x_orders_id_idx on merchant_order_lines_2017_1 mol_3  (cost=0.56..893039.49 rows=72 width=600) (actual time=198583
.513..198583.513 rows=0 loops=1)
               Index Cond: (fk_x_orders_id = 552382076)
         ->  Index Scan using merchant_order_lines_2018_0_sk_id_fk_x_orders_id_idx on merchant_order_lines_2018_0 mol_4  (cost=0.56..1126430.31 rows=130 width=593) (actual time=2836
18.835..283618.835 rows=0 loops=1)
               Index Cond: (fk_x_orders_id = 552382076)
         ->  Index Scan using merchant_order_lines_2018_1_sk_id_fk_x_orders_id_idx on merchant_order_lines_2018_1 mol_5  (cost=0.56..1127814.78 rows=131 width=604) (actual time=2455
35.558..245535.558 rows=0 loops=1)
               Index Cond: (fk_x_orders_id = 552382076)
 Planning Time: 14.336 ms
 Execution Time: 727738.113 ms

So the query is using the index (and the ones inherited by the partitions) but I getting and awful time. When I manually create indexes on fk_x_orders_id only per every partition I get the next plan:



 Nested Loop  (cost=0.71..135.21 rows=419 width=594) (actual time=4.232..4.294 rows=1 loops=1)
   ->  Index Only Scan using merchant_orders_2017_pkey on merchant_orders_2017 mo  (cost=0.56..8.58 rows=1 width=8) (actual time=3.431..3.432 rows=1 loops=1)
         Index Cond: (sk_id = 552382076)
         Heap Fetches: 1
   ->  Append  (cost=0.14..122.44 rows=419 width=594) (actual time=0.795..0.855 rows=1 loops=1)
         ->  Index Scan using merchant_order_lines_2016_0_sk_id_fk_x_orders_id_idx on merchant_order_lines_2016_0 mol  (cost=0.14..9.28 rows=1 width=514) (actual
 time=0.010..0.010 rows=0 loops=1)
               Index Cond: (fk_x_orders_id = 552382076)
         ->  Index Scan using merchant_order_lines_2016_1_sk_id_fk_x_orders_id_idx on merchant_order_lines_2016_1 mol_1  (cost=0.14..9.05 rows=1 width=632) (actu
al time=0.007..0.007 rows=0 loops=1)
               Index Cond: (fk_x_orders_id = 552382076)
         ->  Index Scan using idx_fk_x_orders_id_2017_0 on merchant_order_lines_2017_0 mol_2  (cost=0.56..33.25 rows=84 width=577) (actual time=0.778..0.779 rows
=1 loops=1)
               Index Cond: (fk_x_orders_id = 552382076)
         ->  Index Scan using idx_fk_x_orders_id_2017_1 on merchant_order_lines_2017_1 mol_3  (cost=0.56..15.51 rows=72 width=600) (actual time=0.017..0.018 rows
=0 loops=1)
               Index Cond: (fk_x_orders_id = 552382076)
         ->  Index Scan using idx_fk_x_orders_id_2018_0 on merchant_order_lines_2018_0 mol_4  (cost=0.56..33.38 rows=130 width=593) (actual time=0.020..0.020 row
s=0 loops=1)
               Index Cond: (fk_x_orders_id = 552382076)
         ->  Index Scan using idx_fk_x_orders_id_2018_1 on merchant_order_lines_2018_1 mol_5  (cost=0.56..19.87 rows=131 width=604) (actual time=0.019..0.019 row
s=0 loops=1)
               Index Cond: (fk_x_orders_id = 552382076)
 Planning Time: 0.315 ms
 Execution Time: 4.336 ms

Why does the index that contain the partition/primary key and the column fk_x_orders_id is behaving so badly?

Children joining train later UK

I need to travel from London to the north and my children aged 5 and 8 will join me on the train at Milton Keynes, delivered there by their grandparents. If I book the ticket for all three of us from London it works out cheaper than a single for me from London to MK and then all three from MK to destination. But is it possible for the kids to join at MK if their ticket is from London, or will it cause problems going through the barriers and boarding at MK?

Joining MS teams meeting with two devices and sharing screen from one device

For me it works if I log in with different accounts on the two devices. On my main computer, I am using my professional account. On my phone, I am using my private account. Then, if I invite my phone from my main computer, I can join with my phone as if it were a regular attendee to the meeting. In particular, this allows me to see the camera from my phone on my main screen.

Alternatively, you can just open a web browser on your main machine and log in on the web browser via a guest account. This will also allow you to see exactly the same that any attendee of your meeting sees.

Philosophy Writer – Joining the Community

Good Afternoon Everyone!

I would like to introduce myself to get the ball rolling and meet some of you. I work for an intellectual property firm, but I’m a philosophy blogger in my spare time. I’m interested in all branches of science and philosophy, but mainly Physics and metaphysics.
SEMrush

I have a little background in Physics, where I’ve studied for a couple of years at university, and I hope to finish my degree and pursue a research position later in life.

Most of my articles at the moment are general philosophical ideas, like;
– “What are space and time?” or
– “Why we are probably not living in a simulation.
But I write on niche topics and do book reviews as well.

It would be great if any of you could check out my website and offer advice, as I have only been posting for a few months. It would also be cool if any of you were to feature on my blog for a guest post, since it’s just me posting at the moment.

The link to my WordPress site is here: Unique Philosophy

Let me know what you think! I’m eager to meet other bloggers, so pop up if this is the kind of thing that you’re interested in.

Jordan

 

mysql – Joining tables based on closest times

I want to have join two tables based on others timestamp

Table A:

username | activity | timestamp
A          activity1  2020-01-01 01:00:00
A          activity2  2020-01-01 02:00:00
A          activity3  2020-01-01 03:00:00
B          activity1  2020-01-01 02:00:00
B          activity2  2020-01-01 03:00:00
B          activity3  2020-01-01 04:00:00

Table B:

username | clickId | timestamp
A          click1  2020-01-01 00:00:00
A          click2  2020-01-01 01:30:00
A          click3  2020-01-01 01:45:00
B          click1  2020-01-01 00:00:00
B          click2  2020-01-01 00:30:00
B          click3  2020-01-01 03:35:00

need to match all the activities in the activities table to the most recent clicks in the clicks table performed by each user

click matched to each activity must be the most recent click that occured prior to the activity timestamp

Output:

A activity1 click1 - since for activity1 click1 is the timestamp smaller than it
A activity2 click3
A activity3 click3
B activity1 click2
B activity2 click2
B activity3 click3

I tried multiple queries but didnt work

Having problems joining table

I have the following tables and I want to know Jack’s dob, salary and the total score of that employee who who is also a player. The The relational schemas are:

Emp_Players(eid,pid,team) composite key is (eid,pid)
Plays(pid, team, matchName, scores) composite key is (pid, team, matchName)
Emp(empID, dob, salary) empID is pk 
Players(pid, name, team) composite keys are (pid, team)

The query that I wrote is this however I get an error because im using group by operator.
Is there an alternate way that can work? Also Im not sure if im during the join right? I am not able to use the where clause as where name = ‘Jack’. It tells me ‘no column named Jack ‘

Select name, address, dob, sum(scores)
From Emp e
JOIN Emp_Players ep ON e.empID = ep.eid 
JOIN Plays p ON p.pid = ep.pid
Group by p.pid;

I would really appreciate any help. Thanks.

summation – Confuse about joining and totaling sets with different lengths

Here is my code:

Timeval = 1;
Rval = 8;
Flap(s_) := Exp(-2 Sqrt(s));
Tfunexact(t_) := Exp(-1/t)/Sqrt(Pi*t*t*t);
Valexact = N(Tfunexact(Timeval), 20)
math(F_, t_, M_) :=
     Module({np, r, S, theta, sigma},
      np = Max(M, $MachinePrecision);
      r = SetPrecision(2 M/(5 t), np);
      S = r theta (Cot(theta) + I);
      sigma = theta + (theta Cot(theta) - 1) Cot(theta);
      (r/(3 M)) Total(Join @@  {Exp(r t) F(r),
      2 Table(Re(Exp(t S) (1 + I sigma) F(S)),
                    {theta, 2 Pi/M, (M/2 - 1) Pi/M, 2 Pi/M})
      })
  )
{Timeval, Approxval} = Timing(N(math(Flap, Timeval, 20)))
RelError = Abs(Approxval - Valexact)/Valexact

The output is showing the set not the total of joining set. The result should be a numeric. Pleas help me! Also have tried to use Plus @@ but still failed since the length of the sets are not the same. Thanks in advance.

windows – Physical Workstation/Computer joining a domain

0

I am trying out to be an IT sysadmin.

I managed to install windows server 2012 on my VM and AD. I have set up my domain, user accounts, joining workstation to the AD(by creating another VM), and everything.

I am just curious if it is possible for a physical computer that is outside the VM to join my domain ( that is Set up in windows server 2012 in the VM)

It would be interesting if that works out.

active directory – 80180018 error when joining Azure AD

I have problem after disjoining Azure AD to help solve another issue, I can’t join again due to 80180018 . I don’t use MDM nor Intune and I removed the devices from the portal. When I tried to create another user and login using that account, still same error.