Trying to make a computer usable by using Ubuntu: this Asus computer, originally running Windows 10, wouldn't start. Idea was to boot Ubuntu from a USB drive, check hardware that way and then install Ubuntu on it if the HDD was still working. I would appreciate quite simple explanations as I am fairly computer literate, but obviously in way over my head here.  The problem now is that when I try to live boot Ubuntu or Xubuntu 18.04.3 from USB (created with Rufus), I get this error message, and then the computer turns off:     Failed to open EFI\BOOT\mmx64.efi - Not Found      Failed to load image EFI\BOOT\mmx64.efi: Not Found      Failed to start MokManager: Not Found      Something has gone seriously wrong: import_mok_state() : Not Found   Now, the very long story of how I got here.  I first used Rufus to create a bootable USB drive with Ubuntu on. Computer would not boot from this (either "Try Ubuntu" or "Install Ubuntu") because of a problem with squashfs.  I Decided to try XUbuntu instead. Created bootable USB drive with Xubuntu 18.04.3 using Rufus. Was able to boot into "Try Xubuntu without installing" with this, and tried to install Xubuntu from the desktop. I selected "Erase disk and install Xubuntu", then automatic updates while installing, and third party applications, and secure boot.  Installation then crashed. Several error messages came up that I didn't have time to see or take note of, but one was definitely "ubi-timezone failed with exit code 1".  Following this, I tried to live boot from the USB again but I get the above error message and nothing happens. I then tried to create a new bootable USB drive using Ubuntu and Rufus, and the error message is the same. There seems to be no way to start the computer at all. Have I bricked it?  Can someone explain what is happening and how to fix it?  Thanks a lot!  EDIT : After using Ubuntu 19.10 to try and go around MOK issues, I now have the error message      tpm_crb MSFT0101:00: can't request region for resource

I tried to install Ubuntu 18.10 on my XPS 15 9570 earlier. Everything was working fine until I got to the partition selection part of the installation. That's when the installer crashed and I had to shut down my machine. I think it's because I had my SATA configuration set to RAID ON instead of AHCI, which is now fixed.  Now when I try to run the installer from my bootable USB I get the following error  Failed to open \EFI\BOOT\mmx64.efi - Not Found Failed to load image \EFI\BOOT\mmx64.efi: Not Found Failed to start MokManager: Not Fond Something has gone seriously wrong: import_mok_state() failed   Hoping someone might have some idea as to what is going on


Using OS Ubuntu for 2 days. Everyone says that 8GB is more than enough for root directory but it seems like so soon I will have critical lacks of space in root. I have 256GB hard drive and has distributed space as follow:   10GB for / 8GB for linux-swap 126GB for /home   I thought that root "/" directory needs only for install OS and nothing more so that "/home" is intended for my software, but it seems like my software is placed in "/" directory whenever I install new program. The question is: should I reinstall my OS and allocate more space for "/" directory or I don't understand something because now I have only 2GB free from 10GB of root directory, and I'm afraid when I'm going to install more software it's gonna be full?

For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?


I try to calculate the following product in python:  4.6*400   The answer should be 1840, however, python answers 1839.999....  This works fine  4.6*40*10   Is this a bug in python, or expected behaviour?

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


I have a pointer. I know its address (I got as an argument to a function), and I know that it points to a memory address previously allocated by the malloc() call. Is there any way to know the size of this allocated memory block? I would prefer a cross-platform, standard solution, but I think these do not exist. Thus, anything is okay, even hardcore low-level malloc data structure manipulation, if there is no better. I use glibc with x86_64 architecture and there is no plan to run the result elsewhere. I am not looking for a generic answer, it can be specific to glibc/x86_64. I think, this information should be available, otherways realloc() could not work.   asks for a generic, standard-compliant solution, which is impossible. I am looking for a glibc/x86_64 solution which is possible, because the glibc is open source and the glibc realloc() needs this to work, and this question allows answers by digging in non-standard ways in the low-levels malloc internals.

First off, here is some code:  int main()  {     int days[] = {1,2,3,4,5};     int *ptr = days;     printf("%u\n", sizeof(days));     printf("%u\n", sizeof(ptr));      return 0; }   Is there a way to find out the size of the array that ptr is pointing to (instead of just giving its size, which is four bytes on a 32-bit system)?


So when I updated from 13.04 to 14.04 LTS (I do a clean reinstall of the new ubuntu version) and did minecraft on the first time using orcale java. When I started to launcher it froze ubuntu up and needed a restart(it really annoying). But when I tryed openjdk problem solved. But I need orcale JVM to use flare hacked client. I tried it already on openJDK it just got me a blank screen when I use a hacked client even nodus. I have notice that if I close all of the programs that are running it works. But when a program starts automatically (usually background process) it will freeze and it usually half to restart the computer again(did I say it was annoying?) so yea please help btw linux is the new windows

I have installed both OpenJDK 6 and 7. When I run "java somefile" from the command line, OpenJDK 6 is invoked. I do not want to change this default behavior. What command can I use to run my non-default OpenJDK 7 installation instead?  (I am used to running "python somefile" to invoke the default Python, "python2.7 somefile" to use Python 2.7 specifically and "python3 somefile" to use Python 3 specifically.)


This question has already been asked before, but the answer to that question was the normal force is not conservative because it does no work.   However, a different user asked the question "is it possible for the normal force to do work," and one of the answers stated that it could do work in the instance of an elevator accelerating upwards.   So... can the normal force do work? And if the elevator example is in fact an example of the normal force doing work, is the normal force conservative?  Edit: I can see why many of you are marking this question as a duplicate (because the question titles are very similar), but please read again. As I explained, the answers to one of the questions I mentioned either were incorrect, did not take something into account, or my understanding of the concept is completely wrong. It would be much appreciated if someone could leave an answer.

Most of the time the normal force doesn't do any work because it's perpendicular to the direction of motion but if it does do work, would it be conservative or non-conservative?  For example, consider the following block-incline system where the incline is on a friction-less surface. Now as the block moves down, the incline itself starts moving in the opposite direction. Here, the normal force acting on the incline by the block does do work.    This question was on some website (it asked something about the final velocities of the block and the incline) and they solved this using mechanical energy and momentum conservation which confused me as I couldn't understand why the normal force here is conservative.  So,    Is the normal force always conservative or is this only in some cases?  If yes, how do we deduce that like in the above example? Also, if it is conservative, what would be its corresponding potential energy function?


How can I fix this message:  Fontconfig warning: "msfonts-rules.conf", line 23: Having multiple values in <test> isn't supported and may not works as expected

I am getting the following error frequently. (Example: when running zenity,firefox etc. commands / applications.)  Fontconfig warning: "/etc/fonts/conf.d/90-fonts-unfonts-core.conf", line 11: Having multiple values in <test> isn't supported and may not work as expected   Here is contents of file /etc/fonts/conf.d/90-fonts-unfonts-core.conf:  <?xml version="1.0"?> <!DOCTYPE fontconfig SYSTEM "fonts.dtd"> <fontconfig>     <match target="font">         <test name="family" qual="any">             <string>은 바탕</string><string>UnBatang</string>                 <string>은 돋움</string><string>UnDotum</string>                 <string>은 궁서</string><string>UnGungseo</string>                 <string>은 필기</string><string>UnPilgi</string>                 <string>은 그래픽</string><string>UnGraphic</string>         </test>          <edit name="antialias" mode="assign" binding="strong"><bool>true</bool></edit>         <edit name="hinting"   mode="assign" binding="strong"><bool>false</bool></edit>         <edit name="autohint"  mode="assign" binding="strong"><bool>true</bool></edit>         <edit name="hintstyle" mode="assign" binding="strong"><const>hintslight</const></edit>     </match> </fontconfig>   How to solve it?


The title of my question could look weird at the first sight, but I will explain it to you.   Recently, I’ve seen a user that posted an answer to an old question, but their answer was actually a clarification question on an existing answer. Then, a moderator converted their “answer” to a comment under the real answer, because the non-answer was otherwise valuable. The answerer replied to that comment to ask back the new user about something. Nevertheless, the new user was unable to comment back with the reply to their comment. Very depressing situation.  So I would like to suggest allow the users to post a comment if they have one comment there. This could prevent such odd behavior.

I propose allowing posting new comments on any post I already have comments on, even if I drop below the rep threshold for the comment-privilege (50 rep) later.  And maybe also always allow responding to any ping (editors, dupe-hammer-wielders and mod-closers can be pinged even if they never commented).    Background: I recently made  on a post. Shortly thereafter, I put bounty on another one of my questions, which brought my reputation below 50. Then, when  was posted, I was unable to respond because of the requirement that I have at least 50 reputation to comment.


In the movie, does it ever state that David has disdain for humans in general?  Is there any confirmation of his opinion of his fellow crewmates?

In the film Prometheus, the android David does something that I'm unclear on:      After David examines the black liquid that he brought back to the ship, he poisons Dr. Holloway with a little bit of it.   What is his intention?


I recently learned of Cantor's diagonal argument, and was thinking about why there can't be a bijection between any infinite set of integers and any infinite set of real numbers. I understood the basic idea behind the proof, but I was thinking of a particular transformation, for which I don't see why it doesn't form a bijection.    Let's say we want to map all of the integers, to the real numbers between $[-1, 1]$. My transformation is created in such a way, that for every integer, I transform it into a mirrored number that is placed after a decimal.   For example:  $$0 \rightarrow 0.0$$ $$1 \rightarrow 0.1$$ $$2 \rightarrow 0.2$$ $$\vdots$$ $$100 \rightarrow 0.001$$ $$\vdots$$  It would seem to me that this is one to one, and every number between $[-1, 1]$ is hit. Even in the example of an irrational number, say $(\sqrt2 - 1)$, there is sum integer of infinite size that maps exactly to $(\sqrt2 - 1)$, because $(\sqrt2 - 1)$ can be written as a decimal made of up an infinite number of integer sitting behind a decimal point. It could be mapped as:  $$...73265312414 \rightarrow 0.41421356237...$$  Now, I'm assuming I was probably not the first person to think of this, so, why does this not work as a bijcetive mapping?

I was just thinking about this recently, and I thought of a possible bijection between the natural numbers and the real numbers.  First, take the numbers between zero and one, exclusive.  The following sequence of real numbers is suggested so that we have bijection.    0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9, 0.01, 0.02, ... , 0.09, 0.10, 0.11, ... , 0.99, 0.001, 0.002, ... , 0.999, 0.0001, etc.  Obviously, this includes repeats, but this set is countable.  Therefore, the set of all numbers between zero and one is a subset of the above countable set, and is thus countable.  Then we simply extend this to all real numbers and all the whole numbers themselves, and since the real numbers, as demonstrated above, between any two whole numbers is countable, the real numbers are the union of countably many countable sets, and thus the real numbers are countable.    Please help me with this.  I understand the diagonalization argument by Cantor, but I am curious specifically about this proof which I thought of and its strengths and flaws.  Thanks.


