I can't get grub menu to show up during boot

After trying (and failing) to install better ATI drivers in 11.10, I've somehow lost my grub menu at boot time.  The screen does change to the familiar purple colour, but instead of a list of boot options it's just blank solid colour, and then disappears quickly and boots into the default entry normally.    How can I get the bootloader back?  I've tried sudo update-grub and also various different combinations of resolutions and colour depths in startupmanager application with no success (640x480, 1024x768, 1600x1200, 16 bits, 8 bits, 10 second delay, 7 second delay, 2 second delay...)   edit:   I have already tried holding down Shift during bootup and it does not seem to change the behaviour.  I get the message "GRUB Loading" in the terminal, but then the place where the grub menu normally appears I get a solid blank magenta screen for a while.  Here are the contents of /etc/default/grub  # If you change this file, run 'update-grub' afterwards to update # /boot/grub/grub.cfg. # For full documentation of the options in this file, see: #   info -f grub -n 'Simple configuration'  GRUB_DEFAULT=0 GRUB_HIDDEN_TIMEOUT=0 GRUB_HIDDEN_TIMEOUT_QUIET=true GRUB_TIMEOUT=10 GRUB_DISTRIBUTOR=`lsb_release -i -s 2> /dev/null || echo Debian` GRUB_CMDLINE_LINUX_DEFAULT="quiet splash" GRUB_CMDLINE_LINUX=" vga=798 splash"  # Uncomment to enable BadRAM filtering, modify to suit your needs # This works with Linux (no patch required) and with any kernel that obtains # the memory map information from GRUB (GNU Mach, kernel of FreeBSD ...) #GRUB_BADRAM="0x01234567,0xfefefefe,0x89abcdef,0xefefefef"  # Uncomment to disable graphical terminal (grub-pc only) #GRUB_TERMINAL=console  # The resolution used on graphical terminal # note that you can use only modes which your graphic card supports via VBE # you can see them in real GRUB with the command `vbeinfo' #GRUB_GFXMODE=640x480  # Uncomment if you don't want GRUB to pass "root=UUID=xxx" parameter to Linux #GRUB_DISABLE_LINUX_UUID=true  # Uncomment to disable generation of recovery mode menu entries #GRUB_DISABLE_RECOVERY="true"  # Uncomment to get a beep at grub start #GRUB_INIT_TUNE="480 440 1"


Game Board always reset to initial state Python

The exercise is to redo the game Breakthrough in Python; it's a Draughts-like game, with a board of n lines and p row.  I initiate my game board with this function:   def NewBoard(n,p):     board = [["."] * p for i in range(n)]      for i in range(0, 2):         for j in range(0, p):             board[i][j] = 'o'      for k in range(n - 2, n):         for l in range(0, p):             board[k][l] = 'x'      return board   But this always reset the board, because this function is the initial state of the game.   When I try to do the main game function, every time the player changes, the board is reseting itself:  def Breaktrough(n, p):     DisplayBoard(NewBoard(n,p))     DisplayBoard(Where(NewBoard(n, p), 1, *SelectPawn(1)))     DisplayBoard(Where(NewBoard(n, p), 2, *SelectPawn(2)))   I tried some solutions that I thought were good but weren't.


How would you categorise email subjects to find similar emails?

I have a list of email subjects like  <XYZ> commented on <ABC> Weekly review for <Company> Your account is ready    And I want to find patterns in them so I can group them.  Is there a well known algorithm I can use?


There is incircle $\Gamma$ of triangle $ABC$ tangent to $AB,BC,CA$ respectively at $K,L,M$. Point $D$ is the centre of section $MK$. $|DL|$ is diameter of another circle which intersects with $\Gamma$ at $L,P$ and with $MK$ at $D,R$. Show that line $PR$ divide $AD$ on equal parts.  Actually I have no idea how to prove it, the only thing that that occured to me is to show that AD is a diameter of circle, have anyone idea how to link the line $PR$ with section $AD$ ?


My wife and I are playing a game where you roll dice and move so many spaces in a grid "vertically or horizontally".   In the use of English it is very common to say, this or the other when it comes to making a choice  (exclusive or). Now I know that "or" can also be inclusive, for example "she couldn't read or write", or can be clearly used as an xor "you either come or not" making the statement true for only one of the options but not both.   My issue is where it is not clear whether it is an inclusive/exclusive or, the best example being our game.   I argue that you can move in either direction (inclusive) and the normal use of this conjunction in English should be inclusive unless specified otherwise.   Is this right?


When I tried to install android studio on my 14.04 LTS Ubuntu system on opt directory as according to mentioned on by clayton (Ubuntu user) but I could not install it as accordingly.   Unpack android studio zip on download directory Then open terminal fetch the file through cd ~/Downloads Then I enter sudo -i After then I tried to move android studio to opt directory mv android-studio /opt Then it says:      mv: cannot stat ‘android-studio’: No such file or directory   And I installed Qt creator5.3.2 on /opt directory for third party installation policy.It works fine except I could not fetch the examples on Qt creator and it is not showing the version of Qt.  If anybody could help me how to solve this problem. I would be really thankful in advance.


Should I include "www" in my website's URLs? What are the pros and cons?

What are the pros and cons of having http://www.example.com/ vs http://example.com/?  For example a problem I'm aware of is that if I use a domain without www I can't set a cookie for the current subdomain only (since there is no subdomain), and the cookies I set will be sent to all subdomains.


I need to know how to use quotation marks within a list

How do I punctuate this?  She said, "How many are there?", "What is his name?", and "When can she get there?"


Fluid Dynamics applied to Aircraft wings

On aircraft wings, the bottom is flat and the top is curved. I know this benefits the aircraft by producing lift, but I wish to understand how. I'm told it has something to do with how fluids behave.


Windows 10 won't shut down - I run out of solutions :(

My computer won't shut down. If you try to shut down the LED on the Power button will continue to be on and you can clearly hear all the fans inside running. It's stuck in Limbo. Only after pressing the power button for a view seconds it properly shuts down.  I've spent weeks looking for a solution, now I'm just really disappointed by Windows and myself for not getting this fixed. I really hope you guys can help me.  This is my system:  Intel Core i5 2500k CPU Asus P8P67 Rev 3. Mainboard Kingston 16GB HyperX DDR3 RAM Samsung 850 Evo 500GB SSD 2nd 500GB hard disk Corsair 500W CM9 PSU   This is what I've tried so far:   Disabled the Windows 10 hibernate / fast startup feature Tried to downgrade the Intel Management Engine drivers to a 9.xx Version Tried multiple versions of Intel Rapid Storage (now uninstalled it) Tried multiple Intel Chipset drivers Tried to disable every non-windows service to see if it's a software issue. Replaced PSU   I tried to find a solution with Windows and Asus but both keep saying this is not a common issue.  I would really appreciate some help.


Intuitively, why does $\int_{-\infty}^{\infty}\sin(x)dx$ diverge?

According to Wolfram Alpha, $\int_{-\infty}^{\infty}\sin(x)dx$ does not converge.  This makes no sense to me, intuitively, which I'll justify with a plot:    As we see, the positive and negative areas 'cancel out', so, for any $\alpha \in \mathbb{R}$, $\int_{-\alpha}^{\alpha}\sin(x)dx=0$ (I'm just thinking geometrically- in no way is this supposed to be a rigourous justification).  So, why is is that $\int_{-\infty}^{\infty}\sin(x)dx$ diverges?  A natural and intuitive reason, more than a rigourous one, would be best.  Thanks


Have dual XP and Ubuntu. Want to uninstal and the reinstal XP and keep Ububtu

I have both systems right now. I have installed Ubuntu from CD. My XP is divided in two parts (system and local disc). I would like to uninstall XP and install it again fresh.  There is no option to uninstall XP at Add/Remove Programs.  How can I do that with keeping my local disc intact?   Thank you very much! :)  Nikoleta


The  tag is a synonym of , and has the description     A program to generate tags for a large project. These tags are usable by the Emacs text editor.   This is inconsistent: tags in that sense are always plural, i.e. etags, never etag.  evidently refers to another concept, .  Should  remain a synonym of , and be about HTTP Etags, and should Emacs etags be tagged +? Or should the synonym be unmade, with HTTP Etags on  and etags on ?


how to change "kind" of files in OSX mavericks?

I have assigned Text Wrangler as the default app for all my .srt files (right click on one of the files -> get info -> open with Text Wrangler -> change all).  My confusion is that even though I have done this, in Finder some of the (.srt) files show as "Text file" while most show as "TextWrangler document".  I've remove all the .DS_Store files in my volume but still no change.  Does anyone know how to fix this?  In saying that, double-clicking on the .srt files marked as "text file" still opens them in Text Wrangler.  thanks a lot


What book is better for learning calculus Courant, Apostol or Spivak?

I want fo learn (Real) calculus and I've seem those books are very recommended, now I know why, I've given them a look and I think they are worth their reputation. I'm talking about  Calculus by Michael Spivak Calculus by Tom Apostol Introduction to Calculus and Analysis by Fritz John and Richard Courant  I want to read them all, but I have to chose: what should I pick and why? are there any sustactial difference? if I have to read them all, in what order should I read them?


Can pinpoint targeting and vital strike be used together?

Are the feats  and  be used together?  Vital strike is used on an attack action which is a special action which uses your standard action, so cant be used during a full round action.  Pinpoint targeting is a standard action, but doesnt say its an attack action.


Sorry to throw a question with such little information.  Hardware:  Overall - 500S-14ISK Laptop (ideapad)  Wifi Card - I'm very keen to find out but the manufacturer seemed to let out little information, so I'm keen to find out what is it exactly. I think it is Broadcom. here's a link to its windows driver   Software: fresh install of Ubuntu 16.04 LTS  I'm taking notes from  but not sure how to start - total newbie here.  I'm also trying to use  but lspci -nn actually showing a network controller as Qualcomm Atheros Device, with no wireless device insight it has [168c:0042] (rev 30) labeled.  So appreciate any help I can get and I'm more than happy to post any diagnostics here.  Thanks!


PyCharm/IntelliJ update error under Ubuntu 16.04

I am getting a java.io.FileNotFoundException when trying to update PyCharm/IntelliJ:   Ubuntu 16.04. Installed PyCharm as per GetDeb in . It says it wants to update from PyCharm 2016.3.2 to 2016.3.3.  It says I do not have write access to /usr/share/pycharm.  So I run sudo pycharm. After Downloading Patch File and "Some conflicts were found in the installation area" where its "Solution" is "IGNORE" I click Proceed.   Get "Failed to Apply Patch":  Temp. directory: /root/.PyCharmCE2016.3/system/tmp/patch-update  java.io.FileNotFoundException: /root/.PyCharmCE2016.3/system/log/idea.updater.files.tmp.0/temp.tmp.1/bin/pycharm.png (No such file or directory) at java.io.FileInputStream.open0(Native Method) at java.io.FileInputStream.open(FileInputStream.java:195) at java.io.FileInputStream.<init>(FileInputStream.java:138) at com.intellij.updater.Utils.newFileInputStream(Utils.java:260) at com.intellij.updater.UpdateAction.doApply(UpdateAction.java:65) at com.intellij.updater.PatchAction.apply(PatchAction.java:201) at com.intellij.updater.Patch.lambda$apply$2(Patch.java:323) at com.intellij.updater.Patch.forEach(Patch.java:372) at com.intellij.updater.Patch.apply(Patch.java:321) at com.intellij.updater.PatchFileCreator.apply(PatchFileCreator.java:84) at com.intellij.updater.PatchFileCreator.apply(PatchFileCreator.java:76) at com.intellij.updater.Runner.doInstall(Runner.java:303) at com.intellij.updater.Runner.lambda$install$0(Runner.java:272) at com.intellij.updater.SwingUpdaterUI.lambda$doPerform$4(SwingUpdaterUI.java:190) at java.lang.Thread.run(Thread.java:745)   I think IntelliJ is involved because that is a default for the editor settings.


