I have this code - which works perfectly when pages aren't lazy loaded with AJAX.  As soon as AJAX gets involved it doesn't work at all until the page is refreshed.  omShortcodes.modules.toggle = { init: function() {      jQuery('.omsc-accordion .omsc-toggle').addClass('omsc-in-accordion').find('.omsc-toggle-title').click(function(){          var $toggle=jQuery(this).parent();          if($toggle.hasClass('omsc-expanded')) {             $toggle.removeClass('omsc-expanded');             $toggle.find('.omsc-toggle-inner').slideUp(300);             return false;         }          var $acc=$toggle.parents('.omsc-accordion');         if(!$acc.hasClass('omsc-multiopen'))             $acc.find('.omsc-toggle.omsc-expanded').removeClass('omsc-expanded').find('.omsc-toggle-inner').slideUp(300);          $toggle.find('.omsc-toggle-inner').slideDown(300,function(){             var h=jQuery(this).parent().height();             var pos=jQuery(this).parent().find('.omsc-toggle-title').offset();             var scroll=jQuery(window).scrollTop();             var wh=jQuery(window).height();             if(pos.top < scroll || (pos.top > scroll && pos.top+h > scroll+wh))                 jQuery('html,body').animate({ scrollTop: pos.top+'px' }, 200);         }).find('iframe[src*="maps.google"]').each(function(){             jQuery(this).attr('src',jQuery(this).attr('src'));         });         $toggle.addClass('omsc-expanded');      });      jQuery('.omsc-toggle').not('.in-accordion').find('.omsc-toggle-title').click(function(){          var $toggle=jQuery(this).parent();          var $inner=$toggle.find('.omsc-toggle-inner');         if(!$inner.length)             return false;         if($inner.is(':animated'))             return false;          $toggle.toggleClass('omsc-expanded');         $inner.slideToggle(300);         if($toggle.hasClass('omsc-expanded')) {             $inner.find('iframe[src*="maps.google"]').each(function(){                 jQuery(this).attr('src',jQuery(this).attr('src'));             });         }          return false;     });  } }   Is there another way of handling this to be able to work properly with AJAX?


I have a situation that requires the displaying of the results by precinct of an election between two of the candidates. For each precinct I would like to have two colors filling the polygon proportional to the total vote count. Also displaying the numeric count in text. Does anybody know a strategy that will achieve this result?


StackOverflow + [Certain] Images + Chrome = Malware Alert

Users  with freeimagehosting.net are getting SO flagged.  Not sure where else to post this, but I thought I'd let the meta-mongers know. I obviously know it's not an issue personally but it could potentially freak people out.


Write 'According to Wikipedia' in a PhD thesis

I am writing a PhD thesis in robotics and I was wondering if it sounds good to start a phrase with: 'According to Wikipedia ...'  Do you think I can do that or not?


What is the closed form for $\sum_{n=1}^\infty \frac1n - \frac1{n+1/p}$?

A while ago, I started to look at expressions of the following form: $$ S_p:=\sum_{n=1}^\infty \frac1n - \frac1{n+1/p}, $$  where $p$ is prime, because otherwise things get too complicated for me at the moment.  What I found so far is the following: $$ S_p= p -\log(2p) - \frac12 \pi \cot\left(\frac\pi p\right) + T_p, $$ where $T_p$ contains $\frac{p-1}2$ terms $t_{p,k}$ of the form:  \begin{cases} \pm 2 \sin\left(\frac{k\pi}{2p}\right) \log\left(\sin\left(\frac{k\pi}{2p}\right)\right) \\ \pm 2 \cos\left(\frac{k\pi}{2p}\right) \log\left(\sin\left(\frac{k\pi}{2p}\right)\right)\\ \pm 2 \sin\left(\frac{k\pi}{2p}\right) \log\left(\cos\left(\frac{k\pi}{2p}\right)\right)  \\ \pm 2 \cos\left(\frac{k\pi}{2p}\right) \log\left(\cos\left(\frac{k\pi}{2p}\right)\right)  \end{cases}   An example can be found .     How does the closed form for $\sum_{n=1}^\infty \frac1n - \frac1{a+n}$ look like? (EDIT: where $a=1/p$)


$ which xar /usr/bin/xar   It's in /usr/bin. Does that mean it's preinstalled on mac?


I have had a virus for a while now and it has got to a point were I can't get past the welcome screen when I start up my computer, I know my computer has not got slower from use because before the virus it took my computer 2 seconds to get to the desktop... Someone please help I can't use my computer at all!!!!


Confusion over the standard units used in special relativity and particle physics?

I am new to relativity and particle physics and I am struggling to understand the conventions for the dimensions that are used in particle physics. I have read  and as I understand it: $$\sqrt{s}=\text{Total energy of collision bewteen two particles in the Centre of Mass frame}=E_{\mathrm{cm}}$$  Now suppose I need to calculate the energy requried to make a $Z$ particle of mass $91\mathrm{GeV/c{^2}}$ in the COM frame (by colliding positrons and electrons both with mass $0.511\mathrm{MeV/c{^2}}$; but this detail is not needed for this question). I'm pretty sure that I use the relation at the top of this post; $$E_{\mathrm{cm}}=\sqrt{s}=91\mathrm{GeV}\tag{1}$$  But there is one serious problem with equation $(1)$ I just wrote above: The mass of the $Z$ particle has units of $\mathrm{GeV/c{^2}}$. But I know that $E_{\mathrm{cm}}=\sqrt{s}$ must have units of energy ($\mathrm{GeV}$) so from where I'm sitting the only way to make this dimensionally correct is to write $$E_{\mathrm{cm}}=\sqrt{s}=91\frac{\mathrm{GeV}}{\mathrm{c^2}}\times \mathrm{c^2}$$ But I can't just multipy by $c^2$ just because I 'feel like it' (to give it units of energy). Unless there is something else going on that I am missing could someone please explain to a lost and confused person why multiplying by $c^2$ is justified here?   Is there perhaps some formula that eludes me here?  By the way, I read  but unfortunately it still doesn't answer my question here.


How do I fix a "Unknown configuration key `foreign-architecture' found in your `dpkg' configuration files." error?

