How do you block the latest popups (not sure if they're FLASH based, etc.)

I'm using FF 3.5 and have popup blocker enabled. But I'm still getting popups. I'm guessing their flash based. The real annoyance is that they cover the text of the website and (in some cases like the one below) don't have a "close" button.  An example of a popup that appears and annoying covers the text.


is there a library to print blank calendars?

I would like to be able to easily generate calendars like the following:     Is there some package or library to easily generate something like this, given the initial year and month?  TiKZ has a calendar library, but it does not generate the the desired layout.


Removing Unnecessary Services & Packages in a MySQL Ubuntu 12.04 Server

As part of hardening a standalone/dedicated MySQL 5.6 server running on Ubuntu 12.04 LTS, unnecessary services and packages will have to be removed.  For a server that is serving only as a MySQL server, what services and packages should we remove? Is there a list of services/packages that we can use?  Here's a list of services running (?). Which are the ones them look like they could be stopped and their packages removed?  [ ? ]  acpid [ ? ]  anacron [ ? ]  atd [ - ]  bootlogd [ ? ]  console-setup [ ? ]  cron [ ? ]  cryptdisks [ ? ]  cryptdisks-early [ ? ]  cryptdisks-enable [ ? ]  cryptdisks-udev [ ? ]  dbus [ ? ]  dmesg [ - ]  grub-common [ ? ]  hostname [ ? ]  hwclock [ ? ]  hwclock-save [ - ]  keymap.sh [ ? ]  killprocs [ ? ]  module-init-tools [ ? ]  network-interface [ ? ]  network-interface-container [ ? ]  network-interface-security [ ? ]  networking [ ? ]  ondemand [ ? ]  passwd [ ? ]  plymouth [ ? ]  plymouth-log [ ? ]  plymouth-ready [ ? ]  plymouth-splash [ ? ]  plymouth-stop [ ? ]  plymouth-upstart-bridge [ ? ]  procps [ ? ]  rc.digitalocean [ ? ]  rc.local [ ? ]  resolvconf [ - ]  rsync [ ? ]  rsyslog [ ? ]  sendsigs [ ? ]  setvtrgb [ + ]  ssh [ - ]  stop-bootlogd [ - ]  stop-bootlogd-single [ ? ]  sudo [ ? ]  udev [ ? ]  udev-fallback-graphics [ ? ]  udev-finish [ ? ]  udevmonitor [ ? ]  udevtrigger [ ? ]  umountfs [ ? ]  umountnfs.sh [ ? ]  umountroot [ - ]  unattended-upgrades [ - ]  urandom


Pokemon Go opens perfectly and starts up just fine on my iPad Air which DOESN'T have cellular data. I read the App store page for it and it said it was compatible with iPad. But after it loads, it says "no GPS connection" because of my layered roof, so I go outside.   It then stops saying no GPS connection, but then says no internet connection. I can walk around with it saying no internet, but the game doesn't start without internet, and I've read online that Pokemon don't spawn without internet. So I really can't play the game on iPad. No, I can't get cellular data, or any kind of portable router. Is there something I don't know that I could do?


What would be a better way to filter out non-hexadecimal characters from a string?

I just tried out PVS-Studio on my C# project and it pointed out this function that screens for valid hexadecimal characters.  Originally the logic allowed all characters, but after fixing it I can't shake the feeling that there is a better way to do this.      string ValidHex()     {         string str = foo.Value;         for (int index = 0; index < str.Length; index++)         {             if (Char.IsDigit(str[index]) == false)             {                 if ((str[index] >= 'A' && str[index] <= 'F') ||                     (str[index] >= 'a' && str[index] <= 'f'))                     continue;                 else                     return "Invalid Hex value";             }         }         return null;     }   I know I can't improve the time complexity, but is there a less awkward way to screen these ASCII values?


My iPhone 4S is suddenly locked and it asks for Apple ID and Password. When I added them, it says my Apple ID can't activate my phone.  I can't see my iPhone listed on Find My Phone page on iCloud.com. But on my phone it is bound to that Apple ID.  Are there other ways to activate?


Group of invertible elements of a ring has never order $5$

Let $R$ be a ring with unity. How can I prove that group of invertible elements of $R$ is never of order $5$?   My teacher told me and my colleagues that problem is very hard to solve. I would be glad if someone can provide me even a small hint because, at this point, I have no clue how to attack the problem.


Difference between +1+1 and +1+1 counters

Is there a difference between creatures receiving 2, +1+1 counters and recieving +2+2. My problem is that Jarad, Golgari Lich Lord recieves +1+1. But if I also have Corpsejack Menace, would that double the amount of power and toughness received?


How long can I keep a beer in the secondary before it won't be able to be bottle conditioned?   How can I tell if it has been too long and need to pitch fresh yeast to bottle condition?   but the answer is a general guideline.  Do I just put it in the bottle and hope?  In theory, there would be some yeast still in suspension for quite a while and I would be able to condition but it would just take longer.  I am looking for a more specific way to make the determination other than waiting and opening flat bottles of beer for a while.


For all $x,y\geq 0$ show that $\frac{x^2+y^2}{4}\leq e^{x+y-2}$

How do I show that for all $x,y\geq 0$, $\frac{x^2+y^2}{4}\leq e^{x+y-2}$? Tried using the mean value theorem but couldn't figure out how to use it properly.


How to extract a particular word after 7th slash in a path using regex

I have different paths in a column like below:   'E:/R_Process/R_Input_UDM//Greater Europe/CEW Hub/Austria/Toothpaste/Variant Data/AUSTRIA_SHG_VARIANT_8.csv' 'E:/R_Process/R_Input_UDM//Greater Europe/CEW Hub/Austria/ManualTB/Variant Data/AUSTRIA_SHG_VARIANT_7.csv' 'E:/R_Process/R_Input_UDM//Greater Europe/CEW Hub/Austria/MouthWash/Variant Data/AUSTRIA_SHG_VARIANT_9.csv'   I want Toothpaste from 1st path, ManualTB from 2nd, and MouthWash from 3rd.  There are many more paths around 30 every from every paths I want the word from 7th slash.  How can I do this using regex?


Limit of partial sums: $\lim_{n\to\infty} \frac1n\sum_{k=1}^n f(k)=0$ if $\lim_{k\rightarrow\infty}f(k)=0$

I want to argue that  $$\lim_{n\rightarrow\infty} \frac{1}{n}\sum_{k=1}^n f(k)=0~~~~~~~ {\rm if}~~~~~ \lim_{k\rightarrow\infty}f(k)=0.$$  This identity does not seem to hold always, but seems to hold in practice based on my experience. I guess there should be some conditions to make this identity hold.  For example, I think $f(k)$ may have to converge to zero uniformly, not pointwise. Or $f(k)$ may have to be an uniformly continuous function of $k$.  Can anyone help me set up the conditions and prove the identity?


Blender exported gltf model doesn't look as it should

I followed a course and managed to create a 3D model,this is my very first attempt.I rendered the image ,it was all good.But when I tried to view it on a gltf viewer,it does not appear to be same as the rendered image.I would really appreciate if someone could help me with this,since I am a beginner,stuck up with this and not being able to figure out the issue.


I'm trying to provide a link to my company's website from a Windows Form.  I want to be well behaved and launch using the user's preferred browser.  What is the best way to open a URL in the user's default browser from a Windows Forms application?


How can you change a variable inside a function scope? Javascript

I am new to JavaScript and I am making and idle game and what I want to do is to change the value of a variable inside a function wich is called by an event listener like this:  const foo = (x) =>{     x = x + 1; } foofoo.addEventListener("click", function(){foo(x)})   where x is a variable is this possible?


Prove that $2^{3^n}+1$ is divisible by $3^{n+1}$ for any non-negative integer $n$.

$2^{3^n}$ must be 2 mod 3, which it must be since it is 0 mod 2. However, for certain cases, this does not hold, and I have trouble showing why.


I have an application that needs root permissions to run.  No biggie, all of my personal devices are rooted, so I am very comfortable with the process. The problem is that this application is to be used on company owned devices issued to certain employees and I don't want them to be able to uninstall the application nor do I want them having root access to the device.  I was thinking that the following process would accomplish my goals:   Root the device Install my app as a system app Launch the application and grant su rights to it Unroot the device   Since it would be a system app, and the device wouldn't be rooted, users would be prevented from removing the app.  What I am unsure of is whether or not that application would retain its root privileges once the device is unrooted?   Any feedback or insight would be greatly appreciated!


I noticed that there isn't newest questions in the questions page. But in front page, those new questions are displayed. Image:    Is this a bug?


Am trying to run eclipse in maverick but a dialog box says that version 1.7.0 or later is needed to run Google plugin for Eclipse. My mac has version 1.6.0 when I run java -version from the command line.  I downloaded the latest Java  , installed it but still the JRE is 1.6.0. What could be the solution?


Nothing is so happy as to hear from your family. Nothing is so happy as hearing from your family.  Which is more natural for native speakers?


Embedding images with an encoding algorithm

Friends, sometimes I had to create a self-contained PHP script. That means the PHP script could have any files within it due to some encoding/decoding algorithm, like Base64. For example,  is a Base64 encoding of this tiny image:   Of course, in this particular case, PHP can handle that huge encoded string because it has a bundled  function.  I was wondering if this idea is possible to achieve somehow in TeX/LaTeX. I need to point out that I'm just curious on this subject, not that I want to embed whatever in code. Besides, as you noted, the encoded string is huge, so that'd surely make people cry blood.  One possible solution I see is if somebody implement an encoding/decoding algorithm in TeX/LaTeX, like \base64_decode, so it would be possible to use something like this: \includegraphics{\base64_decode{\myhugeunreadablestring}}. Sorry for the acid trip ticket, but I'm really curious on how this insane code would work. =)


It seems that the Amazon onebox doesn't truncate text. Pasting a product link with a particularly long description results in a rather large onebox:    For comparison, a long question from somewhere on SE will have its content truncated, so that the box doesn't get so big:    (Yes it's a similar question, but I don't believe it's a duplicate. )  Can it be made so Amazon oneboxes have a limit set for the description shown, so the box isn't quite so large when the seller has a lot to say?


According to Gauss's law in magnetism, we know that there is no magnetic monopoles. But my teacher told in the class that magnetic monopoles exists but he didn't told us where instead told to search and find. Do magnetic monopoles exist anywhere on Earth?


Does PostgreSQL do the caching like applications do?

Applications usually cache data on an implementation of hash data structures to speed up the query, typically Memcached or Redis. Does relational databases also do the same things internally?  For example, if I do the select * from account where id = 1 where id isn't indexed or b-tree indexed, does the engine caches the result to the cache using the key like account_id_1 so that the subsequent same queries could return the result from the cache until it's invalidated?  I'm asking this because I saw the following from the , and wondered whether that feature is something new for FoundationDB or relational databases have been doing this also although it's not distributed:     Distributed Caching      When your database scales out, you don’t need a separate distributed   caching layer: you already have one. FoundationDB uses the aggregate   memory of the entire cluster to cache commonly accessed data. Unlike a   caching tier such as memcached, FoundationDB’s cache is completely   synchronized to the database and provides all ACID guarantees.


Temporarily reduce physical RAM size in Redhat 5 for testing

How to reduce the physical RAM size in RHEL 5.7?  I would like to reduce the memory for testing


I have plenty space on my HD 420 GB but very little for boot directory & i can't upgrade to ubuntu 16.04 what is the eseyist way to inlarge the boot directory?


I am new to ubuntu I now have ubuntu 12.04 and I want to upgrade them to 12.10 and then to 13.04. So I follow some steps I installed 12.10 but when I reboot it I couldn't login and all I get was a black screen and nothing else. I pressed alt+ctr+f1 I logged in and I could use the terminal. So I reinstall 12.04 from usb and I need to know what to do to upgrade them successfully...   From a quick search I think that this is a problem from graphics card. I have ATI Radeon hd 5500 and also when I opened them I could see the purple screen and then it turned black and I couldn't do anything. Sorry for my really bad english too.


Here's what i know (or think i know) about the factoring.  For integer $n> 1 $   1) If $n$ is a positive power of $2$ then it is irreducible.  2) If $n$ is an odd prime then $$x^n + y^n = (x + y)(x^{n-1} - x^{n-2}y + \cdots - xy^{n-2} + y^{n-1} ) $$  3) If $n$ has an odd prime factor then it is factorable but the factorization is more complicated , for example  $x^{14} + y^{14}$ has 2 distinct irreducible factors and $x^{15} + y^{15}$ has $4$ distinct irreducible factors.  Is there a connection between the prime factorization of $n$ and the number of distinct irreducible factors of $x^n + y^n$ ?  Is there a connection between $n$, AND the number of distinct irreducible factors , AND the highest power occurring in each factor? Example:   $$x^{15} + y^{15} = (x + y)(x^2 - \cdots)(x^4 - \cdots)(x^8 + \cdots)$$  In other words , i'm also asking if there is a connection between $n = 15$ , the number of factors $4$ , and the powers $\{1 , 2 , 4 , 8\}$  For this particular example the numbers work out nicely but i'm not sure the pattern is so obvious in general.  Thank you for your consideration in this matter.


Is it ok to write a professor again who did not reply me yet?

I have written a professor who has an available Ph.D. position with my CV. After 3 days the professor replied with an apology for being late and said she went through my CV carefully and my work aligns very well with the project she is offering. She asked me to apply for the scholarship. Also asked if I would like to discuss the project with her in zoom or skype. I replied to her that I am interested. Its been a week that she did not write me back. Is it ok to write to her again? If yes, how to address it?


Is there a way to put spaces in a scoreboard player name?

Note that this is only focusing on Minecraft Java Edition, and for versions 1.13+. I am predominantly looking for a solution that does not require any external programs (like MCEdit or NBTExplorer) and will work in just plain vanilla Minecraft, although if the only solution doesn't fit these criteria, I'll still take it (since having a solution is better than no solution!) Essentially, I am looking for a way to put a phrase (meaning essentially there are two or more words and spaces are involved) on a Minecraft scoreboard. This is what I mean by 'phrase': One two three, 1 2 3 These are not 'phrases': OneTwoThree, One-Two-Three, One_Two_Three, 1-2-3, etc. However, it seems like the only way to add text to an objective on the scoreboard is to add a "fake player", via /scoreboard  players add [playername] [objectivename] [score], which shows the [playername] and the [score] part of the command on the scoreboard. However, since player names can't have spaces at all, it means that you can't have a phrase shown on the scoreboard. I have seen on many servers scoreboards that do have phrases listed on the scoreboard, but I have no idea how they do this (probably because of plugins that can do this sort of thing).  I did notice that teams can be given display names that can have spaces, so is there a way to display the team name on the scoreboard (thus being able to put phrases on there?)? Overall, my main question would be "Is there a way to use spaces on the scoreboard (excluding the objective name) in vanilla Minecraft?


Align bar graph with error bars in groups on Y-axis

Am trying to align this in group of 3's but a bar in the AAAAAAAA group keeps going off alignment.   Note: I have checked  ,  and   and they don't answer my question - our data input format is different.  MWE:    \definecolor{bblue}{HTML}{82B1FF} \definecolor{rred}{HTML}{FF8A80}  \begin{filecontents}{testdata.csv} ALB,VAL,ERR,COR AA,20.61,0.32,bblue AA,20.88,0.55,bblue AA,20.41,0.29,bblue AAA,26.22,0.94,bblue AAA,26.43,0.45,bblue AAA,26.86,0.61,bblue AAAA,29.91,0.76,bblue AAAA,30.39,0.11,bblue AAAA,30.11,0.49,bblue AAAAA,34.71,0.43,rred AAAAA,34.87,0.99,rred AAAAA,34.81,0.26,rred AAAAAA,40.33,0.64,rred AAAAAA,40.18,0.03,rred AAAAAA,40.4,0.83,rred AAAAAAA,45.77,0.47,rred AAAAAAA,45.93,0.95,rred AAAAAAA,45.35,0.3,rred AAAAAAAA,50.35,0.13,rred AAAAAAAA,50.34,0.85,rred AAAAAAAA,50.66,0.55,rred \end{filecontents} \pgfplotstableread[col sep=comma]{testdata.csv}\datatable \makeatletter \pgfplotsset{     /pgfplots/flexible yticklabels from table/.code n args={3}{%         \pgfplotstableread[#3]{#1}\coordinate@table         \pgfplotstablegetcolumn{#2}\of{\coordinate@table}\to\pgfplots@yticklabels         \let\pgfplots@yticklabel=\pgfplots@user@ticklabel@list@y     } } \makeatother \begin{figure}  \begin{tikzpicture} \begin{axis}[     ylabel=A labels,  y label style={at={(-0.1,0.5)}},      y = -0.3cm,     ybar, %=2*\pgflinewidth,     draw opacity=0.5,     bar width=6pt,     enlarge y limits={abs=7pt},     xbar,      width=.36\textwidth,     xlabel= unit,     %flexible xticklabels from table={testdata.csv}{ALB}{col sep=comma},      flexible yticklabels from table={testdata.csv}{ALB}{col sep=comma},     yticklabel style={font=\small,xshift=0.5ex,  anchor=east},       %xtick=data     ytick=data,     xmajorgrids ] %\pgfplotsinvokeforeach {0}{     \addplot     %style={color=cyan,fill=bblue,mark=none};     plot [error bars/.cd, x dir=both,x explicit ]          table[y expr={(\coordindex) - mod(\coordindex,3)/8},x=VAL, x error=ERR ] {\datatable};  \end{axis}  \end{tikzpicture}  \end{figure}


security camera power by solar regulator

i have a solar panel with regulator to run a a light as well as charge a battery. i want to add a security camera which uses a power supply of 9 volt dc and 600ma. instead of using an inverter and camera power supply would it not be more effiiceint to simply stepdown the 12 volt to 9 volt? i found a dc stepdown from 12 v to output of 9V with 2Amps. will this be okay and not damage camera?


How to set Python 3 as default on Ubuntu 16.04

According to the  Ubuntu 16.04 uses Python 3 by default and should not even include include Python 2:  Python 3 Python2 is not installed anymore by default on the server, cloud and the touch images, long live Python3! Python3 itself has been upgraded to the 3.5 series.  However, the command line tells me that not only is Python 2 installed, it is actually the default interpreter: $ python Python 2.7.11+ (default, Apr 17 2016, 14:00:29)  [GCC 5.3.1 20160413] on linux2 Type "help", "copyright", "credits" or "license" for more information. >>>   What would be the correct way to set Python 3 as the default interpreter for the whole system? Please do not ask me to create an alias in .bashrc, that is a lame workaround at best.


Finding the value of $\int_0^{\pi/2} \frac{dt}{1+(\tan(x))^{\sqrt{2}}}$

The problem: Find the value of $\displaystyle\int_0^{\pi/2} \frac{dx}{1+(\tan(x))^{\sqrt{2}}}$   I tried a few different substitutions and the closest I got to an okay looking integral is $$\int_0^\infty \frac{t^2 \, dt}{t^{1/\sqrt{2}}(1+\sqrt{t})},$$ which still looks scary. How do I approach this integral?


Fedora 25 workstation does not default to wayland using nouveau on nvidea card with gnome

After upgrading both a desktop and laptop from Fedora 24 to fedora 25 I had verified that wayland could be set and tested some development code on it.   Developer apps and debug repositories were added over time.  After the numerous updates that occur when a new version is released I was testing some development code and noticed that the Xserver was being used and tried logging out of the desktop to gdm login screen and set wayland which fails to start.   The ps axf command on the desktop now shows   979 ?        Ssl    0:00 /usr/sbin/gdm  1272 ?        Sl     0:00  \_ gdm-session-worker [pam/gdm-launch-environment]  1294 tty1     Ssl+   0:00  |   \_ /usr/libexec/gdm-x-session gnome-session --autostart /usr/share/gdm/greeter/autostart --debug  1296 tty1     Sl+    0:01  |       \_ /usr/libexec/Xorg vt1 -displayfd 3 -auth /run/user/42/gdm/Xauthority -nolisten tcp -backgr  1305 tty1     Sl+    0:00  |       \_ /usr/libexec/gnome-session-binary --autostart /usr/share/gdm/greeter/autostart --debug  1325 tty1     Sl+    0:02  |           \_ /usr/bin/gnome-shell  1423 tty1     Sl     0:00  |           |   \_ ibus-daemon --xim --panel disable  1427 tty1     Sl     0:00  |           |       \_ /usr/libexec/ibus-dconf  1503 tty1     Sl     0:00  |           |       \_ /usr/libexec/ibus-engine-simple  1452 tty1     Sl+    0:00  |           \_ /usr/libexec/gnome-settings-daemon  1546 ?        Sl     0:00  \_ gdm-session-worker [pam/gdm-password]  1572 tty2     Ssl+   0:00      \_ /usr/libexec/gdm-x-session --run-script gnome-session  1578 tty2     Sl+    0:21          \_ /usr/libexec/Xorg vt2 -displayfd 3 -auth /run/user/1000/gdm/Xauthority -nolisten tcp -back  1595 tty2     Sl+    0:00          \_ /usr/libexec/gnome-session-binary  1672 tty2     Sl+    0:18              \_ /usr/bin/gnome-shell   Verifying that even gdm has defaulted to X. Which in Fedora 24 was using wayland.  Not sure what changed to end up with defaulting to X on two development system computers.  No nvidea closed source drivers are in use, just the open source nouveav driver on both laptop and desktop.


Prove that the normalisation of $A=k[X,Y]/(Y^2-X^2-X^3)$ is $k[t]$ where $t=Y/X$ (Reid, Exercise 4.5)

This is a problem about finding the normalisation of a quotient polynomial ring. So I have to find the integral closure of the ring in its field of fractions. The problem statement is as follows:     Let $A=k[X,Y]/(Y^2-X^2-X^3)$. Prove that the normalisation of $A$ is $k[t]$ where $t=Y/X$.   Can I do this by showing that the field of fractions $\text{Frac} A$ of $A$ is equal to $k[t]$, and subsequently showing that the field of fractions is normal? (This could be done by showing that $k[t]$ is a UFD?)  I am lost at calculating/determining $\text{Frac}A$, or similarly proving that $k[t]=\text{Frac}A$. Also, how do I show that it is normal?  I hope you can help!


How do I let users be able to view, update and delete their own content?

I want to let users view a list of their own content and also be able to edit or delete them same as "/admin/content" page.  However, giving access to edit and delete their own content can be achieved using Node Access Rules or setting the access to user type at Permissions tab.  Thanks for the help.


When you learn a word and then recognize it

I'm looking for a word that describes when you learn a new word (or phrase or song) and then hear it all over the place. My daughter did not recognize either the melody or the name of the song The Girl from Ipanema. After playing it once (and watching this Adam Neely video, ), she began to recognize it in many novel contexts. Indeed, she couldn't unsee it. This is different from déjà vu (where you falsely recognize something) and jamais vu (where you don't recognize something familiar). I'd be happy with either a verb or a noun. Obligatory fill-in-the-blanks:  I learned the word schadenfreude and now I _____ (verb) it everywhere.   Never hearing the song, I saw a documentary on The Girl from Ipanema and now have a sense of ______ (noun).  I had a prof who was fond of saying, "When you build a better hammer, it's surprising how many things start to look like nails." This word should entail the concept of the transition from unrecognized to recognized, unfamiliar to familiar, once looking not-like-nails, now looking-like-nails.


What is the best practice writing simple site config file based on ServerName with HTTPS permanent redirect?   Do I need to check mod_ssl each time I redirect? Can we just use one common <VirtualHost *:*> block to solve HTTPS redirects?   <IfModule mod_ssl.c> <VirtualHost *:443>         ServerName example.com          ServerAdmin webmaster@localhost         DocumentRoot /var/www/html          ErrorLog ${APACHE_LOG_DIR}/error.log         CustomLog ${APACHE_LOG_DIR}/access.log combined          SSLCertificateFile /etc/server/fullchain.pem         SSLCertificateKeyFile /etc/server/privkey.pem         Include /etc/server/options-ssl-apache.conf </VirtualHost> </IfModule>  <VirtualHost *:80>         ServerName example.com          ServerAdmin webmaster@localhost         DocumentRoot /var/www/html          ErrorLog ${APACHE_LOG_DIR}/error.log         CustomLog ${APACHE_LOG_DIR}/access.log combined          <IfModule mod_ssl.c>                 RewriteEngine on                 RewriteCond %{SERVER_NAME} =example.com                 RewriteRule ^ https://%{SERVER_NAME}%{REQUEST_URI} [END,NE,R=permanent]         </IfModule> </VirtualHost>


UK Visa Refusal V4.2 Freelancer / Married / Permanent EU Resident

Over the summer 2020 a friend from the UK visited myself and my husband in Greece for a few weeks. The friend in trying to repay the favour has offered me the opportunity to visit her and her husband in the UK. We recently applied for a visa but it was refused under V4.2 (basically because I haven't worked in 2020 because of Covid).  I am a permanent Greek resident (Originally from Philippines) I am a freelance film maker who travels for work (normally), 2019 bank statements would show regular good income however because the jobs I get sent on are all over Europe / UAE I haven't had any work in 2020. I am married to Greek man who earns a good salary in Greece as an engineer. (He cant travel with me for reasons I wont bore you with) The friend I am visiting (my sponsor) owns her own business and has more than sufficient funds in her bank to support me in the UK.  In my first application we didn't really state or elaborate much on my freelance work or even the fact that I am married to an EU citizen who has obviously been the main earner in the house since I haven't been able to work due to Covid. So, I guess my question is, if I was to apply again and elaborate into further detail about my life / work would I realistically have a chance and being granted a visa or not..? Thanks a million for any advice / insight you can give.


Let $Z = (X, Y)$ be a random variable uniform inside circle of radius $R$. How to find cumulative distribution function (CDF) on disk?


Can this drain pipe be moved back closer to the exterior wall

The attached picture might show better, but I want to get as much room as I can and based on the current rough ins, it looks like the pipe comes out at an angle from the wall. Does it make sense to dig up the concrete and make a more vertical path? I'd like the framing to be more straight.  Here's the proposed layout (the left layout, ignore the other two). Basically I want a stand up shower on the left, toilet in the middle, and sink on the right. The drain going into the ground for the sink is what's throwing me off.   Added a new picture of wider angle.


Unable to set Terminator as default Terminal in Ubuntu with Cinnamon Desktop

I installed Ubuntu 20.04 from the official website and installed terminator using APT and It worked! Ctrl+Alt+T started terminator. Then I installed cinnamon desktop, rebooted and Ctrl+Alt+T came up with the default terminal, not with terminator. I changed the  priority to higher than the default emulator with sudo update-alternatives --install /usr/bin/x-terminal-emulator x-terminal-emulator /usr/bin/terminator 60, this also didn't work. sudo update-alternatives --config x-terminal-emulator gives this table: Selection    Path                             Priority   Status ------------------------------------------------------------ * 0            /usr/bin/terminator               60        auto mode   1            /usr/bin/gnome-terminal.wrapper   40        manual mode   2            /usr/bin/terminator               60        manual mode  What am I doing wrong? Is cinnamon interfering here?


Does $2^X \cong 2^Y$ imply $X \cong Y$ without assuming the axiom of choice?

A friend of mine told me that $X \cong Y \Rightarrow 2^X \cong 2^Y$ ($X$ and $Y$ being sets), which is very easy to prove, but he was wondering about the converse in ZF, i.e., can one take logarithms? Since the (apparently) simpler question of whether it is possible to divide by a natural number is not particularly trivial without assuming the axiom of choice (see Doyle, Conway: ), I would imagine that this problem doesn't have an easy answer either.


Option to hide the "Sorry, we no longer support Internet Explorer" banner?

Recently, official support for Internet Explorer ended. Ref this question (status-complete):    Due to dumb IT policies at work, out of my control, Internet Explorer is the only browser available to me. I'm a regular user of the site, and now I have to see this banner every time I visit, on every page I visit - without being able to close the banner or update my browser!    I understand the move to drop official support, and I understand the need for a banner, but can you please add a close button which hides it for at least the current browser session?  By example, Github has a similar message with a helpful "Ignore" button:


Proving that continuous function $f:[0,2] \to \mathbb{R}$ such as $f(0)=f(2)$, $\exists x \in [0,1]:f(x)=f(x+1)$

I am having trouble formalizing the answer to this question. Any help would be appreciated.     Is it true that for every continuous function $f:[0,2] \to \mathbb{R}$ such as $f(0)=f(2)$, $\exists x \in [0,1]:f(x)=f(x+1)$?   If the function is periodic of degree one this seems true to me. I tried proving by contradiction, supposing that $\forall x \in [0,1], f(x) \neq f(x+1)$, but I couldn't get any further.


Series where the planet’s air is really polluted and there is a portal to take you to a world where the air is clean

The movie was released in the last 15 years, probably between 2008-2018. "Pre-movie" (like what happens before the main part of the movie begins):  The movie was in the future. The people have to wear gas masks to go outside because the air is so polluted. airpollution smog 2 child policy they had 3 kids the guy goes to prison There is some sort of transportation portal that brings some important people 85mio years in the past on another timeline The guy runs to the portal and gets there with his entire family  "Main movie" (most of the movie):  The guy is on this new planet and I think he gets imprisoned. The people built a camp with walls because there are dinosaurs that can easily kill people. Then a few other things happen I don't clearly remember. I think there is also some sort of love story. Then the dinosaurs attack the camp and they have to defend it.


Finding median of a set of circular data

I would like to write a C++ function which finds the median of an array of circular data.  For example, consider the reading from a compass where the readings are assumed to be in [0,360). Though 1 & 359 appears to be far away, they are very close due to the circular nature of the reading.  Finding median of N-elements in ordinary data is as follows. 1. sort the data of N-elements (ascending or descending order) 2. If N is odd, median is the (N+1)/2 th element in the sorted array. 3. If N is even, median is the average of the N/2 th and N/2+1 th elements in the sorted array.   However, the wrap around problem in the circular data takes the problem to a different dimension and the solution non-trivial.  A similar question to find mean from circular data is explained here  The suggestion in the above link is to find the unit vector corresponding to each angle and find the average. However, median requires sorting the data and sorting of vectors don't make any sense in this context. Hence I don't think we can use the proposed scheme to find median!


Fermat's Combinatorial Identity: How to prove combinatorially?

$$\binom{r}{r} + \binom{r+1}{r} + \binom{r+2}{r} + \dotsb + \binom{n}{r} = \binom{n+1}{r+1}$$  I don't have much experience with combinatorial proofs, so I'm grateful for all the hints.  (Presumptive) Source: Theoretical Exercise 1.11, P18, A First Course in Pr, 8th Ed, by S Ross


Does there exist a hash function which has a fixed point?

Does there exist a hash function $h$ and an input $x$ such that $h(x) = x$? I believe this is a special case of collision-resistance. I imagine such a case is guaranteed not to be possible (otherwise such a hash function wouldn't always be guaranteed to be useful), but how is such a case proven to not be possible?


Code to open a file like double clicking on it

When a file is double clicked in a file manager it is automatically opened using the application associated with the type of the file.  How can I do the same from code. I am open to any programming  language. I have a little experience with Python and C.   My target operating systems are Ubuntu Linux and OSX. However, ideally I would like to find a solution that works with Windows, OSX, and Ubuntu linux.


Nielsen & Chuang Exercise 2.2 - Matrix representations in different input and output basis

This is a question in the Nielsen and Chuang textbook (Exercise 2.2).     Suppose $V$ is a vector space with basis $|0\rangle$ and $|1\rangle$    and $A$ is a linear operator from $V \to V$ such that $A|0\rangle =  |1\rangle$ and $A|1\rangle =|0\rangle$. Given a matrix representation    for $A$, with respect to the input basis $\{|0\rangle, |1\rangle\}$    and output basis $\{|1\rangle,  |0\rangle\}$. Find input and output    basis which give rise to a different matrix representation of A.   My doubts:   Why do we mention the input and output specifically? Isn't the matrix-dependent only on the input and output as long as the transformation is in the same vector space? How to solve the second part of the question?


Do we need a global test before post hoc tests?

I often hear that post hoc tests after an ANOVA can only be used if the ANOVA itself was significant.    However, post hoc tests adjust $p$-values to keep the global type I error rate at 5%, don't they?  So why do we need the global test first?  If we don't need a global test is the terminology "post hoc" correct? Or are there multiple kinds of post hoc tests, some assuming a significant global test result and others without that assumption?


Pushing a long stick into the event horizon

Imagine a very long continuous stick with one end being pushed into the event horizon, all outside observers must agree that this end of the ruler come to a complete halt while I'm still pushing at the opposite end? Question is do I feel any opposite force from the stick while I push the entire stick into this event horizon? The stick is nigh indestructible just for this thought experiment.


Error when reprojecting raster (warp) QGIS

When trying to reproject a raster from degrees to meters in warp (QGIS) I receive the following error:   Processing algorithm… Algorithm 'Warp (reproject)' starting… Input parameters: { 'DATA_TYPE' : 0, 'EXTRA' : '', 'INPUT' : '/Users/annanilsson/Desktop/in_ref_annual.tif', 'MULTITHREADING' : False, 'NODATA' : None, 'OPTIONS' : '', 'OUTPUT' : '/var/folders/jv/g8xcbz2n4y109pdxsfr1hr080000gn/T/processing_387d8ccc215042b78b22f1546c4dd5c0/34324c65b826461a9a98f356bb1accdc/OUTPUT.tif', 'RESAMPLING' : 0, 'SOURCE_CRS' : None, 'TARGET_CRS' : QgsCoordinateReferenceSystem('EPSG:32635'), 'TARGET_EXTENT' : None, 'TARGET_EXTENT_CRS' : None, 'TARGET_RESOLUTION' : None }  GDAL command: gdalwarp -t_srs EPSG:32635 -r near -of GTiff /Users/annanilsson/Desktop/in_ref_annual.tif /var/folders/jv/g8xcbz2n4y109pdxsfr1hr080000gn/T/processing_387d8ccc215042b78b22f1546c4dd5c0/34324c65b826461a9a98f356bb1accdc/OUTPUT.tif GDAL command output: /bin/sh: gdalwarp: command not found  Execution completed in 0.11 seconds Results: {'OUTPUT': '/var/folders/jv/g8xcbz2n4y109pdxsfr1hr080000gn/T/processing_387d8ccc215042b78b22f1546c4dd5c0/34324c65b826461a9a98f356bb1accdc/OUTPUT.tif'}  Loading resulting layers The following layers were not correctly generated.

/var/folders/jv/g8xcbz2n4y109pdxsfr1hr080000gn/T/processing_387d8ccc215042b78b22f1546c4dd5c0/34324c65b826461a9a98f356bb1accdc/OUTPUT.tif

You can check the 'Log Messages Panel' in QGIS main window to find more information about the execution of the algorithm.   Any suggestions on what I might have done wrong?


Setting the coordinates in a QGIS layout right

Apparently the coordinates of my map are false. They are supposed to be something around 53°N/ 12° E. I am using a WMS Layer. How do I get the coordinates right?


I was running 14.04 on my Intel Atom processor based netbook. However, when I upgraded to Ubuntu 16.04, the netbook stopped working properly.  I have now understood that the 1 GB of RAM is not adequate to run 16.04. I therefore want to roll back to 14.04.  Is there an easier way of roll back or, do I need to download 14.04 and install over the existing system?


I'm trying to sort the /etc/passwd numerically by user id numbersb(third field) in ascending order and then send it to s4.  What command would I uses to do that? I'm on this for a while now.


Why does Microsoft Windows' performance appear to degrade over time?

Windows XP/2003 and earlier (can't attest to Windows Vista, but I suspect it's the same) all appear to become more sluggish over time as applications are installed and uninstalled.  This is not a scientifically tested observation, but more of a learned-through-experience piece of wisdom.  (I've always suspected the registry as being behind the issue.)  Is there any concrete evidence of this degradation occurring, or it just an invalid perception of mine?


Light (or any radiation as a matter of fact) is an electromagnetic wave so why doesn't it have a electric charge associated with it?  As far as I know only static or flowing electric chargers can produce electric fields and if it does have a charge why doesn't light (i.e. a photon) respond to an electric or magnetic field?


I've been reading about a lot of different types of philosophies, religions, ways of thinking etc. I was wondering what are the most recently created philosophical ways of looking at the universe? Where can one find out about new cutting edge ideas?  Example: Before we had Marxism, Communism, Zen, Christianity etc. Now X,Y, and Z have been created building on and evolving the ideas of A,B,C.   Everything I read about are ideas that were created a long time ago. What is new and updated?


Talking in chat from other player's perspectives

I have been playing Minecraft 1.12.2 Java Edition on PC. One of my friends started to make me say stuff I wasn't saying in the chat. I don't know what command he was using but he basically made the chat say, "I am an idiot" from my perspective (which I never did) and I really want to know how to do it so I can make a comeback and troll him and other people the same way. Does anyone know how to do this?


I am learning LaTeX from a book, and I am using TeXnicCenter. The book has a chapter about the graphics package, so I download it and try the commands. But I find that when I use commands like \scalebox and \resizebox, they cannot take effect. Also, the PDF seems to be "dead" after that, i.e. when I make some changes and click "build and view", the PDF remains unchanged. I have tried the graphicx package but the result is the same.  For example, firstly I type  \documentclass[12pt]{article} \usepackage{amsfonts, amsmath, amsthm, amstext, amssymb, amscd, ulem, array} \begin{document} abc \end{document}   then this produces a pdf with a word 'abc'. At the bottom of TeXnicCenter, I see 0 error, 0 warning, 0 bad box, and 1 page.  Then I change it to  \documentclass[12pt]{article} \usepackage{amsfonts, amsmath, amsthm, amstext, amssymb, amscd, ulem, array} \usepackage{graphicx} \begin{document} \scalebox{2}{abc} \end{document}   The same pdf occurs, i.e. no size enlarged. At the bottom of TeXnicCenter, I see 0 error, 0 warning, 0 bad box, and 0 page.  Finally I change it to  \documentclass[12pt]{article} \usepackage{amsfonts, amsmath, amsthm, amstext, amssymb, amscd, ulem, array} \usepackage{graphicx} \begin{document} \scalebox{2}{efg} \end{document}   I still see the word 'abc' with the same size. At the bottom of TeXnicCenter, I see 0 error, 0 warning, 0 bad box, and 0 page.  Would any one please help me?  In the output area of the TeXnicCenter, I find the following which is unusual:  "C\User\user\Desktop\myfile\test.aux)pdflatex.exe: GUI framework cannot be initialized."


Python 3.6 lists becoming the last element appended to the list

Using Python 3.6.4, I am using the following code to create a list of 4 element long lists, each of which contain integers. However, rather than creating a list of all the different 4 element lists, the list simply consists of the last 4 word list to be appended to the list. Are there any bugs in this code, or is there a problem with using the append function in my code at this scale? Any help is appreciated.    attemptList = [] dataCardList = [] currentAttempt = "" alphabet = "abcdefghijklmnopqrstuvwxyz" letter = 0 digit = 0 dataCard = [-1,-1,-1,-1] while dataCard[0] <= 25:     dataCard[0] += 1     dataCard[1] = 0     dataCard[2] = 0     dataCard[3] = 0     dataCardList.append(dataCard)     print("17576 Cards Made")     while dataCard[1] <= 25:         dataCard[1] += 1         dataCard[2] = 0         dataCard[3] = 0         dataCardList.append(dataCard)         while dataCard[2] <= 25:             dataCard[2] += 1             dataCard[3] = 0             dataCardList.append(dataCard)             while dataCard[3] <= 25:                 dataCard[3] += 1                 dataCardList.append(dataCard)                 print(dataCard)                 print(dataCardList)


when I install ubuntu by deleting my previous os , will my previous programs and programs save data be lost?

I am a user of windows xp , now I am thinking of between switching or dual boot after I have finished the errors in my computer.  I would love dual boot but my harddisk will not be enough so if I delete windows xp will it affect my program and program files?


What does the meaning of the "circle inside cross" symbol in Microsoft Word

What does the meaning of the below symbol and how can I remove this. In a MS-Word document file, I can't formatting a tables text. That's why I'm displaying all hidden text and formatting characters but I can't understand what is the below symbol and what is the purpose of it.


I'm having some difficulty with this proof. Could you help me?     Let $a,b>0$ and $c_n = (a^n + b^n)^{1/n}$. Show that $$\lim_{n\to \infty}c_n = \max \{a,b\}.$$   Thank you.


find records with lower case names and upper first letter names

I have a oracle db and in my tables some record names are all lower case and some have upper case in the first letter. example: Logan and logan. I need to be able to return both results.   Here is my query  SELECT DISTINCT uzer.email, uzer.firstname, uzer.lastname,  account.name,  account.brand,account.id FROM UZER, ACCOUNT, UZERACCOUNT where UZER.ID=UZERACCOUNT.UZERID AND ACCOUNT.ID=UZERACCOUNT.ACCOUNTID AND UZER.firstname='Logan'    Is there a way to do this without throwing in an OR? Because this query is going to grow to use last names too, and i need it to be fast


I'm toying around with autoencoders and tried the tutorial from the  (first section "Let's build the simplest possible autoencoder" only).  For the encoding layer they use ReLus, while sigmoids are used for the decoding layer. I wondered why that is and changed   encoded = Dense(encoding_dim, activation='relu')(input_img)   to  encoded = Dense(encoding_dim, activation='sigmoid')(input_img)   Instead of a val_loss of < 0.11 the model now reaches only ~0.26 after 50 epochs and the reconstruction looks way off too (first row are original digits, second row reconstructions)   I'm trying to understand why that is but can't find any information in the post. Does anyone know why changing the activation layer from relu to sigmoid has such a negative effect in this case?


I have Ubuntu 17.04 on my Asus laptop.  After login I cannot write anything to /dev/sda6  It tells me that the disk is in read-only mode:    How can I fix it?


What are the best metrics to evaluate a multiclass classification model?

I have a multiclass classification problem I have 5 classes and data highly unbalnced    class 01: 6   class 02: 100  class 03: 9300  class 04: 200 class 05: 34   I have used K fold cross validation with k=10 and 5 algorithms:  - Logistic regression - Linear discriminant analysis  - K nearest neighbor  - CART - Naive bayes  and I had this results  Algo: mean of accuracy , Std of accuracy  (where std means Standard Deviation = sqrt(Variance))    LR: 0.489479 (0.095705) LDA: 0.901222 (0.001977) KNN: 0.949483 (0.002300) CART: 0.939122 (0.002691) NB: 0.950761 (0.002713)   My question is: is accuracy enough to choose the best model between those 4 ? or should I use precision, recall, f1 score, AUC .....


Problems with central limit theorem and bigger SE with bigger samples

It is said that “the finite population correction factor is used when you sample without replacement from more than 5% of a finite population. It’s needed because under these circumstances, the central limit theorem doesn’t hold true and the standard error of the estimate will be too big.” This is weird cause intuitively the bigger the sample size is, the more central limit theorem must be true and the amount of standard error must be decreased. If having a big sample have these problems so why we bother ourselves to have a big sample? Intuitively if our sample is bigger, our problems must be less!! What is the explanation?


How to finish an aborted Ubuntu subsystem initialization?

I installed the Ubuntu subsystem with 18.04 on Windows 10. The installation was apparently stuck at ~"Installing...", but when I pressed Enter the output ~"Please enter a new UNIX username:" was shown and the key press was taken as confirmation for an empty username. The installation then hang further and I had to close the window with CtrlC.  When I start the Ubuntu subsystem I get a prompt for root which makes me think that the initialization didn't succeed. How can I complete/restart it?


Multiple Languages Support For Sharepoint App

I have developed an app for SharePoint and it is available on SharePoint app store. Currently it is in English only. Now i want to add support in multiple languages such as German, Japanese, French. Do i need to make changes only in my code part or while publishing this app, if we choose different languages, will Microsoft take care of it?


How to Sync OneDrive Business /Office 365 on Linux?

Microsoft OneDrive Business/Office 365 Pro offers 1 TB of cloud storage but unfortunately there has never been a method to sync it on Linux.


Proof regard to the function $ f\left(x\right)=\begin{cases} x^{2}\sin\left(\frac{1}{x^{2}}\right) & x\neq0\\ 0 & x=0 \end{cases} $

For a function $ f $ which defined on an interval $[a,b]$ with partition $ P={x_0,x_1,...,x_n} $ we define the variation in the function to be  $ V\left(f,P\right)=\sum_{i=0}^{n-1}|f\left(x_{i+1}\right)-f\left(x_{i}\right)| $   We define the general variation in the interval $[a,b]$ to be   $ V_{a}^{b}\left(f\right)=Sup\{V\left(f,P\right)|P\} $ When P is a partition of [a,b].  If $ V_{a}^{b}\left(f\right) $ exists, we say that $ f $ is of bounded bounded  Prove that   $ f\left(x\right)=\begin{cases} x^{2}\sin\left(\frac{1}{x^{2}}\right) & x\neq0\\ 0 & x=0 \end{cases} $  Is of unbounded variation  So, here's what I tried.  We know that  $ f'\left(x\right)=\begin{cases} 2x\sin\left(\frac{1}{x^{2}}\right)-\frac{2}{x}\cos\left(\frac{1}{x^{2}}\right) & x\neq0\\ 0 & x=0 \end{cases} $  is the deriviative, and the deriviative is not bounded, and countinious in the segment $ (0,1] $   So let $ M>0 $ be some real number, and we'll prove that exists partition P of $[a,b]$ such   $ V\left(f,P\right)>M $    That would be enough to prove what we want. So, since $ f'(x) $ is'nt bounded, we can find $ x_{0}\in(0,1]$  such that $f'(x_0)>M+1 $.  let $ 0<\varepsilon<1 $ . since $ f'(x) $ countinious in $ (0,1] $ exists $ \delta>0 $ such that for any $ x\in\left(x_{0}-\delta,x_{0}+\delta\right) $ it follows that   $ M<f'\left(x_{0}\right)-\varepsilon<f'\left(x\right) $  Now let  $ P=\{0,x_{0}-\frac{\delta}{2},x_{0}+\frac{\delta}{2},1\} $ be partition of $ [0,1] $. So :  $ V\left(f,P\right)=|f\left(x_{0}-\frac{\delta}{2}\right)-f\left(0\right)|+|f\left(x_{0}+\frac{\delta}{2}\right)-f\left(x_{0}-\frac{\delta}{2}\right)|+|f\left(1\right)-f\left(x_{0}+\frac{\delta}{2}\right)| $  Now what I want to do is to argue that from Lagrange theorem, exists $ \theta_{i}\in(x_{0}-\frac{\delta}{2},x_{0}+\frac{\delta}{2}) $  such that $ |f\left(x_{0}+\frac{\delta}{2}\right)-f\left(x_{0}-\frac{\delta}{2}\right)|=\delta\cdot|f'\left(\theta_{i}\right)| $   And since $ \theta_{i}\in(x_{0}-\frac{\delta}{2},x_{0}+\frac{\delta}{2}) $ then $ f'\left(\theta_{i}\right)>M $   But, I dont know how to fix the M so it would "cancel" the $ \delta $ because $ \delta $ depends on $ x_0 $.  Any ideas would be helpful. Thanks in advance


Can someone identify this book, where children are bred for specific jobs?

Things I remember about this book:   Every child was selected for a certain job/career; If twins were born, one was always killed; Seeing colors for the first time (describing the color of an apple); Seeing war and death and poverty.   Does anyone have any idea what this book might be?


This is a question about the comics - as it relates to the Captain Marvel 2019 movie.  My understanding of the Marvel comic history (which is admittedly limited) is that Skrulls are evil conquerors. This is played heavily on throughout the movie as well.      However, in the movie, we learn that Carol has been deceived and that the Kree she had been working for were actually evil. The Skrulls she spent the movie fighting were actually innocent refugees or something similar and apparently good, just looking for a way off the planet to find a new home.   So I'm curious if the Skrulls' society in the comics is more complex than just simple shape-shifting conquerors, if there are pockets of peaceful Skrulls disloyal to their cause, or      is the movie adaptation just a major deviation from the comics, showing that the Skrulls are good guys all along?


Will the momentum be conserved in this scenario?

I faced a problem:     A truck filled with sand has a mass of $6*10^3$ kg. It's moving at a constant speed of 20 $kms^-1$. If at one moment, sand starts to fall through a hole normal to the motion of the truck from the truck with rate 5 kg/s(due to a downward gravitational force); what would be the force needed to keep the truck at same constant initial speed?   Neglect air drag, friction etc.   I am only concerned with if the momentum of the truck in the direction of it's motionn would conserve.  My attempt: No, it won't. Because conservation of momentum only works for closed systems. The sand pouring out and the object creating the gravitational field are in a closed system (not in terms of invaraint mass, but in terms of no external force). But, all other sand particle and the truck is out of this closed system. So, according to inertia of motion, all other particles will keep up the same velocity. So, necessary force $0N$  Feel free to point out my mistakes.


Remove double quotes with escape character from JSON string

I have a JSON like below,  String jsonStr='{"key":"value \"subvalue\""}';   I want to deserialize it with JSON.deserilizeuntyped method due to unexpected characters. I have tried  jsonStr.replace('\\"','');   But still not able to get rid of the \" from the JSON string. Any suggestions? I want the string as {"key":"value subvalue"}


Should questions having lots of downvotes be downvoted further?

Is down-voting an already heavily down-voted/closed question kind of like kicking a dead horse? Is this bad practice?


Can any $n$ number of linearly independent vectors build the basis of a vector space on $\Bbb R^n$?

I'm trying to understand how many bases there can be in a vector space. According to my understanding so far, for example in the vector space $\Bbb R^2$ every pair of linearly independent vectors can build a basis for that vector space. So, generally speaking, can any number $n$ of linearly independent vectors $\{v_1, v_2,...v_n\}$ make up a generator for the vector space $V \in \Bbb R^n$?


Will any files or apps delete after updating to Mavericks?

I'm downloading the update right now and I would like to know if any of my files or app gets deleted after this update... I'm sure many people here already installed the update so what can you say?


Lizardfolk is a PC race from the book Volo's Guide to Monsters.  The Players Handbook says (Monk):     Beginning at 1st level, while you are wearing no armor and not wielding a shield, your AC equals 10 + your Dexterity modifier + your Wisdom modifier.   Volo's Guide to Monsters says (Lizardfolk):     You have tough, scaly skin. When you aren't wearing armor, your AC is 13 + your Dexterity modifier.   Both explanations saying that this is now your AC. But if I think about the meaning of the Wisdom bonus (feeling/knowing how the enemy is moving) I think a lizard-monk's armor class should be: 13 + your Dexterity modifier + your Wisdom modifier.  So the question is the same as the title: Does the Wisdom modifier apply on a lizard-monk's armor class?


How to decrement a float variable until it's exactly zero

I am making keyboard controls for a camera, and I am experiencing issues regarding the innacuracy of floats. I have the variables "float Xvelocity" and "float Zvelocity", I increment these velocities by adding or subtracting the acceleration speed every time the respective direction keys are being held (A, D, W or S). However, everything I try to make the float go towards zero simply work in very strange ways. I thought it would be as simple as: if (keys[GLFW_KEY_A] & xVelocity >-speed)     xVelocity -= acceleration / deltaTime; if (keys[GLFW_KEY_D] & xVelocity < speed)     xVelocity += acceleration / deltaTime; if (keys[GLFW_KEY_W] & zVelocity >-speed)     zVelocity -= acceleration / deltaTime; if (keys[GLFW_KEY_S] & zVelocity < speed)     zVelocity += acceleration / deltaTime;  if (!keys[GLFW_KEY_A] & xVelocity<0.f) {     xVelocity+=deceleration / deltaTime; } if (!keys[GLFW_KEY_D] & xVelocity>0.f) {     xVelocity-=deceleration / deltaTime; } if (!keys[GLFW_KEY_W] & zVelocity<0.f) {     zVelocity+=deceleration / deltaTime; } if (!keys[GLFW_KEY_S] & zVelocity>0.f) {     zVelocity-=deceleration / deltaTime; }  origin -= right * xVelocity; origin -= vec3(front.x, 0.f, front.z) * zVelocity;  This doesn't make my camera completely stop moving! It does decelerate, but it rarely becomes exactly zero, thus it keeps slowly moving after releasing the key, either towards the direction it was going before or away from it. Can someone explain why doesn't this deceleration work as I intended, (probably because of float inaccuracy, but maybe it's another reason) and how may I proceed to fix it?


I want to declare a series of commands \SA...\SZ as demonstrated  -- I want to avoid the additional \loopS command that is used though. However, merging the two lines (L1 and L2) into one (L3) does not quite work: when I call, e.g., \SA it outputs $\mathcal{Z}$ as, I guess, that is the value that is last stored in the loop variable \X. Is there a fix?  \documentclass{article}  % \def\loopS#1{\expandafter\def\csname S#1\endcsname{\mathcal{#1}}} (L1)  \newcounter{ctr} \loop   \stepcounter{ctr}   \edef\X{\Alph{ctr}}   %\expandafter\loopS\X (L2)   \expandafter\def\csname S\X\endcsname{\mathcal{\X}} %(L3) \ifnum\thectr<26 \repeat  \begin{document}   $\SA$ \end{document}


How can I show that $\lim_{n\rightarrow \infty} ((-n^x)/e^n)) = 0$

How can I show that $$\lim_{n\rightarrow \infty} ((-n^x)/e^n)) = 0$$ , where n is a natural number and $x>0$? I wanted to use l'hôspital, but it doesn't work or rather not defined, if n is a natural number.


How can a network with only ReLU nodes output negative values?

I'm trying to use an api with a feedforward neural network for time series forecasting.  For dense aggregate data it works fine, but for sparse data it sometimes forecasts negative values, even though my historical data has only positive values.   The source code is very dense, and I might be missing a line or two, but as far as I can tell, the input layers and the hidden layers are all ReLU nodes.   Assuming I am correct, how can a network with only ReLU layers lead to negative values, especially if none of the training data has negative values?


Is there a word akin to "hungry" or "thirsty" that implies a need to urinate?

Sometimes my brain (maybe because I'm not a native English speaker) tends to come up with logical extensions to common formats; in this case, more than once I caught myself thinking (not out loud, thankfully) that I was feeling "pissy". Now, the actual meaning of that word is nothing close to what I meant, but I can't help but feel like there's a gap there.   seem to have wondered the same but I don't think I can draw anything conclusive from that...


Prove that $f(z)=\frac{1}{2\pi i}\int_{\Gamma}\frac{f(\zeta)}{z-\zeta}\ d\zeta,$ for all $z\in\mathbb{C}$ with $|z| \gt 2.$

Let $\Gamma$ denote the positively oriented circle of radius $2$ with center at the origin. Let $f$ be an analytic function on $\{z\in\mathbb{C}\ |\ |z| \gt 1\},$ and let $$\lim_{z\to\infty} f(z)=0.$$ Prove that $$f(z)=\dfrac{1}{2\pi i}\int_{\Gamma}\dfrac{f(\zeta)}{z-\zeta}\ d\zeta$$ for all $z\in\mathbb{C}$ with $|z|>2.$  By the given condition it is clear that $\lim\limits_{z \to 0} f \left ( \dfrac 1 z \right ) = 0.$ Now define a function $g : B(0,1) \longrightarrow \Bbb C$ by $$ g(z) = \left\{         \begin{array}{ll}             f \left (\dfrac 1 z \right ) & \quad 0 \lt |z| \lt 1  \\             0 & \quad z = 0         \end{array}     \right. $$ Then $g$ is analytic on $B(0,1).$ Let $\Gamma' (t) = \frac {1} {\Gamma (t)},$ where $t$ varies over the parameter interval of $\Gamma.$ Then $\Gamma'$ is a circle of radius $\frac {1} {2}$ traversing in the clockwise direction. Since $g$ is analytic on and inside of $\Gamma'.$ So by Cauchy's integral theorem it follows that for all $z \in \Bbb C$ with $|z| \lt \frac {1} {2}$ we have $$g(z) = - \dfrac {1} {2 \pi i} \int_{\Gamma'} \dfrac {g(\zeta)} {\zeta - z}\ d\zeta.$$ Hence for all $z \in \Bbb C$ with $|z| \gt 2$ we have $$f(z) = g \left ( \frac 1 z \right ) = - \dfrac {1} {2 \pi i} \int_{\Gamma'} \dfrac { g (\zeta) } {\zeta - \frac 1 z}\ d\zeta.$$ Can it be shown that $$-\displaystyle { \int_{\Gamma'} \dfrac {g(\zeta)} {\zeta - \frac 1 z}\ d\zeta = \int_{\Gamma} \dfrac {f(\zeta)} {z - \zeta}\ d\zeta}$$ for all $z \in \Bbb C$ with $|z| \gt 2\ $? Any help in this regard will be highly appreciated. Thanks in advance.


time is a brilliant command if you want to figure out how much CPU time a given command takes.  I am looking for something similar that can list the files being accessed by a program and its children. Either in real time or as a report afterwards.  Currently I use:  #!/bin/bash  strace -ff -e trace=file "$@" 2>&1 | perl -ne 's/^[^"]+"(([^\\"]|\\[\\"nt])*)".*/$1/ && print'   but its fails if the command to run involves sudo. It is not very intelligent (it would be nice if it could only list files existing or that had permission problems or group them into files that are read and files that are written). Also strace is slow, so it would be good with a faster choice.


How can i solve this problem?  The following packages have unmet dependencies: libgl1-mesa-dri : Depends: libdrm-amdgpu1 (>= 2.4.85-0~x~padoka0) but 2.4.84+git20171019.511c71c8-0ubuntu0ricotz~16.04.1 is to be installed  libgl1-mesa-dri:i386 : Depends: libdrm-amdgpu1:i386 (>= 2.4.85-0~x~padoka0) but 2.4.84+git20171019.511c71c8-0ubuntu0ricotz~16.04.1 is to be installed  libgl1-mesa-glx : Depends: libdrm-amdgpu1 (>= 2.4.85-0~x~padoka0) but 2.4.84+git20171019.511c71c8-0ubuntu0ricotz~16.04.1 is to be installed  libgl1-mesa-glx:i386 : Depends: libdrm-amdgpu1:i386 (>= 2.4.85-0~x~padoka0) but 2.4.84+git20171019.511c71c8-0ubuntu0ricotz~16.04.1 is to be installed  mesa-vdpau-drivers : Depends: libdrm-amdgpu1 (>= 2.4.85-0~x~padoka0) but 2.4.84+git20171019.511c71c8-0ubuntu0ricotz~16.04.1 is to be installed E: Unmet dependencies. Try 'apt-get -f install' with no packages (or specify a solution).   sudo apt-get install -f Does not help  after run this comand  Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... Done The following packages were automatically installed and are no longer required:   libcuda1-375 libdrm-common nvidia-opencl-icd-375 Use 'sudo apt autoremove' to remove them. The following additional packages will be installed:   libdrm-amdgpu1 libdrm-amdgpu1:i386 The following packages will be upgraded:   libdrm-amdgpu1 libdrm-amdgpu1:i386 2 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. 44 not fully installed or removed. Need to get 0 B/59,7 kB of archives. After this operation, 14,3 kB of additional disk space will be used. Do you want to continue? [Y/n]  (Reading database ... 271931 files and directories currently installed.) Preparing to unpack .../libdrm-amdgpu1_2.4.85-0~x~padoka0_i386.deb ... De-configuring libdrm-amdgpu1:amd64 (2.4.84+git20171019.511c71c8-0ubuntu0ricotz~16.04.1) ... Unpacking libdrm-amdgpu1:i386 (2.4.85-0~x~padoka0) over (2.4.84+git20171019.511c71c8-0ubuntu0ricotz~16.04.1) ... dpkg: error processing archive /var/cache/apt/archives/libdrm-amdgpu1_2.4.85-0~x~padoka0_i386.deb (--unpack):  trying to overwrite '/usr/share/libdrm/amdgpu.ids', which is also in package libdrm-common 2.4.85~git20171023.e580be90-0ubuntu0ricotz~16.04.1 Preparing to unpack .../libdrm-amdgpu1_2.4.85-0~x~padoka0_amd64.deb ... De-configuring libdrm-amdgpu1:i386 (2.4.84+git20171019.511c71c8-0ubuntu0ricotz~16.04.1) ... Unpacking libdrm-amdgpu1:amd64 (2.4.85-0~x~padoka0) over (2.4.84+git20171019.511c71c8-0ubuntu0ricotz~16.04.1) ... dpkg: error processing archive /var/cache/apt/archives/libdrm-amdgpu1_2.4.85-0~x~padoka0_amd64.deb (--unpack):  trying to overwrite '/usr/share/libdrm/amdgpu.ids', which is also in package libdrm-common 2.4.85~git20171023.e580be90-0ubuntu0ricotz~16.04.1 Processing triggers for libc-bin (2.23-0ubuntu9) ... /sbin/ldconfig.real: /usr/lib/nvidia-384/libEGL.so.1 is not a symbolic link  /sbin/ldconfig.real: /usr/lib32/nvidia-384/libEGL.so.1 is not a symbolic link  Errors were encountered while processing:  /var/cache/apt/archives/libdrm-amdgpu1_2.4.85-0~x~padoka0_i386.deb  /var/cache/apt/archives/libdrm-amdgpu1_2.4.85-0~x~padoka0_amd64.deb E: Sub-process /usr/bin/dpkg returned an error code (1)


I am using ACM conference template sample-sigconf.tex from  for an ACM conference.  I have a table that is slightly wider than the column width. I have limited space so I do not want to make it in the center using {table*} as this will waste some empty space that I need. This illustrates the issue:    How can I fit the table in a column even if this will shrink it a little bit?   Here is the script:  \documentclass[sigconf]{acmart} \usepackage[T1]{fontenc} %to solve the font error \usepackage{lmodern}  %to solve the font error \usepackage{underscore} %underscores %-------------------------for the table-----------------------------         \usepackage{array} \usepackage{booktabs} \usepackage{multirow} \newcommand{\head}[1]{\textnormal{\textbf{#1}}} \newcommand{\normal}[1]{\multicolumn{1}{l}{#1}} \usepackage{amssymb}% http://ctan.org/pkg/amssymb \usepackage{pifont}% http://ctan.org/pkg/pifont \newcommand{\cmark}{\ding{51}}% \newcommand{\xmark}{\ding{55}}% \newcommand*\rot{\rotatebox{90}} \usepackage{tabularx} \usepackage{threeparttable, tablefootnote} %-------------------------end table----------------------------- \usepackage{lipsum}  % Copyright %\setcopyright{none} %\setcopyright{acmcopyright} %\setcopyright{acmlicensed} \setcopyright{rightsretained} %\setcopyright{usgov} %\setcopyright{usgovmixed} %\setcopyright{cagov} %\setcopyright{cagovmixed}   \begin{document} \title{Title}  \subtitle{Test}  \author{Author} \affiliation{%   \institution{XYZ}} \email{abc@xyz}  \begin{abstract} Abstract goes here.  \end{abstract}  \maketitle \section{Introduction} \lipsum  \begin{table}[tp] \caption{Levels.} \vspace*{-5mm} \label{table:levels} \centering \begin{tabular}{ll} \\ \toprule A & B \\ \midrule  AA and BBBB & \begin{tabular}{l} aaaaabbbbccccddddeeeeffffgggghhhhiiiijjjj \\                                  aaaaabbbbccccddddeeeeffffggggh \\                                  aaaaabbbbccccddddeeeeffffggggh \\                                  aaaaabbbbccccddddeeeeffffggggh \\                                  aaaaabbbbccccddddeeeeffffggggh \\                                  aaaaabbbbccccddddeeeeffffggggh \end{tabular} \\ \hline AA and BBBB & \begin{tabular}{l} aaaaabbbbccccddddeeeeffffggggh \\                                  aaaaabbbbccccddddeeeeffffggggh \\                                  aaaaabbbbccccddddeeeeffffggggh \\                                  aaaaabbbbccccddddeeeeffffggggh \\                                  aaaaabbbbccccddddeeeeffffggggh \\                                  aaaaabbbbccccddddeeeeffffggggh \end{tabular} \\  \hline AA and BBBB & \begin{tabular}{l} aaaaabbbbccccddddeeeeffffggggh \\                                  aaaaabbbbccccddddeeeeffffggggh \\                                  aaaaabbbbccccddddeeeeffffggggh \\                                  aaaaabbbbccccddddeeeeffffggggh \\                                  aaaaabbbbccccddddeeeeffffggggh \\                                  aaaaabbbbccccddddeeeeffffggggh \end{tabular} \\ \bottomrule \end{tabular} \end{table}    \end{document}


prove by induction that $(a^n - b^n)$ is a multiple of $(a - b)$ for $n \geq 1$

Okay so I just finished a final in discrete mathematics and I could not figure out how to finish this proof:  "Prove by mathematical induction, that $(a^n - b^n)$ is a multiple of $(a - b)$ when $a$ and $b$ are integers and $n \geq 1$.  $\underline{Base case: n = 1}$  $(a^1 - b^1) = (a - b)x$  $x = 1$  $a - b = a - b$  $\underline{Inductive Hypothesis:}$  $n = k$ for some $k$  $(a^k - b^k) = (a - b)x$  $\underline{Inductive Step:}$  $n = k + 1$  $(a^{k + 1} - b^{k + 1}) = (a - b)x_1$  $(a \cdot a^{k}) - (b \cdot b^{k}) = (a - b) x_1$  $a \cdot [(a - b)x + b^k] + b \cdot [(a - b)x - a^k]= (a-b)x_1$  $(a -b)xa + ab^k + (a - b)xb - ba^k = (a - b)x_1$  $(a -b)xa + (a - b)xb - ab^k + ba^k = (a - b)x_1$  $(a -b)xa + (a - b)xb + ba^k - ab^k = (a - b)x_1$  .....  I don't know if I did it right but I couldn't get any further than this.


This question only needs one answer: a list of great resources for getting started with Oracle, including Database Administration, PL/SQL and SQL.   You may find your question has been closed as a duplicate of this one, if so, please don't be offended: we are trying to be as helpful as we can without . Closing a question as a duplicate of this one is us saying "What you really need is to spend some time reading some of the best resources available rather than have your specific question answered right now. If you do get through these resources, you'll soon be back with more !


I would like to have a method that will parse from a nullable database column an enum. I wrote this method below (and had to restrict T to a struct to make it compile).  It does compile, but I believe its wrong as Enums are not structs? If so, how do I restrict the generic method to say I am expecting a ValueType you don't have to complain at me that "Only non-nullable value type could be underlying of 'System.Nullable'  private static T? ParseEnum<T>(DataRow row, string columnName)     where T : struct {     T? value = null;     try     {         if (row[columnName] != DBNull.Value)         {             value = (T)Enum.Parse(                 typeof(T),                 row[columnName].ToString(),                 true);         }     }      catch (ArgumentException) { }      return value; }


Blender 2.91.0 choppy model in viewport when using perspective view?

I have a problem. In my viewport, model shows as choppy broken model when I m in perspective view. When I change to orthographic view, it shows fine. Here is the comparison. But in rendering view, both perspectives are rendered fine. Is this a bug or anything wrong in my settings?


$\int_{-1}^{1}(1-x^2)^ndx$  I have trouble with finding recurrence formula for this integral. $n$ is natural parameter. I've tried to split up $(1-x^2)^n = (1+x)^n(1-x)^n$ and then to integrate partially, but it only makes things more complicate.  Maybe substitution $x=sint$ can lead to solution? When I apply it I get:   $\int_{-\pi/2}^{\pi/2}(cost)^{n+1}dt$  What to do next then?


I can't figure out how to download a book to my iPhone 7 iOS 13.6 that's currently stored in iCloud. How can I download the book so that I can read it offline later?


How to divide 50MHz down to 2Hz in VHDL on Xilinx FPGA

I have a Xilinx FPGA board, with a 50MHz crystal. I need to divide that down to 2Hz in VHDL. How do I do this?


Visual Studio - How to change the return value of a method in the debugger?

When I'm debugging, I often have to deal with methods that does not use an intermediate variable to store the return value :     private int myMethod_1()    {       return 12;    }     private int myMethod_2()    {       return someCall( someValue );    }   Well, in order to recreate a bug, I often have to change values on the fly. Here, I could want to see what happens when myMethode_1 return zero. Same thing for myMethod_2.  Is there a way to do that without modifying the code ? What I would like to do, it's to place a breakpoint on the return line (or on the closing bracket) and type-in a new return value.  Note : I'm using Visual Studio 2005 and Visual Studio 2008.  Thank !


My "a" key is busted. I want to map to another key

Other posts I've seen mostly seem to refer to special/modifier keys.  Is there a way to remap the a key to something else?   Cinnamon 17, 64-bit. I have a Japanese win keyboard.


What is the meaning of the C#' syntax, "out" variable as a parameter?

I have a line of code from someone else: something like...  public static bool ScreenToMapPosition (Vector2 ScreenCoord, out Int2 MapPosition)   Just to be clear, am I understanding this correctly?  When I call the function, it returns:   Returns the bool, true/false ALSO returns the MapPosition?   This is the meaning of "out"?  So in effect, I enter a Int2 MapPosition just so I can have it given a new value?  Almost the same as   public static Int2 ScreenToMapPosition (Vector2 ScreenCoord) {     Int2 MapPosition = //blah blah code code;     return MapPosition; }


Non-static method cannot be reference from a static context

I realise that this is a duplicate of other previous threads on this issue, However I have read them and I cannot for the life of me work out how to deal with the issue of 'Non-static method 'getItemAtPosition' cannot be referenced from a static context.'  Here is my code:   public class Favourites extends Insulter {  @Override public void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState);     setContentView(R.layout.favourites);      ArrayList<String> favs = getIntent().getStringArrayListExtra("favs");     ListAdapter theAdapter = new ArrayAdapter<>(this, android.R.layout.simple_list_item_1, favs);     ListView listView = (ListView) findViewById(R.id.favsList);     listView.setAdapter(theAdapter);      listView.setOnItemClickListener(new AdapterView.OnItemClickListener() {          @Override         public void onItemClick(AdapterView<?> parent, View view, int position, long id) {             String copyFav = String.copyValueOf(AdapterView.getItemAtPosition(position));             myClip = ClipData.newPlainText("copyFav", copyFav);             myClipboard.setPrimaryClip(myClip);             Toast.makeText(getApplicationContext(), R.string.copied, Toast.LENGTH_SHORT).show();          }     }); }   }


if p>=5 is a prime number, then p^2 +2 is a composite.

I'm not sure the proof is right. Also, I tried to justify the different ways p can be expressed with the Quotient Remainder Theorem, but not sure it is that or by the Division Algorithm.  Are they the same or is there enough difference to make the proof wrong.   If p>=5 is a prime number, then p^2 +2 is composite.  Proof: Suppose p>=5 is a prime number.  Then by the quotient remainder theorem, p can be expressed as   6m  or  6m + 1  or  6m + 3  or  6m + 4  or  6m + 5 for some integer m.   However, since p is a prime number greater than or equal to 5, it cannot be expressed as a multiple of 2 or 3.Thus p can only be expressed as   6m+1   or   6m+5.   If p = 6m + 1, then by squaring p and adding 2, we get   p^2 + 2 = (6m+1)^2 + 2 = 3(12m^2 + 4m +1)   Thus p^2 + 2 is divisible by a number less than p^2 + 2 and greater than 1, so, p^2 + 2 is composite.   If p = 6m + 5, then by similar reasoning we get   p^2 + 2 = (6m+5)^2 + 2 = 3(12m^2 + 20m +7)   Thus p^2 + 2 is divisible by a number less than p^2 + 2 and greater than 1, so, p^2 + 2 is composite. Hence, in either case p^2 + 2 is composite, which is what we needed to show.


What does this part of the sentence mean? "..where I had not so much arrived as simply stopped"

"Perhaps because I was beginning to know all too well not indeed where I was going, but where I had not so much arrived as simply stopped"---whats the function of "as" before "simply stopped"


Wordsplitting occurring in quoted variable

I'm trying to create a dialog menu based on the results of the lsblk command.  My goal is to read the first word as the menu item and the remaining words as the menu item description.    For example:  $ dialog --menu "Choose one:" 0 0 0 $(lsblk -lno name,size | grep sda)   This command works, because the dialog --menu option expects two arguments per menu item, in this case "name" and "size".  However, if I try the same command with a multi-word description (using the "read" built-in to write to stdout as two variables), word-splitting occurs in the second variable, even if quoted.  #commmand 1: unquoted variable $ dialog --menu "Choose one:" 0 0 0 $(lsblk -lno name,type,size | grep sda | > while read name desc; do > echo $name $desc > done)                      #results in output like below without quotes  #command 2: quoted variable  $ dialog --menu "Choose one:" 0 0 0 $(lsblk -lno name,type,size | grep sda | > while read name desc; do > echo $name "$desc" > done)                      #results in output like below without quotes  #command 3: escape quoted variable $ dialog --menu "Choose one:" 0 0 0 $(lsblk -lno name,type,size | grep sda | > while read name desc; do > echo $name \"$desc\" > done)                      #results in output below     I don't understand why word splitting is occurring in the quoted variable.  Can anyone explain and/or suggest a workaround?  I've tried writing the output of lsblk to a file and reading the file with the same results.  The desired output is:    EDIT: I looked at  as a possible solution, but it results in the lsblk command output being passed to dialog as one argument when two are required.  Thanks.


PHP code is sending emails to spam, how to prevent it?

I'm new to PHP and HTML working on a website both codes seem to be working. I'm trying to edit an existing contact us form and send the form to a default email but it is getting to the spam folder. Here is my HTML code part:

Contact Us

                                                                        <form name="enq" action="contact-form-handler.php" method="POST" onsubmit="return validation();">           <fieldset>             <input type="text" name="name" id="name" value=""  class="input-block-level" placeholder="Name" maxlength="80" />             <input type="text" name="email" id="email" value="" class="input-block-level" placeholder="Email" maxlength="80" />             <textarea rows="11" name="message" id="message" class="input-block-level" placeholder="Message" maxlength="1024"></textarea>
               <input type="submit" value="&nbsp;&nbsp;Send&nbsp;&nbsp;" name="submit" id="submitButton" class="btn btn-inverse pull-left" title="Click here to submit your message!" />
           </fieldset>         </form>
  and here is my PHP code: <?php $name=$_POSt['name']; $vistor_email=$_POST['email']; $message=$_POST['message'];  $email_from='ex2@gmail.com'; $email_subject="New request to A-Akawi"; //$email_body="User Name:$name.\n"."User Email:$vistor_email.\n"."User message:$message.\n";  $body = <<<EMAIL You have received a new request from $name with the following email address $vistor_email. The following request is: $message.   EMAIL;  $to ='ex1@gmail.com'; $headers .= "From: Johnson Smith <noreply@ksar.com> . \r\n" ; $headers .='Reply-To: '. $to . "\r\n" ; $headers .= "Organization: Sender Organization\r\n"; $headers .= "MIME-Version: 1.0\r\n"; $headers .= "Content-type: text/plain; charset=iso-8859-1\r\n"; $headers .= "X-Priority: 3\r\n"; $headers .= "X-Mailer: PHP". phpversion() ."\r\n";  mail($to,$email_subject,$body,$headers); header("location: contact.html"); ?>  I'm getting it to the spam even after adding the headers how to fix it?


Good book recommendations on trigonometry

I need to find a good book on trigonometry, I was using trigonometry demystified but I got sad when I read this line:     Now that you know how the circular functions are defined, you might wonder how the values are calculated. The answer: with an electronic calculator!   I know a book which seems to be really good: Loney's Plane Trigonometry, I'm just not sure if the book is up to date.


I have a CSV file that has many rows. I want to typeset these rows into a table using longtable and datatool package.     However just before before the "lastfoot" (which says concluded) I am getting an empty row which I do not want. How to remove that extra row?   The columns are not equally spaced under the dates. Somebody please help me to make them equally spaced.   I am giving the sample code. The name of my CSV file is namelist.csv and it looks like this.       number,degree,Name     1,Dr,Abdul Ali     2,Mrs,Francesca Joestar     3,Mr,Chan Ker Mei     4,Dr,Hikaru Yagami     5,Dr,Harish Kumar   My LaTeX code is below.  \documentclass[12pt]{article} \usepackage{setspace} \usepackage{bookman} \usepackage{longtable} \usepackage{pdflscape} \usepackage[a4paper,left=1in,right=0.8in,top=0.5in,bottom=0.5in]{geometry} \usepackage{tgschola} \usepackage{microtype} \usepackage{datatool} \DTLloaddb{names}{namelist.csv} %================================================================== \begin{document} % \begin{landscape} % \doublespacing % \begin{longtable}{|l|l|c|c|r|r|r|c|c|c|c|c|c|c|c|c|c|c|}\hline % No.&\multicolumn{1}{c|}{Name}& \multicolumn{2}{c|}{13.12.2010}&   \multicolumn{2}{c|}{14.12.2010}&\multicolumn{2}{c|}{15.12.2010}& \multicolumn{2}{c|}{16.12.2010} &\multicolumn{2}{c|}{17.12.2010}&\multicolumn{2}{c|}{18.12.2010} &\multicolumn{2}{c|}{19.12.2010} &\multicolumn{2}{c|}{20.12.2010}\\ \hline\hline \endfirsthead % \multicolumn{18}{c}% {{\bfseries  Continued from previous page}} \\ \hline % No.&\multicolumn{1}{c|}{Name}& \multicolumn{2}{c|}{13.12.2010}& \multicolumn{2}{c|}{14.12.2010}&\multicolumn{2}{c|}{15.12.2010}&  \multicolumn{2}{c|}{16.12.2010} &\multicolumn{2}{c|}{17.12.2010}&\multicolumn{2}{c|}{18.12.2010} &\multicolumn{2}{c|}{19.12.2010} &\multicolumn{2}{c|}{20.12.2010}\\ \hline\hline \endhead % \hline \multicolumn{18}{|r|}{{Continued on next page}} \\ \hline \endfoot % \hline \multicolumn{18}{|r|}{{Concluded}} \\ \hline \endlastfoot % \DTLforeach{names}{ \no=number, \dg=degree, \name=Name}{ \no& \dg. \name &  & &  & &  & &  & &  &  &  &  &  &  &  & \\ \hline } \end{longtable}% % \end{landscape} % \end{document}


How to test that a knife is sharp enough?

As per the question - how to I test that a knife is sharp enough? And/or, how do you know when a knife needs sharpening?  Edit: Yesterday I attempted (I feel quite successfully) to hone my knives for the first time ever (requiring me to purchase a honing steel), which immediately made a rather noticable difference (I shall be honing them regularly from now on). Not sure whether additionally sharpening them as well would be a good idea? The suggested tomato and paper tests make sense, and I shall try them in the near future and see..


Cause of Variadic Arguments being corrupted/null

I have a wrapper function that allows me to achieve the result of sprintf by writing one line of code instead of 3.  void output(const tstring& format, ...) {     va_list args;     va_start(args, format);      const int len = _vsctprintf(format.c_str(), args) + 1;     TCHAR* buf = new TCHAR[len];      _vstprintf(buf, format.c_str(), args);     OutputDebugString(buf);      delete[] buf; }   My problem: The variadic arguments are corrupted.   For example;  output(_T("%d\n"), 1); // outputs: -858993460 output(_T("%d\n"), 2); // outputs: -858993460   Whats the cause of this error and how can I fix it?


How to install Ubuntu 20.4 as secondary OS alongside Windows 10?

I am using Windows 10 and I'd like to install Ubuntu as a secondary OS (I want the first option in the "boot-up" screen to be Windows). I am a noob so please bare with me. A couple of years ago I somehow managed to do this, but I was only using one HDD at that time and didn't run into these issues. Windows 10 is installed on an SSD on my laptop. I also have a HDD inside and I shrunk this partition and freed up 50 GB to create a partition specially for Ubuntu on my HDD. I flashed a USB stick with Ubuntu on it and I am unsure how to proceed. My problem is that inside the Ubuntu installer I don't know whether I should choose Primary or Logical and which Mount point is correct. I tried Logical (which is the default option) and "/" as a mount point and the partition got created as 'Ext4', however, I don't know what option I should choose for "Device for boot loader installation". I tried /dev/sda as suggested in another thread here but the installer said "No EFI system partition was found" and it warned me that the installation might fail. In msinfo32 it says the BIOS mode is Legacy, if that is of any help. Also, here is a picture showing all the partitions available (the last one is the free space that I left after shrinking the HDD which isn't visible in this picture, but it's the 50 GB free space):  Other steps I've done after reading  I shrunk my HDD using Disk Management inside Windows. Also, Ubuntu Live USB gives me two options only: "Erase disk and install Ubuntu" or "Something else" (I chose "Something else"). After I created a partition from the 50 GB free space and chose /dev/stb as "Device for boot loader installation", it still tells me: "No EFI System Partition was found. This system will likely not be able to boot successfully, and the installation process may fail. Please go back and add a EFI System Partition or continue at your own risk." So I created a 256 MB EFI partition from the 50 GB free space as suggested in one of the related threads and the installer accepted that as a device for boot loader installation and Ubuntu was installing, but at the end it said: "Executing 'grub-install/dev/sdb5' failed. This is a fatal error" (sdb5 is the EFI partition I made). It prompted me to report the error to the developers but I didn't do that. I restarted my PC and it straight-up booted into Windows. No option to switch to Ubuntu. This is one of the most frustrating things I've ever done and I don't understand what I'm doing wrong. Thank you in advance!


What Curse Did Peter Pettigrew Use to Kill Thirteen Muggles at Once?

What curse did Peter Pettigrew use to kill thirteen Muggles at once?     Harry lay listening to the muffled shouting next door and wondered why he didn’t feel more scared. Sirius Black had murdered thirteen people with one curse; Mr and Mrs Weasley obviously   thought Harry would be panic-stricken if he knew the truth. But Harry happened to agree whole-heartedly with Mrs Weasley that the safest place on earth was wherever Albus Dumbledore happened to be.   Prisoner of Azkaban - page 55 - Bloomsbury - chapter 4, The Leaky Cauldron   I believe Avada Kedavra has to hit a person directly to kill them, yes? I can't think of any instance in canon where Avada Kedavra, for example, ricocheted and killed more than one person in one instance (Avada Kedavra ricocheting off the statues in the Ministry of Magic doesn't count!).   So what curse did Peter Pettigrew use that would have killed thirteen Muggles in one shot?  Is there a canon spell that could possibly cause such extensive damage and death?  A canon-based answer would be great.


implicit conversion from generic interface type

I have the following implicit conversion operator:  public static implicit operator InputArgument<T>(T value) {    return new InputArgument<T>(value); }   The following is code in an ASP.NET MVC controller:  This works:  InputArgument<string> input = "Something";   This works:  InputArgument<Controller> input = this;   This works:  InputArgument<IPrincipal> input = new InputArgument<IPrincipal>(User);   But this doesn't work:  InputArgument<IPrincipal> input = User;   The last example gives the error:   > Cannot implicitly convert type > 'System.Security.Principal.IPrincipal' to > 'Engine.InputArgument<System.Security.Principal.IPrincipal>'. An > explicit conversion exists (are you missing a cast?)   What could be the reason that this implicit conversion does not work for IPrincipal?


Easy way to access all of my asked questions

Is there a simple fast way to see all my recent questions?


How to attract good teachers to a young university?

I won't go into much detail, but I work at a young private university at a non-managerial position.  The uni has a strong need for better teachers and more adequate students. In my opinion, a viable strategy for quickly increasing the education quality level would be to focus on only 1 faculty/ department/ specialty first, because:   It would be cheaper to focus on one department (i.e. program creation, teachers acquisition and salary, advertizing to students). Even if a lot of students drop out due to suddenly intensifying the program, students from other departments would continue to financially support the university. Being great at one thing while temporarily neglecting others is better than being below mediocre at everything.   Focusing on one department would mean:   Intensifying the program. Attracting good teachers. Attracting better students (more willing to learn, with better background) (with the help of 1. and 2.).   I believe intensifying the program and attracting good teachers for one department (probably for CS) before attracting better students is the way to go.  I have a CS background and can help with creating the program (classes).  If I manage to convince the people in charge, how should we go about attracting good teachers (probably from other universities)? Adequate salaries would probably not be enough.  Thanks for the answers!


Does the Song of Ice and Fire take place in a hollow world?

The HBO series  and the book series it's from, , offer no examples or suggestions that the world is set in a hollow world. But the television show's  strongly suggest this very thing. Has there been an official word about the shape of the Song of Ice and Fire world?


Would someone please explain this:  "C++, pronounced "C plus plus," is a programming language that was built off the C language".  What is meaning of "off" in this statement?


Unable to connect via wifi in Ubuntu 14.04?

So, as the title suggests, I am unable to connect to any wifi network. LAN works just fine and the PC sees all of the networks near me (though, the ones I've connected to show almost 0% signal strength). I've been trying different things to no avail such as rebooting, disabling and re-enabling the wireless card (Realtek RTL8188EE), among other things that I've found online. I've run out of options and really don't want to reinstall, so some help would be very appreciated.


We define a symmetric, positive-definite matrix $A$ to be one such that $A = A^T$ and for $x \neq 0$, $x^TAx > 0$.  If we have a norm $\|x\|_A = \sqrt{x^TAx}$, how can we show the triangle inequality?    That is, we want to show that $\|x + y\|_A \leq \|x\|_A + \|y\|_A$ as is the case for typical matrix norms.    $\|x+y\|_A^2 = (x+y)^TA(x+y) = (x^T + y^T)A(x+y) = x^TAx + x^TAy + y^TAx + y^TAy = \|x\|_A^2 + x^TAy + y^TAx + \|y\|_A^2$.    This is what I have so far, but I feel like I'm not really on the right track.  Ideas?


When the response is as stupid as the question

What do I say when someone asks a stupid question, then I give them a stupid answer, after that they complain "your answer sounds as if you're talking down to me".  How do I convey that "my answer is the same as your question" or "my answer is worth your question" or "equal" or?  What would a native speaker say in this case, in ironic way? Keep in mind, that this is my friend and allow ourselves being sarcastic easily :)


What is the physical origin of group velocity dispersion?

Group velocity dispersion is the phenomenon that the group velocity of light in a transparent medium depends on the optical frequency or wavelength. [quoted from wiki]. I have tried to do my research, but a lot of the answers are not helpful. There must be some physical mechanism behind this frequency dependence right? Or is this just a general term for describing all kinds of dispersion such as chromatic disperion, modal dispersion?


I have a result list that contains something like  [(datetime.datetime(2013, 1, 1, 0, 1, 14),), (datetime.datetime(2013, 1, 1, 1, 33, 50),)]   How does one print it like 2013-01-01 00:01:14.000 , 2013-01-01 01:33:50.000 or a readable format.  I have tried printing them in string  import datetime ... for date in results:     print (str(date))   This prints   (datetime.datetime(2013, 1, 1, 0, 1, 14),) (datetime.datetime(2013, 1, 1, 1, 33, 50),)


How to discover USB storage devices and writable CD/DVD drives (C#)

How can I discover any USB storage devices and/or CD/DVD writers available at a given time (using C# .Net2.0).  I would like to present users with a choice of devices onto which a file can be stored for physically removal - i.e. not the hard drive.


SQL query - Select * from view or Select col1, col2, ... colN from view

We are using SQL Server 2005, but this question can be for any .  Which of the following is more efficient, when selecting all columns from a view?  Select * from view    or   Select col1, col2, ..., colN from view


Proposition : The only sets in $R^n$ which are both open and closed are the empty set and $R^n$ itself.  I came up with the proof of this claim and I'd like to know if my proof is correct.  Proof:  Let $S$ be the nonempty proper subset of $R^n$ which is both open and closed. Then $T = R^n-S$ is also a nonempty proper subset of $R^n$ which is both open and closed. Now take a point $s_0$ in $S$ and $t_0$ in $T$. Then we can consider a closed box $J_1$ which contains both $s_0$ and $t_0$.  The n-dimensional interval $I_1^k$ is defined by the inequalities   $s_k\le x_k \le t_k$ (k=1, 2, $...$, n ), where each $s_k$ and $t_k$ are the k-th coordinates of $s_0$ and $t_0$. Without loss of generality, assume that for all k, $s_k \le t_k$.  Here $J_1$ denotes the catesian product   $J_1$ = $I_1^1$ x  $\cdots$ x $I_n^1$   Now, bisect all of the n 1-dimensional intervals and the point $\frac {s_0+t_0}{2}$ will lie in the center of the bisected box. This point belongs to either $S$ or $T$. Say it belongs to $S$ then, rename it $s_1$ and the original $t_0$ to be $t_1$. Now again consider a box that has both points as vertices like the previous case and repeat the process.   Writing $I_k^m$ = [$s_k^m$,$t_k^m$],   we have  $t_k^m$ - $s_k^m$ = $\frac {t_k-s_k}{2^{m-2}}$  Then for each fixed k, the sup of all left endpoints must therefore be equal to the inf of all right endpoints, and their common value we donote by $b_k$ (actually we know this by Bolzano-Weierstrass).   Now we assert that b=($b_1$,$...$,$b_n$) is a limit point of $S$ and $T$. To see this, take any n-ball B(b; $r$). The point b of course belongs to each of the boxes $J_1$, $J_2$, $...$ constructed above, and when $m$ is such that $max_k\frac {t_k-s_k}{2^{m-2}}$ < r/2, this neighborhood will include $J_m$ and since $J_m$ contains both points of $S$ and $T$, b is a limit point of both sets. But since both sets are closed, they both contain b, which is a contradiction. Hence, the proposition is true.


How to prove that the implicit function theorem implies the inverse function theorem?

I can prove the converse of it, but I cannot do this one. Here is the problem:     Prove that the implicit function theorem implies the inverse function theorem.


Hide directory listing? chmod 730 /home/share?

So I want to hide the listing of all files to a particular group, yet I want them to be able to create/read files in that same folder. The following permissions on the folder appears to work (write and execute for the group):  chown root:shareusers /home/share chmod 730 /home/share   Disabling read for the group prevents them from listing the contents (which is what I want).  "execute" against the directory then appears to permit the users to both read/write files in the folder (which is also what I want). Just attempting to understand why this works?


Ubuntu 16.04: Error while performing installing (sudo apt install mysql-server)

I was having issue in mysql after ubnutu upgrade so I just followed  like purge first then install new one  sudo apt purge mysql-server mysql-server-5.7 mysql-server-core-5.7  But I am getting these errors while performing installations.   update-alternatives: error: alternative link /etc/mysql/my.cnf is already managed by my.cnf.bak dpkg: error processing package mysql-server-5.7 (--configure):  subprocess installed post-installation script returned error exit status 2 dpkg: dependency problems prevent configuration of mysql-server:  mysql-server depends on mysql-server-5.7; however:   Package mysql-server-5.7 is not configured yet.  dpkg: error processing package mysql-server (--configure):  dependency problems - leaving unconfigured No apport report written because the error message indicates its a followup error from a previous failure.                                                                                Processing triggers for systemd (229-4ubuntu17) ... Processing triggers for ureadahead (0.100.0-19) ... Errors were encountered while processing:  mysql-server-5.7  mysql-server E: Sub-process /usr/bin/dpkg returned an error code (1)


Know of any good libraries for this?  I did some searches and didn't come across anything.  Someone somewhere must have done this before, I hate to reinvent the wheel.


I have a newcommand defining a special paragraph (it's for a cheatsheet document):  \newcommand{\command}[2]{#1~\dotfill{}~#2\\}   I'm using it in the document in the following way:  \command{A}{Desc A} \command{B}{Desc B} \command{C}{Desc C}  Other section of my doc.   This code generates me a warning on line with \command{C}:  Underfull \hbox (badness 10000) in paragraph at lines <n>--<m>   I understand it's because this line is followed by a blank line.  So one solution I found to avoid this warning is to change my definition to:  \newcommand{\command}[2]{#1~\dotfill{}~#2}   (without the new line). And use it the following way:  \command{A}{Desc A}\\ \command{B}{Desc B}\\ \command{C}{Desc C}  Other section of my doc.   But I find it's not super clean, is it a way to do it automatically?   In fact, I want \command to act like a paragraph.


I have trouble defining a node on a path. If the path is described using points and the in/outgoing angle, the node is always at the beginning. If the path is described with control points, it works flawlessly.  In the code below you see that one path correctly has a node about midway, whereas for the second path the node will be placed at the start of the path.  \documentclass[border=5pt]{standalone}  \usepackage[utf8]{inputenc} \usepackage{tikz} \usetikzlibrary{math,calc}  \usepackage{amsmath}  \begin{document} \begin{tikzpicture}     \draw (0,0) .. controls (1,2) and (4,3) .. (5,5)     node [pos=0.5] (mid1) {};     \draw[fill] (mid1) circle (1pt);      \draw (0,0) to[out=90, in=-180]  (5,5)     node [pos=0.5] (mid2) {};     \draw[fill] (mid2) circle (1pt); \end{tikzpicture} \end{document}   I have a path constructed as in the second example, how can a place a node at a specific relative position (2/3 in, say)?  I am also interested why tikz treads the two paths so differently and why "node [pos= ]" works in one of the cases, but not the other.


HMAC does it matter if I chose the cipher text or the plain text as the message?

I am using HMAC to create a message authentication code. My question is, does it matter if I use cipher text + encryption key or plain text + encryption key? I had a look at a implementation and as far as I can see they just concatenate the values (message and encryption key) and hash them.