How do aliens without the Medicine Skill stop the bleeding condition?

According to Starfinder’s bleeding condition rules:

You take the listed amount of damage at the beginning of your turn each round until this condition ends. Your bleeding can be stopped with a successful DC 15 Medicine check as a standard action, or through the application of any ability that restores Hit Points.

Some aliens have innate capabilities that allow them to restore hit points and can stop the bleeding in this way. Other aliens have the Medicine skill (or an ally with the Medicine skill) and can thus stop the bleeding that way. But what about unintelligent monsters, or aliens that simply have no medical training? Are they doomed if they get the bleeding condition and don’t have some capable healer at hand to stop the bleeding?

Heat balance multilayer with Neumann condition

I am solving the heat equation (diffusion only) over a 3-layer system (physical properties varying from layer to layer).

km = 0.128; rhom = 925; Cpm = 1550;  ka = 0.024; rhoa = 1.292; Cpa = 1003;  thickness = 2*0.136;    L1 = N[-thickness/2]; L2 = N[thickness/2]; T01 = 120; T02 = 20; T03 = 120;  Length1 = 0.5;   v= 40/60;  time1 = Length1/v; 

For describing the properties change in space, I use the following equation:

slope = 1000; SmoothedStepFunction[fL_, fmax_, fR_, tsL_, tsR_, m_] :=   Function[t, (fL*Exp[tsL*m] + fmax*Exp[m*t])/(Exp[tsL*m] +       Exp[m*t]) - (fR*Exp[tsR*m] + fmax*Exp[m*t])/(Exp[tsR*m] +       Exp[m*t]) + fR];  rhoCp[x_] :=    SmoothedStepFunction[rhoa*Cpa, rhom*Cpm, rhoa*Cpa, L1, L2, slope][x]; k[x_] := SmoothedStepFunction[10^6*ka, 10^6*km, 10^6*ka, L1, L2,      slope][x]; 

The actual heat balance is solved here:

heateq = rhoCp[x]*D[u[x, t], t] ==     Inactive[Div][{{k[x]}}.Inactive[Grad][u[x, t], {x}], {x}];  ic[x_] :=    Piecewise[{{T01, x < L1}, {T02, L1 <= x <= L2}, {T03, x > L2}}];  sol1 = First[    NDSolve[{heateq, u[x, 0] == ic[x]},      u, {x, -2*thickness, 2*thickness}, {t, 0, time1},      Method -> {"MethodOfLines",        "SpatialDiscretization" -> {"FiniteElement",          "MeshOptions" -> {"MaxCellMeasure" -> 0.01}}}]]; 

