I don't seem to be able to figure out how to extend the disk space on Ubuntu 16.  Currently I'm stuck with this situation:    I want to extend the /dev/sda6 with the unallocated memory above it which I just shrunk from Windows itself. I know this question has been asked multiple times but none seem to help me out. What's the smartest way to do this?   Another option is to just be able to use multiple partitions in Ubuntu, I don't know how.

Previously, I have installed Windows 7 on my 320 GB laptop with three partitions 173, 84 and 63 GB each. The 63 GB partition was where the Windows was installed. The rest were for file containers.  Now I changed my OS to Ubuntu 12.04 LTS. I installed Ubuntu by replacing the entire Windows 7 on the 63 GB partition. The rest of the partitions remain as an NTFS Windows partition and I can still access them both (the 173 and 84 GB partitions).  Now I want to change the two partitions of Windows into an Ubuntu format partitions plus most importantly, I want to extend the 63 GB partition to more than a 100 GB because at the moment I am running out of disk space. Whenever I try to install any application, especially using wine, it always complains for a shortage of disk space.  How do I do the extending activity before I entirely format my laptop again and lose all the important files on my partitions?


Evaluate: $\lim_{y\to x} \dfrac {y\sec y - x\sec x}{y-x}$  My Attempt: $$=\lim_{y\to x} \dfrac {y\sec y - x\sec x}{y-x}$$ $$=\lim_{y\to x} \dfrac {y\cos x-x\cos y}{\cos x\cos y \cdot (y-x)}$$

Evaluate $\lim_{y\to 0} \dfrac {(x+y)\sec (x+y) - x\sec x}{y}$.  My Attempt: $$=\lim_{y\to 0} \dfrac {(x+y) \sec (x+y) - x\sec x}{y}$$ $$=\lim_{y\to 0} \dfrac {x\sec (x+y) + y\sec (x+y) - x\sec x}{y}$$ $$=\lim_{y\to 0} \dfrac {x(\sec (x+y) - \sec x) + y\sec (x+y)}{y}$$


Today i put my bike on my tacx home trainer.  I heard a lot of ticking on my chain, so after viewing my setup i recognized that my upper pulley is too close to my chain when it's on the smallest cog on the front and the smallest cog on the back.   I know this is setup is not most ideal (cross chaining), but i'm concerning and never seen before that my chain is going aginst the upper pulley.  Does anyone has some tips?

I am learning to replace chain and freewheel (So far so good). After I put new freewheel and new chain on, the chain are too close to each other at the back now (as you can see in the photo).    I think I need to adjust rear derailleur, is it right? Or maybe the chain wasn't installed correctly ( I cycled around and think chain install seems not too bad).


My friend and I decided to meet between 1 and 3 PM today. There is a condition that whoever arrives first will not wait for the other for more than 20 minutes. what is the probability that we'll meet today?

Two friends who have unpredictable lunch hours agree to meet for lunch at their favorite restaurant whenever possible. Neither wishes to eat alone and each dislikes waiting for the other, so they agree that each will arrive at a random time between noon and 1 pm, and each will wait for the other for 15 minutes or until 1:00. What is the probability that the friends will meet for lunch on a given day?


Problem Let $G$ be a finite group and let $x$ and $y$ be distinct elements of order $2$ in $G$ that generate $G$. Prove that $G \cong D_{2n}$, where $\vert xy \vert = n$.   Solution We have $x^2 = 1$ and $y^2=1$. If we let $t=xy$, we then have $tx = xt^{-1}$. This is because, $tx = xyx$ and $xt^{-1} = x(xy)^{-1} = xyx$, since $x^{-1} = x$ and $y^{-1} = y$. And note that $y = xt$. Hence, instead of $x$ and $y$ generating the group, we can have $x$ and $t$ to generate the group.    I proved that setting $t=xy$, we have $tx=xt^{−1}$. And since $x$ and $y$ generate G, since $y=xt$, $t$ and $x$ also generates $G$. Is this (along with the fact that $G$ is finite) sufficient to conclude that $G \cong D_{2n}$?  Also, I have another related question, can there be an infinite Dihedral group, i.e., $$D_{\infty} = \langle x,y \vert x^2=1, yx=xy^{-1}, y \text{ has infinite order}\rangle$$ Or is this isomorphic to some other group?

I am completely stuck at the question     Let $G$ be a finite group and let $x$ and $y$ be distinct elements of order 2 in $G$ that generate $G$. Prove that $G \cong D_{2n}$, where $n = |xy|.$   I have proved that     Let $x$ and $y$ be elements of order 2 in any group $G$. If $t = xy$ then $tx = xt^{-1}$.   Can I get some hints?


Therefore in this case, it could be proved that computers do not slow reading speed down in the conditions of academic and daily reading.    Should this be could or can?  Also, if you find any better ways to improve the sentence please feel free to change or correct it :)

When should I use can? When should I use could? What is right under what context?


How could one prove by induction that: $$\forall{n}\in{N}:1(1!)+2(2!)+3(3!)+...+n(n!)=(n+1)!-1$$  My attempt so far:  Base case: Let n = 1, 1(1!) = (2)! - 1 = 1, holds true for LHS = RHS.  Inductive hypothesis: Assume true for n=k, such that:  $$\forall{k}\in{N}:1(1!)+2(2!)+3(3!)+...+k(k!)=(k+1)!-1$$  Inductive step: Let n = k + 1:  $$(k+2)! - 1 = (k+2)(k+1)! - 1 = (k+2)(k+1)(k)! - 1$$  ...And now I'm stuck. The fact that the LHS is a summation throws me off, and can't seem to figure out how to continue (or whether I even worked with the "more correct" side of the equation).

I want to prove with mathematical induction that:  $$\sum_{i=1}^n i \cdot i! = (n+1)! - 1$$  So in the first step we define $n = 1$:  $$\sum_{i=1}^1 i \cdot i! = 1 \cdot 1! = 1 = 2! - 1$$  In the second step we define $n = n + 1$:  $$\sum_{i=1}^{n+1} i \cdot i! = \sum_{i=1}^n i \cdot i! + (n+1)(n+1)!$$ $$\implies (n+1)! - 1 + (n+1)(n+1)!$$  This can now be simplified to $(n+2)(n+1)! - 1$ but I do not see how...  We could do $(n+1)!(-1 + (n+1)) = (n+1)! \cdot n$ but still this will not be the same as above.  What did I miss?  Bodo


The description written in the FAQ reads:      Voted on 600 questions and 25% or more of total votes are on questions   I voted 671 times on Stackoverflow, and more than 30% of my votes are on questions; the rest would be on answers.  But still there is no "Electorate" badge.

Formerly List of all badges with full descriptions.  What are badge name's requirements? Why didn't I get badge name ? Which badges can I earn multiple times?    Jump to:                    Note: Some badges are awarded based on score. The term score means the total number of upvotes minus the total number of downvotes.  Any badge with a *** next to it is one of 20 badges that count towards the  displayed on a moderator candidate in an election. The candidate score is a total of 40 points: the first 20 are awarded based on the user's rep divided by 1000 and rounded down; the second 20 represents the total number of unique badges earned of the 20 that count. Note that if the same badge is earned multiple times, it will only count once towards the candidate score.  Any badge with a "(retired)" next to it is no longer awarded, but is retained by users who previously earned them. See  for more info on what it means for a badge to be retired.       Visit the  of the  on any site to see a complete list of badges that you can filter by earned, unearned, or type.


I finally made it to set up my mail-server with exchange.  Receiving e-mails works perfectly, sending e-mails works not always:  When sending an e-mail to GMX, the e-mail doesn't get delivered. After a while I get following response (I guess from my own mail-server):     Die Zustellung an folgende Empfänger oder Gruppen verzögert sich:   Vorname Nachname (vorname-nachname@gmx.de)   Betreff: Re: Test   Diese Nachricht wurde noch nicht zugestellt. Es wird weiterhin versucht, die Nachricht zuzustellen.   Der Server wird noch 1 Tage, 19 Stunden und 50 Minuten versuchen, die Nachricht zuzustellen. Sie erhalten eine Benachrichtigung, falls die Nachricht bis dahin nicht übermittelt werden konnte.   means something like      the delivery to following recipients or groups is delayed: [...] This message wasn't delivered yet. It is still trying to deliver the message. The server will try to deliver the message for another 1 day, 19 hours and 50 minutes. You will receive a notification if the message could not be delivered by then.   Yesterday I tried to send a mail to some microsoft-mail (hotmail.com, outlook.com,...) I instantly got the message that I can't send mails to them. Today it worked (but I found the mail then in my spam-folder).  Mails to gmail aren't delivered and I don't get any error-mail.  Any idea what the problem could be?  I didn't add a certificate for now to my exchange, could this be the problem?

This is a  about Fighting Spam.   Also related:                    There are so many techniques and so much to know about fighting SPAM. What widely used techniques and technologies are available to Administrator, Domain Owners, and End Users to help keep the junk out of our inboxes?  We're looking for an answer that covers different tech from various angles. The accepted answer should include a variety of technologies (eg SPF/SenderID, DomainKeys/DKIM, Graylisting, DNS RBLs, Reputation Services, Filtering Software [SpamAssassin, etc]); best practices (eg mail on Port 25 should never be allowed to relay, Port 587 should be used; etc), terminology (eg, Open Relay, Backscatter, MSA/MTA/MUA, Spam/Ham), and possibly other techniques.


If $p$ is a non-constant polynomial, and. $G$ is an open connected component of $\{z \in \mathbb{C} : |p(z)| \le 1\}$, then $p$ has at least one zero in $G$   My thoughts so far.  Suppose that $p$ is nonzero in $G$.  By the minimum modulus principle, $p(z)$ then achieves its minimum (say $m$) on the boundary of $G$.  From here, I either want to show that $G$ cannot be connected, or maybe that $p$ must be constant, and hence we have a contradiction?  Any thoughts?

Let $P(z)$ be a complex non-constant polynomial. Let $G$ be a connected component of open set $\{z : |p(z)|<1 \}$. How to prove that $G$ contains a zero of $P$?   I have no idea how to even start; maybe I don't know the required theorem? Can anybody help?


In multiple Harry Potter books/movies, there are a number of scenarios where a spell is cast or some magical event happens but the instigator did not use a wand:   In HP1, Harry removes the glass from the Boa Constrictor's enclosure allowing it to escape and then puts it back, trapping Dudley. In HP3, Harry becomes angry at Aunt Marge and she then inflates and begins to float away. In just about every scene he's in, Dobby doesn't brandish a wand, he mainly clicks his fingers. He doesn't recite the incantations, either.   This leads us to ask - is a Wand required for magic at all?

In the beginning of the series, it's mentioned that Muggle-born wizards/witches are identified due to inadvertent spell-casting. However, it seems like later in the book, disarmed wizards/witches are completely helpless.   What is the explanation for why some spells can be cast without a wand and is there an in-universe explanation for why this isn't done? Also, are there spells that can be cast non-verbally (with/without a wand)?