I changed my password to none and now i cant authenticate nor even cant do sudo?

I have admin rights. Could there be a way to change back my pass. I dont even know whats my password is because I already set it to "none' now its very hard to install apps. Need help please ! Fast.


How do I find the terminal command for anything?

I love creating hotkeys to open programs and menus, but sometimes I can't figure out what the command for something is. For instance, it took some Googling to find out that the system monitor is opened with gnome-system-monitor  Is there anyway to figure out the terminal command for any program or menu (such as keyboard shortcuts or display settings) in Ubuntu?


Where [if anywhere] should the apostrophe go in "three days work"?

Which is correct?     1 Three day's work      2 Three days' work      3 Three days work   I would probably guess (2) is right, since the work belongs to the three days ("three days of work"). But I'm not sure. Would it be different if it was only one day?


How to enable Unix file system support on Linux kernel?

After switching from Debian stable to Debian testing i have a problem to mount my FreeBSD root partition on my system:   I find out what filesystems my Linux kernel supports through this command cat /proc/filesystems :  nodev   sysfs nodev   rootfs nodev   ramfs nodev   bdev nodev   proc nodev   cpuset nodev   cgroup nodev   cgroup2 nodev   tmpfs nodev   devtmpfs nodev   debugfs nodev   tracefs nodev   securityfs nodev   sockfs nodev   bpf nodev   pipefs nodev   hugetlbfs nodev   devpts nodev   pstore nodev   mqueue     ext3     ext2     ext4 nodev   autofs     btrfs   By default The Linux Kernel can’t read/write on FreeBSD-ufs  partition.  How to enable Unix file system (ufs) support on Linux kernel?  Update  the output of:  modprobe ufs mount -t ufs -o ufstype=ufs2 /dev/sda4 /mnt/ufs_mount   is:  mount: /dev/sda4 is write-protected, mounting read-only mount: wrong fs type, bad option, bad superblock on /dev/sda4, missing codepage or helper program, or other error     In some cases useful info is found in syslog - try    dmesg | tail or so.   The output of dmesg | tail :     [ 1136.965142] ufs: ufs_fill_super(): bad magic number [ 1255.758946] ufs: ufs_fill_super(): bad magic number [ 2098.945757] ufs: ufs was compiled with read-only support, can't be mounted as read-write [ 2098.946045] ufs: You didn't specify the type of your ufs filesystem        mount -t ufs -o ufstype=sun|sunx86|44bsd|ufs2|5xbsd|old|hp|nextstep|nextstep-cd|openstep ...        >>>WARNING<<< Wrong ufstype may corrupt your filesystem, default is ufstype=old [ 2098.967212] ufs: ufs_fill_super(): bad magic number [ 2927.982112] perf: interrupt took too long (2504 > 2500), lowering kernel.perf_event_max_sample_rate to 79750   My sources.list:  deb http://httpredir.debian.org/debian/ stretch main deb-src http://httpredir.debian.org/debian/ stretch main  deb http://security.debian.org/debian-security stretch/updates main deb-src http://security.debian.org/debian-security stretch/updates main   And uname -a:  Linux debian 4.6.0-1-amd64 #1 SMP Debian 4.6.4-1 (2016-07-18) x86_64 GNU/Linux


Find remainder when $777^{777}$ is divided by $16$.   $777=48\times 16+9$. Then $777\equiv 9 \pmod{16}$.   Also by Fermat's theorem, $777^{16-1}\equiv 1 \pmod{16}$ i.e $777^{15}\equiv 1 \pmod{16}$.  Also $777=51\times 15+4$. Therefore,   $777^{777}=777^{51\times 15+4}={(777^{15})}^{51}\cdot777^4\equiv 1^{15}\cdot 9^4 \pmod{16}$ leading to $ 81\cdot81 \pmod{16} \equiv 1 \pmod{16}$.  But answer given for this question is $9$. Please suggest.


How to join multiple tables (SQL) to find the difference between an order and shipped quantities?

I have a collection of orders that were submitted to an internal ERP, which were processed and partially shipped.  The table hierarchy is as follows:   Order table contains OrderReference(PO), OrderID OrderItems table contains Product/Lot/Qty requested (OrderID is parentID that joins these tables) Shipping contains OrderReference(PO), ShippingID ShippingArchive contains Product/Lot/Qty that was shipped (ShippingID is parent that joins these tables)   I want to create a report that looks as follows:  OrderReference#  Order Requested / Shipped Items / Missing Pieces  PC/Lot/Qty    -   PC/Lot/Qty    - PC/Lot/Qty   I have used a temp table to get some of the data but I realize I'm taking the wrong approach. I should be able to do all of this with a single query, though it will seemingly be a bit complex.   I get held up when I try to think about how to join where pieces don't exist, and where to perform the mathematics in my sorting and filtering. Please help!  Sincere thanks :)


Visiting the US after overstay as a minor

I found stories related to mine but none answered how I should fill out the Visa Waiver Program ESTA form. I moved to the US with my mother when I was 9 years old and left when I was 12 (with a Brazilian passport). We became illegal on the last month we were there.    Now, 11 years later, I wish to go back to the US for a visit. I recently got my Italian citizenship and passport, so I would go under the Visa Waiver Program. I’ve seen answers here in which most people could go back through the VWP.    Should I answer “yes” or “no” on the ESTA form to the question that asks if I ever overstayed in the US?    Although illegal, I was a minor the whole time I was there.    Could anyone who’s been/has a kid who’s been through a similar situation help me, please?


Finding an object's final velocity with distance dependant force

I am (just for fun) trying to calculate the velocity with which the moon would impact the earth if it stopped orbiting and simply headed towards earth.   I know the force is $\frac{G m_1 m_2}{r^2}$.  How do I calculate a final velocity resulting from a varying acceleration which in turn is dependant on a varying force which in turn is dependant on a varying distance.


Remove all classes that begin with a certain string

I have a div with id="a" that may have any number of classes attached to it, from several groups. Each group has a specific prefix. In the javascript, I don't know which class from the group is on the div. I want to be able to clear all classes with a given prefix and then add a new one. If I want to remove all of the classes that begin with "bg", how do I do that? Something like this, but that actually works:  $("#a").removeClass("bg*");


Is this the correct way to write this sentence?

Okay, so I came across a strange, yet interesting dilemma, There was an English test in my high school in which I got a challenging MCQ. Here it is: Anyone can have ________ name in the newspaper. Choices given were: 1- Their 2- His 3- Her I selected the option 1, all my friends did! But my teacher sort of challenged me to verify whether I was correct or not! I'm not sure myself, so I'm asking this question on Stack Exchange. Thanks.


How do I install Adobe Air using "Ubuntu Software Centre"

I tried:   Launching Ubuntu Software Centre I typed in "air" and found "adobe air" It says "available from the 'maverick-partner' source. and has a button "use this source" I clicked "use this source", I saw a "in progress (1)" icon come up in the side bar, and disappear, but nothing happened/changed.   I'm stuck.  I have actually already added the maverick-partner source to apt so I could install sun-java6-jdk.


Finding a replacement for the scoreboard player test

I was trying to use the command /scoreboard players test @p Objective 1 in 1.14.2, but it seems like 1.14 has changed every command in Minecraft. I need help finding a replacement for this command.  I want to explain why this question is unique. For the first, the example of a possible duplicate of my question is not the same because I asked about scoreboard commands and not to check blocks, and I want to quote this comment:     MBraedley: Same answer does not make for the same question, so I would   not close this question as dupe (at least to the proposed target).   Even though I don't think its the exact same answer, because the only same thing about the answer was /execute if and the continued answer was score player objective matches 1, and my point with this answer was that you can't use /scoreboard players test objective 1\ anymore, and if you want to test a score, you have to use the answer I provided, or at least if you want an exact replacement for the command I mentioned in my question.  Since Minecraft 1.13 & 1.14 they have reworked many or maybe nearly all the commands in Minecraft, and for me, and for a lot of people, this has been very confusing, and I have had to learn much of the commands over again, or adjusting my commands.


Tell Latex to ignore ALL unicode errors?

I have a web interface that generates LaTeX-letters to customers. These letters are rendered dynamically. Some customers have some special characters in their names, that LaTeX can't translate, so I run into unicode errors all the time. The *.tex-Template includes \usepackage[utf8]{inputenc}, but I keep having problems with unicode characters. Here are two error messages from today: Unicode char \\u8:\xc2\xb0 not set up for use with LaTeX. Unicode char \\u8:\xe5\x8d\x97 not set up for use with LaTeX. For now, I use a Python dictionary to convert some already as problematic identified chars into correct LaTeX code. But it's never ending. Is there a way to tell LaTeX to ignore ALL unicode-related compiling errors, e.g. by telling LaTeX to convert all problematic chars into one ?-char?


Energy dissipated when two charged capacitors are connected in parallel

The question at hand is:  "Two capacitors of capacitances $C_1$ and $C_1$ have charge $Q_1$ and $Q_2$. How much energy, $\Delta w$, is dissipated when they are connected in parallel. Show explicitly that $\Delta w$ is non-negative."  I'm confused about what the physical situation is. I took the assumption that these capacitors were somehow pre-charged, and then connected to each other in parallel without a voltage source. However, I don't understand how this would work. If a circuit is composed of only 2 elements, I don't see how they could be in any arrangement but series. Nevertheless, I tried solving it that way:  Two capacitors in parallel have the same voltage drop. Charge will be redistributed to make it the same voltage for both. Let $Q_1'$ and $Q_2'$ be the charges on the capacitors after they are connected. Now, picture the equivalent capacitor  $C_{eq} = C_1 + C_2 =$ $\frac{Q_1' + Q_2'}{V_f}$   conservation of charge:  $Q_1' + Q_2'= Q_1 + Q_2$,        $C_{eq} =$ $\frac{Q_1 + Q_2}{V_f}$  $V_f = $$\frac{Q_1 + Q_2}{C_1 + C_2}$  The initial energy of the capactiors is:  $U_0 = $$\frac{Q_1^2}{2C_1}$$+\frac{Q_2^2}{2C_2}$  $U_f = $$\frac{1}{2}$$(C_1 + C_2)V_f^2 = $$\frac{(Q_1 + Q_2)^2}{2(C_1 + C_2)}$  $\Delta U$$ = $$\frac{(Q_1 + Q_2)^2}{2(C_1 + C_2)}$-$\frac{Q_1^2}{2C_1}$$-\frac{Q_2^2}{2C_2}$  However, I don't see how this is necessarily non-negative.


I visited StackOverflow over (more than) 801 days and would like to know if I'm the most active one, after all others. So it should be possible to get the visited days of each user on the ?? Not too hard to implement, I think.


I'm a moderator on Stack Overflow на Русском (Stack Overflow in Russian). Currently there is . And suddenly I can join it.    I think, an active moderator shouldn't be able to join election.


I am looking for a module or way to use an external RSS feed in a view. I know this was easily done in Drupal 6, but I can't seem to find much on Drupal 7.  I am trying to use Views RSS, but there is very limited documentation.


My Apple mouse has only one button (a Left button). Normally I use                   ctrl + left mouse as a way to use the left mouse button but it doesn't work with blender. what do I have to do. Because I can't select anything.


Can we use a sort of "hash" function in CTR mode instead of a block cipher?

