big sur – How to block certain devices from showing up for AirPlay / Screen Mirroring?

As of MacOS 11 (Big Sur) the Airplay/Screen Mirroring options have changed. In Catalina there was a single icon in the toolbar for Airplay, clicking it gave a list of devices that, AFAIK, didn’t change while the menu was held down.

In MacOS 11, the new flow is you click the control panel(?) icon, then “screen mirroring”, then a list of devices appears.

enter image description here

This list is populated as you’re interacting with it which has the problem that you intend to choose a name but just has you go to click, new devices are added and you click on the wrong device.

Worse, these devices could be from other houses/rooms/apartments. 3 times, trying to click on my own device, Big Sur has added devices under the mouse as I click and I’ve ended up clicking on a neighbor’s device. Which, if I understand correctly, means I’ve just interrupted my friends viewing and possibly made their TV, which was off, come on.

How can I block certain devices from ever appearing in the screen mirroring list of devices so I can avoid annoying my neighbors?

Note: Turing Bluetooth off is not an option as I use Airpod with my Mac daily.

coding theory – Showing that (simple) codes are equivalent.

I’ve just started reading a book on Error-Correcting Codes; it’s my first contact with this subject. I’m stuck on the following exercise:

Given the alphabet $A={a,b,c,d}$ and codes $C_1={aac,acd,cca,acd,aaa}$, $C_2={abc,bbb,ddb,dda,dbc}$, and $C_3={aac,add,cba,cca,aaa}$, identify pairs of equivalent codes.

What I’ve tried so far is:

I’ve noticed that acd appears in $C_1$ twice, I don’t know if that’s a typo, but if it isn’t then $C_1$ cannot be equivalent to any of the other codes, because no two elements in either $C_2$ or $C_3$ are the same.
To find whether $C_2$ and $C_3$ are equivalent or not, I’ve made the following tables:

Hamming Distance of elements in $C_2$:
d(u,v) & abc & bbb & ddb & dda & dbc\
abc & 0 & 2 & 3 & 3 & 1 \
bbb & 2 & 0 & 2 & 3 & 2 \
ddb & 3 & 2 & 0 & 1 & 2 \
dda & 3 & 3 & 1 & 0 & 2 \
dbc & 1 & 2 & 2 & 2 & 0

Hamming Distance of elements in $C_3$:
d(u,v) & aac & add & cba & cca & aaa\
aac & 0 & 2 & 3 & 3 & 1 \
add & 2 & 0 & 3 & 3 & 2 \
cba & 3 & 3 & 0 & 1 & 2 \
cca & 3 & 3 & 1 & 0 & 2 \
aaa & 1 & 2 & 2 & 2 & 0

Because these two tables are not equivalent, due to $d(ddb, bbb)=2 neq 3=d(cba,add)$, I believe the codes also are not.

Are there really no pairs of equivalent codes in this exercise? Are there better ways of showing that two codes are equivalent, other than looking at a table of distances or just guessing the right isomorphism?

unity – Mirror network, player not showing up on UI when connecting to server

I want to create a playerList, that whenever a player joins server, his/her name will show up on a list in UI. But currently the names are only showing up on the Client + host side. Below is my NewtworkManager code. lobbyPlayerList is just a UI element with VerticalLayoutGroup. lobbyCharacter is just UI textElement with a networkBehavior script that sets the text field value and also has newtworkIdentity and networkTransformation.

  public struct PlayerInfo: NetworkMessage
    public string name;

public class LobbyManager : NetworkManager
    public GameObject lobbyCharacter;
    public GameObject lobbyPlayerList;
    // Start is called before the first frame update

    public override void OnStartServer()


    public override void OnClientConnect(NetworkConnection conn)
       // base.OnClientConnect(conn);

        PlayerInfo info = new PlayerInfo
            name = "Test"


    private void CreateLobbyCharacter(NetworkConnection conn, PlayerInfo info)
        GameObject gameobject = Instantiate(lobbyCharacter, lobbyPlayerList.transform);


        NetworkServer.AddPlayerForConnection(conn, gameobject);

views – Debugging Pager when it isn’t showing

I have been looking for tips to debug the Pager when it doesn’t show and I have not really found anything as of yet. We have only 1 view that is not displaying the pager in our view no matter what we do. When we test for $pager it is not present at all in the view.

We have the pager turned on on the view but it does not show. Our query returns the results we expect and if we change the url to have page=1, page=2 the results change, however like I have said the pager does not show.