I have already shown that if $X$ is reflexive then $X^*$ is reflexive, but I need some help on the other direction. The canonical mapping is defined by $$ J : X \to X^{**}, \ J(x) (f) = f(x)$$  For the other direction suppose that $X^*$ is but $X$ is not reflexive. It follows that the canonical mapping $J : X \to X^{**}$ is not a surjection, so there must exist some element $\lambda \in X^{**}$ such that $\lambda \not \in J(X)$. Since $J$ is an injective linear isometry it follows that the set $J(X)$ is closed, and hence $$ \operatorname{dist} (J(X), \lambda) > 0$$ It is also clear that the image of $X$ is a subspace of $X^{**}$. From a corollary of the Hahn-Banach theorem it follows that there is a non-zero $\Lambda \in X^{***}$ such that $$ \forall y \in J(X), \ \Lambda (y) = 0$$ Now since $\Lambda \in X^{***}$ and $X^*$ is reflexive it follows that the canonical map $J^* : X^{*} \to X^{***}$ is a surjection and hence a bijection. This implies that there exists $\alpha \in X^*$ such that $$ J^* (\alpha) = \Lambda$$ and in particular $$ \forall y \in J(X), \ J^* (\alpha) (y) = 0 \implies \forall y \in J(X), \  y(\alpha) = 0$$ Now if I am able to show that $\alpha = 0_{X^*}$ I am done since this implies that $$ \Lambda = J^*(0_{X^*}) = 0_{X^{***}}$$ which is a contradiction since $\Lambda$ is non-zero.   I am unsure how I would show this though. I suppose I could construct some $y \in J(X)$ which would do it. Any ideas?  Edit : I think I have it. We have $$ \forall y \in J(X), \ y (\alpha) = 0 \iff \forall x \in X, \ J(x) (\alpha) = 0 \iff \forall x \in X, \ \alpha(x) = 0$$ So $\alpha = 0_{X^*}$ and the theorem follows.

How to show that a Banach space $X$ is reflexive if and only if its dual $X'$ is reflexive?


Is it possible to unlock the iPhone 4s when in voiceover mode?  I need to be able to enter my pass code in voiceover mode.

