Can you voluntarily suppress the effect of a continuous magic item you are wearing?

I would like to ask my DM if it is possible to craft a Continuous Cloud of Knives (Player’s Handbook II) Ring, but it could be a little awkward in certain situations, a swarm of knives orbiting around you is unlikely to help in social interactions. Is it possible to voluntarily suppress the effect of the spell?

Should I just opt for the Use-Activated item?

Cloud of Knives

Conjuration

Level: Cleric 2, Sorcerer 2, Wizard 2,

Components: V, S, M,

Casting Time: 1 standard action

Range: Personal Target: You

Duration: 1 round/level

You conjure a cloud of sharp knives around you. The knives float in the air around your upper body, pointing in the direction you look.

Each round as a free action at the beginning of your turn, you can release one of these knives at any target within 30 feet that you can see. This is a ranged attack that uses an attack bonus equal to your caster level + your key ability modifier. Each successful hit deals 1d6 points of damage +1 per three caster levels (maximum +5) and threatens a critical hit on a roll of 19-20. Damage reduction applies to knife attacks from this spell. The knives are treated as magic for the purpose of overcoming damage reduction. Material Component: A knife.

Optional Material Component: Using a silvered dagger (22 gp) in the casting of this spell allows the knives to overcome damage reduction as if they were both magic and silver, but the knives deal 1 less point of damage.

“Continuous” Bardic Inspiration

The bard’s Bardic Inspiration feature states:

You can inspire others through stirring words or music. To do so, you use a bonus action on your turn to choose one creature other than yourself within 60 feet of you who can hear you. That creature gains one Bardic Inspiration die, a d6.

Once within the next 10 minutes, the creature can roll the die and add the number rolled to one ability check, attack roll, or saving throw it makes.

This basically plays out to be “You can do it!” or “Break a leg!”, or just playing their lute to build suspense, to affect one thing at a time.

However, I was thinking about the possibility of changing this up for a more “constant” variation. A smaller pay off (+2, for example) for the entire period, much like listening to your favorite song when doing something challenging; Eye of the Tiger or Danger Zone during a fight, Stayin’ Alive while doing a heal or revive check, or just your favorite song to get you in the zone, and your blood pumping.

Additionally, the original time frame is “in the next 10 minutes”, which means any time within the next 60 rounds; so a compromise of a constant +2 over say, 1-3 minutes (i.e. the length of your “inpirational boom-box music”) would not only fit combat more effectively, but also be more evenly balanced in bonus:duration ratio.

So; would a constant bonus of +2 over a shorter duration (1 minute) be balanced?

How do I design a DP algorithm to count the minimum amount of continuous palindromic subsequences in sequence?

Taking a sequence, I am looking to calculate the minimum amount of continuous palindromic subsequences to build up such a sequence. I believe the best way is using a recursive DP algorithm.

I tried to start by coming up with the base cases, subproblem and recurrence but having trouble picturing the problem space or the most efficient way to do it. (For example, is it best to find the longest palindromic continuous subsequence first, or rather find the earliest one first?)

For example:

Sequence: [A, B, A, G, C, C, G, T, O, O, T ] is made up from 3 subsequences, namely [A, B, A] + [G, C, C, G] + [T, O, O, T]

So, therefore, my output for this example would be 3.

Thanks in advance!

In the ubiquity RPG system, what is the advantage of using continuous combat?

In the ubiquity RPG system (as used in Hollow Earth Expedition or Space 1889), an alternative initiative system (“continuous combat”, where actions take place continuously, without use of combat turns) is proposed in addition to the default system (a turn based system relatively similar to Dungeons and Dragons). Continuous combat is left a bit vague in the core rulebook, but elaborated on in the addendum to the Hollow Earth Expedition GM screen.

What are the advantages (as a GM) of using continuous combat? Is it very complicated to use? When would it shine compared to the standard initiative system? When is it worse?

How does one simulate continuous gravity using a discrete timestep?

While gravity in real life is continuous, computers are limited to discrete calculations.

Therefore, a seemingly correct projectile simulation inevitably drifts off.

For example:

// Repeat once per frame position += velocity * deltaTime; velocity += gravity * deltaTime; 

Graphed, compared to the actual projectile formula Two datasets merged. While they look equal at first, the discrete data drifts off over time.

How to stop continuous crawl even though the content sources are all idle?

I have a 6 server 2016 crawl farm on 2012R2 Windows. Server1-6. 5&6 host crawler, admin component, and content processing. 3&4 host content processing and analytics. 1&2 host indexes and query processing.

We were getting a lot of errors on our continuous and incrementals so I stopped them to troubleshoot. However, even though the content sources are all idle, the crawl log still shows the continuous as running. Also, any crawls i start now just run without crawling anything. No errors but no successes. I have tried restarting the whole farm, stopping osearch, sptimer, & spadmin services and bouncing IIS as well. The crawl targets are up and providing content and permissions are correct there. No resource contentions anywhere.

How to compute a system of ordinary differential equations with initial condictions over a continuous range

I have some questions about Mathematica programming and would appreciate if you could help me.

I want to solve a system of ordinary differential equations \ [Mu] ‘[t] and \ [Lambda]’ [t] and each equation contains a large number of terms so it is impractical to write them explicitly. I express these terms as two functions F1 and F2 that depend on two parameters P1 and P2 and \ [Lambda] [t] and \ [Mu] [t].

I have been able to solve this system for a couple of initial conditions \ [Lambda] [0] = ic1 and \ [Mu] [0] = ic2, but I would like to solve my system of equations for a continuum of values ​​\ [Lambda] [0] = {0, …., Pi / 2} and \ [Mu] [0] = {0, …., Infinity} and then get \ [Lambda] [t] and \ [Mu] [t] and use them to perform an integral on \ [Lambda]= \ [Lambda] [0] ={0, …., Pi / 2} and \ [Mu] =\ [Mu] [0] ={0, …., Infinity} that are precisely our initial conditions.

I integrate the product of a function G in the time t (where \ [Lambda] [t] and \ [Mu] [t] are taken into account for a certain initial condition defined by the continuous ranges of the integral) with the same function, but in t = 0 (where the initial conditions are taken into account with the continuous ranges of the integral).

The structure of the program is:

ode = {\[Mu]'[t] ==  F1[p1, p2, \[Lambda][t], \[Mu][t]], \[Lambda]'[t] ==  F2[p1, p2, \[Lambda][t], \[Mu][t]], \[Mu][0] == {0, ....,   Pi/2}, \[Lambda][0] == {0, ...., Infinity}};   Sol = NDSolve[ode, {\[Mu], \[Lambda]}, {t, 0, 1},`Method -> "Some method to choose"]     \[Mu]1[t_] := Evaluate[\[Mu][t] /. Sol] // First \[Lambda]1[t_] := Evaluate[\[Lambda][t] /. Sol] // First   data = ParallelTable[{t,  NIntegrate[   G[p1, p2, \[Mu]1[      t] "for the initial condition \[Mu]=\[Mu][0]", \[Lambda]1[      t] "for the initial condition \[Lambda]=\[Lambda][0]"] G[p1,     p2, \[Mu] "=\[Mu][0]", \[Lambda] "=\[Lambda][0]"] , {\[Mu] "=`\[Mu][0](initial condition)", 0,    Pi/2}, {\[Lambda] "=\[Lambda][0](initial condition)", 0,    Infinity}, Method -> {"Some method to choose"}]}, {t, 0, 1}];` 

How to stop continuous concurrent local DNS queries to dnsmasq

I set up a DNS server using dnsmasq, but it seems that it doesn’t work properly. The networking delay is up to hundreds of millisecs.

PING [server] ([server]) 56(84) bytes of data. 64 bytes from [server]: icmp_seq=1 ttl=50 time=583 ms 64 bytes from [server]: icmp_seq=2 ttl=50 time=583 ms 64 bytes from [server]: icmp_seq=3 ttl=50 time=583 ms 64 bytes from [server]: icmp_seq=4 ttl=50 time=583 ms 64 bytes from [server]: icmp_seq=5 ttl=50 time=583 ms 64 bytes from [server]: icmp_seq=6 ttl=50 time=583 ms 64 bytes from [server]: icmp_seq=7 ttl=50 time=583 ms 64 bytes from [server]: icmp_seq=8 ttl=50 time=583 ms 

Then soon I discovered that it’ll turn all right with using the default resolver systemd-resolved. By checking the log, I got the messages here below:

Jul 27 13:32:53 dnsmasq[3780]: query[A] ntp.ubuntu.com from 127.0.0.1 Jul 27 13:32:53 dnsmasq[3780]: forwarded ntp.ubuntu.com to 127.0.0.53 Jul 27 13:32:53 dnsmasq[3780]: query[A] ntp.ubuntu.com from 127.0.0.1 Jul 27 13:32:53 dnsmasq[3780]: forwarded ntp.ubuntu.com to 127.0.0.53 [countless records repeating these above...] Jul 27 13:32:53 dnsmasq[3780]: Maximum number of concurrent DNS queries reached (max: 150) Jul 27 13:32:54 dnsmasq[3780]: query[A] ntp.ubuntu.com from 127.0.0.1 Jul 27 13:32:54 dnsmasq[3780]: forwarded ntp.ubuntu.com to 127.0.0.53 [...] [probably the sigterm was sent here?] Jul 27 13:32:57 dnsmasq[3780]: query[A] ntp.ubuntu.com from 127.0.0.1 Jul 27 13:32:57 dnsmasq[3780]: forwarded ntp.ubuntu.com to 127.0.0.53 Jul 27 13:32:58 dnsmasq[3780]: no servers found in /run/dnsmasq/resolv.conf, will retry Jul 27 13:32:58 dnsmasq[3780]: query[A] ntp.ubuntu.com from 127.0.0.1 Jul 27 13:32:58 dnsmasq[3780]: query[A] ntp.ubuntu.com from 127.0.0.1 Jul 27 13:32:58 dnsmasq[3780]: query[A] ntp.ubuntu.com from 127.0.0.1 Jul 27 13:32:58 dnsmasq[3780]: query[A] ntp.ubuntu.com from 127.0.0.1 Jul 27 13:32:58 dnsmasq[3780]: query[A] ntp.ubuntu.com from 127.0.0.1 Jul 27 13:32:58 dnsmasq[3780]: exiting on receipt of SIGTERM 

So.. How to resolve this problem which makes me crazy, plz 🙁

The content from dnsmasq.conf is here:

strict-order resolv-file=/etc/resolv.conf.dnsmasq listen-address=0.0.0.0 server=/aliyuncs.com/100.100.2.136 server=/aliyuncs.com/100.100.2.138 server=/*.cn/100.100.2.136 server=/*.cn/100.100.2.138  bogus-nxdomain=100.100.2.136 bogus-nxdomain=100.100.2.138  log-queries log-facility=/var/log/dnsmasq/dnsmasq.log log-async=50  #EOF 

And resolv.conf.dnsmasq:

nameserver 100.100.2.136 nameserver 100.100.2.138 nameserver 208.67.222.123 nameserver 208.67.220.123 nameserver 8.8.8.8 nameserver 8.8.4.4 nameserver 1.2.4.8 nameserver 210.2.4.8 nameserver 208.67.222.222 nameserver 208.67.220.220 

resolv.conf:

# Dynamic resolv.conf(5) file for glibc resolver(3) generated by resolvconf(8) #     DO NOT EDIT THIS FILE BY HAND -- YOUR CHANGES WILL BE OVERWRITTEN # 127.0.0.53 is the systemd-resolved stub resolver. # run "systemd-resolve --status" to see details about the actual nameservers.  nameserver 127.0.0.53 options timeout:2 attempts:3 rotate single-request-reopen 

How to identify a continuous shape and break it into minimum number of rectangles?

The input in this case is going to be coordinates in 2D of the vertices of the shape. There will be no curves, but the shape can have holes. The algorithm or program needs to identify the continuous shape and break it into rectangles. The number of rectangles so created has to be optimized too.

I did read about spatial segmentation, but I am confused how to implement it. Any suggestions or help will be greatly appreciated.

Thanks!