And what will define in which animal a wizard will be transformed? is it due to his apparence or moral quality?
Similar to my old question about  are there any limits to the animal forms an Animagus can be?     We know that the animal form can be much smaller than human (cat, rat, beetle) so I don't think size is a factor.   I'm not aware of any Animagus who transforms into a magical creature (e.g. unicorn or phoenix) so maybe those aren't possible.   Ultimately, what I'd like to know is whether there could be a T-Rex Animagus... (prompted by )
Is there an SE for Cell-phones? Where would I ask a question pertaining to an ordinary phone? Or just cell phones in general? I saw Windows Phone while browsing the SE database, nothing else really popped out at me. Google didn't bring up anything either. Is that just too small a community to cover with SE? Compact topological space with closed graph implies continuity Let $X,Y$ be topological spaces and $f:X \rightarrow Y$  If $Y$ is compact and $G(f)$ (graph of $f$) is closed, show that $f$ is continuous.   I consider an open set in $X$, and as $G(f)$ is closed, $(X \times Y)-G(f)$ is open. And I guess I need to do something here. Then I can get some open sets. Also, I notice that compact is something relate to "finite". I guess I can use the compactness to do finite intersection or union and get the result finally.  But what should I do in the middle or I am not even on a right track. How to handle WndProc messages in WPF? In Windows Forms, I'd just override WndProc, and start handling messages as they came in.  Can someone show me an example of how to achieve the same thing in WPF? If shuffle-playing playlist &times;100 resulted in [10 13 10  3  2  2] different songs being repeated [1 2 3 4 5 6] times, what is the estimate for the total number of songs? (assuming shuffle play was completely random)  Update: (R code)  k &lt;- 50 # k number of songs on the disk indexed 1:k n &lt;- 100 # n number of random song selections m &lt;- 20 # m number of repeat experiments colnum &lt;- 10 mat &lt;- matrix(data=NA,nrow=m,ncol=colnum) df &lt;- as.data.frame(mat) for(i in 1:m){   played &lt;- 1+floor(k*runif(n)) # actual song indices (1:k) selected    freq &lt;- sapply(1:k,function(x){sum(played==x)})   # = number of times song with index x is being played   histo &lt;- sapply(1:colnum,function(x){sum(freq==x)});   for(j in 1:colnum){    df[i,j] &lt;- histo[j]   } } df   Resulting in: e.g. 20 distributions (V1=number of single plays, V2=number of double plays, etc):     V1 V2 V3 V4 V5 V6 V7 V8 V9 V10 1  15 13 11  1  2  2  0  0  0   0 2  15 12 10  1  4  0  1  0  0   0 3  12 14  7  6  3  0  0  0  0   0 4  17 16  6  4  2  0  1  0  0   0 5  17 10 12  5  0  0  1  0  0   0 6  13 15 11  6  0  0  0  0  0   0 7  10 14  9  3  2  1  1  0  0   0 8  12 17  5  6  3  0  0  0  0   0 9   9 19  8  3  1  2  0  0  0   0 10 13  9 11  6  1  0  1  0  0   0 11 16  9 12  5  2  0  0  0  0   0 12 15  9 11  6  2  0  0  0  0   0 13 19  9  7  4  4  1  0  0  0   0 14 17 11  4  7  3  1  0  0  0   0 15 11 20  8  1  3  1  0  0  0   0 16 14 12 10  5  0  2  0  0  0   0 17  9 12  8  7  3  0  0  0  0   0 18 10 15  9  4  2  0  1  0  0   0 19 14 11 12  7  0  0  0  0  0   0 20 16 14 11  3  1  1  0  0  0   0   Now I need to get from here to the Poisson modelling--my R is a bit rusty (?lmer)...--Any help would be appreciated...  Attempted Poisson modelling: disappointing fit?!  plot(1:colnum,df[1,1:colnum],ylim=c(0,30),    type="l",xlab="repeats",ylab="count") for(i in 1:m){   clr &lt;- rainbow(m)[i]   lines(1:colnum,df[i,1:colnum],type="l",col=clr)   points(1:colnum,df[i,1:colnum],col=clr) }  df.lambda=data.frame(lambda=seq(1,5,0.1),ssq=c(NA));df.lambda for(ii in 1:dim(df.lambda)[1]){   l &lt;- df.lambda$lambda[ii]       ssq &lt;- 0       for(i in 1:20){         for(j in 1:10){           ssq &lt;- ssq + (df[i,j] - n*dpois(j,l))^2         }       }       print(ssq)       df.lambda$lambda[ii] &lt;- l   df.lambda$ssq[ii] &lt;- ssq     }     df.lambda     lambda.est &lt;- df.lambda$lambda[which.min(df.lambda$ssq)] lambda.est # 2.4 points(x &lt;- 1:10, n*dpois(1:10,lambda.est),type="l",lwd=2)  100*dpois(1:10,3) n/lambda.est   the estimated lambda stays around 2.3, with an n estimate of around 43; the fitted curve seems very discrepant, and seems to worsen with rising n !?  Doesn't this have to do with the fact, that our repeats are different from the 'classical' Poisson distributions: it's not just ONE event that repeats itself x number of times, but the sum of repeats of different items (songs)?! Childrens fantasy, blind monk leading boy who can control the elements Prove that $\int_0^\infty \frac{x\,\log x}{(1+x^2)^2} = 0$ I have been asked to prove that $$\int_0^\infty \frac{x\,\log x}{(1+x^2)^2}\,dx = 0$$  I tried proceeding as follows: \begin{align} \int_0^\infty \frac{x\,\log x}{(1+x^2)^2}\,dx &amp;= \int_0^1 \frac{x\,\log x}{(1+x^2)^2}\,dx + \int_1^\infty \frac{x\,\log x}{(1+x^2)^2}\,dx \\ &amp; = \int_0^1 \frac{x\,\log x}{(1+x^2)^2}\,dx + \int_{u=1}^0 \frac{u\,\log u}{(1+u^2)^2}\,du\quad (\text{where }u=1/x) \\ &amp;= \int_0^1 \frac{x\,\log x}{(1+x^2)^2}\,dx - \int_0^1 \frac{u\,\log u}{(1+u^2)^2}\,du \\ &amp;=^? \int_0^1 0 \,dx \\ &amp;= 0 \end{align}  But I think that I should first show that the improper integral $\int_0^1 {x\,\log x}/{(1+x^2)^2}\,dx$ is convergent.  Do I need to show it? If yes, how to do so?  (I have been taught basic methods such as comparison, limit comparison and Dirichlet test.) I have a PC who wants to jump onto an enemy in a combat situation. The player wants him to land on the (humanoid) enemy, sword drawn, and use the enemy to break his fall while plunging shortswords into it. I thought of using a straight attack roll, because it was only a 12 foot drop from the ledge to the top of the enemy. But I would imagine a lot would depend on the distance, and also whether the enemy might suspect such an attack. Also, I would expect the PC would take damage on a miss, but how about on success? What Nikon lens to buy to make photos of birds? event.preventDefault() vs. return false Intel Corporation Device [8086:0d4f] is not supported on Ubuntu 18.04.3 I am currently unable to install ubuntu server 18.04.03 LTS on the latest intel NUC10i7FNH.  Ubuntu always states both network adapters as unclaimed. The previous version (NUC8i7BEH) has the same network controller I219-V and worked like a charm.  *-network:0 UNCLAIMED      description:  Network controller      product: Intel Corporation      vendor: Intel Corporation      physical id: 14.3      ...   Without network it is not even possible to follow most suggestions how to get it enabled, because it is impossible to fetch new packages from internet.  Here are some more information as requested:  The output from: modprobe -v e1000e &amp;&amp; dmesg | grep e10   [ 3447.889394] e1000e: Intel(R) PRO/1000 Network Driver - 3.2.6-k [ 3447.889395] e1000e: Copyright(c) 1999 - 2015 Intel Corporation.   The output from: sudo lspci -knn  00:1f.6 Ethernet controller [0200]: Intel Corporation Device [8086:0d4f]     Subsystem: Intel Corporation Device [8086:2081] 01:00.0 PCI bridge [0604]: Intel Corporation JHL7540 Thunderbolt 3 Bridge [Titan Ridge 2C 2018] [8086:15e7] (rev 06)    For me this looks somehow, as the kernal driver would not be in use :-/  Here are a few more information i got from playiung around with 19.10 desktop version.  [    0.000000] Linux version 5.3.0-29-generic (buildd@lcy01-amd64-024) (gcc version 9.2.1 20191008 (Ubuntu 9.2.1-9ubuntu2)) #31-Ubuntu SMP Fri Jan 17 17:27:26 UTC 2020 (Ubuntu 5.3.0-29.31-generic 5.3.13)   output from lshw:    *-network:0        Beschreibung: Kabellose Verbindung        Produkt: Intel Corporation        Hersteller: Intel Corporation        Physische ID: 14.3        Bus-Informationen: pci@0000:00:14.3        Logischer Name: wlp0s20f3        Version: 00        Seriennummer: c8:09:a8:9c:cd:e0        Breite: 64 bits        Takt: 33MHz        Fähigkeiten: pm msi pciexpress msix bus_master cap_list ethernet physical wireless        Konfiguration: broadcast=yes driver=iwlwifi driverversion=5.3.0-29-generic firmware=48.4fa0041f.0 ip=192.168.178.109 latency=0 link=yes multicast=yes wireless=IEEE 802.11        Ressourcen: iomemory:600-5ff irq:16 memory:6023114000-6023117fff   The output from: modprobe -v e1000e &amp;&amp; dmesg | grep e10  [    2.357430] e1000e: Intel(R) PRO/1000 Network Driver - 3.2.6-k [    2.357430] e1000e: Copyright(c) 1999 - 2015 Intel Corporation. [    2.357616] e1000e 0000:00:1f.6: Interrupt Throttling Rate (ints/sec) set to dynamic conservative mode [    2.562796] e1000e 0000:00:1f.6 0000:00:1f.6 (uninitialized): registered PHC clock [    2.634139] e1000e 0000:00:1f.6 eth0: (PCI Express:2.5GT/s:Width x1) 1c:69:7a:60:44:f0 [    2.634140] e1000e 0000:00:1f.6 eth0: Intel(R) PRO/1000 Network Connection [    2.634258] e1000e 0000:00:1f.6 eth0: MAC: 13, PHY: 12, PBA No: FFFFFF-0FF [    2.634991] e1000e 0000:00:1f.6 eno1: renamed from eth0 [    5.103285] checking generic (4000000000 e10000) vs hw (4000000000 10000000) [   15.806697] e1000e: eno1 NIC Link is Up 1000 Mbps Full Duplex, Flow Control: None    output from lspci:  00:1f.6 Ethernet controller [0200]: Intel Corporation Ethernet Connection (10) I219-V [8086:0d4f]     DeviceName:  LAN     Subsystem: Intel Corporation Ethernet Connection (10) I219-V [8086:2081]     Kernel driver in use: e1000e     Kernel modules: e1000e I have a Python module installed on my system and I'd like to be able to see what functions/classes/methods are available in it. I want to call the help function on each one. In Ruby I can do something like ClassName.methods to get a list of all the methods available on that class. Is there something similar in Python? eg. something like: from somemodule import foo print(foo.methods)  # or whatever is the correct method to call What are the fault tolerances on the FDA food handling guidelines? Sometimes I have suggested that food that sat out a little longer than optimal may be safe to eat.    Granted, this is based on my experience, and I always qualify that it shouldn't be served to guests (and by extension, customers) and that one should determine their own tolerance to risk, but I want to know if there is information as to the methodology of the FDA guidelines.  Specifically, what is the contamination rate at n hours, and what are the initial conditions of the food and environment?  How much risk is there REALLY (in incidences per n-population and such) in a standard kitchen for food that has sat out 50%, 100%, 200%, etc. longer than recommended? How do I prevent and/or handle a StackOverflowException? I would like to either prevent or handle a StackOverflowException that I am getting from a call to the XslCompiledTransform.Transform method within an Xsl Editor I am writing. The problem seems to be that the user can write an Xsl script that is infinitely recursive, and it just blows up on the call to the Transform method.  (That is, the problem is not just the typical programmatic error, which is usually the cause of such an exception.)  Is there a way to detect and/or limit how many recursions are allowed?  Or any other ideas to keep this code from just blowing up on me? I am preparing a book for publication which contains the following passage:     Stromberg in Religious Liberalism in Eighteenth-Century England   (1954) noted that 'the critical moment in the emergence of a positive   spirit of reform...consisted in the awareness of evil as being social   and remediable. It begins about 1750.'   My proof reader (my wife) has picked this out suggesting it should be the past tense. However if I say It began about 1750 it seems to convey too much certainty about the exact date. I just want to convey an impression of it being something which emerges in the mid-eighteenth century. I believe use of the present tense is the way to go.   But what is this artifice called, this use of the present to convey mild uncertainty? Why is the gravitational force always attractive? Preserving order with LINQ I use LINQ to Objects instructions on an ordered array.  Which operations shouldn't I do to be sure the order of the array is not changed? How do I resume a release upgrade? Yesterday I started the upgrade from 12.10 to 13.04, but I interrupted it because it was taking too long. Now if I restart it, it doesn't proceed.  Is there any possibility to clean the mess it left when I interrupted it and make a clean restart of this update? Find all functions $f$ such that $(x+y)f(x)+f(y^2)=(x+y)f(y)+f(x^2)$ Find all functions $f$ that assign a real number $f(x)$ to every real number $x$ such that $$(x+y)f(x)+f(y^2)=(x+y)f(y)+f(x^2)$$  I've tried subbing in heaps of values but I keep getting things like $f(0)=f(0)$ and other such useless results.  Any help would be hugely appreciated. Assuming one wants to travel through China, what are the rules for visa-free access? To be more specific:   How does the 24-hour visa free transit work? How does the 72-hour version work? What does a person ineligible for either of these programs have to do to transit China? Do the programs apply to flights only or do they also work for transit on land? Would a visitor save much hassle by using visa free transit instead of just getting a visa?      NB: this is intended as a canonical question on transiting China Let $p\in[1,\infty]$, $a\in\ell^\infty$ and $$T:\ell^p\to\ell^p\;,\;\;\;x\mapsto ax.$$ Note that $\left\|T\right\|=\left\|a\right\|_{\ell^\infty}$. It's easy to see that if $a\in\ell^1$, then $T$ is nuclear and hence compact.  Can we more generally conclude that $T$ is compact?  Assume $p&lt;\infty$. The intuitive approach would be to define $$T_n:\ell^p\to\ell^p\;,\;\;\;x\mapsto(a_1x_1,\ldots,a_nx_n,0,\ldots)$$ for $n\in\mathbb N$ and to show that $\left\|T_n-T\right\|\to0$. Now, $$\left\|(T_n-T)x\right\|^p=\sum_{i=n+1}^\infty|a_ix_i|^p\tag1$$ for all $x\in\ell^p$ and $n\in\mathbb N$. The right-hand side of $(1)$ clearly converges to $0$ as $n\to\infty$, but this only yields convergence in the strong operator topology. On the other hand, if $(a_n)_{n\in\mathbb N}$ would be nonincreasing and $a_n\to0$ (e.g. $a_n=\frac1n$), then $$\left\|(T_n-T)x\right\|^p\le|a_{n+1}|^p\left\|x\right\|_{\ell^p}^p\tag2$$ for all $x\in\ell^p$ and $n\in\mathbb N$ and we could immediately conclude $\left\|T_n-T\right\|\to0$. EDIT: Maybe the general result can be obtained from the convergence in strong operator topology (which holds by $(1)$) by noting that $\ell^p$ has the approximation property; but I'm not sure whether this is true.