My page is arranged as a two column. I have 3 different tikzpicture in one figure. I want to put these 3 tikzpictures that fit in page width not column width. Can you please help me to do this?  \begin{figure}     \begin{subfigure}[b]{0.32\linewidth}     \resizebox{\linewidth}{!}{         \begin{tikzpicture}[scale=0.40]           \begin{axis}[             title={rate},             ymin=1, ymax=5,             xmin=1, xmax=5,             xtick = {1,2,3,4,5},             xticklabels = {1,2,3,4,5},         ]%original         \addplot[black,line width=0.5mm]             plot coordinates {                 (1, 3)                  (2, 5)                  (3, 4)                  (4, 2)                  (5, 1)             };         \end{axis}         \end{tikzpicture}}         \caption{caption1} \label{fig:M1}     \end{subfigure}     \begin{subfigure}[b]{0.32\linewidth}     \resizebox{\linewidth}{!}{         \begin{tikzpicture}[scale=0.40]         \begin{axis}[             title={rate2},             ymin=1, ymax=5,             xmin=1, xmax=5,             xtick = {1,2,3,4,5},             xticklabels = {1,2,3,4,5},         ]%majority          \addplot[black, mark=diamond*]             plot coordinates {                 (1, 3)                  (2, 1)                  (3, 4)                  (4, 2)                  (5, 5)             };         \end{axis}       \end{tikzpicture}}       \caption{caption2} \label{fig:M2}     \end{subfigure}     \begin{subfigure}[b]{0.32\linewidth}     \resizebox{\linewidth}{!}{     \begin{tikzpicture}[scale=0.40]       \begin{axis}[     title={rate},     ymin=1, ymax=5,     xmin=1, xmax=5,     xtick = {1,2,3,4,5},     xticklabels = {1,2,3,4,5},     ]%original     \addplot[black,line width=0.5mm]     plot coordinates {         (1, 1)          (2, 5)          (3, 3)          (4, 2)          (5, 4)     };     \end{axis}     \end{tikzpicture}}     \caption{caption3} \label{fig:M3}     \end{subfigure} \caption{Accuracy} \end{figure}[![accuracy][1]][1]

If I just try to set the figure's size to 0.9\textwidth my figure will just end up on the right column, sized to be two-columns wide.  Has anyone done this before?


I am working in a Parser. The problem relies in opening a directory to scan the files in it. In my first project, the code works fine. But when I try to run the exact same code in a frame project the code stops working.  It's awfully stringe since it worked last night, but now it stopped working once more.  // This is the one not working          File actual;      actual = new File("C:\\Users\\kalio\\Pictures\\JavaDocs");     System.out.println("==============================");     System.out.println(actual.getPath());     System.out.println(actual.isDirectory());     System.out.println("==============================");     for( File f : actual.listFiles()){}   // This is the working one      File actual;      actual = new File("C:\\Users\\kalio\\Pictures\\JavaDocs");     System.out.println("==============================");     System.out.println(actual.getPath());     System.out.println(actual.isDirectory());     System.out.println("==============================");     for( File f : actual.listFiles()){}   // this is the output of the not working one   ==============================  C:\Users\kalio\Pictures\JavaDocs  false  ============================== Exception in thread "AWT-EventQueue-0" java.lang.NullPointerException at parser.frmMenu$Scan.<init>(frmMenu.java:273) at parser.frmMenu.btnSearchActionPerformed(frmMenu.java:256) at parser.frmMenu.access$000(frmMenu.java:19)     // this is the result of the working one  ============================== C:\Users\kalio\Pictures\JavaDocs true ==============================

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


Me and my friend want to play Minecraft together on the same WiFi. He has a Windows 10 computer and I have a Mac. At first, opening to LAN would not show up at all. Then I found a way to prefer IPv4 using:  _JAVA_OPTIONS=-Djava.net.preferIPv4Stack=true /Applications/Minecraft.app/Contents/MacOS/launcher   This would make my friends place show up on my screen, but my friend would not see my place when we enabled our open to LAN at separate times. I tried disabling my firewall and it would still not work. When I try to connect to my friends place, I get the error     io.netty.channel.connecttimeoutexception connection timed out.   When my friend tried to direct connect, he would get the same error. Any help is appreciated. We are both on the same Internet right next to each other.

My friend had hosted a Minecraft server before and brought it back up today with my help. He and anyone in his LAN can connect. However we have had a few people try to connect, including me, and when we try to connect it gives the message:  Failed to connect to the server Connection timed out: connect  What does this exactly mean? How do we fix this?


Until now, I am installing TeX Live via the network and I'm using http://mirror.ctan.org/systems/texlive/tlnet/install-tl-unx.tar.gz to get the installer. However, since TeX Live 2017 was released, this URL will give me the installer for TeX Live 2017, which breaks for me for some edge cases. I need to install TeX Live 2016 explicitly, however I can't seem to find the correct URL for the installer. What I found is ftp://tug.org/historic/systems/texlive/2016/install-tl-unx.tar.gz, but when I try to install it with the same commands as for the usual installer I get  ./install-tl: The TeX Live versions of the local installation and the repository being accessed are not compatible:       local: 2016  repository: 2017 Perhaps you need to use a different CTAN mirror? (For more, see the output of install-tl --help, especially the  -repository option.  Online via http://tug.org/texlive/doc.)   Does anyone know how I can explicitly get the installer for TeX Live 2016?

I am using TeXLive 2010. I wanted to try xelatex for better unicode support. But I am unable to install these new packages as the TeXLive mirrors have moved on to 2011.  tlmgr: package repository http://ftp.snt.utwente.nl/pub/software/tex/systems/texlive/tlnet /opt/texlive/bin/x86_64-linux/tlmgr: The TeX Live versions of the local installation and the repository being accessed are not compatible:       local: 2010  repository: 2011 (Perhaps you need to use a different CTAN mirror?)  Goodbye.   Can anyone help me resolve this?


I would like to know which one of these expressions is the most correct and why?     Google´s car      The car of Google   When I refer to the driverless car Google has invented.

I gave a quick answer to part of  which had not been covered by previous answers, trying to clarify the reason you would say time of decoding but not decoding’s time. I said it was ’s usually indicates possession, but of course there were several counterexamples that would have occurred to me after a moment’s consideration, and these where helpfully supplied:   Britain’s climate two days’ time  a day’s work  the sun’s rays   I am still of a mind to say that possession of some sort is what allows the ’s. Even though the sun does not have title to its rays, they do belong to the sun. Now, at the risk of duplicating the original question and/or being pigheaded, I am curious as to why time of decoding but not decoding’s time is correct, if not for the reason I gave.


