## What’s the difference between ACK Flood and PSH-ACK Flood?

We often hear about ACK & PSH-ACK Flood.

we know the ACK Flood and PSH-ACK Flood are different Flood attack.

## Are Half-Elves supposed to have a slender build like Elves, or are they supposed to have a build that’s intermediate between Humans and Elves? [5e]

The Player’s Handbook’s weight descriptions for Half-Elves are inconsistent. The Half-Elf section in Chapter 2 (pg. 38) says:

They range from under 5 feet to about 6 feet tall, and from 100 to 180 pounds, with men only slightly taller and heavier than women.

However, the “Height and Weight Range” table in Chapter 4 (pg. 121) gives a weight formula for Half-Elves of 110 + (2d8) x (2d4), which is 114 to 238 pounds.

This is very different.

Do we have any reason to label one description Correct and the other A Mistake? The 2018 PHB Errata are silent on this point.

Looking at the rest of the table’s formulas, Humans are 114 to 270 lbs, whereas Wood Elves are 102 to 180 lbs and High Elves are 92 to 170 lbs. (I’ve excluded the Drow because they’re significantly shorter.)

So are Half-Elves supposed to have a slender build like elves (100-180 lbs), or are they supposed to have a build that’s intermediate between Human and Elf (114-238 lbs)?

[As a side note, changing the Half-Elves’ weight modifier in the table from its current 2d4 (which is like a Human’s) to only 1d4 (like the Wood and High Elves’) would yield a calculated range of 112 to 176 pounds.]

## Defining an Algorithm for finding all alignments between two sequences

Let S and T be two sequences of length n and m, respectively. When calculating the dynamic programming table to find the optimal global alignments between the two sequences S and T, we can keep pointers to find the optimal alignments by following these pointers from cell (n, m) to cell (0,0). Each of the paths represents a different optimal alignment for the two sequences.

To illustrate, we have an example of a table between the sequences ACGTTA and AACTA. By following the arrows from the cell (6,5) to (0,0) we get a possible optimal alignment. There are many ways to get to (0,0). Each of those ways is a distinct possible optimal alignment.

The challenge is to find a dynamic programming algorithm that will give me the number of the possible paths from this first table probably by looking at pointers.

Because dynamic programming involves having a programming table I’m not sure how it should look like. What would be the appropriate policy that determines which cells to look at to find the result in the next cell.

I notice that each possible alignment is a path from (n,m) to (0,0). This implies that each different path is a divergence from a common path.

You will notice that the red path and the blue path have some parts in common. This seems to justify a dynamic programming solution because we have certain solutions in common that we can use to find the next solution.

My whole problem with this is how do I formalize this thinking into a policy that looks like:

The left part is the intial conditions. It basically tells how to find the solution for the next cells based on previous cells. This is not specific to this problem it’s just an example of what I’m looking for.

## Explain the equation to find the collaboration between neighbors in SOM in unsupervised learning

In kohonen SOM algorithm, the equation to find the collaboration is:

I know that LDist is the lattice distance and sigma is the standard deviation. I am just wondering why they are squared ? Can anyone help me to visualize the equation or explain to me what is going on in the above equation ?

## Equivalence between MIN UNCUT and MIN-CSP_XOR

In this paper

Agarwal, Amit, et al. “O (√ log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems.” Proceedings of the thirty-seventh annual ACM symposium on Theory of computing. 2005.

Agarwal et al. claim that the following two problems are equivalent.

Consider boolean variables $$b_1,\dots ,b_n$$ and a set of constraints of the form $$b_i \oplus b_j = 0$$ and $$b_i \oplus b_j = 1$$. The goal is to minimize the number of unsatisfied constraints.

and

Given a graph $$G=(V,E)$$ find a cut that minimizes the number of uncut edges.

If constraints were only of the form $$b_i \oplus b_j = 1$$, the equivalence is straightforward. However, if we also consider constraints of the form $$b_i \oplus b_j = 0$$, the first formulation seems more general to me.

How are these equivalent?

## How to get data from database week wise between two given dates?

I have a SQL database where i saved data of all dates in table. What i want is, If given any two dates, i want all the data between those two dates in weekly format where week starts on Monday. if given date starts with Thursday for example, so data from Thursday to sunday should be displayed as a week data.

I give you one example. If i choose start date 08-01-2020 and end date 08-03-2020. Now this is two months gap and there are probably 30 days. I want data of those 30 days, but week wise from Monday to Sunday. But here given start date is on Wednesday, so the that weeks data would start from wednesday and end on sunday.

Hope you got my point. Thanks in advance.

## Difference between NP Intermediate and NP Complete

Assuming P ≠ NP

How do you determine whether a problem belongs in NP Intermediate or NP Complete?

Why does integer factorization belong in NP Intermediate, but the knapsack problem belongs in NP Complete?

## When did Monks make their first appearance in D&D, and how do they differ between editions?

My curiosity continues after asking When did Rangers make their first appearance in D&D, and how do they differ between editions? Also, see about Druids and Artificers. This series of question is based on the initial question regarding Warlocks by aaron9eee:

A quality answer would have more than just a release date, and would ideally cover what makes each edition’s version different from other editions.

When did Monks make their first appearance in D&D, and how do they differ between editions?

## Conflict between CapMonster and GSA-PS

Good morning, all.
Finally got CAPmonster.
Stating conflict with GSA Proxy Scraper.
If I change the IP and ports of GSA-CB would it be OK, then?
I am presently using default IP 127.0.0.1 and ports 1001,1010,1011,1100,1111,2222,3333,4444,5555,8080,9090,9999
Thanks!

## Data Consistency Between 2 Mysql Databases Running Different Versions

I need to migrate an old web application using old php and mysql versions. I am intending to start by migrating the code that interacts with the database to a new server with the latest versions and allow the old server to use an API in the new server. Ideally I would like to have the data consistent between the database in the new server and the one in the old server. It seems that replication only works only when the master is only one version behind the slave. In this case the difference is a way more than one version. I also want changes to the database on the new server to reflect on the database on the old server. Are there any tools/techniques to help with this situation other than ensuring the data consistency programmatically with cron jobs …. If something is not clear please let me know and all suggestions are welcome.