Always when I install something, I get the following error multiple times:     Unknown configuration key 'foreign-architecture' found in your 'dpkg'   configuration files.  This warning will become a hard error at a later   date, so please remove the offending configuration options and replace   them with 'dpkg --add-architecture' invocations at the command line.   When I try dpkg --add-architecture I get:  Unknown configuration key `foreign-architecture' found in your `dpkg' configuration files.  This warning will become a hard error at a later date, so please remove the offending configuration options and replace them with `dpkg --add-architecture' invocations at the command line.  dpkg: error: --add-architecture takes one argument  Type dpkg --help for help about installing and deinstalling packages [*]; Use `dselect' or `aptitude' for user-friendly package management; Type dpkg -Dhelp for a list of dpkg debug flag values; Type dpkg --force-help for a list of forcing options; Type dpkg-deb --help for help about manipulating *.deb files;  Options marked [*] produce a lot of output - pipe it through `less' or `more' !   I've no problems yet, but since it says This warning will become a hard error at a later date I better do something about this. When I search 'foreign-architecture', I find an empty file, containing not a single byte. I somehow can't delete that file.  Please help, it's a kind of creapy...  I use Ubuntu version 12.10  Updated the questions:  cat /etc/dpkg/dpkg.cfg  no-debsig  log /var/log/dpkg.log  ls /etc/dpkg/dpkg.cfg.d/ multiarch


When I type \alpha my list get crazy...What I am doing wrong?  \documentclass[a4paper,12pt]{article} \pagestyle{empty} \usepackage{color} \usepackage{ifxetex} \ifxetex\usepackage{fontspec}\setmainfont[Ligatures=TeX]{CMU Serif}   \def\Hello{Welcome! \fontspec{WenQuanYi Micro Hei} 你好!} \else\usepackage[utf8]{inputenc}\usepackage[T2A]{fontenc}   \def\Hello{Welcome!} \fi  \begin{document}  \begin{enumerate} \item{bla bla bla (\alpha , Q) bla bla blabla bla bla}; \item bla bla bla (\alfa, Q); \item bla bla blabla bla blabla bla blabla bla bla \end{enumerate} \end{document}   Thanks.


Urlib BeautifulSoup python 3.3 page specific error

from urllib.request import urlopen  from bs4 import BeautifulSoup content = urlopen("http://en.wikipedia.org/wiki/List_of_human_stampedes") soup = BeautifulSoup(content) print(soup.get_text()) print(soup.prettify())   error:  Traceback (most recent call last):   File "C:\Users\sony\Desktop\Trash\Crawler Try\try3.py", line 5, in <module>     print(soup.get_text())   File "C:\Python34\lib\encodings\cp1252.py", line 19, in encode     return codecs.charmap_encode(input,self.errors,encoding_table)[0] UnicodeEncodeError: 'charmap' codec can't encode character '\u014d' in position 10487: character maps to <undefined> [Finished in 2.1s with exit code 1]   Seems to be page specific for eg. I get this in case replacing url by


Had 5,000 shares for .75 Now I have 500 shares at 7.50 What happened

Wondering what happened to my shares I thought if the price went up you get that price for every share. I had 5,000 shares for .75 now they say I have 500 shares at 7.50


Dual boot with ubuntu and windows problem

I have ASUS Vivobook x512 laptop which has 256 GB SSD and 1 TB HDD. I want to dual boot my laptop with Windows and Ubuntu. Windows comes pre-installed on SSD. Now I want to to install Ubuntu. Should I install Ubuntu in SSD  or I should install on HDD? Would there be any booting problem if I install Ubuntu on HDD? How do I dual boot on my laptop? If I connect a bootable USB drive to my laptop for installing only the 256 GB SSD is shown not SSD (the 1 TB HDD???).


Does a moving star have a larger gravitational pull?

A moving star's relativistic mass is larger than its rest mass. Is its gravitational pull larger?   What about its inertial mass? Does it have larger inertial mass, keeping in mind that inertial mass should equal gravitational mass according to the equivalence principle.  I suppose this quote from wikipedia is relavant:     However, it turns out that it is impossible to find an objective   general definition for the concept of invariant mass in general   relativity. At the core of the problem is the non-linearity of the   Einstein field equations, which makes it impossible to write the   gravitational field energy as part of the Stress–energy tensor in a   way that is invariant for all observers. For a given observer, this   can be achieved by the Stress–energy–momentum pseudotensor.[21]


Matrix raised to a matrix: $M^N$, is this possible? with $M,N\in M_n(\Bbb K).$

I was wondering if there is such a valid operation as raising a matrix to the power of a matrix, e.g. vaguely, if $M$ is a matrix, is $$ M^N $$ valid, or is there at least something similar?  Would it be the components of the matrix raised to each component of the matrix it's raised to, resulting in again, another matrix?  Thanks,


What is the specific name of this UI component?

Is there a specific name for this kind of ui component? Sometimes it only renders a symbol (without text) so using name like TextComponent is imo not very fitting.


Should I have to pay for Garage Band if I bought my iMac with OS X 10.8?

I've recently started a project that's going to entail using GarageBand. I'd heard it was free, and I searched it in Spotlight. Just to clarify, I am currently running El Capitan. Lo and behold, it did not appear in Spotlight, despite having a reference to the GarageBand app in the App Store. I clicked the App Store link, and it took me to the GarageBand app page where I observed, my confusion growing by the minute, that its price was actually $4.99. I googled it and arrived at an apple site saying that GarageBand is free to all users that have used 10.10. I bought my iMac with OS X Mountain Lion and since then have updated to El Capitan. While I haven't downloaded GarageBand ever I'm pretty sure, I should still have access, no? Every other iApp is there: iPhoto, iMovie, Keynote, Pages and Numbers, so why not GarageBand? I've still got the installation apps for Mavericks and Yosemite, and I had a friend recommend I partition my drive and install Mavericks and bring GarageBand over, but I've got no clue how to do that and I've had bad experiences with downgrading OS, so I'd definitely need guidance if that's the way to go.


Not able to do sudo apt-get update with errors from gnome3-team/gnome3/ubuntu focal Release

Hit:1 https://repo.steampowered.com/steam stable InRelease                                                                                Ign:2 http://ppa.launchpad.net/gnome3-team/gnome3/ubuntu focal InRelease                                                                                Hit:3 https://repo.steampowered.com/steam beta InRelease                                                                                Hit:4 http://security.ubuntu.com/ubuntu focal-security InRelease                                                                                Hit:5 http://dl.google.com/linux/chrome/deb stable InRelease                                                                                Ign:6 https://repo.mongodb.org/apt/ubuntu focal/mongodb-org/4.4 InRelease                                                                                Ign:7 http://ppa.launchpad.net/gnome3-team/gnome3-staging/ubuntu focal InRelease                                                                                Ign:8 http://ppa.launchpad.net/jfi/ppa/ubuntu focal InRelease                                                                                Hit:9 https://download.sublimetext.com apt/stable/ InRelease                                                                                Hit:10 https://repo.mongodb.org/apt/ubuntu focal/mongodb-org/4.4 Release                                                              Hit:13 http://ppa.launchpad.net/kritalime/ppa/ubuntu focal InRelease                                                                  Hit:14 http://ppa.launchpad.net/ubuntu-toolchain-r/test/ubuntu focal InRelease                                  Err:15 http://ppa.launchpad.net/gnome3-team/gnome3/ubuntu focal Release                                           404  Not Found [IP: 91.189.95.85 80] Err:16 http://ppa.launchpad.net/gnome3-team/gnome3-staging/ubuntu focal Release                                   404  Not Found [IP: 91.189.95.85 80] Err:17 http://ppa.launchpad.net/jfi/ppa/ubuntu focal Release     404  Not Found [IP: 91.189.95.85 80] Hit:11 https://packagecloud.io/slacktechnologies/slack/debian jessie InRelease Err:18 http://in.archive.ubuntu.com/ubuntu focal InRelease       Temporary failure resolving 'in.archive.ubuntu.com' Err:19 http://in.archive.ubuntu.com/ubuntu focal-updates InRelease   Temporary failure resolving 'in.archive.ubuntu.com' Err:20 http://in.archive.ubuntu.com/ubuntu focal-backports InRelease   Temporary failure resolving 'in.archive.ubuntu.com' Reading package lists... Done            E: The repository 'http://ppa.launchpad.net/gnome3-team/gnome3/ubuntu focal Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. E: The repository 'http://ppa.launchpad.net/gnome3-team/gnome3-staging/ubuntu focal Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. E: The repository 'http://ppa.launchpad.net/jfi/ppa/ubuntu focal Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. (base)  ✘ sriharsha@B550-AORUS  ~ 


After thinking about ways to minimize my app size I wondered..  public int; public boolean;   does one take up more memory than the other?   if instead they are:  public int = 0; public boolean = false;   any difference there?  What about using an integer instead of a boolean( 1 & 2 ). Does that somehow take up less memory / space?


Ok, I realize this situation is somewhat unusual, but I need to establish a TCP connection (the 3-way handshake) using only raw sockets (in C, in linux) -- i.e. I need to construct the IP headers and TCP headers myself.  I'm writing a server (so I have to first respond to the incoming SYN packet), and for whatever reason I can't seem to get it right.  Yes, I realize that a SOCK_STREAM will handle this for me, but for reasons I don't want to go into that isn't an option.  The tutorials I've found online on using raw sockets all describe how to build a SYN flooder, but this is somewhat easier than actually establishing a TCP connection, since you don't have to construct a response based on the original packet.  I've gotten the SYN flooder examples working, and I can read the incoming SYN packet just fine from the raw socket, but I'm still having trouble creating a valid SYN/ACK response to an incoming SYN from the client.  So, does anyone know a good tutorial on using raw sockets that goes beyond creating a SYN flooder, or does anyone have some code that could do this (using SOCK_RAW, and not SOCK_STREAM)?  I would be very grateful.    MarkR is absolutely right -- the problem is that the kernel is sending reset packets in response to the initial packet because it thinks the port is closed.  The kernel is beating me to the response and the connection dies.  I was using tcpdump to monitor the connection already -- I should have been more observant and noticed that there were TWO replies one of which was a reset that was screwing things up, as well as the response my program created. D'OH!  The solution that seems to work best is to use an iptables rule, as suggested by MarkR, to block the outbound packets.  However, there's an easier way to do it than using the mark option, as suggested.  I just match whether the reset TCP flag is set.  During the course of a normal connection this is unlikely to be needed, and it doesn't really matter to my application if I block all outbound reset packets from the port being used.  This effectively blocks the kernel's unwanted response, but not my own packets.  If the port my program is listening on is 9999 then the iptables rule looks like this:  iptables -t filter -I OUTPUT -p tcp --sport 9999 --tcp-flags RST RST -j DROP


How can I find out which partition Ubuntu is installed on?

I want to uninstall Ubuntu, so I need to delete its partition.  I saw that many people asked this before. For example: . I followed the instructions there and here's a screenshot of the terminal after typing the suggested command (df):    But this doesn't tell me anything...   This has also been discussed before  and the answer was: EFI and primary. But I have a lot of primary partitions and I'm not sure which one to delete.  Here's a screenshot of Disk Management in Windows:    Here's a GParted screenshot:    So can anybody tell me which the Ubuntu partitions are? (I numbered them from left to right, so to make it easy just tell me numbers please)


Unable to connect locally to minecraft server

I want to turn an old ubuntu laptop into a minecraft server supposed to run within my home. Minecraft is in place, I can fire it up and see the gui and run it in a terminal as well.  Laptop IP is 192.168.0.22 and according to server.properties the port is 25565 but when I enter these information into minecraft pe on my phone I am unable to connect to the server.  My goal is just to let this run within our home no public access is needed. But what am I missing?


How do I change or remove an alias in Zsh in MacOS?

I am trying to install a build tool on my Mac called ; however it seems the word "please" is already aliased to "sudo" and I don't know where that alias is being set.  I'm using  which means I have a ~/.zshrc file instead of a ~/.bashrc file. But I can tell you that nowhere in my ~/.zshrc file nor in my ~/.bash_profile file are any aliases being set on the word "please."   Still, when I type please in the terminal I see this:  usage: sudo -h | -K | -k | -V usage: sudo -v [-AknS] [-g group] [-h host] [-p prompt] [-u user] usage: sudo -l [-AknS] [-g group] [-h host] [-p prompt] [-U user] [-u user] [command] usage: sudo [-AbEHknPS] [-C num] [-g group] [-h host] [-p prompt] [-u user] [VAR=value] [-i|-s] [<command>] usage: sudo -e [-AknS] [-C num] [-g group] [-h host] [-p prompt] [-u user] file ...   And when I type which please it just says this:  please: aliased to sudo   Are there other locations I'm not thinking of where aliases can be defined? How do I get rid of this annoying alias?


Limit of a decreasing sequence of measurable sets.

Let $(X,\mathcal{A})$ be a measurable space, with measure $\mu$. Let $\{E_n\}_{n \in \mathbb{N}} \subseteq \mathcal{A}$ be a sequence of measurable sets, with $E_{n+1} \subseteq E_n, \ \forall n \in \mathbb{N}$, that is a decreasing sequence, and $\mu(E_n)=+ \infty, \ \forall n \in \mathbb{N}$. Let $E=\bigcap_{n \in \mathbb{N}} E_n$ the limit set of the sequence, $E$ is measurable for definition. Is true that $\mu(E)=+\infty$? If not in all cases, is true with $X=\mathbb{R}^{N}$, $\mathcal{A}$ the collection of Lebesgue-measurable sets, and $\mu$ the Lebesgue measure on $\mathbb{R}^N$?


I have a simple query about Pundit budge (left 10 comments with score of 5 or more).  How close am I for the Pundit badge?


package for \mathbb{lowercase letter} symbol

I wonder if there is any package that produces a  \mathbb{} symbol for lowercase letters.  Thanks in advance!


90's book about children climbing a tree and visiting different worlds from there

In the 90's I read a book about two children (I think they were siblings, boy and girl) who climbed a tree. At the end they found a door to another world. After some time the (fantasy) worlds switched to another one. Once they got stuck in a world, because the world went on traveling and therefore the door couldn't be reached anymore. They met many curious individuals during their adventures.  It's a completed novel for kids. I've read it in German, but I can't remember if the author was a German one, so it might've been available in English as well. It was a fairly thick book.  EDIT: After some thought I remember a pancake kind of person


Let $2 \leq p \leq q$ and $2 \leq r \leq s$. Prove that $R(p,r) \leq R(q,s)$ and that equality holds if and only if $p=q$ and $r=s$.   The equality part is clear, cause we will have $R(p,r) = R(p,r)$, which clearly is the same thing. But why it is true only then? I know also that things are equal due to symmetry too, though I don't think it is relevant here. On the other hand, how can I prove the inequality?


Redirect traffic through vpn on an as needed basis

My problem is really simple yet it sounds complex, but I have zero to none experience with this.  I have set up a box using gentoo which has its own semi-static WAN-IP and acts as router for my LAN. I have access to a router elsewhere on the web, which has a dynamic IP and is registered to dyndns. My plan is to redirect specific traffic from my gentoo-box to the router to make use of the tunnel and the dynamic IP.  My idea was to install a proxy on my gentoo-box which uses a VPN connection to the router as default. Every computer on the LAN and specific computers on the WAN (that have access right to the proxy) should be allowed to use this proxy, but no traffic should be forced to go through the router. Which rules out the idea of just using iptables.  Example: I want to redirect Firefox traffic through the VPN but not Opera traffic. I setup Firefox to use the local proxy, it gets the dynamic IP of the distant router, Opera still browses with my semistatic-IP.  Is this possible? Which software to use? Any further ideas?  btw: the router supports PPTP, IPSec and L2TP  Edit: If you have better ideas for the title please edit or suggest, I have no idea how to call my problem :(


Does some of accretion disk light make focal points above the black hole poles?


I know that if $R$ is a PID ring, then a projective $R-$module is free. Now, i want an example of a f.g., projective, non free $R-$module where $R$ is a non PID ring.


Proof $L^{p}(X,\mu)$ is a linear space normed with respect to the norm

I am studying Lp-Spaces and Banach-Spaces and the norm for $ p \in [1, \infty) $ is given by $$||f||_{L_{p}}=\left ( \int _{X} ||f(x))||^{p} \right )^{1/p}$$ but i didn't find how to test it. Do you know any book or pdf where I can find the demo? Thank you so much


Relationship between (algebraic) vector bundle and (topological) vector bundle on $\mathbb{RP}^{1}$($\mathbb{P}^{1}$)

We know the one dimensional real projective space $\mathbb{RP}^{1}$ is isomorphic $S^{1}$, so there are only two line bundles (up to isomorphic) on it: the cyclinder and Mobius band. However the Picard group of one dimensional projective space (in algebraic geometry) $\mathbb{P}^{1}$ is $\mathbb{Z}$, the line bundle or locally free sheaves on it are $\mathscr{O}(m), m\in \mathbb{Z}$. I am wondering if there are relationships between the line bundle on $\mathbb{RP}^{1}$ and $\mathbb{P}^{1}$? If there are have relationships, why there are only two line bundles on $\mathbb{RP}^{1}$, but infinitely many on $\mathbb{P}^{1}$?


I installed ubuntu on My Acer c7 Chromebook by using the command,   wget http://goo.gl/tnyga; sudo bash tnyga   It was working fine, but after a few days it boots in Chrome Os and unable to go back to Ubuntu. I tried so many commands like;   sudo cgpt add -i 6 -P 5 -S 1 /dev/sda   Then I try to change the priority of the keren, but no changes.   So can any one suggest any solutions?


document.execCommand isn't working with me

I want to copy the text from function parameter, with other text after it  I tried making textarea element for only read and hide it,and put text in it but it didn't work    function Copy(str) {   const AllWord = str + "

Copied From HERE";   var el = document.createElement('textarea');   el.value = AllWord;   el.setAttribute('readonly', '');   el.style = {     position: 'absolute',     left: '-9999px'   };   document.body.appendChild(el);   el.select();   document.execCommand('copy');   document.body.removeChild(el); }  Copy("CopiedText");     I expect it to copy "CopiedText"


How does this bash alias to repeat the last command as sudo work?

I recently came across this ingenious bash alias to repeat the last issued command, but as sudo. This could be done by using sudo !! directly in the terminal after the failed command.  The alias I found is alias mycmd='sudo $(history -p \!\!)'  It's just not clear to me how this works.


Outputting One long string as author in Natbib?

I'm using Natbib to display my references in text. For example,  @misc{DrinkingWater,       author = "Water Quality and Health Council",       title = "Drinking Water Chlorination A Review of Disinfection Practices and Issues ",       month = "September",       year = "2015",       url = "http://www.waterandhealth.org/drinkingwater/wp.html",  }   If I invoke this using \citep{source}, I only get      (of Concerned Scientists, 2015)   Moreover, I've referenced wikipedia many 3 times , and for that it shows      (Wikipedia, 2015b)   How can I get rid of the letter?  For example I have the sources:  @misc{LoveCanal,       author = "Wikipedia",       title = "Love Canal : Aftermath ",       month = "September",       year = "2015",       url = "https://en.wikipedia.org/wiki/Love_Canal#Aftermath",  }  @misc{SilentSpring,       author = "Wikipedia",       title = "Silent Spring ",       month = "September",       year = "2015",       url = "https://en.wikipedia.org/wiki/Silent_Spring",  }   and when I source them I get (Wikipedia,2015) and (Wikipedia, 2015a)  Thanks in advance !


C# giving a PictureBox the shape of a Image

I want to give a pictureBox the shape of an image I have. The image off course is rectangular, but there is the backgroundcolor that should be ignored, which leads to the desired form. So if there is a picture of a banana on a white background, I should have a pictureBox in shape of a banana at the end.. This is needed so that I can move shaped PictureBox in front of a AxWMPLib Mediaplayer without having the rectangle surrounding the banana covering all of the video.  My approach is to create a new class that extends PictureBox and then setting the region to the shape. Problem is, I don't know how to get the shape.  class ShapedPBox : PictureBox {     public ShapedPBox()     {          this.Paint += this.shapedPaint;     }      void shapedPaint(object sender, paintEventArgs e)     {         System.Drawing.Drawing2D.GraphicsPath gP = new System.Drawing.Drawing2D.GraphicsPath();         //do something to give gP.addPicture? perhaps something with transparency key?          this.Region = new Region(graphicsPath);     }     public Image image; }


Justifying code according to corresponding elements indentation

How do I justify my comments as to inner for loop indentation in the below code:  \documentclass[a4paper]{article} \pagestyle{empty} \usepackage{algorithm} \usepackage{algpseudocode} \usepackage[caption=false,font=footnotesize]{subfig} \begin{document} \begin{algorithm} \label{algoQ} \caption{Algorithm to check quality of methods} \begin{algorithmic} \For{\textbf{each} $methods$ in$methodList$} \For{\textbf{each} $msd$ in$msdList$}  \Comment { \% for each MSD \%} \Statex   \Comment { \% get MSDs referenced method service \%} \EndFor \textbf{endFor} \EndFor \textbf{endFor} \end{algorithmic} \end{algorithm} \end{document}


Scared of auth.log file of my ubuntu server

I have a ubuntu server running, just a small project. My auth.log file is 22mb big and it is full of stuff like: Failed password for invalid user milka from **** port **** ssh2 Received disconnect from **** port ****: Bye Bye [preauth] Disconnected from invalid user milka **** port **** [preauth] Invalid user root1 from **** port ***** pam_unix(sshd:auth): check pass; user unknown pam_unix(sshd:auth): authentication failure; *****  The ***** mean that in the log file is stuff I'm not sure if I can post it without security risks. What does the logs mean?? Do someone try to hack me??? Please help :( EDIT: the entrys started 3 days ago and the attack run constantly since that


Does a high content in salt extend the refrigerated shelf life of cooked meat?

I cook usually 1kg block at 65°C for 6 hours with 40g (4%) of salt, 10g (1%) of sugar, and a good amount of white and black pepper.  After cooking it, I cool it in an ice bath, then I store it in the fridge; first, one day uncovered, so it dries out a bit, and then in a Tupperware.  My question is: would this high content of salt increase the shelf life over the normal 3-4 days of a roast?  ADMINS: I am well aware of this . What I want to know is if making a dish salted would extend its shelf life, and if not, what would be the alternatives. If you don't have the answer, please leave the question open. Maybe someone else would have.


I have been studying linear algebra for a while now, and I still can't understand the basic concept of linear transformation and the easy ''translation'' of them the matrices.  I understand that every proof we make can be done with both concepts, and that they are connected pretty close, and there is a basis which ''moves'' us from one concept to another.  If anyone can write a brief explanation, or some reading material, It would be a big step for me for further understanding of the subject.  Thanks,  Alan


How do I find the exact meeting point of 2 lines? I'd like to locate this place, and add a vertex on it. Preferably no python.  Here are some examples that the solution will need to solve for:   Tracing down 2 lines  Tracing up one, down another  Tracing to a line    here is a     for testing.  P.S. If you have multiple solutions, please post them as different answers to help wit our site stats


Proof for the relationship between Cardinality of Natural numbers and Cardinality of Real Numbers

(I am a 13 year old so when you answer please don't use things that are TOO hard even though I actually can understand quite complex stuff)  I was studying Infinite sets and their cardinality (not in school, but just for fun), and I know that card($\mathbb N$)=$\aleph_o$ and card($\mathbb R$)=c I now know that c=$2^{\aleph_o}$ which may or may not be $\aleph_1$.   Is there any proof that c=$2^{\aleph_o}$?


I realized today that the chapter "Introduction" has "List of Tables" as header. I use this code to add the chapter "Introduction"  \chapter*{Introduzione}\addcontentsline{toc}{chapter}{Introduzione}\pagenumbering{Roman}    This chapter has two pages. Both have roman numbers, but the second has as header "List of Tables" instead of "Introduction".  I use \listoftables to create the list and \input{introduction} to call the file in the main one. The same thing happen with another chapter that uses \chapter*; on the header there is the name of the previous chapter (that is created with \chapter  \RequirePackage[hyphens]{url} \documentclass[a4paper,italian,oneside,openright,12pt,draft]{book} \usepackage{cmap} % makes PDF searchable \usepackage{babel} \usepackage[latin9]{inputenc} \usepackage{lmodern} % Latin Modern font \usepackage[T1]{fontenc} \usepackage{textcomp} % needed for fontenc \usepackage[bookmarksnumbered,final]{easyoutput} \usepackage[binding=0.8cm]{layaureo}  % migliore copertura foglio A4 + margine rilegatura \usepackage{indentfirst} \usepackage{subfig} \usepackage{float} \usepackage{wrapfig} \usepackage{fancyhdr} \usepackage{lipsum} \usepackage{amsmath, bm} \usepackage[font={it}]{caption}  \usepackage{mwe} \usepackage{tikz}  \makeindex \usepackage[nottoc,notlof,notlot]{tocbibind} %aggiunge bibliografia nell'indice senza l'elenco delle immagini e tabelle \usepackage{hyperref}   % righe sull'header delle pagine \fancyhf{} \lhead{\leftmark} \rhead{\thepage} \pagestyle{fancy}  % tabelle \usepackage{booktabs} \usepackage{tabularx} \usepackage{tabulary} \usepackage{pbox} \usepackage{tablefootnote} %%%% title and other stuff %%%% \cleardoublepage \pagenumbering{gobble} \tableofcontents \listoffigures \listoftables  \input{dedica} \input{introduzione} \cleardoublepage \pagenumbering{arabic} \input{capitolo1} \input{capitolo2} \input{capitolo3} \input{capitolo4} \input{conclusioni}  \backmatter  \medskip  \bibliographystyle{unsrt-custom} \bibliography{bibliografia} \input{immagini}  \end{document}


Why is the node.js resource recommendation question allowed?

locked by Shog9♦ Jul 19 at 22:30 This question's answer is a collaborative effort: if you see something that can be improved, just edit to improve it! No additional answers can be added here  I'm sure the answers to this question are useful, but why is this particular one allowed when we generally disallow resource recommendation questions? Even though you can't add new answers, the existing answers can still be edited and people are making edits quite frequently.


Is there any way to fix the wavy lines that appear when photographing a striped dress?   It's not just in viewing online: when it was printed at wallet size, the wavy lines showed up.


I'd like to propose a home tab to sit long with questions, tags, users, badges and unanswered. It should list for the specific user you are logged in as all the questions with favourite tags. That way if you are following several tags, you can see all the questions tagged accordingly and answer them instead of clicking through each one to see any answered/unanswered questions.


$n = 2^p - 1$ Prove that if n is prime then p must also be prime.

My first thought was to try a contradiction; So given n is prime assume p is not prime i.e $p = p_{1}^{\alpha1} .... p_{r}^{\alpha r}$. But i didnt know where to go from there.


I am looking for a way to perform weighted total least squares in R. I know one can use PCA for this as described nicely in the following post.    However, I need a weighted version of total least squares, i.e. I want to account for measurement error in my data, where the error $(\Delta x_i, \Delta y_i)$ can be different for each data point $(x_i, y_i)$. Any suggestions? Specifically, I want to do the following:  x = rnorm(10,0,2) x.se = rnorm(10,0,0.7) y = 20*x y.se = rnorm(10,0,1) r <- prcomp( ~ x + y ) slope <- r$rotation[2,1] / r$rotation[1,1] intercept <- r$center[2] - slope*r$center[1]   However, here I am not accounting for the varying measurement errors in $x$ and $y$. Is there any R package which I can use to account for the x.se and y.se vectors?


How to remove unwanted default bookmarks in Nautilus?

Nautilus has some bookmarks in the left-hand bar by default. I do not store any music or videos on my computer, and would like those book marks to disappear. How can I make this happen? The linked question has not been updated to include 16.04 and the answers there do not include the fact that the file in ~/.config/ gets re-written upon log-in.


Prove that for every integer n ≥ 1, we have  $$ \sum_{i=1}^ni^3=\left(\frac{n(n+1)}2\right)^2 $$  Solve using Mathematical Induction, include the Inductive Step  Base Case is that both the left and right side $=1$ when $n=1$.  and the Inductive Hypothesis is $1^3+2^3+\dots +k^3=\frac{\left( k(k+1)\right)^2}2$


"Regression" versus "regression to the mean"

Are The two concepts really two sides of the same coin ? The latter is often referred to simply as a regression, but surely this is just an unfortunate coincidence?   The former is about predicting values of a dependent variable from a weighted combination of values of independent variables , whereas the second is Simply the observation that, with time, the average of all so far observed values of a random variable will tend to approach its true mean.


How to create partition from running onepartition?

Hello i am new in ubuntu. While setuping ubuntu i pressed replace windows 8 and it did. But the problem is it also deleted other partition. Now is there any way to slice my one partition into 2 pieces? I have 320GB HDD so i want to use 50GB for ubuntu and others for file storage. And is there anyway to recover the datas that got deleted during installation?  I will be glad if somebody help me out


I am trying to complete the square on:  $xy - xz + yz = 1$.  I tried plugging in: $u = x + y$  If you plug in $u$ you get:  $-y^2 + uy - uz + 2yz = 1$   but I'm not sure where to go from here.


What's the meaning of "get one's finger in the air"?

Could anyone give me an explanation of the meaning of "get one's finger in the air" and the usage of it?


A word to describe a person who refuses to acknowledge illness in others

Such as a parent refusing to believe a child is ill? Hypochondriac is a person who constantly feels they themselves are ill. I am looking for a word to describe a person who refuses to acknowledge another person is ill.


iptables NAT table not matching anything

I am attempting to take a TCP service running on port 1234, and make it appear as if it's running on port 81. I thought the following might do it:  iptables -A PREROUTING -t nat -p tcp --dport 81 -j REDIRECT --to-port 1234   However, if I fire up nc -l 1234 in one terminal, then nc 127.0.0.1 81 in another, I don't get a connection. The second nc just exits immediately. tcpdump tells me:  $ sudo tcpdump -i lo -v tcpdump: listening on lo, link-type EN10MB (Ethernet), capture size 65535 bytes 07:54:21.628583 IP (tos 0x0, ttl 64, id 60458, offset 0, flags [DF], proto TCP (6), length 60)     localhost.45729 > localhost.81: Flags [S], cksum 0xfe30 (incorrect -> 0x06a3), seq 4232210875, win 43690, options [mss 65495,sackOK,TS val 755089 ecr 0,nop,wscale 6], length 0 07:54:21.628595 IP (tos 0x0, ttl 64, id 0, offset 0, flags [DF], proto TCP (6), length 40)     localhost.81 > localhost.45729: Flags [R.], cksum 0x98dc (correct), seq 0, ack 4232210876, win 0, length 0   Looks as if the connection is attempted, then immediately reset. I see there's an incorrect checksum -- is that a problem, and if so, how do I fix it?  The other nc is listening on port 1234, as verified by netstat and attempting to connect to port 1234 directly, successfully.  Oddly, nothing seems to be matching PREROUTING the nat table at all:  $ sudo iptables -t nat -L -n -v Chain PREROUTING (policy ACCEPT 0 packets, 0 bytes)  pkts bytes target     prot opt in     out     source               destination              0     0 REDIRECT   tcp  --  *      *       0.0.0.0/0            0.0.0.0/0            tcp dpt:81 redir ports 1234  Chain INPUT (policy ACCEPT 0 packets, 0 bytes)  pkts bytes target     prot opt in     out     source               destination           Chain OUTPUT (policy ACCEPT 2 packets, 120 bytes)  pkts bytes target     prot opt in     out     source               destination           Chain POSTROUTING (policy ACCEPT 2 packets, 120 bytes)  pkts bytes target     prot opt in     out     source               destination            Note the 0 counters, despite my multiple attempts to make the connection with nc above. Now, it's my understanding that all traffic should be going through the PREROUTING chain, so I should see something. What gives?


About the Lie algebra of the angular momentum Poisson bracket structure

The components of the classical angular momentum $L_i$, satisfy the Poisson bracket relation $$\{L_i,L_j\}=\epsilon_{ijk}L_k,\tag{1}$$ and forms a Lie algebra (i.e,  anti-symmetric, obeys the Jacobi identity etc). In the theory of Lie groups, the commutator $$[\hat{L}_i,\hat{L}_j]=i\epsilon_{ijk}\hat{L}_k\tag{2}$$ is definitely called a $\mathfrak{so}(3)$ Lie algebra, because the $\hat{L}_i$'s generate ${\rm SO}(3)$ group elements $\left(\exp\left(-i\theta_i\hat{L}_i\right)\right)$. I wonder whether the PB Lie algebra $(1)$ is also called a $\mathfrak{so}(3)$ Lie algebra. And if so, why? What is the relation of $(1)$ to the ${\rm SO}(3)$ group, if any?


Only squares instead of letters and numbers are displayed in my calculator and other apps in Ubuntu 18.04

I don't know what I did wrong in my Ubuntu 18.04 OS. For some reason some of my apps look like this:    This also happens to other gnome apps like pdf-reviewer and Logs. Window title, menu bar etc. are all blank, display only squares.  *Problem solved: I downloaded Google Fonts, saved them in a new folder, they can be applied system-wide, but after I did some font settings using Google Fonts it didn't work. I changed the font of Interface with Tweaks-Tool, that was what causing the problem.


Inconsistent behavior of Bash's `cd` with symbolic links

I am currently trying understand the behavior of Bash's cd when it comes to symbolic links. By default, cd should follow the logical directory structure and should not resolve symbolic links.  cd behaves like this in my first example. However, I came up with a second example where cd seems to follow the physical structure. Is this expected behavior? What's the difference?  Setup  $ cd $ mkdir -p test/a/b/c test/d $ tree test test ├── a │   └── b │       └── c └── d  4 directories, 0 files $ cd test/d $ ln -s ../a/b/c symlink   1st example  $ pwd /home/hexcabron/test/d $ tree .. .. ├── a │   └── b │       └── c └── d     └── symlink -> ../a/b/c  5 directories, 0 files $ cd symlink/../../a $ pwd /home/hexcabron/test/a   2nd example  $ cd ../d $ pwd /home/hexcabron/test/d $ mkdir -p symlink/../e $ tree .. .. ├── a │   └── b │       ├── c │       └── e └── d     └── symlink -> ../a/b/c  6 directories, 0 files $ cd symlink/../e $ pwd /home/hexcabron/test/a/b/e


Problem with resolution of Ubuntu 14 on Windows7 x64 Virtualbox5

I'm running Windows7 x64, Virtualbox 5.0.16 and just installed Ubuntu 14.04.   Ubuntu starts fine, but gives a very low resolution (e.g. 640x460).  I tried running sudo apt-get install virtualbox-guest-dkms virtualbox-guest-utils virtualbox-guest-x11  but this gives me the error     Unable to locate package virtualbox-guest-x11: depends on xorg-video abi-15   depends on xserver-xorg-core etc.etc.   I'm stuck here. Any suggestions (using newbie language?)  Thanks!


What kind of computational model is the brain?

I was wondering what kind of computational model is the human brain (as it seems superior to a Turing machine). Another thing that should be a separate question, What would be a perfect computer model be like, is our brain any close to it? Apology for putting the ideas in a very beginner way, which ofcourse I am.


Why are there fake Stack Exchange sites?

I recently came across these links doing a search on Google:     Can't Stack Exchange do something about this? It's obvious that earthwithsun.com copied data from superuser.com.


If $A \in M_{n \times m}(\mathbb{R})$, why is $\operatorname{rk}(A) = \operatorname{rk}(AA^t)$?

I was reading a textbook and saw the following:     Let $A \in M_{n \times m}(\mathbb{R})$ and $A^t$ the transposed matrix of $A$. It can be proven that $\operatorname{rk}(A) = \operatorname{rk}(AA^t)$.      There is no further information here and I was wondering how to prove this. And also, does this only work for $\mathbb{R}$ or does it work for other fields, e.g. $\mathbb{C}$?


I'm having a hard time splitting a node circle in three parts.  I want to have the circle split horizontally and then the bottom part split in  two vertically like in this picture:    I still want to be able to place text inside each parts.  thanks in advance  Edit I can end up with the circle like in the picture above but I can't place text in each part like I want.  \documentclass{minimal} \usepackage{tikz} \usetikzlibrary{shapes,snakes} \begin{document}  \begin{tikzpicture}[scale =3 ] \node [circle split,draw,text width=15em] (z){$a$ \hfill $b$}; \draw  (z.center) -- (z.south); \end{tikzpicture}  \end{document}


How many shuttlecraft were lost over the course of Star Trek:Voyager?

Is there a tally somewhere of the exact number shown to be lost over the entire series, and (where possible) the episodes in which they were lost (or when the audience learned they were lost, if appropriate)?  Possibly complicated by the "Year of Hell" storyline and other cases where there were time resets; please note where a shuttle destroyed in an episode would have (logically, at least) been restored due to a time reset, to get an accurate count of the shuttles destroyed in the final timeline.


Button type=submit with php isset instead of input typebutton

I have been searching this stuff but could not find anywhere. when i search about button name and value, everywhere its mentioned about input type=button  But i am looking for button type=submit instead of input type=button i want to allow users to remove their comments. So, the delete button is just showing like a link  The Html is  <button class="likeslink" type="submit" name="delcom" value="<?php echo $comid ?>"><small>Delete</small></button>   I am not getting how can i check if this button is clicked or not not using php as i tried   <?php if(isset('delcom')) { $sql = "DELETE FROM comments WHERE id = :id"; $stmt = $DB->prepare($sql); $stmt->bindValue(":id", $comid); $stmt->execute(); } ?>   But its not working.  Meanwhile, i want a popup alert message that confirms Delete Query includings Delete or Cancel buttons on it  I don't want that simple javascript alert on the top of the page. I want some popup window in the middle of the screen with my own Color scheme  Please help


How can I pass a Parameter via Query String to populate a lookup field on a New Item Form/DVWP?

I have two lists:   List A: Products List B: Requirements   I'd like to have a nice Create Requirement page launched from the Product Listing page.  I have a DVWP/Multi-Item View displaying all Products. Next to each product, there is a Create Requirement link. The hyperlink generates the Query String URL /Pages/Create-Requirement.aspx?Product=Product  On the Create-Requirement.aspx page, I have a DVWP/New Item Form. The form includes a lookup field back to the Products list. I would like the Query String parameter to populate that lookup field and for the field to be hidden.  I've seen different methods of using Javascript or jQuery to pass to a field on a Custom New Item Form - but not necessarily a DVWP/New Item Form. And it's easy to pass to a text field but not a lookup field. I even tried passing to a text field that would then populate the lookup by workflow on item creation but SPD won't do that (unless someone can think of workaround logic).  Hiding the field should be easy enough - I just can't make the lookup happy. (Lookups are never happy.)


NullPointerException while running Coref Stanford

I want to use the coreference resolution from Stanford NLP. I have downloaded the latest version 3.6.But when I run the following code, I am getting NullPointerException. I looked up in net, and few people seem to have to experienced the same problem, but no solution is mentioned. Any help would be appreciated.  public static void main(String[] args) {   Properties props = new Properties();   props.put("annotators", "tokenize, ssplit, pos, lemma, ner, parse, dcoref");   props.put("dcoref.score", true);   StanfordCoreNLP pipeline = new StanfordCoreNLP(props);   String sentence="Stanford University is located in California. It is a great university, founded in 1891.";   Annotation document = new Annotation(sentence);    pipeline.annotate(document);   System.out.println(document);   Map<Integer, CorefChain> graph = document.get(CorefChainAnnotation.class);   Set<Integer> set=graph.keySet();   Iterator <Integer> it=set.iterator();   while(it.hasNext()) {     CorefChain c=graph.get(it.next());     System.out.println("CorefChain: "+c);   } }


Why do blackbodies emit all frequencies of light?

In Quantum Mechanics - Concepts and Applications by Zettili, he states that an ideal blackbody can emit light across the entire spectrum. Why is this? In other words, what is the physical process that could cause this phenomena?


UK Customs or TSA removed my TSA lock but didn't leave a note or return the lock, what can I do?

I flew to the US on a business trip last month, and locked my soft suitcase with a TSA lock. I did the same on the flight back, but when I got my bag off the carousel at Heathrow there was no lock, no note, and a carrier bag containing a bottle of Hershey's sauce was at the top of the bag instead of in the middle where I packed it. Nothing else was moved, and due to the lack of a note I don't actually know who opened my bag or why.  I know it's not a big deal, but the lock was borrowed and I now owe somebody a lock. My colleague's suitcase was also opened but the lock was inside along with a note from the TSA saying that they searched the bag.  What can I do?


Is every $G_\delta$ set the set of continuity points of some function $f$?

I can prove that given a function $f:X \rightarrow Y$, where $X,Y$ are metric spaces, the set $A \subseteq X$ of points on which $f$ is continuous, is $G_{\delta}$.   (Take $U_n = \bigcup_{y \in Im(f)} f^{-1}(B_{\frac{1}{n}}(y))$ and $V= \bigcap_{n \in \mathbb{N}}U_n$, and $V$ is $G_\delta$).  My question is: Is the converse direction true? Is it true that, given a $G_\delta$ set $A \subseteq X$, there exists a metric space $Y$, and a function $f:X \rightarrow Y$, such that, the set of points on which $f$ is continuous is $A$?  Thank you! Shir


Two questions about ORDER BY using Prepared Statements

<?php $what = 'creationdate';  $sql = "SELECT * FROM `accountlist` ORDER BY ? [ASC/DESC]";  $stmt = $conn->stmt_init();  if(!($stmt->prepare($sql))) {   echo "Error"; } else {   $stmt->bind_param("s", $what);   $check = $stmt->execute();   $result = $stmt->get_result(); }  for($n=1; $row = $result->fetch_assoc(); $n++) {   var_dump($row);echo "
";    echo $n . ':
';   foreach($row as $key => $value) echo $key . ': '. $value . '
';   echo '
'; }  echo $check ? 'success' : 'error/no lines'   ?>   Why does this return the same result when I use either ASC or DESC in my query? Is there a way to place a placeholder instead of that *? Using a ? and binding it returns a "?" in the $row array...


How to make wget faster or multithreading?

I've just upgraded my computer hardware(cpu + motherboard + graphic card + memory + hard disk), so that install a new OS is needed. I tried to download debian-6.0.6-amd64-netinst.iso with wget command but the speed is so slow that I could not bear. 4Kb/s ~ 17 Kb/s, slow like a running turtle, or even more slower if I use Chrome.  I've read the help information of wget, it seems like there are no options could make it more faster.  Is there anyway to make wget faster? Or is it possible to make it multi-threading download?  PS: my bandwidth is 4M. I use this command:  wget -c url  http://hammurabi.acc.umu.se/debian-cd/6.0.6/amd64/iso-cd/debian-6.0.6-amd64-netinst.iso


Example where a simple correlation coefficient has a sign opposite to that of the corresponding partial correlation coefficient

Give some examples where a simple correlation coefficient has a sign opposite to that of the corresponding partial correlation coefficient and comment on it.   It is a question from an examination paper.Please help.


SSH closes connection after login Exit status 254

I need to start by stating that I have read through every single problem on here relating to mine, but all of them seem to have access somehow to their server's files. I do not, so here is my question.  I'm on centOS 6.5 and ssh closes connection right after a successful login. I am using mac and windows/putty to access my server with the same results. Is there anyway I can access my server now without having access to its files?   Below is the readout from ssh -vvv right after a successful login:  debug1: Authentication succeeded (password). Authenticated to 4X.5X.XX.2 ([4X.5X.XX.2]:82). debug1: channel 0: new [client-session] debug3: ssh_session2_open: channel_new: 0 debug2: channel 0: send open debug1: Requesting no-more-sessions@openssh.com debug1: Entering interactive session. debug2: callback start debug2: fd 3 setting TCP_NODELAY debug3: ssh_packet_set_tos: set IP_TOS 0x10 debug2: client_session2_setup: id 0 debug2: channel 0: request pty-req confirm 1 debug1: Sending environment. debug3: Ignored env TERM_PROGRAM debug3: Ignored env SHELL debug3: Ignored env TERM debug3: Ignored env TMPDIR debug3: Ignored env Apple_PubSub_Socket_Render debug3: Ignored env TERM_PROGRAM_VERSION debug3: Ignored env TERM_SESSION_ID debug3: Ignored env USER debug3: Ignored env SSH_AUTH_SOCK debug3: Ignored env __CF_USER_TEXT_ENCODING debug3: Ignored env PATH debug3: Ignored env PWD debug1: Sending env LANG = en_US.UTF-8 debug2: channel 0: request env confirm 0 debug3: Ignored env XPC_FLAGS debug3: Ignored env XPC_SERVICE_NAME debug3: Ignored env SHLVL debug3: Ignored env HOME debug3: Ignored env LOGNAME debug3: Ignored env _ debug2: channel 0: request shell confirm 1 debug2: callback done debug2: channel 0: open confirm rwindow 0 rmax 32768 debug2: channel_input_status_confirm: type 99 id 0 debug2: PTY allocation request accepted on channel 0 debug2: channel 0: rcvd adjust 2097152 debug2: channel_input_status_confirm: type 99 id 0 debug2: shell request accepted on channel 0 Last login: Wed Oct  7 06:23:21 2015 from 1XX.XXX.X1.185 debug1: client_input_channel_req: channel 0 rtype exit-status reply 0 debug1: client_input_channel_req: channel 0 rtype eow@openssh.com reply 0 debug2: channel 0: rcvd eow debug2: channel 0: close_read debug2: channel 0: input open -> closed debug2: channel 0: rcvd eof debug2: channel 0: output open -> drain debug2: channel 0: obuf empty debug2: channel 0: close_write debug2: channel 0: output drain -> closed debug2: channel 0: rcvd close debug3: channel 0: will not send data after close debug2: channel 0: almost dead debug2: channel 0: gc: notify user debug2: channel 0: gc: user detached debug2: channel 0: send close debug2: channel 0: is dead debug2: channel 0: garbage collecting debug1: channel 0: free: client-session, nchannels 1 debug3: channel 0: status: The following connections are open:   #0 client-session (t4 r0 i3/0 o3/0 fd -1/-1 cc -1)  Connection to 4X.5X.XX.2 closed. Transferred: sent 3176, received 2640 bytes, in 0.3 seconds Bytes per second: sent 10370.6, received 8620.4 debug1: Exit status 254


Usage Scenarios for Auto Encoders as alternatives to PCA

Is there ever a practical situation where one would use a linear autoencoder over PCA?


I was studying a book about thermodynamics of nanosystems and I got stuck with this question in my mind which I couldn't find an answer for.  For instance, does a single water molecule have a state, like being liquid or something? Or is one molecule of TiO2 solid or gas? I would appreciate if anyone could clarify this.  I should state that I am not considering a macromolecule in my case.


Under 18 year old overstay in the US returned back to Europe, am I still able to re enter the US?

My question is am I eligible to re enter the US? In more detail, I have overstayed my US visa for a couple of month in which my mother has received her green card therefore she can enter the US, however the question is can I enter the US past my overstay? I was 14-15 when I overstayed there so are there any explanations to my question.  The difference however is that my mother was there mainly to apply for a green card and we lived with my sister whose 32 which sponsored her for the green card. Is there any possible way I am able to return to the US?


I have apps such as  and  installed in My Samsung Galaxy Y Android 2.3.6 phone. I have tried  and  but still not able to move these apps to the SD card at all. What's wrong? Can someone help me out here?


The following statement popped up on a review sheet for an exam I have coming up. I understand the statement but am unsure how to prove it. I'm also a little unsure about how invertibility works in polynomials. Any sources about the proof or inverting polynomials would be great, thanks!  All non-zero elements of $\mathbb{F}_p[x]/(h(x))$ are invertible iff $h(x)$ is irreducible


Desktop wakes from suspend at random (14.04)

My desktop is waking up from suspend by itself. Sometimes it takes just a minute or two, other times hours.  I don't know where to start troubleshooting this. Any help would be greatly appreciated.


I would like to prove that $\sum_{k=1} ^ n k^{-1} = \ln(n) + O(1)$. That is, I would like to show that there is some natural number $N$ large enough so that $n \ge N$ implies:  $$|\sum_{k=1}^n k^{-1} - \ln(n) | < M,$$  where $M$ is a positive constant independent of $n$. I think the idea behind the argument must be easy, but I am somehow missing it. I do see that $\sum_{k=1}^n k^{-1}$ can be taken as a sort of approximation, using areas of rectangles, to $\int_1^n \frac{1}{x}dx = \ln(n)$. So maybe the argument uses the integral comparison test? But, anyway, I'm still fumbling with how to proceed.  Hints or solutions are greatly appreciated.


Card with 10 tickets. What is it called?

I'm looking for the English word to describe a card which can be sold to a customer which contains several tickets. For instance, in a fitness center you can buy a card which allows you to participate in classes 10 times.  The closest thing I have is "punch card", but not having English as my main language, I'm not sure if that is correct.


Number of ways to represent any N as sum of odd numbers?

I was solving some basic Math Coding Problem and found that For any number $N$, the number of ways to express $N$ as sum of Odd Numbers is $Fib[N]$ where $Fib$ is Fibonnaci , I don't have a valid proof for this and didnot understand that how this can be solved using recurrences Can someone provide with it ? If you are not getting it Suppose for N=4 number of ways to write it as sum of Odd Numbers is 3 which is Fibonnaci at $3$  $4=> 1+1+1+1$  $4=> 1+3$  $4=> 3+1$  NOTE-> the composition is ordered $( 1+3)$ and $(3+1)$ are different . UPD -> I do not claim that I observed it myself but in the problem solution I found it , I asked to just find some valid proof / reason to it


finding a package and what version is in various distributions (stable release)

I am looking to know about a package and what version is it across various distributions. I thought distrowatch might be the answer, but I found it tracks only 224 packages at the most. See . Does anybody know of any site/service which I could use for the same?  It would be nice if the site has curl support on the lines of curl wttr.in/pune, not really a deal-breaker but would be nice if there is.


Speed up apt-get update by removing known ignored Translation-en

I've mirrored some ubuntu repositories to a an internal repository using apt-mirror however due to  i get the following:  Ign https://internalrepo precise-updates/main Translation-en Ign https://internalrepo precise-updates/multiverse Translation-en Ign https://internalrepo precise-updates/restricted Translation-en Ign https://internalrepo precise-updates/universe Translation-en   Now i'm trying to speed up as there are quite a few of these that slow down the apt-get update on our machines.  Is there any way I can tell the sources.list.d files or apt-get to don't even attempt to get these (I guess this would speed it up more than hitting an ignore)?  Using Ubuntu 12.04


How can Voldemort die in this situation?

‘But if Voldemort used the Killing Curse,’ Harry started again, ‘and nobody died for me this time – how can I be alive?’   ‘I think you know,’ said Dumbledore. ‘Think back. Remember what he did, in his ignorance, in his greed and his cruelty.’   ...   ‘He took my blood,’ said Harry.   ‘Precisely!’ said Dumbledore. ‘He took your blood and rebuilt his living body with it! Your blood in his veins, Harry, Lily’s protection inside both of you! He tethered you to life while he lives!’   ‘I live ... while he lives? But I thought ... I thought it was the other way round! I thought we both had to die? Or is it the same thing?’   If it's so then can Voldemort not die because Harry's blood once flowed through Voldemort’s veins? Someone please clarify.


When is it acceptable to report classmates who cheat on an exam?

So for one of my computer science classes, we have a WhatsApp chat among all students in the class to network and help each other out with questions regarding homework, or if we have any confusion on assignments. It's a given that we can get help on these types of assignments.   But exams are proctored online, and getting help on them is strictly forbidden. However, some students in the chat have posted to the WhatsApp chat during their proctored exams, posting photos of the exams, the questions, and receiving help from others during their exams.  Why would I care about this? So normally, when a student cheats on an exam, it would have no effect on another student because the two overall students' grades are unrelated. However, the exams are curved. So these students that cheated on the exams **not only have an unfair advantage, ** but they also put other students at a disadvantage. Them doing exceptionally better than they would have has the potentiality to reduce other students grades by up to 10-15% of what it would be. So if Student A would normally get a 65 because they don't know the content, they now get a 89, thus, throwing off the entire curve. However, student B who actually DID try his hardest and studied got an 74. Their grade would have been higher with the curve, but student A cheating disrupted the curve. As a result, student B gets an 79, where they would've had an 84 without the several cheaters with almost perfect exam scores at the top.  Personally, I hate to be 'that girl' that reports someone else like a snitch... But I worked so hard in this class. I studied for 6 hours every day before this exam, and got an 83... and these people admit in chat that they would probably fail if they didn't use WhatsApp (have it screenshotted-saying that exactly). So I worked so hard and got an 83. They cheated and got a solid 90, doing no studying, no hard work on their own part. They work full time, so they complain they don't have time. But how is that my fault, or the fault of the other students that the cheater makes different life choices, or chooses to put less time into school, and we as a result should suffer? That's my rationale for wanting to report them. I play fair, so why should we suffer because they don't?


I am working on the following exercise:     Let $(X_1,\ldots,X_n)$ be a random sample from a uniform distribution $U[0,\theta]$. Show that the estimator $$A_n = \frac{n+1}{n} \max\{X_1,\ldots,X_n\}$$ is unbiased, i.e. $E(A_n) = \theta$.   I first computed the CDF of $\max\{X_1,\ldots,X_n\}$ as   $$\prod_{i=1}^{n} P(X_i \le x) = x^n$$  and so the PDF is $nx^{n-1}$. But when I try to calculate the expected value I get:  $$E(A_n) = \frac{n+1}{n} \cdot E(\max\{X_1,\ldots,X_n\} = \frac{n+1}{n} \cdot \int_{0}^{\theta}nx^{n-1} \cdot x \ dx = \theta^{n+1}.$$  Could you tell me what I am doing wrong?


Drupal script cannot change folder and file permissions in my VPS

Drupal always change permissions of /sites/default and settings.php. Now I move it in my VPS and maybe I misconfigure user www-data access but i cannot remember what exactly.  Now Drupal does not change permissions.  This problem caused by my mistakes.  Please, how to return proper configuration to have a Drupal works fine?


Are the Toolshelf icons accessible anywhere?

Are T Tool icons accessible like the other icons? Why are there duplicate icons in the table?


What do you call the someone, who cares about something but wouldn't care if it's lost?

It's kind of weird to get a grasp from just the title but most people can't really understand my mindset and it's hard to give them a word to accurately describe it.  I'm extremely passive as long as something doesn't directly affect me. I usually just won't care. But even when something does directly affect me, it's hard to put into words how I'll react.   My  brother describes it as "He cares but he doesn't care" (where I got the title from) in the sense of being passive. For example, he tends to tell this to my mom, who'll then later on ground me, but it won't work at all because I will do something else with minimal effort to get un-grounded.  So if I were grounded from my computer, I would play an old game; grounded from all games, read a book; grounded from everything, study ahead in class (as I had learned everything ahead of time for AB calculus). Even though I might spend most of my time using the item I was grounded from, I wouldn't see it as a necessity and would move on to some other form of entertainment.  Now that you have a mildly to extremely weird description/example of how I think, could you help me think of a word to describe how I think in these situations because simply saying that I'm extremely passive isn't quite accurate enough to describe me.   I can also be described as a Cynical A-hole at times, in case that helps.     "He cares but he doesn't care. And he doesn't care because he's _______ and he'll just go do something else."


Why GREP can't tolerate multiple \n characters

I am trying to use GREP to select multiple-line records from a file.  The records look something like that  ########## Ligand Number :       1 blab bla bla bla blab bla   ########## Ligand Number :       2 blab bla bla bla blab bla   ########## Ligand Number :       3 bla bla bla   <EOF>   I am using Perl RegEx (-P).  To bypass the multiple line limitation in GREP, I use grep -zo. This way, the parser can consume multiple lines and output exactly what I want. generally, it works fine.  However, the problem is that the delimiter here is two empty lines after the end of last record line (three consecutive '\n' characters: one for end line and two for two empty lines).   When I try to use an expression like      grep -Pzo '^########## Ligand Number :\s+\d+.+?\n\n\n' inputFile   it returns nothing. It seems that grep can't tolerate consecutive '\n' characters.  Can anybody give an explanation?  P.S. I bypassed it already by translating the '\n' characters to '\a' first, then translating them back. like this following example:      cat inputFile | tr '\n' '\a' | grep -Po '########## Ligand Number :\s+\d+\a.+?\a\a\a' | tr '\a' '\n'   But I need to understand why couldn't GREP understand the '\n\n\n' pattern.


Looping char* gives me Access violation writing location 0x00CFB310

i try to print simple c* string like this :  char *cc = "HEllo";                  for (char* inputPtr = cc; inputPtr[0]; inputPtr++) {                     char c = inputPtr[0]++;                     printf("%s",c);                 }   but im getting : Access violation writing location 0x00CFB310. on :  char c = inputPtr[0]++;   what is wrong here ?


My bag is not full, so why can't I catch any Pokémon?

I have only 118 items in my bag, so it is not full, yet I'm being told it is full. When it said that the bag was full initially, I threw many items away. I'm now left with 118 items, but every time I try to catch a Pokémon, it says my bag is full.  I've tried logging out and back in and removing Pokémon Go from my Google account, but nothing is fixing this.


How do we solve an equation of this form: $ax + by = z$ for integers. For example: $45x - 37y = 25$ My try: $45x \equiv 25 (mod 37)$ $9x \equiv 5 (mod 37)$ $45x \equiv 5 + 37 \cdot 4 (mod 37)$ $9x \equiv 153 (mod 37)$ $x \equiv 17 (mod 37)$ How we continue from here to arrive to the final answer formally? And until here it's correct?


How do I disable MySQL server to upgrade to 8.0 from 5.7?

I installed mysql 5.7 and removed mysql 8.0 on Ubuntu 20.04.  I used followed . But, when Ubuntu update starts, it try to uninstall MySQL 5.7 and install MySQL 8.0.  How can I prevent it?


Why is the present perfect used for a past action?

I know I've been asking a lot of questions lately about tenses. But please bear with me here.     NASA scientists have decided to delay the space shuttle's launch in order to determine whether recently repaired parts will cause damage if they break off in orbit.   So for the above example, I know will is correctly used. But I don't understand why there needs to be Present Perfect. Since this happened in the past shouldn't there be Simple Past?   Is this because NASA's decision is continuing into the present?


In javascript how can I compare two timestamps to see how many days difference they are?  Current code I have:          var todaysDate = Math.floor(Date.now() / 1000);          for (var i = 0; i < 1; i++) {             var job = this.listOfJobs[i];                     var jobDate = Date.parse(job.timestamp) / 1000;              //now how would I compare these two timestamps to see how many days apart they are e.g. todaysDate and jobDate          }   The 2 timestamps I have for example are:  todays date: 1475336651 And the job created date: 1465337544  I've substracted those and it equals: 9999107  How many days is 9999107?


My English teacher feels very strongly that exact same is redundant and therefore incorrect. I disagree with her.  She feels that exact should be used in place of exact same, but I have rarely heard someone use exact by itself. For example:     I have the exact same shirt   I have the exact shirt   In the same manner, I believe that she shuns exactly the same as well.  What support is there (if any) supporting the use of exact same or exactly the same? What proof can I provide for using exact same when challenged?


Passport number not capitalized in Electronic Travel Authorization (eTA) application to travel Canada

I recently got Electronic Travel Authorization (eTA) approved to travel to Canada by air. One thing I worry is that one alphabet letter in my passport number in the eTA approval email is not capitalized Should I reapply for the eTA in this case?


Cluster point of a sequence $\{x_n\}$ is the limit of some subsequence - Axiom of Choice?

In a metric space, a cluster point of a sequence $\{x_n\}$ is the limit of some subsequence. The only proof that I know works like this:  Construct a sequence $\delta _k \to 0$. For each $\delta _k$ find a point $x_{n_k}$ in the sequence which is within $\delta_k$ of the cluster point. Make sure that $n_{k} \lt n_{k+1}$, so that you really have a subsequence, and you can do this because there are only finitely many terms before index $n_{k}$.  Question: Is this using Countable Choice? If so is it because we're "picking" a sequence element for each $\delta_k$? If we are using Countable Choice, then is there a way to prove this without using CC?  I apologize if this is a duplicate question - I know there have been previous posts where it's explained why Sequential Continuity Implies $\delta - \epsilon$ Continuity requires Countable Choice. The argument used in that proof seems similar to this one.  Thank you very much.


I went to my friends house, and he was playing Minecraft on the PC. He showed me a command block, but when I went home and opened Minecraft pocket edition, I went to the crafting table but I could not find any command blocks to craft.  What are command blocks and how do I craft them?


Is the default return type in C++11 long?

I'm using CLion 2017.2.3 and there is an error by its Intellisense saying Return type of function 'func' differs... (Image attached below). Isn't the default return type in C++ int? And why is the IDE showing it as an error? Is it a bug?  EDIT: It compiles and runs fine(without any flags, doesn't with them)


Example of two non-isomorphic fields which embed inside each other

Can you find an example of non-isomorphic fields which embed inside each other?   Most probably we can't but I am looking for extraordinary answer...


Ubuntu 14.04 LTS with GIGABYTE Geforce GTX 750

I noticed there was a lot of posts regarding other Geforce GTX 750 cards however I am not sure if those are compatible with GIGABYTE's card or if they are actually the same product. So apologies in advance if this will be a repeat question.  So I have bought a new Gigabyte Geforce GTX 750 (Model Name: GV-N750OC-2GI) graphics card. I am running Ubuntu 14.04 LTS with the latest updates applied. Before I install the card, is this compatible with Ubuntu 14.04 and I should just install the card and away I go, or is there anything special I may need to do?  Will I need to upgrade to 16.04.1?  Thanks in advance!  Update #1: Attempted to use the default drivers (Open drivers version) and it crashes. I am attempting to use the NVidia drivers now.


In C language, how to call my function instead of system library function

Platform - Linux  I have a typical requirement, where I need to give higher priority to my function then system provided function.  Lets say I have a third party library or executable. It calls many system functions such strcpy or strlen etc. I can not modify the executable/library as I do not have access to code.  Now I have implemented my own strlen or strcpy functions. When the third party library or executable is executing it should call my functions instead of system library functions.   Is it possible. If yes, can somebody guide me how to do this.  LD_PRELOAD trial result  As per suggestion here, I tried with LD_PRELOAD. I tried to override malloc function.      #include <string.h>      void *malloc(int size)     {         void *ptr = NULL;         printf("Inside my malloc function\n");         ptr = malloc(size);         return ptr;     }   I put the above code in a c file and built mem.so file and executed below command.     export LD_PRELOAD=./mem.so   So now I have overwritten malloc function.  If execute ls or clear command I get below result, which is logical.  Inside my malloc function Inside my malloc function Inside my malloc function Inside my malloc function Inside my malloc function   It looks my overloaded malloc function is invoked recursively. Only one time call I need. How can I achieve that.


A friend of mine said that Count Dooku only was a good friend of the Sith. I think that Count Dooku is a Sith.   So was Count Dooku a Sith?   Is there any evidence of him being a Sith?


What 80s or 90s sci-fi movie had an alien colosseum premise?

What I remember is a human (blonde-haired ?), Flash Gordon-like protagonist dueling all manner of strange creatures, some considerably bigger than him, in some weird alien colosseum style arena. The fights were lethal. I remember a human female character as well, but not sure about her role. I think there was some technology involved, maybe ranged or weird mechanical weapons, and hand-to-hand combat. As with all childhood memories, I may be conflating multiple things into one, but I am quite sure about the basic "alien colosseum" premise. Can't seem to easily ID it.   And yes, Flash Gordon proper had a colosseum-style fight sequence, but this was something else - with a much darker, almost dystopian setting, weirder, creepier, larger creatures, etc. I think this was probably an 80's film, which aired in the 90s.


I have found out some research going at CERN (LHC) . Is it true that monopoles behave like electrons or protons? and thus prove quantization of charge?


Why does using u-substitution give a different answer?

I am working on a problem that required finding $\int (-7-y)^2dy$. Instead of foiling it out, I just used u-substitution to find the antiderivative. ($u=-7-y; u'=-1$). I got an antiderivative of $\frac{-(-7-y)^3}{3}$. However, if you factor out this antiderivative you end up with a constant of $\frac {343}{3}$ that's not there if you foil then integrate. Why would the +c be defined for u-sub but not for foiling then integrating?


Define a command that uses \st and can be used to wrap text containing \cite{...} macros

Using natbib together with hl or st from soul (or soulutf8) produces Argument of \@citex has an extra }. [{\st\cite] errors, as already mentioned in .  While a solution is to wrap all the \cite commands with an additional pair of curly brackets, or when this fails with \mbox, this solution may not be very convenient.  Consider in particular the situation in which we have a document, in which for some reason we are forced to use natbib for the references (like what happens when using revtex document classes). We have lots of text with lots of \cite in it. We want to define a command \remove that highlights text to be removed, with something like \newcommand{\remove}[1]{{\color{red}\st{#1}}}.  To use this command in blocks of text containing lots of \cite can be very annoying, requiring to wrap all of them with brackets or \mbox. Is there a way to define a "smarter" command that can be used over \cite without modifying the original text?    A MWE of the problem of using \hl and \cite together is already given in the linked question, but I'll include another just for completeness:  Tex file:  \documentclass{article}  \usepackage{soulutf8} \usepackage{natbib}  % how can I more smartly define this command, to use it to wrap text containing \cite{...}? \newcommand{\remove}[1]{{\st{#1}}}  \begin{document}  \remove{\cite{foo}}  \bibliography{bibliography} \end{document}   bibliography.bib:  @article{foo,  author = {SomeGuy},  journal = {Somewhere},  title = {Foo} }


Can I connect 3 displays to a late 2012 Mac Mini?

I have the late 2012 Mac Mini, which has a HDMI port and a Thunderbolt port.  I have 3 1080p monitors that each have DVI, HDMI and VGA. Is it possible to connect them to my Mini, no mirroring?


Example of a surjective local homeomorphism that is not a covering?

Let $X$ and $Y$ be connected, locally path connected, and Hausdorff topological spaces. Can someone give me an example of a surjective local homeomorphism that is not a covering?  I don't think this is the same question as ? There's different conditions?


Getting windows 8.1 installer to recognize the OEM key in Bios

We are switching our environment from windows 7 to windows 8.1 and I have a bunch of Dell computers I need to roll out with windows 10 pro keys in the bios that I have to install windows 8.1 pro on. According to these 2 articles from both Dell and Microsoft this is possible:      The instructions in these articles don't work the installation will always ask for a key and when you call Dell to ask how to do it they tell you to follow the instructions in these articles.  What I need is:   A way to cleanly install and activate windows 8.1 on these computers To automate to process using windows deployment tools   This is not a question about licensing I am trying to figure how to get the windows 8.1 installer to recognize the OEM key in the bios. This isn't a question about if I am in entitled this license or not, I already confirmed with Dell and Microsoft support that I am. I wanted to know I just needed to know how to get the installer to see the license in the bios


For teens, in this case a rising Junior in High School, is it appropriate to set a bedtime for him of 10PM? How does this compare with the majority of teens?


How can I transfer Skype conversations from an old user profile to the new one?

I had to create a new user profile on my Ubuntu 14.04 (Xubuntu) because I was getting so many errors in the original one it was impossible for me to work.   Since I work with Skype every day, I need to transfer the stored Skype conversations from the old user profile to the new one, but I don't know how to do that or even where I can find them.  I will be very thankful for precise explanations.


How should the end of a question be punctuated if the last word is an abbr.?

The question itself is an example, but it isn't the best example  Have you ever visited D.C.?   or  Have you ever visited D.C?   Both look wrong to me. The former has double punctuation, which is against the rules, at least most of the time. The latter doesn't have a period indicating that the C is an abbreviation.


IsoMetric Map draw: sort with Z-Buffer and anchor point

I'm writing an IsoMetric renderer for my html5 isometric game. The isometric renderer should be able to render objects with floating point coordinates.  SOURCE:   As now, the renderer works pretty well, but I have some questions and a problem to fix. Note that little square is the anchor point, and lines are AABB (not correctly drawn I think).  THE PROBLEM  If you have a look at the demo, you should note that when the dragon is behind the tree on a higher level, it will be rendered over the tree instead of behind, as expected.    As you can see in js/mmo/renderer/IsoEntity.js#L91 and js/mmo/renderer/IsoLayer.js#L65, i have a "rough" implementation, and maybe it is'nt good. I've googoled around and find something called "topological sort", i've attempted to implement it, but it does'nt seems to solve.  For each tile I have information about minX, minY, minZ, maxX, maxY, maxZ. An AABB as you can notice.  THE QUESTION  My question is, how can I solve this problem? Is it better (and will be faster) to maybe implement a depth-buffer? And how can I implement it? Will it ensure high performance? Maybe will a correct anchor point (represented with little square) solve the problem?  Thanks for any help! :D


I need to show my website with a "theme" when in header's requests is present a particular key/value.   In Drupal 7 I do this via themekey, but this module does not exist in Drupal 8.   Are there alternatives, or other ways to do this?


Setting private member pointer to the same class as NULL?

I came across the following structure in a C++ library:  In myClass.h  class myClass { public: static myClass* Instance(); . . private: static myClass* _instance; . . };     and in myClass.cpp  myClass* myClass::_instance = NULL;  // followed by the all other functions..  myClass::myClass() {     .     . }  myClass* myClass::Instance() {     if (_instance == NULL) {         .         .     }     .     . }     So what is the use of making the _instance to be NULL pointer outside any function? And when is this line of code executed?   Thank you.   Edit: Adding the main function. And the instance function in myClass.cpp that checks for the value of the pointer. Still don't understand when the pointer get set to NULL though.  int _tmain(int argc, T_CHAR* argv[]) {  myClass* instance = myClass::Instance();  . . .  return 0; }


The graph my code (below) is trying to reproduce is \frac{2}{\pi}\arctan{x} but all it creates is a line that shoots up into the y-axis. What is wrong with my graph and how do I fix it? \begin{figure}[H]     \centering         \begin{tikzpicture}         \begin{axis}[grid=both,                   xmin = -.5, xmax = 10, ymin = 0, ymax = 2,                   axis lines=middle,                   enlargelimits]         \addplot[black] (11,0) node[above left] {$x$};         \addplot[black] (0,2.2) node[below right] {$\dfrac{\mathrm{d}x}{\mathrm{d}t}$};         \addplot[red,dash pattern=on 8pt off 8pt, domain=-15:15]  {1} node[above left]{$y=1$};         \addplot[blue,samples=1000,domain=0:15]  {atan(x)*((2))/(pi))};         \end{axis}         \end{tikzpicture}         \caption{The graph of $\dfrac{\mathrm{d}x}{\mathrm{d}t} = \frac{2}{\pi}\arctan{x}$}         \label{fig:logistic6}     \end{figure}


Google notification error "Unusual traffic from your computer network"

While browsing I have received notification on Google "Unusual traffic from your computer network"   We're sorry..."your computer or network may be sending automated queries. To protect our users, we can't process your request right now." See Google Help for more information.  Right now I am using the "Ubuntu 12.04" 32 bit version.  Any suggestion, why this is happens & How it resolve?  Thank you for your worthy suggestion.


Exploring long-term associations in STATA

I am looking at the long-term association between a diagnosis of depression and smoking status. I have data collected from the same participants at 2 points in time (i.e. 2 occasions). My data is in long format, here is a list of my variables:  pt_id : unique participant id occ: 1 (baseline - occasion 1), 2 (follow up - occasion 2) smoking_status: 1 (yes), 0 (no) depression: 1 (yes), 0 (no)  I realise that I can used mixed effects modelling for this; however, I am not familiar with multilevel modelling in the context of longitudinal data. Would any of the below alternative be appropriate: Using the svy command, as such: svyset pt_id svy: logit depression smoking_status i.occ, or Using robust/sandwiched SEs, as such: logit depression smoking_status i.occ, or vce(cluster pt_id)


I want to compute this integral $$\int_0^\pi \frac{\cos(2t)}{a^2\sin^2(t)+b^2\cos^2(t)}dt$$  where $0<b \leq a$.  I have this results $$I_1=-\frac{ab}{2\pi}\int_0^\pi \frac{\cos(2t)}{a^2sin^2(t)+b^2cos^2(t)}dt=\frac{a}{a+b}-\frac{1}{2}$$ But I don't know how to prove this equality.  Which can help me, Thanks for all.


Trying to understand velocity addition and time dilation

I'm familiar with Einstein's formulae $V=\frac{u+v}{1+ \frac{uv}{c^2}}$ and $\Delta t'=\frac{\Delta t}{\sqrt{1-\frac{v^2}{c^2}}}$, the former being velocity addition and the latter being time dilation. Each of these equations imply that you can't go faster than light; the former cannot exceed $c$, and the latter will give an imaginary number in the denominator if you try.  But why are these formulae true? I understand it numerically, but how would you explain this conceptually?


Remove blog-like recent content from  page

Is there a straightforward way to remove the default content, ie recent posts list, from the front page?  I've read about creating my own page and assigning certain blocks to that page and then setting it as the default starting page.. but I've already got my homepage mostly set up and wondered if it would be easy to do it the other way so I don't have to change all my other settings.


I'm very new to blender, and I have this problem where I have unwanted indenting on my donut icing. I don't know what caused this, and I don't know how to get rid of it either. It looks like this:  Thanks in advance.


How to get rid of Level3 Search engine from Chrome?

Each time when I type some non-existing domain name in Chrome bar address, I'm redirected to  .  For example when going to: , I'm getting the immediate redirect to: http://searchguide.level3.com/search/?q=http%3A//javauto.org/&r=&t=0 with some ads and meaningless results.  I don't know how this got installed. I don't have any Level3 extensions and I use DuckDuckGo as my default search engine.  How can I remove this Level3 search engine from Chrome? As this is very annoying.      To clarify, my default search engine is set to DuckDuckGo:    And Level3 doesn't exist on the main search settings list, either on Other search engines list.      Here is my DNS configuration:  $ cat /etc/resolv.conf  nameserver 4.2.2.1 nameserver 8.8.8.8 nameserver 8.4.4.2     I've checked the other , but it's not duplicate, because:   It talks only about Windows workarounds. DNSUnlocker and Malwarebytes are Windows apps. The first answer is actually one sentence question. To clarify, I don't have any fishy extensions or malwares. It also happens in incognito mode.   Yes, I'm using Google DNS, but I don't know how removing it would solve the issue.    This is also not duplicate of , because I don't have any malware on my macOS. Believe it or not, I really know when I have one (already checked with launchctl and ps). So this problem has nothing to do with viruses as linked Windows post says. In this post at  it's suggested that it's caused by using free DNS and that ISP is forcing the redirect (NXDOMAIN record). Please reopen, so I can share my solution once I find one.


How two electric charges know about each other?

Suppose we have two electric charges $q_1$ and $q_2$ a distance $r$ apart in euclidean three-space. Coulomb's force law states that there's a force  $$\mathbf{F}_{12} = \dfrac{1}{4\pi\epsilon_0} \dfrac{q_1q_2}{r^2}\hat{\mathbf{r}}$$  between them. Now, what I'm wondering is how the two charges know about each other? How can one charge know that there's another charge there exerting a force over it? One way I believe could explain this was: "charge $q_i$ generates an electric field $\mathbf{E}_i$ which is felt by charge $q_j$" but this ends up bringing two other questions:   The electric field is introduced more as a mathematical object than a physical object. We introduce the field $\mathbf{E}$ so that the force exerted on a charge $q$ is $q\mathbf{E}$. The field itself can then be considered the force per unit charge with this charge made small enough so that it won't change the original configuration. In that case, what it would really mean to generate a field and percept a field? Even if we explain with the field, the second question naturally is: how the other charge knows that a field is there and how this field interacts with it really?   I didn't study quantum field theory yet, however, I imagine the more fundamental explanation would have to do with photons intermediating the process by which one charge feels the other. Is it really the case? How can we really understand how two charges know each other and by which mechanism they interact?


Is a right inverse of a surjective linear map linear?

On a finite dimensional vector space, the answer is yes (because surjective linear map must be an isomorphism). Does this extend to infinite dimensional vector space? In other words, for any linear surjection $T:V\rightarrow V$, AC guarantees the existence of right inverse $R:V\rightarrow V$. Must $R$ be linear?  How about $T:V\rightarrow W$ linear surjection in general?


public void DisplayValue<T>(T field, string fieldname)   What does T stands for in above code?  Whats the benefit to do so?  Where we can use this?


"NG NS" on ticket after airport security

I went through security at the Sacramento Airport with a friend. He got something written on his boarding pass "NG NS". I didn't have that. We both went through the same metal detector, neither beeped nor had random checks. Flying to Edmonton through Seattle connection. Early for flight.  I have tried searching for "what is tsa ng ns" on Google but nothing useful came up. Any ideas?


C# - How do closures work in lambdas and how does the garbage collector deal with them?

In Java, modifying a local variable like this would result in: Local variable i defined in an enclosing scope must be final or effectively final  However, the same code translated into c# works as expected int i = 0;  Timer timer = new Timer(1); timer.Elapsed += (source, arg) => {     i++; }; timer.AutoReset = false; timer.Enabled = true;  Console.WriteLine(i); System.Threading.Thread.Sleep(100); Console.WriteLine(i);   0 1  How does this work, and how is it different than the same code in Java? How does the Garbage Collector know when to dispose of variables such as i?


I would like to paraphrase a sentence:     "This is how the costs of each course should be."   So my idea was:     "This is how the price/prices per course should be."    What are the differences between singular + per vs. plural + per?  Or  If you have better paraphrases, you're very welcome to share them.  Thank you :)


released 0.95 in June 2015 and 1.0 in May 2016, yet all I find for packages are various compiles of 0.91. Is there a problem with versions 0.95 and/or 1.0 that preclude any of debian-dom from using a recent driver?  Edit:  This is different than questions/answers about basic version-lag (e.g., ). That link discusses individual ubuntu releases, but the last release to FreeTDS was two full Ubuntu releases ago. The last version change in the freetds package was over four Ubuntu releases ago.  It appears that this package is being held back because (a) debian has not updated it, and (b) ubuntu has not. I understand version-lag and feature-freeze. That is not my question. There are definitely examples of second-order side-effects where upgrading a library cascades harshly through many applications that depend on it.  My question, restated: what incompatibilities are there in newer versions of FreeTDS that might be holding back a package update?  I'm expecting an answer along the lines of:   v0.95 (and above) break applications X, Y, and Z, so it is being held back pending fixes. There are no known problems. There has been no perceived need to upgrade it. The maintainers have not been concerned enough with TDS versions above 7.1 (e.g., SQL Server > 2000 and Azure use 7.2-7.4, with ) to put in the effort.   I'm not concerned with #2, it's perfectly understandable (with an easy workaround: compile it manually and do not rely on package management). I'm nervous about #1, where I may be bitten in the future.


Why is the (non-relativistic) stress tensor linear and symmetric?

From :     "[...] the stress vector $T$ across a surface will always be a linear function of the surface's normal vector $n$, the unit-length vector that is perpendicular to it. [...] The linear relation between $T$ and $n$ follows from the fundamental laws of conservation of linear momentum and static equilibrium of forces, and is therefore mathematically exact, for any material and any stress situation. The components of the Cauchy stress tensor at every point in a material satisfy the equilibrium equations (Cauchy’s equations of motion for zero acceleration). Moreover, the principle of conservation of angular momentum implies that the stress tensor is symmetric."   What is the more detailed explanation for this, and/or where can I find it?


Python - Removing the Duplicates from Nested Lists (within Individual LIST Item values)

Please note, similar question to this particular one is Not present here already. But different ones present. So posting the question for suggestions. Its for removing the Duplicates from Individual List item from the Nested List and preserving the order. Please see below question for more details and suggest. list_1 = [['A1', 'B1', 'A1'],           ['A2', 'B2', 'B2'],           ['A3', 'B3', 'C3']]  First item in list_1 has 2 'A1's and Second item has 2 'B2's and no dupes in Third item. So need to eliminate the dupes from First & Second items and also order needs to be preserved. Expected output list as below: list_op = [['A1', 'B1'],            ['A2', 'B2'],            ['A3', 'B3', 'C3']]  Note: Below solution is removing the Dupes as required from Nested List, but Not preserving the order within Individual List items, after dupes removal. [list(set(sub_list)) for sub_list in list_1]


Many elliptic-curve cryptosystems today use GF(p) or GF(2^m). What if, say, we use big floating numbers with the classical point addition formulas - is a cryptosystem possible to build on that?


$$1^3+2^3+\cdots+n^3=\left[\frac{n(n+1)}2\right]^2$$  so far I have..   $$1^3+2^3+\cdots+k^3+(k+1)^3=\left[\frac{(k+1)(k+2)}2\right]^2$$  then..   $$\left[\frac{k(k+1)}2\right]^2+(k+1)^3=\left[\frac{(k+1)(k+2)}2\right]^2$$  where do I go from here so that the rhs equals the lhs?


Hi i am having some trouble with a piece of code of mine and ive been trying to google the answers but for some wierd reason i cant get this to work properly.  The current code is working, but it does not stop the search when it found the "offline" in the txt file making it rather pointless as the programs pings a number of ip addresses and when it finds a offline unit has to mark the store name in red to notify the technician monitoring the stores. what happens is it scans the file created and changes the color from red to green for each line. instead of searching for the word offline and once found stop the search and change the color.  so my question is how do i make this stop once it found the first line containing offline?  the code i have so far is this please oif you can see my mistake please let me know.  var filename = "C:\\Scales\\scalecheck.txt"; var searchTarget = "offline"; foreach (var line in File.ReadLines(filename)) {     if (line.Contains(searchTarget))     {         var test = storeNumber;         var labels = Controls.Find("storename" + test, true);         if (labels.Length > 0)         {             var label = (Label)labels[0];             label.ForeColor = Color.Red;         }     }     else     {         var test1 = storeNumber;         var labels = Controls.Find("storename" + test1, true);         if (labels.Length > 0)         {             var label = (Label)labels[0];             label.ForeColor = Color.Green;         }     }


TP-Link AC600 Archer T2U Nano driver for Ubuntu 18.04

I am looking for a driver for the TP-Link AC600 Archer T2U Nano, on Kubuntu 18.04 (kernel version 4.15.0-51-generic).   I already tried different drivers, none of them worked.