Short Version: On multi-monitor setups, is there a way to make a single program (such as the task manager) open on the second monitor's screen by default, without making all programs open on the second monitor?  Long Version: One issue I have with Skyrim is that it sometimes crashes.  Sometimes it'll just CTD.  Other times, it remains in a frozen state and cannot be closed.  I can alt-tab to another window, but the skyrim "window" (if you can call it that, it's fullscreen) remains on top of any other windows.  I am using two monitors, so it'll only stay above windows on the primary monitor.  But that doesn't help much, as any programs I open are opened on the primary monitor.  So, pressing CTRL-ALT-Delete to get the task manager doesn't help, because it opens on the first window, so it remains under skyrim's fullscreen window.  If I open the task manager before starting skyrim, move it to the second monitor, then close it, it will be in the last place it was when it was closed for the rest of my login session.  But if I log out or reboot, it is back to its default location, on the primary monitor's screen.  Is there any way to change the task manager's default opening location to the second monitor's screen area?  Note that simply making the second monitor the primary one is not a viable solution, and neither is making all programs open on the secondary monitor by default.  Both of those methods would mean Skyrim opens on the second monitor by default along with the task manager, putting me back to square one.  Plus, the second monitor has a smaller resolution than the primary (1920x1080 vs 1440x900).  Currently using 64bit Windows 8.1, with Classic Shell.

Is there a way to tell Windows on which monitor it should open a windows  independently of where it was closed?


this is my first attempt to run a shell script, namely 'exiftool', from applescript:      set cmd to "exiftool -" & tag & "='" & myName & "' " & myFile     do shell script cmd   cmd looks like this:exiftool -Artist='myName' myFile.jpg and works perfectly when directly inserted in Terminal. exiftool was installed by the standard installer!  What did i miss?

I have just compiled my own copy of ffmpeg on my system and it's located in the following path:  /opt/local/bin/ffmpeg   When I run the following command in Terminal.app, it runs smooth:  ffmpeg -i /Users/Amit/Documents/input.avi -c:v copy -c:a aac -b:a 384k -strict -2 /Users/Amit/Documents/output.m4v   However, a similar command run as a shell-script in an Automator service fails:  for f in "$@" do     ffmpeg -i "$f" -c:v copy -c:a aac -b:a 384k -strict -2 "${f%.*}.m4v" done   Up until now, I had a pre-compiled build of ffmpeg on my system located at:  /Applications/Scriptlets/   And my Automator shell-script had the full path (/Applications/Scriptlets/ffmpeg) instead of just ffmpeg; and it worked fine. However, today I decided to compile a fresh copy of ffmpeg using MacPorts and removed the earlier version from my Applications/Scriptlets folder. Now, this ffmpeg works fine in Terminal but gives an error whenever I try running it from a shell-script inside of an Automator workflow. Am I doing something wrong here? Please help!


What's a good book on non-Euclidean geometry for undergrads?  Especially ones that consider hyperbolic and spherical trigonometry?

I'm researching non-Euclidean geometry.  Now I am looking for a good source for it.  Please suggest me something.Thanks.


Help! my Minecraft.jar will not run as executable

I looked up several tutorials on how to install and they dont work. I do everything correctly but then i get this:     The file   '/home/mike/Downloads/minecraft.jar'   is not marked as executable.  If this   was downloaded or copied from an   untrusted source, it may be dangerous   to run.  For more details, read about   the executable bit.   I run the minecraft.jar with the Sun java runtime 6 but it doesnt work:/. Any help would be greatly appreciated!


I have Ubuntu 12.04 installed on my system. I want to upgrade it to Ubuntu 13.04. I want to do this upgrade using an .ISO image of Ubuntu 13.04 and without a USB drive.  I tried  .  But it didn't work for me.  After running the proposed commands, I didn't have any alerts about updating. I also don't understand the gksu part of the solution.  Also, is this possible to do by using a networked computer? By this I mean the .ISO file is on another computer.

I'm using Ubuntu 10.04 now and want to Upgrade to Ubuntu 11.04. The problem is my net connection is very slow and I can not do a network upgrade from the "Updates Manager".  So, is there a way that I can download the Ubuntu upgrade as an bootable CD image and upgrade from it?


Evaluation of $\displaystyle \int_{0}^{1}\frac{x^{2015}-1}{\ln x}dx\;\;$   $\bf{My\; Try::}$ Let $$I(a) = \int_{0}^{1}\frac{x^{a}-1}{\ln x}dx\;,$$ Then $$I'(a) = \int_{0}^{1}\frac{x^a\cdot \ln(x)}{\ln(x)}dx = \int_{0}^{1}x^{a}dx = \left[\frac{x^{a+1}}{a+1}\right]_{0}^{1}=\frac{1}{a+1}$$  So we get $$I(a) = \ln|a+1|+\mathcal{C}.$$  Now When $a=0\;,$ We get $I(0) =0$  So we get $I(0)=\ln(1)+\mathcal{C}\Rightarrow 0 = 0+\mathcal{C}\Rightarrow \mathcal{C}=0$  So we get $$I(a) = \int_{0}^{1}\frac{x^{a}-1}{\ln(x)}dx = \ln|a+1|$$  So $$I(2015) = \int_{0}^{1}\frac{x^{2015}-1}{\ln(x)}dx = \ln|2016|$$  can we solve it by using any other Method Like Using Double Integration.  If yes Then plz explain here, Thanks

We are given parameters $a > 0, b > 0$. Task is to integrate that: $\displaystyle \int_0^1 {\frac {x^a-x^b} {\ln x} dx}$. I have tried approaching problem from different angles with no luck.  I tried integration by parts(tried all combinations of possible $v$ and $u$), u-substitution with no luck. Also I tried to integrate this two similar terms separately.  Tried to get some idea of how to go from answer, got nice answer from MATLAB: $\displaystyle \ln{\frac{a+1}{b+1}}$, but no idea how to reach it.  I would appreciate some suggestions.


Let $A, B, C$ three groups such that $A \times C \cong B \times C$. I already know that if $A, B$ and $C$ are abelian and finite, then $A \cong B$. I think this result does not hold anymore if they are not supposed to be finite or abelian. Is it possible to give a counterexample ?  Thank you very much for the help !

Given a finite group $G$ and its subgroups $H,K$ such that $$G \times H \cong G \times K$$ does it imply that $H=K$.  Clearly, one can see that this doesn't work out for all subgroups. Is there any condition by which this can remain true.


I have read all the current responses, and still do not see an answer, but I too have a desire to remove ALL E mails in the category of "all mail". How do I do this???

I want to clear my mail from my Gmail account, but don't feel like selecting every message (also the archived ones).  Is there an easy way to delete all my mail from Gmail without having to delete my account?


We bought a chess set in which the rules state that pawn promotion occurs when the pawn moves to the light square in the upper left corner of the opponent's first row. So, this cannot occur when the pawn reaches any square in the last row?  All the other answers to pawn promotion do not address a specific square rule.

I have tried to read the Wikipedia article but it is too confusing on what the current accepted standard is.  My questions are:   If a pawn makes it to the last row can they stay as a pawn? If a pawn makes it to the last row can they be promoted to a piece that hasn't been removed from the board e.g. 2 queens or 3 knights on the board?   If the last question is yes, do people normally carry around multiple sets with the same pieces?


I am given a simple quadratic equation $$x^2-x-c=0, x>0, c>0$$ and then we define a sequence $\{x_n\}$ with $x_1>0$ fixed and then, if $n$ is an index for which $x_n$ has been defined, we define $$x_{n+1}=\sqrt{c+x_n}$$.  With that I am asked to prove that $\{x_n\}$ converges monotonically to the solution of the polynomial.  I've done quite a bit of scratch work. Obviously we can solve the quadratic and the positive solution is $\frac{1+\sqrt{5}}{2}$. I have an inkling that the equation is decreasing and so I tried working with $x_{n+1}-x_{n+2}$ to show that the difference is positive but I didn't come up with anything useful.  I did realize that if I simply write out the limit we see that $$\lim_{n\rightarrow\infty}[(\sqrt{c+x_{n+1}})^2)-\sqrt{c+x_{n+1}}-c]=\lim_{n\rightarrow\infty}[x_{n+1}-\sqrt{c+x_{n+1}}]$$  So if we want this final limit to go to zero then all I really need is $x_n$ to be monotonically decreasing since it is clearly bounded below by zero since $c$ and $x_1$ were taken to be positive.