So if anyone has any advice on how to do debug the pager it would be great as at this point I am totally lost.

propositional calculus – Showing existence of a formula $psi$ with a single variable

Let $B,C$ be propositions such that $p_0$ is their only common variable, and $BvDash C$.
Show that exists a proposition $A$ s.t. $BvDash A$, $vDash A to C$ and $p_0$ is the only variable appearing in $A$.

I tried multiple approaches, like building a satisfying model, and using completeness and soundness to move back and forth from proof statements in HPC to semantics. The only thing I can see that the bolded assumption is useful for, is that for a model $mu$ s.t. $mu (B)=T$, $mu (C)=T$ regardless of $mu (p_0)$. But I can’t see how is this useful in HPC proofs.

Magento 2.3.5 Order Status not showing in admin order view

I have below orders status and are correctly assign to state. However it is not showing in Admin Order view page.

enter image description here

Above order status should show in Admin Order View page as below. Only Open Order status show in dropdown.

enter image description here

dynamic php menu with hidden sub-categories only showing when the category name is clicked

This is for a wordpress store and I want to show the categories names automatically, but with the sub-categories hidden, the code below works perfectly with the hover effect, now I wish to have the click effect instead. The $cats variable is to use the get_terms() function, but for here to work everywhere I had included a few categories, the categories only go so far as the “third generation”.

<?php $cats = array(array('first', 'sub-first', 'sub-sub-first'),
                    array('second', 'sub-second'),
                    array('third', 'sub-third', 'sub-sub-third')); ?>
<ul class="ul1"> <?php
  foreach($cats as $cat):
    if (isset($cat(0))): ?>
      <li class="li1" onclick="test()"><a href="#"><?php echo $cat(0) ?></a> <?php
        if (isset($cat(1))):?>
          <ul class="ul2">
            <li class="li2"><a href="#"><?php echo $cat(1) ?></a> <?php
              if (isset($cat(2))):?>
                <ul class="ul3">
                  <li class="li3"><a href="#"><?php echo $cat(2) ?></a> </li>
                </ul> <?php
              endif; ?>
          </ul> <?php
        endif; ?>
      </li> <?php
  endforeach; ?>

