I'm not quite sure the benefits of working over a prime modulus in Shamir's secret share- but doesn't limiting the numbers you pull from make the secret easier to guess? Instead of being over the real numbers, with infinite elements, limiting yourself to some prime limits the possibilities-albeit that number can get very large.  Isn't this bad? What benefits are there to working over a prime that justify this choice?


\bigskip or \vspace{5mm} comes in at the wrong place?

Everytime I use the command \bigskip or \vspace{5mm} it doesn't show in at the right place in document. It always comes about a line and a half after, in the middle of sentences.  What am i doing wrong?


$f:V \rightarrow V$, $\dim(V) = n$  a) If $n$ is odd, prove that there does not exist a linear transformation with $\operatorname{im}(f) = \ker(f)$  b) Is it false to affirm the previous statement if $n$ is even?  My answer: $$ i = \dim(\operatorname{im}(f))\\ k = \dim(\ker(f)) \begin{cases} n=2i                           & \text {if $i=k$} \\ n=i+k   & \text{if $n\neq k$} \\ \end{cases}  $$  b) Yes.  Is that a valid proof?


Why is Yahoo blocking our email address verifications and bouncing them back

I have a legitimate site www.angelescity.ph a Free Classifieds site, once someone posts an advert a verification email is sent.. Yahoo has been blocking them, not delivering and bouncing them back, they also are not answering our enquiries. They are also blocking new subscribers to the site, therefor they cannot place advertisements without an account. Any suggestions?


How do I compare variable types in python?

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


How to define a function that takes all collections in C++

I'm doing a little research for a course on which computing speed over collections on different cpu types. I'm writing my tests in C++ (bad choice as I started with the language three weeks ago) and I'm trying to measure the amount of clock ticks.  I thought I'd implement an arbitrary map (yes, yes, transform) function first. For some reason I decided to encapsulate the functions I'm writing in different classes. I first tried making a function that takes an arbitrary collection, but that didn't work, so I thought of making a function that takes two iterator pointers, so I'm currently having problems with this:  .h  #include <vector> #include <map> #include <ctime> using namespace std;  class MapTests { public:     static unsigned long halve(unsigned long in);      template <class InputIter>     static clock_t getHalveTest(InputIter begin, InputIter end); };   .cpp  #include "MapTests.h"  unsigned long MapTests::halve(unsigned long in){ return in/2; }  template<class InputIter> clock_t MapTests::getHalveTest(InputIter begin, InputIter end) {     vector<unsigned long> store = {};     auto beginTime = clock();     transform(begin, end, store, &MapTests::halve);     return clock()-beginTime; }   I'm still planning on making a seperate function for std::map, but this is what I was planning to use for list, vector, array and such.  When I try to compile and print the clock ticks for the forward_list I get this monster of an error:      Undefined symbols for architecture x86_64:     "unsigned long MapTests::getHalveTest*> >(std::__1::__forward_list_iterator*>, std::__1::__forward_list_iterator*>)", referenced from:         _main in main.cpp.o   ld: symbol(s) not found for architecture x86_64   clang: error: linker command failed with exit code 1 (use -v to see invocation)   And I have no clue what I'm doing wrong here. I suspect I should do something with my template, but I don't know what.


How do I delete all the music on my iPhone.  I tried doing it through iTunes but it says my collection is not managed by iTunes and I don't want to erase and sync because all my apps are nicely backed up and sorted with iTunes.  I have only seen a way of deleting song by song on the phone.


Is there any Latex editor which supports hoisting a section or subsection? Most outlining softwares have hoisting feature. I don't find any Latex editor with hoisting feature. Any?  Note: Hoisting is not about collapsible  headings. It is about completely blocking out the rest of the text and zooming into one heading.   Here is a good example from FoldingText.   Collapsed headings look like this:    Hoisted:


How to export the output of sp_AskBrent?

We have an instance that randomly spikes the CPU. I want to create an alert that fires on CPU over 90% and automatically calls a job that runs sp_AskBrent and emails me the output. However, the output is unreadable in either Text or HTML output. It doesn't even go well into an Excel spread sheet. How can I get the info in a readable format?


I'm writing a report in LaTeX and I'm using excel to calculate, make graphs and tables. What would you recommend me to do to import it to latex?  I have tried taking print-screen and import as figures, but if the image scale isn't 100% it gets blurry and ugly.  I've been trying to export, print and save selected area as pdf. But no matter what I try, it exports with selected paper size. So it has a huge margin and I think it would take to much time to make a custom paper size for each figure.  Any thoughts?


How the CMB anisotropy is linked to the existence of cold dark matter and dark energy?

After the data from the cosmic microwave background has been collected by WMAP or Planck, what types of analysis is needed to conduct in order to deduce the cold dark matter density and the distribution of matter in the universe? In other words - How the CMB anisotropy measurements giving us evidence for the existence of dark matter/energy? (Any further explanation on the analysis of data is also welcomed.)


Each time I install ubuntu 14.04 and I have to update the OS and download a whole bunch of softwares which is very boring to do. So is there any process that I can backup my ubuntu softwares and updates and restore them after installing again ubuntu (without downloading them)?  Note: I am new to ubuntu. So easy explanation and sample code will be very much helpful for me.


Let $X$ be a continuous non-negative random variable on $(0,a)$. Prove that $$E(X) = \int_{0}^{a} (1-F_X(x))\,dx$$ where $F_X(x)$ is the CDF for $X$. I know that by definition: $$F_X(x) = P(X \leq x) => 1 - F_X(x) = P(X>x)$$ So i can easily go to the next step. But what should I do in this case? $$ \mathbb{P}(0 < X < a) = \int_0^a f_X(x)dx $$ Thank you


How to download an entire YouTube playlist as a single mp3 file?

What are recommended solutions to download an entire YouTube playlist as a single .mp3 file? I open to solutions other than youtube-dl.


I'm trying to calculate combination or different amount of variation we can have. E.g subway have 37 million different variations of sandwiches. I'm trying to calculate similar maths for my burger joint and want to know how many combination or variation of burger I have.. 3 different meat 9 different cheese 13 different filling 6 different salad 12 different sauce  I would be grateful if anybody can help Thanks


Does TQQQ get wiped out if it QQQ drops 34%? But what if after I purchase, it first went up 50% and then down 34%? (100 to 150 and then back to 100)

Since TQQQ is 3x the leverage of QQQ, so the conventional wisdom is:  When TQQQ drops 34%, then it is all "wiped out" (meaning a $100 investment will go to $0 now). And TQQQ itself is also all wiped out.  However, let's say, I bought TQQQ when QQQ was at $217, and now QQQ is at $330. So let's say, if some day, QQQ drops from $330 to $217, which is dropping 34%, should my investment in TQQQ get all wiped out?  However, I can also claim that, QQQ went up and then down along that roller coaster, but my TQQQ should just go to my original purchase price.  Or making it more drastic: I bought TQQQ on Monday, and Tuesday, QQQ went up from $217 to $330, and Wednesday, QQQ went from $330 to $217 -- dropping 34%, then my TQQQ should go back to the price of Monday only.  However, if Tom bought TQQQ on Tuesday when QQQ was $330, and then Wednesday, QQQ went from $330 to $217, then by (1) above, shouldn't the invest in TQQQ get all wiped out? (and shouldn't TQQQ itself be completely wiped out?) Or what if on Tuesday, when QQQ is $330, I sold all my TQQQ and get $N, and use that $N to buy back TQQQ (that is like, as if I did nothing really), but then by (1) above and like Tom, my investment in TQQQ should be wiped out, but by (2) above, my investment in TQQQ should just go back to the price I bought on Monday.  So these two points are contradictory.  How does it work?


With the following code:   #include <bits/stdc++.h> using namespace std; const double pi = 3.14159;  int main() {  double x; cin >> x;   cout << "A=" << pi * x * x << endl;   return 0;  }   And inputting   100.64  I get the value 31819.3, while what I want is 31819.3103   I tried using set precision but that doesn't seem to work either.  Why is this happening?


whats is the best way to find and replace url in string. Now I use regexp  Regex regx = new Regex("http(s)?://([\\w+?\\.\\w+])+([a-zA-Z0-9\\~\\!\\@\\#\\$\\%\\^\\&amp;\\*\\(\\)_\\-\\=\\+\\\\\\/\\?\\.\\:\\;\\'\\,]*([a-zA-Z0-9\\?\\#\\=\\/]){1})?", RegexOptions.IgnoreCase); string output = regx.Replace(text, "$0 ");   but this is ugly code and works badly, becouse it is not find www.server.com and  is bad url bur regexp find this.  What is the best way to do fuction which get some long string and return string with html link?   for example   input = Lorem ipsum dolor sit http://www.server.com/ amet output = Lorem ipsum dolor sit  http://www.server.com/ amet


Boy have been asking a bunch of questions on here lately, I have always been curious about this other driver called the CPU Microcode driver, I have an intel i3 Core Processor. I understand that this will increase your CPU performance with Ubuntu pretty well, but I'm not sure if I should install it.


Can I omit a 'that' from the sentence  I am confident that that can make me $50  so that it becomes  I am confident that can make me $50 Please and thank you.


How do I upgrade to 16.04 with Ubuntu Gnome 14.04?

I use Ubuntu Gnome 14.04 LTS, and I'm wondering if I can safely upgrade to 16.04 LTS.  Do I just click upgrade on the software upgrade utility, or should I run sudo apt-get dist-upgrade?  The last time I tried to upgrade from 12.10 to 14.04 LTS, my computer complained and gave me no end of issues.


Matrices over a PID with equal image only differ by an automorphism.

Let $R$ be a PID and $A,B$ be two $m\times n$ matrices over $R$ with $m\leq n$. I want to show that if $A$ and $B$ have the same image, they only differ by multiplication by an invertible matrix from the right.   Expressing the column vectors of A,B by linear combinations of the column vectors of B,A yields square matrices $X,Y$ with $AX=B,\  BY=A$ and thus $AXY=A,\  BYX=B.$  Using the fact that $R$ is a PID, I can apply the elementary divisor theorem and assume $A$ to be "diagonal", meaning of the form $A=\left(\frac{\textrm{diag}(e_1, \dotsc, e_m)}{0} \right)$ for some $e_i\in R$.


I want to know how to solve this using contour integration:  $$\int_0^{\infty} \frac{\sin(x)}{\sqrt{x}}dx.$$  So I let the integral become:  $$\oint_c \frac{\sin(z)}{\sqrt{z}}dz$$ where c is a "half doughnut" shape avoiding the singularity at z = 0 and extending into the upper half of the complex plane towards infinity.   $$\oint_c = \int_{up} + \int_{-R}^{- \epsilon} + \int_{low} + \int_ {\epsilon}^R = 0$$  (Because no singularities are actually contained within the contour.)  By a bound argument, the $\int_{up}$ contributes nothing to the integral. Therefore:  $$\lim{R \to \infty}, {\epsilon \to 0}$$  $$- \int_{low} = \int_{- \infty}^{\infty} $$  Where $\int_{low}$ is the integral over the bump going over the point z = 0. So can I use the Cauchy Integral theorem to say  $$\int_{low} = \pi i\, \text{Res} \left( \frac{\sin x}{ \sqrt{x}}, 0 \right)$$   Because there is no residue for this function, which would imply the integral is zero, which I know it is actually $\sqrt \frac{ \pi}{2}$.


Splitting Integers from string in java using split() function

