How to not to export Private functions in the object?

I am trying to figure out how to not to exports the private functions when using functions in the objects.  For example, in modules.js I have the following:  const modelType1 = require('./Message/type1');  module.exports = {     Type1: modelType1 }   type1.js look like this:  const Message = {     publicFunction: function() {         return 'hello!';     },      privateFunction: function() {         return 'hello!';     } }  module.exports = Message;   How to not to export privateFunction?  When I tried to different approach without using an object which I have got it to work, for example:  const modelType2 = require('./Message/type2');  module.exports = {     Type2: modelType2 }   type2.js look like this:  function publicFunction() {     return "Hello" }  function privateFunction() {     return "Hello" }  module.exports = {     publicFunction }   Which is best practice to use type1.js or type2.js and what the difference between them two?


What do you call a combination of date and time?

Those who know programming simply call this as DateTime. For example, "2015-12-22 03:11:25".  Instead of referring it to simply DateTime, is there any other suitable name?


9 rows is just way too small by default. Is this a text-editor for ants?


Style bug, for comments tab in user profile in Chrome

Browser information:  Google Chrome. I try it in two different computers, both with  Version 34.0.1847.116.  Steps to reproduce:  When you go to your user profile, then to the responses tab, then to comments,  and then you select the text of a comment it would look as the Image 1 shows.   Site information:  I have only test it on Stackoverflow.com The URL would be something like this:  http://stackoverflow.com/users/<user-id-here>?tab=responses&sort=comments    Image1:


How can I prove that $n^7 - n$ is divisible by $42$ for any integer $n$?

I can see that this works for any integer $n$, but I can't figure out why this works, or why the number $42$ has this property.


What is the physical meaning of a dot product and a cross product of vectors?

My teacher told me that Vectors are quantities that behave like Displacements. Seen this way, the triangle law of vector addition simply means that to reach point C from point A, going from A to B & then to C is equivalent to going from A to C directly.  But what is the meaning of a product of vectors? I cannot imagine how a product of displacements would look like in reality. Also, how do we know whether we need the scalar (dot) product or a vector (cross) product?


If $X$ and $Y$ are independent then $f(X)$ and $g(Y)$ are also independent.

Knowing that if you have two independent $X$ and $Y$, and $ f $ and $ g $ measurable functions, how to show that then $ U = f (X) $ and $ V = g (Y) $ are still independent.


Is two cars colliding at 25 mph the same as one car colliding into a wall at 50 mph in reference to injuries?

This question has been asked using 50 & 100 mph reference, see  Phys.SE post and links therein. However, I am interested in the potential injuries to occupants of the autos. As the one going into the wall has occupants going 50 miles per hour.  The 2 cars have occupants in each car only going 25 mph at time of crash.  Would the occupants of the 2 cars not have as much damage as the car with the wall as the 2 cars would decelerate based  on the crushing of the cars.  Knowing that the 2 cars would be absorbing the energy more than the 1 into the wall at 50 mph.


How to kill unity panel & unity launcher?

I'd like to find out which process is responsible for Unity panel and launcher.. In case I'd like to close one of them, which process to I have to kill?  Thanks!


Stack Exchange Markdown rendering shows incorrect list spacing

Related to, but believed not a duplicate of, .  Below is explained a rendering issue for MarkDown affecting many if not all SE sites. Further, I seem to be finding additional issues related to rendering or parsing of MarkDown in SE as to deviate markedly and adversely from generic handling of MarkDown text. What information can be provided, for now only about the issue described below, specifically regarding the following questions?:  Is an official channel available to communicate such issues to SE staff responsible for development, marketing, or quality-assurance? Has any such channel been invoked for the issue? Has a response been offered that either acknowledges the issue or rejects the complaint?   Currently, Stack Exchange sites appear to format incorrectly the below Markdown content: - List item.    * Sublist item    * Sublist item    *Should be space above this line*.  - List item.  The spacing between all items should be roughly uniform. In fact, the spacing immediately above the inner list is inappropriately expansive, whereas that immediately after it is inappropriately condensed. As currently rendered by Stack Exchange: (Note: Since these comments originally appeared,  have been introduced, intending to mitigate the problems described. These improvements may be reflected in the formatting of text below.)  List item.  Sublist item  Sublist item   Should be space above this line.  List item.


What are the differences between user flows, task flows and workflows?

I'm looking to clarify the differences/overlaps between the three and, if the terminology isn't accurate establish the correct terminology


This question may seem to be very simple, but something I get confused whenever I want to speak.  I read a book entitled "re-start your English", and saw a sentence.     This is a leg. It is part of your body.      This is a neck. It is 'a' part of your body.   Why didn't they use 'a' in the first sentence? And why did they use one in the second one?  I'm not a native, so I hope you will please understand,  even if there's something awkward about my question.


How can I change my Facebook account associated with my Stack Overflow account?

I want to deactivate my Facebook account and create a new one. How can I associate this new account with my current Stack Overflow account?


I am learning about Lie algebra and have come to the point where my book defines the classical Lie algebras. I am investigating $so(3)$ as I know it to the be set of $3 \times 3$ skew-symm matrices. That is, $3 \times 3$ matrices $A$ which satisfy $A^T = -A$.  My book begins by letting $S \in gl(n, \mathbb{C})$  and defining the Lie subalgebra of $gl(n, \mathbb{C})$ by $$gl_S(n,\mathbb{C}) := \{A \in gl(n,\mathbb{C}) \mid A^{t}S = -SA\}$$ Then, when $n = 2l+1$ they take $S = \begin{pmatrix}1 &  0 &0\\ 0 & 0 & I_l \\ 0 & I_l & 0  \end{pmatrix}$ and define $\mathfrak{so}(2l+1, \mathbb{C}) = gl_S(2l+1, \mathbb{C})$ and call this the orthogonal Lie algebras.  Fine. Now, I want to examine $\mathfrak{so}(3)$. This is by the above defintion $\mathfrak{so}(3) := gl_S(3, \mathbb{C})$ where $S = \begin{pmatrix} 1 & 0 & 0 \\ 0 & 0 & 1 \\ 0 & 1& 0 \end{pmatrix}$. Let's see what elements of this matrix look like!  Let $A = \begin{pmatrix} a_1 & a_2 &a_3 \\ a_4 & a_5 & a_6 \\ a_7  & a_8 & a_9 \end{pmatrix}$ and $A^t = \begin{pmatrix} a_1 & a_4 &a_7 \\ a_2 & a_5 & a_8 \\ a_3 & a_6 & a_9 \end{pmatrix}$.  Now I compute $A^t S$ and $-SA$. They are $\begin{pmatrix} a_1 & a_7 &a_4 \\ a_2 & a_8 & a_5 \\ a_3 & a_9 & a_6 \end{pmatrix}$ and $\begin{pmatrix} a_1 & a_2 &a_3 \\ a_7 & a_8 & a_9 \\ a_4 & a_5 & a_6 \end{pmatrix}$ respectively.   I have noticed that this is not exactly the original definition I've seen before. Namely, it is not $A^t = -A$. Instead, the second matrix has its second and third row swapped and the first matrix has its second and third columns swapped.  So, are these definitions equivalent? Am I allowed to swap the row/column so that is matches the $A^t = -A$ defintion?


Finding military records for Romanian pilots stationed in Jüterbog during WWII?

I'm trying to find military records about my uncle, Chis CONSTANTIN.  As far as we know he was a Romanian pilot within Luftwaffe, who graduated from flight school in Medias, Romania, and from 1942 was stationed in Jüterbog.   Upon returning to Romania in 1948 he was imprisoned for 5 years as a political prisoner. He died in 1983.


Let V denote the Klein 4-group. Show that $\text{Aut} (V)$ is isomorphic to $S_3$

After a week in my Abstract Algebra class, the professor proposed this as a problem. I'm not entirely sure where to begin. $ V = \{ e, \tau, \tau_1, \tau_2 \}$, so I'm not sure exactly what is meant by $\text{Aut} (V)$. Is it simply saying that the only way to have an automorphism on $V$ is to rearrange the order of the elements of $V$ and therefore $\text{Aut} (V) \cong S_3$?


I am reading a book, written in Latex, and I saw a button, on which I can click and immediately I have a Wolfram notebook opened: I want to do such cool buttons too, can anyone tell me, how to add it?


When making bun, Yeast & salt should not be mixed at the same time? Will kill Salt the Yeast, salt is a hunter?


Change the hover-text on vote buttons not to say "click to undo" when it's not going to work

I'm still getting flack about . I downvoted an answer and added a comment explaining my reason. I was later convinced by other comments that it was not a good reason for downvoting. Upon attempting to retract my vote, I inadvertently locked it in.  The hover-text still (over a year later) says I can "click again to undo". But it's a big fat lie.  My specific problem has been resolved. But, I have stumbled across other questions where users have done this. In keeping with the push to help new users not to discover rules after having broken them, I think this text needs to be a little more aware, a little more accurate.


I want to add a line to a table of content. The line would say  something like   Chapter(on the left)     and  Page (on the right)  with addcontentsline I get a page number which I do not want.


Scanner.nextLine input can't match String

I am having some trouble with the Scanner.nextline(), it seems to work fine and dandy until I try to compare the input with the corresponding string. I basically want to see if some input is equal to some element in an array (teams). Here's my code and output:  package teams;  import java.util.Arrays; import java.util.Scanner;    class TeamTable2 {      static String[] teams = new String[] {            "Team A", "Team B", "Team C",          "Team D", "Team E"      };       // inArray returns true if an specified string is "in" an specified array      static boolean inArray(String thing, String[] array){           boolean in = false;          for(int i = 0; i < array.length; i += 1){              if(array[i] == thing){                  in = true;              }          }         return in;      }       static void inputInArray(){          Scanner userInput = new Scanner(System.in);          String inputTeam = null;           // The while loop continues if the input doesn't match any element          while(!inArray(inputTeam, teams)){              System.out.println("Team: ");              inputTeam = userInput.nextLine();              System.out.println("");              if(!inArray(inputTeam, teams)){                  System.out.println("Not in array: " + inputTeam + ",   length: " + inputTeam.length());          }          }      userInput.close();  }      public static void main(String args[]){     System.out.println("'Team A' in teams: " + inArray("Team A", teams));     inputInArray();  } }   Output:  'Team A' in teams: true Team:  Team A  //My Input  Not in array: Team A, length: 6 Team:    So obviously the output has the right length and when I use the pure String "Team A" in the inArray method it returns true, so I don't understand why the input isn't interpreted as being in the array?


Unable to install beta app in iOS 9.1 beta 1

Whether you have the app installed or not, trying to install a new version fails. It reaches 100% but then an alert pops up stating that the app could not be installed at this time.  The profile appears to be valid, so I'm not sure why it fails... Too bad I was tempted to check if this also happens if you remove the app... meh.


i am wondering if you could help me in my project. I would to ask your opinion of what algorithm is best to used in generating random numbers that ranges from 1 to 9.. Its a game like "Sphere Break" a famous mini game of FFx-2.   Please refer to the picture for   Need Opinions Please!! Need Help Badly.   My problem is that i want a certain algorithm to generate random numbers from 1 - 9 like in the picture every gameplay = another set of random coins...   P.S. i am developing an android game using unity !! thx for the response


