\documentclass{article} \usepackage{threeparttable} \usepackage{booktabs}  \begin{document}          \begin{table}         \centering          \begin{threeparttable}              \caption{The fist nine Modes of the Blade}             \label{tab:PPer}              \begin{tabular}{l l l l l l l l l l}                                    \toprule                  \textbf{Mode Number}& 1 & 2 & 3& 4& 5& 6& 7& 8& 9 \\                 \midrule                 \textbf{Frequency [Hz]}&  191.25 & 531.4 & 695 &1108.75 &1140.6 &1304.4 &1986.5 & 2558.6 & 2675.8 \\                 \midrule                 \textbf{Damping ratio $\zeta(\%)$}&  0.46 & 0.93 & 0.21 &1&1&1&1&1&1 \\                                  \midrule             \end{tabular}  \label{tabel:3.5}         \end{threeparttable}     \end{table}`      \end{document}

I have a table that I want to insert on a page, but at least one (perhaps both) of the following conditions are met:   The table is too wide to fit within the text block or page. That is, I'm exceeding some horizontal restriction. The table is too tall to fit within the text block or page. That is, I'm exceeding some vertical restriction.   What are my options to make this table fit? If it doesn't fit, regardless of my attempts, what other options exist?


Let $A_{(n)}:\mathcal B\rightarrow \mathcal B$ be a linear bounded operators such that for any $f\in \mathcal B$, $A_nf\rightarrow Af$. Show that then for any compact operator $B$  $$\|A_nB-AB\|\rightarrow0$$  Any tips how to show this?

$A_n:Y\rightarrow Z$ are operators that strongly converge to $A$. Also, $\|A_n\|_\text {op}\le c$ for $c>0$. Given a compact operator $T:X\rightarrow Y$, I need to show that $A_nT$ converges to $AT$ in operator norm (all spaces in this question are Banach spaces).     I was unable to prove this and I also do not understand why we need to assume that $T$ is compact. Any ideas?


I've noticed a trend in content positioning on popular websites such as facebook, youtube, 9gag and many more.. they all have their main content to the left side of website. Why is this? Or is it just random?

The F-Shaped pattern is a pattern found in an eye-tracking study as the primary areas people glance over when reading a website.     Is this something we as graphic designers should consider not only in web but in all mediums? If so do we give priority placement to our content for maximum benefit to our end-users or to advertisers/sponsors for maximum revenue?


I have a table on the page that's loaded when I click search button. The table loads dynamically and it doesnt exist in the layout. I wonder how to select this table inside a function to do some other stuff with it. I tried something like this to select a column:   $(function (){ var elem = $('tbody').find('td'); });   But I'm not sure how to call this tbody if it doesn't exist in the layout yet. How to do that?

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


I'm trying to make a dutch zipcode validator. On the first step i need to check if the first char of the zipcode (which is always a number), is between 1-9. But when i just tried to make a simple if statement to check if the first char is false, it comes back as true. In this example I took a premade string "2097AR" as input for the method "checkPostcode".  public static boolean checkPostcode(String postcode){         String postcodeEen = postcode.substring(0,1);          boolean resultCheck = true;          System.out.println(postcodeEen);          if (postcodeEen == "1"){             resultCheck = false;         }           return resultCheck;      }

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?


He said he had not received it vs he said he did not receive it . Does the second sentence means that the saying and the non receiving happened quite at the same time whereas "had not received" stated that the non receiving happened before the saying . Is it the only difference ? Would you use the second one because as it is reported speech past simple could be understood as the original statement was in present (but received is rarely used in present)

Consider the following paragraph:  My account was suspended after I used what I believe was an expired confirmation code for changing my payment details. I had not received a confirmation email immediately after switching to Payoneer from PayPal on the website. When it arrived 2-3 hours later, I had clicked on the link in it and had entered the confirmation code but was told that the confirmation code was incorrect. I had tried a couple of times more thinking maybe I had done something wrong the first time around but the error message persisted. Immediately after that, an email had arrived saying that my account was going to be suspended for security reasons.  The first sentence of the paragraph describes what happened to my account (it was suspended), and the rest of the paragraph details what led to the suspension. So, if the first sentence is in simple past tense, then the rest of the paragraph has to be in past perfect tense. Have I used "had" and "was" correctly here? If not, could you please point out the mistakes?


I want to compute  $$  \int_{-\infty}^\infty \frac 1{ (1+x^2)^{n+1}} dx $$ for $n \in \mathbb N_{\geq 1}$. If I let $$  f(z) := \frac 1 {(z+i)^{n+1}(z-i)^{n+1}} $$ then I see that $f$ has poles of order $n+1$ in $\pm i$. Initially I thought that  $$ [-R,R] \cup \{R \exp(i \theta) \mid \theta \in [0,\pi] \} $$ would be a good conture but for the residue in $i$ I get $(-1)^n (n+1) 2 i$. I know that the result must be $$ \frac {1 \cdot 3 \cdot 5 \cdots (2n-1)}{2 \cdot 4 \cdots 2 n} \pi $$ which looks quite different than my residue.  What goes wrong here ?


Right I am getting weird linker errors which I've never seen before and which I can't really decipher.  Code for the  and  can be found there. One remark: I've moved all function bodies to the source file instead of the header file. Naming has stayed the same.  Error   1   error LNK2019: unresolved external symbol "public: __thiscall RelationUser<class Family,class Citizen>::RelationUser<class Family,class Citizen>(class Family *)" (??0?$RelationUser@VFamily@@VCitizen@@@@QAE@PAVFamily@@@Z) referenced in function "public: __thiscall Citizen::Citizen(class Family &,class Name)" (??0Citizen@@QAE@AAVFamily@@VName@@@Z) *path*\Citizen.obj  CodeAITesting Error   2   error LNK2019: unresolved external symbol "public: __thiscall RelationUser<class Family,class Citizen>::~RelationUser<class Family,class Citizen>(void)" (??1?$RelationUser@VFamily@@VCitizen@@@@QAE@XZ) referenced in function __unwindfunclet$??0Citizen@@QAE@AAVFamily@@VName@@@Z$1  *path*\Citizen.obj  CodeAITesting Error   3   error LNK2019: unresolved external symbol "public: __thiscall RelationOwner<class Family,class Citizen>::~RelationOwner<class Family,class Citizen>(void)" (??1?$RelationOwner@VFamily@@VCitizen@@@@QAE@XZ) referenced in function __unwindfunclet$??0Family@@QAE@VName@@@Z$1   *path*\Family.obj   CodeAITesting   The first one is about a constructor and the second two are about the destructor. That I understand.  I've also implemented my own version of the User and Owner as the following:  // header of Family.h (Owner in the linked PDF file) #include "Name.h" #include "RelationOwner.h"  class Citizen; class Family; // I didn't really know if this one was necessary.  class Family      : public RelationOwner<Family, Citizen> { public:     Family(Name name);  private:     Name name; };  // Source of Family.cpp #include "Name.h"  Family::Family(Name name)     : name(name) { }  //Source of Citizen.h (User in the linked PDF) #include "Name.h" #include "RelationUser.h"  class Citizen; class Family;  class Citizen      : public RelationUser<Family, Citizen> { public:     Citizen(Family &family, Name name);  private:     Name name; };  // Source of Citizen.cpp #include "Family.h" #include "Name.h" #include "RelationUser.h"  Citizen::Citizen(Family &family, Name name)     : RelationUser<Family, Citizen>(&family),     name(name) { }   As far as I know I am not doing anything fancypancy, yet it is complaining big time and I don't know why.

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


In context of rotational dynamics my textbooks interminably states that there always exists a rotational analog for every linear variable and they are related to one another through similar equation. (And for the fact I know about most of these analogs and the related equations)   Though till now I haven't yet seen/learnt of rotational analog of Newton's Laws of Motion. So    Does there exist a rotational analog for Newton's laws of Motion?  If possible, then are they generalizable to non-rigid body?    Edit:  To further clarify the question I am going to write down the rotational analog of Newton's laws of motion. Assuming that there exists a rotational analog of Newton's laws of motion, I suppose they would look like the following:   A body continues it's state of rest and uniform rotation unless acted upon by an external torque.  The torque acting on a body is directly proportional to the rate of change of angular momentum. i.e.,   $$ \boldsymbol {\tau} = \frac {d\mathbf L}{dt}$$   For every torque there is an equal and opposite torque.    So are these statements (that I made as an analog of Newton's laws of Motion) true for all kind of rotational motion? Is there any exception to them?

Newtons three laws of motion appears to apply only for linear motion:   An object remains at rest or moves in a straight line at uniform velocity unless a force is applied.  Force is mass times acceleration.  Every action causes an equal and opposite reaction.    Is there a rotational equivalence? For example:  1'. Every body rotates around a fixed axis at uniform angular velocity unless a torque is applied 2'. Torque is Moment of Inertia times angular acceleration 3'. When one body exerts a torque on another; there is an equal and opposite torque applied on the first body by the second.  First are these actually correct; if not, what are the correct equivalence; and who formulated them?


Right now if I ask a question, and later on that day or the next I find a solution, and no other answers were posted or solved that question, I will post my own answer if it's the solver.  What I don't get is why I have to wait 2 days to approve it? It just makes me forget about the question and I won't always get back to it later; lowering my acceptance rate and leaving an unanswered question in attention.  I see it as no different than asking a question and marking "answer my own question" at the bottom, actively answering it immediately.  I think there should be no delay to approving own answers, or make it significantly smaller than 2 days.

In light of , it seems that we ought to be able to accept our own answers within the same time limits as accepting someone else's answer. Of course, this notion has been discussed here before (when times were different, mind you):      The crux of the blog post was that it's not only acceptable but encouraged to accept your own answer when you find your own solution. I can accept someone else's answer to my question in as little as 15 minutes, surely I should be able to accept my own answer. I have no rep to gain from this, and the community is better off knowing that there's a solution to my problem or answer to my question. If there's concern about lots of spam here, perhaps this can be a privileged operation, say with 5k rep you can accept your own answers as if they were someone else's answer. One alternative to rep limits would be if previously self-accepted answers (and/or questions with self-accepted answers) have received upvotes, indicating a user is capable of asking and answering their own questions to the satisfaction of the community.  The rationale for my complaint is that lately I've been asking extremely long-tail questions for low-use frameworks/libraries on the site and receive not only low views but no comments or other answers. This leaves me searching for my own solutions, so when I find them I write up reasonable answers that add value to the site (that make the web a better place) and that ultimately I shouldn't have to manage any differently than any of my other questions. At the time of posting, my last  question had 7 views and hits


First backup after upgrading to 20.04: when I try to start my backup, it asks me to install gvfs-backends. When accept to proceed with the installation, I obtain the following error: The following packages have unmet dependencies: gvfs-backends: Depends: libsmbclient (>= 2:4.10.0+dfsg) but 2:4.7.6+dfsg~ubuntu-0ubuntu2.20 is to be installed

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 am trying to solve one competitive question, where I'm stuck at below scenario can some one help me out to understand how the output can be achieved Explanation : Every group of three consecutive rows should be folded into one [ Output is shared below ] Data in file : Abc 123, zyxhj pqr raj ram: vilas,  1234 jkal yui gshj  Output : Abc 123,zyxhj pqr raj ram:vilas,1234 jkal yui gshj

I have more than 1000 lines in a file. The file starts as follows (line numbers added):  Station Name Station Code A N DEV NAGAR ACND ABHAIPUR AHA ABOHAR ABS ABU ROAD ABR   I need to convert this to a file, with comma separated entries by joining every two lines. The final data should look like  Station Name,Station Code A N DEV NAGAR,ACND ABHAIPUR,AHA ABOHAR,ABS ABU ROAD,ABR ...   What I was trying was - trying to write a shell script and then echo them with comma in between. But I guess a simpler effective one-liner would do the job here may be in sed/awk.  Any ideas?


Let $R$ be the ring of all continuous functions from the interval $[0,1]$ to $\Bbb R$. For each $a\in[0,1]$ let $$A_a=\{f\in R \mid f(a)=0\}$$  Now firstly, this is part of an assignment problem, please give me hints/insight into the problem, and not a solution.  I want to show that $A_a$ is a maximal ideal - but I am not sure how to think of my set. I have dealt with polynomial rings, perhaps some analogy?  Now, how to know this is a subring? Well if $f_1(a)=0$ and $f_2(a)=0$ clearly this is closed under subtraction and multiplication. Showing it is maximal is harder and I am not sure where to start.

Is the ideal $I = \{f \mid f (0) = 0\}$ in the ring $C [0, 1]$ of all continuous real valued functions on the interval $[0, 1]$ a maximal ideal?


While I was watching Game of Thrones, I encountered with the sentence below:     They'll both be dead come winter.   I am a little bit confused with the the usage of "come winter". Is this structure has a name? Is it formal? Can it be used in formal, written English?  I do not think I have encountered this structure before. Could you give another example to this structure?

I found this sentence in the book Artemis Fowl 2: The Arctic Incident:     Whether he escaped or not, the LAPD would be visiting evety dwarf in the city come sunrise.   I guess it means "when sunrise comes," but is it correct? And is it common usage?  PS: I'm a non-native speaker who never saw this kind of phrase before, and when I Googled “come sunrise” no explanation turned up.


I have a GUI in eclipse where I enter username and password and if they are correct when I press a Jbutton, the GUI should close. Else say "Wrong username and password". My code is:  if(name == username.getText() && pass == Password.getText()){                     //allow access                     System.exit(0);                 }                 else{                     //deny                     btnLogIn.setText("Wrong username or password");                 }   I keep getting the "Wrong username or password" although the username and password are 100% correct. Where am I going wrong?  Variables:     private JPasswordField Password;     private JTextField username;  private String id = "username"; private String pass = "pass";

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?


For example   System.out.println("a".substring(1) == "");   will return false.  However, it does return an instance of Stringsuch that println will display nothing. What is it and how to detect it, then?


The Fibonacci numbers are defined as follows: $f_0 = 0$, $f_1 = 1$, and $f_n = f_{n-1} + f_{n-2}$ for $n \ge 2$. Prove that for each $n \ge 0$, $f_{4n}$ is a multiple of $3$.  I've tried to prove to by induction. So, my basis is $f(0)$, which is true. Then, i assume that it's true for some integer $k$, and I am stuck at this point, can't really get what to do

Can any one give a generalization of the following properties in a single proof? I have checked the results, which I have given below by trial and error method. I am looking for a general proof, which will cover the all my results below:   Every third Fibonacci number is even. 3 divides every 4th Fibonacci number. 5 divides every 5th Fibonacci number. 4 divides every 6th Fibonacci number. 13 divides every 7th Fibonacci number. 7 divides every 8th Fibonacci number. 17 divides every 9th Fibonacci number. 11 divides every 10th Fibonacci number. 6, 9, 12 and 16 divides every 12th Fibonacci number. 29 divides every 14th Fibonacci number. 10 and 61 divides every 15th Fibonacci number. 15 divides every 20th Fibonacci number.


How would I show that an element $\alpha$ is in $\mathbb{Z}[\sqrt{2}]^*$ (the invertible elements of $\mathbb{Z}[\sqrt{2}]$) if and only if the norm of $\alpha$ is $\pm 1$? I did not see this as a duplicate at first because I thought that $1$ and $\pm 1$ needed different ways of proving, but it turns out that if $N(\alpha)$ divides $1$, then it can be negative or positive.

Prove that $N(\gamma) = 1$ if, and only if, $\gamma$ is a unit in the ring $\mathbb{Z}[\sqrt{n}]$  Where $N$ is the norm function that maps $\gamma = a+b\sqrt{n} \mapsto \left | a^2-nb^2 \right |$  I have managed to prove $N(\gamma) = 1 \Rightarrow \gamma$ is a unit (i think), but cannot prove $\gamma$ is a unit $\Rightarrow N( \gamma ) = 1$  Any help would be appreciated, cheers


Where is the difference in meaning of these two sentences? "I wish you wouldn't drink so much" vs. "I wish you didn't drink so much."

I was teaching first and second conditionals to an intermediate English class the other day, and then we started with 'wish' statements.   We talked about famous people and their wishes. For example: 'Barack Obama wishes the USA didn't have such a high unemployment rate.'  And then we continued with the lesson and I introduced 'wish' statements with would.  My example was 'I wish my daughter would do better at school'.   Then a student asked me what the difference between 'I wish' with 'did' or 'didn't' and 'I wish' with 'would' or 'wouldn't' was.   I said the difference was tense, if I say 'Barack Obama wishes the USA didn't have such a high unemployment rate', it's present tense.  If I say 'Barack Obama wishes the USA wouldn't have such a high unemployment rate.' It's incorrect, I think it would be better if I said : 'Barack Obama wishes the unemployment rate would improve in the USA.' , future tense.   And with the daughter example,'I wish my daughter would do better at school.', means that I hope she will improve in the future, and when I say 'I wish my daughter did better at school.' does that mean right now she is doing badly, and I want it to change today? Or does it mean that I don't think it will change?


Preamble: I have decided that I would like to build gnome-shell from source (after ). My system is a stock Ubuntu 20.04.2 with Xorg Server, GDM3, Gnome desktop, and Mutter. I have cloned the gnome-shell  (recursively) with git, and have checked out the gnome-3-36 branch. On the only git submodule, subprojects/gvc, I have checked out the master branch, because studying git branch --all, that seemed to be the only one to make sense. Then I installed meson (v 0.53.2), and tried running meson builddir in the gnome-shell working tree root, as I have seen from . Challenge: Through error messages I have learned about missing dependencies. Then I have installed gcc, and after another failed attempt, cmake. After this, I still got errors about missing dependencies, which I started to search for and install with Synaptic one by one, after each error message of a new failed build attempt. In this fashion, I have so far installed such packages as libecal2.0-dev, libgcr-3-dev, libgirepository1.0-dev, and libgjs-dev. Now I feel stupid, and I think meson could install all these for me in a single process, with some command: like npm does with npm install.  looks somewhat like the npm ecosystem's package.json, so I guess I should be able to have dependencies installed by meson... Is that right? Now, to remain with the npm comparison, it strikes me that when I run npm install, I get a self-contained directory, node_modules/, where the (project's) dependencies are added. In contrast, I so far have installed my meson dependencies globally on my system. Does that make sense? Should I do it differently? Is there a better way?  Update 1:  this command: sudo apt install build-essential I thought it might be a useful shortcut, but for me it returns: "build-essential is already the newest version". Seems like the gnome-shell project's dependencies are beyond of what's considered essential.  Update 2: I have continued with manually installing dependencies as they came up, while keeping notes of what these were: libecal2.0-dev libgcr-3-dev libgirepository1.0-dev libgjs-dev libmutter-6-dev libpolkit-agent-1-dev libstartup-notification0-dev libgnome-desktop-3-dev libgnome-bluetooth-dev libnm-dev xsltproc sassc libpulse-dev asciidoc-base  After installing these with Synaptic, the meson build command proceeded until a successful exit. Just for a note, this stuff was huge (the dependencies of dependencies), I have the impression that gigabytes of disk space was used for them.  At this point @muru suggested : # So I ran sudo apt-get build-dep gnome-shell --dry-run  # then sudo apt-get build-dep gnome-shell  For this to work however, I had to check a checkbox and select a server for "Source code" in the  — again, thanks to @muru's guidance. Anyways, sudo apt-get build-dep gnome-shell has installed 36 more packages on top of what already had been installed. At this point however I feel optimistic that I am well equipped for the actual compilation, not just for the mere meson build.  Update 3: Considering how helpful this thread may be for any newcomer willing to work with meson in general or on the gnome-shell specifically, I would like to save this question from being deleted. I would like to move the info in the "Update 2" section into an answer. That would enable us to keep this collection of valuable information together in one place. So I cast a reopen vote.

I'd like to find out which packages  sudo apt-get build-dep <package>   would install (if I already got some dependencies installed, I'd also like to see those → so running or simulating the above is not enough). Command line preferred.


I'm creating a site that generates a new Div for each search result. I include a checkmark and remove glyphicon on each search result, and want that search result to fade out when it's remove icon is clicked. For some reason my below code won't work. Any ideas? (The click function I'm referring to is the last one in the script)      var search = false;   $("#icon").click(function(){   $(this).addClass("animated fadeOut");   $(this).remove();   $("#helperText").addClass("animated fadeOut")   $("#helperText").remove();   $("#searchText").removeClass("hidden",5000, "easeOutElastic"); })  $("#searchText").submit(function(e){   if (search === true){     cleanUp();   }   e.preventDefault();   term = $("#input").val();   getData(term);   search = true; })  function divMaker(maker, data, i){   //pass in an array   jQuery('
', {     id: 'foo',     class: maker,     href: 'http://google.com',     title: 'Become a Googler',     rel: 'external',     html: "<button class='checkMark'></button>
"+data[1][i] + "

" + data[2][i]+"
<button class='remove'></button>", }).appendTo('#test'); }  function getData(term){   URL = "https://en.wikipedia.org/w/api.php?action=opensearch&format=json&search="+term;   $.ajax( {       url: URL,       data: 'queryData',       dataType: 'jsonp',       type: 'POST',       headers: { 'Api-User-Agent': 'Example/1.0' },       success: function(data) {             for (i=0; i < 5; i++){             maker = 'maker text-center animated bounceInUp';             divMaker(maker,data,i);             }       }   } ); }  function cleanUp(){   $("#test").empty(); }  $(".remove").on("click",function(){   $(this).addClass('animated fadeOut'); })

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


I'm running on OSX Yosemite and notice that although there is 7 GB of memory unused, there is still 130 MB of memory used for swap.  Are any apps actually using swap space, which I assume resides on my harddisk? Is this a situation to be concerned with, or is this normal?  I can't figure this out despite reading up on the memory statistics in Mac.

My system (Yosemite / 10.10) has been paging out to swap memory despite my memory pressure reading less than 50% over the last 7 days (tracked with iStat Menus). How is this possible? It would be one thing if memory pressure exceeded 100% at some point in the last week and then the swap file was activated, but that doesn't seem to have happened at all and yet I've got 1.25 GB of 2.00 GB being swapped right now, with 36% memory pressure. Shouldn't the new memory model introduced in Mavericks behave differently?


I want to install the following package on ubuntu 14.4 LTS  libreadline-dev   liblua5.2-dev libevent-dev  python-dev   But when i want to install libreadline-dev error shows:  The following packages have unmet dependencies: libreadline-dev : Depends: libreadline6-dev (= 6.2-8) but it is not going to be installed E: Unable to correct problems, you have held broken packages.   And when i want to fix it by install libreadline6-dev error shows :  The following packages have unmet dependencies: libreadline6-dev : Depends: libreadline6 (= 6.2-8) but 6.3-4ubuntu2 is to be installed                    Depends: libtinfo-dev but it is not going to be installed E: Unable to correct problems, you have held broken packages.   Also install libevent-dev shows error:  The following packages have unmet dependencies: libevent-dev : Depends: libevent-2.0-5 (= 2.0.16-stable-1ubuntu0.1) but 2.0.21-stable-1ubuntu1.14.04.1 is to be installed E: Unable to correct problems, you have held broken packages.   And python-dev error shows:   The following packages have unmet dependencies:  python-dev : Depends: python (= 2.7.3-0ubuntu2.2) but 2.7.5-5ubuntu3 is to be installed           Depends: python2.7-dev (>= 2.7.3) but it is not going to be installed  E: Unable to correct problems, you have held broken packages.   How can i fix it?

Occasionally, when I'm installing stuff, I get an error like the following:  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:  package1 : Depends: package2 (>= 1.8) but 1.7.5-1ubuntu1 is to be installed E: Unable to correct problems, you have held broken packages.   How can I resolve this?


I would like to open a Stack Exchange link from clipboard in the app.  For example, if while opening the app it detects a URL to a Stack Overflow question in the clipboard, then it can show a dismissible fadeble banner  that asks whether to show the question in the app (whether to follow the link).

There doesn't seem to be a way to navigate to a specific question using the . If there is, then it wasn't obvious to me. I tried entering the question number or URL into the search field, but it didn't work.


I have an older hp pavilion all in one pc and after upgrading to 15.04 whenever I tell the computer to shutdown while in unity (haven't tried other DEs) it goes to the login screen as if I'd only pressed logout. It will then shutdown if I select shutdown from the menu in lightdm. But why is it doing this?

Since i upgraded to Ubuntu 15.04, if i click on the shutdown button it only logs out and i have to click again on the shutdown button (from the ubuntu login screen) to power off the pc. How can i fix this?


I'm trying to hide tabs of admin panel like Posts, Pages, etc...  I tried  without success.

I would like to hide Pages and Comments from the editor.  I tried to override them with my custom types' menu_position but it doesn't work in WordPress 3.7.1 any more.  I found another way: removing the entries from admin menu by altering the global $menu variable on menu_order filter. Unfortunately it produces errors in menu.php: array_flip() gets passed a null.  I'm guessing that WordPress assumes that default values are still there.  Is there some way of filtering the menu entries when they are rendered? Even better: is there a way of setting the default post types public option to false?  class RemoveAdminMenuItems {  /**  * List of values used for key identification  *   * @var array  */ public $remove_keys = array();  /**  * List of values used for key identification. Identified keys will be removed.  *   * @param array $remove_keys  */ public function __construct($remove_keys) {      $this->remove_keys = $remove_keys;      add_filter( 'custom_menu_order', '__return_true' );     add_filter( 'menu_order', array($this, 'reconstruct_menu'));  }  /**  * Method modifies the admin menu before it gets rendered.  *   * @global array $menu  */ public function reconstruct_menu() {      global $menu;      foreach ($menu as $menu_key => $menu_value) {         foreach ($this->remove_keys as $remove_key) {             $key = array_search($remove_key, $menu_value);             if ($key) {                 unset($menu[$menu_key]);             }                 }     }  }   }


I have a taxonomy called "location". I'm outputting a comma separated list of these taxonomy terms for a post. This is fine, but I don't know how to split the second-to-last and last items with "and" instead of a comma.   Here is my code. Is there a way to do it using the counter maybe?  $locations = get_the_terms($post->ID, 'location');  $locations = array_values($locations); for($cat_count=0; $cat_count<count($locations); $cat_count++) {    echo $locations[$cat_count]->name;    if ($cat_count<count($locations)-1){     echo ', ';   }  }   Note: This code is in the sidebar for a category archive template and inside a WP_Query, so it's all within the loop. The WP_Query is outputting multiple posts of a custom post type called Projects and I'm trying to list the location tax terms for each one.

foreach((get_the_category()) as $category) {     echo $category->cat_name . ', ';  }   So I'm echoing it like this because I don't want the categories to appear as hyperlinks, I just want the cat names.  The problem is I can't get rid of the last separator so it ends up like : category, category, category,  I tried 'stripping' it (php seriously confuses me small design mind)  foreach((get_the_category()) as $category) {     echo $category->cat_name . ', ';     echo rtrim($category, ", "); }   That didn't trim it though.


I'm looking for a good algorithm (meaning minimal computation, minimal storage requirements) to estimate the median of a data set that is too large to store, such that each value can only be read once (unless you explicitly store that value). There are no bounds on the data that can be assumed.  Approximations are fine, as long as the accuracy is known.  Any pointers?

I want to estimate the quantile of some data. The data are so huge that they can not be accommodated in the memory. And data are not static, new data keep coming. Does anyone know any algorithm to monitor the quantiles of the data observed so far with very limited memory and computation? I find  useful, but it does not work very well for my data, which are extremely heavy-tailed distributed.


Is there a continuous function such that $\int_0^{\infty} f(x)dx$ converges, yet $\lim_{x\rightarrow \infty}f(x) \ne 0$?  I know there are such functions, but I just can't think of any example.

Let $f: [1, \infty) \to \mathbb{R}$ be a continuous function such that the improper integral $$\int_1^\infty f(x) \ dx$$ exists. Show or disprove that $\lim \limits _{x \to \infty} f(x) =0$.  Our professor said that there are counterexamples but after frying my brain out I still could not find any. It does sound logical.


was rejected because      This edit was intended to address the author of the post and makes no sense as an edit. It should have been written as a comment or an answer.   I've 8 reputation, can't post comments or answers. How should I share my solution?  Please note that I don't want more reputation, I want to share an improved solution. Is not my goal to earn reputation, my goal is to improve an answer so I've edited it. Original answer was starting point of my research so I've considered edition over comment or answer.

I have been reading Stack Exchange for years - mostly not logged in, and have never posted (this is my first). I'm simply not very talkative, and very good at googling.  Recently a few occasions have come up when I've wanted to comment on a question.  I wanted either to ask for, or provide, clarification which did not warrant a new answer.  How do I gain enough reputation to comment without:   asking questions which have already been answered or that I can figure out on my own, or posting my comment like as an answer (i.e. being  rude)?


function makeMultiplier(Multipler){     var myFun= function(x){         return x*Multipler;     };      return myFun; }  var MultiplyBy3= makeMultiplier(3); console.log(MultiplyBy3(10));    What value is passing in x? and how the output is 30?

How would you explain JavaScript closures to someone with a knowledge of the concepts they consist of (for example functions, variables and the like), but does not understand closures themselves?  I have seen  given on Wikipedia, but unfortunately it did not help.


when I try to fill an array with objects in a function, I always get an error even if the array is declared beforehand in the main function.  I'm also a beginner in OOP.  This is my Point class :  public class Point {     private int positionX;     private int positionY;      public Point(int positionX, int positionY) {         this.positionX = positionX;         this.positionY = positionY;     }      public int getPositionX() {         return positionX;     }      public void setPositionX(int positionX) {         this.positionX = positionX;     }      public int getPositionY() {         return positionY;     }      public void setPositionY(int positionY) {         this.positionY = positionY;     } }   And this is my Main class :  public class Main {      public static void setupPointArray(Point ptArr[]) {         ptArr = new Point[] {new Point(2, 3),                              new Point(4, 1),                              new Point(6, 2)};     }      public static void main(String[] args) {         Point pointArray[] = new Point[3];         setupPointArray(pointArray);          System.out.println(pointArray[0].getPositionX() + pointArray[0].getPositionY());         System.out.println(pointArray[1].getPositionX() + pointArray[1].getPositionY());         System.out.println(pointArray[2].getPositionX() + pointArray[2].getPositionY());     }  }   But I get an error in the console.  Exception in thread "main" java.lang.NullPointerException     at fr.antonin.point.Main.main(Main.java:15)

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?


Is there a short cut to determine the number of equivalence relations on the set $\{1,2,3,4\}$? I mean I could do that manually but for a larger set it becomes annoying. Is there a general way to partition it?

If a set has $n$ elements then what are maximum number of equivalence classes and equivalence relations possible on it?


Let $X_1,X_2,X_3,X_4$ be independent $N(0,1)$. Find the distribution of $Y= X_1X_2+X_3X_4$  I am having difficulty in solving this question or atleast how to approach it.

It is apparently the case that if $X_i \sim N(0,1)$, then  $X_1 X_2 + X_3 X_4 \sim \mathrm{Laplace(0,1)}$  I've seen papers on arbitrary quadratic forms, which always results in horrible non-central chi-squared expressions.  The above simple relationship does not seem at all obvious to me, so (if it is true!) does anyone have a simple proof of the above?


Prove that if $\lambda$ and $\mu$ are different eigenvalues of $f$ and $v$ and $w$ are eigenvectors asociated with them respectively, then $v + w$ is not an eigenvector of $f$.  What could be the statement to prove it?  Thanks in advance.

Let $V$ be a $k$-vector space and $f\in\text{End}(V)$. Assume that we have eigenvectors $v,w$ of $f$ for different eigenvalues and choose $a,b\in k\setminus\{0\}$. Claim. $av+bw$ is not an eigenvector of $f$.  Choose $\lambda,\mu$ eigenvalues for $v,w$. We get $$f(av+bw)=af(v)+bf(w)=a\lambda v+b\mu w .$$ If there is an $\alpha$ with $f(av+bw)=\alpha(av+bw)$ then we would get $$a\lambda v+b\mu w=\alpha av+\alpha bw\Rightarrow (\lambda -\alpha)av+(\mu -\alpha)bw=0.$$ I think this won't help. Any other ideas?


I want to compress a folder with windows junctions inside and be able to restore it with the junctions as a junctions, 7z and RAR, they don't. Any idea? Thanks.

Windows 1803, 7z 18.05  Trying to archive and compress a folder structure with multiple NTFS junctions referencing parts of the said structure (i.e. no "outside" links) - any possibility to compress the structure without 7zip resolving the junctions, resulting in duplicates?   Preserving the junctions would be neat, archiving the junctions as empty folders would also be acceptable - but archive size has absolute priority.  Choosing tar or wim as format has options about NTFS symlinks, but doesn't seem to involve compression (only store is presented as compression level) - I'd have to compress afterwards, which seems an unnecessary intermediate step.  I could delete the junctions before archiving, but I'd rather not to, if possible.


Do I, as a user, receive any form of repercussion when getting rejected suggested edits?   No Yes, after n number of declined suggested edits, I will not able to suggest edits for a while. ( Timeout ) Yes, after n number of declined suggested edits, I will get banned from suggesting edits. Yes, but something else.

As mentioned in , approval of an edit suggestion gives the suggester +2 reputation.  If the suggestion is rejected, does it cost the suggester any rep?


I have a list. For example: [1, 2, 3, 4] The result I would like to have is: [1, 2], [1, 3], [1, 4], [2, 3], [2, 4], [3, 4]. So I would calculate all the possible couple (the order isn't important) with no equal elements. I did this: result = []     for first_elem in my_list:         for second_elem in my_list:             if first_elem!=second_elem:                 c = [first_elem,second_elem]                 result.append(c)     return result  Is there a method to do this more efficient(here we have about n^2) without using libraries? Thanks  didn't answer my question.

I have a list with 15 numbers in, and I need to write some code that produces all 32,768 combinations of those numbers.   I've found  (by Googling) that apparently does what I'm looking for, but I found the code fairly opaque and am wary of using it. Plus I have a feeling there must be a more elegant solution.  The only thing that occurs to me would be to just loop through the decimal integers 1–32768 and convert those to binary, and use the binary representation as a filter to pick out the appropriate numbers.   Does anyone know of a better way? Using map(), maybe?


We intend to play Terraria 1.3 without having any routers or modems.. I've been told that we can make an Ad-Hoc Network to play, and so we did, we both connected to one, but it didn't work for us, as my friend wasn't sure what IP to join.  We also have an impractically long ethernet cable that we can plug into both computers, but that didn't seem to do anything...

I often create a wireless ad-hoc network on my laptop running Windows 7. Now I'd like to connect to it using standard HTTP from my . I've tried 192.168.1.1 and that doesn't work. What should the address be so I can connect?


I told my friend, today I went for shopping. He replied me “Good for You”. Is it rude or normal?

I am not sure if this is the right place, but I was wondering if "good for you" and "I am happy for you" have a negative or positive connotation.


I've been getting weird patterns on my viewport render which i am trying to get rid off. i don't know why they appear in the first place,but i tried everything to remove them but all in vein.  i've also recalculated the normals but that too didn't work.  it appears that it looks fine in a render,but when i see it in viewport, i see those patterns again.strange. This one is a viewport render:  The bottom one is the final render.

I was following  on creating a watch and noticed that when I rendered the watch, some pieces were messed up.  I'm new to 3D modeling and I've just learned Blender, I can't explain it well, so here's a picture:    Other examples:     I don't know if it's a problem with my World texture, the object, or the object's texture/material, so I can't even guess how to fix it. What causes this? Is it possible to fix it?


Then System: Ubuntu 16.04 I have 4 workspaces and in each of them one Firefox window and a Terminal. With Ubuntu 16.04 I could switch between them with Alt + Tab and it would always take the application in the current workspace. Only if I hovered over let's say the Terminal, it showed the other Terminals from the other workspaces and I was able to take a different one. Now System: Ubuntu 18.04.1 If I select the Terminal in W1, then switch to W2, select Firefox in W2 and then press Alt + Tab it brings me back to the Terminal in W1. Same goes for the icons in the Favorite bar. If I press them it only opens up all the possibilities as previews (and they are sometimes not that easy to distinguish). In Ubuntu 16.04 a click on the icon would open the application of the current workspace and a second click opens the 4 possibilities. Questions Is it possible that a switch with Alt + Tab opens the application from the current workplace instead of the last selected one? Is it possible that a click on the icons opens the application from the current workplace instead of a preview from all? Even a solution that would show the workspace of each preview would help me, atm there is no further information than the preview... (For example in my current view the first Terminal corresponds to the 3rd Workplace)

I am looking for a clean and fast method to force GNOME in Ubuntu 14.04 to switch between active apps only on the current workspace when pressing the shortcut alt + tab.


An arithmetic progression in $\mathbb{Z}$ is a set  $A_a,_b=\bigg\{\dots,a-2b,a-b,a,a+b,\dots\bigg\}$ with $a,b\in\mathbb{Z}$ and $b\neq0.$ prove that the collection of arithmetic progressions   $B=\bigg\{A_a,_b|a,b\in\mathbb{Z}\ and\ b\neq0\bigg\}$ is a basis for topology on $\mathbb{Z}$  any hint

I'm being asked to prove that $\mathcal{A}=\left\lbrace A_{a,b}:a,b\in\mathbb{Z}\right\rbrace$ is a basis for a topology on $\mathbb{Z}$, being: $$A_{a,b}=\left\lbrace a+nb:n\in\mathbb{Z}\right\rbrace=\left\lbrace ...,a-2b,a-b,a,a+b,a+2b,...\right\rbrace$$  Obviously every $a\in \mathbb{Z}$ belongs to a basis element, for example $A_{a,b}$, for any $b$. I'm having difficulties though, proving that if two of those sets $A_{a,b}$ and $A_{a',b'}$ share an element $x$, then there exists another $A_{c,d}$, such that $x\in A_{c,d}$ and $A_{c,d}\subset A_{a,b},A_{a',b'}$. Any hint?


My husband and I recently did AncestryDNA. He came back with a DNA match (shared with his mother) that simply says "close relative". He has no idea who this person is, and his mother claims she's never heard of him. The person in question does not have a tree, and it appears they haven't logged on to Ancestry for more than a year, so I don't hold out hope for an answer to messages. That said, any ideas on possible relationship? I am new to DNA testing and interpretation of its results.

Given two tests that share some cM of autosomal DNA, how can I easily find the predicted relationships that such shared cM would suggest? For example, a 2,200 cM match suggests it could be either: grandparent, half-sibling, or grandchild.


I get this message:     It looks like you might need a break - take a breather and come back   soon!       You've asked 4 questions recently, some of which have not been   received very well by the community. Everyone learns at their own   pace, and it’s okay to make some mistakes. However, the reception your   questions have received thus far might ultimately block your account   from asking questions entirely.       It's been 4 days since you asked your last question. We ask that you   wait 2 days before asking again. Use this time to revisit your   previous questions, editing to address any issues that folks have   pointed out in comments.       Recommended reading:          tips on asking great questions as well as our guidance on    which questions are allowed here          Additional advice          Examining highly-scored questions in the tags that interest you is a great way to study how to ask better questions, that also get better   answers much sooner!    We don’t demand perfection, but please make sure you use proper grammar, spelling and capitalization, it really helps!    Improve downvoted questions rather than deleting them.    Do not delete your account, create new accounts, or otherwise attempt to circumvent these restrictions.    Do not contact us regarding these restrictions, they cannot be lifted.          Failure to heed this advice may increase the severity of these   restrictions.       For more information       See: Why won’t the system allow me to ask questions for several days?       It sometimes takes a few attempts at a good question in order to fully   learn how our system works, and what the community expects from folks   seeking answers. Just do your best to make sure you've improved the   quality of your existing questions, and we'll see you in 2 days!   It's clear the system doesn't want me here. Is there an appeal process? Is there a proxy service for asking questions so other people can take some of the heat? I didn't do anything wrong.     This question may already have an answer here:      What can I do when getting “We are no longer accepting   questions/answers from this account”? 1 answer No, my question is   different. I will edit to explain how.   I explain why it is different in the comments to this question.

When you think of Q&A sites, you think of a place where you come to get answers to your questions. But, where do those answers come from? What doesn't immediately stand out for many folks is that it's not our software that's giving them answers, it's other people that are taking the time to share what they know. Our engine is a vehicle that you use to arrive at an answer to your question, and vehicles are things that takes a bit of time to learn how to use.  If you have a driver's license, you probably went through some kind of program where someone else taught you how to operate a car properly. It was most likely a special kind of car, where the instructor had a brake pedal just in case someone had to slam on the brakes and you weren't doing it. After all, things go bad when you don't hit the brakes in time, especially when you're going too fast.    A while back, we  when it comes to asking questions. The single most common mistake that folks were making was in fact going way too fast; some would ask three or even five questions initially and none of them did well. The system didn't have that extra brake pedal and many users sped, you guessed it, .  We did what we always do, research:    Turns out, slowing folks down just a little when it looks like they're getting off on the wrong foot is the most effective way to help potentially great users become great users. We don't go from 100 km/h straight into a wall any longer, . Additional just-in-time help (triggered while writing a question) is in the works.   New users who aren't doing so well initially will be shown the additional guidance and will be asked to wait anywhere from one to seven days before asking their next question, depending on how they've done recently.   The system is also pretty smart, and takes the following things into consideration:   How many substantive edits you've made to your own posts recently How many good answers you've written recently How long you tend to wait between asking questions   The more acclimated you become, the sooner the system will get out of your way entirely. Yes, it is still possible to encounter a much longer-term block on some larger sites, but you'd need to ignore a lot of help before hitting it.  Testing on Stack Overflow and several other large sites has gone very well, so we've enabled this throughout the network. Most users on smaller sites probably won't see these kick in, and that's fine - but they're in place for those that can really benefit from them, just like those brave souls that teach folks how to drive.  This feature came out of the SE Quality Project ( | ) and is one of several initiatives we're putting in place to help maintain the overall quality of our sites while providing new users with a better experience.


I came across a "brain teaser" which goes like this:     Bruna was first to arrive at a 100 seat theatre. She forgot her seat   number and picks a random seat for herself.      After this, every single person who get to the theatre sits on his   seat if its available else chooses any available seat at random.   Neymar is last to enter the theatre and 99 seats were occupied.      What's the probability what Neymar gets to sit in his own seat?   The solution was $1/2$, their reasoning being that there are two possibilities, Neymar either gets his seat or not. This seems very flawed thinking to me because nothing says the two possibilities have equal probability.  I calculated it as $1/100 + 1/99$, but I think this is still wrong.  My reasoning was there are two scenarios which result in Neymar's seat being available, either:   Bruna sits in the right seat in which case everyone also sits in their correct seat, this has a $1/100$ chance; or, Bruna sits in the wrong seat and there's a $98/99$ chance it is not Neymar's seat, then the next person has a $97/98$ chance of not sitting in Neymar's seat, and so on. Which gives $98!/99!$ or $1/99$.   My confusion lies in the fact that the subsequent people in the second scenario do not always take their seat at random, they only select a random seat if their seat is occupied.  How would I go about solving something like this?

This is a neat little problem that I was discussing today with my lab group out at lunch. Not particularly difficult but interesting implications nonetheless  Imagine there are a 100 people in line to board a plane that seats 100. The first person in line realizes he lost his boarding pass so when he boards he decides to take a random seat instead. Every person that boards the plane after him will either take their "proper" seat, or if that seat is taken, a random seat instead.  Question: What is the probability that the last person that boards will end up in his/her proper seat.  Moreover, and this is the part I'm still pondering about. Can you think of a physical system that would follow this combinatorial statistics? Maybe a spin wave function in a crystal etc...


I have a map available in specific coordinates (2D) in AutoCAD 2017.   How do I import it into QGIS 3.8.3/Google Earth for data analysis?

What is a method for importing/exporting DXF files with QGIS? I work in an engineering field and we use CAD and specialist design programs, and often go through several iterations during a project. I am having trouble interchanging data between QGIS and DXF formats.  I export several layers from QGIS in DXF format and load them into cad.  Essentially I xref the exported DXF files into CAD, and then draw over the top of them in CAD, as I find it quicker and more accurate.  The files line up OK, but need to be scaled and transformed to match the coordinates in QGIS.  I then detach the xref's, save the new DXF with line work on a single layer.  The DXF file coordinates match the QGIS coordinates. I can't seem to get the new DXF to import back into QGIS.  I would like to be able to export and import a particular data table several times as the project develops. Screenshot 1 - I exported the pink polygons and edited them in CAD.  I then imported the DXF file back in but nothing came in - see "entities".  Screenshot 2 - Attribute table of imported layer.


I'm trying to get the current time from OS X command line to work with in AppleScript to output the elapsed time.  Currently I'm using this script:  set timea to do shell script "date +%s" ##something is executed set timeb to do shell script "date +%s" set runningtime to timeb - timea   But it is too unprecised, so I'm looking for a way how to get the elapsed precisely with milliseconds or somethin.  Thanks. :)

How do I get the time since the epoch, in milliseconds, in the OSX terminal?  The Linux/Ubuntu equivalent is date +%s.%N:  Linux $ date +%s.%N 1403377762.035521859   Which does not work in my OSX terminal:  OSX $ date +%s.%N 1403377800.N


I am trying to find a mistake in my reasoning or calculations.   I have $$f(x)= x^4 + x^3 +6x^2 +x +1 \text{ and }  g(x)= x^4 + 9x^3 + 6x^2 + x +3\\ \text{over the field } \mathbb{Z}_{11}.$$  My calculations are  $$ f(x)=g(x)+3x^3 +6x +9\\ g(x)=(x^3+2x+3)(x+9) + 4x^2 +2x +9\\ x^3+2x+3 = (4x^2+2x+9)(3x+4) + 0 $$ resulting into $\gcd(f(x),g(x))=4x^2+2x+9$.  Yet an online calculator gives a different result $x^2+6x+5$ and I don't know what goes wrong.

I need to find the gcd of two polynomials: $f(x) = x^4+1$ and $g(x)=x^2-1$ using the Euclidean algorithm.  Wolfram shows that the gcd is equal to $1$, but for some reason I don't get the same answer.   First I divided $f(x)$ by $g(x)$ and got that the remainder is $2$. Then, I divided $g(x)$ by the remainder, $2$, and got a remainder of zero, hence concluding that the gcd is $2$.   What am I doing wrong?


In article  by Alex Allain, I read:      Notice, by the way, that holding on to a const reference to a   temporary object ensures that the temporary object isn't immediately   destructed. This is a nice guarantee of C++, but it is still a   temporary object, so you don't want to modify it.   Of course I know that a const reference is not, nor behaves like, a shared_ptr (which one would hope, reading "holding on [...] the temporary object isn't immediately destructed"), but I wasn't able to find any more reference. So the question is: How is this addressed in the standard?

Does C++ provide a guarantee for the lifetime of a temporary variable that is created within a function call but not used as a parameter?  Here's an example class:  class StringBuffer { public:     StringBuffer(std::string & str) : m_str(str)     {         m_buffer.push_back(0);     }     ~StringBuffer()     {         m_str = &m_buffer[0];     }     char * Size(int maxlength)     {         m_buffer.resize(maxlength + 1, 0);         return &m_buffer[0];     } private:     std::string & m_str;     std::vector<char> m_buffer; };   And here's how you would use it:  // this is from a crusty old API that can't be changed void GetString(char * str, int maxlength);  std::string mystring; GetString(StringBuffer(mystring).Size(MAXLEN), MAXLEN);   When will the destructor for the temporary StringBuffer object get called?  Is it:   Before the call to GetString? After GetString returns? Compiler dependent?   I know that C++ guarantees that a local temporary variable will be valid as long as there's a reference to it - does this apply to parent objects when there's a reference to a member variable?  Thanks.


Not sure what might have triggered this but I have noticed that while using the command prompt in windows 10 I am unable to change the drive using the cd command for any of the drive letters other than C:. I have also noticed that the autocomplete function works just fine when trying to change directory into a specific folder from the target drive but the change in the directory just doesn't happen. Screenshots of the Disk Management tool and actual cmd prompt commands will follow:   This behavior does not apply to PowerShell so I can successfully change the drives.

This may be a silly question, and I think I have looked elsewhere to find the answer...  Might be a path issue, but when I open the command line and type from the C:\>: cd D:\  I cannot get to the D drive.  Even if I type: cd D:\<folder name>  The command.exe will auto-complete the line with the tab key, so it knows where I'm at.  It just doesn't print to screen the result or actually get me there.  This problem exists for the network drives as well. Now, if I use the chdir (cd) command like this: chdir D: or cd d: I get the print out of the D:\ below the command but it still says I'm in the C:\. I feel like I'm missing something simple.


If $y(t)$ is continuously differentiable for all $t\in\mathbb{R}$ and $y' \leq 1-y^2$ then $|y| \leq 1$.  I'm trying to prove this, and it feels like a question that can be proven with the comparison theorem for differential equations.  So taking $x' = 1-x^2$ we immediately get that the functions $x(t)=1$ and $x(t)=-1$ solve this equation, which seems indeed strongly related to what we need to prove.  Now, from Ricatti, we can take a general solution $x=1+u$, and solve it. I derived $$x=\frac{2ce^{2t}+1}{2ce^{2t}-1}$$ Not sure how to continue from here. Even if I get a solution this only compares one side of $y$, and I want to compare both of them. Also, there isn't any initial conditions which I understand is necessary for the comparison theorem.  I also believe that the solution uniqueness theorem can be applied here in some way but I'm not sure about it.  Thanks!

Let $f:\mathbb{R}\to\mathbb{R}$ be a function which is continuously differentiable.  Suppose that $\forall t\in\mathbb{R}$ it holds  $$f'(t)\leq 1-f(t)^2$$ Prove that $\forall t\in\mathbb{R}:|f(t)|\leq 1$.  I know about some comparison theorems, i.e. if we have a solution (in a compact domain) of the Riccati equation $\dot{x}(t)=1-x(t)^2$, with the same initial value as of $f$, then in this domain we get that $f\leq x$. My problem is that it only gives an upper bound and not a lower bound.


Using the below JS method for the custom sorting to work on a lightning data table. The same works perfectly in aura frame work. I suspect key() doesn't work in lwc. Documentation didn't help much. Can someone suggest what's going wrong with below piece.  updateColumnSorting(event) {     var fieldName = event.detail.fieldName;     var sortDirection = event.detail.sortDirection;     this.sortedBy = fieldName;     this.sortedDirection = sortDirection;     var reverse = sortDirection !== 'asc';     var dataToSort = this.data;     dataToSort.sort(this.sortBy(fieldName, reverse));     this.data = dataToSort; }  sortBy(field, reverse, primer) {     var key = primer ?             function(x) {return primer(x.hasOwnProperty(field) ? (typeof x[field] === 'text' ? x[field].toLowerCase() : x[field]) : 'aaa')} :             function(x) {return x.hasOwnProperty(field) ? (typeof x[field] === 'text' ? x[field].toLowerCase() : x[field]) : 'aaa'};         reverse = !reverse ? 1 : -1;         return function (a, b) {                         return a = key(a), b = key(b), reverse * ((a > b) - (b > a));         }  }   Error LOG     [NoErrorObjectAvailable] Script error.   newHandler()@   {anonymous}()@   vo.dispatchEvent()@   vo.fireSortedColumnChange()@ vo.handleUpdateColumnSort()@

Am not doing anything fancy, just trying to update a field on Contact in JS of LWC but getting this exception.  Uncaught TypeError: 'set' on proxy: trap returned falsish for property 'Name' throws at mydomain/auraFW/javascript/mhontaYdOya4Y_lBu7v9yg/aura_prod.js:2:27687  HTML Code:   <template>      <template if:true={wiredContact}>          {wiredContact.Name}          <lightning-input value={wiredContact.Name} onchange={updateName}></lightning-input>     </template>  </template>   JS:   import { LightningElement ,wire,track,api } from 'lwc'; import myContact from "@salesforce/apex/ContactController.fetchContact";  export default class Myrefreshapextest extends LightningElement {    @track wiredContact;   @wire (myContact)         fetchedContact({error, data}){             if(data){                 console.log(JSON.stringify(data));                 this.wiredContact = data;             }else if (error){                 console.log(error);             }     }      updateName (event){         console.log(JSON.stringify(event.detail.value));         console.log(JSON.stringify(this.wiredContact));         this.wiredContact.Name = event.detail.value;     }  }   Apex:  public class ContactController {      @AuraEnabled(cacheable=true)     public static Contact fetchContact(){         return [SELECT Id,Name FROM COntact LIMIT  1];     } }   On top of my head, am not doing anything wrong, anyone has idea what's wrong with my code?  When I print console.log(JSON.stringify(this.wiredContact)); I get old values so am pretty sure it exists.  I tried with @track and @api, but same response. Can anyone shed some light?


Got Ubuntu 20.04 LTS for development needs, but In Jetbrains Rider i am not able to use  CTRL+ALT+SHIFT+[RIGHT|LEFT] shortcut for code rearranging. Tried to find the shortcut in settings -> keyboard shorcuts but failed. Any advice to work it out?

In Ubuntu 18.04 I'm not able to assign Ctrl+Alt+← or Ctrl+Alt+→ to anything. To be precise I may bind it to something, but it doesn't work when using the keyboard combination, up/down arrows do however work.   .  The strange thing is that the system detects the keyboard combinations when assigning a key, but not when trying to use them. As a result the keyboard combinations don't work in any other programs either.


How do I create a composite foreign key to a table with a single primary key? For example suppose I have the following tables:  CREATE TABLE Branches (     BranchId UniqueIdentifier DEFAULT NewSequentialID(),      CONSTRAINT pk_BranchId PRIMARY KEY (BranchId) );  CREATE TABLE Expectations (     ExpectationId UniqueIdentifier DEFAULT NewSequentialID(),      BranchId UniqueIdentifier NOT NULL,       CONSTRAINT fk_Expectations_BranchId FOREIGN KEY (BranchId) REFERENCES Branches(BranchId),      CONSTRAINT pk_ExpectationId PRIMARY KEY (ExpectationId) );  CREATE TABLE ClassSections (     ClassId UniqueIdentifier NOT NULL,     BranchId UniqueIdentifier NOT NULL,       CONSTRAINT fk_ClassSections_ClassId FOREIGN KEY (ClassId) REFERENCES Classes(ClassId),      CONSTRAINT fk_ClassSections_BranchId FOREIGN KEY (BranchId) REFERENCES Branches(BranchId),      CONSTRAINT pk_ClassSections PRIMARY KEY (ClassID, BranchId) );  CREATE TABLE ClassExpectations (     ClassId UniqueIdentifier NOT NULL,      BranchId UniqueIdentifier NOT NULL,      ExpectationId UniqueIdentifier NOT NULL,       CONSTRAINT fk_ClassExpectations_ClassId FOREIGN KEY (ClassId) REFERENCES Classes(ClassId),      CONSTRAINT fk_ClassExpectations_BranchId FOREIGN KEY (BranchId) REFERENCES Branches(BranchId),      CONSTRAINT fk_ClassExpectations_ExpectationId FOREIGN KEY (ExpectationId) REFERENCES Expectations(ExpectationId),      CONSTRAINT fk_ClassExpectations_ExpectationIdBranchId FOREIGN KEY (ExpectationId, BranchId) REFERENCES Expectations(ExpectationId, BranchId),      CONSTRAINT pk_ClassDueDates PRIMARY KEY (ClassId, ExpectationId) );   I'm trying to add the following constraint, but it won't allow me:  ALTER TABLE ClassExpectations ADD CONSTRAINT fk_ClassExpectations_ExpectationIdBranchId FOREIGN KEY (ExpectationId, BranchId) REFERENCES Expectations(ExpectationId, BranchId);   I keep getting the error:      There are no primary or candidate keys in the referenced table   'Expectations' that match the referencing column list in the foreign   key   How else do I ensure that an ExpectationId is never added to ClassExpectations without its corresponding BranchId (from the Expectations table)?

I have an entity that cannot exist without being defined by another, and I want this entity to participate in a many-to-many relationship.  Example: An artist has an album (the album cannot exist without an artist), the album also has many tracks, but the same track can exist in many albums.  So we have a many-to-many relationship between the album and the tracks.  If the album is a weak entity, then its primary key is a foreign key referencing the artist, thus it cannot be a foreign key to another table representing a many-to-many relationship.  The question is: is it possible to have this kind of relationship in SQL, and if so, how do I express it?


Suppose I have:  storage = [9,8,7,6,5,4,3,2,1,1]   I want to store these elements in some other list such as the first position of that list contains first three elements of storage, second contains next three, third contains next three and so on and so forth.  Actually I have 4891695 elements in a list. I want to store first 2000 at 1st position, next 2000 at second position and so on and so forth.

I have a list of arbitrary length, and I need to split it up into equal size chunks and operate on it. There are some obvious ways to do this, like keeping a counter and two lists, and when the second list fills up, add it to the first list and empty the second list for the next round of data, but this is potentially extremely expensive.  I was wondering if anyone had a good solution to this for lists of any length, e.g. using generators.  I was looking for something useful in itertools but I couldn't find anything obviously useful. Might've missed it, though.  Related question:


This is My Code:  int main() {     int i=2,j=2,c=2,d;      d= ++i || ++j && c;     printf("I is %d\n",i);     printf("J is %d\n",j);     printf("C is %d\n",c);     printf("D is %d\n",d);     return 0; }   The output of the following code is:  i is 3                                                                                j is 2                                                                                c is 2                                                                                d is 1   Now my question is, if ++i is 3 then why ++j is 2?  What is the difference between ++i & i++? Also I want to know that how come d is 1 ?

In C, what is the difference between using ++i and i++, and which should be used in the incrementation block of a for loop?


Something very odd is happening here.   I have a query that looks like this.  SELECT CAST(FT.DOP AS SMALLINT) FROM TRACKING_DATA WHERE date > @mydate and identifier = 0000000000   When run as a raw query it returns data just fine.  When i place it in a stored procedure that alters the where clause it throws this error.  Msg 244, Level 16, State 2, Procedure myprocedure, Line 107 [Batch Start Line 2] The conversion of the varchar value '58629' overflowed an INT2 column. Use a larger integer column.   So here is the oddity. I go through all the possible data for that where clause with a query like this.  SELECT DISTINCT DOP FROM TRACKING_DATA where identifier = 000000000000   and  SELECT DISTINCT CAST(DOP AS smallint) FROM TRACKING_DATA where identifier = 000000000000   And this is what i get back.  17 12 9 19 8 14 6 16 11 13 7 10 0 18 5 15 4   Nowhere does it have anything remotely too large for a SMALLINT. So i thought, ok maybe its a non-printable ASCII character. But i can't find any.  I'm a little perplexed at the moment. It runs find as a raw query, explodes as a procedure and all possible data based on the where is valid. My only suspicion is that the query plan is doing something odd with filtering or maybe runs with different validation when run as a procedure.

I have a query to insert data from one table into another. One of the source columns is larger than the destination table's, although the actual data selected in the query isn't. So e.g. the source table is varchar(25), the destination table is varchar(10), and the query selects records that do not exceed 10 characters for that specific column.  My initial query failed with a truncation error, but when I rewrote it selecting the same records but changing the where clause i.e. to use WHERE IN and filtering on a cte it ran successfully.  i.e instead of doing  select * from tbl where col1 = 1   I did:  with cte as (select 1) select * from tbl where col1 in (select 1 from cte)   I understand that this is a bug in SQL Server, still I am wondering at which point does SQL Server validate the data for insertion. At which point is the error thrown?


In Main app, When I execute another app, Occur NullPointerException.  this logcat here   java.lang.RuntimeException: Unable to start activity ComponentInfo{kr.co.iosystem.blackeyeonandroid/kr.co.iosystem.blackeyeonandroid.BlackEyeActivity}:  java.lang.NullPointerException android.app.ActivityThread.performLaunchActivity(ActivityThread.java:2184) android.app.ActivityThread.handleLaunchActivity(ActivityThread.java:2233) android.app.ActivityThread.access$800(ActivityThread.java:135) android.app.ActivityThread$H.handleMessage(ActivityThread.java:1196) android.os.Handler.dispatchMessage(Handler.java:102) android.os.Looper.loop(Looper.java:136) android.app.ActivityThread.main(ActivityThread.java:5001) java.lang.reflect.Method.invokeNative(Native Method) java.lang.reflect.Method.invoke(Method.java:515) com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:785) com.android.internal.os.ZygoteInit.main(ZygoteInit.java:601) dalvik.system.NativeStart.main(Native Method)  Caused by: java.lang.NullPointerException android.app.Instrumentation.execStartActivity(Instrumentation.java:1417) android.app.Activity.startActivityForResult(Activity.java:3424) android.app.Activity.startActivityForResult(Activity.java:3385) android.app.Activity.startActivity(Activity.java:3627) android.app.Activity.startActivity(Activity.java:3595) kr.co.iosystem.blackeyeonandroid.BlackEyeActivity.netCheckAutoUpdate(BlackEyeActivity.java:479) kr.co.iosystem.blackeyeonandroid.BlackEyeActivity.onCreate(BlackEyeActivity.java:147) android.app.Activity.performCreate(Activity.java:5231) android.app.Instrumentation.callActivityOnCreate(Instrumentation.java:1087) android.app.ActivityThread.performLaunchActivity(ActivityThread.java:2148) E/AndroidRuntime( 2678):     ... 11 more   and My code.  protected static Context mainContext =null;  @Override    protected void onCreate(final Bundle savedInstanceState) { super.onCreate(savedInstanceState);  setContentView(R.layout.activity_main); netCheckAutoUpdate();   //NullPointerException  }    public void netCheckAutoUpdate() { ConnectivityManager connectivityManager = (ConnectivityManager)   this.getSystemService(Context.CONNECTIVITY_SERVICE); NetworkInfo ethernet = connectivityManager.getNetworkInfo(ConnectivityManager.TYPE_ETHERNET); NetworkInfo wifi = connectivityManager.getNetworkInfo(ConnectivityManager.TYPE_WIFI);  if (wifi.isConnected()) {         Intent intent = mainContext.getPackageManager().getLaunchIntentForPackage("package name");         startActivity(intent);    //NullPointerException  } else if (ethernet.isConnected()) {         Intent intent = mainContext.getPackageManager().getLaunchIntentForPackage("package name");         startActivity(intent);     //NullPointerException   } else {         Intent intent = mainContext.getPackageManager().getLaunchIntentForPackage("package name");         startActivity(intent);    //NullPointerException   } }   perhaps, I must use null check?  if this correct, how use null check?   mainContext is global variable   when I connect wifi. occur NullPointerException    this part     NetworkInfo wifi = connectivityManager.getNetworkInfo(ConnectivityManager.TYPE_WIFI);    if (wifi.isConnected()) {         Intent intent =         mainContext.getPackageManager().getLaunchIntentForPackage("kr.co.iosystem.be_update");         startActivity(intent);    }   in other word,    `startActivity(intent)` here occur NullPointerException.   I proper permission from manifest.  <uses-permission android:name="android.permission.ACCESS_NETWORK_STATE"/> <uses-permission android:name="android.permission.ACCESS_WIFI_STATE"/> <uses-permission android:name="android.permission.CHANGE_NETWORK_STATE"/> <uses-permission android:name="android.permission.CHANGE_WIFI_STATE"/>

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?


I've used code that store commands (in jQuery Terminal) that need to be executed as JSON array in hash. with code like this:  function exec_hash() {     if (location.hash) {         var commands;         try {             commands = $.parseJSON(location.hash.replace(/^#/, ''));             $.each(commands, function(i, command) {                 try {                     terminal.exec(command);                 } catch(e) {                     var cmd = $.terminal.escape_brackets(command);                     var msg = "Error while exec with command " + cmd;                     terminal.error(msg).error(e.stack);                 }             });         } catch (e) {             //invalid json - ignore         }     } }   And i had this idea to store entire terminal session in hash, so my question is how long url hash can be?

What is the maximum length of a URL in different browsers? Does it differ among browsers? Is a maximum URL length part of the HTTP specification?


I keep getting the following message and am new to Ubuntu. Not sure how to increase the space in boot volume from other partition.  The volume "boot" has only 2.8 mb disk space remaining  it also suggests "you can free up disk space by removing unused programs or files, or by moving files to another disk or partition"  can someone help?  Thanks

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.


Something strange happened with my 4tb seagate external hard drive. It wouldnt power on so I took the drive out of the usb case and connected it to my computer. Then it shows up as: Partition 1 - Raw (465gb) Partition 2 - unallocated (1582gb) Partition 3 - unallocated (1678gb) I'm wondering is there a way to fix this?

What steps can I take to try to recover lost or inaccessible data from any storage device?  Answers:   This applies to any computer storage device, e.g. internal/external hard drives, USB sticks, flash memory. The most important thing is to STOP using it, any type of I/O can ruin your chances of a recovery.     We have separate questions covering common problems with USB flash drives in greater detail:


My credit card online account allows me to download my transaction history only in quicken or quickbook format. How can I read them under Ubuntu? Thanks.

I've just installed Ubuntu to replace Windows. I can't seem to find a good alternative to  to run on Ubuntu. Any help would be appreciated.


I have the following theorem:  If no prime less than or equal to $\sqrt{n}$ divides $n$, then $n$ is a prime.  And the following proof (proof by contradiction) for said theorem:  Suppose that no prime less than or equal to $\sqrt{n}$ divides $n$ but $n = ab$, with neither $a$ nor $b$ equal to $1$. Now $a$ and $b$ cannot both be strictly larger than $\sqrt{n}$ or their product would be larger than $n$. So one of $a$ or $b$ is not larger than $\sqrt{n}$: assume (without loss of generality) that $a \le \sqrt{n}$. Now $a$ cannot be prime (as we have assumed $n$ has no prime factor this small), and so is composite. Therefore $a$ has a prime factor $p$, which must be less than $a$. But then $p < a \le \sqrt{n}$ is a prime factor of $n$, and this contradicts our hypothesis. Hence $n$ is prime.  We deduce that $a$ is composite. But why does this then mean that $a$ has a prime factor $p$? So this is saying that all composite numbers have a prime factor? Why? I would greatly appreciate it if people could please take the time to clarify this. PostScript: I am assuming that  is the definition of composite number being used here.

Why do we use only square root approach to find a number is prime or not? why not cube root & 4rth root?


Here is my code:  \documentclass{amsart}  \usepackage{hyperref}   \usepackage[svgnames]{xcolor}  \hypersetup{%     colorlinks=true,     urlcolor=Blue }  \begin{document}       \url{https://math.stackexchange.com/questions/2893035/propositional-logic-notation-conversions-and-naming}      \url{https://www.google.de/search?ei=zcaPW8DmHMPLwQLm_6jgBw&q=table&oq=table&gs_l=psy-ab.3..0l10.28636.29973.0.30300.5.4.0.1.1.0.191.677.0j4.4.0....0...1c.1.64.psy-ab..0.5.674....0.UqDEfSRjRB0}   \end{document}   Why the second url correctly goes to next line correctly and the first url don't (goes beyond the horizontal margin of page)?

This question led to a new package:      I wish to typeset some relatively long URLs in a piece of text, and when I use \url{..}, the resulting text does not respect the margin boundaries that govern the main text body, instead going all the way to the edge of the paper before wrapping around.   For reference, my preamble looks like this:  \documentclass[12pt]{article} \usepackage{mathptmx} \usepackage{fullpage} \usepackage[pdftex]{hyperref}   and example of the url I'm including is:  \begin{itemize} \item Some text  \url{very-long-url} ... \end{itemize}   I'm compiling using pdflatex, although I doubt this makes a difference.


I know . Mainly to prevent spam and unhelpful comments by new users.  My issue is: When I come from other Stack Exchange sites and collected some reputation there, I am apparently not a bot and also know how SE works. But I have to start all over again, which is frustrating.  Example  I am currently trying to use Linux, so I created an account on Ask Ubuntu and the Linux Stack Exchange site. An answer that was posted there didn't work, and I wanted to ask for additional help, but I couldn't comment. Opening another question would probably lead to a duplicate. I am also bugged by the suggestion to go find some other questions and earn reputation first, since I need the help now.  So the only option left for me is to go to a forum and ask my question there, which I don't want to do, but I am implicitly urged to do that.  Suggestion  Unlock comment privilege for all sites either by getting it on one (or a specific amount of sites) or according to your global reputation, which would be the accumulated reputation amongst all SE sites, and require maybe 200 global rep.  What do you think?

I was just awarded +100 reputation on all of my Stack Exchange accounts.  What is this bonus for? It simply says "Association Bonus" on my reputation overview.  Also:   What privileges does the association bonus grant users? Can I lose the association bonus? Does it make my reputation 101 everywhere? Can I earn the association bonus on sites I haven't joined yet? Does it matter which site I earn the 200 reputation on? Will I get an association bonus every time my reputation on a site crosses 200 points? Does the association bonus allow me to answer protected questions? Does the association bonus count towards the reputation cap? Can I get the association bonus if I only have a profile on one site? What else is there to know about the association bonus?


I want to know what are wormholes, how they function and how they are formed. In understandable language, if possible.

Firstly, I understand that we have no observational evidence for 'wormholes'. They are theorised solutions to general relativity equations.  That said, if macroscopic wormholes do exist---how do they work? I've been thinking about this for the past couple of days, and I have some questions.   What does the mouth of a wormhole look like? I've seen ; is that more or less accurate? If I place one end of a wormhole in a high magnetic field, and the other end on my desk, will all my ferrous objects fly into the wormhole? If so, with what force? What does the magnetic field look like at each end of the wormhole? If the distance between the mouths of the wormhole was comparable to the force that the magnets exert, would the magnet 'pull' on itself and draw itself into the wormhole?   Do any of these questions even make sense?


I am using this exact example from trailhead   @RestResource(urlMapping='/Cases/*')     global with sharing class CaseManager {      @HttpGet        global static Case getCaseById() {        RestRequest request = RestContext.request;        // grab the caseId from the end of the URL        String caseId = request.requestURI.substring(        request.requestURI.lastIndexOf('/')+1);        Case result =  [SELECT CaseNumber,Subject,Status,Origin,Priority                     FROM Case                     WHERE Id = :caseId];        return result;       }   }   I used Workbench to invoke the GET HTTP method by following these exact steps   In Workbench, select GET. Enter the URI /services/apexrest/Cases/, replacing  with the ID of the record you created in the previous step. Click Execute.  This invocation calls the method associated with the GET HTTP method,  namely the getCaseById method. To view the response returned, click Show Raw Response.   So far so good, I see the raw JSON response as expected.   Now i want to give this endpoint to a third party, so that they can invoke this webservice from an external app, and get the response exactly as i got when executed from workbench.   My question is -    How do I authhenticate the call made by third party app?  Would the third party use the entire URI like     insead of just /services/apexrest/Cases/

I need to create lead records when a non-salesforce piece of software sends a POST request with data to my org. How is it done?


In the book class, footnote numbering restarts with each new chapter. Is there a way I can have all footnotes numbered sequentially regardless of which chapter they appear in?  MWE:  \documentclass{book} \title{The Book} \author{The Author} \begin{document} \maketitle  \chapter{Chapter One}  Here is some text.\footnote{And here is a footnote.}  \chapter{Chapter Two}  Here is some more text.\footnote{And here is another footnote.} \end{document}   The second footnote should carry the number "2," not the number "1."

I would like footnote numbering to continue over pages and chapters. In my document it's reset every chapter. I'm using the report documentclass.


I got 2 different raster layers one of them black and white representing the river road. This river raster has pixel values stand for height. I want to extend the size of river in order to show, if the water increases which areas would be under the water But i don't know how to extent, Also the areas outside of the river raster(transparent in the picture) has no data values. Pixel values in extended areas should have pixel values same as nearest river pixel value. I guess i have to do it with raster calculator. But i can not find out how to code this.

I am doing a project where we are attempting to determine how many more buildings would flood if the FEMA flood plain increased by 1',2' and 5'. I have the elev of the flood plain rasters from lidar data, but I am having trouble figuring out how much more area will be inundated by the rises I described earlier. I'm using raster calc and I have a buffer for the flood plain that also has elevation data. Any thoughts?


I'm having trouble proving that $\mathbb{Z}[\sqrt{6}]$ is a PID. I thought that the way to go would be to prove that it's a Euclidean Domain, but I got stuck there as well. Any suggestions on how to proceed?   I'm looking for a way to prove that it's a PID without having to prove that it's a Euclidean Domain

I'm attempting to modify the proof the $\mathbb{Z}[\sqrt{2}]$ is a Euclidean domain to prove a similar result for $\mathbb{Z}[\sqrt{6}]$. The idea is to prove that $\mathbb{Q}[\sqrt{6}]$ is Euclidean which will then give the result for  $\mathbb{Z}[\sqrt{6}]$. According to Dummit and Foote's Abstract Algebra this should have norm $d(a+b\sqrt{6})=|a^2-6b^2|$. The result for $\mathbb{Z}[\sqrt{2}]$ relies on the fact that for any element $x$ in $\mathbb{Q}[\sqrt{2}]$ there is an element $x'$ in $\mathbb{Z}[\sqrt{2}]$ with $d(x-x')<1$, which is then used to show that for $x=qy+r$ we have $$ d(r)=d(x-qy)=d\left(y\left(\frac{x}{y}-q\right)\right)=d(y)d\left(\frac{x}{y}-q\right)<d(y) $$ But in this case, I'm having a hard time showing that we can find an element with $d(x-x')<1$ for $x\in\mathbb{Q}[\sqrt{6}], x'\in\mathbb{Z}[\sqrt{6}]$. Consider $x=a+b\sqrt{6}\in\mathbb{Q}[\sqrt{6}]$. The furthest this element can be away from any $x'=a'+b'\sqrt{6}\in\mathbb{Z}[\sqrt{6}]$ is when $|a-a'|=\frac{1}{2}=|b-b'| \Rightarrow$ $$ d(x-x')=\left|\left(\frac{1}{2}\right)^2-6\left(\frac{1}{2}\right)^2\right|=\frac{5}{4}>1 $$ What can I do to get around this issue?


My internet connection was lost while I was updating my OS from 16.04 to 17.04 and the process stopped.There were 10-15 files remaining to be downloaded.  Now after realising that 17.04 is not a LTS version I don't wanna update my OS. But what about the downloaded files? Will they occupy any space in hard drive? Will they affect my current OS 16.04? Should I delete them? If yes than how can I find them and delete them?

I just installed a new version of Ubuntu and I want to roll it back to the previous version.  How can I do that? Is that even possible?


In the book "Beginning JavaScript" by Jeremy McPeak and Paul Wilton  there's a do-while loop example.   var userAge; do {    userAge = prompt("Please enter your age","") } while (isNaN(userAge) == true);   and below the author repeats one more time:     userAge = prompt ("Please enter your age","")   There's no semicolon at the end of the statement inside the do {} block.  As far as I can remember the author stated that it's considered best to always end any statement with a semicolon although it's not a must in most cases.   Was the omission of ; intentional? It seems so considering that in both the 4th and 5th editions there's no semicolon.  And there's also a repetition of that line below which doesn't contain a semicolon either.  Of course, one might say that it's not even a mistake. What I want to understand is whether the omission of a semicolon is more likely to be a typo or (which is worse) rather was done intentionally. If the latter is true, isn't that a sign of inconsistency?

In many situations, JavaScript parsers will insert semicolons for you if you leave them out. My question is, do you leave them out?  If you're unfamiliar with the rules, there's a description of semicolon insertion on the . Here's the key point:     If the first through the nth tokens of a JavaScript program form are grammatically valid but the first through the n+1st tokens are not and there is a line break between the nth tokens and the n+1st tokens, then the parser tries to parse the program again after inserting a virtual semicolon token between the nth and the n+1st tokens.   That description may be incomplete, because it doesn't explain @Dreas's example. Anybody have a link to the complete rules, or see why the example gets a semicolon? (I tried it in JScript.NET.)   is related, but only talks about a specific scenario.


I am able to detect how to get path of file which is in clipboard, but how can i detect a paste of file, Like  If i paste a file/folder in D drive, then java should detect as   D:\\Filename.jpg

I'd like to be notified when a file has been changed in the file system. I have found nothing but a thread that polls the lastModified File property and clearly this solution is not optimal.


I have a 20 amp breaker and 12 gauge wire running out to a shed that is wired with 14 gauge wire. The shed has 3 receptacle, 1 light switch and 1 light receptacle. Is this safe?

My refrigerator line is 20 amp with 12 gauge wire. Can I tap into that with 14/2 wire, and run a light switch and 1 LED light?


I would like to know what is the motivation behind the naming convention of the Weierstrass form of elliptic curves given as $$E:y^2+a_1xy+a_3y=x^3+a_2x^2+a_4x+a_6.$$  I can see that $a_1,a_2,a_3,a_4$ are named by sorting monomials by lex order with $x<y$. But why go from $a_5$ to $a_6$?

A long Weierstrass equation is an equation of the form  $$y^2+a_1xy+a_3y=x^3+a_2x^2+a_4x+a_6$$ Why are the coefficients named $a_1, a_2, a_3, a_4$ and $a_6$ in this manner, corresponding to $xy, x^2, y, x$ and $1$ respectively? Why is $a_5$ absent?


I have a Meizu M8 phone running android with Termux. I had set up ssh access to Termux over WiFi, but I want to be able to do that over USB because of possibly lower latency and higher speed. If I connect the phone to my macbook using USB, I can use adb to get shell or transfer files, so I think ssh over USB is possible. How can I achieve this?

I was wondering is there a way to run an android websever via usb? I can find lots of wifi version of this but I would like to use this locally only while the pc is connected to the wifi and have it undetectable. eg via usb.  Does anyone know of any apps/software that this would work on?  Thanks  Paul


This is from a lecture :  The adversary sees the message-tag pair(m,τ), where m= (m1,m2,...,mn)The adversary sees the message-tag pair(m′,τ′), where m′= (m′1,m′2,...,m′n)The adversary computes m''=(m1,...,mn,m′1⊕τ,m′2,...,m′n) The message-tag pair( m'',τ′)is a forgery   But I don't understand why xoring the tag τ of the first message with the 2nd message gives a message whose tag is the tag of the second message.  How is first tag used to determine that the tag of m'' is τ′?

The question is quite similar to this one :  But I still cannot fully understand it, and here's my question:  given two messages with known MAC:  CBC-MAC(a||b)= x  CBC-MAC(d||e)= y So from the given messages, I am able to forge a new message like this:  CBC-MAC(a || b || (d XOR x) || e ) = y (which is just like the post I read). But how about if I want to forge the message like this:  CBC-MAC(a || b || c || d || e ) = z The "c" maybe is something calculated from those two messages and its MAC, but I am not sure about it. Is it possible to achieve this?


Im a newbie in the cmd, and if you can just help me to do the batch while for Windows. This program must check the process while script is opened. If it doesn`t launched it will be open. If you can help me, just show me a code and explain how it works, please.