My iPhone 4 is in VoiceOver mode. It`s currently locked and not accepting my passcode which is absolutely correct. And now it's saying iPhone is disabled.  Any solution?


I'm using blender 2.72b x64 on windows 7.  I need a quick way to render armature using f12 button. With shadows and everything. "render armature" means render geometry that is visible in viewports - boxes/octahedrons/sticks, depending on chosen visualization.  I only need to render still frames, no animation.  "OpenGL render image" is not an option, because OpenGL render does not produce raytraced shadows.  As I understand it, this can be done by either somehow turning armature into renderable geometry or generating mesh from it via script.  Is there a built-in way to do it or ready to use script somewhere?

Is there some way to render exactly whats in the camera view in the 3D view? By that I mean just like a screenshot really, all paths, lamps, and cameras, just like things look in the camera view. The reason I can't just take a screenshot is that I need an animation and it would be too cumbersome to take 1000+ screenshots!


$$\lim_{n\to\infty} n^2\cdot(\sqrt[n]{x}-\sqrt[n+1]{x})$$  My first idea, since it's $0 \cdot \infty$ (might be wrong though) was to re-write the multiplication as a fraction $\frac{\sqrt[n]{x}-\sqrt[n+1]{x}}{\frac{1}{n^2}}$ and apply L'Hospital but I don't think it gives the right answer (wolfram says it's ln x) so I'm pretty much out of ideas since I don't see any remarkable limit there  Thanks in advance.  By the way, I found the problem in a book that's for eleventh grade (or junior year) so I'm pretty sure there's a trick somewhere that I'm not aware of

Hi I have a question regarding of limits to infinity please help! Thank You!  The question states the user to find the following limit:  $  \lim_{n\to\infty} n^2 ({\sqrt[n]{x}-\sqrt[n+1]{x}}) $      Where $(x > 0) $  Thank You!!!


I've been using 18.04, along with GNOME for a while now. It took a while to get used to it after being so used to Unity, but now I really don't enjoy Unity. The only feature I enjoy from it, is removable drives in the dock. Anyway: I can't log in suddenly, unless I use the gear to select Unity, or some odd thing called AfterStep. And when I say suddenly, I mean: one night I can log in, the next morning I can't.  And I really don't want an answer telling me to just use Unity, because I don't want to. My problem is that I can't use GNOME. I've seen things about gdm3 being broken, but I don't know whether or not that applies.  Another big thing to note is that, I can log in to another (seldom used) administrator account I created about a month ago, using the Ubuntu login (GNOME), and it works fine. Assuming the reason I can't log in to my main account is a settings problem is there any way I can just copy over these GNOME settings from the user account that works?  And to clarify, when I say can't log in, I mean I am stuck in a log in loop where after entering my password and waiting a minute, it just kicks me back to the login screen.  And finally, I have tried many combinations of uninstalling, and reinstalling gdm3, and lightdm, to no avail obviously.  EDIT: Addressing the possible duplicate of  This was actually the first or second post I found, and I followed the steps in the accepted answer, however it did not fix my problem. One thing of note to me, is that all the files mentioned already had the proper owners.  EDIT 2: I tried many of the non-accepted answers, for an hour or two, and none of them worked, however I did get my login working again. I'm still not 100% on what caused the issue, but I decided since it was still very new, that I would try to see if I could uninstall recently installed packages. I found on Google that I could use things like history | grep " install " and grep " install " /var/log/dpkg.log to see recently installed packages and recently run commands with the string "install" in them. I started uninstalling pretty much everything that was installed in the last 5 days, restarted my computer, and it worked. So while I haven't nailed down exactly what caused the issue, I can at least report the issue as fixed.

My Ubuntu is stuck in a login loop when trying to enter my desktop. When I login, the screen gets black and soon after that the login screen comes back.   I've read that the problem might be caused by an error depending on the graphics, here's my graphics card: ATI Radeon 7670M


Let $A,B$ be two matrices over a field. Suppose that $A$ commutes with every matrix $X$ which commutes with $B$. Show that $A$ is a polynomial in $B$.

There have been many questions in the vein of this one, but I can't find one that answers it specifically.     Suppose $A,B\in M_n(\mathbb C)$ are two matrices such that, for any other matrix $C\in M_n(\mathbb C)$, $$AC=CA\implies BC=CB.$$ Prove that $B=p(A)$ for a polynomial $p\in\mathbb C[t]$.    Nothing is assumed about $A$ being diagonalisable or having distinct eigenvalues or being invertible.  Edit: after further work, this might not actually be true. If it's not, a counterexample would be great.


Like someone who donates to charity not because they actually want to donate, but so that they can feel good about themselves.  Is there one specific word to describe that someone? Or is there just not one accurate word for that?

There are many examples of this, and I'd like to give a few:   A person who puts a lot of effort to help the community and earns reputation points. But that reputation is the motivation behind helping the community, not because they really want to. A student approaches a professor, and helps them in their teaching and doing research in order to have a good LOR (letter of recommendation). To a SEO, the content of the website must be good (well, this one is a little tricky, but you get the spirit.)   I'm not saying that the reputation/LOR/high-ranked is not deserved. It is. I just want to focus more on the selfish reason(s) behind that.  Any kind of answer can be accepted: single word, phrase, proverb or idiom.


I am a citizen of two different countries, and have two passports.  How should I use my passports when traveling?

I was just wondering if you have two passports (a Chinese one and an Australian one), and you booked your airline ticket with the Chinese one, will you have to show both of your passports or just one?  The thing is, on my Chinese passport, it has my birth name, but then when I became an Australian citizen, I legally removed my Chinese name and replaced it with my English name. So I don't know whether I should just show the passport officials the one that I booked the airline ticket with.


wondering if you can use a late 2013 iMac as an external monitor to a 2020 27inch iMac.i spoke to the office supplies tech guy who recommended a thunder port 2 cable but that fits in the 2013 not the 2020 which is a thunderbolt 3! Can this be done? I know there seems to be all sorts of caveats for different models. What I think I need is a cable with a thunderbolt 3 on one end and a thunderbolt 2 in the other but as they don’t seem to exist...any suggestions would be greatly appreciated!!

I have a Surface Pro 4 and an iMac (late 2019). I would like to connect my Surface Pro to the iMac to use the iMac screen as a second monitor.  Is that possible?  What are the requirements to use an iMac as a second screen?


I have installed Ubuntu 18.04 and I am trying to partition the disk, but without success. It shows an     Error unmounting /dev/sda2: target is busy (udisks-error-quark,14)   I have also installed gparted.    How should I proceed to do the partitioning?

Previously, I have installed Windows 7 on my 320 GB laptop with three partitions 173, 84 and 63 GB each. The 63 GB partition was where the Windows was installed. The rest were for file containers.  Now I changed my OS to Ubuntu 12.04 LTS. I installed Ubuntu by replacing the entire Windows 7 on the 63 GB partition. The rest of the partitions remain as an NTFS Windows partition and I can still access them both (the 173 and 84 GB partitions).  Now I want to change the two partitions of Windows into an Ubuntu format partitions plus most importantly, I want to extend the 63 GB partition to more than a 100 GB because at the moment I am running out of disk space. Whenever I try to install any application, especially using wine, it always complains for a shortage of disk space.  How do I do the extending activity before I entirely format my laptop again and lose all the important files on my partitions?


Is there a easy way to insert source code with highlight in Google Docs?

Is there way to switch on syntax highlighting in ?   Personally I use it for editing and collaborating on C++ files, but PHP or SQL syntax highlighting also would be interesting.


in my web page i've got this form:   <form style="width:100%; clear:both; margin-top:50px; background:#fff; border:1px solid green" id="upload_form" enctype="multipart/form-data" class="form" action="" method="post">     <fieldset>         <input name="somefield" style="display:none" value="">

                 Upload                 <input  type="file" name="upload" id="upload" required accept=".pdf, .doc"/>

                 Language                  <select name="language">                                  </select>

                 Category                  <select name="category">                                   </select>

                 <input style="margin-top:22px; " name="submit2" class="button" type="submit" value="Save" />

     </fieldset> </form>   As you can see there is a Files input and two dropdown. I need to pass these informations to a php file called 'upload' via Ajax.  so i write this script in Jquery:       $(document).ready(function()      {           // Form Upload         var uploadForm = $("#upload_form");         var formData = new FormData(uploadForm[0]);         // submit action         uploadForm.submit(function(e) {             e.preventDefault();              $.ajax({                 url: 'upload.php',                 data: formData,                 type: 'POST',                 contentType: false,                 processData: false,                 success: function(d) {                     alert(d);                 }             });          });              }  );    And for testing this is what there's in my upload.php file  print_r($_FILES); die(); // Testing    In the alert box i receive this output:    Array (     [upload] => Array         (             [name] =>              [type] =>              [tmp_name] =>              [error] => 4 // In the documentation the error 4 is for file not uploaded             [size] => 0         )  )   How can i submit all the form in the same Ajax Call? Is this the correct way to do it? Should i set two different ajax call?  Thanks for all the help.

I would like to upload a file asynchronously with jQuery.     $(document).ready(function () {     $("#uploadbutton").click(function () {         var filename = $("#file").val();          $.ajax({             type: "POST",             url: "addFile.do",             enctype: 'multipart/form-data',             data: {                 file: filename             },             success: function () {                 alert("Data Uploaded: ");             }         });     }); });  File <input type="file" id="file" name="file" size="10"/> <input id="uploadbutton" type="button" value="Upload"/>     Instead of the file being uploaded, I am only getting the filename. What can I do to fix this problem?


This is my root folders structure: uploads    images       img1.jpg       img2.jpg    user1    user2    other_folder  I want to ignore every folder inside uploads besides images AND ignore everything inside images. This is what I do: /uploads/* !/uploads/images /uploads/images/*  I also removed cache of uploads folder before commiting but this doesn't work properly, my images folder is not being pushed. What am I doing wrong?

How can I add an empty directory (that contains no files) to a Git repository?


The original problem is to find all rational points where $x^2 - y^2 = 1$ I know how to go about the problem, but whenever I get to the point of simplifying my equation, I keep having problems. This is what I have now:  choosing point $(-1, 0)$   So we have:  $x^2 - (m (x+1))^2 = 1$  $= x^2 (1-m^2) + 2xm^2 - m - 1 = 0 $  I need to simplify the quadratic equation where :  $a =  (1-m^2), b = 2m^2, c = -m-1 $  How can I simplify the part under the square root? Namely this part: $ \sqrt{(2m)^2 - 4 (1-m^2) (-m-1)}$  when I simplify I get this:  $- 4m^3 + 4m -4$  but that doesn't help with the square root. Can anyone point out the right direction for this?  thank you!

So, I know that we first need to have an initial point. The answers I have say it's $(-1, 0)$ which makes sense because it satisfies the equation. But for example $(1, 0)$ satisfies it too. Why did we choose $(-1, 0)$? In general, how do we go about choosing the initial point?


I'm trying to install cuda toolkit:  sudo sh cuda_10.0.130_410.48_linux.run --silent --toolkit --toolkitpath=/usr/local/cuda-10.0 Not enough space on parition mounted at /. Need 3391705088 bytes.  Disk space check has failed. Installation cannot continue.   But seems I have less free space that needed.  How can I check if have sufficient disk space?  df -h show me:   Filesystem                            Size  Used Avail Use% Mounted on udev                                   16G     0   16G   0% /dev tmpfs                                 3.2G  331M  2.9G  11% /run /dev/sde3                              39G   32G  4.9G  87% / tmpfs                                  16G   80K   16G   1% /dev/shm tmpfs                                 5.0M  8.0K  5.0M   1% /run/lock tmpfs                                  16G     0   16G   0% /sys/fs/cgroup /dev/sde4                             167G   99G   61G  63% /home /dev/mapper/isw_cifjedgigg_Volume1p1  1.8T  1.5T  268G  85% /data /dev/sdb1                             470G  195G  251G  44% /data/ssd cgmfs                                 100K     0  100K   0% /run/cgmanager/fs tmpfs                                 3.2G     0  3.2G   0% /run/user/1009 tmpfs                                 3.2G     0  3.2G   0% /run/user/1002   Is /dev/sde3 low on space? How to check what consume most of the space?  Update:  I'm more looking toward CUDA related answer, because I was able to install several version of CUDA several times and then even deleting older versions of CUDA from /usr/local don't help, so I suspect some 'caches' after CUDA installation is still in the system.

My /boot partition is nearly full and I get a warning every time I reboot my system. I already deleted old kernel packages (linux-headers...), actually I did that to install a newer kernel version that came with the automatic updates.  After installing that new version, the partition is nearly full again. So what else can I delete? Are there some other files associated to the old kernel images?  Here is a list of files that are on my /boot partition:  :~$ ls /boot/ abi-2.6.31-21-generic         lost+found abi-2.6.32-25-generic         memtest86+.bin abi-2.6.38-10-generic         memtest86+_multiboot.bin abi-2.6.38-11-generic         System.map-2.6.31-21-generic abi-2.6.38-12-generic         System.map-2.6.32-25-generic abi-2.6.38-8-generic          System.map-2.6.38-10-generic abi-3.0.0-12-generic          System.map-2.6.38-11-generic abi-3.0.0-13-generic          System.map-2.6.38-12-generic abi-3.0.0-14-generic          System.map-2.6.38-8-generic boot                          System.map-3.0.0-12-generic config-2.6.31-21-generic      System.map-3.0.0-13-generic config-2.6.32-25-generic      System.map-3.0.0-14-generic config-2.6.38-10-generic      vmcoreinfo-2.6.31-21-generic config-2.6.38-11-generic      vmcoreinfo-2.6.32-25-generic config-2.6.38-12-generic      vmcoreinfo-2.6.38-10-generic config-2.6.38-8-generic       vmcoreinfo-2.6.38-11-generic config-3.0.0-12-generic       vmcoreinfo-2.6.38-12-generic config-3.0.0-13-generic       vmcoreinfo-2.6.38-8-generic config-3.0.0-14-generic       vmcoreinfo-3.0.0-12-generic extlinux                      vmcoreinfo-3.0.0-13-generic grub                          vmcoreinfo-3.0.0-14-generic initrd.img-2.6.31-21-generic  vmlinuz-2.6.31-21-generic initrd.img-2.6.32-25-generic  vmlinuz-2.6.32-25-generic initrd.img-2.6.38-10-generic  vmlinuz-2.6.38-10-generic initrd.img-2.6.38-11-generic  vmlinuz-2.6.38-11-generic initrd.img-2.6.38-12-generic  vmlinuz-2.6.38-12-generic initrd.img-2.6.38-8-generic   vmlinuz-2.6.38-8-generic initrd.img-3.0.0-12-generic   vmlinuz-3.0.0-12-generic initrd.img-3.0.0-13-generic   vmlinuz-3.0.0-13-generic initrd.img-3.0.0-14-generic   vmlinuz-3.0.0-14-generic   Currently, I'm using the 3.0.0-14-generic kernel.


So in the early days of Nuclear fission, there was a concern about the resulting energy igniting the atmosphere in a ball of fire and world-wide death which is awesome terrifying awesomely terrifying. This of course did not happen, and I'm led to believe that these concerns ran along the same vein as concerns raised about the LHC creating a black-hole that would consume the earth (read; sensationalist media fueled, the scientific community at large had no reason to believe this would actually happen).  To my understanding, fusion reactions generate orders of magnitude more energy than fission reactions. It's fairly obvious that hydrogen fusion is self-sustaining in the right environment (see exhibit A - The Sun), and elements up to iron release energy when fusing, so that includes most of our atmosphere. What reason is there to believe that successful achieving fusion in the confines of our atmosphere would not, y'know, set it on fire?

I happened to hear people saying that the nuclear fusion bomb tests could set the atmosphere on fire. I have some serious doubts about that - but I have no facts. Nuclear fusion reaction requires $15*10^{6}$ kelvins to start. If we produce such temperature in "open air" would the atmosphere become a fuel for further fusion? Shouldn't the whole thing just be torn apart by its terrible pressure?


System info  $ lsb_release -a No LSB modules are available. Distributor ID: Ubuntu Description:    Ubuntu 18.04.3 LTS Release:    18.04 Codename:   bionic   Tried building    after i  run   sudo apt-get build-dep kdeconnect   i get   Reading package lists... Done Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  builddeps:kdeconnect : Depends: libqca2-plugin-ossl but it is not installable E: Unable to correct problems, you have held broken packages.   Tried installing from         All the mentioned unable to launch kde connect indicator or kde connect  Please guide

There are now errors when updating and I cannot install most software due to a corrupted  /etc/apt/sources.list   file. Is there a copy I can download to replace it?  The file would be for Ubuntu 12.04 (Final Beta) in the United States.


I'm stuck in the black tty1 login screen.  I think I know why. I use MATE but wanted to try cinnamon, installed it, wasn't satisfied so I removed it again via  sudo apt remove cinnamon-desktop-environment lightdm   I guess I shouldn't have included light dm. I just replaced install with remove in the code I used to install cinnamon and didn't think it through.  The issue is that in tty1 I can't get past the login because I am not given enough time to put in my password correctly. I put my username and then it almost immediately jumps to "login incorrect" after I hit enter and try to actually put in my password.  I have already tried  Ctrl+Alt+F1 all the way through F7, but no success.  I have also tried booting with a different kernel version from the advanced options. I only have 4.15.0-45 and 4.15.0-44 available and neither worked.  Edit: this keeps getting marked as a duplicate of this post:  But like I've stated above, I have already tried using a different kernel from the advanced options menu to no avail. The other answer requires command lines, but how can I type those before being able to log in?

I upgraded from 16.04 to 18.04. When I press Ctrl+Alt+F3 I get the terminal which prompts for the username. When I type my username and press Enter, it doesn't wait for my password (its as if I pressed Enter without entering anything). Even if I enter something, the text shown in plaintext and then it keeps on saying my password is wrong. After few times, the screen is cleared and it prompts for my username again and the same loop goes on.


Prove that if $f,g:\mathbb{R}\to \mathbb{R}$ are periodic and $\lim_{x\to \infty}[f(x)-g(x)]=0$,   then $f=g$   My attempt  Let $T_1$, $T_2>0$ be periods of $f$ and $g$ repectively.  If $T_1/T_2 \in \mathbb{Q}$, the conclusion is trivial.  If $T_1/T_2 \in  \mathbb{R} \setminus\mathbb{Q}$, WLOG we assume that $T_2=1$.  Put $A_n=\{x:|f(x)-g(x)|>\frac{1}{n}\}$. Then $\bigcup_{k=1}^\infty A_k=\{x:f(x)-g(x)\ne0\}$.  I want to show that $\{x:f(x)-g(x)\ne0\}$ is uncountable so that there exists $k\in \mathbb{N}$ such that $A_k$ is uncountable and hence the contradiction is deduced.  But I got stuck on that. Maybe it relates to the property of $\{n\alpha\}$. Any hints? Thanks in advance!

If $f(x)$ and $g(x)$ are two periodic functions, that is, $f(x+T_1)=f(x)$ and $g(x+T_2)=g(x)$ for every $x \in \Bbb R$. Now that $\displaystyle\lim_{x\to\infty}(f(x)-g(x))=0$.  Conjecture: $f(x) \equiv g(x)$.


How can I produce something like that    into a PDF using TikZ? (Note: It does not need colors or shadows, a simple square would be fine)  I remember there was an arara-methode, which produces the single pics for the animated gif.   % arara: pdflatex % #arara:  I DON'T KNOW  \documentclass[border=5pt]{standalone} \usepackage{amsmath} \usepackage{tikz} \usetikzlibrary{animate}  \begin{document}  \begin{tikzpicture}[]  %I DON'T KNOW \end{tikzpicture}  \end{document}

Is there any way to include an animated GIF directly in either PDFLaTeX or XeLaTeX? I realize the animate package can include animations in a PDF, but it doesn't support animated GIFs and you have to split them up manually into EPS or PNG files as far as I can tell.


It is well known that the set $\mathcal{D}_n(\mathbb{C})$ of all complex, diagonalizable, $n \times n$ matrices is dense in $\mathcal{M}_n(\mathbb{C})$, the set of all complex $n \times n$ matrices. And that two diagonalizable matrices which commute are simultaneously diagonalizable.   The exercise, which I am having difficulty to solve, is the following.   Let $A,B \in \mathcal{M}_n(\mathbb{C})$. Suppose $AB = BA$ and let $\varepsilon >0$. Show that there exists two simultaneously diagonalizable complex, $n \times n $ matrices, $C$ and $D$ such that $\| A - C \| \leq \varepsilon $ and $\| B - D \| \leq \varepsilon$.   I have managed to find a solution when $A$ (or $B$) is diagonalizable... But I really cannot find the answer in the general case.   Anyone able to help me out ?

Suppose the matrices $A$ and $B$ commute. Do there exists sequences $A_n$ and $B_n$ of matrices such that   $A_n \rightarrow A$, $B_n \rightarrow B$.  Each $A_n$ is diagonalizable  and the same for each $B_n$.  For every $n$, $A_n$ commutes with $B_n$.    Moreover, it would be nice if the following property was additionally satisfied: if $A,B$ are real, then $A_n,B_n$ can be chosen to be real as well.


What do the following two notations mean:  $$A \models$$   $$A \vdash$$   The first one would be saying that A is a contradiction? The second one that A is not a theorem? That doesn't sound right to me.

Consider A $\Rightarrow$ B, A $\models$ B, and A $\vdash$ B.  What are some examples contrasting their proper use? For example, give A and B such that A $\models$ B is true but A $\Rightarrow$ B is false. I'd appreciate pointers to any tutorial-level discussion that contrasts these operators.  Edit: What I took away from this discussion and the others linked is that logicians make a distinction between $\vdash$ and $\models$, but non-logicians tend to use $\Rightarrow$ for both relations plus a few others. Points go to Trevor for being the first to explain the relevance of completeness and soundness.


We know that $-1\le \cos x\le1$ so we if we multiply 3 so we get $-3\le 3\cos x\le 3$ and we also know that $-1\le \sin x\le 1$ and and again we multiply 4 we get $-4\le 4\sin x\le 4$ and we can add these two inequality we get $-7\le 3\cos x - 4\sin x\le 7$ but how in the above inequality is forming i m not able to understand at all.

$$|a\sin x+b \cos x|\leq \sqrt{a^2+b^2}$$   I have tried: $$|a\sin x+b \cos x|\leq |a+b|\leq \sqrt{a^2+b^2}$$  enough to prove: $$|a+b|\leq \sqrt{a^2+b^2}$$  But I can find how to continue from here


In a tennis league, consisting of 32 players, each player played with each other at least twice and at maximum Q times. Knowing that each of them participated in a different number of games, can you determine the minimum Q for which the above condition can be met?  What I have done so far: All possible pairs of 32 players are 32!/2!30!=496. Given that each pair is taken from 2 to Q times, the total number T of games is from 2*496 to Q*496 (but I am not sure this is correct). Furthermore, each player played a different number of games, thus we are asking for a series of different numbers that sum up to 2T (because in each game we have two players that participate). The minimum number of the above series must be 32*2 (because each player played with each other at least twice)?

32 people were invited at a party and started exchanging handshakes. Because of the confusion, each of them shook hands with each other multiple times: at least twice and up to X times. However, every two people exchanged different number of handshakes from every other two. What is the minimum possible number X, so that the above condition is met?


May I ask what does the 1/2 means in this formula for lasso. I searched formula examples for lasso and ridge. And found sometimes there is 1/2 while sometimes no.

I have a question about the elastic net penalty as implemented in glmnet in R compared to the original paper by Zou and Hastie (2005). In glmnet the penalty is listed as   $$ (1-\alpha)/2||\beta||_2^2+α||\beta||_1. $$  but in the paper it is  $$(1-\alpha)||\beta||_1 + \alpha||\beta||_2^2.  $$  Does anyone know where the factor $\frac12$ some from? (Never mind the fact that the $\alpha$'s were swapped between the two parameterisations.) In both cases the penalties are multiplied by $\lambda$, but what are the mathematical/technical arguments for not using a simple convex combination of the lasso and ridge penalties?


In Hatcher's Algebraic Topology, section $3.3$, he defines:     A local orientation of a manifold $M$ at a point $x$ is a choice of generator $\mu_x$ of the infinite cyclic group $H_n(M,M\setminus\{x\})$.   My question is why is $H_n(M, M\setminus\{x\})$ necessarily cyclic?  I can see this for $M=\mathbb{R}^n$, because by the relative homology sequence we get: $$H_n(\mathbb{R}^n,\mathbb{R}^n\setminus\{x\})\simeq H_{n-1}(\mathbb{R}^n\setminus\{x\})\simeq H_{n-1}(\mathbb{S}^{n-1})\simeq \mathbb{Z}$$ This case is easy because $\{x\}$ and $\mathbb{R}^n$ have trivial homology for $n>0$.  How am I supposed to see this in the general case?

A local homology group of some space $X$ at $x \in X$ is defined by the relative homology group $H_n(X, X - x)$. So by definition, it contains only cycles that are not entirely contained in $X - x$. So if we consider $X$ as some $2$-dimensional surface, would the local homology group at $x$ contain homology classes of loops which pass through $x$? Is this the right way to think about local homology groups?


On a Windows 10 16299.192 desktop system task manager always shows 99% usage. If I try killing the highest usage program all others suddenly show their CPU usage increasing to fill the gap, as if the CPU usage is being calculated as % of CPU cycles currently used instead of % CPU cycles available like normal.   I tried editing a registry key to allow me to disable the processor idle state (as has worked in the past) but no change even after a reboot.  Process Explorer does show the correct CPU usage numbers, with System Idle Process filling in the remainder of (100% - Current Usage) like normal.  Intel i3-4170 CPU. Let me know if there's any more information you might need.

Starting yesterday, I have a very odd problem on my Windows 10 desktop-- my CPU is constantly running at 100% (according to Task Manager), and it isn't throttling down. Because of this, it's constantly running at 3.3 GHz and the temperatures are rising to the point where the fans kick in at full force. If I go into the Windows power settings screen and manually change the processor power maximum to 50%, then it's capped at 50% frequency (~1.5 GHz), but it never goes below the maximum possible frequency.  The weird thing is, when I look at the process list, there isn't really anything obvious that's triggering it. None of the processes are abnormal, and though the process CPU percentages do add up to 100%, it doesn't make sense to me that each individual process is taking up as much CPU as Task Manager says it is. Everything seems to be "using" a significantly higher amount of CPU resources than it normally does.  As an attempt to diagnose the problem, I've also tried using Process Explorer. The really weird thing is that Process Explorer shows only 1-2% usage when idle, with the System Idle Process taking up the remaining ~98% as I would expect. Again, nothing looks out of the ordinary in the process list, but the processes are showing the levels of activity I would expect in Process Explorer.  I've already run both Windows Defender and Malware Bytes (a virus was my first guess), but nothing has turned up yet.  This same issue also occurs in Safe Mode, so I'm guessing that it's more along the lines of something to do with Windows itself...  So, to recap:   Windows 10 Desktop Intel 970, 3.3 GHz, 6 cores Task manager and resource monitor graphs shows 100% usage total No individual process is taking up significant resources in the resource monitor list CPU is not throttling down automatically based on the dynamic load, causing high temperatures and the fan to kick in Process Explorer is only showing 1-2% CPU usage   Before I go uninstalling everything, how would I figure out what's causing the issue if nothing weird is showing up in Task Manager or Process Explorer?


My laptop has an m.2 slot which is PCIe gen 3×2 nvme SSD compatible. Now, Can I add a PCIe gen 3×4 nvme SSD On it? If yes then how much performance I will have to sacrifice? Both slot and SSD are 2280 in length.

i'm about to get a new SSD for my PC, and before spending the money i have some doubts about my decision i would like to clarify First, my mobo is a B450 Aorus Pro Wifi, it has 2 M.2 slots, one of them full length (22110) compatible with PCIe 3.0 x4 and the other one standard length (2280) and support only for PCIe 3.0 x2 About the drive, i'm aiming for a 1tb XPG SX8200 Pro , which is a PCIe 3.0x4 SSD My first M.2 slot is already taken by the main SSD, which i use for the OS and other stuff, i can't really use it. Will a PCIe x4 SSD work on a PCIe x2 slot? How much performance will be lost if it does? Will it be worth it?


Let $V$ be the vector space of all $n\times n$ matrices over $F$. Let $T$ be the linear operator on $V$ defined by $T(A)=A^t$. Test T for diagonalizability, and if $T$ is diagonalizable, find a basis for $V$ such that the matrix representation of T is diagonal.  My attempt: if c is the eigenvalue of $T$, $T(A)=cA$, $A^t=cA$ $\implies$ $(A^t)^t=(cA)^t$ $\implies$ $A=cA^t$ $\implies$ $A^t=cA=c(cA^t)=c^2A^t$ $\implies$ $A=c^2A$ $\implies$ $c^2=1$ $\implies$ $c=1,-1$.  So $A^t=A$ or $A^t=-A$, if $A^t=A$, then $A$ is a symmetric matrix, for example, a $3\times 3$ matrix:$\begin{bmatrix}0&1&0\\1&0&0\\0&0&0\end{bmatrix}$ satisfies $A^t=A$.  if $A^t=-A$, for example:$\begin{bmatrix}0&1&0\\-1&0&0\\0&0&0\end{bmatrix}$ satisfies $A^t=-A$.  But how do I find a basis? I guess that the answer is that it is diagonalizable.

Let $T \colon \mathbb{M}_{n\times n}(\mathbb{R}) \to \mathbb{M}_{n\times n}(\mathbb{R})$ the linear operator such that $T(M)=M^t$, where $M^t$ is the transpose of the matrix $M$. Prove that $T$ is diagonalizable.   I thought I'd follow the path that $T^3=T$ but I have not resolved the problem.


Why Littlefinger bothered to kill Jon Arryn and assassinate Bran Stark?  Jon Arryn have already known too much about Lannisters' incest, so I would expect that he will be killed by Lannisters or someone else for sure.  Also why bother to kill Bran Stark and frame Lannisters when Lannisters would already have motive to kill Bran Stark and silence him for good? Wasn't Littlefinger's plot wasted to do it all by himself when it could be resolved in a way he wanted without his involvement anyway?

Up until near the end of season four we're led to believe Cersei or Jaime had Jon Arryn — previous Hand of the King — murdered to cover up Cersei's offspring being the product of incest, yet in the episode First of His Name      Lysa Arryn admits to poisoning Jon (her then husband) after being prodded to do so by Petyr Baelish, aka Littlefinger.   The prodder always has a reason for doing something even if it's rarely obvious. What purpose was served by killing Jon Arryn?


We're hosting 10 websites with (most of them using Drupal 6 or Drupal 7) using nginx + php-fpm. Our VPS is low end (only 1GB of RAM with 64 bit OS and limited CPU). The amount of visitors is moderate to low, but simultaneous traffic in many of them is enough to get timeouts.  1) Is it correct to use php-fpm in this scenario, or it would be better to go back to Apache and mod_php?  2) Is it better to keep a fpm pool for each site, or in this extreme condition using one pool for many sites would make any difference? (Security issues aside)  3) Is there a formula for calculating the best values for pm.max_children, pm.start_servers, pm.min_spare_servers, pm.max_spare_servers and APC settings (enabled using default settings under Ubuntu 12.04 LTS)?  In general, any recommendations about running php-fpm with low resources would be greatly appreciated.

This is a  about capacity planning for web sites. Related:      What are some recommended tools and methods of capacity planning for web sites and web-applications? Please feel free to describe different tools and techniques for different web-servers, frameworks, etc., as well as best-practices that apply to web servers in general.


Been trying to get the encryption to perform the operation and store the value for each of the 4 variables, and then print each of these 4 separate variables. Where am I going wrong? encrypt only wants to work on one of the calculations.  int main(void) {    int a, b, c, d, encrypt;    printf("Enter integer 1:\n");   scanf("%d", &a);   printf("Enter integer 2:\n");   scanf("%d", &b);   printf("Enter integer 3:\n");   scanf("%d", &c);   printf("Enter integer 4:\n");   scanf("%d", &d);    encrypt = (a += 7) % 10, (b +=7) % 10, (c +=7) % 10, (d +=7) % 10;    printf("The encrypted value is: %d%d%d%d\n", encrypt);   //scanf("%d", &encrypt);    return 0; }


I am new to programming and i am trying the c logic to implement in Perl for the array duplicate removal. But i am not getting required output.Can some please give pointer where did i go wrong. #!/usr/bin/perl -w  @x = (2,2,3,1); $n = 3; for ($i=0;$i<$n;$i++) {     for ($j=$i+1;$j<$n;$j++) {         if ($x[$i]=$x[$j]) {             for ($k=$j;$k<$n;$k++)             {                 print " pip";                 $x[$k] = $x[$k+1];                 print "k = $x[$k] ,j = $x[$j]\n";                 $n--;             }         } else {             $j++;         }     } } print @x;

I have an array in Perl:  my @my_array = ("one","two","three","two","three");   How do I remove the duplicates from the array?


Can anyone see any errors in this code? I've checked to make sure the data has been written to the database. Every time I click the button it gives me the "Incorrect Password" text. It's probably something stupid that I'm overlooking. Any help is appreciated.  public void buttonWork() {     button_credCheck.setOnClickListener(new View.OnClickListener() {         String rpq = regPwdQuery().toString();         String passInputStr = editText_pwdInput.getText().toString();          @Override         public void onClick(View v) {             if (passInputStr == rpq) {                 Intent myIntent = new Intent(LogInActivity.this, FindInfoActivity.class);                 startActivity(myIntent);              } else {                 Toast.makeText(LogInActivity.this, "Incorrect Password", Toast.LENGTH_LONG).show();             }         }     }); }   EDIT: This is not a duplicate of the referenced question because changing == to equals() did not fix my problem.  EDIT 2: Thought maybe I should Include the cursor class for regPwdQuery   public Cursor regPwdQuery() {         String regPwdData = editText_pwdInput.getText().toString();         String regQuery = "SELECT * FROM UsrPass_table WHERE Pwrd ='" +   regPwdData + "'";         SQLiteDatabase uDB = usrDB.getReadableDatabase();         Cursor result = uDB.rawQuery(regQuery, null);         return result;

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


I've noticed the implementation of std::reference_wrapper in C++11, however, I'm wondering why I should use the std::reference_wrapper instead of a "raw" reference variable. I've understood that a reference wrapper is an object that can be copied and whatever, but still, why should I use it instead of a reference? What's the point of this feature? Let's consider the following pseudo-code class A;  A myA{};  A& refMyA = &a; std::reference_wrapper<A> refWMyA = std::ref(A);   void foo (const A& aRef) {// do stuff}  void bar (const std::reference_wrapper<A> aRef) {// do stuff}  Why should I prefer bar rather than foo?

recently I've been reading through Scott Meyers's excellent  book. In one of the last tips he covered some of the features from TR1 - I knew many of them via Boost.   However, there was one that I definitely did NOT recognize: tr1::reference_wrapper.   How and when would I use tr1::reference_wrapper?


I am trying to convert a string to an integer but in case it's not possible.  I want that integer variable to have a null value but I keep on getting a null pointer exception when the string is unconvertable while I need it in such case to catch the exception and handle it the way i want which is to put null in the integer variable.  This is my code:  String numt=request.getParameter("telephoneClient"); Integer tel; try{     tel=Integer.parseInt(numt); } catch(NullPointerException ex1) {     tel=null; } catch (NumberFormatException ex2)  {     tel=null; } catch(Exception ex) {     tel=null; }

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?


So I am running Ubuntu Studio on my laptop and what do I do to connect to a proxy? I search for proxy and in network settings their is no PROXY tab. What are key words in the tabs to look for?

I cannot find the proxy settings anywhere. Do I have to set it through terminal, through gconftools or is there some GUI present for it?


Fatal error: Allowed memory size of 268435456 bytes exhausted (tried to allocate 8192 bytes) in /home/---/domains/---/public_html/---/system/storage/cache/e0/e04e1f01ecc413b48d48f7d0acd02b41afe20667628afe21e97945b89e1c590a.php on line 51   I have this error, when I load this in controller/common/header.php:  $this->load->controller("account/login");   My php.ini:  magic_quotes_gpc = Off register_globals = Off default_charset = UTF-8 memory_limit = 64M max_execution_time = 36000 upload_max_filesize = 999M post_max_size=999M safe_mode = Off mysql.connect_timeout = 20 session.auto_start = Off session.use_only_cookies = On session.use_cookies = On session.use_trans_sid = Off session.cookie_httponly = On session.gc_maxlifetime = 3600 allow_url_fopen = On ;display_errors = 1 ;error_reporting = E_ALL

I have a bunch of client point of sale (POS) systems that periodically send new sales data to one centralized database, which stores the data into one big database for report generation.  The client POS is based on PHPPOS, and I have implemented a module that uses the standard XML-RPC library to send sales data to the service. The server system is built on CodeIgniter, and uses the XML-RPC and XML-RPCS libraries for the webservice component. Whenever I send a lot of sales data (as little as 50 rows from the sales table, and individual rows from sales_items pertaining to each item within the sale) I get the following error:  Fatal error: Allowed memory size of 134217728 bytes exhausted (tried to allocate 54 bytes)   128M is the default value in php.ini, but I assume that is a huge number to break. In fact, I have even tried setting this value to 1024M, and all it does is take a longer time to error out.  As for steps I've taken, I've tried disabling all processing on the server-side, and have rigged it to return a canned response regardless of the input. However, I believe the problem lies in the actual sending of the data. I've even tried disabling the maximum script execution time for PHP, and it still errors out.


My computer has been infested with a redirect a string in 100s of files. Using file locator string search shows many many directories with files in various path. I intend to move these invested files - using copy-all inside the search result window -  to an empty external hard disk with the full structure intact, except the drive letter. If after this process the computer screams "file not found / missing" I know where to look and eliminate the redirect part - I hope, then place the cleaned file to the needed location on C: . At a later date I intend to erase the external data. The following information should help to avoid duplication of ideas what else to do, I did: Browser: Clear cache, history. Install No Redirect extension to FF 83.0. Add cybercriminal's internet address to Win10 HOSTS. TOOLS: CCleaner, Search & Destroy (not used $$$), Malwarebytes, MS Defender. SYSTEM: sfc /verifyonly , Dism /Online /Cleanup-Image /CheckHealth , Dism /Online /Cleanup-Image /ScanHealth , DISM /Online /Cleanup-Image /RestoreHealth (error free)

What should I do if my Windows computer seems to be infected with a virus or malware?  What are the symptoms of an infection? What should I do after noticing an infection? What can I do to get rid of it? how to prevent from infection by malware?   This question comes up frequently, and the suggested solutions are usually the same. This community wiki is an attempt to serve as the definitive, most comprehensive answer possible. Feel free to add your contributions via edits.


Somehow a file named -]???????q got created on my terminal. I tried  rm -f "-]???????q"  (in double quotes), but it did not get deleted. (Error::  rm: invalid option -- ]).  How do I delete it?

I wrote a program that uses POSIX memory-mapping function (mmap)  The program takes a file (a.dat) and memory-maps it for reading/writing.  Due to errors in the program, every time I run the program a file with some weird names (e.g., ?d?P?^z??d?P?^z?) is created. The error is resolved but I am not able to delete the files.  I am not able to delete it either using command line or by select/deleting from window manager.  So how should I delete it? I'm using Ubuntu 11.04.


I'm currently tutor in an undergraduate course and the students are asked to find how addition and multiplication behave on the field with 4 elements: $\{0,1,x,y\}$. In the solution the teacher gave me, he uses the fact that $(\mathbb{F}_4^*, \cdot )$ is cyclic with order 3 to find that $x$ and $y$ are both generators and that $(\mathbb{F}_4,+)$ is a group of order 4 to deduce that $0=1+1+1+1=(1+1)(1+1)$ and hence, $(1+1)=0$ since a field is integral.   However, I'm not satisfied with this reasoning because this question is asked to student in first year and they juste have been introduced to fields (and this was part of an analysis course so they won't see any result soon). So I tried to find how it behaves by myself, using as few results as possible.  Multiplication is the easy part, $0\cdot a$ and $1 \cdot a$ is trivial for all $a\in \mathbb{F}_4$. Then, $x\cdot y\not = 0$ because it is invertible, and it can't be equal to $x$ or $y$ because that would imply the other element to be equal to $1$. Hence, $x\cdot y=1$. We are left to find what is $x^2$ (and similarly, $y^2$). $x^2$ cannot be $0$, nor $x$. If $x^2=1$, then $y=(x^2)y=x(xy)=x\cdot 1=x$. Contradiction. Hence $x^2=y$ and by the same reasoning, we have $y^2=x$.  It was easy with the multiplication, but I can't figure out any non-trivial result concerning addition. My intuition tells me that distributivity should be used here but I'm feeling like it's just converting a problem into another one because we don't know anything about addition.  Does anyone here have an idea of how addition can be "found" without using any advanced result (or as few results as possible)?  Thanks in advance.

Can you construct a field with 4 elements? can you help me think of any examples?


Our endpoint is an https request.       |CALLOUT_REQUEST|[217]|System.HttpRequest[Endpoint=https:[intentionally left off]   The logs show:     |EXCEPTION_THROWN|[217]|System.CalloutException: Read timed out   We have already tested the https request externally from Salesforce and determined that 21/24 requests will fail with a timeout of 10 seconds.  As the time taken varies from 10 seconds to 18 seconds.  We are thinking of increasing the timeout to 20 seconds by setting a custom timeout in Apex.   The default timeout is 10 seconds as I understand it.    Would this work?

I want to call out my web service after the insert process of a custom object with a delay of 2 minutes. But i am getting that exception FATAL_ERROR|System.CalloutException: Read timed out How can i fix that problem ? Here is my implementation.  Callout class:  public class HttpCallout{     @Future(callout=true)     public static void getContent(String url){         Http h = new Http();          HttpRequest req = new HttpRequest();         req.setEndpoint(url);         req.setMethod('GET');         req.setTimeout(2000);          HttpResponse res = h.send(req);         String response = EncodingUtil.urlDecode(res.getBody(),'UTF-8');         System.debug('***response****'+response);     }      public void serviceCaller(){         getContent(url);     } }   Trigger:  trigger AfterInsertOrUpdate on Sales_Order__c (after insert) {     System.debug('Making future call to update account');     HttpCallout httpCallout = new HttpCallout();     httpCallout.serviceCaller();     System.debug('After Insert'); }   Any help would be appriciated.


I have always this question in mind, what are the perfect scenarios to create custom entity rather than using existing Drupal's entities ?

What is the benefit to creating new entity types over just building a new content type?    It seems a bit overkill to do all of the custom coding that is required to create a new entity when you have all of the CRUD and Views functionality already built into content types.


Let $f: X \longrightarrow{Y}$ a continuous surjective and closed function between topological spaces such that $f^{-1}(y)$ it is compact for all $y \in Y$. Prove that $Y$ is compact if and only if $X$ is compact My attempt: If $X$ is compact then for every collection $C$ of open subsets of $X$ we have: $\displaystyle\bigcup_{x \in C}^{}{X }$ Thanks

Let $f : X \rightarrow Y$ be a perfect map: a continuous surjective closed map such that $f^{−1}(\{y\})$ is compact for all $y \in Y$ . Prove that if $Y$ is compact, then  $X$ is compact.     How to use compactness on $Y$ to show it on $X$.  Thank you for any help.


I want to extract all occurrences of a pattern in Python. Here is what i have done  import re  string="Any information
sent to the server as clear text
, may be stolen and used later for
identity theft
 or user impersonation. In addition, several privacy regulations state that sensitive information such as user
 credentials will always be sent encrypted
 to the web site."  regex='
.*
' # obviously it matches starting
 to the last
  if re.findall(regex, String):     print(re.findall(regex, string)) else:     print('no match found')   I want to extract all the occurance of paragraph tags. I mean the output should be a list which looks like this  ['
sent to the server as clear text
', '
identity theft
', '
 credentials will always be sent encrypted
']   I've found few similar questions but not serving the purpose

I have this gigantic ugly string: J0000000: Transaction A0001401 started on 8/22/2008 9:49:29 AM J0000010: Project name: E:\foo.pf J0000011: Job name: MBiek Direct Mail Test J0000020: Document 1 - Completed successfully  I'm trying to extract pieces from it using regex. In this case, I want to grab everything after Project Name up to the part where it says J0000011: (the 11 is going to be a different number every time). Here's the regex I've been playing with: Project name:\s+(.*)\s+J[0-9]{7}:  The problem is that it doesn't stop until it hits the J0000020: at the end. How do I make the regex stop at the first occurrence of J[0-9]{7}?


I bought the  without operating system and I am trying to install Ubuntu 16.04. Everything is working so far, except the WIFI is not. The strange thing is, that the internet is working when I plug in a LAN cable.  I think a wireless driver must be missing, but I can't figure out, which one I have to install. At the website of Lenovo it says that the Laptop should have the wireless adapter "Intel Dual Band Wireless 3165 AC". But I cant find that one.  $ lspci -nnk | grep -i net -A2 03:00.0 Ethernet controller [0200]: Realtek Semiconductor Co., Ltd. RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller [10ec:8168] (rev 10)     Subsystem: Lenovo RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller [17aa:5068]     Kernel driver in use: r8169     Kernel modules: r816  $ sudo lshw -class network   *-network       description: Ethernet interface        product: RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller        vendor: Realtek Semiconductor Co., Ltd.        physical id: 0        bus info: pci@0000:03:00.0        logical name: enp3s0        version: 10        serial: 8c:16:45:00:99:5e        size: 10Mbit/s        capacity: 1Gbit/s        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress msix vpd bus_master cap_list ethernet physical tp mii 10bt 10bt-fd 100bt 100bt-fd 1000bt 1000bt-fd autonegotiation        configuration: autonegotiation=on broadcast=yes driver=r8169 driverversion=2.3LK-NAPI duplex=half firmware=rtl8168g-3_0.0.1 04/23/13 latency=0 link=no multicast=yes port=MII speed=10Mbit/s        resources: irq:128 ioport:c000(size=256) memory:f2304000-f2304fff memory:f2300000-f2303fff  $ lsusb Bus 002 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub Bus 001 Device 005: ID 06cb:00a2 Synaptics, Inc.  Bus 001 Device 004: ID 5986:2113 Acer, Inc  Bus 001 Device 006: ID 0bda:b023 Realtek Semiconductor Corp.  Bus 001 Device 002: ID 0e8f:00a7 GreenAsia Inc.  Bus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub  $ rfkill list all 0: tpacpi_bluetooth_sw: Bluetooth     Soft blocked: no     Hard blocked: no 1: hci0: Bluetooth     Soft blocked: no     Hard blocked: no  $ dmesg | grep -i firmware [    0.169227] ACPI: [Firmware Bug]: BIOS _OSI(Linux) query ignored [    1.612093] i915 0000:00:02.0: Direct firmware load for i915/kbl_dmc_ver1_01.bin failed with error -2 [    1.612095] i915 0000:00:02.0: Failed to load DMC firmware [https://01.org/linuxgraphics/downloads/firmware], disabling runtime power management. [    1.957908] [drm] Found UVD firmware Version: 1.79 Family ID: 16 [    1.958925] [drm] Found VCE firmware Version: 52.4 Binary ID: 3 [    3.777769] bluetooth hci0: Direct firmware load for rtl_bt/rtl8822b_config.bin failed with error -2 [    3.777777] bluetooth hci0: Direct firmware load for rtl_bt/rtl8822b_fw.bin failed with error -2 [    3.778662] bluetooth hci0: Direct firmware load for rtl_bt/rtl8822b_config.bin failed with error -2 [    3.778668] bluetooth hci0: Direct firmware load for rtl_bt/rtl8822b_fw.bin failed with error -2 [    7.428180] psmouse serio2: trackpoint: IBM TrackPoint firmware: 0x10, buttons: 3/3

Recently, I bought a Lenovo T470 with preinstalled Windows 10. I install Ubuntu 16.04 in parallel by USB boot. Wifi connections are not displayed as in many other posts.  My home directory is encrypted, in case it is relevant.  After checking, there no Wifi / network device available.  lspci -n -d 14e4   ( no response )  iwconfig enp0s31f6  no wireless extensions. lo         no wireless extensions.   Neither is any wireless driver displayed in settings.  I suspect that Ubuntu cannot recognize my wireless device. Is there any suggestion / more information needed to solve the problem?  Update 1 : After Pilot6's comment, I check again and there is still no response.   lspci -knn | grep Net -A2   Update 2 :  lspci 00:00.0 Host bridge: Intel Corporation Device 5904 (rev 02) 00:02.0 VGA compatible controller: Intel Corporation Device 5916 (rev 02) 00:14.0 USB controller: Intel Corporation Sunrise Point-LP USB 3.0 xHCI Controller (rev 21) 00:14.2 Signal processing controller: Intel Corporation Sunrise Point-LP Thermal subsystem (rev 21) 00:16.0 Communication controller: Intel Corporation Sunrise Point-LP CSME HECI (rev 21) 00:1c.0 PCI bridge: Intel Corporation Device 9d10 (rev f1) 00:1c.6 PCI bridge: Intel Corporation Device 9d16 (rev f1) 00:1d.0 PCI bridge: Intel Corporation Device 9d18 (rev f1) 00:1d.2 PCI bridge: Intel Corporation Device 9d1a (rev f1) 00:1f.0 ISA bridge: Intel Corporation Device 9d58 (rev 21) 00:1f.2 Memory controller: Intel Corporation Sunrise Point-LP PMC (rev 21) 00:1f.3 Audio device: Intel Corporation Device 9d71 (rev 21) 00:1f.4 SMBus: Intel Corporation Sunrise Point-LP SMBus (rev 21) 00:1f.6 Ethernet controller: Intel Corporation Ethernet Connection (4) I219-V (rev 21) 04:00.0 Unassigned class [ff00]: Realtek Semiconductor Co., Ltd. Device b822 3e:00.0 Non-Volatile memory controller: Toshiba America Info Systems Device 0115 (rev 01)  lsusb Bus 002 Device 002: ID 0bda:0316 Realtek Semiconductor Corp.  Bus 002 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub Bus 001 Device 004: ID 04f2:b5ab Chicony Electronics Co., Ltd  Bus 001 Device 003: ID 0bda:b023 Realtek Semiconductor Corp.  Bus 001 Device 002: ID 058f:9540 Alcor Micro Corp. AU9540 Smartcard Reader Bus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub   Update 3 : More information provided after asking on LaunchPad  sudo lshw -C network   *-network        description: Ethernet interface        product: Ethernet Connection (4) I219-V        vendor: Intel Corporation        physical id: 1f.6        bus info: pci@0000:00:1f.6        logical name: enp0s31f6        version: 21        serial: 54:e1:ad:1f:de:57        capacity: 1Gbit/s        width: 32 bits        clock: 33MHz        capabilities: pm msi bus_master cap_list ethernet physical tp 10bt 10bt-fd 100bt 100bt-fd 1000bt-fd autonegotiation        configuration: autonegotiation=on broadcast=yes driver=e1000e driverversion=3.2.6-k firmware=0.1-4 latency=0 link=no multicast=yes port=twisted pair        resources: irq:122 memory:ec200000-ec21ffff  lsb_release -a No LSB modules are available. Distributor ID: Ubuntu Description:    Ubuntu 16.04.2 LTS Release:        16.04 Codename:       xenial  uname -a Linux simon-ThinkPad-T470 4.8.0-36-generic #36~16.04.1-Ubuntu SMP Sun Feb 5 09:39:57 UTC 2017 x86_64 x86_64 x86_64 GNU/Linux  rfkill list 0: hci0: Bluetooth         Soft blocked: no         Hard blocked: no 1: tpacpi_bluetooth_sw: Bluetooth         Soft blocked: no         Hard blocked: no


I was given an iPad Air (model A1474) which seems to had a tough life. The screen and LCD matrix are broken and I would like to know if it is still alive before replacing these broken parts.  How should I proceed? I connected the iPad to a PC with iTunes via USB connection but got no response.  Is there any other way to tell if the iPad is salvageable and can be repaired?

I left my phone on the roof of my car and drove away on a busy road.  It was hit several times and the screen is broken/shattered and glass comes off of it.  It receives calls/text messages, and the button on the top to turn on/off still works.  The screen is just in such bad shape that it won't register the touch of my finger.  I have an appt with Genius bar in a few hours to get a new phone.  I want to save all my pictures and apps off this phone if possible (I never backed up on the computer prior to this) but it prompts me to unlock my phone and I can't do it.  I can't use another iPhone as a guide, because it won't even recognize my finger touching the screen, but the phone still works.  Can I get some ideas on how to back it up?  I am not tech savvy and this is a difficult problem!


I'm trying to update the "price" field in a product div.  I've managed to sort out the increments, so the price now changes.  However, It doesn't stay in it's format - it returns bad prices, such as: £1.5 as opposed to £1.50 £0.39999999999999996 as opposed to £0.40, etc - I just want it to add the price of a product (£0.50) to the total price at the push of a button.  Here is my JavaScript so far:  function incrementquan'.$row["pid"].'(){ var input = document.getElementById("quan'.$row["pid"].'"); input.value = parseInt(input.value) + 1; var element = document.getElementById("price'.$row['pid'].'"); element.innerHTML = ("&pound;" + (input.value * '.$row['pprice'].'));   }  Can anyone help me out with this?  Thanks a lot.

I would like to format a price in JavaScript. I'd like a function which takes a float as an argument and returns a string formatted like this: "$ 2,500.00"  What's the best way to do this?


I'm working on a simple program that will ask for the weather and temperature and output what clothing the user should wear. However, I've gotten to the point where I want to make sure the user can't enter "g" degrees or any other string. Is there a simple way to compare variable types? In other words, is there something along the lines of:  if (type(temp) == 'str'):      print("Invalid. Try again.")   Or something similar that isn't too complicated? Personally, I'm fine with using advanced functions and whatnot, but that would look sketchy to my CS teacher.

What is the best way to check whether a given object is of a given type? How about checking whether the object inherits from a given type?  Let's say I have an object o. How do I check whether it's a str?


Consider this scenario...Sam ate 4 cookies. Now if someone asks Sam How many you had, then Sam will reply 4. But how should the question be formed so that the answer Sam gives will be 4th instead of 4?

I am the third daughter (or son) of my parents.   OR      How should a question that is answered with the above sentences be framed?


I am an absolute beginner, with little to no knowledge on the subject but I have somehow developed a strong interest in theories like String theory and M-theory, by reading about them on other forums. So can you   recommend me any farily accessible books or other materials that could help me understand these theories in-depth? Or do I have to extensively study other areas in physics before I am able to comprehend them, if so, what are those other topics?

I am in the last year of MSc. and would like to read string theory. I have the Zwiebach Book, but along with it what other advanced book can be followed, which can be a complimentary to Zwiebach. I would like a more mathematically rigorous book or lecture notes along with Zwiebach.   Specifically, mention whether the book discusses string theory   Rigorously? Intuitively?   What's the scope of the book? Does it cover the advanced materials, e.g. Matrix string theory, F-theory, string field theory, etc. Maybe even String Phenomenology?


Greetings to all here..  I'm a complete Linux virgin, so apologies if anything I'm asking is blatantly obvious.. (I have done a brief search for the issues I'm having) Please go easy on the terminology.. I've years of Windows to cleanse myself of.  How do I go about deleting files/folders permanently.. I've quite a few GB worth of old Windows files I'd like to remove, but short of moving them to the rubbish bin & then emptying it I can't see any option to permanently delete I've tried rm -r/-f but am told there is no such file or folder.  I have a Nvidia GTX 670 are Linux drivers available & easy enough to install? I've also been told that the more interesting/useful software is to be found on alternative repo's can someone educate me?  Thanks for listening.

Is there a way to make sure that a deleted file can not be recovered?   As you know, deleting a file by pressing shift-del or using trash doesn't mean that file is gone forever. It resides somewhere in the computer.  In day to day life, law enforcement or thieves use recovery programs to reveal our private data or something else.   They can recover all data that resides on hard disk, in RAM, and even USB.  To protect us from these people, what should one do? Which program should one use?  Note: I don't want an answer like first use a recovery program then erase that file with shred. With just one program, I want to erase all unused/deleted files on my computer.


In HP and the Philosopher's Stone, Harry gets an invisibility cloak as a Christmas present from Dumbledore. (His father had owned it before.)  As soon as Ron saw it, he recognised it to be as an invisibility cloak (which we later get to know is one of the deathly hallows), and he says they are incredibly rare.  Which indicates that there has been more than one IC in the Potterverse.  Is it mentioned anywhere in the books or movies about any other invisibility cloak? If yes then how do they work? And are they as effective as the one with Harry? Please give a canon answer.

I've finished reading the 4th book - Harry Potter and the Goblet of Fire and I've noticed that in Moody's trunk there is a second invisibility cloak. Or was it the second one? Are there more than one invisibility cloak in the world? If so then is it not a deathly hallow?  What am I missing? At first I was thinking that the cloak in Moody's trunk was the one belonging to Harry but it seems he had his cloak with him or did Moody not return it sometime after the after-bath scene?


Was there anything stopping Sauron from making another "one ring"? Was he too weak since his separation from the ring to craft another? Or would it have taken a long time?

Why would Sauron make himself a ring that he invested most of his power in? Wouldn't it be better to keep the power in his physical form and not risk leaving his power in a physical form that could be stolen (which did happen when Isildur took it). Because of its being in the form of a ring, its power could be abused by someone else to attack him.


I would like to calculate unique values of an iterator, but without having to build a list first. Using a list, I would do for example:  from collections import Counter from itertools import combinations  my_counts = Counter([sum(x) for x in combinations([1,2,3,4,5])],2)   But above, a list was made, and then Counter was applied. But is there a way to keep a running tally, so that the entire list does not need to stored in memory?

When should you use generator expressions and when should you use list comprehensions in Python?  # Generator expression (x*2 for x in range(256))  # List comprehension [x*2 for x in range(256)]


I know this question has been brought up ad nauseam, but I want to be sure I make the right changes to fix it. I'm pretty sure I need to change some of the settings in Software & Updates, but which ones? Or is there something else I need to resolve? Here's the terminal message that displays when I run sudo apt-get update along with the Software & Updates menu.    edit: included text.  nicholas@klaus:~$ sudo apt-get update [sudo] password for nicholas:  Hit:1 http://repo.steampowered.com/steam precise InRelease Ign:2 http://dl.google.com/linux/chrome/deb stable InRelease                    Hit:3 http://us.archive.ubuntu.com/ubuntu bionic InRelease                      Hit:4 http://security.ubuntu.com/ubuntu bionic-security InRelease               Hit:5 http://packages.microsoft.com/repos/vscode stable InRelease               Hit:6 http://dl.google.com/linux/chrome/deb stable Release                      Get:7 http://us.archive.ubuntu.com/ubuntu bionic-updates InRelease [88.7 kB]    Hit:8 https://dl.winehq.org/wine-builds/ubuntu bionic InRelease                 Ign:9 http://ppa.launchpad.net/mjblenner/ppa-hal/ubuntu bionic InRelease        Hit:10 http://repository.spotify.com stable InRelease                           Err:12 http://ppa.launchpad.net/mjblenner/ppa-hal/ubuntu bionic Release           404  Not Found [IP: 91.189.95.83 80] Reading package lists... Done                       E: The repository 'http://ppa.launchpad.net/mjblenner/ppa-hal/ubuntu bionic Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details.

When updating, I get the following error message:   W: The repository 'http://ppa.launchpad.net/mc3man/trusty-media/ubuntu xenial Release' does not have a Release file.   Here, I find another statement on this error:   This recommends removing certain PPAs; and, I'm not sure if I should do that since it might mean not getting the updates that I need.    Is this what I should do?


What sentence is correct and why:  In New York life is exciting. In New York the life is exciting.

There is an entry at the oxford dictionary that begins with       The popular image of student life is of young people with few responsibilities enjoying themselves and doing very little work   Why didn't it say     "of the student life"?  "a student life"?


I'am trying to implement a method that returns me an instance of the class, but it's is crashing when it tries to create the instance at the first time. I don't know how to implement the singleton in C++/QT  Main  #include <QCoreApplication> #include "carro.h"  int main(int argc, char *argv[]) {     QCoreApplication a(argc, argv);      Carta* nueva;     nueva->getInstance();     nueva->setColor("rojo");     cout << nueva->getColor() << endl;      return a.exec(); }   Carro.h  #ifndef CARRO_H #define CARRO_H  #include <string> #include <iostream>  using namespace std;  class Carta{  private:     string cara; //valor     string palo; //simbolo     string color;     string direccion;      static Carta* m_instance;  public:     //constructor     Carta(){     }     static Carta* getInstance(){        if(!m_instance){            m_instance = new Carta;        }        return m_instance;     }      string getDireccion(){         return direccion;     }      void setColor(string pcolor){         color = pcolor;     }      string getColor(){         return this->color;     }      string getPalo(){         return this->palo;     }      string getCara(){         return this->cara;     }      //print     string print(){         return (cara + " de " + palo + " Color: "+color);     }     };  #endif // CARRO_H

Can anyone explain why following code won't compile? At least on g++ 4.2.4.  And more interesting, why it will compile when I cast MEMBER to int?  #include <vector>  class Foo {   public:       static const int MEMBER = 1;   };  int main(){       vector<int> v;       v.push_back( Foo::MEMBER );       // undefined reference to `Foo::MEMBER'     v.push_back( (int) Foo::MEMBER ); // OK       return 0; }