Error - SqlDateTime overflow. Must be between 1/1/1753 12:00:00 AM and 12/31/9999 11:59:59 PM

I've been using this piece of code I've written and it's working in this most unclear manner. I wish to insert a row into the database which includes two columns of DateTime:  myrow.ApprovalDate = DateTime.Now myrow.ProposedDate = DateTime.Now   And yet, when I update the database I receive this error:     SqlDateTime overflow. Must be between 1/1/1753 12:00:00 AM and 12/31/9999 11:59:59 PM.    I've even tried copying an inserted value from the database and hard code it into the object being updated:  // I copied this value from the DB myrow.ApprovalDate =  Convert.ToDateTime("2008-12-24 00:00:00.000");   Still same error, the strange part is that the above trick worked for the first insert to the DB but failed from there on. Any ideas what's going on?


Error with \begin{equation} and \end{equation}

I am writing a document on writelatex.com and I get an error with this:  \begin{equation}  [any text here returns an error]  \end{equation}   The error message is      Display math should end with $$.   I don't undestand this and I can't understand what the problem is, I have other documents when this code works fine. Is it possible that I'm missing some package?


Recommended way to create a bootable USB including the software used

I have an USB from which I want to install my OS (Windows 10). Once that's done, I install VS, Notepad++, Paint.NET, SQL Studio and a lot of other stuff that's nice to have.  All the stuff, I install manually after the OS installation's completed. Then, we also have all the settings and other stuff.  I wonder, is it easily possible to create such an USB installation drive as I have now but with the addition that all the stuff I want added and all the settings that I've done, are included?  The I'm-loving-it scenario would be if I can put my thing into a hole and after a short while get a computer that's freshly reinstalled with all the stupid stuff I might have done gone.  After that I only need to worry about backing up the genius stuff I surely have done...


Prove by induction that this sum is not a natural number.

Prove by induction that $1+\frac{1}{2}+\frac{1}{3} +...+\frac{1}{n}$ for any $1<n$ and $n\in \Bbb{N}$ is not a natural number.


What is the maximum/minimum possible sampling rate for the signal to be full recovered for a passband signal?


Windows 10: Switched from BIOS to UEFI. Hyper-V reports that the hypervisor is not running

I partitioned my hard drive and installed Debian on second partition. In order to do this I had to switch from BIOS to UEFI after basically destorying the MBR. Everything works great.  However when I choose to boot to Windows 10 my various images within Hyper-V are not starting.  The error states that hypervisor is not running.  Any ideas?  I tried this  but no joy.  Any suggestions on why this would have stopped working?  C:\Users\User\Desktop>Coreinfo.exe -v  Coreinfo v3.31 - Dump information on system CPU and memory topology Copyright (C) 2008-2014 Mark Russinovich Sysinternals - www.sysinternals.com  Intel(R) Core(TM) i5-3340 CPU @ 3.10GHz Intel64 Family 6 Model 58 Stepping 9, GenuineIntel Microcode signature: 00000020 HYPERVISOR      -       Hypervisor is present VMX             *       Supports Intel hardware-assisted virtualization EPT             *       Supports Intel extended page tables (SLAT)


I'm wondering about the best way to do an explicit space character (I don't even know what it's properly called), like the ones you get in the \begin{verbatim*} environment. The closest I've found is  \sqcup   in math mode, but it seems like a bit of a hack to me. Is there any text symbol for what I'm looking for?


How can I find out in which distributions a package is available?

From the search results I was able to get so far my question seems unlikely, although I don't know why ;-)  I'm writing an installation guide for a program and need a “compatibility matrix” for several packages on the different distributions. So what I need is the information in which distributions and releases a given package X is available, optionally together with the version.  Of course each distribution has a package index like  from where I can get the information for this distribution. But is there an index or a search engine anywhere that can give me this information for many (all?) distributions?


Citation of a paper with non-standard characters by Bibtex

