Is there any max. temperature that air on Earth could reach, assuming that solar radiation is standard and the average temperature on Earth is 14.6 like today? I mean, is there any chance that the temperature on Earth would reach in some place 80 C today? And I don't mean surface temperature.
The layman's question. Is there a maximum temperature that can be reached by air on Earth due to global warming? For example, one that would prevent living organisms from functioning? I read somewhere that with the increase of the sun's brightness by 10%, the average temperature on our planet will be 47 C. This, however, only for about 600 million years. Would global warming enable reaching such a high average temperature?
Petersen graph is not a Cayley graph How can I show that the Petersen graph is not a Cayley graph?  I don't know very much about Cayley graphs, I know that they are vertex-transitive, but so is the Petersen graph. It probably has to do with the group structure of $\Gamma$ in $Cay(\Gamma,S)$ (which is a group of order $10$, i.e., it is either the cyclic group $C_{10}$ or the dihedral group $D_{10}$). Then I am guessing we go for some sort of contradiction(?). My group theory is a bit rusty, I would very much appreciate someone showing me how to do this one! Smallest Width for Galaxy S and Galaxy S2 Ubuntu 12.04 on Amilo LA1703 after istalling graphics doesn't start? I want to fill a part of a picture with more or less evenly and randomly distributed circles which should not overlap. It would be okay if circles are only partly inside the shape.  The density should be like what you see on this page  with values 80-100. (But I do not need so many circles, 30 should be enough, I could repeat the pattern).   I cannot use a grid and "wobble" the circles a bit: The circles are too large and it simply does not look randomly.   Currently I am thinking about a random attempt: Get some random point, measure its distance to existing circles, either paint or throw the point away. Try 100 times and hope that you get the right number of circles (and that it does not take too long). But perhaps someone has a better idea.   The example draws the circles simply manually:  \documentclass{article} \usepackage{tikz} \usetikzlibrary{backgrounds} \begin{document}   \begin{tikzpicture}[framed,gridded,radius=0.5cm]  \draw[red](0,0) rectangle (5,5);   \draw (1,1) circle;   \draw (2.3,1.1) circle ;   \draw (4.5,0.8) circle ;   \draw (5.1,1.8) circle ;   \draw (0.4,3.3) circle ;   \draw (2.1,2.8) circle ;   \draw (3.8,3.5) circle ;   \draw (4.8,4.2) circle ;   \draw (0.8,4.9) circle ;   \draw (2.1,4.1) circle ;   \draw (3.8,2.0) circle ;   \draw (3.5,0.6) circle ;   \draw (3.0,5.0) circle ;      \draw (4.1,5.1) circle ;             \draw (0.9,2.1) circle ;  \end{tikzpicture}  \end{document} Tall fraction puzzle I was given this problem 30 years ago by a coworker, posted it 15 years ago to rec.puzzles, and got a solution from Barry Wolk, but have never seen it again.  Consider the series:  $$1, \frac{1}{2},\frac{\displaystyle\frac{1}{2}}{\displaystyle\frac{3}{4}},\frac{\displaystyle\frac{\displaystyle\frac{1}{2}}{\displaystyle\frac{3}{4}}}{\displaystyle\frac{\displaystyle\frac{5}{6}}{\displaystyle\frac{7}{8}}},\cdots$$  Each fraction keeps its large bars while being put atop a similar structure. This can also be represented as $$\frac{1\cdot 4 \cdot 6 \cdot 7 \cdot\cdots}{2 \cdot 3 \cdot 5 \cdot 8 \cdot\cdots}$$ terminating at $2^n$ for some $n$, where it is much closer to the limit than elsewhere.  The challenge:   Find the limit, not too hard by experiment In the last expression, find a simple, nonrecursive, expression to say whether $n$ is in the numerator or denominator Prove the limit is correct-this is the hard one. My group of 8 level 3 players are about to run through the Thundertree Ruins and will probably have a hand at fighting the dragon. My question stems from the fact that a single poison breath attack from the dragon will outright kill all but 1 player assuming they fail their saving throws.  I understand this encounter is supposed to be ridiculously deadly, but I don't want to be punishing my players for testing the lengths at which they can fight stuff. A fight should be challenging and they should be able to try and run away, but instant obliteration seems a bit much.  All PCs are level 3 (HP in parenthesis):   Wood elf moon druid  (27) dwarven frenzy barbarian (44) fire genasi archer ranger (37) (pseudodragon companion (12)) wood elf assassin rogue (27) human wild magic sorcerer (22) dragonborn fighter (29) human monk (24) human fighter (32) Got NODATA issue: 'NODATA' (does the network require authentication?) Find images by size: find / file / awk I've been trying to find png image files a certain height (over 500px).  I know that file will return image dimensions.  Example:    $ file TestImg1a.png  TestImg1a.png: PNG image data, 764 x 200, 4-bit colormap, non-interlaced      But I need to use this to find all files in a directory with a height over 500px.  I know how to print out all files regardless of height:  find . -name '*.png' | xargs file | awk '{print $7 " " $1}'   But how do I limit the $7 to those results greater than 500? I want to make a bootable USB thumb drive to install Windows on my computer. I don't want to use my old DVD to create an image and then upgrade to SP1, so I decided to download an untouched .iso file that already has SP1 in it. My question is this, is there a difference between these two files files?     en_windows_7_home_premium_with_sp1_x64_dvd_620851.iso   vs     en_windows_7_home_premium_with_sp1_x64_dvd_u_676549.iso   What does dvd_u mean, is it somehow different from plain dvd? Also will these work with my retail Home Premium key or do these work only for thoe with TechNet/MSDN accounts? How to develop a SharePoint Designer Workflow Action for use in SharePoint (2013) online The rank of Jacobian matrix at a point of affine variety is independent of choice of generators UFW Allows 22 for IPv4 and IPv6 but SSH Disconnects When Enabling sudo ufw disable followed by sudo ufw enable kicks me out of SSH  DMESG reports  [UFW BLOCK] IN=eth0 OUT= MAC=30:........ SRC=192.168.1.me DST=192.168.1.server LEN=52 TOS=0x00 PREC=0x00 TTL=128 ID=15776 DF PROTO=TCP SPT=55640 DPT=22 WINDOW=253 RES=0x00 ACK URGP=0  I can log back in without having to change rules via the console (UFW still enabled).  This started after upgrading Xenial (16.04) from kernel 4.4 to 4.15 (HWE). Upgrading to 18.04.1 did not solve the issue.  Versions:   iptables v1.6.1 ufw 0.35 4.15.0-29-generic #31-Ubuntu Ubuntu 18.04.1 LTS   UFW status verbose is (some rules were omitted, but they are all ALLOW)  Logging: on (low) Default: deny (incoming), allow (outgoing), disabled (routed) New profiles: skip  To                         Action      From --                         ------      ---- 22                         ALLOW IN    Anywhere 22 (v6)                    ALLOW IN    Anywhere (v6)   Why is this happening, or at least, how to revert to the expected behavior?  I looked at , and I am not sure it applies, but here's /etc/ufw/before.rules  # # rules.before # # Rules that should be run before the ufw command line added rules. Custom # rules should be added to one of these chains: #   ufw-before-input #   ufw-before-output #   ufw-before-forward #  # Don't delete these required lines, otherwise there will be errors *filter :ufw-before-input - [0:0] :ufw-before-output - [0:0] :ufw-before-forward - [0:0] :ufw-not-local - [0:0] # End required lines   # allow all on loopback -A ufw-before-input -i lo -j ACCEPT -A ufw-before-output -o lo -j ACCEPT  # quickly process packets for which we already have a connection -A ufw-before-input -m conntrack --ctstate RELATED,ESTABLISHED -j ACCEPT -A ufw-before-output -m conntrack --ctstate RELATED,ESTABLISHED -j ACCEPT -A ufw-before-forward -m conntrack --ctstate RELATED,ESTABLISHED -j ACCEPT  # drop INVALID packets (logs these in loglevel medium and higher) -A ufw-before-input -m conntrack --ctstate INVALID -j ufw-logging-deny -A ufw-before-input -m conntrack --ctstate INVALID -j DROP  # ok icmp codes for INPUT -A ufw-before-input -p icmp --icmp-type destination-unreachable -j ACCEPT -A ufw-before-input -p icmp --icmp-type source-quench -j ACCEPT -A ufw-before-input -p icmp --icmp-type time-exceeded -j ACCEPT -A ufw-before-input -p icmp --icmp-type parameter-problem -j ACCEPT -A ufw-before-input -p icmp --icmp-type echo-request -j ACCEPT  # ok icmp code for FORWARD -A ufw-before-forward -p icmp --icmp-type destination-unreachable -j ACCEPT -A ufw-before-forward -p icmp --icmp-type source-quench -j ACCEPT -A ufw-before-forward -p icmp --icmp-type time-exceeded -j ACCEPT -A ufw-before-forward -p icmp --icmp-type parameter-problem -j ACCEPT -A ufw-before-forward -p icmp --icmp-type echo-request -j ACCEPT  # allow dhcp client to work -A ufw-before-input -p udp --sport 67 --dport 68 -j ACCEPT  # # ufw-not-local # -A ufw-before-input -j ufw-not-local  # if LOCAL, RETURN -A ufw-not-local -m addrtype --dst-type LOCAL -j RETURN  # if MULTICAST, RETURN -A ufw-not-local -m addrtype --dst-type MULTICAST -j RETURN  # if BROADCAST, RETURN -A ufw-not-local -m addrtype --dst-type BROADCAST -j RETURN  # all other non-local packets are dropped -A ufw-not-local -m limit --limit 3/min --limit-burst 10 -j ufw-logging-deny -A ufw-not-local -j DROP  # allow MULTICAST mDNS for service discovery (be sure the MULTICAST line above # is uncommented) -A ufw-before-input -p udp -d 224.0.0.251 --dport 5353 -j ACCEPT  # allow MULTICAST UPnP for service discovery (be sure the MULTICAST line above # is uncommented) -A ufw-before-input -p udp -d 239.255.255.250 --dport 1900 -j ACCEPT  # don't delete the 'COMMIT' line or these rules won't be processed COMMIT   PS: I didn't expect this to "fix" the issue but just for reference I changed the port SSHD listens on (and the corresponding rule) and the problem persists. Forge CBC-MAC by creating a new message, given the MAC of two messages Share wireless Internet connection through ethernet Reputation does not update after community wiki is removed from a post, and does not match the value displayed in the reputation audit Does light pollution affect sleep quality while already asleep? Many articles on the internet write about melatonin and its effects, making you tired. A lot of articles also point out how the use of devices before going to bed in modern days likely decrease melatonin production. Therefore, making it harder to fall asleep. But this information is only about the process of getting to sleep, before we are actually sleeping.  A recent Harvard Medical article 1 states:     High exposure to bright, artificial outdoor lights during the night may result in sleepless nights for older adults.   Referring to a publication on Nov. 15, 2018, in the Journal of Clinical Sleep Medicine.  Considering that:    many people nowadays, use their mobile devices in bed prior to going to sleep; modern cities or houses have (street) lights that are always enabled at night; ignoring the phase of falling sleep; focusing only on the time we are asleep already, so during the actual sleep cycles.   Does a darker room with less or no (artificial) light pollution improve sleep quality, with all associated health benefits as a result? In other words: Does light pollution, while asleep decrease the sleep quality or does light pollution only negatively affect the phase of “falling asleep”?  I wasn't able to find any studies or information regarding sleep quality in relation to light pollution during sleep. Were such studies performed? Are there specific moments when light pollution affects sleep quality the most, for example during REM-sleep or in a specific sleeping phase?    1 Sometimes we may ask questions on stack exchange or online forums wherein the response is helpful or even essential to a piece of work that gets published in an academic journal. If this occurs, how should credit be given to those involved in the exchange? Should they all be included as authors? Should a link to the forum be included as a reference in the paper?  Once something is in a stack exchange or forum, it's "published". Perhaps in the future, the current peer review model will transform into people writing blogs and posting in forums and databases. But for now, how might this issue be dealt with while forums, blogs, etc coexist with journals? "I am going to have a walk" My teacher said "I am going to have a walk" today in class and to me it seems incorrect. Correct variants that I know are:    Going for a walk Going to take a walk Going to walk  ...   Is this correct? If so, why? Sequences or 'chains' of adjoint functors Suppose we have (some categories and some functors such that) $F_1$ is left adjoint to $G_1$, $G_1$ left adjoint to $F_2$, $F_2$ left adjoint to $G_2$. Will $F_1$ then be equal to $F_2$ (and $G_1$ to $G_2$)?  Or can there exist arbitrarily long 'chains' of adjoint functors that do not trivialize? How to select a clustering method? How to validate a cluster solution (to warrant the method choice)? One of the biggest issue with cluster analysis is that we may happen to have to derive different conclusion when base on different clustering methods used  (including different linkage methods in hierarchical clustering).  I would like to know your opinion on this - which method will you select, and how. One might say "the best method of clustering is which gives you the right answer"; but I may question in response that cluster analysis is supposed to be an unsupervised technique - so how do I know which method or linkage is the right answer?  In general: is a clustering alone robust enough to rely on? Or we need a second method and get a shared result to be based on both?  My question is not only about possible ways to validate / evaluate clustering performance, but is broader - on what basis do we select/prefer one clustering method/algorithm over another one. Also, is there common warnings that we should look around when we are selecting a method to cluster our data?  I know that it is very general question and very difficult to answer. I only would like to know if you have any comment or any advise or any suggestion for me to learn more about this.