Despite it works well, I still have a question: next to the Neumann boundary conditions (Inactive[Div][{{k[x]}}.Inactive[Grad][u[x, t]) that are applied over the interfaces to connect the solutions in each domain, are there other boundary conditions applied implicitly?

In D&D 5e, what are all the ways to inflict the Paralyzed Condition on a creature?

In D&D 5e, what are all the ways to inflict the Paralyzed Condition on a creature?

I am talking about all the ways, not just spells.

  • All official actually printed-in-books sources (thus excludingg a lot of Unearthed Arcana stuff that is mostly "experimental" until actually printed in a book)

  • Even from monsters.

Personally I know only the Hold Person and Hold Monster spells.

The reason I am wondering is that I play a Barbarian and what to find ways to use my half-orc’s Savage Attack racial feature more often.

Thanks!

NDSolve How do I insert another boundry condition

So I’m new to programming and I am trying to solve a very simple differential equation (i can do this by hand but the thing is i can’t program it), the equation is a'[t] == - 0.0118, with the boundary conditions a[0]==3 and I want to know a[180]=?, how do I insert this (a[180]=?) into the code, this is my short code.

Sol = NDSolve[{a'[t] == -0.0118 , a[0] == 3 }, a, {t, 0, 180}] Plot[Sol, {t, 0, 180}]  

It doesn’t show anything in the plot

Thanks a lot, any type of help will be appreciated

Can the frightened condition stack if it’s caused by the same source?

Say Faendal the Fallen Aasimar Paladin uses his Necrotic Shroud racial ability (Charisma saving throw, an affected creature can repeat the saving throw on subsequent turns to end the effect), and a target fails the saving throw and is frightened. On his next turn, while the target is still frightened, Faendal uses Wrathful Smite, which also causes the frightened condition, on the same target and they fail the saving throw (Wisdom saving throw, an affected creature can make a Wisdom check to end the effect).

Does this mean that the target must succed on both the Charisma saving throw and the Wisdom check to end the effect on their turn? Meaning that should one of them fail, the target is still frightened?

Why does the Sentinel Feat include this condition? [duplicate]

In D&D 5e, the last part of the Sentinel feat contains this text:

When a creature within 5 feet of you makes an attack against a target other than you (and that target doesn’t have this feat), you can use your reaction to make a melee weapon attack against the attacking creature

  1. Thematically, why shouldn’t you get the opportunity attack if the target has Sentinel? I can’t think of any flavor/narrative reasons why your ally having an ability would prevent you from using your own ability.

  2. If that clause was included strictly to prohibit combos among fellow sentinels, is there an official source that says as much?

What is the highest value a condition could reach?

I’m making a Pathfinder 2e character sheet on Google sheet to automate as much number-crunching as possible. Currently, I’m making a dropdown list for conditions, as well as formulas for calculating their penalties.

I find adding conditions with pre-determined values much simpler than conditions with fillable values. For example, instead of clumsy and a blank slot for its value, the dropdown list will have clumsy 1, clumsy 2, clumsy 3, and so on. It’s ugly, but it greatly simplifies the formula. However, if a condition’s value could reach a really high number, then it will be too cumbersome to use.

The highest I have found is stupefied 4 from feeblemind and unfathomable song. I’m also pretty sure I’ve seen an ancestry/heritage/feat which could increase the maximum value of dying to 5.

So what is the highest value/penalty a condition could reach? For the supremely meticulous: what is the highest value each condition could reach?

Longest common sub sequences with a condition

Consider a sequences if called good if it contains at least one pair one adjacent numbers which are equal.A good sub-sequence of a array is a sub sequence of that array which is good and has its length is highest.Now you are given two array $ S$ and $ T$ with integers,you need to find sub sequences with is common to both arrays and has maximum length and is a good sub sequence.

This is a pure dynamic programming problem,in which states are $ dp[i][j]$ is answer for $ S[1:i]$ and $ T[1:j]$ ($ A[1:i]$ means subarray of $ A$ from $ 1$ to $ i$ ). But i could not find transition between states,could anyone help me.

Search for range in continuous function satisfying some condition

I am attempting to define an optimization for the following problem: given two graphs find (the largest possible) areas where some condition holds.

Interesting portions are where the Red graph is above the Green one. All, or part, of such areas may satisfy the condition.

Googling for optimization algorithms, e.g. ones mentioned in Scipy’s optimization tutorial, returns results focusing on finding a single point, usually the min/max of some condition. I am having trouble finding algorithms that search for ranges.

The graphsR and G are KDEs generated with Gaussian functions. I can find the intersections of the graphs (e.g. with brentq and between each pair calculate P and S (the conditions). The blue vertical lines are the intersections; blue horizontal lines with text are shown only when the conditions were met for the whole range.

In many cases a subset of the range satisfies the condition as can be seen in black. Those are results from a ML algorithm which I want to replace with a numerical calculation.

Example 1: ML algo found better solution on the right section, neither found the left one interesting. enter image description here

Example 2: on the right you can see the ML algo suggesting a range not quite between the blue lines. I am OK with the new algo clipping the portion on the left. enter image description here Example 3: showing that there may be more than one interesting range per marked section. enter image description here Example 4: ML algo missed the leftmost range enter image description here