I would like to cite a paper by Bibtex. The bib entry is  @Article(Zolandek2007, title = {The {PF030405a} {‘‘Krzeszowice’’} fireball}, author = {P. {\.{Z}}o{\l}\c{a}dek and A. Olech and M. Wi\'{s}niewski and M. Kwinta}, journal = {Earth, Moon, and Planets}, year = {2007}, volume = {100}, number = {3--4}, pages = {215--224}, file =        f )   Bibtex omits the dot between \ and {Z}, so the entry in bbl file looks like this:  \bibitem[{\.{Z}o{\l}\c{a}dek et~al(2007)\.{Z}o{\l}\c{a}dek, Olech,   Wi\'{s}niewski, and Kwinta}]{Zolandek2007} \{Z}o{\l}\c{a}dek P, Olech A, Wi\'{s}niewski M, Kwinta M (2007) The {PF030405a}   {‘‘Krzeszowice’’} fireball. Earth, Moon, and Planets 100(3--4):215--224   LaTeX then announces error Extra }. If I finish translation in spite of it, the result      {Zołądek P, Olech A, Wiśniewski M, Kwinta M (2007) The PF030405a   Krzes- zowice fireball. Earth, Moon, and Planets 100(3–4):215–224   begins with a wrong brace, the dot above Z is missing and also quotation marks around word Krzeszowice are missing. Does anybody have any advice, how to cite papers with so complicated names?     I have read the answers to the question "How to write “ä” and other umlauts and accented letters in bibliography?" I have tried all the characters proposed there:  {\"a}{\^e}{\`i}{\.I}{\o}{\'u}{\aa}{\c c}{\u g}{\l}{\~n}{\H o}{\v r}{\ss}.   Everything works except {\.I}. After Bibtex, the dot is off and LaTeX does not know the order \I.   I use these documentclass and packages:  \documentclass[smallextended]{svjour3} \usepackage{graphicx} \usepackage{amsmath} \usepackage{multirow} \usepackage{natbib} \usepackage{color} \usepackage{tikz} \usetikzlibrary{shapes.geometric, arrows, calc}   The natbib package could theoretically influence it, but it works by the same way both with and without natbib.


Why do I have 95% of chimpanzee's DNA, and only 2% of Neanderthal's DNA?

Excuse me if it is a question with a simply answer, but I don't understand these discoveries, looking a discrepancy from my unknowledge of genetics:   ,    and,   .   Neanderthals should had also chimapnzee genes, so what does that 2% of  correspondency between Neanderthal and actual Homo sapiens genome exactly means?


Drush needs a higher bootstrap level to run

Do you have any idea on what might be causing this error when I execute:  drush si geoslate --db-url='mysql://root:root@localhost/geoslate' --site-name=Geoslate      Command site-install needs a higher bootstrap level to run - you will need to invoke  from a more functional Drupal environment to run this command.   The drush command 'si vimn_geoslate' could not be executed.   A Drupal installation directory could not be found   ?


Is closure created when a function is called (not declared) within another function and, if so, why?

From every definition I have looked up, closure is when a function is created or declared from within another function. Examples are plentiful across blogs and websites of this happening.  But what about when the function is declared outside of another function, but called then called from within a function?  For example:  const add = (x,y) => {   return x + y; };  const double = num => {   return add(num,num) };  let a = double(6);/*?*/   Does add(num, num) create closure? If so, please help me understand why.


Showing function is injective iff $f(M_1 \cap M_2) = f(M_1)\cap f(M_2)$

Let $f \colon M \to N$ a function. Show that the following affirmations are equivalent: (a) $f$ is injective (b) every two subsets $M_1$ and $M_2$ of $M$, $f(M_1 \cap M_2)=f(M_1) \cap f(M2)$  (a) $\implies$ (b): Let $y \in f(M_1 \cap M_2)$ $\implies$ exists $x$ an element from $M_1 \cap M_2$ such that $f(x)=y$ $\implies$ exists $x \in M_1$ such that $f(x)=y$ and exists $x \in M_2$ such that $f(x)=y$ $\implies y \in f(M1) \cap f(M2)$. So, $f(M_1 \cap M_2)$ is a subset of $f(M_1) \cap f(M_2)$. Let $y \in f(M_1) \cap f(M_2)$. How can I prove, using the injectivity of the function $f$,that $y \in f(M_1 \cap M_2)$?  (b)$\implies$ (a) $f(M_1 \cap M_2)=f(M_1) \cap f(M_2)$ means that every $y$ from $f(M_1 \cap M_2)$ belongs to $f(M_1) \cap f(M_2)$ and  every $y$ from $f(M_1) \cap  f(M_2)$ belongs to $f(M_1 \cap M_2)$. How can I prove that $f$ is injective?


As I want to save as much space on my main SSD for games, to optimize performance for none Steam games. I would love to have these games on another drive.  Is it possible to install Steam games on my external SSD, plug and un-plug it for whenever I want to play these Steam games?


Is there any way of installing Ubuntu on Chromebook without using Crouton?

I have installed Ubuntu using Crouton and this is the only way I have found. But I would like to have a 100% Ubuntu computer so I can upgrade it with no problems. Has anybody have a link or something where I can find this information?


Maximum likelihood estimator is sample mean or minimum ordered statistic?

Let $X_1,X_2,X_3....X_n$ be a random sample from a population having probability density function $$f(x)=\dfrac{1}{\theta} e^\frac{-(x-\theta)}{\theta} ;x\geq\theta$$  where $\theta\in(0,\infty)$. Find the MLE of $\theta$.  In this question when i followed normal method of finding MLE(taking log likelihood differentiating with respect to $\theta$)I found $\hat\theta =\bar x$.  But like in uniform distribution case we have here parameter dependent on $x$  . Now i am not sure if MLE is $\bar x$ or $x_{(1)}$.


Tip/Advice/Question box with a symbol on the left

Some books contain boxes with additional advice, tips or questions which have a signaling symbol on the left (like a question mark, an exclamation mark, a light bulb etc.). Is there a package which offers something like this?


show that $x\sin\left(\frac{1}{x}\right)$ is uniformly continuous on $(0,1)$

A student showed me the following exercise:   Is $h(x) = x \sin\left(\frac{1}{x}\right)$ uniformly continuous on $(0,1)$?  Admittedly, it has been a while since I have looked at problems involving uniform continuity and so I am not sure how to go about this problem.  My guess is that $h(x)$ is uniformly continuous on this interval but I am not sure how to go about picking an appropriate $\delta > 0$ such that $|x-c|< \delta$ implies $|h(x) - h(c)| < \epsilon$ for $x,c \in (0,1)$.   The student and I looked at $|x \sin(x) - c \sin(c)| \leq |x \sin(x)| + |c \sin(c)| \leq |x| + |c|$ although this feel like the wrong path to go down.  I appreciate any help! Thanks in advance!


Microsoft IUR - Internal useage rights licence

The Microsoft website isn't totally clear about the limitations of the internal rights license attained as part of a partnership. I'm trying to work out if development work would be permitted if it is for a customer project.  From  it clearly says no     Activation rules/policies      The Microsoft Partner Network grants software licenses only for internal business needs, customer demonstrations, and internal training purposes. These licenses cannot be used for direct revenue-generating, commercial purposes.    From  it implies yes     You earn Internal-use rights (IUR) licenses for Microsoft software and online services when you join the Microsoft Partner Network by either subscribing to Microsoft Action Pack or earning a competency. You can choose any combination of on-premises software and online services to suit your needs (run your business, train your people, develop and test, and demonstrate to your customers) and change between them at any time, just like Microsoft Enterprise Agreement (EA) >customers.


Here are two pictures below that clarify the situation and show the issues/errors I am seeing.  This is the error I got when the system tried to get updates:   This is what I got when I tried the command mentioned in the second picture:   I'm using ubuntu 16.04 LTS.  Can you help me fix the issue?  the terminal code :  adn7@1EK:~$ sudo apt-get install -f  Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... Done The following additional packages will be installed:   libvdpau1 The following NEW packages will be installed:   libvdpau1 0 upgraded, 1 newly installed, 0 to remove and 18 not upgraded. 4 not fully installed or removed. Need to get 0 B/25.5 kB of archives. After this operation, 100 kB of additional disk space will be used. Do you want to continue? [Y/n] Y (Reading database ... 222801 files and directories currently installed.) Preparing to unpack .../libvdpau1_1.1.1-3ubuntu1_amd64.deb ... Unpacking libvdpau1:amd64 (1.1.1-3ubuntu1) ... dpkg: error processing archive /var/cache/apt/archives/libvdpau1_1.1.1-3ubuntu1_amd64.deb (--unpack):  trying to overwrite shared '/etc/vdpau_wrapper.cfg', which is different from other instances of package libvdpau1:amd64 Processing triggers for libc-bin (2.23-0ubuntu3) ... Errors were encountered while processing:  /var/cache/apt/archives/libvdpau1_1.1.1-3ubuntu1_amd64.deb E: Sub-process /usr/bin/dpkg returned an error code (1)


ntfs partition missing when I installed ubuntu mate 14.4

I had a Windows 8.1 installed on C partition of my laptop. I had 2 partitions, C and D. Recently I installed Ubuntu Mate 14.04. but I don't know how to find my files on D partition. Should I mount or something?  Any help would be appreciated...  I think the following information would help :   sudo fdisk -l:  Disk /dev/sda: 750.2 GB, 750156374016 bytes 255 heads, 63 sectors/track, 91201 cylinders, total 1465149168 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 4096 bytes I/O size (minimum/optimal): 4096 bytes / 4096 bytes Disk identifier: 0x00087858     Device Boot      Start         End      Blocks   Id  System /dev/sda1   *        2048      499711      248832   83  Linux /dev/sda2          501758  1465147391   732322817    5  Extended Partition 2 does not start on physical sector boundary. /dev/sda5      501760  1465147391   732322816   8e  Linux LVM  Disk /dev/mapper/ubuntu--vg-root: 745.8 GB, 745789194240 bytes 255 heads, 63 sectors/track, 90670 cylinders, total 1456619520 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 4096 bytes I/O size (minimum/optimal): 4096 bytes / 4096 bytes Disk identifier: 0x00000000  Disk /dev/mapper/ubuntu--vg-root doesn't contain a valid partition table  Disk /dev/mapper/ubuntu--vg-swap_1: 4106 MB, 4106223616 bytes 255 heads, 63 sectors/track, 499 cylinders, total 8019968 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 4096 bytes I/O size (minimum/optimal): 4096 bytes / 4096 bytes Disk identifier: 0x00000000  Disk /dev/mapper/ubuntu--vg-swap_1 doesn't contain a valid partition table  df -h:  Filesystem                   Size  Used Avail Use% Mounted on /dev/mapper/ubuntu--vg-root  684G  3.3G  646G   1% / none                         4.0K     0  4.0K   0% /sys/fs/cgroup udev                         1.9G  4.0K  1.9G   1% /dev tmpfs                        388M  1.2M  386M   1% /run none                         5.0M     0  5.0M   0% /run/lock none                         1.9G  292K  1.9G   1% /run/shm none                         100M   48K  100M   1% /run/user /dev/sda1                    236M   36M  188M  17% /boot  sudo blkid:  /dev/sda1: UUID="56fa0875-40d6-4bbd-ae2a-f3e85341c44a" TYPE="ext2"  /dev/sda5: UUID="tQJELc-qT2m-xBFV-RfHJ-f7Vj-LIIn-KpAQ0Q" TYPE="LVM2_member"  /dev/mapper/ubuntu--vg-root: UUID="8f775671-a8d4-42b1-9ea4-90a7b7899c36" TYPE="ext4"  /dev/mapper/ubuntu--vg-swap_1: UUID="61daad35-5ff4-4417-b3b6-cbd0943e6a0f" TYPE="swap"  fdisk -l | grep NTFS:  Disk /dev/mapper/ubuntu--vg-root doesn't contain a valid partition         table Disk /dev/mapper/ubuntu--vg-swap_1 doesn't contain a valid partition table


Latex Bold a specific word without type every times \textbf{...}

I wish to know is possible to set in bold a specific word without type every times \textbf{bold}. For example  \documentclass{article} \begin{document} \textbf{dog}, cat,\textbf{dog}, cat,  \textbf{dog}, cat, \textbf{dog}, cat  \end{document}   Is it possible to set \textbf{dog} and just write "dog" which will be in bold after the compilation?


I am trying to uninstall MySQL completely from Ubuntu 16.04 LTS,but I am facing an issue saying:      The following packages have unmet dependencies:   mariadb-client-10.0 : Depends: libdbd-mysql-perl (>= 1.2202) but it is not going to be installed   mariadb-client-core-10.0 : Depends: mariadb-common (>= 10.0.24-7) but it is not going to be installed   E: Error, pkgProblemResolver::Resolve generated breaks, this may be caused by held packages.     I tried also to uninstall Mariadb but I have always the same problem.  Any idea !!


It was stated earlier in the series that all the survivors are already infected with the zombie virus, which is why even someone killed by a gunshot will reanimate if their brain is intact.  However, why do people who are bitten by zombies wind up dying, if they're already infected?  What is the new, 100% lethal and incurable thing introduced via the bite, which the survivors don't already have in their blood?  If they're just falling victim to the general filthiness of being bitten by a rotting human, why do they skip straight to amputation, rather than attempting to use alcohol, boiling water, cauterization, or even penicillin (when available).  Or, barring all that, just give the injured person lots of water and hope that they pull through on their own?  I'm preferably looking for canon answers from the show, but I'd also be happy with an answer from the comic if the show hasn't addressed the issue.


Non-degenerate bilinear forms and invertible matrices

I have the following question:      Show that a symmetric bilinear form is nondegenerate if and only if its matrix in a basis is invertible   Ok so both directions "if non-degenerate then the matrix is invertible" and "if matrix is invertible then the form is nondegenerate" have to be proven for this.   For the first direction. If the bilinear form is non-degenerate its null space is $\left\{0\right\}$, so for every $v \neq 0$ there exists a $v'$ such that $\langle v, v' \rangle \neq 0$ and so there are no zero eigenvalues, I'm pretty sure this somehow implies the determinant of the matrix is also non-zero, as it is the product of the eigenvalues and hence invertible (but not sure how to show this).   For the other direction, if the matrix is invertible, then the determinant is non-zero and, if my previous assumption is correct, this implies there are no zero eigenvectors, which implies the null space is $\left\{0\right\}$ and hence non-degenerate?   Thanks for any guidance, the notes I have on this topic are pretty poor so I'm having a hard time fully understanding everything. Thanks again.


Can I fit logistic regression over a dataset with only categorical data?

I have a dataset which contains only categorical data i.e.A,B,C,D (like factors) for each predictor. There are 10 predictors and the dependent variable is binary, 0,1.   UPDATE: MY predictors are answers for multiple choice questions for a questionnaire. So each predictor only takes on categorical values, i.e. X_1 can be A,B,C or D, X_2 can be A,B,C,D,E,F,G or H.   Is it feasible to fit a logistic regression over this dataset?  Ideally, if I can fit a logistic regression the data, I will then use it for prediction over a set of test data, which again contains only categorical data.   What are the pitfalls that I should look out for?


Disable gtk-application-prefer-dark-theme for single application

I like having a dark theme, so have gtk-application-prefer-dark-theme enabled in my local settings.ini file. However, some applications (such as the ubuntu software manager) don't work will with a dark theme (usually because the apps hard code colors rather than using the theme).   Is there any way to use the light theme for a specific application, either with an environment variable like GTK_THEME, or some configuration file.  I have tried setting using GTK_THEME:Adwaita, but that didn't remove the dark theme.   Edit I would also like to know how to do this in a KDE environment with a dark theme, especially for gtk and mono applications.


Can I vent plumbing in an old house to the crawl space?

I have an old farmhouse with a bathroom vanity, laundry room, and kitchen sink/dishwasher draining into a single septic run. There aren’t any vents installed in the system with only a crawl space under the two rooms. Is there a way to add a vent in the crawl space or without running it up through the walls or ceiling?


Let $X$ be an infinite set and $(X, \mathcal{T}_1)$ be a Hausdorff topological space such that non-empty $\mathcal{U} \subset X$ is open and $X \setminus \mathcal{U}$ is infinite. How would we construct a Hausdorff topological space $(X, \mathcal{T}_2)$ such that $\mathcal{U}$ is not open? I don't really care about an explicit construction, so showing $$\mathcal{U} \notin \sigma := \bigcap_{\sigma_X \text{is Hausdorff}} \sigma_X$$ would suffice. It is not hard to see that $\sigma$ is a topology on $X$, and maybe we can find a contradiction by assuming $\mathcal{U} \in \sigma$?


Can you use the starting money from your background to buy items before the campaign starts?

I'm playing my first campaign soon. While making my character, I noticed that you get money from your background. I was wondering if you can use this money to buy basic shop items before the campaign starts.


How do insurers decide "their" proportion of a claim when dual-insured?

Most (UK) insurance policies have a "dual insurance" clause along the following lines:      If any injury, loss, damage or liability is covered by any other insurance then we will not pay more than our proportion.   I understand why (to guard against double recovery), but:   How is "our proportion" calculated? Does it relate to premium paid, sum insured, value of claim? What happens to the excess amounts - does each insurer pay "their share" less the excess you agreed with them?   Partly I'm just curious, but I do want to understand the implications of dual insurance because when shopping around for deals it isn't always easy to avoid. As an example, imagine that I have home insurance with cover for contents away from the home ("personal possessions cover" or whatever a particular insurer calls it). Then I find a good annual travel insurance deal that includes baggage cover as standard though I don't need it. The travel insurance baggage cover is effective only in specific circumstances (with some UK insurance, travelling abroad or staying away with at least 2 night pre-booked accommodation) so I would want to keep the "contents away from home" cover, but in those specific circumstances I would then be dual insured.


Filter on Close Vote Review doesn't seem to be working across close reasons

I went over to the , filtered by "unclear what you're asking".  Instead I got to  voted as duplicate. With 2 votes only on duplicate.    I thought it was a one-off thing, but the next one it pulled up one for Too broad.    Just to make things clear -   these weren't audit reviews there weren't any flag votes from users who don't have 3k rep with flag close reason being other than what's selected as filter(ex: the duplicate/too broad posts didn't have "unclear what you're asking" flags so as to be picked in the review queue - I'm a Community Moderator at Super User so I can see the flags being applied on a post)


Merging shapefiles with different geometries (point and polygon) to get single layer with multiple geometries?

I want to merge two shape files in which one is of point geometry type and other is polygon type in order to get a single layer containing both points and polygon in a single map.


All Vatican anarchists are honest and dishonest at the same time if there is no anarchists in Vatican! How to resolve this contradiction?

Lets suppose we want to investigate proposition "All Vatican anarchists are honest". We can transform this proposition into implication "If a citizen of Vatican is an anarchist then he/she is honest". If this implication is true for every citizen of Vatican, then proposition  "All Vatican anarchists are honest" will be true.   Lets question the Pope.  -- Hey Pope, are you an anarchist? -- No  Implication "If a citizen of Vatican is an anarchist then he/she is honest" is true in the Pope's case, because the Pope isn't an anarchist.  Lets assume we questioned every citizen of Vatican and none of them is an anarchist. So, the implication is true for every Vatican citizen. As a result, statement "All Vatican anarchists are dishonest" is false  and "All Vatican anarchists are honest" is true.  Now lets pretend we have never questioned citizens of Vatican and begin from scratch. But this time we are going to test statement "All Vatican anarchists are dishonest". We can easily convert it into "If citizen of Vatican is an anarchist then he/she is dishonest". We interviewed all citizens and none of them is an anarchist, thus this implication is true for everyone. Thus statement "All Vatican anarchists are honest" if false and "All Vatican anarchists are dishonest" is true.   And now lets remember our previous survey. Holy cow, we have severe contradictions!  "All Vatican anarchists are honest" is true, thus "All Vatican anarchists are dishonest" is false.  BUT at the same time "All Vatican anarchists are dishonest" is true, thus "All Vatican anarchists are honest" is false.


"Two types of user" or "Two types of users"?

Which is the correct sentence to use?        Two types of user are identified: . . .   Two types of users are identified: . . .      I would have said the former (#1), but a colleague has suggested the latter (#2). The first one just sounds right to me.  Which is correct (if indeed either of them is)?  Thanks.


What do you call a government when the rulers are gods?

I'm familiar with most -ocracies. And I don't mean a theocracy (rule by religious officials). This would probably make more sense in a fantasy setting (say D&D) where deities actually come down and mess around with the mortals. However if one (or more) deities took it upon themselves to rule, what would this be called?


I do have a question regarding Johansen Cointegration test.   After checking my time series variables with ADF, PP and KPSS, I conclude that my time series is non-stationary at level but stationary at first differences. Thus, the variables are all I(1).  Now my question:  When I apply the Johansen cointegration test (function ca.jo in "urca" package in R), should I test with the variables at level or at first difference?  I did not test the first differences yet, but I do find at least one cointegration for the level data. I assume it's okay to test with level data as long as the variables have the same order of integration?  Thanks!


equivalent definition of normal subgroup

Let $G$ be a group and $N$ a subgroup of $G$. I read that the following two definitions are equivalent:  1) $\forall g\in G$, $gNg^{-1}=N$  2)$\forall g\in G$, $gNg^{-1}\subset N$  does this mean that we have always $N\subset gNg^{-1}$ ? my guess is no because take $n\in N$ then if $n=gn'g^{-1}$ then $n'=g^{-1}ng$ and there is no reason that $g^{-1}ng\in N$


what is the difference between speak to and talk to

I am confused with these two words, speak to and talk to. For example, I can say "I will never speak to a man about this." Can I substitute "speak to" here with "talk to"? Is there any difference? I appreciate any of your suggestion.


How can we factorize $x^4 - 2x^2 + 49$ with coefficients in $\mathbb{R}$?

How can we factorize ${x^4} - 2{x^2} + 49$ with coefficients in $\mathbb{R}$?  A problem would be easier if it was a quadratic equation - we could simply find the roots and get the linear factors.   Moreover, the polynomial $x^4 - 2x^2 + 49$ does not have a real root which would be easy to guess. (If we have one root, we could divide by linear factor determined by this root.)   that this can be factorized as $$x^4 - 2x^2 + 49 = (x^2-4x+7)(x^2+4x+7).$$ But how can we get to this factorization?  Factorization of this polynomial also appears as an example in an answer tp another question:


What GUI Based Torrent managers exist in Ubuntu and features they offer in terms of:     Speed to start downloading (Search Speed, Seed, Leech)   Speed while downloading   Compatibility   Stability   Data check   Other attributes


$G$ a finite $p-$group, $H < G$ (i.e, $H$ a subgroup of $G$, but $H \neq G$), prove that $H \neq N_G(H)$

I have one problem, that I think it's pretty hard to solve. The problem reads:     Let $G$ be a finite $p-$group, and $H < G$ (i.e $H \le G$, and $H \neq G$). Prove that $H \neq N_G(H)$.   Here are my thoughts on this problem:     I know that if $G$ is a finite $p-$group, then its center is non-trivial, i.e $\mathcal{Z}(G) \neq \{e\}$. Then, I start off by Proof by Contradiction (note that we already have $H \lhd N_G(H)$), i.e, assume that $H = N_G(H)$, then for every $g \notin H$, there exists $h_g\in H$, such that $g^{-1}h_gg \notin H$. And from here, I come up with the fact that, in order for $H$ to satisfy $H = N_G(H)$, we must have $\mathcal{Z}(G) \lhd H$.   However, the two facts above don't seem to help much. :(  Can you guys give me a little push on this problem?  Thanks so much,  And have a good day,


SEVERE: Unhandled exception with JavaFX + Vert.x + REST

Situation: I updated my IDE (Eclipse IDE 2020-6 to 2020-9) and the request to my web service stopped working with the following error: sep. 19, 2020 7:09:23 A. M. io.vertx.core.impl.ContextImpl SEVERE: Unhandled exception java.lang.NullPointerException     at model.Concepto.<init>(Concepto.java:23)     at consumer.ConceptoAccess.lambda$getConceptos$0(ConceptoAccess.java:31)     at java.base/java.lang.Iterable.forEach(Iterable.java:75)     at consumer.ConceptoAccess.lambda$getConceptos$1(ConceptoAccess.java:28)     at io.vertx.ext.web.client.impl.HttpContext.handleDispatchResponse(HttpContext.java:313)     at io.vertx.ext.web.client.impl.HttpContext.execute(HttpContext.java:300)     at io.vertx.ext.web.client.impl.HttpContext.next(HttpContext.java:275)     at io.vertx.ext.web.client.impl.predicate.PredicateInterceptor.handle(PredicateInterceptor.java:69)     at io.vertx.ext.web.client.impl.predicate.PredicateInterceptor.handle(PredicateInterceptor.java:32)  This is my line 23 in Concepto.java in package "model": package model;  import javafx.beans.property.IntegerProperty; import javafx.beans.property.SimpleStringProperty; import javafx.beans.property.StringProperty;  public class Concepto {          private IntegerProperty idconcepto;     private StringProperty descripcion;          public Concepto() { //      idconcepto = new SimpleIntegerProperty();         descripcion = new SimpleStringProperty();     }      public Concepto(Integer idconcepto, String descripcion) { //      this.idconcepto.set(idconcepto);         this.descripcion.set(descripcion);     }          public Concepto(String descripcion) {         this.descripcion.set(descripcion);     //<----- Line 23     }      public StringProperty getDescripcion() {         return descripcion;     }      public void setDescripcion(String descripcion) {         this.descripcion.set(descripcion);     }      public IntegerProperty getIdconcepto() {         return idconcepto;     }      }  and this is line 31 in ConceptoAccess.java in "consumer" package: public class ConceptoAccess {          private static final String HOST = "192.168.0.15";     private static final int PORT = 8091;          public static void getConceptos(ObservableList<Concepto> conceptoData) {         WebClient client = WebClient.create(Vertx.vertx());         client         .get(PORT, HOST, "/api/conceptos")         .send(ar -> {             if (ar.succeeded()) {                 conceptoData.clear();                 HttpResponse<Buffer> response = ar.result();                 response.bodyAsJsonArray().forEach(concepto -> {                     JsonObject jo = (JsonObject) concepto;                     conceptoData.add(new Concepto(jo.getString("descripcion")));     <---Line 31                 });                 System.out.println("Received response with status code " + response.statusCode());                 System.out.println(response.bodyAsJsonArray());             } else {                 System.out.println("Something went wrong " + ar.cause().getMessage());             }         });     }  I tested the web service and works fine:  Whats' wrong? everything was working fine before the Eclipse update. I use openJDK 11 + JavaFX 14 + Vert.x 3.9.3 TIA for any help!


Protected question notice is confusing and incorrect, especially to users with the association bonus

The new notice for protected questions looks like this:     Earn 10 reputation in order to answer this question. The reputation requirement helps protect this question from spam and non-answer activity.  The phrasing of this notice leaves out a lot of info, and is incorrect in many cases:  In the case where the user has just created their account on the site (whether or not they have the association bonus of +100), the default 1 for signing up does count toward the required 10. The message implies that the user has to earn 10 more reputation for a total of 11 (or 111), while the actual requirement is 10 (or 110).  If the user just registered and started off with the association bonus, then later lost part of it (e.g. through bounties or making a downvoted post), earning 10 reputation is not enough to answer protected questions. According to the literal wording of the notice, earning 10 reputation is enough regardless of previous rep loss, but this is not the case.   The easiest fix that can be made, to at least fix part of the problem, would be to explicitly indicate that the association bonus does not count. This was implemented in the prior protected question notice in response to , but was omitted from the new notice. This omission  , and adding this back would remove that. Can we please fix this notice?


Show that an integer of the form $8k + 7$ cannot be written as the sum of three squares.

I have figured out a (long, and tedious) way to do it. But I was wondering if there is some sort of direct correlation or another path that I completely missed.  My attempt at the program was as follows:   A number of the form, $8k + 7 = 7 (mod 8)$. That is, we are looking for integers a, b, c such that $a^2 + b^2 + c^2 = 7 (mod 8)$.   LONG and TEDIOUS way: $$(8k)^2 = 0 (mod 8)$$ $$(8k+1)^2 = 1 (mod 8)$$ $$(8k+2)^2 = 4 (mod 8)$$ $$(8k+3)^2 = 1 (mod 8)$$ $$(8k+4)^2 = 0 (mod 8)$$ $$(8k+5)^2 = 1 (mod 8)$$ $$(8k+6)^2 = 4 (mod 8)$$ $$(8k+7)^2 = 1 (mod 8)$$  That is, using three of these modulo there is no way to arrive at  $$a^2 + b^2 + c^2 = 7 (mod 8)$$


Why can't I transform faces, edges, or vertices without transforming the whole object?

My problem is that I sometimes lose the ability to independently translate or otherwise transform any parts of a single mesh. If I try, for example, to just translate several faces, edges, or vertices, then the entire mesh will stretch and displace itself in order to follow the translation. Or, alternatively, if I try to translate just one face then the whole mesh will move as if I'm translating in Object Mode.  I'm not really sure I know how to describe this problem properly. I don't even know how to reliably reproduce it. It seems to happen to any given mesh at random, and it doesn't stop happening to that mesh unless I delete and remake it.  I assume that I must be doing something wrong to cause this to happen. Does anyone have any ideas? Thanks.


Showing $\mathcal{P}(X)$ is isomorphic to $2^X$

I have a homework question that plays off my las question about the characteristic function $\chi_A(x)$.  It is:  Prove that there is a function $f$ that gives a one-to-one correspondence between $\mathcal{P}(X)$ and $2^X$.  Here the power set $\mathcal{P}(X)=\{A|A\subseteq{X}\}$ and $2^X$ is the set of all functions that map elements into the set $\{0,1\}$ Now i know that $|\mathcal{P}(X)|=2^{|X|}$, but the hint in the example mentions this:  "Now let us define a function $f$ on $\mathcal{P}(X)$ into $2^X$ by taking as the image a subset $A$ of $X$ the characteristic function of $A$," so then this mapping looks like this  $$f:\mathcal{P}(X)\rightarrow{2^X}$$ $$f(A)=\chi_A{x}$$  From here I must show injectivity and surjectivity.  So $$f(A)=f(B)\Rightarrow{A=B}$$  So by the definition of the characteristic function we can show that injectivity holds since if $$x\in{A}, \chi_A(x)=1=\chi_B(x) \text{ if } x\in{B}$$ and $$x\in{X-A}, \chi_A(x)=0=\chi_B(x) \text{ if } x\in{X-B}$$ But how do we create a surjectivity argument?


Is the Subjunctive Mood always a conditional statement?

I had exam and they asked: I would go to the library every day, if I ____ you.  Options:   were was    I came to know upon reading that question was in subjunctive mood. So, my question is   what is the difference between subjunctive mood and conditional statement?


I want to copy my HOME folder to a USB flash drive but I can't. I accidentally removed Python 3 and lost many important stuff

I accidentally removed Python 3 from /etc and now I lost many important folders, programs and also the Gnome shell. I know, I'm stupid.  I can still log in with my user but now everything is like this:    I believe the right solution is to install ubuntu 18.04 again.   Since my $HOME folder is undamaged (everything I had there remained: see screenshot below) I want to copy it to a flash drive so I can install Ubuntu again without losing my personal files.    But when I put my USB flash drive in, it shows me this message:  [ 264.065197] sd 6:0:0:0: [sdb] Asking for cache data failed  [ 264.065242] sd 6:0:0:0: [sdb] Assuming drive cache: write through   How can I solve this to copy my home to a flash drive using this terminal?  I don't know if there is a way to restore everything again. I think reinstalling it should be better, but if there is another solution to this without reinstalling Ubuntu again it feel free to share.


Java lang Null Pointer Exception, onCreate

this is my code    intent to Detail.Java  @Override protected void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState);     setContentView(R.layout.detail);      namaTxt=(TextView) findViewById(R.id.Detailnama);     AlamatTxt=(TextView) findViewById(R.id.Detailalamat);     kontakTxt=(TextView) findViewById(R.id.Detailkontak);     biayaTxt=(TextView) findViewById(R.id.Detailbiaya);     img=(ImageView) findViewById(R.id.ImageDetail) ;     RequestQueue = Volley.newRequestQueue(getApplicationContext());      //RECEIVE DATA     Intent i=this.getIntent();     String namabimbel=i.getExtras().getString("namabimbel");     Integer id_bimbel=i.getExtras().getInt("id_bimbel");     String Alamat=i.getExtras().getString("Alamat");     String kontak=i.getExtras().getString("kontak");     String biaya=i.getExtras().getString("biaya");     String foto=i.getExtras().getString("foto");     String kecamatan=i.getExtras().getString("kecamatan");     Double latitude=i.getExtras().getDouble("latitude");     Double longitude=i.getExtras().getDouble("longitude");      //BIND     namaTxt.setText(namabimbel);     AlamatTxt.setText(Alamat);     kontakTxt.setText(kontak);     biayaTxt.setText(biaya);     PicassoClient.downloadImage(this,foto,img); }   and then i got error,     Java Lang null pointer exception on Detail.java:37    //RECEIVE DATA         Intent i=this.getIntent();         String namabimbel=i.getExtras().getString("namabimbel");   i'm newbie, anyone can help me? thankyou


Python time.sleep every regular time intervals and function

I need to start the execution of a function foo() every 10 seconds, and the foo() function takes a random time between 1 and 3 seconds to be executed.  import time import datetime  def foo():     # ... code which takes a random time between 1 and 3 seconds to be executed  while True:     foo()     time.sleep(10)   of course in the above example the function foo() is not executed every 10 seconds but every 10 + random seconds.  Is there a way to start executing foo() each exactly 10 seconds? I'm sure it's something related with threading but can't find a proper example.


What is condition for repeated roots of the fourth order polynomial   $$ x^4 + a x^3 + b x^2 + c x + d = 0 ?$$


Stack Exchange sites currently do not work in Firefox due to broken OCSP stapling

As of a few minutes (hours?) ago, all SE sites except chat present a TLS error in Firefox:     An error occurred during a connection to superuser.com. A required TLS feature is missing. Error code: MOZILLA_PKIX_ERROR_REQUIRED_TLS_FEATURE_MISSING   A bit of searching suggests that this occurs when a certificate specifies OCSP must-staple but there is no stapled response.  seems to  this conclusion.  Toggling security.ssl.enable_ocsp_must_staple in Firefox from its default of true to false allows access to the site again (please don't actually do this! I only did so to test it!), again suggesting a stapling issue.  I have at least one other person in chat confirming this is an issue in Firefox. It currently does work in Chrome, which is presumably not honouring the must-staple.


Set of infinite binary sequence and Cantor's theorem

For each i ∈ N, let f_i : N → {0, 1}. Let A = {f_i : i ∈ N} and E = {n ∈ N : f_n (n) = 0}. Does there exist a f ∈ A such that E = {n ∈ N : f(n) = 1}. I know that this question is related to set of binary sequence , but how can i answer the question it ask while relating it to Cantor's diagonal theorem?


Both my children used to play in each other worlds on two separate iPads, since upgrading the minecraft every time they try to play together it keeps just saying invalid name.


Where are the results of chkdsk located in Windows 7?

I recently ran the chkdsk in Windows 7 on my local C: drive. After chkdsk completed, the results flashed on the screen for a few seconds and then the computer booted up. I wasn't able to read the results in time. Are the results saved to a text file somewhere?


How do I fill an area with faces lined up in a grid?

I need to change these polygons into a mesh with the same amounts of edges going the opposite way so I can end up with a mesh that I can curve edges upward and indent the heel and ball of foot area downward, sort of making it look ergonomic. Subdivide adds an diagonal edge but also vastly increases the edges where I already have enough. Suggestions?


I'm looking for help with (b) and (c) specifically. I'm posting (a) for completeness.  (a) Show convergence for $a_n=\sqrt{n+1}-\sqrt{n}$ towards $0$ and test $\sqrt{n}a_n$ for convergence.  (b) Show $b_n=\sqrt[k]{n+1}-\sqrt[k]{n}$ converges towards $0$ for all $k \geq 2$.  (c) For which $\alpha\in\mathbb{Q}_+$ does $n^\alpha b_n$ converge?    I'm pretty sure I solved (a). I have proven the convergence of $a_n$ by using the fact that $$\sqrt{n}<\sqrt{n+1}\leq\sqrt{n}+\frac{1}{2\sqrt{n}}$$ which holds true since $$(\sqrt{n}+\frac{1}{2\sqrt{n}})^2=n+1+\frac{1}{4n}\geq n+1\,.$$ This gives us $$0<\sqrt{n+1}-\sqrt{n}\leq\frac{1}{2\sqrt{n}}$$ and after applying the squeeze theorem with noting that $\frac{1}{2\sqrt{n}}\longrightarrow0$ we can tell that also $a_n\longrightarrow0$.  Now $x_n=\sqrt{n}a_n=\sqrt{n}(\sqrt{n+1}-\sqrt{n})$.  We have \begin{align*}\sqrt{n}(\sqrt{n+1}-\sqrt{n})&=\sqrt{n}\sqrt{n+1}-\sqrt{n}\sqrt{n}\\&=\sqrt{n(n+1)}-n\\&=\sqrt{n^2+n}-n\\&=\frac{(\sqrt{n^2+n}-n)(\sqrt{n^2+n}+n)}{\sqrt{n^2+n}+n}\\&=\frac{n^2+n-n^2}{\sqrt{n^2+n}+n}\\&=\frac{n}{\sqrt{n^2+n}+n}\\&=\frac{n}{n\sqrt{1+\frac{1}{n}}+n}\\&=\frac{1}{\sqrt{1+\frac{1}{n}}+1}\end{align*}  and hence since the harmonic sequence $\frac{1}{n}$ converges towards 0 we have $$\text{lim}_{n\rightarrow\infty} \frac{1}{\sqrt{1+\frac{1}{n}}+1} = \frac{1}{1+1} = \frac{1}{2}\,._{\,\,\square}$$


Checking if string is a combination of chars

I have this code:  while (length < content.length()) {         tok += chars.get(length);         tok = tok.toLowerCase();         if (chars.get(length) == ' ') tok = "";         else if (tok == "print") System.out.println("FOUND PRINT!");         System.out.println(tok);         length++;     }   What I'm trying to do is to create a programming language with this. But when I try to detect if (tok == "print") it doesn't detect it. I used an ArrayList to store all chars from a string to that array, and then use a while loop to loop the string's length which you can see in the code. Then I add every char from the array list to the string and when I try detecting if the string is something it won't work.  Output of this code:  [P, R, I, N, T,  , ", H, E, L, L, O, "] p  pr  pri  prin print - I'm trying to detect this  " "h "he "hel "hell "hello "hello"


I played once and then the game crashed I didnt win anything and played again for whole time I played how to play again tell me please


What is the physical significance of electric flux?

We know that the number of electric field lines crossing a unit area placed normal to the field at a point is a measure of strength of electric field $\mathbf{E}$ at this point.  Therefore, the no. of electric field lines crossing this area element $dS$ is directly proportional to $\mathbf{E}\cdot dS$ .


Prove that the set of made of the following formulas is feasible (Materials on specific logic problems)

I'm looking for some free resources online (books, courses, text, sites and so on) on how to solve these two particullar problems and understand the material behind them. There isn't any material on this in my native language and it seems quite hard to find any info when the I don't know the exact terminology in english.   Any help with these problems will be helpful :)    1)  Prove that the set of  made of the following formulas is satisfiable ( realizable / I don't know the exact terminology in english)  $ \forall x \neg p(x,x)$  $ \forall x \forall y ( p(x,y) \Rightarrow \neg p(y,x))$  $\exists x \forall y (x \neq y \Rightarrow p(x,y))$  $\exists x \exists y ( x \neq y \Rightarrow p(x,y))$    2)  The structure $A$ has a bearer $N$ (the set of natural numbers) and it is for a language with only one non-logical symbol $p$, which is a predicate interpreted like : $<n,k,m> \in p^A \leftrightarrow  n^2 = km + 1$ . Prove that $\{0\}$, $\{ 1 \}$ and $\{ <n,n> : n \in N \}$ are definable.    Agian any help on finding material on how to solve these and understand them is of great help. Thanks :)


Proving if $a$ is not a multiple of prime $p$, then an integer $b$ exists such that $p^b - 1$ is a multiple of $a$

I tried many approaches but none of them really worked I treated $p^b-1$ as a Geometric progression but it didn't work and that is about as far as I have been able to go I have no clue how to move forward


Is there any linux command to get number of context switches for a process?

Is there any Linux command to get various information like context switches of a process? Any solution other than ps will be appreciated.


SSH login as root fails, but I'm sure I entered the right password

What am I missing?  I change the root password on a unix machine, then try to log in with that password.  PasswordAuthentication is set to yes in sshd_config and the sshd daemon has been restarted.  This behavior happens whether I log in remotely or locally:  root@ip-10-0-0-155:~# passwd Enter new UNIX password:  Retype new UNIX password:  passwd: password updated successfully root@ip-10-0-0-155:~# ssh root@127.0.0.1 root@127.0.0.1's password:  Permission denied, please try again. root@127.0.0.1's password:


Decrypting Ciphertext with partial Key Fragment using LFSR and Berlekamp-Massey

Edit  Does the state register (the LFSR) always have to remain with 16 bits (I'm assuming yes).  If so, are we shifting the register right by one (lfsr>>1) and inserting the output bit onto the left-most bit (lfsr>>1 | bit<<15) which allows us to wraparound within the same 16-bit address space.  So with this in mind, how does one generate the continuous keystream given:  seed: 1100101001110101  taps: 3, 12, 14, 15    Assuming you are given the following information:  Seed: 1100101001110101  Key Fragment: 000100011110101100001101101111101  And the following ciphertext/encrypted stream: 10101011000000010010110011001100101000010101010101010111101111110111010000010011  I am seemingly unable to decrypt the entire text into some ASCII values (UTF-8 decoded). I initially wrote a Berlekamp-Massey implementation and an  to grab the tap positions of the above key fragment, which returned the following polynomial:  $$x^{15} + x^{14}+x^{12}+x^{3}+1$$  Fibonacci LFSR implemented in Rust:  fn next(&mut self) -> Option<(u16, u16)> {     self.bit = ((self.lfsr >> self.taps[0]) ^ (self.lfsr >> self.taps[1]) ^                 (self.lfsr >> self.taps[2]) ^ (self.lfsr >> self.taps[3])) & 1;      self.lfsr = (self.lfsr >> 1) | (self.bit << 15);      if self.lfsr != self.seed {         Some((self.bit, self.lfsr))     } else {         None     } }    The key fragment never appears in the generated key stream, indicating something probably went wrong. The decrypted cipher doesn't map to ASCII values, just cryptic UTF-8 symbols.   The Berlekamp-Massey implementation is based off of the following whitepaper -   And the full code can be found here -


Original sentence:      Even being paid very well, and enjoying great working conditions, is not enough.   Should not it be this?     Even being paid very well, and enjoying great working conditions, are not enough.   Or are both acceptable?


I have a PostgreSQL/PostGIS spatial relational database for my university project with objects, their coordinates and attributes (1:n, n:m relations). I would like to map my spatial objects online and run queries, however, I am not ready yet to set up a web server and write server side scripts.   Are there any web mapping platforms that will allow me for now to visualize the data from the exported database? I suppose in this case I have to merge all of the related tables with attributes into one file.


Multiple person possession with a pronoun

How do you handle multiple person possession with a pronoun?    For instance, "This organization has been near and dear to my and Simon's hearts for many years"


Best way to track onchange as-you-type in input type="text"?

In my experience, input type="text" onchange event usually occurs only after you leave (blur) the control.  Is there a way to force browser to trigger onchange every time textfield content changes? If not, what is the most elegant way to track this “manually”?  Using onkey* events is not reliable, since you can right-click the field and choose Paste, and this will change the field without any keyboard input.  Is setTimeout the only way?.. Ugly :-)


How to pass variables in and out of functions in Python

When I write functions in Python, I typically need to pass quite a few variables to the function. Also, output of such functions contains more than a few variables. In order to manage this variables I/O, I resort to the dictionary datatype, where I pack all input variables into a dictionary to inject into a function and then compile another dictionary at the end of the function for returning to the main program. This of course needs another unpacking of the output dictionary.   dict_in = {'var1':var1,            'var2':var2,            'varn':varn}      def foo(dict_in):     var1 = dict_in['var1']     var2 = dict_in['var2']     varn = dict_in['varn']      """ my code """      dict_out = {'op1':op1,                 'op2':op2,                 'op_m':op_m}     return dict_out   As the list of variables grows, I suspect that this will be an inefficient approach to deal with the variables I/O.   Can someone suggest a better, more efficient and less error-prone approach to this practice?


How about a difficulty rating for questions?

It might be useful to add a drop down field "Difficulty" for questions. With a very limited set of options, say:   Beginner Advanced Expert   This way, users could easily judge if they can answer a specific question (depending on their experience in the topic) and how much time it will probably take.  Beginners usually know they are new so they can easily select Beginner. Those with some experience just select Advanced and those working on a topic for years may chose Expert. I think it's not very difficult to judge halfway correctly.  And the difficulty rating does not have to be very precise anyway, it's more a rough estimate by the asking person.  As an addition, rep gained on this topic can be multiplied with a difficulty factor. This would solve the problem of lots of rep for often-viewed and easy to answer questions and few rep for less-viewed, difficult questions.  Update  Thank you so far for the answers. I clearly underestimated the fact that some users are going to always chose Expert difficulty.  Maybe readers voting on the difficulty would be a workaround. Of course, we cannot use the rep factor then, for the same reason.  This kind of voting would obviously introduce a whole new set of issues, since we could vote on both content and difficulty (I'm almost positive this kind of proposal existed before?).


When running apt-get (or aptitude) I get following error   apt-get: relocation error: /usr/lib/x86_64-linux-gnu/libapt-private.so.0.0: symbol _ZN3URIcvNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEB5cxx11Ev version APTPKG_5.0 not defined in file libapt-pkg.so.5.0 with link time reference   What is going on?


How to remove write protection from USB stick

I have followed up the below process in cmd:  DISKPART> attributes disk clear readonly  Disk attributes cleared successfully.   Even if I do that it displays Read-only:yes:  DISKPART> attributes disk Current Read-only State : Yes Read-only :yes Boot Disk : No Pagefile Disk : No Hibernation File Disk : No Crashdump Disk : No Clustered Disk : No  DISKPART>   How can I remove the write protection from this USB flash drive? I have tried several things I found on the Internet.  I guess it happened because of a virus infection.


How can I grep the output of a man page?

I'm seeking the man page info for a switch for a given command. I tried for example man sort | grep -A2 "-n,". I expected something like:  -n, --numeric-sort     compare according to string numerical value   as output and instead I got  Usage: grep [OPTION]... PATTERN [FILE]... Try 'grep --help' for more information.


Can we add an uncountable number of positive elements, and can this sum be finite?   I always have trouble understanding mathematical operations when dealing with an uncountable number of elements. Any help would be great.


Why are pull-up resistors required to be connected to the 2 lines of I2C?

Without pull-up resistors connected to the 2 lines of I2C, I2C communication fails. Why is there a need to have pull-up resistors for I2C? In contrast, UART and SPI do not need pull-up resistors.   Another side question is how does one choose the value of the resistor?


Multi-level repeated-measures logistic regression in python/R

I have a repeated-measures design experiment. Each subject took part in some experimental conditions, each one associated with several events. Normally I would analyse this with an ANOVA by grouping across all events, but I want to include those individual events in the model, and also account for subject effects. Example data import numpy as np import pandas as pd  condition = ['A']*3 + ['B']*3 + ['C']*3 events = list(range(1, len(condition)+1)) subject = [1]*len(events)   data = {     'subject':subject+[i+1 for i in subject]+[i+2 for i in subject],     'events':events*3,     'condition':condition*3     }  df = pd.DataFrame(data) np.random.seed(1) df['y'] = [np.random.randint(0,2) for i in range(df.shape[0])]  print(df)   print(df.groupby(['subject', 'condition'], as_index=False)['y'].mean())  So the full data:    subject  events  condition   y 1   1   A   1 1   2   A   1 1   3   A   0 1   4   B   0 1   5   B   1 1   6   B   1 1   7   C   1 1   8   C   1 1   9   C   1 2   1   A   0 2   2   A   0 2   3   A   1 2   4   B   0 2   5   B   1 2   6   B   1 2   7   C   0 2   8   C   0 2   9   C   1 3   1   A   0 3   2   A   0 3   3   A   0 3   4   B   1 3   5   B   0 3   6   B   0 3   7   C   1 3   8   C   0 3   9   C   0   And the grouped data: subject condition   y 1   A   0.666666667 1   B   0.666666667 1   C   1 2   A   0.333333333 2   B   0.666666667 2   C   0.333333333 3   A   0 3   B   0.333333333 3   C   0.333333333  I would like to know how to do a multi-level (logistic regression?) model to account for events and subjects as well as the condition as factors. It's a bit strange to me because when we group together and analyse the means we can use a standard ANOVA, but when we retain the full dataset and analyse it the outcome measure is of course binary, meaning we should use some sort of logistic regression. Is this correct? And if so, is this possible given the within-subjects design? If so, how do we achieve this in python (or R)?


Why should you remove unnecessary C# using directives?

For example, I rarely need:  using System.Text;   but it's always there by default. I assume the application will use more memory if your code contains unnecessary . But is there anything else I should be aware of?  Also, does it make any difference whatsoever if the same using directive is used in only one file vs. most/all files?    Edit: Note that this question is not about the unrelated concept called a , designed to help one manage resources by ensuring that when an object goes out of scope, its  method is called. See .


htaccess redirect a subsub directory to new domain same structure

Any idea how to redirect from old domain  to new one using htaccess:  domain.example/A/B/some-file-bb-cc  to  new-domain.example/A/B/some-file-bb-cc


Why can alphabetical file permissions contain itself up to three times

When running ls -al, the beginning of the output starts with something like drwxrwxr-x In this string I understand the following:    d --> At the beginning of the string means directory r --> Means read permissions w --> Means Write permissions x --> And the x means execute permissions   What I am confused about though, is why does the rwx repeat multiple times throughout this string drwxrwxr-x??? I believe it has something to do with current user permissions, group permissions, and something else.... Any advice or knowledge would be greatly appreciated...


What is the easiest way to add transparancy to an image in Photoshop Elements?

Is there a simple one click solution in Photoshop (Elements) to remove a coloured background?  I have previously zoomed and cut around the image, but the detail and rough nature of this leaves it a bit fuzzy around the edges.  What is the procedure for removing backgrounds properly in Photoshop or even a website/tool on the web?


Every time I get an audit question it drives me crazy.    Can we please ensure that the audit questions have the same correct tags as my filter?  Previously you used to get a question that had the filter tag slapped on randomly so it looked out of place.  Now you seem to have questions that don't match my filter tags at all.  I just get confused when I see these, because I might be looking at php questions and suddenly I'm getting a question which is marked C++ and VBA when I look for further info I get repremanded for being such a fool that I didnt see that this question was fine.  But it wasn't fine it had weird tags.  Can we please review the review questions they don't make me want to keep reviewing!!!!


Parenthesis missing for close votes count in mobile view

The close count in the desktop view has the parenthesis but where as the mobile web view doesn't.  In Desktop view    In Mobile view


Is $\phi (k_1) + \phi (k_2)+\phi (k_3) +...\phi (k_n)=gcd(m, n) $ ? k is divisor of m and n

Let $k_1, k_2, k_3,\dots ,k_n$ be positive divisors of $m$ and $n$. Can you prove or disprove the following $$\varphi (k_1) + \varphi (k_2)+\varphi (k_3) +\dots+\varphi (k_n)=\gcd(m, n).$$


What is the purpose of function.boolean = True in Python

I was looking at some python2 code that looks something like this:  def foo(self):     pass  foo.boolean = 'WTH'   and this code seems to be syntactically correct.  But what purpose does it serve?


Slow startup on certain programs or methods of starting them

I'm having a strange issue in Ubuntu 16.04.2. Some programs will only start after a delay of roughly 20-30 seconds, or will have this delay when opened a certain way, but not another.  Here are some example programs:  Slow startup:   Chromium/Chrome Terminal (when started with Ctrl+Alt+T) Opera   Normal startup:   Firefox Terminal (When started from Launcher or Dash) Spotify Steam   I can't see any connections, as the slow startup seems to affect both pre-installed/native programs and 3rd party programs.  I've encountered this problem before, and tried re-installing Ubuntu. It worked fine for about a month before it showed back up. Also didn't have the problem when running from USB, so probably isn't hardware. Each time the problem has arisen, is after I've been using mostly Windows for some time, but that's installed on a separate SSD, and it can't read the filesystem on the Linux disk, so I don't think it's Windows' fault.  Most website logins seem to be forgotten once the problem manifests itself, and one website even thought I was on a new machine.  I already know that re-installing Ubuntu works (at least for a while), but I'm wondering if anyone has any idea what could be causing this, or what I can do to narrow it down.  There's free memory and swap, and low CPU usage.  Thanks for having a look!  Update: Tried installing a couple other desktop environments/window managers(?). Switching to XFCE removes the delay when trying to start a terminal with Ctrl+Alt+T, but it's still there for the other programs. Ctrl+Alt+T (and other programs) still slow in GNOME.


why monte carlo method use random sampling? and not a specific numbers?

in calculating the area of a circle in a square we use random points to calculate the fraction of circle! but why we dont assume a simple grid and put our points in the center of it. this seems more uniform and the result should be better.


Can I move /usr to another partition and create a symbolic link to it?

Someone asked something similar , but no one answered, so I will try it.  I've just done a clean reinstall of my system, in which I have a 1TB HDD + 8GB SSD, which was used before for Windows' Fast Boot or something. I formatted it and installed Ubuntu GNOME 17.04 in it, and it works like a charm. Currently I have 1.5 GB of free space in the SSD, and I would like to have more, just in case.  Currently, my somewhat limited Linux knowledge makes me think a good solution for that would be to copy /usr or /usr/share to another partition and create a symbolic link to it at /(root). That's what I've been doing for a few years now with some folders at my home directory, like the Dropbox folder.  Can I do that? If not, why, and what would be a better alternative?


reliable to read loop variable after loop in Python

Is it safe to read loop variable after loop (using Python 2)? My purpose is to check how many iterations in the loop are done.  Here is code to show the idea:  a=[1,2,3,4,5]  for i in range(len(a)):     if a[i] == 2:         break  print i # output is 1, is it safe to read i here?


Select organic group on the user registration form

There's a post already on the post installation forum, but I'm not sure if this is a OG bug.   I am using Drupal 7 and OG 7.x-2.1 version. There is no "Group Audience" in the manage fields page and I think it is replaced with "Group membership", the field type is "Entity Reference" and the widget is "OG Reference". Also there is no input type in the field setting page and I can not find any field that has a "Always show other groups" option. I have checked the option "Show on registration form of that field, but the combo box on the registration form does not have any option. Any suggestion?


Is the Star Wars Holiday Special part of Disney's SW canon?

If you are reading this, you are probably twitching already, but I think it qualifies as a fair question because there is a lot of uncertainty about what the Disney Story Group will keep from earlier Star Wars material.  Despite how bad it is, the Holiday Special was accepted as canon (I do not know what level). So... Is there any official information on whetherany parts of it may be reincorporated in the new canon?


NullPointerException error when trying to call setter functions (Java)

I am reading data from a file and passing the data (three Strings, one float) into objects that I created via setters.  I keep on getting a NullPointerException and cannot figure out what to do, even after researching the topic online.  I have attached pictures of both my main function as well as the code for the class that I am trying to use the setters with.


Winshell not uploading eps file to pdf file in Windows 8

I just installed winshell for windows and I am trying to include an eps file with the directive \includegraphics{./new} where new is an eps file, however everytime I run pdflatex, it says the file not found. So I tested it by replacing it with jpg and it works. Could anyone tell me what I am doing wrong? Does it have something to do with eps files? I was using latex without GUI on my linux os and I faced no such problems. Any suggestions for a windows system?


Velocity-Dependent Potential and Helmholtz Identities

I'm currently working through the book Heisenberg's Quantum Mechanics (Razavy, 2010), and am reading the chapter on classical mechanics. I'm interested in part of their derivative of a generalized Lorentz force via a velocity-dependent potential.   I understand the generalized force   $$F_i = -\frac{\partial V}{\partial x_i} + \frac{d}{dt}\left(\frac{\partial V}{\partial v_i}\right)$$  that they derive from a Lagrangian of the form $L = \frac{1}{2}m|\vec v|^2 - V(\vec r,\vec v,t)$.  However, in the next (critical) step of the derivation, the author cites a theorem from Helmholtz saying      ...according to Helmholtz, for the existence of the Lagrangian, such a generalized force can be at most a linear function of acceleration, and it must satisfy the Helmholtz identities.   The three Helmholtz identities are then listed as:  $$\frac{\partial F_i}{\partial \dot{v_j}} = \frac{\partial F_j}{\partial \dot{v_i}},$$  $$\frac{\partial F_i}{\partial v_j} +  \frac{\partial F_j}{\partial v_i} = \frac{d}{dt}\left(\frac{\partial F_i}{\partial \dot{v_j}} +  \frac{\partial F_j}{\partial \dot{v_i}}\right),$$  $$\frac{\partial F_i}{\partial x_j} -  \frac{\partial F_j}{\partial x_i} = \frac{1}{2}\frac{d}{dt}\left(\frac{\partial F_i}{\partial v_j} - \frac{\partial F_j}{\partial v_i}\right).$$  I'm trying to understand where this theorem comes from. Razavy cited a 1887 paper by Helmholtz. I was able to find , but it is in German, so I could not verify whether or not it proved the theorem. Additionally, I could not find it in any recent literature. I searched online and in Goldstein's Classical Mechanics.   The only similar concept that I can find is in the  where we have three equations known as Helmholtz conditions. Are these two concepts one in the same? If so, how should I interpret the function $\Phi$ and the matrix $g_{ij}$ that appear in the Helmholtz conditions I found online?   If the cited theorem from Razavy does not relate from the inverse Lagrangian problem, could I have some help finding the right direction?


Fifteen coupons are numbered 1 to 15. Seven coupons are selected at random, one at a time with replacement. What is the probability that the largest number appearing on a selected coupon be 9?     My attempt: I tried to break down the sum into 7 parts and find the probability in each case. I do not know how to find the probability of choosing n particular choices( all less than or equal to 9) out of m choices remembering the fact that 9 should appear in atleast one of the 7 draws


Is it ethical to withdraw an accepted manuscript for financial reasons?

I submitted a manuscript, which has been accepted. Its publication is pending payment of publication fees. I need to withdraw the manuscript due to financial constraints.  Is this ethical?


I want to have a  video background that will loop on some frames of my presentation. Can anyone help me to do that?


Logistic regression with categorical predictors

I'm trying to play around with classification models and started off with logistic regression in R. When I have all the numeric variables in the data set the model works correctly and I was able to interprer the results.  The question is, with another data set I have more than 5 variables which are categorical but they are important though.   1) How do I deal with the variables with categorical values? the total unique categorical values are more than 100 for almost 5 predictors.  2) My dependent variable is having 3 classes, is it okay to using logistic regression for this purpose? (I would still need to explore other classification techniques but right now I'm exploring logistic regression.


In what sense is the renormalization group equation a group?

The  equation is given by: \begin{equation} \left[\mu \frac{\partial}{\partial \mu}  + \beta \frac{\partial}{\partial g} + m \gamma_{m^2} \frac{\partial}{\partial m} - n \gamma_d \right] \Gamma^{(n)}(\{p_i\};g,m,\mu) = 0  \end{equation} where: \begin{align} \beta  & \equiv \mu \frac{\partial g}{\partial \mu} \\ \gamma_d & \equiv \frac{1}{2} \mu \frac{\partial \ln Z_\phi}{\partial \mu} \\ \gamma_{m^2} & \equiv \frac{1}{2} \mu \frac{\partial \ln m^2}{\partial \mu} = \frac{\mu}{m} \frac{\partial m}{\partial \mu}  \end{align} Why do we refer to it as the renormalization group equation. Does it form a ? And if so, what are the elements of the group, and how can one see that it satisfies the axioms of a group?


Mocking private method of class under test using JMockit

I want to mock private method of a class under test but method return false first two times when the method is called after that it should return false. Here is the code what I tried. This is the class which is being tested  public class ClassToTest  {     public void methodToTest()     {         Integer integerInstance = new Integer(0);         boolean returnValue= methodToMock(integerInstance);         if(returnValue)         {             System.out.println("methodToMock returned true");         }         else         {             System.out.println("methodToMock returned true");         }         System.out.println();     }     private boolean methodToMock(int value)     {         return true;     } }   Test class  import org.junit.Test; import static mockit.Deencapsulation.*;  import mockit.*; public class TestAClass  {     @Tested ClassToTest classToTestInstance;     @Test     public void test1()     {          new NonStrictExpectations(classToTestInstance)         {             {                 invoke(classToTestInstance, "methodToMock", anyInt);                 returns(false);                 times = 2;                  invoke(classToTestInstance, "methodToMock", anyInt);                 returns(true);                 times = 1;              }         };          classToTestInstance.methodToTest();         classToTestInstance.methodToTest();         classToTestInstance.methodToTest();      } }   I did this to get desired results      final StringBuffer count = new StringBuffer("0");     new NonStrictExpectations(classToTestInstance)     {          {             invoke(classToTestInstance, "methodToMock", anyInt);             result= new Delegate()              {                 boolean methodToMock(int value)                 {                                        count.replace(0, count.length(), Integer.valueOf(Integer.valueOf(count.toString())+1).toString());                     if(Integer.valueOf(count.toString())==3)                     {                         return true;                     }                     return false;                 }             };          }     };


How to get rid of base 10 multiplier in pgfplots axis

I'm making a graph in tikzpicture using the code below.  \documentclass[11pt]{article} \usepackage[usenames,dvipsnames]{xcolor} %must come before tikz \usepackage{tikz} \usetikzlibrary{arrows} \usetikzlibrary{positioning} \usepackage{pgfplots} \pgfplotsset{compat=1.8} \usepackage{subcaption} \usepackage{caption}  \begin{document}  \begin{tikzpicture} \begin{axis}[width = \textwidth, height = 0.4\textheight, ylabel=\Large{$Y$}, xlabel=\Large{$X$}, xtick={0,2500,5000,7500,10000},  xticklabels={$a$,$b$,$c$,$d$,$e$}, name = border] \addplot[color=blue, smooth, ultra thick, domain=0:10000] {x}; \end{axis} \end{tikzpicture} \end{document}   Since a, b, c, d, and e are variable names, it doesn't make sense to have the "*10^4" appear below the x-axis, as it does in the image below.    How can I get rid of the multiplier?


Display grub menu and options without rebooting?

I would like to display the grub menu from the command line. Also to select a grub boot menu option and press Enter to see what pre-kernel drivers are loaded and the boot parameters passed when loading the kernel.  The reasons to do this from the command line:   Rebooting to see the grub menu takes time. It is awkward to take a picture of the grub menu and post the image on websites. It is easier grabbing a screen shot when Ubuntu is up and running. To edit grub menu option with e and take a picture is often difficult because screen is hard to read. With this function you could copy and paste instead. It might be easier using this function to reveal all kernel versions rather than apt list --installed | grep linux-image or ls /boot/vml*. To quickly see the grub menu number is valuable for grub-reboot and grub-set-default commands.   How can I paint the grub menu from the command line, see internal grub menu entry numbers and display the boot parameters for a given option?


Why I can't use the same code from Drupal 7 in Drupal 8 to generate a button with FAPI?

Following the question  for Drupal 7 I tried to implement the same thing in Drupal 8.  I need the following output:   <button type="submit" class="clearfix">Login</button>   So I tried to use this code:  $form['submit'] = array(   '#prefix' => "<button type ='submit'>",   '#suffix' => "</button>",   '#type' => 'markup',   '#markup' => "" . t('Login') . "", );   But I obtain this:  Login   But if I use this code:  $form['submit'] = array(   '#prefix' => "",   '#suffix' => "",   '#type' => 'markup',   '#markup' => "" . t('Login') . "", );   I obtain this:  Login   So the <button> tag is eliminated but the  tag not. Very strange for me, the Button is not rendered.  Thanks to @Kevin I used the  an with this code I solve the problem:  $form['submit'] = [   '#type' => 'inline_template',   '#template' => '<button type="submit" class="glyphicon glyphicon-search"></button>', ];   But, why I can't use the same code in Drupal 7 and Drupal 8 to generate a button with FAPI?


PostGIS TIGER reverse_geocode() returns state only

I have a clean install of PostGIS 2.1 in Postgres 9.3 on Ubuntu, using apt-get and postgres extensions.   Ran the data loading scripts from .   normalize_address works well, but geocode returns no result.    Interestingly, reverse_geocode is able to find the state, but no finer detailed information.      SELECT pprint_addy(r.addy) As st1, pprint_addy(r.addy[2]) As st2,    pprint_addy(r.addy[3]) As st3, array_to_string(r.street, ',') As   cross_str FROM reverse_geocode(ST_GeomFromText('POINT(-71.06941   42.34225)',4269)) As r;   returns:     st1   st2 st3 cross_str      MA               Is this a data loading issue or a software install issue?


QGIS Saving selected features with wrong data attribute column names

Following the thread here:  I did a great job, extracting my items from the layer by type and saving them as the separate layer. Unfortunately the problem is in data attribute table, which results wrong column naming. I though, that since every column is copied it will come in a good naming too. See below what is the problem:  The first three columns have a proper name, whereas the rest one is wrong. It's assigned some weird name derivative from one of the columns and then copied across the entire table. Is there any way to fix it? I want to have all the columns copied/exported correctly.


What keeps players from creating all legendary items imaginable using True Polymorph?

So, True Polymorph can be used to turn creatures into objects, like lumps of .     Creature into Object: If you turn a creature into an object, it transforms along with whatever it is wearing and carrying into that form. The creature's Statistics become those of the object, and the creature has no memory of time spent in this form, after the spell ends and it returns to its normal form.   So, what keeps players from reaching level 17 and holding back for a month to turn a bunch of fish into , , , ? Items are, as far as I understand, objects.  I had the notion that  was on another league, but other level 9 spells would only break combat for a few rounds. True Polymorph seems to stack its effects to the point where the party gets it and, after a month, has doubled its power, both in and out of combat.


How an op-amp determines its output without a reference point?

I was struggling to understand how an op-amp determines its output without a reference point.  The output of an op-amp is A * (Vni - Vi)  Then let's say we have an inverting op-amp with a gain of 1000, that V+ is 9 V, V- is -9 V and Vni is 5 V.  If Vi is 5.002 V, the output is 1000 * (5 - 5.002)  =  -2 V  If Vi is 4.998 V, the output is 1000 * (5 - 4.998)  =  2 V  The output is -2 V or 2 V but with respect to where? With respect to the halfway between 9 V and -9 V or Vni (5 V)?  So how can I set the reference point of the op-amp?  Thanks in advance.  Note: Vi is the inverting input and Vni is the non-inverting input of the op-amp.  Edit: Thanks everyone for helping.


Is the mass needed to create a black hole greater if the black hole is moving?

So my argument goes like this:  say we have an object that is nearly at the density required for a black hole.  Then we Lorentz boost into a new frame, the object is Lorentz contracted and therefore the density increases above the black hole limit.  As a mere change of frame can't have physical effects it surely can't create a black hole and therefore a moving black hole needs a larger density.  Is this correct and if it is how does this come out of General Relativity?


how to delete "default-string" name@name-Default-string

Recently started using Ubuntu, just wondering how to change my computer name.  as when i made my account, it says at the end of it "default-string"   name@name-Default-string


how to add eventListener on a appended button which is dynamically copied from a hidden div?

document.getElementById('btn1').addEventListener("click", function() {  document.getElementById('div2').innerHTML = document.getElementById('hidden-div').innerHTML; }); document.getElementById('btn2').addEventListener("click", function() {  document.getElementById('div-main').innerHTML = ""; });
  <input type="button" name="button1" value="button1" id="btn1">

      <input type="button" name="button2" value="button2" id="btn2">

     i want to add a button2 on click button1, button2 initially is in a hidden div when i click button1 then button2  comes in div2 but when i click button2 its event doesn't work.


Is there a unique saddle value for a convex/concave optimization?

Here is the question:     Consider a function of two variables $f(x,y)$ on some compact domain. Let it be convex in $x$ and concave in $y$. Is it true that $f(x,y)$ has a uniqe saddle point (stationary point)? Is $(\hat x,\hat y)=\arg \min_x\max_y f(x,y)$, the argument of saddle point, unique?   Is there any role of being strictly concave (or convex) in this case?   My guess is that $f(x,y)$ owns a unique saddle point because of the convexity and concavity of the function. I also guess that if the function is strictly concave-convex, then, the argument of the saddle point is also unique.  Any reference for a proof will also suffice. Thx.


How can I download apps from Google Play to my Tab using my PC's Internet connection?

I don't have access to the internet on my Samsung Tab 3 and don't have wifi either. Only my PC has internet access through a landline and non wireless modem. How can I download apps from Google Play to my tab? I got the USB cable that connects my tab to the PC.


I changed my admin user name and i've lost the admin rights

I changed my admin user name using System Preferences/User and Groups, but the name didn't change and the Admin user account was changed to standard and lost the admin rights. I've read similar questions here and solutions using single-user mode, but it seems like the /sbin/fsck -fy and the rm /var/db/ .AppleSetupDone commands are not working on my MacbookPro 2012 running on High Sierra. Any help would be appreciated. Thanks


One-liner to remove duplicates, keep ordering of list

I have the following list:  ['Herb', 'Alec', 'Herb', 'Don']   I want to remove duplicates while keeping the order, so it would be :  ['Herb', 'Alec', 'Don']   Here is how I would do this verbosely:  l_new = [] for item in l_old:     if item not in l_new: l_new.append(item)   Is there a way to do this in a single line?


Poisson random variables and Binomial Theorem

I'm working on a problem from Casella and Berger's Statistical Inference. X is distributed as Poisson$(\theta)$ and Y is distributed as Poisson$(\lambda)$, with X and Y being independent. We let U = X + Y and V = Y, and the conditional pdf of V|U is:   $\hspace{15mm}\large f(v|u) = \large \frac{f(u,v)}{f(u)} = \huge \frac{\frac{\theta^{u-v}}{(u-v!)}*\frac{\lambda^ve^{-\lambda}}{v!}}{\frac{(\theta+\lambda)^ue^{-(\theta+\lambda)}}{u!}}$  Apparently this simplifies to   $\hspace{15mm}\Large {u \choose v} (\frac{\lambda}{\theta+\lambda})^v(\frac{\theta}{\theta+\lambda})^{u-v}$  I don't see how the $\Large(\frac{\lambda}{\theta+\lambda})^v$ is possible. I keep ending up with $\Large(\frac{\lambda}{\theta})^v$ when I simplify the problem.


Do I need a "Travel company" to visit Russia as a tourist?

I am planning to visit Moscow this winter as a solo tourist. I am a Hungarian citizen. I booked airplane tickets myself. I was informed that I will need an invitation letter, and I think I will go this way: (), but now the tourist visa application online form asks:    the options are: None, Travel company. I think I will need to select travel company because the description says:     In the case of a tourist visa select "Travel company" from the list and give the name and address of the travel company. In the case of   business visa select "Organization" from the list and enter in the   "Name of organization" name of the host organization, enter the   address of the organization and TIN in the appropriate fields. In   the case of private visa select “Individual” from the list and enter   the name, birth date and home address of the host. In the case of   transit, select "None" from the list.  Reference number: printed on   the bottom line of approval of a foreign tourist "Референс №». It is   necessary to introduce whole number with leading zeros.       Confirmation number: printed on the top line of confirmation of a   foreign tourist. The number can contain only numbers or numbers with   letters. You should only enter the numbers.   However I do not have a travel company.   What do I do?   Select "None" from the drop down so that I don't have to fill in travel company(this seems to be against the description that says select travel company for tourist visa) Select Travel company and the Invitation letter company will be my travel company and they will provide appropriate details? as in () Apply at some additional travel company, because there is no other way?  Some other option?   I didn't expect the visa application to be this complicated. I hope I get there.


I have an error while running my c++ code using mingw in windows 10. The error is something like this : the procedure entry point __gxx_personality_v0 could not be located in the dynamic link library ----a.exe  I have no idea how to resolve that. I tried to google it but i could not find any solution.  Edit 1: I noticed that programs in a particular folder are not working. For other folders it is working fine.  Edit 2: I reinstalled MingW. But I am getting the error whenever i am using string data type in c++.


Can you earn miles with different airlines for the same one flight, if they are part of the same loyalty program?

For example, I flew British Airways LAX-LHR. I wanted to get miles on Alaska Airlines so I sent in the boarding pass, etc and received credit.   I also have a mileage plan with American Airlines. Since British Airways is part of the Oneworld Alliance, can I also request to receive miles to my American AAdvantage account for this same flight? If so, will I lose the miles already credited to my Alaska account?  I'm not trying to be greedy.. just don't want to miss out on any miles.


Are there any rulesets or laws for Q or Q continuum? Anything, that would prevent them from doing... anything? Or at least limit them from doing something really bad?  In "" episode Q explains to  that they can do, have, get, become anything they want or appear anywhere they want, with just a snap of fingers. If that is true and if there are absolutely no borders or limits, they can't pass, then how can universe work in general? Or, how did it manage to exist so far?  I mean -- any Q could wipe out Borg, entire human population or even entire universe... with just a snap of fingers. What could prevent Q from doing that?