There have been occasions where I have desired to retrieve the HTML of pages other than the one I am typically on. This has happened either when I am using a browser's JavaScript console or when I am writing a bookmarklet. So, given any URL, I wish to retrieve the content of that URL so that I may then use it in, say, a JavaScript variable.  The desired solution cannot use jQuery since that requires loading an external library, which is only optimal in the context of JavaScript that is running in a webpage (as opposed to a console or from a bookmarklet). (Also, adding a script tag to a page just to use in the console is clunky.)
I need to do an  request in JavaScript. What's the best way to do that?  I need to do this in a Mac OS X dashcode widget.
Can't boot Ubuntu or Windows 8 after Ubuntu 64-bit install on Samsung series 7 Windows 8 laptop, error "All boot options are tried." I have a Samsung Chronos 7 laptop (NP770Z5E) pre-installed with Windows 8, and I wanted to install Ubuntu 13.04 alongside it, so I can dual boot. Here is what I've done:  Updated BIOS to lastest version (P04ABU) using Samsung Updater Reduced Win8 partition by half, I left the others untouched Created a bootable USB stick using  and a Ubuntu 13.04 64-bit image Disabled FastStartup on Win 8 Disabled Fast BIOS Mode Boot Mode changed to CSM OS  Update:  Also disabled Secure Boot (I had to disable it in order to select CSM OS)  After that I saved the BIOS settings, and shut down the computer. I plugged in the USB drive, powered the computer on, entered the BIOS and tried to change the boot order. Oddly, there was only one option in the boot order screen, the USB drive (HDD didn't show up in the boot priority screen). I ignored that and installed Ubuntu. I've created 3 partitions from the unused spaced left: a 8GB swap, a 100MB BIOS boot partition, and the rest to ext4, mounted in /. Boot loader installed on /sda. After a reboot, this message appears:  All boot options are tried. Press &lt;F4&gt; key to recover with factory image using Recovery or any other keys for next boot loop iteration.  So I went to the BIOS to change the boot device priority, and the list is empty! Enabling Secure Boot and Fast BIOS had no effect. I used the Ubuntu Live USB to check the disk contents, I can see the Ubuntu and Win 8 partitions. I've used Boot Repair (using the Recommended Repair), with no avail, the Boot Repair log is here:  Boot Repair showed me a message about the system being a&quot;EFI system&quot;. I suppose that means that I should have checked out the advanced settings. I don't know how to proceed. I don't know if it's a good idea to &quot;recover with factory image&quot; since I have modified the original partitions. Maybe I need to experiment with Boot Repair's advanced settings. TV documentaries invariably show the Big Bang as an exploding ball of fire expanding outwards. Did the Big Bang really explode outwards from a point like this? If not, what did happen? Take an FF body and a crop body, with similar MP rating - and the FF body will give a sharper image of the same object. At least, that seems to be the case - as here:    I assume a low ISO was used in both images.  Why does the FF body, with the same lens and almost the same MP, give an image that is so much sharper?   My best guess is that the diffraction / airy still play a role, and the larger pixels reduce effective overlap - thus increasing contrast/sharpness by displaying less of the neighboring diffraction, as below? This question is about finding reasons for compile errors when using tikz.  Consider the files compiles.tex, compiles-not1.tex and compiles-not2.tex. Then it is clear that compiles-not1.tex does not compile, because the name C has not been assigned. The file compiles-not2.tex does not compile, because \draw (A) -- (A -| B ); contains a space after the name B. However, this is difficult to see from the error message.   Is it possible to tweak the error messages generated by tikz to perhaps mark tikz-code and names in some way? What I mean is that in the example, an error message ! Package pgf Error: No shape named 'B ' is known. might be more helpful, as the space in the name B\␣ (B with a trailing space) is more clearly delimited from the message.   File compiles.tex compiles without errors.  \documentclass{article} \usepackage{tikz} \begin{document} \begin{tikzpicture}     \node (A) {A};     \node[above right of=A] (B) {B};     \draw (A) -- (A -| B); \end{tikzpicture} \end{document}   On compilation compiles-not1.tex generates ! Package pgf Error: No shape named C is known.  \documentclass{article} \usepackage{tikz} \begin{document} \begin{tikzpicture}     \node (A) {A};     \node[above right of=A] (B) {B};     \draw (A) -- (A -| C); \end{tikzpicture} \end{document}   compiles-not2.tex generates ! Package pgf Error: No shape named B  is known.  \documentclass{article} \usepackage{tikz} \begin{document} \begin{tikzpicture}     \node (A) {A};     \node[above right of=A] (B) {B};     \draw (A) -- (A -| B ); \end{tikzpicture} \end{document} Removed Python 3 and now Ubuntu Software Center, terminal and other applications don't work How can I find out if Ubuntu supports a particular hardware component, that is, if it works in Ubuntu?  I am going to put together a computer and I am choosing components.   How do I know if Ubuntu supports this or that motherboard, or this or that sound card, or this or that graphics card, etc? How do I know that there is no conflict in Ubuntu between this and that hardware component?   What resources are there to help with such situations?  I know that there are computers with Ubuntu pre-installed and that there are  for whole computers but this is not what I'm looking for. I'm looking for resources to find out support for particular hardware components and conflicts among particular hardware components. I'm writing up some notes that will be displayed on an overhead projector. The standard time-derivative \dot{x} produces a dot that is hard to see. Does anyone know of a package or have a macro that produces a (nice looking) larger dot? Similarly with \ddot{x}.  At the moment, I've been supplied with some ugly code that produces an ugly output:  \def\dt#1{{\buildrel  {\hbox{\LARGE . }} \over {#1}}}    % dot-over  \def\ddt#1{{\buildrel {\hbox{\LARGE ..}} \over {#1}}}    % double dot This is a continued discussion from () by return count only.     Problem      Given four lists A, B, C, D of integer values, compute how many tuples   (i, j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero.      To make problem a bit easier, all A, B, C, D have same length of N   where \$0 \le N \le 500\$. All integers are in the range of \$-2^{28}\$ to \$2^{28} - 1\$   and the result is guaranteed to be at most \$2^{31} - 1\$.      Example:      Input:  A = [ 1, 2] B = [-2,-1] C = [-1, 2] D = [ 0, 2]       Output:  2       Explanation:      The two tuples are:         (0, 0, 0, 1) -> A[0] + B[0] + C[0] + D[1] = 1 + (-2) + (-1) + 2 = 0   (1, 1, 0, 0) -> A[1] + B[1] + C[0] + D[0] = 2 + (-1) + (-1) + 0 = 0      I'm wondering if there are any ideas to have a solution less than \$O(n^2)\$ time complexity.  Source code in Python 2.7,  from collections import defaultdict def four_sum(A, B, C, D):     sum_map = defaultdict(int)     result = 0     for i in A:         for j in B:             sum_map[i+j] += 1     for i in C:         for j in D:             if -(i+j) in sum_map:                 result += sum_map[-(i+j)]      return result  if __name__ == "__main__":     A = [1, 2]     B = [-2, -1]     C = [-1, 2]     D = [0, 2]     print four_sum(A,B,C,D) How to prove that $\lim\limits_{h \to 0} \frac{a^h - 1}{h} = \ln a$ Display error message if same record exist with combination of some fields? I have taken three fields from case object called AccountName, IntegrationTo__c and SfType__c (checkbox).  I have created one case record with a specific combination of three fields.  For the second time I create a record with that combination, then  display error message only if SfType__c is true in first record otherwise allow  for record creation.  trigger AvoidDuplicate on Case(before insert)  {          set&lt;string&gt; newNameSet = new set&lt;string&gt;();     newNameSet = new set&lt;string&gt;();      set&lt;string&gt; newEmailSet = new set&lt;string&gt;();      set&lt;string&gt; dbNameSet = new set&lt;string&gt;();      set&lt;string&gt; dbEmailSet = new set&lt;string&gt;();      for(Case newLead : trigger.new){          newNameSet.add(newLead.Account.Name);          newEmailSet.add(newLead.IntegrationTo__c);      }      for(Case dbLead : [select id, Case.Account.Name, IntegrationTo__c from Case where IntegrationTo__c IN: newEmailSet OR Case.Account.Name IN: newNameSet]){          dbNameSet.add(dbLead.Account.Name);          dbEmailSet.add(dbLead.IntegrationTo__c);      }      for(Case newLead : trigger.new){          if(dbNameSet.contains(newLead.Account.Name) &amp;&amp; dbEmailSet.Contains(newLead.IntegrationTo__c))              newLead.addError('You are inserting Duplicate Case');      }  }   i wrote this this not checking the account field name and integration__c values only with combination of account and integration__c shows error I want to show that for $\gcd(a,b) = 1$ $a,b \in Z$   $\gcd(a+b, a-b) = 1$ or $\gcd(a+b, a-b) = 2$ holds.      I think the first step should look something like this:      $d = \gcd(a+b, a-b) = \gcd(2a, a-b)$   From here I tried to proceed with two cases. 1: $a-b$ is even, which leads to $\gcd(a+b, a-b) = 2$ 2: $a-b$ is odd, which leads to $\gcd(a+b, a-b) = 1$  My main problem I think is, that I do not know how I should include $\gcd(a,b) = 1$ in the proof.  Any help is appreciated. Thx in advance. Cherio Woltan Best way to find all factors of a given number Where does the question mark go — inside or outside the parentheses? Using sed what is an one liner to print the first n characters?  I am doing the following:  grep -G 'defn -test.*' OctaneFullTest.clj  | sed .... Debian 8 apt-get update showing 404 Not Found I got the following output every time I run apt-get update on my Debian 8.   Is there a way to fix this?   Err http://ppa.launchpad.net jessie/main amd64 Packages                         404  Not Found Ign http://ppa.launchpad.net jessie/main Translation-en                 Err http://ppa.launchpad.net jessie/main amd64 Packages                   404  Not Found Ign http://ppa.launchpad.net jessie/main Translation-en                 Fetched 164 kB in 3s (47.0 kB/s)                                        W: Failed to fetch http://ppa.launchpad.net/certbot/certbot/ubuntu/dists/jessie/main/binary-amd64/Packages  404  Not Found  W: Failed to fetch http://ppa.launchpad.net/ondrej/php/ubuntu/dists/jessie/main/binary-amd64/Packages  404  Not Found  E: Some index files failed to download. They have been ignored, or old ones used instead.   And this is what I have in /etc/apt/sources.list  deb http://ftp.debian.org/debian/ jessie main deb-src http://ftp.debian.org/debian/ jessie main  deb http://security.debian.org/ jessie/updates main deb-src http://security.debian.org/ jessie/updates main  # jessie-updates, previously known as 'volatile' deb http://ftp.debian.org/debian/ jessie-updates main deb-src http://ftp.debian.org/debian/ jessie-updates main  deb http://ftp.debian.org/debian jessie-backports main   And this is the output of cat /etc/apt/sources.list.d/*  deb http://ppa.launchpad.net/certbot/certbot/ubuntu jessie main # deb-src http://ppa.launchpad.net/certbot/certbot/ubuntu jessie main deb http://ppa.launchpad.net/ondrej/php/ubuntu jessie main # deb-src http://ppa.launchpad.net/ondrej/php/ubuntu jessie main deb http://ppa.launchpad.net/ondrej/php/ubuntu jessie main # deb-src http://ppa.launchpad.net/ondrej/php/ubuntu jessie main deb https://packages.sury.org/php/ jessie main deb https://packages.sury.org/php/ jessie main My  objective is to classify sensor signals.  The concept of my solution so far is : i) Engineering features from raw signal ii) Selecting relevant features with ReliefF and a clustering approach iii) Apply N.N, Random Forest and SVM  However I am trapped in a dilemma. In ii) and iii), there are hyperparameters like k-Nearest Neigbours for ReliefF or the window length, for which the sensor signal is evaluated, or the number of hidden units in each layer of N.N.  There are 3 Problems I see here : 1) Tuning feature selection parameters will influence the classifier performance 2) Optimizing hyperparameters of classifier will influence the choice of features. 3) Evaluating each possible combination of configuration is intractable.  So my questions are : a) Can I make a simplifying assumption, s.t. tuning feature selection parameters can be decoupled from tuning classifier parameters ? b) Are there any other possible solutions ? Why is "ask" sometimes pronounced "aks"? We've recently moved from New Zealand to New York City, and have noticed that many people (most of whom have good English) pronounce "ask" as "aks". For example:     Could you please go aks her tomorrow?   Sure, I'll ax her! :-)  What's the origin/etymology of "aks"? It seems to be more common among African Americans, but it's definitely used by others too. Roots of a functionwith condition $\int_0^\pi f(x) \sin x dx = \int_0^\pi f(x) \cos x dx =0.$ Let $f:[0,\pi] \rightarrow \Bbb R$ be a continuous function which satisfies $\int_0^\pi f(x) \sin x dx = \int_0^\pi f(x) \cos x dx =0.$ Show that $f$ has at least two roots. How to display the final value of a counter at the beginning of a document? How do I find diamonds? The durability of iron tools is really starting to annoy me, but in all my hours of playing I've only stumbled across one deposit of diamond ore that provided around 7 Diamonds. What's the best way to locate more in Survival mode? Where is it most commonly found?