<style media="screen">
    list-style: none;
    text-decoration: none;
    border:1px solid lightgreen;
  .ul2, .ul3{
  .li1:hover .ul2{
  .ul2:hover .ul3{

for the click effect I had remove from the style the last two hover effects and add the javascript function test();

<script type="text/javascript">
    function test(){

What is happening is that I click a category and all sub-categories are showing, What I wanted is the same as the hover effect, that if I click the first category, I have only the sub-categories of that category and so on.

If someone could help me, I have been twisting my mind over this for a few days already!

probability – Showing almost-sure convergence, given condition.

Let $(Omega, F, P)$ be a probability space with $X_1,…:Omegato R$ independent random variables. Take $E(X_i)=0$ for all $iin N$ and
$sum_i E(X_i^2 chi_{{|X_i|le 1}} + |X_i| chi_{{|X_i|>1)})< infty$

show $sum_i X_i$ converges $P$– almost everywhere.

Now I am thinking to use Kolmogorov’s three series theorem. I am struggling to convert the characteristic functions to probabilities – this is a method I havent been able to understand properly in class.

partial order – Showing that $F$ is a monotone function

I am currently studying the textbook Principles of Program Analysis by Flemming Nielson, Hanne R. Nielson, and Chris Hankin. Chapter 1.3 Data Flow Analysis says the following:

The least solution. The above system of equations defines the twelve sets
$$text{RD}_text{entry}(1), dots, text{RD}_{text{exit}}(6)$$
in terms of each other. Writing $overrightarrow{RD}$ for this twelve-tuple of sets we can regard the equation system as defining a function $F$ and demanding that:
$$overrightarrow{RD} = F(overrightarrow{RD})$$
To be more specific we can write
$$F(overrightarrow{RD}) (F_text{entry}(1)(overrightarrow{RD}), F_text{exit}(1)(overrightarrow{RD}), dots, F_text{entry}(6)(overrightarrow{RD}), F_text{exit}(6)(overrightarrow{RD}))$$
where e.g.:
$$F_text{entry}(3)(dots, overrightarrow{RD}_text{exit}(2), dots, overrightarrow{RD}_text{exit}(5), dots) = overrightarrow{RD}_text{exit}(2) cup overrightarrow{RD}_text{exit}(5)$$
It should be clear that $F$ operates over twelve-tuples of sets of pairs of variables and labels; this can be written as
$F : (mathcal{P}(mathbf{text{Var}_star times mathbf{text{Lab}_star}))}^{12} to (mathcal{P}(mathbf{text{Var}_star times mathbf{text{Lab}_star}))}^{12}$
where it might be natural to take $mathbf{text{Var}_star} = mathbf{text{Var}}$ and $mathbf{text{Lab}_star} = mathbf{text{Lab}}$. However, it will simplify the presentation in this chapter to let $mathbf{text{Var}_star}$ be a finite subset of $mathbf{text{Var}}$ that contains the variables occurring in the program $mathbf{S_star}$ of interest and similarly for $mathbf{text{Lab}_star}$. So for the example program we might have $mathbf{text{Var}_star} = { x, y, z }$ and $mathbf{text{Lab}_star} = { 1, dots, 6, ? }$.

It is immediate that $(mathcal{P}(mathbf{text{Var}_star times mathbf{text{Lab}_star}))}^{12}$ can be partially ordered by setting
$$overrightarrow{text{RD}} sqsubseteq overrightarrow{text{RD}}^prime text{iff} forall i : text{RD}_i subseteq text{RD}_i^prime$$
where $overrightarrow{text{RD}} = (text{RD}_1, dots, text{RD}_{12})$ and similarly $overrightarrow{text{RD}}^prime = (text{RD}_1^prime, dots, text{RD}_{12}^prime)$. This turns $(mathcal{P}(mathbf{text{Var}_star times mathbf{text{Lab}_star}))}^{12}$ into a complete lattice (see Appendix A) with least element
$$overrightarrow{emptyset} = (emptyset, dots, emptyset)$$
and binary least upper bounds given by:
$$overrightarrow{text{RD}} sqcup overrightarrow{text{RD}}^prime = (text{RD}_1 cup text{RD}_1^prime, dots, text{RD}_{12} cup text{RD}_{12}^prime)$$

It is easy to show that $F$ is in fact a monotone function (see Appendix A) meaning that:
$$overrightarrow{text{RD}} sqsubseteq overrightarrow{text{RD}}^prime text{implies} F(overrightarrow{text{RD}}) sqsubseteq F(overrightarrow{text{RD}})^prime$$
This involves calculations like
$$text{RD}_text{exit}(2) subseteq text{RD}_text{exit}^prime(2) text{and} text{RD}_text{exit}(5) subseteq text{RD}_text{exit}^prime(5)$$
$$text{RD}_text{exit}(2) cup text{RD}_text{exit}(5) subseteq text{RD}^prime_text{exit}(2) cup text{RD}_text{exit}^prime(5)$$
and the details are left to the reader.

Appendix A gives the following definition for monotone function:

The function $f$ is monotone (or isotone or order-preserving) if
$$forall l, l^prime in L_1 : l sqsubseteq_1 l^prime Rightarrow f(l) sqsubseteq_2 f(l^prime)$$

I am trying to do as the author said, and show that $F$ is a monotone function. However, I have so far been unable to make progress. It seems to me that such a proof should proceed by showing that, for some arbitrary element of the set of elements $F(overrightarrow{text{RD}})$, if we use the fact that $overrightarrow{text{RD}} sqsubseteq overrightarrow{text{RD}}^prime$, then we can deduce that said arbitrary element is also an element of the set $F(overrightarrow{text{RD}})^prime$, and so $F(overrightarrow{text{RD}}) sqsubseteq F(overrightarrow{text{RD}})^prime$. However, it seems to me that the textbook is very poorly written, and so it is difficult for me to even understand what said arbitrary elements of the set $F(overrightarrow{text{RD}})^prime$ even are (they seem to be some kind of cartesian product, but I get very confused when trying to figure out precisely what they are). So how is it shown that $F$ is a monotone function?

The postal address showing on google search results is incorrect

The postal address that Google shows for a business in the search results comes from the listing for that business that Google shows on its maps.

To correct that address, claim your business listing in Google My Business. Here are Google’s instructions for claiming and verifying your business. Their help document for editing your listing has instructions for changing the address:

Enter the complete and exact address for your business location. Read our address entry guidelines for more recommendations.

Note that changing your address in between the postcard request and verification code entry stages of verification will cause the verification process to reset.

You can also report a problem to Google through maps and hope they check it out and fix it soon. I don’t believe that reporting problems is usually very effective compared to claiming the business listing though.