How can I check if an application is running from a batch (well cmd) file?  I need to not launch another instance if a program is already running. (I can't change the app to make it single instance only.)  Also the application could be running as any user.


i am trying to parse input from a character buffer char buf[BUFLEN];  The input I'm trying to parse is:   GET /file.html HTTP/1.3 Host: www.bbc.co.uk   I need to store the GET, the /index.html, HTTP/1.1 and www.bbc.co.uk all into separate variables  What is the best way to parse over this input and separate it into variables?  Thanks

I have been trying to tokenize a string using SPACE as delimiter but it doesn't work. Does any one have suggestion on why it doesn't work?  Edit: tokenizing using:  strtok(string, " ");   The code is like the following  pch = strtok (str," "); while (pch != NULL) {   printf ("%s\n",pch);   pch = strtok (NULL, " "); }


I came across this question, asked in a competitive exam. It  is as follows.  Given a matrix M = \begin{bmatrix}2&1\\1&2\end{bmatrix} what is the value of cos(πM/6)?  I've tried series expansion but I think there is an alternative way doing it, any help is appreciated.   Options given are  \begin{bmatrix}1/2&1\\1&1/2\end{bmatrix} \begin{bmatrix}\sqrt3/4&-\sqrt3/4\\-\sqrt3/4&\sqrt3/4\end{bmatrix} \begin{bmatrix}\sqrt3/4&\sqrt3/4\\\sqrt3/4&\sqrt3/4\end{bmatrix} \begin{bmatrix}1/2&\sqrt3/2\\\sqrt3/2&1/2\end{bmatrix}

I came across this question, asked in a competitive exam. It  is as follows.     Given a matrix $M = \begin{bmatrix}2&1\\1&2\end{bmatrix}$ what is the value of $cos(πM/6)$?   I've tried series expansion but I think there is an alternative way doing it, any help is appreciated.   Options given are  \begin{bmatrix}1/2&1\\1&1/2\end{bmatrix} \begin{bmatrix}\sqrt3/4&-\sqrt3/4\\-\sqrt3/4&\sqrt3/4\end{bmatrix} \begin{bmatrix}\sqrt3/4&\sqrt3/4\\\sqrt3/4&\sqrt3/4\end{bmatrix} \begin{bmatrix}1/2&\sqrt3/2\\\sqrt3/2&1/2\end{bmatrix}


As an example, let's say I put a Pokémon in a gym, say, Tuesday at noon, and it remains in the gym until Thursday at noon. Assuming I have nothing else in gyms collecting coins, would I get coins for this on Tuesday (where the Pokémon wasn't returned to me), or Wednesday (where it was neither placed in the gym nor returned); or would I only get coins for Thursday?

The new gym update , including a limit of 50 coins earned per day. How does this limit work? Is each pokemon limited to accruing 50 coins per day? Are all my pokemon limited to a collective 50 per day? My teammates keep feeding my Dragonite and she has been at the gym for almost a week; will she return with 50 coins for each day she was there? Fewer than 50 for the days I had other pokemon in the gym? Or will she accumulate vast sums of coins over the week, but only deliver me 50 (or fewer) when she comes back based on what I have collected from returning pokemon that day?