CTR mode does not use the decryption function at all, only the encryption function.   This may suggest that a different primitive that has this "one-way" property could do the trick. For instance, I just thought we could map the secret key with the counter under a secure hash function to obtain a complete usable and secure cipher with CTR mode, why is this assertion false?  Maybe a secure hash is not enough, but     Can we use a different primitive as a cipher in CTR mode, not necessarily a PK Cryptosystem?   Thanks a lot for your answers and comments.


sending a string from php to javascript function

Im tring to pass a string which im getting from my database to a javascript function.  In my php I have:  <input type="image" name="edit_me" id="edit_me"  value="<?php echo $row['id']; ?>" onClick="edit_chirp(<?php echo $row['id']; ?>)"/> //THIS WORKS   When I pass the id im getting it works fine but when I pass a field where it has text it doesnt work.  <input style="float:right" type="image" name="edit_me" id="edit_me"  value="<?php echo $row['id']; ?>" onClick="edit_chirp(<?php echo $row['content']; ?>)" //THIS DOESNT WORK   My javascript function is  function edit_chirp(somethig)     {         alert(somethig);     }


Install button in the software center is grayed out when trying to install .debs without an internet connection

I just installed ubuntu 11.10 from a usb stick.   After installation, none of the software which I had collected and run on 11.10 or 11.04 runs on it. Even my newly downloaded opera or chrome installations does not work.  I do not have a internet connection.  Whenever i try to install any .deb file by double clicking it,software center opens up but the install button is grayed out.


How can I install java openjdk 8 on High Sierra or newer macOS

How do I install OpenJDK 8 on High Sierra or newer macOS? It looks like support for the Java Oracle JDK version 8 will be deprecated after January 2019  Additionally, it looks like publishing and distributing Docker containers with the Oracle Java JDK may not be legal


Mouse cursor doesn't change to pointer when hovering "full site" on mobile