For $K$ a field and $|K(\alpha):K| = 5$, why do we have $K(\alpha^2) = K(\alpha)$?

I have a question about simple field extensions.  For a field $F$, if $[F(a):F]$ is odd, then why is $F(a)=F(a^2)$?


I want to create the file to implement a I/O benchmark on linux.  Thanks in advance, Antonio

For testing purposes I have to generate a file of a certain size (to test an upload limit).    What is a command to create a file of a certain size on Linux?


I have an issue. I need to move a SharePoint external list to a custom list. After some research, I decided to use a SharePoint timer job. Not having coded in C# before all of two days ago, I immediately went looking for templates. And found two here:      I followed the steps, and have successfully created a timer job, built it, and deployed it to the dev environment. And though it does show up in the site features, it's not doing anything.  I have two main questions:   Are these the right sources to be looking at? Or is there something obviously wrong with them. What's the best way to debug a SharePoint timer job? Ultimately, I've got to be able to detect and fix these problems myself, and right now I've got no idea how to do that.

I have vs 2010, moss 2010, and I'm trying to debug a custom timer job, so I've set breakpoints on the feature receiver, but when I run the project or just right click deploy, my break points are never met.   Here is the code, as you can see its just a standard feature receiver:  public class StructureImportEventReceiver : SPFeatureReceiver {     const string List_JOB_NAME = "StructureImporter";      public override void FeatureActivated(SPFeatureReceiverProperties properties)     {         SPSite site = properties.Feature.Parent as SPSite;         // Break point is set on line above ... rest of code below     } }   I guess if I could get the debugger to stop on this breakpoint, I could step through to the rest of the timer job, but alas... nothing. What am I doing wrong?


Rather than spend hours trying to figure out if the source that I googled will work right or not, can someone tell me how I install drivers for my GTX 780?  I tried following this one  after downloading the .run file from the NVIDIA website.  But I committed a newbie sin by typing something into the terminal blindly without verifying what it does exactly.  sudo service lightdm stop   Typing that made my screen go blank with no way of doing anything except a hard reset.  Any answers appreciated for this day 2 linux noob.

I just ordered the Nvidia GTX card. I have a dilemma, though. Should I keep using the driver which is available in "additional drivers" in Ubuntu, or should I install the driver from the Nvidia site?  So which driver is the best for me?


I am new to ubuntu and I was trying to learn how to install windows software on ubuntu, but I was confused as I did not find ubuntu software center on my device. this was the message I got: Reading package lists... Done Building dependency tree Reading state information... Done Package software-center is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source E: Package 'software-center' has no installation candidate

I updated Ubuntu last night (sudo apt get update && sudo apt get upgrade) and to  my surprise this morning I didn't find the 'Ubuntu Software' app and there's a new entry called 'Snap Store' which when opened looks just like the old 'Ubuntu Software' app. So has 'Ubunu Software' been renamed to 'Snap Store'? And if yes, why?


Last week I had a job interview for Java Developer, interviewer asked me following question: What would be the output of the this code?      public class B {              public static void main(String[] args) {                  A a = new A(3);                  m1(a);                  System.out.println(a.getV());                  m2(a);                  System.out.println(a.getV());         }              private static void m1(A a) {             a = new A(2);         }              private static void m2(A a) {             a.setV(2);         }              public static class A {                  private int v;                  public A(int v) {                 this.v = v;             }                  void setV(int v) {                 this.v = v;             }                  int getV() {                 return v;             }         }     }  And my answer was that this class will print 2 2. And I was very surprised that actual printed values would be 3 2. I was sure that in method m1 the a will be redefined. Interviewer said that a will be local variable in this case so that's why the passed argument a won't be overwritten. In my humble opinion to declare the local variable it should at least look like this: A a = new A(2);. I never write this kind of messy code in my day life, but it is made me mad that I didn't know about it. I even searched JLS11, but I couldn't find where it is mentioned. Could anyone explain me why it is allowed in Java and where it is mentioned?

I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation?


So I have an assignment to create a change maker. I pretty much got it down, I just have one problem. Everything goes fine until it get to dividing the last iteration of the loop. If I use 55.87 as a value once the loop get to the last .02 and divides it by .01 (to hopefully get 2) it gets 1 instead. Here is my code:  #include <stdio.h>  int main (void) {     double money;     double change[8] = {20, 10, 5, 1, .25, .10, .05, .01};     int quantity;     int i;     int rpt = 1;      printf("Kevin Welch - Assignment 2 - Change Maker");      while (rpt == 1)     {         printf("Enter a dollar amount up to 200 to make change.\n");         printf("Maximum of two decimal points for cents.\n");         scanf("%lf", &money);          while (money > 200 || money < 0)         {             printf("Not a valid value.\nPlease re-enter:\n");             scanf("%lf", &money);         }          printf("\nAmount entered: $%.2lf\n\n", money);         printf("Change breakdown:\n");          for (i = 0; i < 8; i++)         {             quantity = (money / change[i]);  /*  I added this next printf line to output my variables to see what they          were doing while in the loop.   Output shows money = 0.02 and change[i] = 0.01,   however (money/change[i]) = 1 instead of 2. */              printf("\n%.2lf  %i   %.2lf\n\n", money, quantity, change[i]);              if (quantity >= 2 && money != 0)             {                 if (change[i] >= 10)                     printf("%i $%.2lfs\n", quantity, change[i]);                 else                     printf("%i  $%.2lfs\n", quantity, change[i]);                 money -= quantity * change[i];             }             else if (quantity >= 1 && money != 0)             {                 if (change[i] >= 10)                     printf("%i $%.2lf\n", quantity, change[i]);                 else                     printf("%i  $%.2lf\n", quantity, change[i]);                 money -= quantity * change[i];             }         }         printf("\nWould you like to use the change maker again?\n");         printf("Enter 0 for No and 1 for Yes:\n");         scanf("%i", &rpt);         while (rpt != 0 && rpt !=1)         {             printf("Enter 0 for No and 1 for Yes\n");             scanf("%i", &rpt);         }     } }

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


I have application with which I am generating my PDF from various chapters and sections, by adding and removing chapter and sections. So I found problem with example numbers and image numbers. For example I am writing in chapter 2 that Something is shown on example image (2.1) and there is image 2.1. But if I remove chapter 1, my chapter 2, becomes chapter 1 and my image number is 1.1, not 2.1 . How can I set my example numbers correct?  Thanks.

If I am writing a LaTeX document on TexMaker and I want to number my equation but most probably I will be adding details later on and I do not want to fall into retyping it all over again. So if for example I have an equation and currently called equation (1.2) that I want to refer later as in the following sentence "As you can see in (1.2)" but then I had to edit my document in a way that it becomes (1.3) now instead of (1.2) what should I do in order to avoid editing large number of equations and my reference to them?


In the movie  (aka Butterfly on a wheel), at about the 7th minute, Neil Randall (Gerard Butler) is going up an elevator, with another person in it.    From the angle of the shot, I am 100% certain that the camera man (or at least the camera) should have been seen in the mirrors.  How come they aren't? Was there an effect used?

It always makes me wonder how do they place the cameras and crew members while filming a scene which is opposite to a reflecting object, such as mirror.  Because, when filming the reflected objects we should see the camera and cameraman because of their reflection.  But this does not happen in the movies.  How do they film the scenes with an actor facing a mirror?  Why don't we see the cameras and crew?  What is the technique they use to film the scenes with reflecting objects?


I am looking for an easier way than mine to solve the problem.     Problem: Find the remainder when $11^{12}$ is divided by $13$.    Here is what I did. I simplify $11^{12}$ mod $13$ = $(–2)^{12}$ mod $13$. Then I don't know how to simply further.

I don't understand how to use Fermat's little theorem to find remainders e.g if we are asked to find remainder of $50^{50}$ on division by $13$, what is a and what is $p$ in the formula?  Also I wanted to check can we use both congruence classes as well as Fermat's little theorem to find such remainders? How would be write $50^{50}$ on division by $13$ in terms of congruence classes to find the remainder?  I don't exactly understand what a congruence class is, what does it tell us and how is it related to this?


prove $$\sum_{i=1}^{n}\sqrt{a_i}\ge ({n-1})\sum_{i=1}^{n}\frac{1}{\sqrt{a_i}}$$ if $$\sum_{i=1}^{n}\frac{1}{1+a_i}=1$$ My try: i tried substituiting  $y_i=\frac{1}{1+a_i}$ thus $\sum y_i=1$ also rearranging inequality we have to prove $$\sum_{i=1}^{n}(\sqrt{a_i}+\frac{1}{\sqrt{a_i}})\ge n\sum_{i=1}^{n}\frac{1}{\sqrt{a_i}}$$ putting value in terms of $y_i$  $$\sum_{i=1}^{n}\frac{1}{\sqrt{y_i(1-y_i)}}\ge n\sum_{i=1}^{n}\frac{\sqrt{y_i}}{\sqrt{1-y_i}}$$.i am stuck now i dont know which inequality to use.i tried using A-M$\ge$ H-M inequality. source ' inequalities A mathematical Olympiad approach'

Let $x_1,x_2,\ldots,x_n > 0$ such that $\dfrac{1}{1+x_1}+\cdots+\dfrac{1}{1+x_n}=1$. Prove the following inequality. $$\sqrt{x_1}+\sqrt{x_2}+\cdots+\sqrt{x_n} \geq (n-1) \left (\dfrac{1}{\sqrt{x_1}}+\dfrac{1}{\sqrt{x_2}}+\cdots+\dfrac{1}{\sqrt{x_n}} \right ).$$  This is Exercice 1.48 in the book "Inequalities-A mathematical Olympiad approach". Attempt I tried using HM-GM and I got $\left ( \dfrac{1}{x_1x_2\cdots x_n}\right)^{\frac{1}{2n}} \geq \dfrac{n}{\dfrac{1}{\sqrt{x_1}}+\dfrac{1}{\sqrt{x_2}}+\cdots+\dfrac{1}{\sqrt{x_n}}} \implies \dfrac{1}{\sqrt{x_1}}+\dfrac{1}{\sqrt{x_1}}+\cdots+\dfrac{1}{\sqrt{x_n}} \geq n(x_1x_2 \cdots x_n)^{\frac{1}{2n}}$. But I get stuck here and don't know if this even helps.


Show that the sequence ${x_n}$ defined by $x_n = ( 1 + 1/n)^n$ is a convergent sequence I've just answer : the proof will begin by demonstrating that the sequence is :  $1$. Monotonic increasing  that is $x_n < x_{n+1}$ $2$.bounded above

How to prove the following limit?   $$\lim_{n \to \infty} (1+1/n)^n = e$$    I can only observe that the limit should be a very large number!   Thanks.


Here is my problem.  I have lost my Win10 password and in search of solutions plugged in the hard drive with the Windows10 into another machine with another OS.  However, I discovered that I am unable to change system files, even as an administrator or root. There are writable files on the disk, so I think it is some feature of NTFS file system. Also, unwritable files are readable, so they aren't encrypted. But shouldn't another OS have the whole disk writable? How is this possible and how to remove the write protection? I have tried editing files in Windows\System32\ on WinXP, Win7 and Linux. Thank you for the answer.

I got a brand new Windows 7 machine, installed the operating system, created one account and forgot its password. What can I do?  There is no external CD, the operating system is loaded from somewhere inside the machine.  I already tried to remember passwords and tried all candidates with all possible combinations of caps lock, num lock etc.


"Who would've thought that working with you would have been a silver lining?" Actually, I don't quite understand the usage of "would have been"? What's the difference if I replace "would have been" with "was"?

In the movie "A Walk to remember" Jimmie's father says the following to his son-in-law who got into medical school. Actually Jimmie is dead when he says,      We are proud of you, son.  Jimmie would have been proud of you, too.   I wonder if the use of "would have been" is correct in this case. Shouldn't it simply be "would be"? I mean why past of would instead of present?


I've added myself to the dialout group and run   getent group dialout    and it returns  dialout:x:20:myUserName   I try to access the serial port and am getting...  [Errno 13] could not open port /dev/ttyACM0: [Errno 13] Permission denied '/dev/attyACM0'   So clearly I've left a step out.

I'm using the Arduino IDE in Ubuntu, and am having issues with the serial port. It has worked in the past, but for reasons that may be unnecesary, I felt the need to change the ownership of some of the files from root ownership to my users ownership.  This made the IDE work correctly, but I lost the ability to use the correct serial port.  In the dev folder, the port I need is listed as permission 166. Someone (who is no longer in the area to help me) swapped the permissions to 666, which made it all work gloriously.  However, it reverted back as soon as I restarted my computer, and if I now try to use the command:  sudo chmod 666 ttyACM0   nothing happens. No error messages, but no permission change either.    How can I change it, and how can I get it to change permanently.  I apologize if this question is overly simplistic or unclear, I'm an ubuntu noob, and I wouldn't begrudge feedback!


I am writing an assignment, and I need to say, "6", "year","old", and "girl". I wrote 6 year old girl, but I keep getting a blue underline suggesting it is grammatically incorrect. How should I be writing this, and why?

I have just installed Grammarly and it showed up something which i am not sure of.  It corrected '13 month old' to '13-month-old'.  The context is      I ask because my 13-month-old God daughter seemed like she was a little resentful towards another child who was visiting at the same time.   Which would be correct, and why?


Say I have this structure:

Hey, tis a title!

   This will generate a layout precisely like this:  image title   My goal is to, even if the code stays the same, display the content as:  title image   How can I achieve this?

Given a template where the HTML cannot be modified because of other requirements, how is it possible to display (rearrange) a div above another div when they are not in that order in the HTML? Both divs contain data that varies in height and width.

         Content to be below in this situation

         Content to be above in this situation

 Other elements   Hopefully it is obvious that the desired result is:  Content to be above in this situation Content to be below in this situation Other elements   When the dimensions are fixed it easy to position them where needed, but I need some ideas for when the content is variable. For the sake of this scenario, please just consider the width to be 100% on both.  I am specifically looking for a CSS-only solution (and it will probably have to be met with other solutions if that doesn't pan out).   There are other elements following this. A good suggestion was mentioned given the limited scenario I demonstrated—given that it might be the best answer, but I am looking to also make sure elements following this aren't impacted.


Can I declare default parameter like function myFunc( a, b=0) {   // b is my optional parameter }  in JavaScript?

I've always handled optional parameters in JavaScript like this:  function myFunc(requiredArg, optionalArg){   optionalArg = optionalArg || 'defaultValue';    // Do stuff }   Is there a better way to do it?  Are there any cases where using || like that is going to fail?


Why are trig-functions standard in radians as opposed to degrees?  I was wondering about this because when differentiating a trig-function in degrees one should apply the chain-rule: $$\frac d{dx}\sin x^\circ=\frac\pi{180}\cos x^\circ$$ Why could the degrees not be the standard?

I think this is just something I've grown used to but can't remember any proof.  When differentiating and integrating with trigonometric functions, we require angles to be taken in radians. Why does it work then and only then?