import java.util.*; import java.lang.*; import java.io.*; class Main { public static void main (String[] args) throws java.lang.Exception { Scanner sc = new Scanner("(10,{10,9,6,5}),(12,{5,6})"); String s=sc.nextLine(); String[] strArray = s.split("[(,{})]"); for(int i=0;i <strArray.length; i++) {     System.out.println(strArray[i]); } int[] intArray = new int[strArray.length]; for(int i = 0; i < strArray.length; i++)  { if(strArray[i]!=" ") {     intArray[i] = Integer.parseInt(strArray[i]); } } System.out.println(strArray.length); } }   /*Output:    Runtime error ......  10  10 9 6 5  12  5 6    When printing on different lines there is blank spaces in between.  When printing on same line output:10109651256.  length of splitted array is 14.  What are these spaces blanks or NULL?  Why aren't they printing on the same line?//


For all $n \geq 1$, and positive integers $a,b$ show:   If $\gcd (a,b)=1$, then $\gcd(a^n,b^n)=1$  So, I wrote the $gcd (a,b)=1$ as a linear combination: $ax+by=1$  And, I wrote the $gcd(a^n,b^n)=1$ as a linear combination: $a^n (u)+b^n (v)=1$  can I write the second linear combinations with $x,y$ and then raise the first equation to the nth power or not?


Convex Set with Empty Interior Lies in an Affine Set

In Section 2.5.2 of the book Convex Optimization by Boyd and Vandenberghe, the authors mentioned without proving that "a convex set in $\mathbb{R}^n$ with empty interior must lie in an affine set of dimension less than $n$." While I can intuitively understand this result, I was wondering how it can be proved formally?


This is in reference to this question:  I gave a proof which is given here  and at the same time a counter-example has also been provided here   I don't understand how is this possible.Can someone kindly help me to find the fallacy in the proof?


Continuous function which has only rational values.

If $f:[a,b]\to\mathbb{R}$ is a continuous function and $f(x)\in\mathbb{Q}$ for all $x\in[a,b]$ then what can say about $f$?  My try: I think f should be constant, if it is not constant then it contradicts the continuity. Can anyone prove that f is constant?


Let $R$ be a finite commutative ring with unity. Show that every prime ideal of $R$ is maximal.

Attempt: Suppose $P$ a prime ideal, then $R/P$ is an integral domain, and so $R/P$ is a field, which implies that $R$ is maximal.  I am not sure if this is a sufficient proof. Furthermore, I do not understand how to use the condition "finite".


I hope this question is not a trivial one, but I was not able to find any answer to that.  I found out that sometimes when I put an \hfill command in order to align some text to the right, there is a line break after the first word of the right-aligned text, even though there is surely enough space from the text on the left.  After playing with it a bit, it seems to me that it happens after there was a line break within a word in the paragraph.   I can't see any reason for that, but yet again I might not have a full understanding of how line breaking and \hfill work.  Here is a minimal example:  \documentclass{article} \begin{document}  If there is a line break within a word as a result of some verymuchsuperlongword,  then the text after hfill breaks: \hfill Some words.  If there isn't a line break within a word as a result of some very much super long word,  then everything looks fine: \hfill  Some words.  \end{document}   And that's how it looks:    Does anyone have any idea what might be the problem and how I can avoid it?


move figure in subfloat (subfig package)

I would like to align the figures in the picture, I have tried many solutions I found in internet, but nothing worked for me. I am using the subfig package. I have covered the figures because I do not own the rights. The first one was generated with Gnuplot (epslatex terminal), the second one is a simple pdf image. Here is my code:  \begin{figure}[t] \centering \begin{adjustbox}{max width=\textwidth} \subfloat[Caratterizzazione IV @ $T = -30^\circ C$ \label{subfig-1:3d-iv_frigo}]{%    \input{./cap4/3d/iv_frigo} } \subfloat[Misura a 50V @ $T = -30^\circ C$ \label{subfig-2:strip_cv}]{%     \includegraphics[scale=0.65]{./3d/misure/50V_frigo}   \put(-40,-7){\footnotesize elettroni} } \end{adjustbox} \caption{Frigo} \label{fig:frigo} \end{figure}


How to set static IP address on Ubuntu 16.04 LTS? I need connect router board which have static IP address ((192.168.15.1 address is board ip). I tried set via GUI, Network > Settings > IPv4 Settings > Method (Manual) where tried to specify Address, Netmask, Gateway: but these are not saved for some reason, if I type subnet (2nd step), it appears in place of ip address field, same for gateway. Not sure what's wrong there. For example, I want set   IP 192.168.15.3 subnet mask 255.255.255.0 gateway 192.168.15.254


How to maintain order when finding symmetric difference between two list in Python?

Given two lists, the objective is to find the non-overlapping value between them. Based on the suggestion discussed in . This can be achieved either of the two approach list_one=['ISL','BUK','ORG','CLC','STS','PLP','t1','t2','t3','t4','DE1','DE2','DE4'] list_two=['t1','t2','t3','t4']  APP1=set(list_one) ^ set(list_two)  APP2 = set(list_one).symmetric_difference(list_two)  Both suggestion outputted {'DE4', 'DE2', 'CLC', 'STS', 'ORG', 'BUK', 'ISL', 'DE1', 'PLP'}  While this work, but the order from list_one is distorted. My question is, how can the above code be modified to output as below, where, the ordering follow as per in list_one EXPECTED_OUTPUT=['ISL','BUK','ORG','CLC','STS','PLP','DE1','DE2','DE4']


Different \eqref{} styles depending on the number of arguments

I am using the following command to make references to equations of the form "Eq. (X.X)"  \let\originaleqref\eqref \renewcommand{\eqref}{Eq.~\originaleqref}   (see: )  But there is still annoying issue to deal with. Sometimes i want to refer to a bunch of consecutive equations, so the form should be     "Eqs. (X.X) - (X.Z)"   or sometimes to just two equations in the form     "Eqs. (X.X) and (X.Y)".   Additionally i would be absolutely nice if the command would get "oh i have three (four, five...) equations to reference, so i do this":     "Eqs. (X.X), (X.Y) and (X.Z)".   So it seperates all, but not the last mentioned equation with commas, and adds before the last equation an "and". This should be the behavior, if the equations are given in a way telling the command that they should be not(!) be written in the consecutive way as described above.  I provide an MWE just because i have to, although I know, this is not including an possible solution. I apologize for this behavior since i am using this forum for a while, but I have absolutely no glue how to acchieve this.  \documentclass{scrartcl} \usepackage{amsmath} \let\originaleqref\eqref \renewcommand{\eqref}{Eq.~\originaleqref} \begin{document} \begin{equation} 1 \label{eq:1} \end{equation}  \begin{equation} 2 \label{eq:2} \end{equation}  \begin{equation} 3 \label{eq:3} \end{equation} Refer to the first equation: \eqref{eq:1} \\ Refer to the first and second equations: \\ %todo Goal: Eqs. (1) and (2) Refer to the first to third equations: \\ %todo Goal: Eqs. (1) - (3) Refer to the first, second and third equation: \\ %todo Goal: Eqs. (1), (2) and (3) \end{document}


How can i configure a disk in disk management to account for future redundancy?

i need a way to format a partition so that it is secure from other users on my pc. Also how  can i configure a disk in disk management to account for future redundancy?


jQuery keydown event is not functioning after a button element is replaced with an input

I have a question. I've been coding a jQuery event where the  button with an ID of add is ticked and is updated to an input  Here is the jQuery code   /* Change the Add button to an Input element*/ $("#add").click(function(){     $(this).replaceWith("<input type='text' placeholder='Task'>");     $("div.tasks>span").remove(); });  /* Adding a value to the list */ $("input").keydown(function(e){     if(e.keyCode == 13){         var item = $(this).val();          $(this).parent().prepend("
" + item + "
");         $(this).val("");     } });   Here is the HTML:
Monday

     <button id="add"></button>      Add task     <input type="text">
   Whats supposed to happen here is once the Button has been ticked it will now turn to an input element.   And once the input element has been populated with data and keycode==13 is pressed (Enter). The value placed on the input element will now be added to the DOM within a li element.


What happens if I overstay in the Schengen area for 1 day but my visa is still valid?

My Schengen visa starts on December 23, 2017 and is valid until January 17, 2018. The duration of stay (as per the visa) is 11 days.  Due to some communication problems, my travel agency booked the flight from December 24, 2017 and the return flight on Jan 5, 2018. That makes the duration of stay to be 13 days.  What can be done? Can anyone help? What are penalties that I may have to face?


What is the best way to give a C# auto-property an initial value?

How do you give a C# auto-property an initial value?  I either use the constructor, or revert to the old syntax.    Using the Constructor:  class Person  {     public Person()     {         Name = "Initial Name";     }     public string Name { get; set; } }   Using normal property syntax  (with an initial value)  private string name = "Initial Name"; public string Name  {     get      {         return name;     }     set     {         name = value;     } }   Is there a better way?


Count the permutations which are products of exactly two disjoint cycles.

Let $a_n$ be the number of those permutation $\sigma $ on $\{1,2,...,n\}$  such that $\sigma $ is a product of exactly two disjoint cycles. Then find $a_4$ and $a_5$.   Calculating $a_4$: Possible cases which can happen are $(12)(34),(13)(24),(14)(23)$, any cycle of the form $(123)$ or $(12)$ i.e. two-cycles and three cycles thus we have in total $3+\frac{1}{3}4P_3+\frac{1}{2}4P_2=3+8+6=17$ but the correct answer is given to be either $11$ or $14$.  Where am I wrong? Please help.


Question about diffrenece between "go to home" & "go home"

I am going home. I am going to home.  Irrelevantly I should mention here that I perfectly know what the difference between to and towards is. My concern has to do with the meaning when we make the sentence without to or towards


How can I center the maximum circle in an arbitrary sized box?

I would like to know a clean and generic way to achieve this using only CSS + HTML. Minimal markup / hackery would be desirable.  The goal is to provide a working example in which:   there is a parent container box that can be any size there is an inner div element nested that should be the biggest circle possible that fits in the outer box, centered both vertically and horizontally.   This is what I've got so far, it is an ugly approach:     $(function(){   console.log("this code is  here only to allow resizing the parent box");   $(".box").resizable().height(150).width(100); }); .box{   margin-left:auto;   margin-right:auto;   display: flex;   justify-content: center;     align-items: center;     position:relative;   border:2px dashed red;   min-width:90px;   min-height:90px;   margin-top:50px; }  .dummy{   max-height:100%;   max-width:100%;   object-fit:contain;   border-radius:500px;   border:2px dashed blue;   box-sizing:content-box;   pointer-events:none;   background-color:yellow; }  .circle{   display:contents;   position:relative; }  .circle span{   position:absolute;   color:white;   font-size:30px;   color:black; }   <link rel="stylesheet" type="text/css" href="https://cdnjs.cloudflare.com/ajax/libs/jqueryui/1.12.1/jquery-ui.css">
No JS involved, but a lot of ugly hackery

¿any better way to do it?

             :-)


I would like list dates between two date in a SQL Server stored procedure.  For example:  Date1: 2015-05-28 Date2: 2015-05-31   Results :   2015-05-29 2015-05-30   How to calculate all dates between two given dates?  Regards,


Different size tyre has arrived than ordered

I normally get my local bike shop to change my tyres but due to the COVID19 Pandemic they are not open. I have a Ridgeback Terrain 2 that came fitted with 27.5 x 2.10 tyres I ordered that size of tyre but the one that has just arrived is in fact 27.5 x 2.25. I have no idea what this all means and looking up various articles on the internet has just left me even more confused. Therefore I thought I would ask people on here as I am sure someone will quickly be able to tell me whether or not I can put this tyre on my bike or if I need the supplier to replace it with the size I actually ordered. Thanks in advance Mike


Question:  If $p(x) \in F[x]$ is of degree $3$, and $p(x)=a_0+a_1x+a_2x^2+a_3x^3$, show that $p(x)$ is irreducible over $F$ if there is no element $r\in F$ such that $a_0+a_1r+a_2r^2+a_3r^3 =0$.  My understanding: If $p(x)$ is reducible, then there exists $ax + b$ such that $a, b \in F$ and $a\ne 0$. And $p(x) = (ax + b)(cx^2 + dx + e)$. Then an $r$ exists such that $p(r) = 0$. Is that how you're supposed to tackle it? I understand that I am supposed to first explain the argument for a polynomial of degree 1, but I do not understand how to go about that, and why that helps.


Can I run Ubuntu 20.10 smoothly on Intel Pentium G3220?

I use a desktop with a 4GB Ram and Intel Pentium Gold Processor. Can I run Ubuntu 20.10 smoothly on the desktop?


I have a question for which I have set a 50 point bounty. What happens if I don't award anyone my bounty? Will the points be credited to my reputation? Or will they be wasted since I have not used them?


Trying to implement a body tag color change

I'm learning Javascript/JQuery.   I'm writing a guess-a-number game and I'm trying to .animate() a backgroundColor change on an id if the user guesses incorrectly. I have seen a few examples of this and found one in particular at the JQuery site which I'm trying to use.   You can see the code here:    Otherwise, it's below.  Note: If you run the index.html in your browser, the randomized number is logged to the console, but if you don't have the console open, you won't see it. The number selection is only between 1 and 10, though.  What happens now is if you guess the wrong number, you're prompted again, as I want. But I also want the body background to change color to red. Instead, the background color is changed after the user gives the correct answer and is NOT animated.   $(document).ready(function () {     var answer = Math.floor(Math.random() * 10) + 1;     console.log(answer);      function game() {         var guess = prompt("Choose a number!");         guess = Number(guess);         if (guess !== answer) {             $("#bg").animate({                 backgroundColor: "#F00",                 color: "#000",             }, 1000);             console.log("Nope!");             game();         } else {             console.log("Yay!");         }     }     game(); });


RTL8811AU + RNX G300EX WiFi adapter driver issues with a twist

I've been lurking for some answers about the RTL8811AU EDUP and Rosewill G300EX WiFi adapter. The Rosewill adapter that I dug out of my basement picks up wifi signals, tries to connect, and then drops them for no reason I can decipher.   The USB adapter, on the other hand, doesn't even turn on. I do have a USB hub because I thought it was a power issue, but that didn't work. There's a twist; I have no internet access on that computer (The adapters aren't working!) so I can't install any packages. I've even tried USB tethering with an iPhone. I do not have access to wired internet.   My PC is an HP XW4600 running Ubuntu 18.06. I am willing to run some diagnostics if you have any questions, but it is limited- I can't even run ifconfig, because I need to install packages over the internet.  Thanks!


Remove common characters or duplicates in a string

I'm trying to remove duplicates in a string upon user input. Here''s my code:  userinput = input("Enter a word:") def duplicates_removal(x):       for i in range(len(x)-1):              if x[i] == x[i +1]:                      return duplicates_removal(x.replace(x[i], ' '))       return x   print(duplicates_removal(userInput))   When I run the code, and input the string Bananas,  it produces the output Bananas with the duplicates not removed. Is there any flaws in the code? Also I prefer not using built in functions for this since I just started learning on string manipulation.  Input: Bananas Output desired: Bans


How can I prove that the following series does not converge uniformly.

How can I prove that the following series does not converge uniformly for $|y|<1$? could anyone give me a hint please?  $$\sum_{n=1}^{\infty} \frac{y^n}{2n-1},$$


"Too short a time" or "Too short of a time"?

What is the correct phrase to be used among these two:   Too short a time Or Too short of a time   Which one is correct for daily English usage?


A conjecture including binomial coefficients

Question:  $$\sum_{k=1}^{n}k\binom{2n}{n+k}=\frac n2\binom{2n}{n}$$ is true for every $n\in \mathbb N$? If this is true, then how can we prove this?   When I was playing with numbers, I conjectured this. Though I found that this holds for many $n$s, I haven't found any proof. Can anyone help?


Can you make some photos private on Instagram?

There's a profile on Instagram where I can't see some of the persons pictures, but from my friends profile I can see them all.  The Instagram is not private. Can you do so on lyrics some people can view a specific picture?


swap(int &a, int &b) and swap(int *a, int *b). What is difference?

void swap(int *a, int *b) {     int iTemp ;     iTemp = *a;     *a = *b;     *b = iTemp;  } void swap2(int &a, int &b) {     int iTemp;     iTemp = a;     a = b;     b = iTemp; }   What are the difference between swap2(&a, &b) and swap(*a,*b). Although, final result is the same.


In class we derived the convergence rate for Newton's method for a function such that the root was not simple. And we found it to be linear convergent However our professor then went on to a modified version of Newtons method for roots of multiplicity $m$: $x_{n+1} = x_n - m \frac{ f(x_n)}{f'(x_n)}$. However he just mentioned that assuming $x_n \rightarrow \alpha$ then the modified method is quadratically convergent. But I can't see why?


I'm using vim to write my thesis. It's a multi-document project, with most tex files in subdirectories from the master-document. I've set up a couple of \newcommands to replace the use of \section*{} in the Introduction, but when writing the sections, misspelt words aren't highlighted.  I thought it was a problem with vim-latexsuite, so I've just uninstalled it, but still, spell-checking functionality doesn't work in these sections.  For example, a MWE with the following files:-  thesis.tex thesis.tex.latexmain Classes/Thesis.cls Intro/intro.tex   thesis.tex :   \documentclass[twoside,openany,titlepage,12pt]{Classes/Thesis}  \pagenumbering{roman} \begin{document}  \include{Intro/intro}  % ...  \end{document}   Classes/Thesis.cls :  \ProvidesClass{Classes/Thesis}[2014/07/14 v1.2 Thesis template]  \LoadClass[pdftex, a4paper]{report}  \usepackage[pdftex,             plainpages = false,             pdfpagelabels,             bookmarks,             bookmarksopen = true,             bookmarksnumbered = true,             breaklinks = true,             linktocpage,             pagebackref,             colorlinks = true,             % Colour settings from::             % http://tex.stackexchange.com/questions/30243             linkcolor=NavyBlue,             citecolor=BrickRed,             filecolor=black,             urlcolor=BrickRed,             hyperindex = true,             hyperfigures             ]{hyperref}  \usepackage{tocbibind} \usepackage{bookmark} \usepackage[english]{babel} \usepackage{times} \usepackage[a4paper]{geometry} \usepackage{pdfpages}   \newcommand\chapwtoc[1]{%   \phantomsection   \chapter*{#1}   \addcontentsline{toc}{chapter}{#1}   \markboth{#1}{} }  \newcommand\secwtoc[1]{%   \phantomsection   \section*{#1}%   \markright{#1} % Get the Section name in headnotes   \addcontentsline{toc}{section}{#1} }   Intro/intro.tex :  \chapwtoc{First chapter}  this is a msisisspelt word. Some mnore mis-spellings.   \secwtoc{First section}  some more misskjkpellings.  % vim: spell spelllang=en_gb   thesis.tex.latexmain is an empty file, as suggested in the latexsuite documentation for   How do I get spell-checking to work in the intro.tex sections? Using vim 7.4 on Linux


Diffrence between "at the beach" & "on the beach"

She is at the beach. She is on the beach.   My teacher once told "at" , I have my doubts if "at" is correct.


Redirecting an URL just for a given referring URL

I have a website (eg. ) and it has (amongst others) a page called origpage.php. But, I do not want the origpage.php to open when a visitor who comes from a given domain (eg. ) want to open it. I want this visitor to be redirected to an other page, eg. otherpage.php.  How can I do it? (I think the "question-duplication" is not the case.)


A friend of mine who's a native English speaker corrected me the other day. I said something like "it's not something no-one has done before". He told me about the rule that states that double negatives cancel out, thus making the sentence affirmative. He told me I should rather say "no-one hasn't done before".  I can see at least two ways of saying the same thing:   "It's not something no-one has ever done" "It's not something someone hasn't done before"   According to the rule, these sentences will convey an affirmative meaning as well.  What I want to say is basically:     Someone has done this before.   Which is an affirmation. What's wrong with double negation then?


How long decision in process normally takes?

I have submitted a manuscript to a journal on September after few days the status changed to under review and after 5 months the it changed to all required reviews are completed and immediately to decision in process. It has been 3 weeks that the paper status stuck at decision in process. How long this stage normally takes ?  is it too early to ask the editor (?) about the status of my paper?


I know that  save the sound as ups and downs on the record plate surface. Let's say two people with different voice timbers say "I like vinyl records" with the same level of voice. It will create the exact "ups and downs" on the vinyl record surface. I don't get how after this when reproducing the exact same "ups and downs" the vinyl record recreates the different voice timbers.


Could the Off Topic close reasons screen get a bit of McLovin'?

As everyone is becoming aware, the .  When voting to close a question, the first dialog is nicely laid out and easy to look at:    But the dialog containing the off-topic reasons is considerably harder to read and assimilate due to its layout and the fonts/weighting used. It's almost a wall of text:    When you've changed things, you want to make it easy for people to follow the new process. You don't want them to struggle to work out what the appropriate reason should be.    Can we have this re-jiggered to match the style used in the first close dialog?


How to give specific port to Apache in Ubuntu 12.04 and port for mysql

I am using xampp Apache server but it works locally i want to access it from public ip and i know the whole process but i am stuck how to change the port for Apache server because i dont want to access it with port 80 but is it possible that apache will run on other port please help and also how to change the port of mysql


Why do I see only code on my iPhone App?

Often I'm on MSE via my iPhone, where the math in comments only was shown as code, but in posts it was "compiled" normally so I didn't bother too much. But suddenly a few weeks ago, the math was shown only in code even in the posts, which makes rather difficult to read them. What is going on? Is this problem known, do you have this problem too? How to fix it? I'm not sure if this is the right side to post this question, thanks for indicating if you think I should post it elsewhere.


Order in matrix products, Complex conjugation, Transpose, dagger, ...

First, state what i know about products of matrices  \begin{align} & (AB)^{-1} = B^{-1} A^{-1} \\ &(AB)^T = B^T A^T \\ & (AB)^{\dagger} = B^{\dagger} A^{\dagger} \end{align} Where $-1$ represents the inverse, $T$ transpose $\dagger$ dagger (which means the complex conjugate and transpose)   Now, I got wonder the complex conjugation of matrices  It seems to me that complex conjugation itself does not change the order of products,   \begin{align} (AB)^{*} = A^* B^* \end{align} Is this statement correct?


I could not find a solution for the following problem. That's why I address my problem now here.  I want to design a table without fancy libraries, just with some basic features like \hline and spacing commands. But this strategy does not lead me on the right way.  I attached a picture of the compiled latex code. You can see small white gaps in the vertical lines. How do I get rid of those? It is supposed to be a continuous line.  \begin{table}[ht] \centering \caption[bla]{bla } \begin{tabular}{| p{1.8cm} | p{3cm} | p{4.7cm} | p{3.5cm} |}     \hline \\[-1.0em]     bla     & bla & bla & bla \\     \hline \hline \\[-1.0em]     bla & bla  & bla & bla \\     \hline \\[-1.0em]     bla & bla & bla  & bla \\     \hline \\[-1.0em]     bla & bla & bla &bla\\     \hline \\[-1.0em]     bla & bla &bla Jahre &  bla \\     \hline \\[-1.0em]     bla &bla   & bla &bla \\     \hline \end{tabular}% \label{tab:bF}% \end{table}%     Thanks a lot for your support!


When I go to the downloads page to get Ubuntu, it automatically downloads the AMD version, but my computer has no hardware with AMD on it. I only have Intel and Nvidia. Also, when I install this AMD version on my computer, it works (other than the constant random freezing of the computer when I use Ubuntu). I don't really understand why the amd version works on a computer with an intel processor.


While I was learning introductory statical physics/ thermal physics, I have following doubt below Suppose that we have a system which is very very big, consisting of objects which are very very small (like point particles) comparable to the system but big enough. Now, according to second law of thermodynamics the entropy of the system will increase to achieve equilibrium but at the same time gravitational pulling will try to accumulate all the objects (since, objects are quite big enough so gravitational pull will also be strong enough), hence randomness (distribution of the microstates) will decrease, isn't it a contradiction?  Any answer/comments are welcome and thanks for that.


I do not know of any special meanings for the hash character (#) in Java. Yet, I cannot create a variable with a name containing the hash character. Is there any reason? Is there actually a special meaning?


Since stars use hydrogen initially for fusion which then produces heavier elements. Where does all this hydrogen come from? Does all the hydrogen come from the birth of universe? If yes then will new stars stop forming because there is no hydrogen?


#include <iostream>  int main() {     int x = 1;     char ch[] = "sai";     int a[] = {1,2,3};          // statement : 1     std::cout << ch << ' ' << a << '\n';      // statement 2     std::cout << *ch << '\n';     return 0; }  output: sai 0x7fff900919b8 s  expecting: **address of first char** 0x7ffde5767cd8 s  Reasoning: ch stores the address of the first character of the copy of string literal sai. So when we are printing ch then it should print the address right? Whereas both statement-2 and int array a outputs are printed as expected. Where am I going wrong? Any help would be really appreciated!


When does an "on their next turn" spell cast as a reaction take effect?

Several spells take effect on the target's next turn. Command is one example (PHB, p. 223):     You speak a one-word command to a creature you can see within range. The target must succeed on a Wisdom saving throw or follow the command on its next turn.   Compulsion has similar effects.  A spellcaster with the War Caster feat can cast these spells as a reaction (instead of a melee opportunity attack), during the target's turn. For example:     Harrek the Barbarian is within reach of Almira the War-Cleric. Harrek wants to go hit Almira's pet troll, so he moves away from her, figuring that he can shrug off any melee attack she might make. Almira casts command, with a command of "Halt". Harrek fails his Wisdom save.   When does Harrek "Halt"? Immediately, effectively ending his turn? Or on his next turn, after he has had a chance to move and attack the troll, and after Almira has had her turn and had a chance to cast another spell.    This point was raised in , but wasn't the main focus.


Is it possible for a black hole to form for an observer at spatial infinity?

To my knowledge if you calculate the coordinate time (time experienced by an observer at spatial infinity) it takes an infinite amount of time for an object to fall past the horizon of a Schwarzschild black hole. Doesn't this imply that it takes an infinite amount of coordinate time for a Schwarzschild Black Hole to form since the last bit of in-falling matter won't ever ross the horizon as observed by someone at spatial infinity? If so, is it possible for other types of black holes (Kerr etc.) to form in finite coordinate time?


My PC was booting very fast because I have SSD however after I enabled and disabled bitlocker now my PC boot time is 1 minute and 10 sec !! I tried to use windows performance recorder to see what is wrong but once started the recorder I could not login into windows because of blue screen !! so i disabled the recorder.  Any advise how I find the problem that made my boot time slow ?  Here is the event pic   Here are the data    EventData     BootTsVersion 2    BootStartTime 2019-02-01T20:23:29.029447200Z    BootEndTime 2019-02-01T20:25:18.984717500Z    SystemBootInstance 453    UserBootInstance 451    BootTime 82979    MainPathBootTime 13279    BootKernelInitTime 39    BootDriverInitTime 441    BootDevicesInitTime 4344    BootPrefetchInitTime 0    BootPrefetchBytes 0    BootAutoChkTime 0    BootSmssInitTime 3448    BootCriticalServicesInitTime 121    BootUserProfileProcessingTime 463    BootMachineProfileProcessingTime 53    BootExplorerInitTime 3552    BootNumStartupApps 4    BootPostBootTime 69700    BootIsRebootAfterInstall false    BootRootCauseStepImprovementBits 0    BootRootCauseGradualImprovementBits 0    BootRootCauseStepDegradationBits 0    BootRootCauseGradualDegradationBits 0    BootIsDegradation false    BootIsStepDegradation false    BootIsGradualDegradation false    BootImprovementDelta 0    BootDegradationDelta 0    BootIsRootCauseIdentified false    OSLoaderDuration 904    BootPNPInitStartTimeMS 39    BootPNPInitDuration 5099    OtherKernelInitDuration 111    SystemPNPInitStartTimeMS 5193    SystemPNPInitDuration 397    SessionInitStartTimeMS 5608    Session0InitDuration 1441    Session1InitDuration 407    SessionInitOtherDuration 1599    WinLogonStartTimeMS 9056    OtherLogonInitActivityDuration 153    UserLogonWaitDuration 9638    I already tried windows performance kit and because of the recorder I could not even login into windows because of blue screen. In addition I posted the time of each process and it appear BootPostBootTime is the problem but I dont know what it is and how to solve it.  Update Here is a picture from process monitor display the most taken time at startup but I dont know how to fix this as I afraid to stop a process that will take down windows so please advise  As for Bitlocker all drives are unencrypted and the service is not running


How to generate html elements dynamically with Javascript

I am trying to generate divs with Javascript dynamically. What I mean: in the first div there will be a button with a .click event and when it will be clicked I want a new div to be generated. Inside the new div there must be another button with a .click event which will act as the first one. My problem is that in the div that is generated that button does not create a new div. This is my js function: $(function() {         $('#openFirstTab').click(function(){             var newDiv = $('

A modern responsive front-end framework based on Material Design
<button id="openSecondTab">Add Div</button>
');           $('.row').append(newDiv);         });         $('#openSecondTab').click(function(){             var newDiv = $('

A modern responsive front-end framework based on Material Design
<button id="openSecondTab">Add Div</button>
');           $('.row').append(newDiv);         });     });  and the HTML:

Starter Template

A modern responsive front-end               framework based on Material Design
         <button id="openFirstTab">Add Div</button>


I've got to the point where my bread springs beautifully (I can see it grow). Unfortunately, no matter how I score it, the score always spreads open gently, then hardens along with the rest of the crust. Then, 5 minutes later, the bread splits open at the side.   I usually bake a batard shape, with 80% hydration. I make a single score, using a kitchen knife, about 0.5 to 1 cm deep cut straight down. I spray the oven walls three or four times with a plant sprayer after I put the loaf in.  What can I do to get better results? Should I invest in a razor, should I angle the cut a bit more?  Since the answer is a combination of the things mentioned, I'd thought I'd edit the question to summarize my findings. I've tried most of the things mentioned below. The following things stand out:   It's perfectly possible to get a  properly opening score without a lamé.  There's a spectrum ranging from doughs that immediately open up when you cut them, and those that stay firm and re-seal immediately. This mostly depends on hydration. If you have the first, you'll want to make very horizontal cuts. This gives you a kind of flap that holds the cut closed long enough to keep it from hardening during the first minutes of the oven spring. This is why the score looks asymmetrical after baking. I resisted the method of putting a dutch oven inside my oven for a long time. I have a small oven and this reduces the effective space a lot. Also I can't watch the dough spring anymore, which I find the most magical part of baking bread. But I tried it and, holy cow, what a difference it makes. Of all the tricks mentioned, this one made by far the biggest difference.


How to prove that the curve $x^2+y^2-3=0$ has no rational points?

There is a question 6.20 from the Book of Proof by Hammock that reads as follows:  We say that a point $P=(x,y) \in R^2$ is rational if both x and y are rational. More precisely, P is rational if $P=(x,y) \in Q^2$.  An equation $F(x,y)=0$ is said to have a rational pointif there exists $x_0, y_0 \in Q$ such that $F(x_0,y_0)= 0$.  For example, the cruve $x^2+y^2-1=0$ has rational point $(x_0,y_0)=(1,0)$.  Show that the curve $x^2+y^2-3=0$ has no rational points. I can only take a guess at how to start a proof.  Doing algebra on both sides of $x^2+y^2-3=0$ yields $y = \sqrt{3-x^2}$.  Now, assume y is rational -- can x be rational? Thus, let y = $a\over b$ for some integers a and b, $b \ne  0$,$gcd(a,b)=1$.  Then let y = $c\over d$ for some integers c and d, $d \ne  0$,$gcd(c,d)=1$.  Hence, ${a \over b} = \sqrt{3 - {{c^2} \over {d^2}}}$. I think I may want to prove some sort of contradiction in terms of rational and irrational?  This as far as I got in my scratchwork for a proof.


What are some real life applications of limits?

I have been recently taught limits  in calculus but I don't see any real life applications. Are there any? Thanks.


I have Ubuntu 12.04 LTS, fully up-to-date. I'm new to Ubuntu. Whenever I start my system I face "System Program Problem Detected." Why is this happening? I ran sudo rm /var/crash/* but it again appears after some time. What could be at fault?


I am trying to understand how complex numbers made their way into QM. Can we have a theory of the same physics without complex numbers? If so, is the theory using complex numbers easier?


For which integer $d$ is the ring $\mathbb{Z}[\sqrt{d}]$ norm-Euclidean?   Here I'm referring to $\mathbb{Z}[\sqrt{d}] = \{a + b\sqrt{d} : a,b \in \mathbb{Z}\}$, not the ring of integers of $\mathbb{Q}[\sqrt{d}]$.  For $d < 0$, it is easy to show that only $d = -1, -2$ suffice; but what about $d>0$?  Thanks.


If a group has no subgroups other than the identity and itself, then it is finite and is of prime order

I want to prove that if a group has no subgroups other than the identity and itself, then the order of the group is a prime number.  A hint would be appreciated. Is there any theorem on the relation of the order of the subgroup and that of the group?  Note that the finiteness is not given, unlike in the .


I have troubles showing the following:  Let $(X,\rho)$ be a compact metric space and $F \subset X$ a closed subset. Prove that if diam $F < \infty$, then there exist $x_{0}, y_{0} \in F$ such that diam $F= \rho(x_{0},y_{0})$.  It looks so trivial yet hard to find the trick.


In what spaces does the Bolzano-Weierstrass theorem hold?

The Bolzano-Weierstrass theorem says that every bounded sequence in $\Bbb R^n$ contains a convergent subsequence.  evidently doesn't go through for an infinite-dimensional space, and it seems to me that the theorem ought not to be true in general: there should be some metric in which $\langle1,0,0,0,\ldots\rangle,  \langle0,1,0,0,\ldots\rangle, \langle0,0,1,0,\ldots\rangle,  \ldots  $ is bounded but fails to contain a convergent subsequence.  Let $M$ be a general metric space. What conditions on $M$ are necessary and sufficient for every bounded sequence of elements of $M$ to contain a convergent subsequence?


Why is lighting broken while using shade smooth?

I have a problem with my mesh (blend file at the bottom), I want to connect these two sides of the object so the mesh creates something like a loop. Mesh is fine and smooth if those sides are not connected, but every time I try to connect them with "merge by distance" the lighting on "shade smooth" will break and the mesh will end up looking weird. I have no idea why is that.  My mesh is not that bad (I personally think it's clean).  I was trying to make this mesh as simple and clean as I could. Here is my blend file.


I am using a matrix for node-positioning with a fixed node witdh. However, as some nodes contaning more than one line of text some nodes are shifted in y-axis and I don't know why or how to fix this. There seems to be enough space inside the node in y-axis. I also connected some nodes which result in an ugly picture.  MWE which shows this behaviour:  \documentclass[tikz]{standalone} \usetikzlibrary{matrix,fit} \begin{document} \begin{tikzpicture} \matrix (m) [% matrix of nodes,% nodes in empty cells,% nodes={rectangle, draw ,align=center,minimum height=1.5cm, text width=3.5cm,font=\scriptsize, inner sep= 0cm, outer sep= 0cm, fill=white},% column sep=.5cm,% row sep=.5cm,% anchor=center ]% { &{Two\\line\\breaks}&{One line}&& \\ {One\\linebreak}&&&& \\ &&&{Two\\line\\break}& \\ &&One&& \\ }; \foreach \row/\rownext in {1/2,2/3,3/4,4/4} {     \foreach \col/\colnext in {1/2,2/3,3/4,4/5,5/5}     {         \draw(m-\row-\col) to (m-\row-\colnext);         \draw(m-\row-\col) to (m-\rownext-\col);     } } \end{tikzpicture} \end{document}   Picture or result:


What boundary conditions in a wave simulation would avoid reflections?

In simulating an elastic medium as a series of mobile points connected by ideal springs, it's straightforward to model conditions corresponding to a fixed endpoint, which results in an incoming wave reflecting back inverted, or a free endpoint, so that the wave stays the same way up after it reflects.  I'm doing this with crude 1D difference equations - , if you're interested.  I feel like avoiding reflections without actually simulating an infinite chain should be a tractable problem, but the only papers I'm finding on it are behind a paywall and/or highly complex. There's , for example, which feels like overkill - but maybe this is just one of those problems that looks like it should be fairly easy, but really really isn't?  Edited to add: I'm looking at the Perfectly Matched Layer technique, and also , and starting to worry that some aspects of my physics might be a bit rusty to make sense of this stuff, sixteen years after my degree...


I want to fit a table in same column, but it seemed cannot fit, i do not want making the font size smaller than my other text.  \documentclass[12pt,oneside]{book}  \usepackage[showframe]{geometry} \usepackage{amsmath} \usepackage{ragged2e} \usepackage{makecell, multirow, tabularx} \renewcommand\theadfont{\small\bfseries} % for bold in table using \small \renewcommand\theadgape{} \usepackage[svgnames, table]{xcolor} \usepackage{hhline, boldline} \usepackage{seqsplit, caption} %for table spacing to second row \usepackage{booktabs, ragged2e} % Use booktabs rules and get rid of vertical rules, ragged2e to ragged text \usepackage{siunitx} %for table spacing to second row \usepackage{threeparttable} %to add footnote below table \usepackage{tabulary} \usepackage{graphicx}  \begin{document}    \begin{table}[h!] \centering     \begin{tabularx}{\textwidth}{l>{\raggedright\arraybackslash}Xccc}     \toprule     & & \multicolumn{3}{c}{\textbf{Paired Differences}} \\      \cmidrule{3-5}      & & \small {\textbf{Mean (\%)}}      & \thead{\small {\textbf{Std. Deviation}}\\ \textbf{(\%)}}& \thead{\small {\textbf{Std. Error}} \\ \textbf{Mean (\%)}} \\ \midrule     \multicolumn{1}{l}{Pair 1} & \textit{Testing exAple dataset} (BB) - \textit{Testing example dataset} (AA)      & 44.76 & 14.92 & 4.72  \\         \bottomrule     \end{tabularx} \caption{Table 1}     \label{tab:Table 1} \end{table}       \begin{table}[h!] \centering % \begin{center}     %\begin{tabularx}{\textwidth}{@{}M*{6}{N}@{}}     \begin{tabularx}{\textwidth}{>{\RaggedRight\arraybackslash}c X c c c c c }         \toprule     & & \multicolumn{2}{>{\centering\arraybackslash}p{8em}}{\textbf{95\% Confidence Interval of the Difference}}  &  \textbf{t}       & \textbf {df}        & \textbf {Sig. (2-tailed)}  \\      \cmidrule{3-4}  %\cmidrule(lr){3-4}      & & \multicolumn{1}{c}{\textbf{Lower}} &  \multicolumn{1}{c}{\textbf{Upper}} & & &\\ \midrule     Pair 1 & \textit{Testing example dataset} (BB) - \textit{Testing Example Dataset} (AA) & 34.09\% &  55.44\% & 9.49 & 9 & .000\\     \bottomrule     \end{tabularx} \caption{Table 2}     \label{tab:Table 2} \end{table} % \end{center}      \end{document}      I split the table into 2 which not good looking


Which happens first for a Magus, spell effect or weapon damage?

When using the Magus Spellstrike ability, which happens first, the spell or the weapon damage?


Regex - Why doesn't this .* (dot-star) match line-breaks?

/(
||\[code])(.*)(
||\[/code])/gi  This works if I have something such as:  foobar  But if I were to have a line-break like this:       Awesome    It will not match it, what am I doing wrong?


Transforming a cell index into cell representation

I have 2 integer values which represents a cell index in an excel sheet(excel 2010) and I need to create the corresponding excel cell representation(i.e 0,0 represents A1) out of it -  a basic string.  For example: - If the cell index is 0,0 then my code should output A1 (represents the first cell)   If the cell index is 0,1 then it should output B1 If the cell index is 0,27 then it should output AA1 If the cell index is 0,28 then it should output AB1 ..and so on.   I got it correct until A** and not beyond that from the below code..how can I modify the logic to output the correct excel cell representation for other indexes i.e beyond A** and it goes to B** and so on..  Code:   class Program     {         static void Main(string[] args)         {              for (int row  = 0; row < 2; row++)             {                 for (int column = 0; column < 50; column++)                 {                     var header = Headers(column + 1, row).Skip(column).First().ToString();                      Console.WriteLine(header);                 }             }              Console.ReadLine();         }          public static IEnumerable<string> Headers(int column, int row)         {             for (int index = 0; index < column; index++)             {                 if (index >= 26)                 {                     var firstInt = index / 26 - 1;                     var firstAplhabet = ((char)(firstInt + 65)).ToString();                     var secondInt = index - 26;                     var secondAlphabet = ((char)(secondInt + 65)).ToString();                      yield return firstAplhabet + secondAlphabet + (row + 1);                     continue;                 }                  var alphabet = ((char)(index + 65)).ToString();                  yield return alphabet + (row + 1);             }         }     }


derivative of cost function for Logistic Regression

I am going over the lectures on Machine Learning at Coursera.   I am struggling with the following. How can the partial derivative of   $$J(\theta)=-\frac{1}{m}\sum_{i=1}^{m}y^{i}\log(h_\theta(x^{i}))+(1-y^{i})\log(1-h_\theta(x^{i}))$$  where $h_{\theta}(x)$ is defined as follows  $$h_{\theta}(x)=g(\theta^{T}x)$$ $$g(z)=\frac{1}{1+e^{-z}}$$  be $$ \frac{\partial}{\partial\theta_{j}}J(\theta) =\sum_{i=1}^{m}(h_\theta(x^{i})-y^i)x_j^i$$  In other words, how would we go about calculating the partial derivative with respect to $\theta$ of the cost function (the logs are natural logarithms):  $$J(\theta)=-\frac{1}{m}\sum_{i=1}^{m}y^{i}\log(h_\theta(x^{i}))+(1-y^{i})\log(1-h_\theta(x^{i}))$$


I am trying to understand what it means to have an extension that is an algebraic closure of the base field. I'm looking for someone who can help conceptually.  I understand how $C/R$ looks. The basis of the extension is $\{1,i\}$, so the degree must be $2$. Moreover, the extension is Galois, and $\mathrm{Gal}(C/R)$ is isomorphic to C2.   However, I am unclear about how this works when we are working with finite fields. If we let $K$ be the algebraic closure of $F_p$, then I know $K$ as equivalent to $F_p$ adjoin every single root of every single polynomial in $F_p[X]$. I know, given $\alpha \in K$ implies $\alpha$ is the root of some polynomial, $p(x)$ of deg $n$ in $F_p[X] \Rightarrow [F_p(\alpha):F_p]=n$, and $[K/F_p] = |N|$, as was kindly pointed out below.  This extension is Galois (finite fields are always separable, and $K$ is clearly the splitting field of each xˆ(p)ˆn - 1, for every $n \in N$). So $\mathrm{Gal} (K/F_p) = |N|$. I want to clarify: what does $\mathrm{Gal} (K/F_p)$ actually look like? Am I correct to write $\mathrm{Gal} (K/F_p) = \{\sigma: a \mapsto aˆpˆn | n \in N\}$ ?


External HDD can't be detected on My Computer

Disc Management SC - can't find my external HDD:    My Computer SC -  can't access my external HDD:    Attached above are the screenshots showing how i can't access the files i have on my external HDD. It was still working perfectly fine yesterday but i was unable to access it today. What should i do to atleast fix the external HDD or recover the file?   Thanks


Let $c:I^2\rightarrow\mathbb{R}^3$ be the singular $2$-cube given by $$c(s,t)=(\frac{1}{2}s^2,st,\frac{1}{2}t^2)$$ Let $$\omega=xy^2dz$$  Questions:  i) Compute $c^*\omega$  ii) Compute $c^*d\omega$  iii) Compute $\int_cd\omega$  iv) Without using Stokes theorem, compute $\int_{\partial c}\omega$ (Hence verifying Stokes theorem)  Answers:  (Parts (i)-(iii) checked and are correct)   i) I have gotten: $c^*\omega=\frac{1}{2}s^4t^2dt$  ii) $c^*d\omega=d(\frac{1}{2}s^4t^2dt)=2s^3t^2ds\wedge dt$  iii) $\int_cd\omega=2\int_0^1(\int_0^1s^3t^2ds)dt=2\frac{1}{4}\frac{1}{3}=\frac{1}{6}$  iv) I am using the formula $\int_{\partial c}\omega=\sum_{j=1}^2\sum_{\alpha=0,1}(-1)^{j+\alpha}\int_0^1c^*_{(j,\alpha)}\omega$  I have computed that $c_{(1,0)}(t)=(0,0,\frac{1}{2}t^2),c_{(1,1)}(t)=(\frac{1}{2},t,\frac{1}{2}t^2),c_{(2,0)}(t)=(\frac{1}{2}t^2,0,0),c_{(2,1)}(t)=(\frac{1}{2}t^2,t,\frac{1}{2})$  So $c_{(1,0)}^*\omega=0,c_{(2,0)}^*\omega=0,c_{(2,1)}^*\omega=0$  Point of contention:  My calculation:   $c_{(1,1)}^*\omega$ is the only non-zero part for $\partial c$  And $c_{(1,1)}^*\omega=\omega(\frac{1}{2},t,\frac{1}{2}t^2)=\frac{1}{2}\cdot t^2\cdot d(\frac{1}{2}t^2)$ from the definition of $\omega=xy^2dz$  This gives $\omega(\frac{1}{2},t,\frac{1}{2}t^2)=\frac{1}{2}t^2\cdot tdt=\frac{1}{2}t^2\cdot tdt$  So I have gotten $c_{(1,1)}^*\omega=\frac{1}{2}t^3dt$  this is wrong since,  Answer given: $c_{(1,1)}^*\omega=\frac{1}{2}t^2dt$  and the next step is $$\int_{\partial c}\omega=\int_0^1\frac{1}{2}t^2dt=\frac{1}{6}$$  Which must be correct since this verifies Stokes theorem from part (iii)  And my answer must be wrong since it gives $\int_{\partial c}\omega=\frac{1}{8}$  The answer also has $c_{(1,1)}(t)=(\frac{1}{2},t,\frac{1}{2}t^2)$, but computes $c_{(1,1)}^*\omega$ as $\frac{1}{2}t^2dt$, whereas I get $\frac{1}{2}t^3dt$  Where am I going wrong with this calculation, it is probably a simple mistake, any help would be greatly appreciated.


The wireless used to be just fine now is dead slow.  How i should troubleshoot this issue any idea? Thank you.


Should I use multiplication or division?

Here's a silly fun question:  Let's say we have to perform a simple operation where we need half of the value of a variable. There are typically two ways of doing this:  y = x / 2.0; // or... y = x * 0.5;   Assuming we're using the standard operators provided with the language, which one has better performance?  I'm guessing multiplication is typically better so I try to stick to that when I code, but I would like to confirm this.   Although personally I'm interested in the answer for Python 2.4-2.5, feel free to also post an answer for other languages! And if you'd like, feel free to post other fancier ways (like using bitwise shift operators) as well.


What sequence would be an example of a Cauchy sequence that diverges?

In metric space every convergent sequence is a Cauchy sequence, but what about the converse?


Determining bare earth DEM from unclassified LAS file?

I have data in LAS format with RGB values created from aerial photogrammetry using a UAV. I am  trying to find a solution to extract the bare earth DEM from the point cloud.   I have tried SAGA, Fusion, MCC-LIDAR, but it is seems they need the LAS file to be already classified (which it naturally isn't). Can anyone point me in the right direction with a brief explanation of the process?   Generally, I would need to process about 100 mill points at a time (can tile them if needed).


How to insert a string into a specific position in a file using Java?

Lets say hello.txt contains the string "Hello John". I have a string variable str="dear". I need to insert it directly into the file after Hello i.e. after 5th position. After executing the function file must contain "Hello dear John".  Is there a function for this in Java?


Marking correct answer when multiple answers are used

On some Stack Exchange sites it is unclear to me which answer to accept as correct. For example, sites such as lifehacks, scifi and personal productivity, give theories and tools, several which (or a combination) may be right. In this example  however I used solutions from multiple answers at some point in time.  Which answer, if any, should be marked as correct? Is there pressure to mark any answer as correct? I guess I always assumed the correct answer is the one actually used. IMO there shouldn't be pressure on accepting an answer, however there often is from those who posted the answer as they would get more points for an accepted answer.


In a certain interview this question was asked to one of my friends by the interviewer      what is the probability of this running fan (pointing at a ceiling fan) to fall down?   Actually to find the answer I feel that sample space is two   a. Either the fan will stay at its position. b. Or The fan will fall down.  So what I feel, probability is 50%   Please let me know whether this is true or false, guide me for the thinking. I'm also going to sit for similar kind of interview. Please help


Let's assume, we have following class:  public class foo  {     private string something     public string Something     {         get { return something; }         set { something = value; }     } }   If we don't need to use field something, we can write it shortly, as:  public class foo {     public string Something { get; set; } }   It's OK.  But is there a way to short-write following class:?  public class foo  {     private List<string> something = new List<string>()     public List<string> Something     {         get { return something; }         set { something = value; }     } }   EDIT:  OK, found    And since c# 6 we can write:  public List<string> Something { get; set; } = new List<string>();   Thanks for attention.


Determining if data is normally distributed

I'm working on a case study where the number of phone calls (min = 0 calls and max = 10 calls) is measured every 30 seconds in a metro station. The experiment was done three times during on day where the number of phone calls were measured every 30 seconds for one hour. Hence, the data that has been collected has three experiments. Each experiment therefore has 120 measurements of phone calls ranging from 0 to 10. The data in my excel sheet has three columns (one for each experiment) and each column has 120 entries.   Experiment 1 | Experiment 2 | Experiment 3 10             2              5 5              3              2 8              1              5 1              1              6 .              .              . .              .              .   What I'm trying to figure out is how to determine if the data I have is normally distributed and if my sample mean is normally distributed. The first thing that came to find is to figure out the frequency of the number of phone calls and throw them in a histogram, but the histogram is all over the place and has no normal distribution feel to it and cannot conclude the data is not normally distributed.   Experiment         1        2       3 Mean           5.150    4.567   5.092 = 4.936 E(X-bar) STD            2.975    2.734   2.959 VAR            8.851    7.475   8.756


I'm sorry, but my code is in german! (I hope that's not a problem!)  My problem is, that even if (at the bottom) the input is "Ja"("Yes") or "ja"("yes") Java just skips it and does the else-clause!  Thanks to everyone in advance!  import java.util.Scanner; public class Pizza {     private double preis;     private int anzahl;      public Pizza() {         preis = 5.50;         anzahl = 0;     }      public void hinzufuegen(int tmp) {         anzahl = anzahl + tmp;     }      public void entfernen(int tmp) {         anzahl = anzahl - tmp;     }      public void drucken() {         System.out.println("Pizzen: " + anzahl + " Preis: " + preis * anzahl);     }      public static void main(String[] args) {         Pizza Margherita = new Pizza();         Scanner scan = new Scanner(System.in);          System.out.print("Wie viele Pizzen willst du? ");         Margherita.anzahl = scan.nextInt();          System.out.print("Bist du dir sicher, dass du " + Margherita.anzahl + " Pizzen willst? ");         String input = scan.next();          System.out.println(input);          if(input=="Ja" || input=="ja") {             Margherita.drucken();         }         else {             System.out.println("Schade!");         }     } }


How can I scale all images in a folder to the same width?

I want to scale all images in a given folder to the same width (but different appropriately scaled heights). How can I do this using  a GUI-based or command-line tool?  For bonus points, is it possible to restrict which images are scaled based on their initial width (that is, only scale images that have a width > x and/or a width < y)?


I have a friend that has the German Lugar, Helmet, and Bayonet from a German soldier that this American soldier had killed during WWII and would like to locate heirs to return these items to them. We have misplaced his dog tag and will try to find them. His name is in his helmet.  These items were given personally by him to a Cuban soldier after the war. If we locate the name can you help us locate any of his heirs. The owner of these items was married to a Cuban National so I know it is authentic information. The Lugar is locked in a Bank safe deposit box.  I think his family should have these personal items.


What is the best way to get the minimum or maximum value from an Array of numbers?

Let's say I have an Array of numbers: [2,3,3,4,2,2,5,6,7,2]  What is the best way to find the minimum or maximum value in that Array?  Right now, to get the maximum, I am looping through the Array, and resetting a variable to the value if it is greater than the existing value:  var myArray:Array /* of Number */ = [2,3,3,4,2,2,5,6,7,2];  var maxValue:Number = 0;  for each (var num:Number in myArray) {     if (num > maxValue)         maxValue = num; }   This just doesn't seem like the best performing way to do this (I try to avoid loops whenever possible).


How to make use of Devel debugging functions on large or complex objects

I am having trouble making real use of Devel's debugging functions kint() and dpm() in my modules and twig templates. They work fine for primitive variables, flat arrays and such, but if I want to inspect into some object like an EntityRerefenceFieldItemList they either cause the site to crash (white page) or generate so much data such that the scripts for expanding the list no longer work.  How do I circumvent these problems?


Derivation of Kubo Formula for Hall Conductance

I am trying to derive the result of the TKNN formula but am experiencing difficulty in deriving the Kubo formula. The Kubo formula used in the TKNN paper is, $$ \sigma_{xy}= \frac{ie^2}{\hbar} \sum_{E^a < E_F < E^b} \frac{\langle a|v_x|b \rangle \langle b|v_y|a \rangle - \langle a|v_y|b \rangle \langle b|v_x|a \rangle}{(E^a - E^b)^2} .$$  The following is my work so far. First of all, from linear response theory, for a general observable, $$ O=\langle\hat{O}(t)\rangle-i\int_{t_0}^{t}\mathrm{d} t' \langle[\hat{O}(t),H_{\mathrm{ext}}(t')]\rangle $$ where $H_{\mathrm{ext}}$ is the perturbing Hamiltonian. Since $H_{\mathrm{ext}}=-\int J\cdot A(r,t)\mathrm{d}^3r$, if we consider current density we have $$ \vec{J}_i(r,t)=\langle j_i(t)\rangle+i\int_{-\infty}^{t}\mathrm{d} t'\int\mathrm{d}^3{r'} \langle[j_i(r,t),j_j(r',t')]\rangle A_j(r',t'). $$ Ignoring the first term, we can rewrite this as $$ \vec{J}_i(r,t)=-\int_{-\infty}^\infty\mathrm{d}t\int \mathrm{d}^3r R_{ij}(r-r',t-t')A_j(r',t') $$ where $$ R_{ij}(r-r',t-t')=-i\theta(t-t')\langle[j_i(r,t),j_j(r',t')]\rangle. $$ We can assume that $A(r,t)=A(r)e^{-i\omega t}$ to show that $E(r,t)=i\omega A(r,t)$. Then by Fourier transforming the expression for the expectation value of the current density, we get $$ \vec{J}(k,\omega)=-\frac{R_{ij}(k,\omega)}{i\omega}E_j(k,\omega) $$ which means DC conductivity is $$ \sigma_{ij}=\lim_{\omega\rightarrow0}\frac{iR_{ij}(k,\omega)}{\omega} $$ The Fourier transform of the response function can be shown to be, $$ R_{ij}(k,\omega)=-i\int_0^\infty \mathrm{d} t e^{i\omega t}\langle[j_i(k,t),j_j(-k,0)]\rangle $$ If we evaluate expectation values using the grand canonical ensemble (ie $\langle \hat{O}\rangle = Tr(e^{-\beta H} \hat{O})/Z$ where $H$ includes the chem. pot.) and integrate over time and perform a first order $\omega$ expansion we end up with $$ R_{ij}(k,\omega)=\sum_{n,m}(e^{-E_m \beta}-e^{-E_n\beta})\left(\frac{\langle n|j_i(k,\omega)|m\rangle\langle m|j_j(-k,\omega)|m\rangle}{E_n-E_m+i\epsilon}-\omega\frac{\langle n|j_i(k,\omega)|m\rangle\langle m|j_j(-k,\omega)|m\rangle}{(E_n-E_m+i\epsilon)^2}\right)/Z $$ This is from where I don't know how to proceed. All derivations for the Kubo formula I have found on this site and other resources online do not consider the position dependence of the current density operator. Any advice that will point me in the right direction will be appreciated.


Is $\mathbf{Q}(\sqrt{2}, \sqrt{3}) = \mathbf{Q}(\sqrt{2}+\sqrt{3})$?

Is $\mathbf{Q}(\sqrt{2}, \sqrt{3}) = \mathbf{Q}(\sqrt{2}+\sqrt{3})$ ?    $$\mathbf{Q}(\sqrt{2},\sqrt{3})=\{a+b\sqrt{2}+c\sqrt{3}+d\sqrt{6} \mid a,b,c,d\in\mathbf{Q}\}$$   $$\mathbf{Q}(\sqrt{2}+\sqrt{3}) = \lbrace a+b(\sqrt{2}+\sqrt{3}) \mid a,b \in \mathbf{Q} \rbrace  $$  So if an element is in $\mathbf Q(\sqrt{2},\sqrt{3})$, then it is in $\mathbf{Q}(\sqrt{2}+\sqrt{3})$, because $\sqrt{6} = \sqrt{2}\sqrt{3}$.  How to conclude from there?


Being in "Reviewer invited" state for 3 months, What could it say?

For a math journal, after 4 weeks of submission, the status went from "with editor" to "reviewer invited", and its been in that particular state for the past 3 months. If you have any editorial experience, I'd like to know when would this kind of state happens, and does it say anything about the manuscript content, especially why the editor is finding hard to get the reviewers accept invitation, or is it that the reviewers for the subject matter of the paper, are rare to find?  Edit : more informtion  I have enquired. The Editorial Manager assured me that the Editor is carefully following and taking good care of the review process. What I have seen in earlier communication with Editor, I have no reason to doubt his interest in the manuscript. He seemed very much interested.


Let $f \colon \mathbb{R} \rightarrow  \mathbb{R}$ be a smooth function such that $$f'(x) = f(1+x)$$ How can we find the general form of $f$? I thought of some differential equations, but not sure how to use them here. Thanks.


Is there a way to report spam, or OT comments on Stack Exchange blogs?

Is there a way to flag spam comments, or other OT comments on a Stack Exchange blog? Is there a way for blogs associated to Stack Exchange 2.0 sites? I just noticed the last two comments on : One seems a tentative of spamming (without any links), and the other is an OT comment about vacation.


I searched for an answer using the title of this question on Meta.Workplace and on Meta.SE but nothing came up.   has been upvoted a lot.  But the person that wrote the initial answer only has 1 reputation.  How?


URLEncode characters in string for a curl request using bash?

I am working on a wit.ai project and I want the user to be able to type a query/request in plain human readable text (e.g "Turn on the lights") and the program will convert it to a formatted version designed to be put in a curl request (e.g "Turn%20on%20the%20lights"). How would I for example turn "Stack Exchange" into "Stack%20Exchange" using tools in bash?


When I'm signed in and try to downvote a question having less than 125 reputation, I get this message:     Thanks for the feedback! Votes cast by those with less than 125 reputation are recorded, but do not change the publicly displayed post score.   According to that dialog, the vote doesn't change the publicly viewable score, but its recorded somewhere.  When I'm not signed in and I try to downvote, it says this:     This action requires 125 reputation.      Setting up an account is free and open to everyone. Set up your account today and earn extra privileges like posting, commenting and voting.   It doesn't say anything about whether or not the vote is recorded.   Do votes get recorded (without changing the public score) even without being signed in?


Travelling back to US with unpaid hospital bills

About a year ago I visited my US, and needed emergency treatment for a small accident. My insurance company refused to pay for it, and I am unable to cover the bill. it's not a large amount, but large enough.  Should I want to re-visit the US, will I have any issues at immigration while getting in?


Highlighted source code inline with Latex/Minted?

I am using the minted package (based on pygments) to do syntax-highlighting for xml-code in my Latex documents. However I did not find an option to make it display the code inline.  \mint{xml}|<?xml version="1.0" ?>|   does a single line but does not display inside a text line. Is that achievable using minted?


Ubuntu 20.04, classic can't drag and drop problem

Installed 20.04 on 4/23 and can't drag and drop. I've had this issue with previous LTS installs and fixed it by toggling "experimental views" on/off through gsettings. That's not working this time.


Is there any way to implement 'abstract class method' in java?

Update: I know that a static method can't be abstract, and I know why, and it's not a question like 'Whether it's possible?' or 'why it's not possible?', I just want to know if there's any way to get what I want.  Well, if you heard about @classmethod in python, you can skip the rest.  And here's what I want: In some cases, some methods are just functions, what I only need is its functionality. However, in Java, you have to put everything in a class, so I have to wrap these function in a class and set them static. The thing is, for classes like this one, I don't, and I shouldn't need any of its instance. And in the mean time, I want some hierarchy for classes like this. The hierarchy here works like some 'control': I can control sub-classes for what you should do, aka what method/function you should have.     As we all known, we can't declare a static abstract method in a class.  However, there can be situations when you only need the method rather than an instance, and you need the method to be abstract and implement it in sub-classes.  Some guys pointed out that , but is there any possible solution for this?


How to refresh the specific Lightning component not the lightning page

I have two lightning component placed on one page lightning app. First Component have refresh icon and I set onclick action to refresh Component $A.get('e.force:refreshView').fire(); but this event refresh the whole page instead of First component.  how can refresh only one component on page not all the page ?


Noetherian ring whose ideals have arbitrarily large number of generators

Does a commutative ring satisfying the following two properties exist?    All ideals are finitely generated; There are prime ideals with arbitrarily large (finite) minimal generating sets.


Can an F-Test be worse than the two single T-Tests?

Normally when conducting an F-Test one is hoping the F-Test of all variables is significant although the single T-Tests yield insignificant results.  But can the reverse also be true? That is a worse F-Test than the single T-Tests?


Typedef of function in class with templates: is not a type

I have class WtVector which contains an array[Dimension] and I don't want to access to its elements directly, so I came up with an idea to make mapper function type, so if I needed to have say 5th variable, I go like mapper(5) but not vector.el[4]  template <typename Space, int Dim> struct WtVector {     Space el[Dim] = {};      typedef Space (*Mapper)(int);      Mapper getMapper();  };   But whenever I put WtVector<Space, Dim>::Mapper as type the compiler shouts that it's not a type  template <typename Space, int Dim> struct WtVectorOps {     ... some other stuff ...      static Space sqrMagnitue(WtVector<Space, Dim>::Mapper vec); };   Error:  error: ‘WtVector<Space, Dim>::Mapper’ is not a type static Space sqrMagnitue(WtVector<Space, Dim>::Mapper vec);                                                ^   Is it possible to have such typedef in class and if not what is the best alternative solution? If there exists easier solution than creating subclass and defining operator()


Cannot boot Windows 8.1 after migrating to Samsung SSD using supplied software

I got a brand new Samsung 840 SSD. It came with "Data Migration" software from Samsung. I am running Windows 8.1.  Here are my steps exactly:     Installed new SSD into secondary bay (Disk 0: HDD, Disk 1: SSD).   Used the supplied software to migrate partitions C:\ and D:\ (the tool did not list any hidden OEM recovery or UEFI partitions) to the new SSD.   Shut down the computer.   Swapped the positions of the drives (Disk 0: now SSD, Disk 1: old HDD).   Booted up.     After this, Windows booted up, however according to Disk Manager, it booted from Disk 1 (the old HDD). I don't understand why, since I swapped the drives and did not change BIOS settings.  So now, I tried to fix:     Rebooted to BIOS/UEFI Changed boot priority to Disk 0 (the SSD)... again I don't understand how BIOS decided to automatically change it to Disk 1 (now the HDD) considering there was no Disk 1 before.   Booted to Windows.   It now boots up correctly, but still from Disk 1 (the HDD). Next:     Removed HDD from the bay (Disk 0: SSD, Disk 1: nothing).   Verified in BIOS that boot priority was Disk 0 only (disabled all other boot options).     Windows kind of booted up to login screen (without wallpaper, and with a black screen after login. I can move the mouse, and even bring up the Ctrl+Alt+Del screen that lets me log out, but that's pretty much it. Even the power button in the UI does not work.  So what am I doing wrong? I want to move the OS to the new SSD, and continue to have the old HDD as a data drive (I will remove the old OS partition from the HDD once I get the SSD working)


How does item level and rarity affect the possible attributes?

Someone found this quiver with surprisingly high values, although I'm unable to find a level 30 rare quiver on     Given that the item's internal level (IIL) determines which affixes are possible, I'd like to know whether the IIL affects the minimum/maximum rolls for an attribute, a graph or table would be great.  For example, let's say items are able to get a pure +intellect affix from IIL 20, what's stopping you from rolling 250 at 20?  Is it a bell curve, which has shallower gradients with a higher IIL of the item?  Is it capped, dependant on IIL?  Do the min/max caps step up at certain IILs,though it's the same attribute? For example, IIL 20-40 is capable of 5-120, IIL 41-60 is capable of 20-320, ..., IIL 63 = 40-400


How to check if the result string is equal to "TIN" and the result of code is "TIN NEBULA 1023-212"?

I'm trying to check the string if a sentence has a word "TIN" but it says false when i try to use equal or '=='. Here is my code.              if (!recognizer.isOperational()) {                 Toast.makeText(this, "Error", Toast.LENGTH_SHORT).show();             } else {                 Frame frame = new Frame.Builder().setBitmap(bitmap).build();                 SparseArray<TextBlock> items = recognizer.detect(frame);                 StringBuilder sb = new StringBuilder();                 //get text from sb until there is no text                 for (int it = 0; it < items.size(); it++) {                     TextBlock myItem = items.valueAt(it);                     sb.append(myItem.getValue());                     sb.append("\n");                     if (myItem.getValue() == ("TIN")) {                         Toast.makeText(this, "VERIFIED ID", Toast.LENGTH_SHORT).show();                     } else {                         Toast.makeText(this, "WRONG ID", Toast.LENGTH_SHORT).show();                     }                 }                 //set text to edit text                 mResultEt.setText(sb.toString());             }


Arrangements of a,a,a,b,b,b,c,c,c in which no three consecutive letters are the same

Q: How many arrangements of a,a,a,b,b,b,c,c,c are there such that  $\hspace{5mm}$ (i). no three consecutive letters are the same?  $\hspace{5mm}$ (ii). no two consecutive letters are the same?  A:(i). 1314. ${\hspace{5mm}}$ (ii). 174.  I thought of using the General Principle of Inclusion and Exclusion along with letting $p_i$ denote a property that.. , and doing so, I will evaluate $E(0)$, which gives us the number of arrangements without any of the properties.   How do I go about doing that? I am trying to use the method stated above in solving this question, but I am unable to generalize the properties $p_i$.


What is difference between "gray" and "grey"?

I want to ask what the difference beetween "gray" and "grey" as the color names?  Is there a difference like that one might be adjective, and the other one might be name?


the Nordhaus-Gaddum problems for chromatic number of graph and its complement

Is there any relation between the chromatic number of a graph $G$ and its complement $G'$ that are always true?  I saw these ones: $\chi(G)\chi(G')\geq n$ and $\chi(G)+\chi(G')\geq 2n$,  but I'm not pretty sure about them.


The assignment says "using conditionals and a while loop, prompt the user to either ask another question of thank them for using the program, depending on what they decide."  Trying to figure out how to use a while loop to continuously prompt the user to decide if they would like to continue. Wouldn't I need a new scanner each time?  Also, my program stops right after the user enters yes or no in the second scanner. Ahhhhhh.  Here's what I'm working with:     System.out.println("Hello!\nNeed to make a decision?\nWant to know about the future?\nType in a yes or no question and press Enter: ");     Scanner reader = new Scanner(System.in);    String question = reader.nextLine();     System.out.println();     Random generator = new Random();    int rand = generator.nextInt(20) + 1;     if (rand == 1)    { System.out.println("It is certain.");}     if (rand ==2)     {System.out.println("It is decidedly so."); }     if (rand ==3)    {System.out.println("Without a doubt."); }     if (rand ==4)     { System.out.println("Yes, definitely.");}     if (rand ==5)    {System.out.println("You may rely on it.");}     if (rand == 6)    {System.out.println("As I see it, yes."); }     if (rand == 7)    {System.out.println("Most likely.");}     if (rand == 8)    {System.out.println("The outlook is good");}     if (rand == 9)    {System.out.println("Yes.");}     if (rand == 10)    {System.out.println("Signs point to yes.");}     if (rand == 11)    {System.out.println("Reply hazy.");}     if (rand == 12)    {System.out.println("Ask again later.");}     if (rand == 13)    {System.out.println("Better not tell you now.");}     if (rand ==14)    {System.out.println("Cannot predict now.");}     if (rand ==15)    {System.out.println("Concentrate and ask again.");}     if (rand == 16)    {System.out.println("Don't count on it.");}     if (rand == 17)    {System.out.println("My reply is no.");}     if (rand ==18)    {System.out.println("My sources say no.");}     if (rand == 19)    {System.out.println("Outlook does not look so good.");}     if (rand == 20)    {System.out.println("Very doubtful.");}      System.out.print("\nWould you like to ask another question?: ");    Scanner reader2 = new Scanner(System.in);    String YesNo = reader2.nextLine();       if (YesNo == "no") {        System.out.println("Thanks for playing!"); }       while (YesNo == "yes") {       System.out.println("Enter your question: ");     Scanner reader3 = new Scanner(System.in);    String question2 = reader3.nextLine();     Random generator2 = new Random();    int rand2 = generator.nextInt(20) + 1;     System.out.println();     if (rand2 == 1)    { System.out.println("It is certain.");}     if (rand2 ==2)     {System.out.println("It is decidedly so."); }     if (rand2 ==3)    {System.out.println("Without a doubt."); }     if (rand2 ==4)     { System.out.println("Yes, definitely.");}     if (rand2 ==5)    {System.out.println("You may rely on it.");}     if (rand2 == 6)    {System.out.println("As I see it, yes."); }     if (rand2 == 7)    {System.out.println("Most likely.");}     if (rand2 == 8)    {System.out.println("The outlook is good");}     if (rand2 == 9)    {System.out.println("Yes.");}     if (rand2 == 10)    {System.out.println("Signs point to yes.");}     if (rand2 == 11)    {System.out.println("Reply hazy.");}     if (rand2 == 12)    {System.out.println("Ask again later.");}     if (rand2 == 13)    {System.out.println("Better not tell you now.");}     if (rand2 ==14)    {System.out.println("Cannot predict now.");}     if (rand2 ==15)    {System.out.println("Concentrate and ask again.");}     if (rand2 == 16)    {System.out.println("Don't count on it.");}     if (rand2 == 17)    {System.out.println("My reply is no.");}     if (rand2 ==18)    {System.out.println("My sources say no.");}     if (rand2 == 19)    {System.out.println("Outlook does not look so good.");}     if (rand2 == 20)    {System.out.println("Very doubtful.");}      System.out.print("\nWould you like to ask another question?: ");  } }   }


Problem installing .deb in Software Install Ubuntu 20.04

I tried to install some .deb files in Ubuntu 20.04 from GitHub and other internet sources, but when I open it with Software Install it gives me  problem (Failed to install file: not supported). The only way for me to install them is to go to the downloaded file and do sudo dpkg -i file.deb. Can anyone help? I don't know what to do and I don't want to use the terminal every time. Any help would be appreciated, thanks EDIT: that's NOT a problem with .deb in Ubuntu, it is a problem with Software install. I can install every .deb through the terminal but not with Software install, and Ubuntu suggests to install .deb with Software install. That's not a dependencies problem or anything similar, that's an issue with installing .deb WITH Software install and I would like to know how I can fix Software installer


We are learning vectors in class and I have a question about parallel lines and coincident lines. According to wikipedia a parallel line is:      Two lines in a plane that do not intersect or touch at a point are called parallel lines.   But another reference says     Side by side and having the same distance continuously between them.   According to the above definition, you can have two parallel lines with a distance of zero but this contradicts the first definition. So which is it?  EDIT:  If it is the second definition then you can have two lines that are coincident and parallel right?


What's the most efficient way to obtain XP from 1.12 - 1.14?

I've only played a lot of Bedrock edition, but I just came up with Minecraft Java Edition and I have no clue here.  I made a bit of research and found out that these ones are around the best:   Guardian farms (Highly efficient, but highly resources friendly) Enderman farms (Efficient and resources friendly) Witch farms (Didn't found a result about its efficiency)   Also, I saw a video where furnaces can store XP since earlier versions of Java and someone build a cactus based farm where you can get to level 30 by just taking out one cactus after letting the farm working by almost an hour.  What are the best strategies to obtain XP for enchanting with higher levels in Java Edition?


How to remove an apt repository that I added myself?

I was following an old tutorial and did an apt-get installed a repository (I think that's what it was) I am no ubuntu guru.  Turns out that repo no longer exists, and when I now do an apt-get update I get this:  W: Failed to fetch http://ppa.launchpad.net/colingille/freshlight/ubuntu/dists/wily/main/binary-i386/Packages  404  Not Found   I tried the usual   sudo rm /var/lib/apt/lists/* -vf   but no luck.  Where is the list that stores all the repos that i added myself?  How do I get rid of this?


What is the reasoning behind the rules for compounding errors?

There has to be a reason behind why we add fractional errors when the involved quantities are being multiplied or divided, or why, when converting units, do we have to divide the uncertainty with the number that divides the value.


Quite a while back I read a story where the Devil comes to an astronomer (?) and wants his soul.  The astronomer agrees with the condition that he gets one thing from the Devil and he will tell him what it is when he's ready.  Being greedy, the Devil agrees and thru the years keeps asking the astronomer what it is that he wants but never gets an answer.  Finally, on his death-bed, the astronomer tells the Devil he wants a "personally guided tour of the entire Universe by the Devil himself".  What is the name of that story?


What is $\lambda_{min}$ that makes all regression coefficients zero in LASSO regression

I learnt that in LASSO regression, there is this $\lambda_{min}$ which is given by  $$\lambda_{min} = \text{max}_j|\sum_t y_t X_{tj}|$$ in which $y$ is the response, $X$ is the matirx of predictors.  So, when you plug this $\lambda_{min}$ into the objective function  $$\text{argmin}_{c \in \Bbb R^{M}} (\Vert y - Xc \Vert_2^2 + \lambda_{min} \Vert c \Vert_1)$$ the vector of regression coefficients $c$ will be a zero vector.  My questions:   What is the intuition of this $\lambda_{min}$? I am not focusing on a rigorous mathematical proof, I just want to intuitively understand this $\lambda_{min}$ so I can use this with more confidence, say for feature selection.  Does this $\lambda_{min}$ apply to other cost function like MaxAE other than squared reconstruction error?    I just learned this $\lambda_{min}$ while reading a research paper. However, I haven't found a definition of this in a textbook. Any references will be appreciated.


Using pattern matching to reduce IP Spoofing

The IP Spoofing is becoming a major concern these days.I was wondering whether we could use pattern matching,like comparing the hop count of the packets coming or the TTL(Time To Live) field of the IP datagram to reduce IP spoofing.Is there any way for this?


How to load two times the same updated csv with d3

Is it possible to load the same csv twice with d3?  I have a flask server which updates a csv file every 10 seconds. I would like to reload the graph of the data every 10 seconds.  I used setInterval and inside I reuse  d3.csv("static/data.csv", function(error, data) {...   But when I print the data variable I always get the same graph, as if the csv didn't change.  When I refresh the page it takes the new data and there is no problem.


Why every polynomial over the algebraic numbers $F$ splits over $F$?

I read that if $F$ is the field of algebraic numbers over $\mathbb{Q}$, then every polynomial in $F[x]$ splits over $F$. That's awesome! Nevertheless, I don't fully understand why it is true. Can you throw some ideas about why this is true?


What is Dumbledore's fascination with socks?

In the Harry Potter books, Prof. Dumbledore doesn't fail to mention his love for socks, but he does fail to mention the reason for his fascination with them.  I think that when Harry asked him what Dumbledore saw in the Mirror of Erised, the truth was he saw his family: his sister, brother and mother; but he told Harry his second favorite desire instead: Holding woolen socks. What is the meaning of this fascination?


Show that the function $f(z) = xy + iy$ is nowhere analytic.   Attempt:   $u_x = y, v_y = 1 , v_x = 0, u_y = x$  Hence the CR equations hold only for $(0,1)$. Doesn't it mean that the function is differentiable (analytic) at that point? So is the question wrong as it says "nowhere" analytic.


Displaying Duplicate Record Ids for External Id

I have created the field set as External Id and now I am changing the field to set as unique record identifier, I am not able to change, because Records exist already with duplicate values for that field.   So I want to query all the duplicate records. How do I perform a query to display the duplicate values for that particular field in test sandbox?   Then I will delete all the fields which contains duplicate External Ids, then I can change the field to Unique. Please anyone Guide me how to write a Query for Displaying the Duplicate Record Ids.


How to prove the Riemann hypothesis holds for the first non-trivial zero?

The Riemann hypothesis states that all non-trivial zeros of the Riemann zeta function $\zeta(z)$ lie on the critical line $\Re(z)=1/2$.  The  page on this topic mentions that the hypothesis has been verified for the first ten trillion $(10^{13})$ zeros. Unfortunaly I have never seen an explicit proof that the first non-trivial zero $$\rho_1\approx0.5000000000...+i\,14.1347251417...$$ lies exactly on the critical line. Could you please show me a proof of this?


How did Malcolm Crowe not realize something was way off?

Malcolm interacts with nobody but Cole, and when I say nobody, I mean not a single soul.   I understand that Malcolm is lonely and possibly doesn't have many friends or anything, but this means that he had literally zero interaction with strangers on the street, shop owners (if he ever wanted to buy something), people he knew (if he saw someone he knew, they would've never said "hi" back), and was basically invisible to the entire world. Thinking realistically, I don't think a regular person would get through a few hours without realizing that something was really, really wrong if they were invisible to the world (i.e. dead). Are there any explanations for this, or does M. Night just expect you to believe that Malcolm didn't realize that the world (other than Cole) didn't acknowledge his existence in the slightest?  PS - I am aware that Malcolm senses something wrong in his relationship with his wife, but, as I've explained, him not being alive means that literally no one realizes he exists and "sees" through him.   PPS - Additionally, how does he throw a brick through his wife's window (when she's talking to that other guy)? Or is it not him at all?


I create a link in ajax callback function and define a class for that, commands that I write on click of this link doesn't work. the code is here:  $('.catpics').click(function(){    var id=$(this).attr('id');    $.post('storehouse.php', {      catid:id,      btn:'showsub'    },function(data){      $('#subcatshelf').append(''+data+'');    });