When (accidentally) clicking "mobile" in the footer, one gets the mobile site in a regular browser too. To switch back, one can click "full site" in that same footer:    However: when hovering it, the mouse is changed as to select text, rather than to indicate one can click (even though it's clickable).  All other links do change the mouse into a pointer.  (Not a big deal, except when somehow  getting into the mobile mode, I guess.)


I was just learning about how, if you multiply any two complex numbers together, you get a new complex number. With that in mind, is there such a thing as complex numbers that cannot be factored, or prime complex numbers.


$f$ an analytic function on $\mathbb{C}$ which takes values in $\mathbb{C}\backslash(-\infty,0]$ implies constant

Let $f$ be an analytic function on $\mathbb{C}$ which takes values in $\mathbb{C}\backslash(-\infty,0]$, i.e. takes values in the complement of the nonpositive part of the real axis. Show that $f$ is constant.  My first observation is that there is a branch of the square root defined on $\mathbb{C}\backslash(-\infty,0]$ which takes positive real values along the positive part of the real axis. But I am not sure what do from thereon out. Any help would be appreciated!


Consequences of smoking marijuana during pregnancy (especially first weeks)?

I just found out yesterday I am 4 weeks pregnant, I am a regular weed smoker I usually smoke once a day at night right before bed just a couple hits out of my pipe so I basically smoked every night for the first 4 weeks of my pregnancy because I did not know. I'm just wondering how much it would have hurt the fetus? I'm really freaking out.. I feel so guilty. Please help.


I want my image to be in the middle of the height in the box. This my code (image)(The code is below the article)  I want(image)(width screen < 767px)  I want it to be the same on every screen (responsive) Thank you   .question-answer {     background: #ffffff 0% 0% no-repeat padding-box;     border-radius: 29px;     border: 1px solid #C9C9C9;     cursor: pointer;     color: #303030; } .question-answer .question {     display: flex;     justify-content: space-between;     padding-right: 30px; } .question-answer .question .content {     padding: 0 34px;     text-align: left;     font-size: 14px;     font-weight: bold;     font-family: Open Sans;     letter-spacing: 0px;     color: #686868;     opacity: 1;     letter-spacing: 0px;     position: relative;     padding-right: 30px;     min-height: 57px;     display: flex;     align-items: center; } .question-answer .question img {     max-width: 24px;     max-height: 24px;     margin-top: 17px; } @media (max-width: 767px){   .question-answer .question .content {       padding-top: 15px;       padding-bottom: 15px;       padding-right: 0px;   }   .faq-page .question-answer .question img {   } }

Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore


$\varepsilon$-number countability without choice

Let $\alpha\mapsto\varepsilon_\alpha$ be the enumeration of the $\varepsilon$-numbers--that is, those $\alpha$ such that $\omega^\alpha=\alpha$--by the ordinals.  If we know that countable unions of countable sets are countable, (slightly weaker than countable choice), then we can show fairly easily that $\varepsilon_\alpha$ is countable iff $\alpha$ is countable.  I think I saw a result at some point that $\varepsilon_0$ is countable without relying on any choice principle (though I can't recall where I saw that). Is this true? More generally, for which $\alpha$ can we conclude that $\varepsilon_\alpha$ is countable in ZF?  Update: I have been able to prove (in ZF) that if $\varepsilon_\alpha$ is countable, then $|\alpha|<\aleph_1$, so that's one direction. I'm still a bit uncertain about the answers I've got so far.


I want to start sectioning with 1 instead of 0.  I start with subsections, but they start with 0.1 and 0.2 and 0.2.1 - for example - I want it to start with 1.


Echo a blank (empty) line to the console from a Windows batch file

When outputting status messages to the console from a Windows batch file, I want to output blank lines to break up the output. How do I do this?


Last night, I was using Chrome just nicely, but this morning, I can't even start Google Chrome as it immediately crashes. I have already tried a clean uninstall and reinstall of Google Chrome but still the same error pops up (it does not happen while I'm opening Google Chrome. I woke up and only then realized I can't open my Chrome and it keeps popping up saying that Google Chrome has stopped working.)  OS : Win 7 64-bit  Here is the detail of the crashes  Problem signature:  Problem Event Name:    APPCRASH   Application Name:    chrome.exe    Application Version:    35.0.1916.114 Application Timestamp:    53726019    Fault Module Name:    chrome.dll   Fault Module Version:    35.0.1916.114   Fault Module Timestamp:    53725d18    Exception Code:    c0000005    Exception Offset:    00728bc8      OS Version:    6.1.7600.2.0.0.768.3    Locale ID:    17417    Additional Information 1:    0a9e    Additional Information 2:    0a9e372d3b4ad19135b953a78882e789    Additional Information 3:    0a9e    Additional Information 4:    0a9e372d3b4ad19135b953a78882e789     Any help that will solve this problems is greatly appreciated.


How do i show any subgroup of index $p$ is normal?

If $G$ is a finite group of order $n$ and $p$ is the smallest prime dividing $|G|$, then prove that any subgroup of index $p$ is normal.  This falls under the category of Cayley's Theorem, but i have difficulty in proving this. Please help me out!


Working with Mongoose Arrays synchronously via async-await

So I've been trying to figure out what exactly I'm missing in a logic loop I've created. The following example closely recreates my situation:  async function x() {     const items = await Items.find().exec();     console.log(items);     for(item in items) {         console.log(item);     } }   So the outcome for that little code block for me is that items holds an array of mongoose documents as expected, but here is the issue: item apparently is 0.  When I look at the mongoose document the only value that is 0 on it is the __v value, which in my understanding is the version that document is at. Am I just missing something or is this just not possible?  To note this returns as expected:  async function x() {     const items = await Items.find().exec();     console.log(items);     items.forEach(item => {         console.log(item);     }); }   This logs both the array and a single mongoose document, the issue is I'm looking to do another async call in that second loop that I want to await so if that's not possible I'll have to break it up more I guess, but I'd like ot know where that 0 is coming from if possible.  EDIT: To clarify, I have tried running toObject on both but it doesn't seem to change anything, and actually on the array it says toObject isn't a function of the array.  EDIT 2: I was not asking why for...in was bad, I was asking why it was not iterating over the "array" I had, it was due to the fact that mongoose returns a collection and for...in iterates over the enumerable properties of an object.


Prove the following inequality for all real numbers a,b,c,d

In this question I think we take the cyclic summation.... I am not familiar with it and could not understand it.Could you please help me and explain it in a easy way. Also how to you go about solving this problem? Thanks in advance I am familiar with AM-GM-HM-RMS inequality and Cauchy Schwarz inequality. $$\frac{a}{b+2c+3d}+\frac{b}{c+2d+3a}+\frac{c}{d+2a+3b}+\frac{d}{a+2b+3c}\geq\frac{2}{3}.$$


Where can I download the 32-bit ISO of Ubuntu?


How can I install windows while Ubuntu is already on my system?

I have Ubuntu 12.10 on my system and I want to install Windows 7. I tried it but Ubuntu was not found on the system anymore so I had to install Grub. When I installed the Grub menu on Ubuntu, Windows created a hard disk in NTFS file but when I rebooted, Windows didn't show up. I deleted all the Windows files. Now I want to re-install Windows 7 once again but I don't really know how to do that.


To what extent are half-breeds treated as humans?

I went through the first page of an  that asks a similar question and doesn't get an answer. Now that there is more information on the subject, I'd like to know for a build I'm working on, a Half-Elf Sorcerer/Oracle/Mystic Theurge: to what extent are half-breeds treated as humans?  Normally I'd just assume that half-elves/orcs can lean towards whatever side of their ancestry they want, but it seems to be controversial enough that I do need to ask what the RAW is. What are half-humans allowed to take that is usually reserved for their halves only?  I'm looking primarily for a RAW answer, but I'd take an RAI answer if no RAW answer exists. Normally I'd be the first to agree that "effects" has nothing to do with favored class bonuses, but it would appear to be accepted that half-elves can take human-only classes, which are not effects by any means.  The half-races in question are primarily  and , and at least as far as Favored Class Bonus is concerned the side-bar on those two pages would appear to confirm that yes, half-elves/orcs can take the Favored Class Bonuses of either elves/orcs or humans, but in a broader sense it could also apply to the planar races (aasimars, tieflings, sylphs, ifrits, oreads, and undines, possibly more) that have the following ability (or close variation thereof; this is taken from ):     Scion of Humanity Some aasimars’ heavenly ancestry is extremely distant. An aasimar with this racial trait counts as an outsider (native) and a humanoid (human) for any effect related to race, including feat prerequisites and spells that affect humanoids. She can pass for human without using the Disguise skill. This racial trait replaces the Celestial language and alters the native subtype.   The biggest reason that this partially extends to them as well is because they now have the Humanoid (Human) type with this trait, which is fine by itself, but according to the sidebar on the same page any humanoid could be an aasimar (or any of the other planar races). As a sub-question to this one, if the prerequisite for human/elf/orc/etc.-only feats, race traits, classes, favored class bonuses, etc. is to have the "Human/Elf/Orc/etc." subtype... would these races with that ability be able to qualify for those things as well?


Are there rules for using manacles in combat?

I can't quite find in the PHB or DMG how to slap manacles onto someone during combat. PHB 152 describes how to break out of mundane manacles, while DMG 165 shows how Dimensional Shackles work (they are essentially magic manacles -- use 1 action to bind an Incapacitated target).  Is there an official rule on how to use manacles in combat, or do we have to use house rules?


just as all other engineering students, I was taught in my mechanics lectures that stress tensors are always symmetrical. Back in the day I just accepted that fact, but now after some time, I wonder about the actual reason behind that. Consider the exemplary 2D stress states below: Both are capable of fulfilling equlibrium of forces and momentums and are plausbile on a macroscopic scale. Yet on an infinitesimal scale, as we all have learned, only the one on the left hand side can occur. Could anyone explain to me why that is? (sadly I'm no mathematician, so I'd be glad for an "understandable" explanantion ;)


As I use SSH, I would like to get the denyhosts that I read about , but when using the command:  sudo apt-get install denyhosts   To install it, I got this error:  Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package denyhosts   So is this package no longer available then? Or is it just under a different name or something? If this package is no longer available on the main Ubuntu repositories, is there anywhere else from which I can get it?  OS Information:  Description:    Ubuntu 14.10 Release:    14.10


So here's the scenario: Bought chicken and put immediately in the freezer like 3-4 weeks ago.  I pulled the chicken out yesterday afternoon and put it in the fridge to let it thaw to let it cook for dinner. Ended up not using it so I put it back in the freezer this morning.  Is this safe to do? The chicken was still somewhat frozen-ish when I put it back in the freezer, although the Chickens expired date was 10 days ago, but it has been in the freezer since.


Cannot revert a downvote even though the author edited their answer after I downvoted

I read this answer and didn't like it, so I downvoted.  I also commented why I left the downvote.    Later, the user edited the post to such a degree that I'm willing to revert the downvote (though I still won't upvote).  However I can't because:     You last voted on this answer 22 mins ago Your vote is now locked in   unless this answer is edited   But the user did edit?


how to set attributes for array variable in java(OOP), in line 43 why o[0].name doesnt work?

how to set attributes for array variable in java(OOP)? attributes of o[] could not be set within the for loop, why? Im trying to set name for o[0], but o[0].name doesnt work. why this happened? Also setter and getter doesnt work either, can you help me explain why can not set attributes in o[]?  import java.util.Scanner;  public class Orders {     private String name;     private double price;     private int quantity;      public void setName(String name){         this.name= name;     }     public String getName(){         return name;     }     public void setPrice(double price){         this.price=price;     }     public double getPrice(){         return price;     }     public int getQuantity(){         return quantity;     }     public void setQuantity(int quantity){         this.quantity=quantity;     }      public static void main(String[] args) {         int num = 0;         double sum=0;         Scanner sc = new Scanner(System.in);         System.out.println("how many rows of order: ");         num = sc.nextInt();         Orders[] o = new Orders[num];          sc.nextLine();          for(int i = 0;i<=o.length;i++){              System.out.println("The name of the product: ");             o[0].name=sc.nextLine();             o[i].setName(sc.nextLine());             System.out.println("Price of product: ");             o[i].setPrice(sc.nextDouble());             System.out.println("Quantity of product: ");             o[i].setQuantity(sc.nextInt());         }         for(Orders a: o){             System.out.println("Name: "+a.getName()+". Price: "+a.getPrice()             +". Quantity :"+a.getQuantity());             double totalprice= a.getQuantity()*a.getPrice();             sum = sum + totalprice;         }          System.out.println("total price: "+sum);     } }


Okay I like have no idea how to do this. I tried integration by parts then everything came back uglier. I then put this in wolfram it says "No found in standard mathematical functions"   Is there a easy way to do this?   Maybe like FTOC II?


is there any problem if i reset my unrooted andoif mobile that is previously rooted?

My phones play store is not connecting to internet it shows connection error.... and some of the app is not connecting to internet. I think factory reset may solve this problem but I have rooted my phone and then unrooted. what will happened if I reset my phone?   device name : Intex Aqua Q5 (released recently) currently no firmwares available on the internet.  Android Version : 4.4 kitkat


why do some rankings depend on keywords grouped by "

Say if i have a keyword "gold jewellery" this ranks my site on the first page of google. However typing: gold jewellery in google does not rank the site. What is the best way to overcome this issue?


Asymptotic solution of recurrence equation

I need help to find asymptotic solution of this recurrence equation $T(n)=\sqrt{n}T(\sqrt{n})+cn$ where $c$ is constant.


How to prevent malicious code execution loading blend files?

Since I download from time to time example files from blogs, wikis etc. I would like to know how I can avoid execution of malicious code.   Is it enough to disable the  and see what is in the text editor?


How to break the long equation when they wrap by a bracket?

This is the equation:  \begin{equation} U^*=\arg \underset{U}{\max } \sum _{m=1}^M  \omega _m \left[\ln \left(P_{\Lambda _m} (X(U,m)|C)\right)- \omega _{\text{KLD}} D_{\Lambda_m}\left(C(U),C\right)\right] \end{equation}   I try to use split but it has error:  \begin{equation} \begin{split} U^*=\arg \underset{U}{\max } \sum _{m=1}^M  & \omega _m \left[\ln \left(P_{\Lambda _m} (X(U,m)|C)\right)- \\  &\quad \omega _{\text{KLD}} D_{\Lambda_m}\left(C(U),C\right)\right] \end{split} \end{equation}     I follow , but it seems not work for me.  How to make it effect?


Are dynamic dispatch and dynamic binding the same thing?  Thanks  Maciej


why "happen" is not given an "s" in this sentence? "I have seen it happen to friends."

I saw this sentence in a book, and the verb "happen" has no "s":     I have seen it happen to friends.   May the sentence be wrong? and if it is correct in what cases we can not give "s" to a verb?


How can I preserve an active redstone circuit when I leave the chunk it's built in?

When I set up a redstone circuit for rotating blocks (with pistons) or flashing redstone lights, everything's fine, but when I exit that zone, the current is not saved, and when I return later, the blocks have stopped moving or the lights have stopped flashing.  I don't want to reassemble part of the circuit each time I come by -- How can I keep the redstone circuit running when I'm far away?.


In C# 3.0 you can create anonymous class with the following syntax  var o = new { Id = 1, Name = "Foo" };   Is there a way to add these anonymous class to a generic list?  Example:  var o = new { Id = 1, Name = "Foo" }; var o1 = new { Id = 2, Name = "Bar" };  List<var> list = new List<var>(); list.Add(o); list.Add(o1);   Another Example:  List<var> list = new List<var>();  while (....) {     ....     list.Add(new {Id = x, Name = y});     .... }


Detailed proof that no essential singularity at infinity implies polynomial

Suppose $f(z)$ is holomorphic in the whole plane, and that $f(z)$ does not have an essential singularity at $\infty$. Prove that $f(z)$ is a polynomial.   I've tried following the hint given in . Since $f(z)$ has a nonessential singularity at $\infty$, so $g(z)=f(1/z)$ has a nonessential singularity at $0$. There are two cases:  1) $g(z)$ has a removable singularity at $0$. This means $\lim_{z\rightarrow 0}zg(z)=0$.  2) $g(z)$ has a pole at $0$. This means $g(z)=h(z)/z^k$ for some analytic function $h(z)$ such that $h(0)\neq 0$.  How can I finish each of these cases?


I have been hearing about this term "regress out the variable" all the time and understand that it roughly means that you exclude the effects by that variable. But how does one mathematically do this?  I wish to learn how to do it in this example: The data set includes the variables brain volume, cortex thickness, age, and gender of 100 subjects. The variables of interest are brain volume and cortex thickness, and the nuisance variables that I wish to "regress out" are age and gender. How do I regress them out mathematically?  P.S.: I have learned the existence of  and , but after reading through the question and its answers, I feel that how to DO it is still very vague. I believe a worked example like this question will greatly help the future readers. So I post it anyways.


Could the granting lag for each badge be added to the FAQ?

With  questioning why Badge X hasn't been awarded yet, would it be possible to add a line to each badge description:   This badge will be awarded within an hour of meeting the criteria This badge will be awarded within 48 hours of meeting the criteria This badge will be awarded within seven days of meeting the criteria   Or perhaps at least add a question / entry into :  The following badges are awarded within five minutes of meeting the criteria:  [badge:Nice Question] [Nice Answer]...  The following badges are awarded within 48 hours of meeting the criteria:  ...  This would be most helpful in responding to questions like  as well as the many bug requests about un-awarded badges.


Uniform continuity of $x\sin(\frac{1}{x})$

I am asked whether the function $f(x)=x\sin(\frac{1}{x})$ is uniformly continuous on $\mathbb{R}\setminus\{0\}$  My first intuition was to compute its derivative: $f'(x)=\sin(\frac{1}{x})-\frac{1}{x}\cos(\frac{1}{x})$  I found out that this function is not bounded when approaching $0$. So $f$ is not Lipschitz on $\mathbb{R}\setminus\{0\}$  I then picked sequences $x_{n}=\frac{1}{2\pi n}$ and $y_{n}=-\frac{1}{2\pi n}$ and computed $|f(x_{n})-f(y_{n})|=4\pi n\rightarrow+\infty$  So I am convinced that $f(x)$ is not uniformly continuous on $\mathbb{R}\setminus\{0\}$  Is my approach correct?


While compiling my document i have several problems with itemizes in tabular environments, so I tried it with a simple test build and it didn't really work out.   This is the scipt:  \documentclass{article} \usepackage{tabularx} \begin{document}  \begin{tabular}{l l} Test &  \begin{itemize} \item Test \end{itemize}\\ \end{tabular} \end{document}   And the error says for line 8 and 9:  ! LaTeX Error: Something's wrong--perhaps a missing \item.   I'm trying to find a simple solution for my problem that I can adapt into my other documents. That's why I'm using an example.  The error is the same as in my project so I think it has the same reason.  Thanks for help


I am using the following code, but it doesn't work.  drupal_block.module  function custom_blocks_theme($existing, $type, $theme, $path) {   return [     'custom_blocks__front_apps' => [       'variables' => [         'app' => NULL       ],     ],   ]; }   BlockTest.php    /**    * {@inheritdoc}    */   public function build() {     return [       '#theme' => 'custom_blocks__front_apps',       '#app' => 'test value',     ];   }   custom_blocks__front_apps.html.twig
Hello: {{ app }}
   My block is empty.        What is wrong with the code?


Prompt command starting in the wrong folder

I am currently facing an issue I do not know how to track.  I put the start-in option of a prompt command to :  C:\Users\XXX\Downloads   Then apply and finally when I open the prompt command, it starts in:  C:\Users\XXX\Documents>   I remember one year ago I modify the registry to start in documents folder, and this is certainly the reason why it overloads the prompt command value I set up. But I am clearly not able anymore to know which key it is ... does someone have an idea?


Infinite Cartesian product of countable sets is uncountable

Let $\{E_n\}_{n\in\mathbb{N}}$ be a sequence of countable sets and let $S=E_1\times\cdots\times E_n\times\cdots $. Show $S$ is uncountable. Prove that the same statement holds if each $E_n=\{0,1\}$.  By the definition of Cartesian product of sets,   $$\displaystyle S=\Pi_{n\in\mathbb{N}} \{f\colon\mathbb{N}\rightarrow\cup_{n\in\mathbb{N}}E_n\mid\forall n, f(n)\in E_n\}$$  If $E_n=\{ 0,1\}$, then  $$\displaystyle S_{01}=\Pi_{n\in\mathbb{N}}\{0,1\}=E^{\mathbb{N}}$$, where $E=\{0,1\}$.  By a theorem, $\cup_{n\in\mathbb{N}} E_n$ is countable since the sequence is countable.  I'm not sure how to go on from here to show $S$ is uncountable. Can we say anything about the function $f$ that maps a countable $\mathbb{N}$ to another countable union of sequence of countable sets?


I'm working on collision detection for a pong clone. I've calculated the angle of incidence but I can't find any information on how to specular reflect the angle I found.  The code for calculating the angle of incidence is below    if (ballPosition.Y >= height - 6)   {     Vector2 bottomNormal = new Vector2(400, 460) - new Vector2(400, 480);     Vector2 ballNormal = ballPosition - new Vector2(400, 480);     ballNormal.Normalize();     bottomNormal.Normalize();      float angle = Vector2.Dot(bottomNormal, ballNormal);  }


Intersection of two $\sigma$-algebras is not an algebra

I have the following task:     Give an example of two $\sigma$-algebras such that their intersection is not an algebra   There is a hint that such situation is possible only when their units differ, but I still can't come up to solution.   Let $S_1,S_2$ be our $\sigma$-algebras and $X = S_1 \cap S_2$.  1) $A,B \in X \Rightarrow A \setminus B \in X$. This is obvious because $A,B \in S_i \Rightarrow A \setminus B \in S_i$ (for $i=1,2$).  2) Similarly, $A,B \in X \Rightarrow A \cup B \in X$.  3) Similarly, any countable union is in $X$ too (though we do not need $X$ be a $\sigma$-ring by condition of the task).  So $X$ is at least a $\sigma$-ring and it must not contain a unit (or otherwise it will become an algebra).  If $X$ is countable, then union of all its elements $A = \bigcup A_i$ is contained in $X$. This easily makes $A$ a unit. Thus our $X$ must be uncountable. And from here I can neither prove that $X$ contains a unit nor disapprove it.


How i can except a column from select * in mysql

I noticed that in mysql i can't make an except on selecting some columns, there is my request:  SELECT * FROM plane as p JOIN type as t ON p.id=t.id;  But this shows me all columns even the two columns plane_id and type_id that are equivalent, is there a request i can do to print just one of them and excepting the other ??


I was following a tutorial and thought why not...let me brush up on the man command...and low and behold I learned a few things after years working with different flavours of Unix.  On my RHEL7 however, trying out the new trick to be able to look-up keywords failed!  It sounds crazy, but having tried it under root and under my own username the following shows no results...now man has dozens of entries with time as a keyword...any help would be appreciated, as I think the keyword facility is very useful for and admin.  $ man -k time time: nothing appropriate.


How to allow google-analytics via iptables when internet is blocked for other traffic

I am running the following script on a wifi gateway. The WAN side of the gateway has ppp0 interface while LAN side is on wlan0.   No LAN user should be allowed to browser internet  Some services on gateway needs access to internet and it should be allowed  LAN users should be allowed to access content from gateways LAN interface (traffic from 80 and 90 port - some local content not internet) On the same local content google-analytics is installed and it should be updated to google-analytics.com servers. My iptables firewall is as follows but I'm constantly seeing issues when reaching google-analytics servers. Any help is appreciated.     WAN_INTERFACE="ppp0"  LAN_INTERFACE="wlan0"  LAN_NETWORK="192.168.184.0/24"  WAN_IP=ifconfig ppp0 | grep addr | cut -d':' -f2 | cut -d' ' -f1  iptables -F iptables -F -t nat  iptables -P INPUT DROP  iptables -P OUTPUT DROP  iptables -P FORWARD DROP   Allow only packets destined to port 80 and 443 out of gateway for content on Gateway itself  iptables -A OUTPUT -o $WAN_INTERFACE -p tcp --dport 80 -m state --state NEW,ESTABLISHED -j ACCEPT iptables -A INPUT -i $WAN_INTERFACE -p tcp --sport 80 -m state --state ESTABLISHED -j ACCEPT iptables -A OUTPUT -o $WAN_INTERFACE -p tcp --dport 443 -m state --state NEW,ESTABLISHED -j ACCEPT  iptables -A INPUT -i $WAN_INTERFACE -p tcp --sport 443 -m state --state ESTABLISHED -j ACCEPT  Accept packets on LAN network for port 80,90  iptables -A INPUT -i $LAN_INTERFACE -p tcp -d 192.168.184.1 --dport 80 -s $LAN_NETWORK -j ACCEPT  iptables -A OUTPUT -o $LAN_INTERFACE -p tcp -s 192.168.184.1 -j ACCEPT iptables -A INPUT -i $LAN_INTERFACE -p tcp -d 192.168.184.1 --dport 90 -s $LAN_NETWORK -j ACCEPT  iptables -A OUTPUT -o $LAN_INTERFACE -p tcp -s 192.168.184.1 -j ACCEPT   Accept loop back  iptables -A INPUT -i lo -j ACCEPT  iptables -A OUTPUT -o lo -j ACCEPT   Allow out going ping requests  iptables -A OUTPUT -p icmp --icmp-type echo-request -j ACCEPT iptables -A INPUT -p icmp --icmp-type echo-reply -j ACCEPT   Allow out going DNS requests  iptables -A OUTPUT -p udp -o $WAN_INTERFACE --dport 53 -j ACCEPT  iptables -A INPUT -p udp -i $WAN_INTERFACE --sport 53 -j ACCEPT iptables -A OUTPUT -p tcp -o $WAN_INTERFACE --dport 53 -j ACCEPT iptables -A INPUT -p tcp -i $WAN_INTERFACE --sport 53 -j ACCEPT   Allow google-analytics traffic to go out and come in  iptables -A INPUT -s www.google-analytics.com -p tcp --sport 80 -j ACCEPT  iptables -A INPUT -s ssl.google-analytics.com -p tcp --sport 80 -j ACCEPT iptables -A OUTPUT -d google-analytics.com -j ACCEPT  iptables -A OUTPUT -d ssl.google-analytics.com -j ACCEPT iptables -A FORWARD -d google-analytics.com -s 192.168.184.0/24 -j ACCEPT  iptables -A FORWARD -d ssl.google-analytics.com -s 192.168.184.0/24 -j ACCEPT iptables -t nat -A POSTROUTING -o $WAN_INTERFACE -p tcp -d google-analytics.com -j SNAT --to-source $WAN_IP  iptables -t nat -A POSTROUTING -o $WAN_INTERFACE -p tcp -d ssl.google-analytics.com -j SNAT --to-source $WAN_IP iptables -A INPUT -s google-analytics.com -m state --state RELATED,ESTABLISHED -j ACCEPT  iptables -A INPUT -s ssl.google-analytics.com -m state --state RELATED,ESTABLISHED -j ACCEPT


What's the fastest way to remove all files & subfolders in a directory?

One program created lots of nested sub-folders. I tried to use command  rm -fr * to remove them all. But it's very slow. I'm wondering is there any faster way to delete them all?


I have a (symmetric) matrix M that represents the distance between each pair of nodes. For example,       A   B   C   D   E   F   G   H   I   J   K   L A   0  20  20  20  40  60  60  60 100 120 120 120 B  20   0  20  20  60  80  80  80 120 140 140 140 C  20  20   0  20  60  80  80  80 120 140 140 140 D  20  20  20   0  60  80  80  80 120 140 140 140 E  40  60  60  60   0  20  20  20  60  80  80  80 F  60  80  80  80  20   0  20  20  40  60  60  60 G  60  80  80  80  20  20   0  20  60  80  80  80 H  60  80  80  80  20  20  20   0  60  80  80  80 I 100 120 120 120  60  40  60  60   0  20  20  20 J 120 140 140 140  80  60  80  80  20   0  20  20 K 120 140 140 140  80  60  80  80  20  20   0  20 L 120 140 140 140  80  60  80  80  20  20  20   0   Is there any method to extract clusters from M (if needed, the number of clusters can be fixed), such that each cluster contains nodes with small distances between them. In the example, the clusters would be (A, B, C, D), (E, F, G, H) and (I, J, K, L).  I've already tried UPGMA and k-means but the resulting clusters are very bad.  The distances are the average steps a random walker would take to go from node A to node B (!= A) and go back to node A. It's guaranteed that M^1/2 is a metric. To run k-means, I don't use the centroid. I define the distance between node n cluster c as the average distance between n and all nodes in c.  Thanks a lot :)


Permission denied to move files from a live session

I want to clear space on my computer in order to download drivers for my internet, so I tried moving files to a different location.  Unfortunately I don't have permission to do this. How do I change this? I should point out that I am not logged in; I think I'm a guest or something because if I log in I cannot gain access to the internet to download the drivers that I need, so I'm using the live cd in Try Ubuntu mode to try achieve downloading the drivers.


My objects change their shape after rendering

I'm trying to render a cube animation in blender, but when i preview the render the shape changes, this is it before rendering:  and after rendering:  sorry for any problems, I'm new to blender stack exchange and blender in general


How does a graduate program's admissions committee operate?

How does a typical graduate program's admissions committee operate? (In the US --- I understand that in Europe admissions are often structured differently.)  My mental model at the moment is several professors sitting in a conference room with a stack of printed applications and a few piles: accept, maybe, and reject. Three or so professors will read an application and then make a decision. If the volume of applications is large enough, multiple meetings might be required. This is purely my imagination --- I don't know how accurate this model is.  Of course, I'm sure that how admissions are handled depends greatly on the school, program, and department. I'm interested in a few data points to get a rough idea of what the average is.  A few more specific related questions:   How much time does a typical committee spend on each application? I suspect there's a distribution. Obviously unqualified applicants will probably have their applications tossed into the reject pile pretty quickly. Qualified applicants' applications might receive more attention. Do admissions committees look online for more information about an applicant? I've read some professors (in CS --- not my field) will look at a student's research/project website, but I have no idea how common this is.


Import Excel spreadsheet columns into SQL Server database

I have an Excel spreadsheet that I want to import select columns into my SQL Server 2008 database table. The wizard didn't offer that option.  Do any easy code options exist?


If Darth Vader is more machine than man, wouldn't he have significantly less midichlorians?

Something that occurred to me...   If midichlorians are just cells living inside a living host, and total number of midichlorians determines just how powerful you are in the force, wouldn't removing a substantial amount of blood in the form of robotic appendages significantly reduce the midichlorian count, thereby making you much less powerful?  Seems like Darth Vader should have lost quite a bit of his force powers when he got robotic legs and arms.


Cant make ubuntu to switch language with alt-shift

On my fresh ubuntu 20.04 desktop, im trying to set the language input switch using left alt-shift, but for some reason, the window bellow accepts other things then alt-shift... Any idea? Thanks


Keyboard: Apple Wireless Keyboard (model number MC184LL/B)  System: Macbook Pro Early 2011 running OS X 10.8  The keyboard gets detected and when I try to pair it, the system asks to enter some numbers through the keyboard.   However when I press the key (on the wireless keyboard) nothing happens, the only key that seems to work (i.e. to move to the next key in the code) is 0. I can also press enter to confirm but it always fails (since the only code I can enter is 0000...0).   I've also tried pairing from the bluetooth preference and changing the passcode option. However this won't work either.   Any ideas? The keyboard was paired with another MacBook Pro (I don't have access to it anymore). Is there any method to 'reset' the keyboard to factory settings?


On finding polynomials that approximate a function and its derivative (extensions of Stone-Weierstrass?)

The Stone-Weierstrass Theorem tells us that we can approximate any continuous $f:\mathbb{R}^n\to\mathbb{R}$ arbitrary well on a compact subset of $\mathbb{R}^n$ by some polynomial. Suppose that $f$ is continuously differentiable, under what conditions can we guarantee we can find a polynomial $p$ such that $p$ approximates arbitrarily well $f$ and the partial derivatives approximate of $p$ arbitrarily well those of $f$ (on a compact subset of $\mathbb{R}^n$)? References are welcome. See below for my (probably naive) approach to the question.    It is straightforward to find conditions if $n=1$: Let $K:=[a,b]\subseteq\mathbb{R}$ and let $K_+$ denote some open cover of $K$. Suppose that $f:K_+\to\mathbb{R}$ is continuously differentiable and let $f'$ denote its derivative. Then, by Weierstrass's approximation Theorem we have that there exists a polynomial $q$ such that   $$||f'(x)-q(x)||\leq \varepsilon$$  for all $x\in K$. Choose some $y\in K$. For any $x\in K$ define  $$p(x):=f(y)+\int_y^xq(t)dt.\quad\quad(*)$$  By the Fundamental Theorem of calculus we have that $p'=q$. So for any $x\in K$  $$||f(x)-p(x)||=\left|\left|\int_y^x (f'(t)-q(t))dt\right|\right|\leq \int_y^x ||f'(t)-q(t)||dt\leq \varepsilon||x-y||\leq \varepsilon (a-b).$$  However, the above argument doesn't work in higher dimensions because the analogue of $(*)$ does not imply that $\nabla p = q$ (since not every vector of polynomials spans a gradient field). Can anyone suggest a way around this? That is, a way to to show that for continuously differentiable $f:\mathbb{R}^n\to\mathbb{R}$ and for any $\varepsilon>0$, we can always find a polynomial $p$ such that   $$||f(x)-p(x)||+||\nabla f(x)-\nabla p(x)||\leq \varepsilon$$  for all $x$ in some compact set $K$? Feel free to add extra conditions on $K$, if it makes life easier.


On Windows you can hit the keys Windows+L to lock your computer if you step away.  I don't want to have to remember if sleep currently asks for a password, if there is a time out where my screen isn't locked during a short period. Even with Lion supporting resume of many apps, I don't want to log out.   I do want to be sure data is secure when stepping out for lunch or a smoke break.


While playing on my calculator I accidentally calculated $\frac{1}{9801}$ and the value was $0.00010203040506070809101112131415161718192021222324252627282930\ldots$ We observe that there is a nice pattern in the decimal expansion. but how long will it continue ie. after how many digits will it repeat?


Ubuntu wont start after trying to fix brightness issue

I'm running Ubuntu 18.04.2 LTS.  I had brightness issues in my Ubuntu so checked out a few forums. From  forum, I followed the instructions and did:  Opened the file /etc/default/grub using gedit or any other text editor. Found below line:  GRUB_CMDLINE_LINUX_DEFAULT="quiet splash"    Changed above line to:  GRUB_CMDLINE_LINUX_DEFAULT="quiet splash acpi_backlight=vendor"   Also created the file /usr/share/X11/xorg.conf.d/80-backlight.conf with contents:  Section "Device"     Identifier  "Intel Graphics"     Driver      "intel"     Option      "AccelMethod"     "sna"     Option      "Backlight"       "acpi_video0"     BusID       "PCI:0:2:0" EndSection   Now Ubuntu won't start. It shows a black screen with the following boot messages.  [   2.601256] VFS: Cannot open root device "mapper/ubuntu--vg-root" on unknown-block(0,0) [   2.601308] CPU: 1 PID: 1 Comm: swapper/0 Not tainted 4.15.0-48-generic #51~Ubuntu [   2.601336] Hardware name: Acer Aspire 47362 / Aspire 47362 BIOS V1.08 08/14/2009 [   2.601375] Call trace: [   2.601412]  dump_stack+0x58/0x81 [   2.601446]  panic+0x94/0x1e6 [   2.601479]  mount_block_root+0x199/0x234 [   2.601514]  ? calibrate_delay+190/0x4e0 [   2.601546]  ? create_dev.constrprop.7+0x3a/0x53 [   2.601581]  mount_root+0x33/0x35 [   2.601612]  prepare_namespace+0x11b/0x167 [   2.601645]  kernel_init_freeable+0x1b3/0x1c5 [   2.601679]  ? rest_init+0xa0/0xa0 [   2.601711]  kernel_init+0xd/0x100 [   2.601744]   ret_from_fork+0x2e/0x38 [   2.601795]  Kernel Offset: 0x3d000000 from 8x1a000000 from 8xc1000000 (relocation range: 8xc100000-0xf17dfdfff) [   2.601836]  ---[ end Kernel panic - not syncing: VFS: Unable to mount root fs on    unknown-block(0,0)


How to show distance between boundary of an open set and a compact subset is positive?

Let $n \in \mathbb N$ and $U\subset \mathbb R^n$ be an open set.Let $K\subset U$ be a compact subset of $U$. Then How can we show that distance between $K$ and $\partial U$ is positive?   Please, someone, give some hints. to solve this.  Thank you.


How to duplicate only one screen? Ubuntu 18

I have a 4 output monitor set up. Monitor 1,2 and 3 are physical monitors and Monitor 4 is a duplicate of Monitor 1 that goes to an HDMI capture card.   Now this was easy enough on windows but on linux the only answer I see everywhere is using Win + P shortcut which mirrors a the desktop across ALL 4  displays. How would I go about only combining display 1 and 4?   Thanks fellas.


For how many primes $p$ is $p^2 + 2$ is also prime?

For how many primes $p$ is  $p^2 + 2$ also prime?     I'm not sure but I think you can consider every prime number as $(3k+1)$ or $(3k+2)$


According to Wikipedia:     For a matrix A, there are a total of [m, k] * [n * k] minors of size   k by k.   (source: )   This confuses me since for 3 by 3 matrices of size 2 by 2 minors, I'd assume there would be 9 minors, not [3,2] * [3,2] = 3*3 + 2*2 = 13 minors. Is there something I'm not seeing here? Thanks!


What does "official Ubuntu flavour" mean?

What kind of support do they receive from Canonical or/and Ubuntu community? Who decides a distro should become official flavour? What privileges do "official flavours" have over unofficial derivatives of Ubuntu like Linux Mint, Elementary OS, Deepin OS,etc.?


Can you have multiple Dropbox accounts on one computer?

Can Dropbox be used with multiple accounts on one computer?


Create node fields populated with an API

I want to create a drop-down field on a content type, but I need this drop-down to be populate by an external API. I think I need to have custom module, get data from API in module controller, after this steps I'm a bit lost, how can I populate my drop-down with API data? This is an example of what I want.  After back-end users fill all the fields, I need to save them on the database and show them on the front-end.


Showing that $f_0 (x_1, \ldots, x_m) \mathrm tr A =\displaystyle{ \sum_{i=1}^n} f_0(x_1, \ldots, Ax_i,\ldots, x_m)$

Question:  Consider $f: (-\epsilon, \epsilon) \to \mathbb R^{m^2}$ a differentiable path of matrices $m \times m$ such that $f(0) = I_m$ and the function $g: I \to \mathbb R$ is defined by $$g(t) = \det f(t)$$  Show that $g'(0) = \mathrm{tr} \,a $ (trace of the matrix $a$), where $a = f'(0)$.   Attempt:  First we use that $\det f(t) = \det (f_1(t), \ldots, f_m(t)) $, where $f_i$ is the $i$-th row of the matrix $f(t)$ $m \times m$. Considering the operator $': \mathbb R^m \to \mathbb R^m$, $f(t) \mapsto f'(t)$  With this in mind $$\begin{align}g'(t) = \det'f(t) &= \sum_{i=1}^{m} \det (f_1(t),\ldots,f'_i(t),\ldots, f_m(t)) \\&\underbrace{=}_{(*)}\det(f_1(t), \ldots, f_m(t))\, \mathrm tr f'(t) \end{align}$$  For $t = 0$ we have   $$\begin{align}g'(0) &=\det(e_1, \ldots, e_m) \,\mathrm tr f'(0) \\&= 1 \dot\, \mathrm tr \,a \\& = \mathrm tr \, a\end{align}$$  I'm trying to come up with a proof using the fact that $\det$ is a $m$-linear form.   In order to prove $(*)$ I need the following equality, which according to this  holds.   If $A: V \to V$ is a linear operator and $f_0$ is a alternated $m$-linear form, such that $f_0 (e_1, \ldots, e_m) = 1$ then   $$f_0 (x_1, \ldots, x_m) \mathrm tr A = \sum_{i=1}^m f_0(x_1, \ldots, Ax_i,\ldots, x_m) $$  Could someone give a proof to this?


"Not once he would" vs. "not once would he"

Not being a native speaker and suffering semantic satiation from overthinking this, I'd like to ask this probably overly simple question.     Not once would he...   uses reversal for negation and means "he wouldn't even once..."     Not once he would...   is litotes for "He would frequently..."  Is that correct or did I mess up? If I did mess up, how to correctly express the two meanings?


I have installed QGIS 2.14.1,  I am looking for the OpenLayers Plugin which I could not find under Install Plugins, as well as Web menu.


The titles of my articles are not indexed on google

My site is istorikathemata.com a Greek history site and has been founded at 2009. In the last year roughly google search engine has stopped displaying my articles. I create an article, publish it in my site, and although I am the creator of it, but in the search engine I see only the sites which have copy it. I think this not fair. An example:   (In greek: Το κίνημα του υποστράτηγου Χαράλαμπου Λούφα και τα Δημοκρατικά Τάγματα (19 Νοεμβρίου 1924). I have not changed any preferences on my site, I use an official template of blogger, I publish original content in ratio 5 to 1. I am very sad about this development,  would like an answer why my site is omitted.


My Windows 10 Home Edition computer frequently pops up various ads for Microsoft services. For example, just now it popped up a dialog that said "Make logging in even easier! Install Microsoft Authenticate" or something like that. How can I disable this sort of activity?


It's possible clone a javascript div id with same function in javascript?

I'm trying to clone javascript div id with this code  <script>      var div = document.getElementById('pruebaz2'),                             clone = div.cloneNode(true); // true means clone  all childNodes and all event handlers     clone.id = "pruebaz2";     document.body.appendChild(clone);  </script>   but my clone div id not have any effect in my html page my original id add a record when a doing a click  my clone id do nothing  how I can clone with same functionality


$(m,n) = (\gcd(m,n))$ as ideals in $\Bbb Z$

let $J_m$ be the set of all integral multiples of the integer $m$. 1) Prove that $J_{g.c.d(m,n)}$ contains all the elements of $J_m$ and $J_n$.   2) Prove that if $J_r$ contains all the elements of $J_m$ and $J_n$, then $J_r$ contains all the elements of $J_{g.c.d(m,n)}$.   for part 1) the elements of $J_{g.c.d(m,n)}$ are of the form $c*g.c.d(m,n)$, where $c\in    \mathbb{Z}$.   Now if $x$ is in $J_m$, then ∃ $a\in \mathbb{Z}$ | $am=x$. So we want $x=am=b*g.c.d(m,n)$ for some $b\in \mathbb Z$. If we pick $b=am/g.c.d(m,n)$, then our task is done.   Now for part 2) ∀ $a,b\in \mathbb Z$, $am,bn\in J_r$  To show that this implies that  ∀ $a\in \mathbb Z$ $a*g.c.d(m,n)$ is in $J_r$ I am assuming that something like $am*g.c.d.(m,n)$ which is in $J_r$ can be shown to go through all the integers; meaning, if $am$ can be shown to go through all integers I would be done. But right now I am not seeing the solution.   Any hint or help would be appreciated. Thank you in advance.


US entry in Atlanta airport (ATL) together with a US citizen

I will soon travel to the US for the first time.  I am not a US citizen, but I will travel together with one.  We will land in ATL and then proceed to a connecting flight. I know I will have to clear customs in ATL.  My ESTA application has been approved, but I read that since I never have travelled to the US before, I will have to clear immigration through a old-fashioned booth with a immigration officer, and I won't be able to use the electronic kiosks.  As my travel companion is a citizen, they'll not be subject to this restriction.  What is the best course of action? Should they queue with me, or should we proceed our separate ways?  I'd like to proceed together, but I don't know if it is allowed.


I have heard that we can obtain the source code of Ubuntu and customize it as we wish. But where can I find the source code of Ubuntu, and what languages are used to write Ubuntu?


Show that $(0,1]$ is open in $[0,1]$ but $(0,1]$ is not open in $\mathbb{R}$

I am very new to Topology, so excuse my lack knowledge;  Show that $A=(0,1]$ is open in $[0,1]$:  I am suppose to choose $x$ in $(0,1]$. And construct a ball around with radius $r\leq\min\{ \lvert x-1 \lvert,x\}$? Should I show that the complement is closed?  I could also use a hint on showing that $(0,1]$ is not open i $\mathbb{R}$.


How to calculate $x=\sum _{ i=0 }^{ \infty } \left( i+1 \right) \cdot \left( \frac { 5 }{ 6 } \right) ^{ i }$

I was trying to find the value of x in the following equation.  $$x=\sum _{ i=0 }^{ \infty  } \left( i+1 \right) \cdot \left( \frac { 5 }{ 6 }  \right) ^{ i }$$  In a computer simulation, I found that $x=6^2$  I believe the following is also true, I just do not know how to prove it. $$p^2=\sum_{i=0}^{ \infty } (i+1)\dot\ (\frac{p-1}{p})^i$$  Could anyone tell me what theory I should look into to for this problem?


System.ListException: List index out of bounds: 0 error for Custom Employee Profile User

I HAVE ALSO TRIED "isEmpty()" When i create new User Account and login with that credentials, it gives me this problem if admin doesnt have set thier values yet !!!  AllotmentList = [select id, Days_Remaining__c from PTO_Allotment__c where Year__c =:year and Employee__c=:EmployeeList[0].id LIMIT 100]; //access only Current user Allotment details                 //to handle Listoutof Bound Exception wrote if-else      if(AllotmentList.size()>0)     {     requests.PTO_Allotment__c=AllotmentList[0].id;     requests.Days_Remaining__c=AllotmentList[0].Days_Remaining__c;     }     else     {         //write a code when AllotmentList is empty ....     }


This is a general, community wiki  question to address  "I need a eCommerce script that does x, y, and z..." questions.  If your question was closed as a duplicate of this question and you feel that the information provided here does not provide a sufficient answer, please open a discussion on .    I have a list of features that I want for my website's eCommerce script - where can I find a script that includes all of them?


Question If {x,{x,y}}={z,{z,t}} then x=z and y=t must be? My answer: Yes. Assume $x\neq y$. Then, {$x$,{$y$,$z$}} has two elements: $x$ and {$x$,$y$}. Thus, $x\neq z$ since {$z$,{$z,t$}} should have two elements. Therefore, $x=z$ and {$x,y$}. What do you think about the question?


Is there a way to get a windows always on focus?   I mean not just on top, but with the focus on it if another window pops up on the screen.


I have these shortcodes which I am using as links in my front end to get the next post and previous post. When I get to the last post it just keeps reloading the last post again. How can I get it to loop back to the first post? function prev_shortcode($atts) {     $prev_post = get_previous_post();     $permalink = get_permalink($prev_post);     return ($permalink); } add_shortcode( 'prev', 'prev_shortcode' );  function next_shortcode($atts) {     $next_post = get_next_post();     $permalink = get_permalink($next_post);     return ($permalink); } add_shortcode( 'next', 'next_shortcode' );


Written version of logical operators: Not supported in Visual Studio 2013?

In answers to , it is indicated that the keywords and, or, and not are, in fact, keywords that are defined as part of the C++ language (but without specifically stating C++11).  In Visual Studio 2013, I am attempting to build pre-existing code (known to build on Linux) which uses the or keyword (if (A_ or B_) {...}, where A_ and B_ are properly defined), and the following compiler error is generated:     error C2065: 'or' : undeclared identifier   From  for Visual Studio 2013, or is not listed.  I would like confirmation that the and, or, and not keywords are not supported in Visual Studio 2013.  (The alternative is that I am missing either an #include file, or a required compiler setting.)


How do I use dependency injection on \Drupal::moduleHandler() to a Controller?

I am using the following line in a controller class.      \Drupal::moduleHandler()->alter('mymodule_myfunction', $plugin_items);   Pareview.sh is giving me this error message.     \Drupal calls should be avoided in classes, use dependency injection instead.   How should I accomplish this? Do I need to create a constructor, create a method, or a service? If so, what code should the service need? I found an example on  for a case where a service already exists.


Apple ID says it doesn't recognize your finger in the morning

Sometimes I would wake up and try to unlock my phone and be told that it doesn't recognize my fingerprint and that I HAVE to put my passcode to enable touch id but I thought that only happened when you put your finger on the home button too much and you don't have that finger registered or something. For me as soon as I wake up it says it doesn't recognize me like I already tried it before when I know I didn't and nobody else did either. Does anybody know what's going on?


Latex Table (Graphix) Help! Is it possible to draw?

I would like to draw these following diagram (table or graphix) in latex (i attached them), is it possible?


How do you remove a space before a citation in LaTeX?

I have something like  \documentclass{article} \usepackage{cite} \begin{document}  Blah Blah (\cite{All14})  \bibliography{Ref} \bibliographystyle{alpha} \end{document}   But LaTeX keeps placing a space before my citation, i.e. my output looks like "Blah Blah ( [All14])".  So, I modified it to Blah Blah (\hspace*{-3px}\cite{All14}). However, this seems to be a less than elegant solution.  Is there a better way to eliminate this space?


Verifying that I have fully removed a WordPress hack?

My for-fun WordPress blog at  (running WordPress 3.1.1) got hacked -- it was showing an <iframe> on every page like so:  <iframe src="http://evilsite.com/go/1"></iframe> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">  <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">    I did the following   Upgraded to 3.1.3 via the built-in WordPress upgrade system Installed the  (lots of critical warnings on unusual files) and  (this showed all green and clean, so I uninstalled and removed it after running) Changed MySQL password. Changed all WordPress user passwords. Connected via FTP and downloaded the whole filesystem (not large, this is a WordPress-only Linux shared host) Diffed the filesystem against an official ZIP of WordPress 3.1.3 and removed or overwrote anything that did not match.   I am quite sure that    all the files on disk are official WordPress 3.1.3 files there are no "extra" files on disk other than my one /theme, the Exploit Scanner plugin (which I just downloaded), the /uploads folder, and a tiny handful of other expected files. My other plugin, wp-recaptcha, matches the current official downloaded version. I also checked the .htaccess file and nothing looks wrong there     I did not touch the database, but I am struggling to think how anything in the database could be malicious without special PHP code to make it work?  My WordPress blog appears OK and hack-free now (I think), but is there anything else I should check?


How to pass a container of derived type to a function needing a container of base type

I have a class IBase with only pure virtual functions.  I have another class Derived which inherits IBase.  I have a function in another class that takes a QVector of IBase as a parameter.  When I create a QVector of Derived objects, I can't pass them into this function.  However, I can have a function that takes a IBase object as an argument and pass in a Derived object instance.  Why is this behavior occurring?


Why is this an incomplete residue system?


I wrote a text using :  \documentclass[a4paper,12pt]{report},  and \begin{thebibliography}{99}.   Now I have to change and use ''bibtex''. I am completely unfamiliar with bibtex, What is a simple way that I can change it? ( what userpakage should I add ,... )


How can I get rid of unused MATE panel icons/indicators?

I have 3 icons in my Ubuntu 18.04 MATE top panel. I can't get rid of them but they do nothing. The image below shows just part of the top panel containing the circular images.     One contains a vertical line with up and down arrowheads, the middle one contains the numeral 9 and the right one contains a capital A.  How do I get rid of them and do they serve any purpose?


This can be really trivial,but it helps in ways of making it more comfortable while coding and sending commands to terminal.  My terminal source/bash/root name(my apologies, I dunno which is the right word), reads as follows :  itachi@itachi-HP-Pavilion-g6-Notebook-PC:~$    Can you please tell me how Can I shorten this or change it? The second part after '@' is too long. Is there anyway to change this.? Thanks in advance..


I've read and understood about how you create a daemon process, but from everything I read I never really understood why it needs to be done.  I've read that we do the fork - setsid - fork to avoid the process to gain control of a terminal, but what does this mean ? If I start a program in the background using & (for example './script &' ), what makes this process' execution different than if I ran normally a program that turns itself into a daemon ?  Does this simply mean that if I logout the background process will stop and the daemon will keep running ? I'm really having trouble understanding the 'gain control of a terminal' thing.  The reason this bothers me is because I'm working on an embedded RPi on a robot and I thus need to make programs start on boot. Currently I'm just starting them from rc.local with a command like this su user -c 'python /home/user/launcher.py &' &. I've never had any problem with the program starting on boot (I can even see the process using ps -e when SSHing to the RPi), but I would like to know if there's any risk / if it's bad practice.


Ubuntu 14.04 - Boots Completely Unstable (99.9% frozen )

I have an older HP Pavilion from 2007 that I have been trying to get up and running. It originally had Ubuntu 13.04, but I was experiencing crashes where the entire screen would turn into corrupted garbage (happened twice when trying to install mp3 codec). I ran a whole health check on the RAM and it passed.  I replaced it with CrunchBang Linux, and it worked fine, but it failed to connect to wireless networks (the previous Ubuntu did). So I decided to get the latest Ubuntu (fresh install). It installed fine, connected to the wireless network fine as well.  It even seemed to boot okay, showing the keyboard shortcuts splash screen. However I could move my mouse all for about half a minute, then it froze. Then after about 10 seconds it unfroze to show my mouse's new position, promptly freezing again.  Ad infinitum. I can't do squat.  Each time it updated my mouse's position, it failed to update the clock. It was frozen at 11:01am. It didn't seem like the CPU was doing anything. Also happens again after a restart.  AMD Athlon 64 X2 5200+ 3GB RAM On-board GPU roughly equivalent to NVIDIA GeForce 6150SE   tl;dr  Fresh install of 14.04 boots frozen and updates mouse every 10 seconds -- as if CPU is extremely busy and overwhelmed, but never goes back to normal. I can't do anything at all. Ubuntu 13.04 and Crunchbang didn't have this problem.  Any ideas?


How do i get the phantom prospect dog tag?

I am trying to get the phantom prospect dog tag and i am stuck on the "Get a total of 300 meter headshot". Do I have to get all of the head shots in one match or can it be spread out?


I'm looking for a way to remove the title attribute from images, preferably through using a hook or a filter.  Most clients don't bother giving images a proper title, thus eliminating the purpose of this attribute. I prefer no tooltips to random, non-descriptive ones.


Show that $\mathbb Q[x]/(x^2+2)$ and $\mathbb Q[x]/(x^2-2)$ are not isomorphic.

I have a proof that says $\mathbb Q[x]/(x^2+2)$ and $\mathbb Q[x]/(x^2-2)$ are not isomorphic.  However I feel that it is not good one...  First I see that $x^2+2$ and $x^2-2$ are irreducible in $\mathbb Q$. Then I notice that $x^2=2$ and $x^2=-2$.  Now, if we take $(a+bx)(c+dx)$ on both, we end up  $ac-2bd + (ad + bc)x$ and $ac+2bd + (ad + bc)x$.  Can I now say, that these fields do not have the same structure, so they cannot be isomorphic?  I do not want exact answer (homework :) ), but a hint would be nice to guide me into right direction.


Consider a coin that can move in at most two ways when it is placed on any square of the usual (8 x 8) chessboard (64 squares). From its current square it can move either to the adjacent square above (if it is not in the top most row) or to the adjacent square on the right (if it is not in the rightmost column).   What is the number of distinct paths in which the coin can move from the lower left corner square to to the top right corner square ?  I understand the problem and it should be solved using recursion technique but every time I approach this kind of problem I take lot of time. Sometimes I get the same problem in different flavor which says it can only move down or left(any combination of left/right/up/down).  Can someone give me some ideas how to start with these problem?  I found answer to be 688 which may be wrong.   Help appreciated :)


I am trying to prove the following     $d_n$ is a degree-sequence of the multigraph  $G$ (without loops) if and only if $\sum_{i=1}^{n}{d_i}$ is even and $d_1 \le\sum_{i=2}^{n}{d_i}$   I have no problems showing the first part.  By the "handshake"-lemma $\sum_{i=1}^{n}{d_i}=2e$ where $e$ is the number of edges in $G$  $$d_1 \le e $$  $$d_1\le \frac{\sum_{i=1}^{n}{d_i}}{2}$$  Hence $d_1 \le \sum_{i=2}^{n}{d_i}$  However, I don't know how to show the other part. Would appreciate some tips or hints


Can I visit the USA as a VWP tourist immediately prior to entry on non-tourist visa?

Here's my situation: I'm a UK citizen. I have an H-1B visa to work in the US as of 1 August. I also have a valid ESTA.  I would like to go to the US in July for a holiday, immediately prior to beginning my work. The holiday would be at the other end of the country from my work.  I can't enter with the H-1B as I can only enter the US on that visa 10 days prior to starting work.  Specific question: Would it be possible to visit the US in early July on the VWP, visit Canada/Mexico for a few days in late July, and re-enter the US with my H-1B visa?  General question: Is it possible to visit the US on the VWP, leave briefly, and re-enter on a different status (e.g. H, F, J, K, etc), without ever returning to one's home country?  I have posted this in Travel rather than Expatriates because, although in my specific case I have an H-1B visa, my question is more generally about VWP and travel, and I believe that it is applicable to travellers with non-immigrant visas.  There's a similar question , although that's about going to the US and before having the H-1B visa.


Iterating through a HashMap containing objects java

I have the following HashMap:  Map<String,List<Objects>> abc = new HashMap<String,List<Objects>>()    How can I iterate through the objects, to access the properties of the object?


Why can't I name a folder or file 'CON' in Windows?

In all versions of Windows, we are unable to rename a file or a folder name as CON without third-party file renaming software. Trying to do this in Windows 7 results in an error:     The specified device name is invalid.   Trying to save a file as con.txt in Notepad leads to a similar error:     This file name is reserved for use by Windows.   Choose another name and try again.   Why can't we name a file or folder CON in Windows?


The function defined with the Lebesgue's measure is measurable

I have to show that for $f: \mathbb{R} \rightarrow\ [0,\infty)$ a measurable function, the function $g: \mathbb{R} \rightarrow \ [0,\infty], \ g(r):=\lambda(\{f>r\})$ is measurable.  I noted that the function $g$ is strictly decreasing, but I don't know how to continue, any suggestions? Thanks!!


How to find $\int_{0}^{\pi/2} \log ({1+\cos x}) dx$ using real-variable methods?

How do you find the value of this integral, using real methods?  $$I=\displaystyle\int_{0}^{\pi/2} \log ({1+\cos x}) dx$$  The answer is $2C-\dfrac{\pi}{2}\log {2}$ where $C$ is Catalan's constant.


How to read a text-file resource into Java unit test?

I have a unit test that needs to work with XML file located in src/test/resources/abc.xml. What is the easiest way just to get the content of the file into String?


Is isomorphism in group theory mean one-one homomorphism?

In Herstein, the defination of isomorphism is a homomorphism which is one-one and the definition of isomorphic is that it's the onto isomorphism (i am sure it's not a printing mistake because he used this consistently) but some other sources on net show that isomorphism is a bijective homomorphism? So which definition is true?


Introductory condensed matter physics book

I need a book for general condensed matter physics, preferably at an undergraduate level, e.g. at Ashcroft and Mermin's level or below. Modern applications are preferred.


Recently I started getting a File sync error on all 3 of my PCs running Ubuntu One.  One is running Ubuntu, the other 2 are running Windows 8.  Looking at the list of clients on the web, none of them were there anymore.    I found this article:      On how to fix the issue for my Ubuntu PC and it worked perfectly.  Now I am looking for a similar fix for Windows but haven't found one yet.  I've tried un-installing Ubuntu One and re-installing it, but it must still be holding the keys somewhere because it never asked me to login again.    Does anyone know where I can clear these keys to get my files syncing on Windows again?


How do I undelete an answer, after editing, that has been deleted by a moderator?


Code-Coloring for Inline-Code in Answers

Is there a reason that inline-code (with ``, of course) in answers is excluded from the prettify-process?   Sometimes a piece of code is a bit too small to be blessed with its own blockquote, and so it's merely streamed inline with the rest of a paragraph, but having syntax-highlighting on it would still help to break up the different parts of the code.  (For the record, I don't think this should be included in comments — which has already been discussed here.)  Or does there already exist a way to prettify inline code? (The language of code blocks can be explicitly set with <!-- language: ... -->; could this also be allowed for inline code?)


I have a piece of land (vector) with, for example, potatoes and I want to make a grid for spraying. That means i need a grid with size 45mx10m with different values per box. Important is that the grid is parallel to one boundary of the vector. With Vector Grid the grid is always facing north. Could anyone help me?      Imagine this is the field. The grid should be parallel to the left boundary of the field. The size of the boxes should be the same size, exactly. Except the right side of course.


Simple answer: Difference between a dataset and a map

For a project I am involved in, we are creating a dataset that will show the extents of natural areas and provide an estimate of the ecological integrity of that area. We are calling it an "Ecological Integrity Dataset," but as far as I can tell, we're making a map layer that has this information. Can someone very simply tell me the difference between a map layer and a dataset?


how to delete files in folder with thousands of files

in  the folder   cd /var/log/hive   I guess we have thundered of log files   I say that because  if I do under this folder  ls -l   then its stuck and only CNTRL C , will exit  so I cant to vew all files  in this case how to tryng to delete the files or the old files  or what we can do else ?


Draw sign lines with function expressions?

I am trying to draw a sign line like the one in the image in LaTeX. How can I do this?


The president states that,  after he read the memo, he felt very disturbed.    Is the first comma necessary?


Ubuntu 10.04 failed to upgrade with Command terminated with exit status 1

I have old Ubuntu 10.04. It has been 5 years ago. I want to update it. But I cannot success to upgrade it. Does anyone know about this problem. I have tried a couple days to fix it. Thanks a lot    x11proto-core-dev  x11proto-input-dev  x11proto-randr-dev  x11proto-xext-dev  xdiagnose  xkb-data  xorg  xserver-common  xserver-xorg  xserver-xorg-core  xserver-xorg-input-all  xserver-xorg-input-evdev  xserver-xorg-input-synaptics  xserver-xorg-input-vmmouse  xserver-xorg-input-wacom  xserver-xorg-video-all  xserver-xorg-video-intel  xserver-xorg-video-nouveau  xserver-xorg-video-openchrome  xserver-xorg-video-qxl  xserver-xorg-video-vmware  xsettings-kde  xsltproc  xterm  xul-ext-ubufox  zeitgeist  zeitgeist-core  zenity  zenity-common    Restoring original system state  Aborting Reading package lists... Done     Building dependency tree           Reading state information... Done Building data structures... Done  === Command detached from window (Tue Oct 20 09:33:50 2015) === === Command terminated with exit status 1 (Tue Oct 20 09:33:50 2015) ===


How can the petrification from the Flesh to Stone spell be removed?

In 5e's version of the flesh to stone spell, if the spell is maintained for the full minute duration, the effect (petrification) lasts until "removed".  How can this petrification be removed?


Statistics: sequences of independent and identically distributed random variables

Show that: $$P(N(x)>n)= \frac{x^n}{n!}$$ I was thinking that we can take $X_1+...+X_n$ to be a single random random variable $S_n$ and that the $n$ in the $P(N(x)>n)$ is not the same as the $n$ in the definition of $N(x$). But unsure how to actually start proceeding to prove this. Any help appreciated, thank you.


A science fiction story about a headdress that allows one human to control and experience another human's body

I read this story many years ago and now can't remeber who wrote it or even what it was called. The story was about a group of elite humans who had access to a headdress that allowed them to control another human, even if they were thousands of miles away.  They could use this ability to commit crimes, etc.  I think the cover may have been yellow like those published by Gollancz.


Project Euler Problem 213 (continued...)

This question is a continuation of   I followed the approach of Glen_b outlined in his answer in the page referenced above. I am using Java.     So now I am at a point where I think I have correctly calculated the probabilities p[30][30] where p[i][j] denotes the probability of the (i,j) square being empty after these 50 steps (1 step = 1 ring bell) from the problem statement.        Now I am treating these 900 numbers from the p array as describing 900 random variables.      So I start doing a Monte Carlo simulation. For now I am doing N = 60 000 000 such tests/experiments.      In a single experiment I loop through the p array, and I generate one random number x in [0,1) for each (i,j) couple. I use this number x and the probability p[i][j] to generate a boolean value 0/1 which says if the square is empty or not.       Then I count how many empty squares I got in all my N tests. And then I divide this number by the number 900*N. This should give me the Monte-Carlo approximated answer.       But my problem is that I think I am too far away from the precision that is needed. Why? Because I then run another N such experiments.       And the answers I get in the 1st set of N experiments compared to the answer in the 2nd set of N experiments differ by way too much (they differ in the 4th or even in the 3rd sign after the decimal dot).       I wonder why. Aren't 60 million tests good/many enough?       If not (i.e. if I need more experiments), and if I am so far away as it seems then... How can I finish solving this problem in reasonable runtime, given that I have already the matrix p with the probabilities.       Or maybe... I am not doing the Monte-Carlo simulation quite right ( though I doubt that because I am getting already some answers like 330.7xxxxxxx so I am obviously on the right track i.e. I do not have any major logical bugs).       I am not sure.      Any help/guidance (about how to finish the solution from here) would be much appreciated.


Show that the sequence $a_{n+1}=a_{n}+\dfrac{a^2_{n}}{n^2}$ is upper bounded

Let $\{a_{n}\}$ be defined with $a_{1}\in(0,1)$, and  $$a_{n+1}=a_{n}+\dfrac{a^2_{n}}{n^2}$$ for all $n\gt 0$.  Show that the sequence is  upper bounded.  My idea: since  $$a_{n+1}=a_{n}\left(1+\dfrac{a_{n}}{n^2}\right)$$ then $$\dfrac{1}{a_{n+1}}=\dfrac{1}{a_{n}}-\dfrac{1}{a_{n}+n^2}$$ then $$\dfrac{1}{a_{n}}-\dfrac{1}{a_{n+1}}=\dfrac{1}{a_{n}+n^2}$$ so $$\dfrac{1}{a_{1}}-\dfrac{1}{a_{n+1}}=\sum_{i=1}^{n}\dfrac{1}{a_{i}+i^2}$$ since $$a_{n+1}>a_{n}\Longrightarrow \dfrac{1}{a_{i}+i^2}<\dfrac{1}{a_{1}+i^2}$$ so $$\dfrac{1}{a_{n+1}}>\dfrac{1}{a_{1}}-\left(\dfrac{1}{1+a_{1}}+\dfrac{1}{2^2+a_{1}}+\cdots+\dfrac{1}{a_{1}+n^2}\right)$$ But the RHS might be $\lt0$ for a sufficiently large starting value; for instance, with $a_{1}=\dfrac{99}{100}$ then $$\dfrac{1}{a_{1}}-\left(\dfrac{1}{1+a_{1}}+\dfrac{1}{2^2+a_{1}}+\cdots+\dfrac{1}{a_{1}+n^2}\right)<0,n\to\infty$$  see:   so this method won't let me bound the series and I don't know what else to do.


Javascript Regex: How to put a variable inside a regular expression?

So for example:  function(input){     var testVar = input;     string = ...     string.replace(/ReGeX + testVar + ReGeX/, "replacement") }   But this is of course not working :) Is there any way to do this?