What techniques should I use to get my players more interested in my campaign? [on hold]

I am a veteran DM in a campaign that I made myself for D&D5e and my players want to replace me for someone else because they say that my campaign “sucks”. The players say that my campaign is bad because I can not describe what going on in battles and that my settings go from one place to another which they don’t like. The players might not like my description skills but with them messing around I never get a chance to finish the descriptions because they are messing around. I want to know some description and good techniques to get my players interested in my campaign so that maybe I can save my campaign from being replaced. I would also like ways to persuade the players to actually pay attention so that they might realize that my campaign is really fun or so they have real reasons for why it is bad.

Technically, why is the out of focus area blurred more when using a bigger aperture?

I’m wondering, technically, why and how does the out of focus areas blur more when using a bigger aperture. I think it’d help a lot if I presented a problem that’s been driving me nuts for a long time:

I’ve read that the f-number of the human eye varies from about f/8.3 in very bright light to about f/2.1 in the dark. But from what I’ve tested, I always see out-of-focus areas with the same amount of blur.

Which leads me to ask: how does this aperture thing work, why does it create a blur from the technical point of view, and does it also apply to eyes, or is it just a “failure” in the camera lenses we’ve come to like and never wanted to “fix”?

Which is more secure Yubikey + Keepass using Challenge/Response or Yubikey + Keepass using OTP?

I use a Windows 10 PC and an Android phone with Keepass.

I would like to add a second factor on top of my master password that works with both Windows 10 and my Android phone.

Between the two support methods of authentication, which one is more secure?

  1. Yubikey + Keepass 2 using Challenge/Response
  2. Yubikey + Keepass 2 using OTP

Thanks in advance.

Regularity of a language contains more 1’s than 0’s

The language of all bitstrings with more 1s than 0s, i.e.,

$ A = \{x: 2*\Sigma_{i}^{|x|} x_{i} > |x|\}$ is regular.

I know I should apply Pumping Lemma and the proof as well, what I cannot understand is’ the meaning of question itself. To be more precise, my question is’ how the formal and informal sections of the question are the same?

Sunflower lemma in a more general poset?

The sunflower lemma may be viewed as a statement about the poset $ P_\omega(\omega_1)$ , and the generalized sunflower lemma may be viewed as a statement about the poset $ P_\lambda(\kappa)$ for $ \kappa$ sufficiently large compared to $ \lambda$ . Is there a version which holds in more general posets $ P$ ?

If the poset $ P$ is a lattice, then what I’m looking for is a theorem that under certain conditions, a subset $ X \subseteq P$ has a “large” subset $ Y \subseteq X$ whose pairwise meets are constant. If $ P$ is not a lattice, it becomes a little bit less clear, but for example, one might state a theorem that under certain conditions on a subset $ X \subseteq P$ , there is a $ p \in P$ and a “large” $ Y \subseteq X \cap P_{\geq p}$ such that $ Y$ forms a strong antichain in $ P_{\geq p}$ .

The conditions on $ X$ would presumably say that $ X$ is “large” and its elements are “small” in some sense.

How to setup squid-deb-proxy and squid-deb-proxy-client to be more autonomous (to work without internet)?

I have server with installed squid-deb-proxy. Let’s say that its IP is 10.13.3.7.
I have installed squid-deb-proxy-client on other machines (let’s name them clients). Server and clients are in the same network and run Ubuntu 16.04.6 LTS.

Yesterday night I have downloaded all updates from one of the clients. So I expect that Squid Deb cache is filled with headers and packages.

On today morning there is no internet because of WAN (ISP) maintenance. I can’t ping anything outside the LAN. I can ping 10.13.3.7 from clients.

Thus when I run sudo apt update on clients I see the following messages:

0% [Working]
0% [Waiting for headers]
Err:N http://archive.ubuntu.com/ubuntu release InRelease
Connection failed [IP: 10.13.3.7 8000]

W: Failed to fetch http://archive.ubuntu.com/ubuntu/dists/release/InRelease Connection failed [IP: 10.13.3.7 8000]
… W: Some index files failed to download. They have been ignored, or old ones used instead.

and same for sudo apt upgrade or sudo apt install ...:

0% [Waiting for headers]
Err:N http://archive.ubuntu.com/ubuntu xenial/pocket arch name arch version
Connection failed [IP: 10.13.3.7 8000]
E: Failed to fetch http://archive.ubuntu.com/ubuntu/pool/main/….deb Connection failed [IP: 10.13.3.7 8000]
E: Unable to fetch some archives, maybe run apt-get update or try with –fix-missing?

Is it possible to work without internet and get packages from local squid-deb-proxy cache?

Need help to optimize this code and make it more compact

Need help to optimize this code and make it more compact

cat failed_degraded_script.sh  echo "***Pulling disk states from all frames***" for i in $  (cat HPE_FRAMES_IP); do ssh Reports@$  i showsys | awk '{print $  2","$  5}' ; ssh Reports@$  i showpd -degraded -failed | awk '{print $  1","$  2","$  3","$  5}' ; done | grep -v "MiB" | grep -v "total" | egrep -B3 "failed|degraded" | sed 's/---Name/\n---Name/g'| sed 's/-//g' > Failed_Degraded.csv echo "***csv2htl***" ./csv2html.sh > Failed_Degraded.html sed '/<table>/r table_width.txt' Failed_Degraded.html > output-1.html cat table_format.txt output-1.html > output.html echo "***sending email***" mutt -e 'set content_type="text/html"' my email -s "HPE Failed/Degarded Disks"< output.html`enter code here` 

Do more than $n$ polynomials in $n$ variables help in extracting common roots?

Given $ n$ homogeneous algebraically independent degree $ 2$ polynomials in $ \mathbb Z[x_1,\dots,x_n]$ we can extract at least one common integer root with elimination theory in exponential $ SPACE$ and $ TIME$ .

Suppose we have $ m\geq n$ homogeneous independent degree $ 2$ polynomials in $ \mathbb Z[x_1,\dots,x_n]$ with

  1. any $ n$ of them being algebraically independent

  2. only common roots of all $ m$ polynomials being integer roots

then does it help improve extracting at least one root to subexponential $ SPACE$ and $ TIME$ complexity where input size is $ L$ bits (measure of number of coefficients and number of bits in coefficients) at some $ m=\Omega(n^{1+\epsilon})$ for a fixed $ \epsilon\in(0,\infty)$ (gaussian elimination picks something integral without relevance to non-linear properties)?

Will renting a car ad hoc in NYC be much more expensive than booking it beforehand?

I will be in NYC and upstate from late June to early July. I’m planning to rent a car for the second half of the stay, but it could turn out I need one earlier.

Should I absolutely book a car now to make sure I will get one at a reasonable price, or can I wait until there and rent one on the same day without a huge change in price?

In smaller places in Europe I would be nervous about short-term availability. Is this an issue in NYC?

Looking for options to make the UI more pleasant and understandable

We are build a bunch little strategic tools. Most of them a really simple and should be super easy to understand.

One of them is build to execute comparison of multiple items. The comparison is performed in pairs.

Is sound easy, but the best UI I could come up with is this: enter image description here

In here the user needs to UPVOTE one of the options in the pair, then the process switches to the next one, and so on.

This UI, feels really weird especially in extreme cases when the content of items becomes very long or very short (like in a the images above). It is simply not sexy at all.

I was hoping to get some sort of guideline or suggestion to get me to the right direction.

Thanks,