(Fitzpatrick Advanced Calculus 2e, Sec. 2.4 #12)  For $c \gt 0$, consider the quadratic equation $x^2 - x - c = 0, x > 0$.  Define the sequence $\{x_n\}$ recursively by fixing $|x_1| \lt c$ and then, if $n$ is an index for which $x_n$ has been defined, defining  $$x_{n+1} = \sqrt{c+x_n}$$  Prove that the sequence $\{x_n\}$ converges monotonically to the solution of the above equation.  Note: The answers below might assume $x_1 \gt 0$, but they still work, as we have $x_3 \gt 0$.    This is being repurposed in an effort to cut down on duplicates, see here: .  and here: .


If someone visits a question without an answer, that is closed as a duplicate, the person will automatically be sent to the original question. Consequently, it will be impossible to view the contents of the newer question. However, if the newer question received one or more answers posted before being closed as a duplicate,  the page and the answer(s) posted will be visible.  For example, when I am logged out, I cannot see the following question:         Instead, the system directs me automatically to the “original” question      The same situation is repeated when visitors and logged-out users click on the question:       they will be transported to        and its single answer.   On the other hand,  a question which has been closed as a duplicate of two older questions, for instance   will not automagically redirect the visitor  (or the logged-out user) to the older posts.   I checked to see if this was by design in the FAQ   The most relevant piece of information that I could glean was      Should duplicates be deleted?   In general, no: most duplicates stay around. Having multiple copies of the same question with different wording is useful as search fodder, because people looking for an answer may use different wording too.   I also searched  but found nothing which suggests a question that is closed as a duplicate appears "invisible" to visitors or users who are logged out of the site.   I tagged the question as a bug because it's unclear whether this feature is by design or not. If it is, I'm not terribly convinced it's a good idea. Not sure why a new question, which has been carefully composed and upvoted should not be useful to visitors.

Duplicate questions that use different words to describe the same problem are important for people to find the content via search engines. But the user experience when an anonymous user arrives at a duplicate is less than ideal.  They have to notice the duplicate link and understand that the answer they are looking for is likely behind that link. I don't think this is all that obvious to someone without experience with an SE site.  I propose to just redirect users to the duplicate automatically if the closed duplicate has zero answers. In that case they need to follow the link to the duplicate in any case, so we might as well redirect them to it in the first place.  I could imagine this being problematic with search engines, as we would be displaying different content than what the search engines see. If that is too problematic I would suggest to show a very obvious link to the duplicate in the answers section for anonymous users.


Ramanujan's notebooks contain the result $$\prod_{k=1}^{\infty} \Big( 1 + \frac{1}{k^3}\Big) = \frac{1}{\pi} \mathrm{cosh}\Big( \frac{\pi \sqrt{3}}{2}\Big).$$ It doesn't seem like this is proved there but I guess it is well-known. How could you show this?

What is   $\prod\limits_{n\geq 2}(1-\frac{1}{n^3})=?$ $\prod\limits_{n\geq 1}(1+\frac{1}{n^3})=?$   I am sure about their convergence. But don't know about exact values. Know some bounds as well. For example first one is in interval (2/3,1) and second one is in (2,3).


I remember some years ago when playing with linux you could adjust the background color or picture independantly for each workspace, so you could have different colors on each space.     Is that possible in Ubuntu 12.04 lts ?

I normally use 4 different workspaces for different things, and they are always the same. Can I make a different background image for each one of them?   I would like an answer that works for GNOME 3 desktop environment, Unity and the Classic desktop environment.     This question has multiple answers covering different Ubuntu versions:


I made a curve but part of the same curve doesn't fit in a regular line, I need to align the points/vertices with each other, how can I do this? I need to put those in order.

Can I position all selected vertices to the same place?   I basically want to set all of their x positions to 0.


I intend to set up the following:   CPT: job, team-member   They share    taxonomy: location   When I register location, I do this:  $args = array(    ....    'hierarchical'  => false,    'rewrite'       => array( 'slug' => 'location' ), ); register_taxonomy( 'location', array( 'team-member', 'job' ), $args );   My question: Do I need the 'taxonomies' line below  register_post_type('job', array(    ....    'rewrite'     => array('slug' => 'careers'),    'taxonomies'  => array('location'), ));   Explanation is appreciated. Thanks.

As mentioned in :     taxonomies   () (optional) An array of registered taxonomies like category or post_tag that will be used with this post type. This can be used in lieu of calling  directly. Custom taxonomies still need to be registered with .   Default: no taxonomies   In my Custom Post Type (product) I'm also assigning two Custom Taxonomies with register_taxonomy() apart from the register_post_type(), and they are working fine. But there's a parameter in register_post_type() called 'taxonomies' where it's said to mention all the taxonomies in an array, but even without this I'm achieving what it's meant to:  'taxonomies' => array( 'product_categories', 'product_tags' ),   So, I wonder what's the purpose of this?


I want to scatter plot points from table with colors and text labels from table. Choosing colors works with classes but labels are parsed as numbers and appear as "nan".    \documentclass[tikz]{standalone}  \usepackage[utf8]{inputenc} \usepackage{pgfplots}  \begin{document}  \begin{tikzpicture} \begin{axis}[enlargelimits=0.2]     \addplot[         scatter/classes={a={blue}, b={red}},         scatter, mark=*, only marks,          scatter src=explicit symbolic,         nodes near coords*={\label},         visualization depends on=\thisrow{label} \as \label     ] table [meta=class] {         x y class label         0.5 0.2 a A         0.2 0.1 b B         0.7 0.6 a C         0.35 0.4 a D         0.65 0.1 a E     }; \end{axis} \end{tikzpicture}  \end{document}   How do I stop pgfplots from parsing the labels?

I have a comma-separated list of data points. They should be plotted as a scatter plot, and should be labeled using data from the .csv file. Having specified the first column of my file as string type, I still keep running into errors saying Could not parse input [...] as a floating point number, sorry.  Given a CSV file of the following format, how can I read Name and Z as labels?  Name,X,Y,Z ODIN,250,45,2001   Here is my MWE:  \documentclass{article}  \usepackage{tikz,pgfplots,pgfplotstable}     \pgfplotsset{compat=1.5.1}  \begin{document}  \pgfplotstabletypeset[columns/Name/.style={string type}]{table.csv};  \begin{tikzpicture}     \begin{axis}[     visualization depends on=\thisrow{Name} \as \labela,     visualization depends on=\thisrow{Z} \as \labelb,     every node near coord/.append style={font={\tiny}},     nodes near coords=\labela/\labelb,     nodes near coords align={horizontal},]      \addplot[only marks] table [x=X,y=Y,col sep=comma] {table.csv};      \end{axis} \end{tikzpicture}  \end{document}   Note that if the data in column Name is just floats it should work fine.


Our site was on a https connection but we are now back on a http connection.  I do not control the web host.  How can I get google to update and remove the link to the https version of the website?  I have been using the fetch as Google option to get Google to recrawl the site.  Ultimately this has to be fixed one way or another. Should I consider using use the remove URLs tool and pick the root URL?

I'm moving from HTTP to HTTPS for my entire site. The site is currently added to Google Search Console (formerly Google Webmaster Tools) as www.example.com and all the pages are indexed without using SSL.  How do I go about moving to the new HTTPS URLs on Google Search Console?   Do I just submit an updated sitemap which has the HTTPS URLs or do I add a new site as https://www.example.com and submit the sitemap with HTTPS URLs? All current URLs are set to redirect to their HTTPS counterparts. Do I add multiple properties to Google Search Console?


When I click on new button to uploading a file and click on cancel button, then again I click on new button I want to reset the previous uploaded file from there.                                 *Upload Medical Certificate                                                                            {docName}                            Cancel button Cancel</button JS closeSuspendModal() { this.isShowSuspendModel=false; } get acceptedFormats() { return ['.pdf', '.png', '.docx', '.jpg', '.jpeg']; } handleUploadFinished(event) {     // Get the list of uploaded files     const uploadedFiles = event.detail.files;     this.docId=uploadedFiles[0].documentId;     this.docName=uploadedFiles[0].name+' uploaded successfully';     console.log('1111'+uploadedFiles[0].documentId)     console.log('1111'+uploadedFiles[0].name)      }

When I click on new button then I uploaded the file using lightning file upload now if i'm clicking on cancel button, then I'm again click on new button then the previous uploaded file is there. How can i reset that uploaded file after clicking on cancel button. Uploading a file
                                *Upload Medical Certificate                                              <lightning-file-upload name="fileUploader" accept={acceptedFormats} record-id={myRecordId} onuploadfinished={handleUploadFinished}>                             </lightning-file-upload> {docName}
    Cancel button <button type="button" class="slds-button slds-button_destructive" onclick={closeSuspendModal}>Cancel</button>  JS closeSuspendModal() { this.isShowSuspendModel=false;    }  get acceptedFormats() {         return ['.pdf', '.png', '.docx', '.jpg', '.jpeg'];     }      handleUploadFinished(event) {         // Get the list of uploaded files         const uploadedFiles = event.detail.files;         this.docId=uploadedFiles[0].documentId;         this.docName=uploadedFiles[0].name+' uploaded successfully';         console.log('1111'+uploadedFiles[0].documentId)         console.log('1111'+uploadedFiles[0].name)              }


The advantages and properties exhibited by XOR are also exhibited by XNOR, like the ones mentioned in many answers like  one   Information is preserved. $c = a \oplus b$. One may recover $a = c \oplus b$ (and $b = a \oplus c$). Information is hidden. One cannot know anything about the inputs from the outputs.   I found  answer which talks about the efficient implementations present in the instruction sets, and programming language, but this sounds like a "who came first, chicken or the egg" problem.  Is it that the efficient implementations exist because XOR was chosen over XNOR?  There are mentions of some architectures which have XNOR support.

The XOR operator seems to be a frequently used building block inside many cryptographic primitives.  As far as I can see, its most desirable properties seem be that for the XOR of two bits $a\oplus b=c$:   The information is preserved.  Either $a$ or $b$ can be recovered from $c$ and the other bit. The information is hidden.  An adversary can not learn anything about $a$ or $b$ from $c$ alone.   Neither AND nor OR has these properties but XNOR does.  It seems like any cryptographic application using XOR could be constructed equivalently with XNOR, without incurring any loss in security.  One possible reason to prefer XOR might be that XOR is equivalent to addition modulo 2, whereas XNOR would be addition plus 1 modulo 2, but this seems to be entirely mathematical, and I'm not sure if it actually results in any additional hardware complexity in practice.  Is the choice of XOR then an arbitrary one, made for historical reasons, or is there any tangible underlying motivation for using it over XNOR?


Prove that there are infinitely many EVEN positive integers $k$ such that for each of those $k$, the equation $\varphi(n) = k$ has no solution in positive integers $n$. I believe there might be a way to approach this using Euler's Theorem where one proves $a^k\equiv 1 \pmod k$ has no solution for infinitely many even numbers.

I was just getting my hands dirty solving some equations of the form $x=\phi(n)$ where $\phi(n)$ is Euler totient function. I know that $\phi(n)$ is even for $n\geq 3$. However, I am wondering that:     Can all even integers $x$ be expressed as $\phi(n)$ where $n$ is an integer?   I start doing some research, the first even number appears to hove no solution is $14$. According to , there is no solution to the equation $14=\phi(n)$ for $n\leq 500$. But does it have a solution for $n>500$?  Moreover, what can you say about the above statement?


I have a brand new LG G5 phone and randomly ads will pop up. The ads started appearing before I installed any app.  How do I get rid of them?

Are there ways that attempt to block ads in applications? It seems that it should be theoretically possible, by blocking web requests to certain sites, for example.


Obviously a trivial corner-case, but:    Looking at the revision history, we see:    A moderator converted the post to a comment, and then undeleted the answer stub. The original poster of the answer then self-deleted it, causing this incorrect message to show up.  I'm assuming this is because the logic for determining what to show as the deletion reason goes something like this:  if (revisionHistoryThingies.contains(MOD_CONVERTS_TO_COMMENT)) {     output "converted to a comment by blah blah" }   Could this be fixed so that it makes sure that the most recent deletion event was a "convert to comment," and not just check whether it happened at some point in time?

If an answer is converted to a comment and then subsequently undeleted, and then deleted again (without being converted to a comment), the message beneath the post still reads:    If the answer is then undeleted again, and the comment is deleted, and then the answer is deleted again, the message still reads:    This happens if the mod who converted the comment is not the same, or is the same, as the mod performing the subsequent undeleting and deleting. The initial undeleting was performed at least six months after the initial conversion to comment (if that is of any relevance).    Why or how did I discover this? Because there was a ridiculous answer that had unfortunately been converted to a comment, and I wanted the answer both deleted and not to have the converted to a comment by XXX status message, and instead just have the deleted by XXX status message.


At 01:30 on the below video, UVs arranged to Square as well.  If I do follow this action(select all>UV Cylinder Projection), UVs become like below picture(4st). I would like to know how to fix my UVs as well.. 1st picture: modeling 2nd picture: original UVs 3st picture: youtuber's result 4st picture: my result

I have this setup:   The mesh is only the visible top side, with a mirror modifier for the bottom part. Now I want to unwrap it like in the picture. I want the inner circle (red) to go to the top of the UV map...  The problem is that no matter what automatic unwrapping I use, it never works as intended.  The closest I've gotten was by using "follow quads", but that skewed the UV map a lot:   I used the result from the second image and manually adjusted the vertices with a lot of scaling and "align auto", but its very far from perfect as you can see in the first image.  Here's what I want exactly:   The uv vertices should be distributed evenly (horizontally) The middle line (yellow) should be on a "natural" y height (so there's no stretching)   I hope it's clear what I want to achieve. I'm sure there must be some automatic way to perfectly align and distribute the UVs in this way.  By the way: If you look closely you can see that I already placed a uv seam (aligned with the green y axis in the screenshot) but that didn't really help.


I haven't been able to log into my Blogger account for my blog or into the Gmail of the same account. I remember the recovery mail that I'd connected and I've tried using the account recovery several times and it won't email me anything. My blog was also on private so I can't access any of my old posts. Please can someone help or does anyone have any contact details that I could use to get in touch with Google/Blogger support? I really want my account back.

I have forgotten the password or username for my Google account, or I'm unable to access my account for other reasons.  How can I recover my account?  (This Q&A is meant as a general description for all Google and Gmail username/password questions. See: )


How can I subtract two dates in epoch format using Shell Scripting. I want the output in Months, Days, Hours format. Also It should work even for more than 12 months ( as I came across few which were resetting to 0 months if more than 12)

Is there any tool in Solaris UNIX (so no GNU tool available) to subtract dates? I know that in Linux we have gawk that can subtract one date from another. But in Solaris the maximum we have is nawk (improved awk) which cannot perform date calculations. Also I cannot use perl.  Is there any way to do date calculations like 20100909 - 20001010?  UPDATE: Is bc able to perform dates calculations?


Why couldn't the first element but the whole column be updated below?  >>> x=2*[2*[1]] >>> x [[1, 1], [1, 1]] >>> x[0][0]=2 >>> x [[2, 1], [2, 1]]

I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?


I would like some suggestions on some good books to learn Algebra 1. This is my first time learning the topic but I already know some of the topics (ex. Linear Equations and Real Numbers). Does anyone have any suggestions? Thank you. Edit: By Algebra 1 I mean the subject that's taught in high school usually in either 8th or 9th grade.

My name is Aniket and I have started 11th class recently. I have studied only my school textbooks( Books) and I am not happy with them.  I want to learn Algebra,i.e, all the topics covered in algebra 1 and 2. I want to learn algebra enough to master up to 12th class, but I am very confused which is the best book to achieve all of my goals.  Book Price = less than $17 (American Dollars) And I don't want an eBook.  Any suggestions would be very appreciated, thank you!


Does the light speed change? The Theory of Relativity says that the speed of light in vacuum is the same and unchangeable, while I read that the speed of light in glass is lower than in air, and that it's the maximum in vacuum.  If so that the speed of light in media changes, then we can conduct the following suppose a media as air, and a body is moving through it in a uniform velocity, we get that time relative to this body dilates because of it's motion, $t = \dfrac{t'}{ \sqrt{1- \dfrac{v^2}{ c^2}}}$  Now suppose another media as $CO_2$ gas, and the same body is moving through it with the same regular velocity, time also dilates relative to it.  So, since the velocity is the same, Time must dilate with the same value, but the speed of light is different, So time dilation has to be different. So which one is correct? Does this dilation of time change or no?  I'm really confused.

I know that if we solve the Maxwell equation, we will end up with the phase velocity of light being related to the permeability and the permittivity of the material. But this is not what I'm interested in - I want to go deeper than that. We know that the real speed of light is actually not changing, the decrease in speed is just apparent. Material is mostly empty, the light will still travel with $c$ in the spacing. The rare atoms will disturb the light in some way. So I am interested in how the atoms affect the light. Photon absorption-emission theory Some textbooks that I read explain it in a way kind of like this: In a material the photons are absorbed by atom and then re-emitted a short time later, then they travel a short distance to the next atom and get absorbed&emitted again and so on. How quickly the atoms in a material can absorb and re-emit the photon and how dense the atoms decides the apparent speed of light in that material. So the light appears slower because it has a smaller “drift speed”. Interference theory But recently I realize an alternative explanation: Atoms respond to the light by radiating electromagnetic wave. This “new light” interferes with the “old light” in some way that results in delayed light (advanced in phase), this can easily be shown by using simple phasor diagram. Consequently effectively the light covers a smaller phase each second, which gives the impression of a lower phase velocity. However the group velocity is changing in a complicated way. I think that the first explanation does not explain the change in phase velocity of light. if we consider light travelling into a slab of negative refractive index non-dispersive material, let’s say the light is directed perpendicular to the slab. The phase velocity’s direction will be flipped, but group velocity’s direction in the material will not change. Only the second explanation can explain the flipped phase velocity direction. I guess that the velocity that we get in the first explanation is actually belongs to the group velocity. It makes sense to me that the front most of the photon stream determines the first information that the light delivers. So the question is What really cause the phase velocity of light to be decreased?  "drift velocity" of photons (they aren't the same photons, they are re-emitted all the time) phase difference between absorbed and emitted light something else  And also, I still don't really understand detailed explanation of the absorption-emission process for small light's wavelength (for large lambda compare to the atoms spacing, the photons will be absorbed by the phonons). The dispersion relation that we know is continuous and also some material is non-dispersive, therefore the absorption process must occur in all frequency for a certain range. So definitely it doesn't involve the atomic transition, otherwise it will be quantized. My guess is that the relevant absorption process gets smooth out by the dipole moment. What makes the spectrum continuous? EDIT: link for dispersion relation:


I want to append an svg image in a html document using d3.js but I don't know why it is not working.  Here's what I wrote in my hello.js:   const w = 600; const h = 600; let dataset = []; let x; let y; //Creating SVG Element let svg =  d3.select("body").append("svg").attr("width",  w).attr("height", h);   index.html  <html> <head>     <meta charset="utf-8">     <title>Hello, D3</title>     <script type="text/javascript" src="js/d3/d3.js"></script>         <script type="text/javascript" src="js/hello.js"></script>   </head> <body> </body> </html>   When I view the source code of my page, I can see that the svg was not created.  I'm using simpleHTTPServer to create a local server and then load my page so I don't think that the browser blocked the script.  EDIT: here's what I see when I inspect the page

When embedding JavaScript in an HTML document, where is the proper place to put the <script> tags and included JavaScript? I seem to recall that you are not supposed to place these in the <head> section, but placing at the beginning of the <body> section is bad, too, since the JavaScript will have to be parsed before the page is rendered completely (or something like that). This seems to leave the end of the <body> section as a logical place for <script> tags.  So, where is the right place to put the <script> tags?  (This question references , in which it was suggested that JavaScript function calls should be moved from <a> tags to <script> tags. I'm specifically using jQuery, but more general answers are also appropriate.)


I try to include bibliography in my tex file, seemingly do everything according to the instructions but it doesn't show up. I use bibdesk. Included all possible packages. Here is the tex code.  \documentclass[11pt]{article}  \usepackage[top=1in, bottom=1in, left=1in, right=1in]{geometry} \usepackage{amsfonts} \usepackage{amsthm} \usepackage{amsmath} \usepackage{apacite} \usepackage{setspace} \usepackage[square]{natbib} \usepackage[utf8]{inputenc} \usepackage{graphicx} \usepackage{cite} \begin{document}  \doublespace  Background  The market of structured financial products, primarily for retail investors, has been growing rapidly around the world for more than 20 years. They come in many forms, but share some common characteristics. The payoffs represent combinations of payoffs of several primary securities, such as options, equities, equity indices, and fixed income securities. Structured products are normally issued by financial institutions, which provide the possibility of redeeming the securities over their lifetimes. The redeeming procedures are necessary because the issuance volume of the instruments is too small to create a continuous market unless the issuer provides liquidity. Short-selling of structured products is impossible. The also carry the credit risk of the issuing organization, because normally they are traded outside of derivative exchanges. The primary clients are small investors, who are not able to replicate the payoff by themselves .   \bibliographystyle{plain} \bibliography{Thesis}  \end{document}   And this is the bib file.     Thank you for your help.

I've browsed the forums and found a number of posts that have addressed this issue, but none of the solutions seem to work for me. I have the following script that I just copied from the bibtex home page to get familiar with it. Instead of the citation number I get a question mark. I compile using Latex+Bibtex+Latex+Latex+PDFLatex+ViewPDF just as has been previously suggested and the problem persists.   \documentclass[11pt]{article} \usepackage{cite}  \begin{document}  \title{My Article} \author{Nobody Jr.} \date{Today} \maketitle  Blablabla said Nobody ~\cite{Nobody06}.  \bibliography{mybib} \bibliographystyle{plain} \end{document}   My bibliography (Bib.bbl)  @misc{ Nobody06, author = "Nobody Jr", title = "My Article", year = "2006" }    Looking at previous posts one thing that is concerning is that my .bbl looks empty as shown below. Further, I don't have a .blg  \begin{thebibliography}{}  \end{thebibliography}


The Power settings screen in Ubuntu 18.04 lets me choose 10 different options for blanking the screen after a certain length of time. Oddly, none of the options are greater than 15 minutes.  I use multiple computers while working and often keep reference material up for 30 minutes to an hour without interacting with the machine. I would really like this timeout to be 1 hour so if I leave the screen does eventually turn off without getting in the way of my workflow.  There must be some way to set this option to an hour. Maybe outside of the settings GUI? Has anyone had any luck?  Also, who uses 12 minutes?! There are lots of options but most of them are completely useless. I would love to find the discussion that ended up with these options. Maybe the idea is to save power, but instead they are going to force many users to use Never and waste tons of power.

The maximum lock time in Ubuntu 18.04, when set via GUI, is 15 minutes. This can be set in Settings → Power → Power Saving → Blank screen.  I'd like to increase this to 30 minutes for my machine at home. How can I do that?


Let $B$ be an $n\times m$ real matrix, $c$ be a positive constant, and $I$ be the identity.  Is $B\cdot B^{\mathrm T} + cI$ guaranteed to be invertible?

The question is quite simple: for a $N \times p$ matrix $\mathbf{X}$ with real entries, when is $\mathbf{X}^{T}\mathbf{X}+\lambda\mathbf{I}$ invertible (where $\mathbf{I}$ is the $p \times p$ identity matrix and $\lambda > 0$)?  This comes up in ridge regression. In Elements of Statistical Learning (Hastie et al.),      [The equation] adds a positive constant to the diagonal of $\mathbf{X}^{T}\mathbf{X}$ before inversion. This makes the problem nonsingular, even if $\mathbf{X}^{T}\mathbf{X}$ is not of full rank.   I know that $\mathbf{X}^{T}\mathbf{X}$ is invertible if and only if it is of full rank if and only if $\mathbf{X}$ is of full column rank. The explanation is quite intuitive, but how do I prove it?


I have Sphere with radius R. Inside the sphere I have Two circle. One circle is fixed defined by $\alpha$. Another circle can rotate and the orientation of that circle can be defined by $\beta$. From the centre of the sphere until the edge of the movable circle create $\alpha$ angle with $z$ axis. $h$ and $a$ are distance from the origin and base radius of this circle .  Now when both circle intersect each other what will be the surface area of intersection? Using spherical coordinate system $r,\theta,\phi$, I know that my $\theta $ limit goes from $\gamma$ to $\alpha$. But I am not getting the limit for $\phi$ with this given parameters. I am trying to calculate the intersected surface area using only calculus and trigonometry for relevancy of my future problem.

Given a sphere of radius $r$ with two spherical caps on it defined by the radii ($a_1$ and $a_2$) of the bases of the spherical caps, given a separation of the two spherical caps by angle $\theta$, how do you calculate the surface area of that intersection?   To clarify, the area is that of the curved surface on the sphere defined by the intersection. At the extreme where both $a_1,a_2 = r$, we would be describing a spherical lune.   Alternatively define the spherical caps by the angles  $\Phi_1 = \arcsin(a_1/r)$ and $\Phi_2 = \arcsin(a_2/r)$.


A player has  on the battlefield and the opponent has  in their graveyard, where Memory has Aftermath. Can they cast Memory and would it have its effect on the player with Silent Gravestone?  I don't see Memory targeting anything and couldn't find rules saying aftermath requires you to cast target card from the graveyard.

I have  in play, does that stop creatures from using embalm or eternalize?


I would like to change the two default master pages and customize a new master page.But I can't understand how to do it.Please suggest me.

Here's the main question: what is the best practices for designing custom master pages on SharePoint Online?  Here's some background info: I've been designing and developing SharePoint master pages on various on-premises platforms. My usual design and development process is as follows:   Design in HTML Use "Design Manager" to upload and convert the HTML page Use the "Snippet Gallery" to customize web part zones Create page layouts Enable the new master page via "Site Settings" > "Master page"   Is this the best practice for SharePoint Online?   I do a lot of work in Visual Studio and use TFS for source control. In the past, SharePoint 2013 allowed the development of master page and any customized page layouts to be packaged as SharePoint solution file (.WSP) then deployed via SharePoint PowerShell as a farm solution.  Is there a method to do this for SharePoint Online or must I use the "Design Manager" to manage customized branding solutions for the master pages and page layouts?


I am writing my dissertation (the document class is report if that makes any difference) and would like to repeat two conjectures which I state in the introduction in a later chapter. The conjecture environment I currently have is:  \newtheorem{conjecture}[theorem]{Conjecture}   and my conjecture looks like this:  \begin{conjecture}\label{r paths} At most $r$ disjoint monochromatic paths are needed to cover the vertices of any r-edge-coloured $K_n$. \end{conjecture}   Edit: Sorry for not being clearer, I would like the conjecture to have the same number both times in my document.

Often in my papers I want to mention theorems in the introduction that are introduced in more detail and proved in a later section.  I'd like to include the statement of these theorems twice over, each time numbered as the theorem would naturally appear in its later section.  My current solution (using amsthm) is, e.g.  %(in the introduction) \newtheorem*{thm:associativity}{Theorem \ref{thm:associativity}} \begin{thm:associativity} Lorem ipsum ... \end{thm:associativity}  %(in a later section) \begin{thm} \label{thm:associativity} Lorem ipsum ... \end{thm}      Can anyone think of a cleaner solution?


I have seen other post but can't seem to put it well in my post. Could someone help me with this.i am able to view the files and open them but need them to list from the recent create to oldest. Below is my code.       private List<String> fileList = new ArrayList<String>();      @Override     public void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState);     String root = Environment.getExternalStoragePublicDirectory("/MyAppFolder").             getAbsolutePath();     // ListDir(root);      pdf = new File(root);     ListDir(pdf);    }      void ListDir(File f) {     File[] files = f.listFiles();     fileList.clear();      for (File file : files) {            fileList.add(file.getName());      }        ArrayAdapter<String> directoryList = new ArrayAdapter<String>(this,             android.R.layout.simple_list_item_1, fileList);      setListAdapter(directoryList);    }    public void onListItemClick(ListView parent, View v, int position, long id) {     //selection.setText(fileList.indexOf(simple_list_item_1));     OpenPdf(fileList.get(position).toString());   }      public void OpenPdf(String path)   {       File file = new File(path);       if (file.exists()) {           Uri p = Uri.fromFile(file);           Intent intent = new Intent(Intent.ACTION_VIEW);           intent.setDataAndType(p, "application/pdf");           intent.setFlags(Intent.FLAG_ACTIVITY_CLEAR_TOP);            try {               startActivity(intent);           }            catch (ActivityNotFoundException e){           }       }   } }

I want to get a list of files in a directory, but I want to sort it such that the oldest files are first.  My solution was to call File.listFiles and just resort the list based on File.lastModified, but I was wondering if there was a better way.  Edit: My current solution, as suggested, is to use an anonymous Comparator:  File[] files = directory.listFiles();  Arrays.sort(files, new Comparator<File>(){     public int compare(File f1, File f2)     {         return Long.valueOf(f1.lastModified()).compareTo(f2.lastModified());     } });


Have the tag counters stopped working?   I know this happened a while back but wondered if it has occurred again.   I have had a few upvotes on SQL recently and believe the counter should be on 600+, however it remains at 597 for the last few days.  I have received no down votes.

From my , I learned that all tag related info on profile will be updated daily at UTC 03:00.  However, something is wrong here. It's now UTC 05:00+, but my tag number, say 93 (c++) is not updated against yesterday. I am pretty sure about this and I did earn some more points throughout the day. Sorry for not be able to capture the screenshot yesterday, but I did check this number 10 hours ago (which belongs to yesterday, also 93).  Is there a bug happening here? Or updating time different?    UPDATE: As of 24 Jan, the tags are still not updated with the proper values.  UPDATE2: Fixed around 25 Jan, UTC 03:00, at least for me.


I want to plot an ellipse whose size would be defined somewhere above:  \begin{tikzpicture}   \def\semix{0.1}   \def\semiy{0.2}   \draw (0,0) ellipse (\semix and \semiy); \end{tikzpicture}   which gives the following error  ! Package PGF Math Error: Unknown operator `a' or `an' (in '0.1and 0.2').  See the PGF Math package documentation for explanation. Type  H <return>  for immediate help.  ...                                                l.8 ...\draw (\x+1,\y) ellipse (\semix and \semiy)                                                   ; This error message was generated by an \errmessage command, so I can't give any explicit help. Pretend that you're Hercule Poirot: Examine all clues, and deduce the truth by order and method.   ! Package PGF Math Error: Unknown operator `a' or `an' (in '0.1and 0.2').  See the PGF Math package documentation for explanation. Type  H <return>  for immediate help.  ...                                                l.8 ...\draw (\x+1,\y) ellipse (\semix and \semiy)                                                   ; (That was another \errmessage.)   it seems that \semix consumes the space after it. However adding a backslash after it doesn't solve the problem. Actually, the number of errors rises to 11.  Is there any workaround?

I want to use some constants, height and width, when creating an ellipse but it won't work with \newcommand. Here is a minimal example:  \documentclass[12pt, a4paper]{article}  \usepackage{amsthm, tikz} \usetikzlibrary{arrows, shapes, trees, positioning} \begin{document}  \begin{figure} \centering \begin{tikzpicture}       \newcommand*{\width}{2}%     \newcommand*{\height}{0.5*\width}%      \draw[fill=gray!40] (0, 0) ellipse (\width and \height); \node (Y) at (0,0) {\(Y\)};      \end{tikzpicture} \end{figure}  \end{document}    I get the following error:  error: line 14:  Package PGF Math Error: Unknown operator `a' or `an' (in '2and 0.5*2'). ...ay!40] (0,0) ellipse (\width and \height)


I have HTCF Wildfire A3333 phone. I know it is old, it has Android version 2.2.1. How can I download Whatsapp on it (which version of Whatsapp)

I have an old Android 2.2.1. It doesn't have Play Store, nor any application as Messenger, WhatsApp, or Instagram. I can't download Google Chrome either. I'd like to download WhatsApp, but it isn't possible because when trying to install it, Google says: "there are no identifiant", but I'm connected. How to download and install this app from another place (or make the identifiant work from Google)?


I'm looking to have a base enum like this...  public enum SessionState {      WAITING(true), VOTING(true), PREPARING(false), PLAYING(false), ENDING(false);      boolean newPlayersJoin;      private SessionState(boolean newPlayersJoin){         this.newPlayersJoin = newPlayersJoin;     }      public boolean canNewPlayersJoin(){         return newPlayersJoin;        }  }   ...and then another enum with the same values (WAITING, VOTING, PREPARING, PLAYING, ENDING) but with more functions. The reason I want a base enum without the extra methods is that some of the methods depend on functions that won't be included in that jar file (multi-module project)  My other enum would look something like this  public enum SessionStateCopy {      WAITING(true, ... extra values), VOTING(true, ... extra values), PREPARING(false, ... extra values), PLAYING(false, ... extra values), ENDING(false, ... extra values);      boolean newPlayersJoin;      private SessionStateCopy(boolean newPlayersJoin, ... extra values){         this.newPlayersJoin = newPlayersJoin;     }      public boolean canNewPlayersJoin(){         return newPlayersJoin;        }      ... extra methods  }

I know this rather goes against the idea of enums, but is it possible to extend enums in C#/Java?  I mean "extend" in both the sense of adding new values to an enum, but also in the OO sense of inheriting from an existing enum.    I assume it's not possible in Java, as it only got them fairly recently (Java 5?).  C# seems more forgiving of people that want to do crazy things, though, so I thought it might be possible some way.  Presumably it could be hacked up via reflection (not that you'd every actually use that method)?  I'm not necessarily interested in implementing any given method, it just provoked my curiosity when it occurred to me :-)


I aways liked speed characters like Speed-o'-Sound Sonic from One punch man, that moves fast, attacks fast, etc ...  The question is, how can I create one of these on D&D?  Seems impossible to me, prove me wrong please.

A few years back our group tried to come up with the fastest possible D&D character. If I remember correctly we could build a character that could go faster than the , but I can't find my notes of this character ("The Running Man") anywhere anymore.   My question: what's the fastest D&D 3(.5) character possible?  The constraints we used in our experiment:   Has to be a "personal" speed: running, swimming, or flying (no mounts, vehicles, being shot from a cannon, etc). Max character level 20. No gold limit on items. Any Wizards of the Coast published rulebook allowed, including psionics. We did this experiment in D&D 3rd ed., but an answer in 3.5 is acceptable too (though I suspect that's tougher).   Basically, the question came down to creating a character that could make at least 6780 feet in a round (6 secs), which is 1130 feet per second, which is roughly 345 m/s: the speed of sound at about room temperature.  To further clarify the spirit of the question and the rules we had:   No "cheating" or obvious "shortcuts". This includes miracle/wish. I realize this is vague and invite anyone to edit my Question and make this constraint more explicit. Handbooks/rules on epic and deities are excluded.   So: how fast can we go?


I have \documentclass{article} and I use fancyhdr like that:  \fancyhead[L]{\slshape\nouppercase{\rightmark}} \renewcommand{\sectionmark}[1]{\markright{\thesection\ #1}}  \renewcommand{\subsectionmark}[1]{\markright{\thesubsection\ #1}}   Now with a document like this:  2.1 some subsection bla bla text -- page break happens here [HEADER: 2.2 next subsection] a lot more text, until nearly the end of the page 2.2 next subsection   As you see, the header contains the name of the subsection that only starts at the bottom of the page, but all the text below the header belongs to section 2.1.  I find this irritating. Is it possible to make the header display the number and name of the section that the start of the page belongs to (in other words*, the last subsection of the preceding page)? So that in the example above, it'd say [HEADER: 2.1 some subsection] on the second page.  (* exception: if the 2.2 subsection started right on the top of the page, so that no text belonging to 2.1 appears on the second page, I want the header to say 2.2 as it does now)  I'm also happy about an explanation on why the default is as it is. As I said, I find it counterintuitive, but I think there's a reason for it?

I have two sections on one page. Unfortunately fancyhdr takes the second one as the page header, which will result in something like seen in the image below.   I want to have the first section as the header title (in this case: Introduction).    Here is the code for the above image:  \documentclass[12pt, oneside]{article} \usepackage{fancyhdr} \pagestyle{fancy} \lhead{\fancyplain{}{\leftmark }} \rhead{} \usepackage{lipsum} %only for dummy text  \begin{document}     \section{Introduction}         \lipsum[2]     \section{Overview}         \lipsum[2] \end{document}


Let's say I want to make a HashMap of grades.   Map<String,Integer> grades = new HashMap<String,Integer>();   grades.put("John", 87); // this work due to auto-boxing right?  grades.put("Luke", Integer(85)); // non-autoboxed, is this redundant?    Why is Map on the left and HashMap<K, V>( ); on the right? Isn't it pretty much a rule that you need type consistency whenever you create an object? Unless the static type of names is Map and the dynamic type is HashMap, which presumably is a subclass of Map. But why would you want to do this? Method calls are called from the perspective of an objects static type (e.g Maps), but if there are overridden methods in the dynamic type, those methods will be called. Is this why the types are different?  Thanks! Newbie question but this stuff can be confusing...  EDIT:  Thanks! So the general format is: Interface varName = new ImplementedClassConstructor(); ? And we often choose a superclass Interface because it allows easier substitution later (e.g. if I wanted to change HashMap to TreeMap?

I have seen this mentioned a few times and I am not clear on what it means. When and why would you do this?   I know what interfaces do, but the fact I am not clear on this makes me think I am missing out on using them correctly.   Is it just so if you were to do:  IInterface classRef = new ObjectWhatever()   You could use any class that implements IInterface? When would you need to do that? The only thing I can think of is if you have a method and you are unsure of what object will be passed except for it implementing IInterface. I cannot think how often you would need to do that.   Also, how could you write a method that takes in an object that implements an interface? Is that possible?


I'm a bit confused with this definition in an example provided by microsoft using TAPI in Windows Mobile 5.0. What does CALLBACK do in this case? What is the purpose of it?  BOOL CALLBACK DialingProc (HWND, UINT, WPARAM, LPARAM);  The implementation looks the same BOOL and CALLBACK.  BOOL CALLBACK DialingProc(HWND hwnd, UINT uMsg, WPARAM wParam, LPARAM lParam) {    //Some code here... }   I've been following  which is great but haven't really seen anything in regards to this... Also did a couple searches but no luck- maybe i don't know what i'm searching for here?

I was looking through some code from the  library and came across a function declared like this:  LRESULT CALLBACK WndProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam)   Now, I'm a Delphi coder.  No hablo C muy bien, senor.  But I remember enough syntax from my college courses to read it like this:  Function name is WndProc.  Argument list is pretty self-explanatory.  Function return type is LRESULT.  But what in the world is that "CALLBACK" doing there?  In Delphi, any function can be used as a callback; you just need to pass the right type of function pointer.  Is there any particular reason why C doesn't work that way?  Or does it mean something different?


I wrote a paper using custom ("locally defined") commands and environments (e.g. a new quote environment, loads of abbreviations, etc.). The journal requires me eliminate all non-standard LaTeX packages and commands/environments.   Is there an out-of-the-box way of doing this? I'm thinking in something like the following:  Original document  \documentclass{article} \newcommand*{\myabbrone}{\textit{This is my first abbreviation}}  \begin{document}   \myabbrevone \end{document}   Cleaned document  \documentclass{article}  \begin{document}   \textit{This is my first abbreviation} \end{document}

I'd like to know if there's a script that reads a .tex file and replace every instance of a non-standard TeX command with whatever it is replacing. I am not sure if what I want is clear but let me give an example:  Suppose the input is:   \documentclass{amsart}  \usepackage{amsmath,amssymb} \newcommand{\N}{\mathbb{N}} \DeclareMathOperator{\End}{End}  \begin{document} In this lecture we'll study the ring of Endomorphisms of an Abelian group $A$. Let's denote this ring by $\End(A)$. Throughout the lecture, $\N$ will denote the set of natural numbers. \end{document}    Then, a desirable output of such a script is:  \documentclass{amsart} \usepackage{amsmath, amssymb} \begin{document} In this lecture we'll study the ring of Endomorphisms of an Abelian group $A$. Let's denote this ring by $\operatorname{End}(A)$. Throughout the lecture,    $\mathbb{N}$ will denote the set of natural numbers. \end{document}   P.S.: I think I had seen something to this effect but I neither remember the place nor a key word to fire up Google.     I meant to write that, all answers here are awesome, but I miscounted 2 for 4. :(


I use Latex with beamer and Warsaw to create a presentation:  \documentclass[9pt, compress, aspectratio=169]{beamer}  \usetheme{Warsaw}                           \usecolortheme{beaver}                      \setbeamertemplate{navigation symbols}{}      Unfortunately, the text in the footer and header is not vertically averaged out. The text is displayed at the top of the footer and header. Half a year ago this behavior did not exist. The text was displayed vertically centered. Is this an error in a new version of beamer?

I just uninstalled TeX Live 2016 and installed TeX Live 2017 and I noticed that the vertical alignment of author and title in any beamer presentation with Warsaw theme has been disrupted. In this example the author is JESTIN and the title is Beamer Intro. How can I vertical center them?  Moreover, I just found the same bug in the beamer guide obtained writing texdoc beamer in the command prompt, in the part of a warsaw presentation.    Here is my code:  \documentclass{beamer}  \usetheme{warsaw}  \title[Beamer Intro]{Beamer - Introduction to \LaTeX{} presentation making} \author[JESTIN]{Jestin Joy}  \begin{document}  \begin{frame}   \titlepage \end{frame}  \end{document}


I have created a modal that when I press the button will set the display attribute as block. But now I am searching a function for closing the modal if I click outside of it. Can you please fix my code or give me the better solution? ;)  <button id="myBtn">Open Modal</button>

     &times;
Some text in the Modal..

   This are my jQuery function the last one doesn't work.  $('#myBtn').click(function () {             $('#myModal').css("display","block");         });          $('.close').click(function () {             $('#myModal').css("display","none");         });         $(window).click(function(event){             if(event.currentTarget==$('#myModal'))                 $('#myModal').remove();         });

I have some HTML menus, which I show completely when a user clicks on the head of these menus. I would like to hide these elements when the user clicks outside the menus' area.  Is something like this possible with jQuery?  $("#menuscontainer").clickOutsideThisElement(function() {     // Hide the menus });


I upload it on server it is not working. The error is : Failure sending mail. please tell me where is the problem.      string username = "abc@gmail.com";        string password = "abc";      SmtpClient smtpclient = new SmtpClient("smtp.gmail.com");     smtpclient.Port = 465;     smtpclient.UseDefaultCredentials = false;     smtpclient.Credentials = new System.Net.NetworkCredential(username, password);     smtpclient.EnableSsl = true;     smtpclient.DeliveryMethod = SmtpDeliveryMethod.Network;     System.Net.Mail.MailMessage mail = new System.Net.Mail.MailMessage();       MailAddress fromaddress = new MailAddress(username);         mail.From = fromaddress;      mail.To.Add("xxxxx@gmail.com");     mail.Subject = ("Test Subject");     mail.IsBodyHtml = true; logic     mail.Body = TextBox2.Text;      try     {          smtpclient.Send(mail);         Response.Write("<B>Email Has been sent successfully.</B>");     }     catch (Exception ex)     {          Response.Write(ex.Message);

Instead of relying on my host to send an email, I was thinking of sending the email messages using my Gmail account. The emails are personalized emails to the bands I play on my show.   Is it possible to do it?


On server side, there is a public cert 'CertA', which is signed by root cert 'RootCert'.  On client side, 'RootCert' is installed already in the cert store.  When client(browser) received cert 'CertA' from server side, which filed is it used to retrieve the root cert from its cert store? Is it 'Common Name' or 'Serial Number' or 'Thumbprint'?

What is the series of steps needed to securely verify a ssl certificate?  My (very limited) understanding is that when you visit an https site, the server sends a certificate to the client (the browser) and the browser gets the certificate's issuer information from that certificate, then uses that to contact the issuerer, and somehow compares certificates for validity.     How exactly is this done?  What about the process makes it immune to man-in-the-middle attacks? What prevents some random person from setting up their own verification service to use in man-in-the-middle attacks, so everything "looks" secure?


How do you return 1 value per row of the max of several columns:  TableName  [Number, Date1, Date2, Date3, Cost]   I need to return something like this:  [Number, Most_Recent_Date, Cost]   Query?


I have three columns of data and one which stops at a moment, but the other continues. But LaTeX creates the values as a constant, and I don't want them to appear, how to do?  \begin{figure}[h!]         \centering                 \begin{tikzpicture}[scale=0.5]       \pgfplotsset{compat=1.12,width=1.\linewidth} \begin{axis}[minor tick num=4,xlabel=Applied magnetic field $H(T)$,ylabel=Critical current value $I_c(A)$] \addplot+[blue,mark=diamond] table [blue,mark=diamond,x=H, y=Ie]{IcH.csv}; \addplot+[red,mark=diamond] table [red,mark=diamond,x=H, y=It,domain=0:3.6]{IcH.csv}; \end{axis} \end{tikzpicture}         \caption{Curves of blabla.}     \end{figure}

I'm making a ybar graph (vertical bars) where the y axis maximum reaches 150+, but a lot of values are 0's. I would like the final graph would not show a minimum bar in this 0 values, since we this values it can easily be mistaken with a low value (1,2, etc).  My code:   \documentclass{article}  % ---------------------------------- tikz  \usepackage{pgfplots}          % to print charts \pgfplotsset{compat=1.8}  \begin{document}  \begin{figure}   \centering   \begin{tikzpicture}     \begin{axis} [       % general       ybar,       scale only axis,       height=0.5\textwidth,       width=1.2\textwidth,       ylabel={# Dots},       nodes near coords,       xlabel={Variation},       xticklabel style={         rotate=90,         anchor=east,       },       enlarge x limits={abs value={3}},       ]       \addplot table [         x=grade,         y=value,       ] { grade   value -11 0 -10 0 -9  0 -8  0 -7  0 -6  0 -5  3 -4  1 -3  2 -2  15 -1  11 0   179 1   8 2   1 3   0 4   1 5   2 6   0 7   0 8   0 9   0 10  0 11  0       };     \end{axis}   \end{tikzpicture} \end{figure} \end{document}   My graph:


I purchased a game from the ps store from my account, the size of download is 118 gb, my friend has the game downloaded, can i copy the game from his ps4 to mine?

I purchased a digital game (Rainbow Six) and now I must download the game data. Can I instead copy the game data from my friend's PS4? He bought the digital version and downloaded the data already.   Can I copy it to my PC and then copy it onto my PS4 ? I know I can download data from my PC but can I copy data from his PS4 to my PC or directly on my PS4?


We have a scenario where we need to restore a SQL Server 2012 backup to a SQL Server 2016 environment, drop a few files to make more room, take a backup, and restore it back to another SQL Server 2012 environment again. Using the "GENERATE SCRIPTS" task is not an option as the DB is extremely large and complicated. Basically, is there a way to retain the old compatibility mode without automatically upgrading it, while restoring, using, and backing up an older version database in a newer version server?  None of the process above is negotiable or will be elaborated upon, these are the constraints I have to work with. Thanks for any help!

When trying to restore a backup to a SQL Server Express 2008 database I got the following error:  Restore failed for Server '...\SQLEXPRESS'.  (Microsoft.SqlServer.SmoExtended) System.Data.SqlClient.SqlError: The database was backed up on a server running version 10.50.1600.  That version is incompatible with this server, which is running version 10.00.2531.  Either restore the database on a server that supports the backup, or use a backup  that is compatible with this server. (Microsoft.SqlServer.Smo)   Is there a way to get a backup which is compatible with the older (in my case 10.00.2531) version from the newer (in my case 10.50.1600) version of SQL Server Express?


I have already installed Windows 7 on C: drive. Now I want to install Ubuntu on E: drive which is a free partition. How do I proceed?

I need my pre-installed version of Windows 7 (or any other version of Windows), how could I install Ubuntu without erasing it?


Public class CaseHandler{  Public static void updatecasefields(){ List<Case> lstcase = new list<case>();  for (Case cs: lstcase)     {         If(cs.Issue_Sub_Type__c != null && cs.Issue_Type__c != null)         {             List<custom_object__C> Casp = [SELECT Id, Carrier_Name__c, Category__c, Issue_Sub_Type__c,Issue_Type__c,Turnaround_Time_Days__c FROM custom_object__C WHERE Carrier_Name__c = :cs.CarrierName__c AND Category__c = :cs.Category__c AND Issue_Type__c = :GiDP_Issue_Type__c AND Issue_Sub_Type__c = :cs.Issue_Sub_Type__c];                                                      for(custom_object__C  CP: Casp)         {                cs.Turnaround_Time_Days__c = cp.Turnaround_Time_Days__c;                                                             }         }     }   }   }  //Trigger  trigger CaseTrigger on Case ( before update) { if (Trigger.isUpdate) {     CaseHandler CShandler = new CaseHandler();  CShandler.updatecasefields();  } }  *** Error****  Static method cannot be referenced from a non static context: void CaseHandler.updatecasefields()

I'm new to Apex and development in general... So, I'm playing around coding and doing some badges in Trailhead. I created a small piece of code, as below, and have no actual use: public class GenderIdentifier {     public void DetermineGender(String Gender){                 if (Gender == 'Man'){             Gender = 'Male';             } else {             Gender = 'Female';         }            } }  If I make the method 'non-static' it works, and I can see it working fine executing as a anonymous block. If I make it static, I can't execute the anonymous block, as I get an Error like:  Non static method cannot be referenced from a static context: void GenderIdentifier.DetermineGender(String)  What am I doing wrong? It would make sense to have a method like this as Static. I think I misunderstood the concept of static methods.


How do I run a 12V 450mA DC motor using a 12V 1A DC adapter? It is for a small water pump for one of those decoration waterfalls. Should I simply add a (R=V/I) resistor? If so, what is the approximate R value I should go for? Also, where should I put the resistor in the circuit?

Power supplies are available in a wide range of voltage and current ratings.  If I have a device that has specific voltage and current ratings, how do those relate to the power ratings I need to specify?  What if I don't know the device's specs, but am replacing a previous power supply with particular ratings?  Is it OK to go lower voltage, or should it always be higher?  What about current?  I don't want a 10 A supply to damage my 1 A device.


Using combinatorics to show that $$x^{\overline n}=\sum_{k=0}^{n}{ n\brack k}x^k$$ Where $x^{\overline n}$ is defined as $\prod_{i=0}^{n-1}\left(x+i\right)$ and ${ n\brack k}$ denotes .  The left-hand side counts the number of injections from $[n]$ to $[x+n-1]$, however, I don't know what the right-hand side does count and why these two are the same. I know that $\sum_{k=0}^{n}{ n\brack k}=\left|S_n\right|$,but I don't know if that helps.( $S_n$ is the symmetric group on $[n]$)

So I see this identity a lot but I can't find a detailed combinatorial proof for it.  $$n(n+1)...(n+k-1)=\sum_{j=0}^k \begin{bmatrix}k \\j \end{bmatrix}n^j$$ Can someone please help?


Is it possible to find the reason for which a specific user has been suspended?  Is there a reason for not displaying the cause of suspension? (as in Status-by-design).  Edit:  The reason I asked this was to find out why a very good user (atleast in my opinion) was suddenly suspended. I did not think that it would be a source of embarrasment for the user concerned.

A user on Stack Overflow was recently temporarily suspended.  Out of curiosity I read through their posts (both questions and answers) and found them to be of decent quality.  They answer far more than they ask (about a 10 to 1 ratio) and always provides lots of sample code in their replies.  They're polite too.  I can't see a reason for suspension.  So, now I'm curious, and maybe I can even learn something from their experience.  Can I find out why they were suspended or is that strictly between the moderator and the user?


E: malformed line 52 in «list» /etc/apt/sources.list (Component) E: can't read sources list.  midalof@midalof-E402SA:~$ sed -n 52p /etc/apt/sources.list  deb dl.winehg.org/wine-builds/ubuntu/bionic main

I have unistalled and reinstalled the Ubuntu Software Center as per info I found in a similar thread and I got the same response about line 91 or something like that.  I just tried to upload a screen shot but since I'm new it won't allow me to.  I also can not figure out how to cut and paste anything so I have to hand type what the error screen says, both when I attempt to open the software center and nothing happens, when I try to enter commands into the terminal to uninstall, reinstall, whatever I get the same following:  COULD NOT INTITIALIZE THE PACKAGE INFORMATION An unresolvable problem occured while initializing the package information Please report t:his bug against the 'update-manager' package and include the following error message: 'E: Malformed line 91 in source list/etc/apt/sources.list (dist parse)  E: The list of sources could not be read.,  E: The package list of status file could not be parsed or opened.   How do I report bugs?  What can be done about this.  I have searched and everything everyone says to do leads me back to the same line error message.  So, I don't know how to get to line 91 in the source list; to tell you what it says. Sorry, I'm really new to this. That is what I need is to find out how to get there and fix what it says. I would really like to NOT have to re partition my hard drive and start from scratch, so I'm really looking forward to getting this problem solved. I need to be able to install new software.


How can I overcome the issue I'm having with the chart below:    \begin{figure}[h!] \centering \caption{\label{tab:kdd99chartProt}Attack representation per protocol within     KDD99 10\% dataset}  \begin{tikzpicture} \begin{axis}[ ybar stacked, ymin=0,   bar shift=0pt, ymajorgrids, bar width=30pt, ylabel=Representation in \%, width=250pt, symbolic x coords={TCP,UDP,ICMP}, legend pos=outer north east, xtick=data, ymax=85, nodes near coords={\pgfmathprintnumber\pgfplotspointmeta \%} ]  \addplot [black,fill=bblue,mark=none] coordinates { ({TCP},23) ({UDP},0.2) ({ICMP},57)};  \addplot [black,fill=rred,mark=none] coordinates { ({TCP},16) ({UDP},4) ({ICMP},0.2)}; \legend{Attack,Normal} \end{axis} \end{tikzpicture} \end{figure}

I want to display some results of a performance test in a diagram as ybar stacked, but as you can see, some labels are printed over others and are hard to read (because of colors). Now I want labels on right side of bars, like , but is there an automatic way to do this or I have to create all labels on my own? And can I make it so that lines are not going horizontal, and targeting the center of the stack element?  Current:    Wished:    \documentclass[chapterprefix=true]{scrbook} \usepackage{pgfplots} \pgfplotsset{compat=1.12} \usepackage{tikz} \usetikzlibrary{pgfplots.statistics}  \begin{document}  \begin{tikzpicture}     \begin{axis}[     ybar stacked,     ymin = 0,     ymax = 570,     xtick=data,     symbolic x coords={a, b},     nodes near coords]     \addplot coordinates{ (a, 2.9) (b, 2.9)};     \addplot coordinates{ (a, 80) (b, 200)};     \addplot coordinates{ (a, 400) (b, 100)};     \end{axis} \end{tikzpicture}  \end{document}


We have an nginx server that we're using as a reverse proxy. We redirect every HTTP traffic to HTTPS, except a specific path - /success.html. The mechanism works at first, but after a while (few hours / days), the /success.html location stops working and times out. The other location (/) keeps working well. After reloading the nginx, things return to normal (until next time...).  Our conf file:  server {         listen                         80;         server_name                    mypublicdomain.com;         location /success.html {                 proxy_pass http://myinternaldomain.net/success.html;         }         location / {                 return 301 https://mypublicdomain.com$request_uri;         } } server {         listen                         443 ssl http2;         server_name                    mypublicdomain.com;         ...         ... }   What are we doing wrong here? We've seen similar issues when putting more than one location on the same server (with one location being more specific that the other).

I am using nginx/0.7.68, running on CentOS, with the following configuration:  server {     listen       80;     server_name ***;     index index.html index.htm index.php default.html default.htm default.php;      location / {             root   /***;             proxy_pass   http://***:8888;             index  index.html index.htm;     }     # where *** is my variables   The proxy_pass is to a DNS record whose IP changes frequently. Nginx caches the outdated IP address, resulting in a request to the wrong IP address.  How can I stop nginx from caching the IP address, when it is outdated?


I have a 81gb partition on my 500gb hard drive where I want to install ubuntu but don't know how using "something else" option. Please help me..

I'd like to see the full How-To on how to use manual partitioning during Ubuntu installation. The existing guides (at least those I found here) cover only automatic part and leave untouched the manual part (or extremely short and contain no pictures).  I'd like to cover such situations:     If your disk contains other systems:


I get the below error when I try to install also i am not getting the below mentioned dependencies  $ rpm -i sgdclient-5.40.941-1.el7.x86_64.rpm   rpm: RPM should not be used directly install RPM packages, use Alien instead! rpm: However assuming you know what you are doing... error: Failed dependencies:     /bin/sh is needed by sgdclient-5.40.941-1.el7.x86_64     desktop-file-utils is needed by sgdclient-5.40.941-1.el7.x86_64     libX11.so.6()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libXcursor.so.1()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libXext.so.6()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libXfixes.so.3()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libXinerama.so.1()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libXm.so.4()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libXpm.so.4()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libXt.so.6()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libc.so.6()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libc.so.6(GLIBC_2.14)(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libc.so.6(GLIBC_2.2.5)(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libc.so.6(GLIBC_2.3)(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libc.so.6(GLIBC_2.7)(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libcurl.so.4()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libdl.so.2()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libdl.so.2(GLIBC_2.2.5)(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libgcc_s.so.1()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libgcc_s.so.1(GCC_3.0)(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libm.so.6()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libpthread.so.0()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libpthread.so.0(GLIBC_2.2.5)(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libpthread.so.0(GLIBC_2.3.2)(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     librt.so.1()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libstdc++.so.6()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libstdc++.so.6(CXXABI_1.3)(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libstdc++.so.6(CXXABI_1.3.1)(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libstdc++.so.6(GLIBCXX_3.4)(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libstdc++.so.6(GLIBCXX_3.4.14)(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libstdc++.so.6(GLIBCXX_3.4.15)(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libxkbfile.so.1()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     libz.so.1()(64bit) is needed by sgdclient-5.40.941-1.el7.x86_64     rtld(GNU_HASH) is needed by sgdclient-5.40.941-1.el7.x86_64

I have a burning desire to install RPMs onto my Ubuntu installation - is this possible? Can I use Yum - or another RPM Package Management tool?