There is a set of exams (e.g. SAT subject tests, AP exams, etc.), and a (male) student is necessarily taking more than one of those exams. My friend knows which ones he's taking, so I'm asking him which ones. Which sentence is correct?       "Which exams is he taking?"    or      "Which exams are he taking?"   Both sound weird to me, especially the second (even though I believe that is technically the correct one).   I would appreciate if somebody could help tag this question properly.

Over at stats.stackexchange we are having a minor kerfuffle over whether a title is using incorrect grammar. It has been edited and re-edited several times. It would be great to get some arbitration and a clear explanation.   The original title was "What questions is your data team hoping to answer?" which was edited to "What questions are your data team hoping to answer?", then edited back. See the question .


I am new in selenium.i am trying for the database testing in selenium webdriver using eclipse.  i have install mysql 6.3 server and configure ojdbc14.jar and mysql-connector-java-5.1.25.jar in eclipse please help me for how to perform databse testing?

After reading so many answers and forums it makes me confused. Some people say: Selenium webdriver is a browser automation tool and it has nothing to do with the database. And some other showing JARs and code that how we can connect selenium to the database and we can test database using selenium webdriver. So I would really like to know if we can do database testing using selenium? If yes then which databases tool it supports like Mysql, SQL server, Oracle... And if selenium is not suitable for database testing then please recommend to me the best tool for database testing.


I would like to replace "fWord" in the string "Input" as case insensitive.  while (FilteredWords.Any(Input.Contains)) {     foreach (string fWord in FilteredWords)     {         Input = Input.Replace(fWord, "****");     } }   (FilteredWords is a list of strings and Input is the string to "clean") It works, however is case sensitive. How do I make fWord case insensitive at replacing?

I need to search a string and replace all occurrences of %FirstName% and %PolicyAmount% with a value pulled from a database. The problem is the capitalization of FirstName varies. That prevents me from using the String.Replace() method. I've seen web pages on the subject that suggest  Regex.Replace(strInput, strToken, strReplaceWith, RegexOptions.IgnoreCase);   However for some reason when I try and replace %PolicyAmount% with $0, the replacement never takes place. I assume that it has something to do with the dollar sign being a reserved character in regex.   Is there another method I can use that doesn't involve sanitizing the input to deal with regex special characters?


Using XeLaTeX I have changed the body and math fonts to Gill Sans.  However, the operators defined using DeclareMathOperator still appear in Computer Modern.    How do I edit my configuration to make these operator names use the same font as in math mode?  MWE below:   \documentclass[10pt]{beamer} \usepackage{amsmath} \usepackage{mathspec} \usepackage{fontspec} \setmainfont[Ligatures=TeX, ItalicFont={Gill Sans Light Italic}, SlantedFont={Gill Sans Light Italic}, BoldFont={Gill Sans}, BoldItalicFont={Gill Sans Italic}, BoldSlantedFont={Gill Sans Italic}, Mapping=tex-text ]{Gill Sans Light} \newfontfamily\semibold{Gill Sans SemiBold} \renewcommand\familydefault{\sfdefault} \usefonttheme{serif}  \setmathfont{Gill Sans Light}  \begin{document} \begin{frame}  min $\min f$ \end{frame} \end{document}

How does one set the font for text inside a math environment? If I use \setmathsfont(Latin){FontName}, I can change the font for individual letters in the math environment, but not for functions such as \sin. (These aren't controlled by the set "Symbols" either.)  Here's a MWE:  \documentclass[a4paper,12pt]{article}  \usepackage[MnSymbol]{mathspec}  \usepackage[no-sscript]{xltxtra} \defaultfontfeatures{Mapping=tex-text}  \setmainfont{Times}  \setmathsfont(Digits){Times} \setmathsfont(Latin){Times} %\setmathsfont(Symbols){Times}  \begin{document}  Some text digits 1, 2, 3 and some math digits $1, 2, 3$.   Some italic text \textit{text}, and some math text $text$.  But, we have \textit{sin x} and $\sin x$. Or, \textit{arctan x} and $\arctan x$.  \end{document}


I have a test and control group in which I tested the impact of a sale on baseline revenue across a 3 week period (test received sale, control did not).        Control Test 1/1/2017    4   3 1/2/2017    3   4 1/3/2017    1   3 1/4/2017    2   3 1/5/2017    2   4 1/6/2017    1   7 1/7/2017    10  3 1/8/2017    2   3 1/9/2017    2   3 1/10/2017   2   3 1/11/2017   3   4 1/12/2017   1   5 1/13/2017   4   3 1/14/2017   3   4 1/15/2017   2   4 1/16/2017   1   4 1/17/2017   5   3 1/18/2017   3   4 1/19/2017   2   4 1/20/2017   1   6 1/21/2017   5   5 1/22/2017   7   5   I am using an independent t-test to analyze.  My question: Since I am measuring across multiple days, do I require a Bonferroni (or some other) correction?  The p-value is .037873 which is currently sig. but would not be using a correction.

I am trying to test the impact of a sale initiative on store revenue. I have created 10 matched pairs of stores and then randomly distributed one store in each pair into a test or control group.  I then ran the sale for 21 days within the test group (keeping control constant) and measured relative lift in revenue compared to baseline.  My questions  1.) Should I be using a paired t-test based on the previous store matching  2.) Should I be measuring across each day of the test such as:          Control Test 1/1/2017    4   3 1/2/2017    3   4 1/3/2017    1   3 1/4/2017    2   3 1/5/2017    2   4 1/6/2017    1   7   Or measuring across my paired markets such as:                 Test Control Market Pair 1   10  5 Market Pair 2   8   3 Market Pair 3   5   1


How this is possible?   ACL is not enabled in /etc/fstab, and I can verify it via manually opening fstab or running sudo mount | grep -i acl. But getfacl & setfacl Commands would work without any complains!   The problem is, first I need to understand why this is working, and second I need to check other systems to see if ACL support is available on them or not, so how can I do that?  ACL commands were tested on both / & /mydrive(see below for mount output).  OS Info:  uname -a: Linux localhost 3.2.0-4-amd64 #1 SMP Debian 3.2.57-3+deb7u1 x86_64 GNU/Linux  lsb_release -a: No LSB modules are available. Distributor ID: Debian Description:    Debian GNU/Linux 7.5 (wheezy) Release:    7.5 Codename:   wheezy   mount: sysfs on /sys type sysfs (rw,nosuid,nodev,noexec,relatime) proc on /proc type proc (rw,nosuid,nodev,noexec,relatime) udev on /dev type devtmpfs (rw,relatime,size=10240k,nr_inodes=384309,mode=755) devpts on /dev/pts type devpts (rw,nosuid,noexec,relatime,gid=5,mode=620,ptmxmode=000) tmpfs on /run type tmpfs (rw,nosuid,noexec,relatime,size=308664k,mode=755) /dev/disk/by-uuid/3180f94a-e765-44e9-93f7-33aa1c6422c0 on / type ext4 (rw,relatime,errors=remount-ro,user_xattr,barrier=1,data=ordered) tmpfs on /run/lock type tmpfs (rw,nosuid,nodev,noexec,relatime,size=5120k) tmpfs on /run/shm type tmpfs (rw,nosuid,nodev,noexec,relatime,size=1188500k) /dev/sda5 on /mydrive type ext4 (rw,relatime,user_xattr,barrier=1,data=ordered) rpc_pipefs on /var/lib/nfs/rpc_pipefs type rpc_pipefs (rw,relatime) binfmt_misc on /proc/sys/fs/binfmt_misc type binfmt_misc (rw,nosuid,nodev,noexec,relatime) fusectl on /sys/fs/fuse/connections type fusectl (rw,relatime)

IIRC then the mount options shown in /proc/mounts have changed. Some time ago acl and user_xattr were shown, now it seems that only noacl and nouser_xattr are shown if these features are turned off.  Where is this configured? Does that depend on the compiled-in defaults of the filesystem code? How can I check whether a volume supports e.g. ACL? Is there a better solution than testing with setfacl, getfacl?


Last time I posted a question (about one year ago), I noticed that Stack Overflow had the "Are you human?" verification check with Captcha. Now, we seem to be able to just post questions and answers freely (as I noticed today).   How can you prevent against bots, then?

Really just looking for honest answers from fellow users for this one.   How often do you get CAPTCHAs, and what were you doing when it appeared?  Some future scripts I'm working on may attempt actions that could at times require a CAPTCHA, which would throw a big wrench into the gears. I'm just trying to figure out when I can expect to see them, and when I can expect to avoid them.   I myself have only had to answer a CAPTCHA once, and it was on my first post ever.


I am in need of urgent help regarding formatting the table of contents in Latex. In the thesis preparation guidelines provided by our university, the table of contents, list of figures and list of tables details should be enclosed within a table as shown below:    In this connection, my question is How to generate the TOC, LOF, and LOT automatically in the above mentioned format using LyX.

A friend of mine is required by his faculty to format his lists of figures (= "Abbildungsverzeichnis") and tables (= "Tabellenverzeichnis") as shown in the picture below. Is there a way to realize this by redefining the respective commands in LaTeX? Besides the caption (~ "Kurzüberschrift") the source (= "Quelle") needs to be included in the lists as well.    I've prepared this MWE as a start – it's far away from the desired result though.  \documentclass{scrartcl}  \usepackage{mwe}  \begin{document}  \begin{figure} \centering \includegraphics{example-image} \caption{An awesome image. Source: Thatoneguy, W. (2003)}   \end{figure}  \begin{table}[ht] \centering \begin{tabular}{|c|c|} \hline Foo & Bar\\ \hline Meh & More meh \\ \hline \end{tabular} \caption{An awesome table. Source: Someone, A. (2012)} \end{table}  \listoffigures   \listoftables  \end{document}


After I installed some updates, MySQL-workbench app's Menu bar is showing duplicate menu entries.       The same issue was there for GIMP as well. But clean-remove and installing back again solved this problem.     Please let me know if there is any alternative to resolve this issue (If possible permanently), other than remove-and-install.

I installed mysql-workbench in Ubuntu 14.04 LTS using Software Center. It installs MySQL Workbench version 6.0.8.    In this, the menu is doubled    So I decided to upgrade MySQL Workbench. I added a repository provided by  and upgraded it.  sudo apt-get install mysql-workbench-community   Now MySQL Workbench version is    Still the menu is duplicated. How can I solve this issue?  Edit:  The same question was asked here without any answer:


Unable to install Oracle Java 11 on ubuntu 19.04.

I tried to install OracleJDK 8 using   sudo add-apt-repository ppa:webupd8team/java   But it's not working.   I searched the problem and found that      "The Oracle JDK License has changed for releases starting April 16, 2019." And  "Oracle Java (JDK) 8 Installer PPA (DISCONTINUED)"   So I installed the OpenJDK8 .   But why oracle cancelled the license of oracle 8 installer?


I calculate some lengths of a path (without the use of the let operator!). To achieve that I use the \pgfgetlastxy{}{}; command (which works fine so far) but if I scale the picture, the calculations do not make sense anymore, as I cannot take the scaling factor into account. The following code should demonstrate my problem. \documentclass{article} \usepackage{tikz} \tikzset{dot/.style={circle, fill, inner sep=2pt}}  \begin{document}     \begin{tikzpicture}[scale=1]         \draw (0,0) node[below] {scale = 1} -- (20pt,60pt);         \pgfgetlastxy{\myLastX}{\myLastY};         \node[dot, label={right:(\myLastX, \myLastY)}] at (\myLastX, \myLastY) {};     \end{tikzpicture} %     \begin{tikzpicture}[scale=0.5]         \draw (0,0) node[below] {scale = 0.5} -- (20pt,60pt);         \pgfgetlastxy{\myLastX}{\myLastY};          \node[dot, label={right:(\myLastX, \myLastY)}] at (\myLastX, \myLastY) {};     \end{tikzpicture} %     \begin{tikzpicture}[scale=0.5]         \draw (0,0) node[below] {scale = 0.5 (what I want)} -- (20pt,60pt);         \pgfgetlastxy{\myLastX}{\myLastY};          % \getglobalscale{\globalscale} <--- How to get the global value?         \pgfmathsetmacro\globalscale{0.5}         \node[dot, label={right:(\myLastX, \myLastY)}] at (\myLastX/\globalscale, \myLastY/\globalscale) {};     \end{tikzpicture} %     % Does not work     % \begin{tikzpicture}[scale=0.5]     %     \draw (0,0) node[below] {scale = 0.5 (what I want)} -- (20pt,60pt);     %     \pgfgetlastxy{\myLastX}{\myLastY};      %     \pgfkeysgetvalue{/tikz/scale}{\globalscale}     %     \node[dot, label={right:(\myLastX, \myLastY)}] at (\myLastX/\globalscale, \myLastY/\globalscale) {};     % \end{tikzpicture} \end{document}   TL;DR: To solve my (initial) problem I need to get the value of the global picture scale. The way I tried to get it in the last code snippet did not work. Is there any other way to get it?

Does it exist some tikz register (let say \zoomfactor) that provides the curent scale factor. For example can I do something like :   \begin{tikzpicture}[scale=2]     \begin{scope}[scale=1.5]         \draw (0,0) circle (\zoomfactor);     \end{scope} \end{tikzpicture}   and to obtain circle of size 3=2*1.5 ?


The portraits in the Harry Potter world - they talk, they act. Are they reflections of the person whom they portray, or are they, at least potentially, independent? Do they have free will? Do they, therefore have a soul?  We know that the Fat Lady could be afraid (3rd book) and Sir Cadogan could show courage, we know that Phineas Nigellus could like or dislike people, spy and whatnot. All of this seems to imply a measure of self-awareness.  What I'm curious about is, do artist in the HP universe perform an act of true creation, when painting a portrait? I am given to understand that Christianity only allows God to give things souls (Tolkien struggled with orcs, Morgoth's creations, possessing Free Will, and eventually made their origin to be tortured elves, making the Free Will thus come from Ilúvatar). Considering Rowling is also quite devout and , I find this element curious.

Does J.K. Rowling address how the interactive portraits work? Would a portrait painted after a Wizard/Witch died become interactive, or does the painting of the portrait have to take place during the Wizard/Witches lifetime?


Prove that if $\sum\limits_{n=1}^\infty z_n$ converges and there exists $\theta\in\mathbb{R}$ such that $|\arg(z_n)|\leq\theta<\frac{\pi}{2}$ for all $n\in\mathbb{Z^+}$, then it converges absolutely.  I tried invoking the convergence of $(z_n)$ to $0$, but couldn't find a second step or a route. Could someone give me some hints please?  Added later:  For all $n\in\mathbb{Z^+},z_n=\Re z_n+i\Im z_n$. Since  $\sum\limits_{n=1}^\infty z_n$ converges  $\sum\limits_{n=1}^\infty \Re z_n$ converges. But for all $n\in\mathbb{Z^+}$, $$\Re z_n=|z_n|\cos(\arg z_n)\geq|z_n|\cos\theta\geq0.$$ Now invoking the comparison test the convergence of $\sum\limits_{n=1}^\infty |z_n|\cos\theta$ is immediate. Hence $\sum\limits_{n=1}^\infty |z_n|$ converges, i.e. $\sum\limits_{n=1}^\infty z_n$ converges absolutely.

Here's a problem I'm having trouble with:     Show that if $\sum u_k$ converges for $u_k\in\Bbb C$, and $|\arg(u_k)|\leq c<\pi/2$ for all $k$, then $\sum |u_k|$ converges too.   All I have after looking at it for an hour is that I kind of believe it could be true (I didn't at first), but I don't really know where to start. Could you give me a hint? I know of course that $$u_k=|u_k|(\cos(\arg(u_k))+i\sin(\arg(u_k))),$$ but I don't have any ideas. I've tried looking at it geometrically too, but I just don't see anything.


Let $T$ be a linear transformation on the real vector space $\mathbb R^n$ over $\mathbb R$ such that $T^2 =\mu T$ for some $\mu\in\mathbb R$ . Then which of the following is/are true?           $\|Tx\| = |\mu| \|x\|$ for all $x \in\mathbb {R^n}$     If $\|Tx\| =  \| x\| $for some non zero vector $x \in\mathbb R^n$, then $\mu=\pm1$     $T= \mu I$ where $I$ is the identity transformation on $\mathbb R^n$       If $\|Tx \|>\|x\|$ for a non zero vector $x \in \mathbb R^n$, then $T$ is necessarily singular.         I am completely stuck on it. Can anybody help me please?

Let $T$ be a linear transformation $T:\mathbb{R}^{n}\rightarrow\mathbb{R}^{n}$ such that $T^{2}=\lambda T$ for some $\lambda\in\mathbb{R}.$ Then which of the following is/are true?  $1.\|T(x)\|=|\lambda|\|x\|$ for all $x\in\mathbb{R}^n.$  $2.$ If $\|T(x)\|=\|x\|$ for some non-zero $x\in\mathbb{R}^{n}$, then $\lambda=\pm 1.$  $3.T=\lambda I$ where $I$ is the identity transformation on $\mathbb{R}^{n}.$  $4.$ If $\|T(x)\|>\|x\|$ for a nonzero vector $x\in\mathbb{R}^{n},$ then $T$ is singular.  According to me since $T^{2}=\lambda T$ we have $T$ satisfies the polynomial $x^{2}-\lambda x.$ So choices for its minimal polynomial are $x,x-\lambda,x(x-\lambda).$ So $3$rd option is clearly incorrect and $4$th option is not satisfied if $T=I$ and hence correct one. I am confused in first two options . Please help me. Thanks in advance.


I have a tab control with couple of tabs on it, I want to disable  one of the tabs while checking a radio button on the other tab page. I can disable the controls on it by using tab.Enabled = False; But I want to know how I am able to disable the whole page from even clicking on the tab. The way I did I can select the tab still, just the controls on it are disable.


Recently I have seen a code like this -   class Test{         public static void main(String[] args){                  String s1 = "String1"; //1                 String s2 = new String("String2"); //2                  System.out.println(s1.equals("String1"));                 System.out.println(s1=="String1"); //3                  System.out.println(s2.equals("String2"));                  System.out.println(s2=="String2"); //4         } }   and the out put is -   true true true false   So far I know, at point 1 "String1" is placed in String pool and assigned with String type reference variable s1. Isn't there any String object created?  We know a new String object is created at point 2 and at point 4 the expression (s2=="String2") evaluated to false. If a new String object is created at point 1 then how the expression at point 3 (s1=="String1") evaluated to true. And if a new object is not created at point 1 how the expression at point 3 (s1=="String1") evaluated to true?  Thanks in Advance

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


I am struggling to comprehend the question below. Especially the meaning of 'the image of $L$ under $F$'. Let $F : \mathbb R^n \to \mathbb R^m$ be a linear transformation. Prove that if $L$ is a $1$-dimensional subspace of $\mathbb R^n$, then  $$F(L)=\{y \in \mathbb R^m \mid y=F(x),x \in L\}$$  the image of $L$ under $F$ is a subspace of $\mathbb R^m$ with dimension $1$ or $0$. Hence prove that if the kernel of $F$ is $\{0\}$, the image of $L$ is a $1$- dimensional subspace of $\mathbb R^m$ (and so in this case, $F$ takes lines in $\mathbb R^n$ to lines in $\mathbb R^m$).

I am having trouble understanding this whole question, and how to prove it.  Let $F:\mathbb{R}^n\to\mathbb{R}^m$ be a linear transformation. Prove that if $L$ is a $1$-dimensional subspace of $\mathbb{R}^n$, then  $F(L)=\{y\in\mathbb{R}^m: y=F(x)\text{ for some }x\in L\}$  the image of $L$ under $F$ is a subspace of $\mathbb{R}^m$ with dimension $1$ or $0$. Hence prove that if the kernel of $F$ is $\{0\}$, then the image of $L$ is a $1$-dimensional subspace of $\mathbb{R}^m$ (and so, in this case, $F$ takes lines in $\mathbb{R}^n$ to lines in $\mathbb{R}^m$).


i need help with this exercise.     If $\mathbb{H}$ is a finite field and $a\neq0, b\neq0$, are elements   of $\mathbb{H}$ then exists $u,v\in\mathbb{H}$ such that   $1+au^{2}+bv^{2}=0 $   I don't have idea of how attack this exercise. Can someone help me?

Let $\mathbb{F}$ be a finite field.  Let $a_1,\dots,a_n \in \mathbb{F}$ be given.  I want to know whether there exists $x_1,\dots,x_n \in \mathbb{F}$ such that  $$a_1 x_1^2 + a_2 x_2^2 + \dots + a_n x_n^2 = 1.$$  My question: Can we characterize when this equation has a solution, i.e., by some criterion on $a_1,\dots,a_n$?  Is there a clean characterization, in terms of $a_1,\dots,a_n$ and the properties of $\mathbb{F}$?    Here's what I can see immediately.  First, if $n=1$, there is an easy answer (the equation has a solution iff $a_1$ is a square in $\mathbb{F}$).  Second, if any $a_i$ is a square in $\mathbb{F}$, the equation has a solution (set all other $x_j$'s to $0$), so we can assume that all the $a_i$'s are non-squares and that $n \ge 2$.  Third, if $-1$ is a square in $\mathbb{F}$, then the equation has a solution: we can take $x_2 =  \sqrt{-a_1/a_2} \cdot x_1$.  But what about the case where $-1$ is a non-square in $\mathbb{F}$?  Is it always guaranteed to have a solution in this case?


I wished to know if there is a specific package to put in a sequence of images like the old films of a camera or old movies. Just as an alternative for my book the effect of which could also be very nice. Correctly, with sincerity, this is a "do this for me" question. I have no idea if I must to create successive tables, or to do a drawing with TikZ/PStricks (using successive iterations), or with other tricks, but I'm curious how you would set up the solution. I put some images:

Is it possible to make a movie film strip of embedded PDF images?


I'm using an iPhone, but I would imagine it's the same for other mobile devices as well.  If you browse to any stack exchange site, you get a very well made mobile site.  The only gripe that I have is that I can't find any way to view the number of visitors to my questions?  Am I missing something or could this possibly be integrated into the mobile renderer?

One thing that bugs me when using the mobile site is you can't see the views of a question anywhere (even though you can rank questions by views on your profile!). Can this be added somewhere?


The enum I'm using uses String's, but the database uses int.  It's relatively simple to create a look-up from within the State enum to return an integer.  However, the lookup only works one way, to get an integer from a state.  Do I need a wrapper class which takes integers and returns a State?  The database stores the State as an int, and I don't want to change that.  package net.bounceme.dur.server.db;  import org.apache.commons.dbcp.BasicDataSource; import java.sql.Connection; import java.sql.PreparedStatement; import java.sql.ResultSet; import java.sql.SQLException; import java.util.ArrayList; import java.util.List; import java.util.logging.Level; import java.util.logging.Logger; import net.bounceme.dur.data.State; import net.bounceme.dur.data.Title; import net.bounceme.dur.server.streams.MyProps;  public class Queries {      private static final Logger log = Logger.getLogger(Queries.class.getName());     private final MyProps p = new MyProps();     private Connection connection = null;      public void connect() throws SQLException {         BasicDataSource dataSource = new BasicDataSource();         dataSource.setDriverClassName(p.getDbDriver());         dataSource.setUrl(p.getDbUrl());         dataSource.setUsername(p.getDbUser());         dataSource.setPassword(p.getDbPassword());         connection = dataSource.getConnection();     }      public List<Title> selectTitles() throws SQLException, ClassNotFoundException, InstantiationException, IllegalAccessException {         connect();         PreparedStatement statement = connection.prepareStatement("SELECT * FROM titles.titles");         ResultSet resultSet = statement.executeQuery();         Title title = null;         List<Title> titles = new ArrayList<>();         while (resultSet.next()) {             title = new Title();             title.setId(resultSet.getInt(1));             title.setCreated(resultSet.getTimestamp(2));             title.setPhone(resultSet.getInt(3));             title.setTitle(resultSet.getString(4));             int state = resultSet.getInt(5);             State s;             title.setState(State.a);             title.setState(State.undefined);             titles.add(title);         }         return titles;     }      public void updateTitle(Title clientTitle) {         try {             connect();             String updateString                     = "update titles.titles "                     + "set STATE = ? where ID = ?";             try (PreparedStatement ps = connection.prepareStatement(updateString)) {                 log.info(clientTitle.toString());                 ps.setInt(1, clientTitle.getState().getCode());                 ps.setInt(2, clientTitle.getId());                 ps.executeUpdate();             }         } catch (SQLException ex) {             Logger.getLogger(Queries.class.getName()).log(Level.SEVERE, null, ex);         }         log.info("...updated...?");     } }     package net.bounceme.dur.data;  public enum State {      undefined(0), x(1), o(2), c(3), a(4), l(5), d(6);     private int code = 0;      State(int code) {         this.code = code;     }      public int getCode() {         return code;     }      public State getState() {         switch (code) {             case 0:                 return State.undefined;             case 1:                 return State.x;             case 2:                 return State.o;             case 3:                 return State.c;             case 4:                 return State.a;             case 5:                 return State.d;             case 6:                 return State.l;             default:                 return State.undefined;         }     } }   Something like:     State stateFromInt = StateUtils.getState(i);   but then I need a StateUtils class, and that just seems like a hassle.  I fully realize it's possible to make the database store String data, and parse that back into a state, but that's not the solution I'm asking for.

How can you enumerate an enum in C#?  E.g. the following code does not compile:  public enum Suit {     Spades,     Hearts,     Clubs,     Diamonds }  public void EnumerateAllSuitsDemoMethod() {     foreach (Suit suit in Suit)     {         DoSomething(suit);     } }   And it gives the following compile-time error:     'Suit' is a 'type' but is used like a 'variable'   It fails on the Suit keyword, the second one.


So, I just failed an audit. Whole separate question about that to come, but unrelated - there seems to be a stray semi-colon at the end of the warning message.   This was the Late Answers Queue, on the very off chance the text comes from different sources.

There is a (very minor) typo in the Close Votes review audit failure message. The message is presented as follows:  STOP! Look and Listen. This was an audit, designed to see if you were paying attention. You didn't pass. There are no major problems with this question. You should click Leave Open, or make minor corrections via Edit. Don't worry, we've already handled this post appropriately – but please take a minute to look it over closely, keeping in mind the guidance above.;  The ; at the end is a typo and is in the actual message that was displayed.


For some reason, despite all the three icons are active, this circle mesh isn't showing up in the viewport under the "Layout" tab, but it shows up in render and in any other workspace, such as "Shading", I can't figure out why and this way I can't pose his eyes, how can I fix this?

I'm doing Blender Guru's Chair on yt. At one point he isolated a part so we could work on the seams. Now I can't seem to exit the Isolation mode for this part? In Layout Mode it's stuck but in all other modes I can see the parts. I've tried Alt+H and Ctrl+H and 'H' on it's own but nothing seems to change. The outliner shows the parts as visibile.  Any Ideas?  David  Layout Mode - Brace 1 is isolated but other parts are visible in outliner:   All parts visible in other modes


how to merge my root partition with unallocated space with Home and Swap directory in between

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


I've finished all the questions in Chapter 2 of Principles of Mathematical Analysis by Walter Rudin (self study), but I have a question about Q.28, which reads:     Prove that every closed set in a separable metric space is the union of a (possibly empty) perfect set and a set which is at most countable. (Corollary: Every countable closed set in $\mathbb{R}^k$ has isolated points.)   It's easy to answer the question, given what's proved in Q.27, but the corollary is a bit weird. It looks to me as though it is just an immediate consequence of the fact that non-empty perfect sets in $\mathbb{R}^k$ are uncountable, which is proved in the main text. I don't see what it has to do with what is proved in this question.  Given how meticulous the book is, I suspect the apparent non-sequiteur means I'm missing something.

I'm reading Baby Rudin and exercise 28 of chapter 2 reads "Prove that every closed set in a separable metric space is the union of a (possibly empty) perfect set and a set which is at most countable." I don't understand why the set must be closed in order for this to be true.  My proof is as follows, and I don't make any reference to the closedness of the set:  Let $E$ be a set in a separable metric space.  Let $B$ be a countable base of that metric space.  Let $P$ be the set of condensation points of $E$.  I claim that $P$ is perfect and $E-P$ is at most countable.  If $p$ is a limit point of $P$, then every neighborhood of $p$ includes at least one point $q$ of P.  For a neighborhood $N_{p}$ of $p$, choose a neighborhood $N_{q} \subset N_{p}$ of $q$.  Since $q$ is a condensation point of $E$, uncountably many points of $E$ are in $N_{q}$, and thus in $N_{p}$.  So $p\in P$ and $P$ is closed.  If $p \in P$, then $p$ is a condensation point of $E$, so every neighborhood $N_{p}$ of $p$ must include uncountably many points of $E$.  If $p$ is not a limit point of $P$, then there exists a neighborhood $N_{p}$ of $p$ such that $N_p$ includes no condensation points of $E$ except for $p$.  This means that every point $q\in N_{p}-\{p\}$ must have a neighborhood $N_{q}$ that does not have uncountably many points of $E$.  For each $b_{k}\in B \cap \mathscr{P}(N_{p})$, choose such a neighborhood $N_{q_{k}} \supset b_{k}$ of some point $q\in N_{p}-\{p\}$.  Now $\{N_{q_{k}}\}$ covers $N_{p}$, and $\bigcup_{k=1}^{\infty}N_{q_{k}}\supset N_{p}$ has at most countably many points of $E$, for it is a union of countably many sets that have at most countably many points of $E$.  This contradicts the assumption that $p\in P$.  So $P$ is perfect.  Let $S=E-P$. There are no condensation points in $S$.  So there exists an open cover $\{N_s\}$, where each $N_s$ is a neighborhood of $s \in S$ with at most countably many elements of $S$. For each $b_{k}\in B \cap \mathscr{P}(S)$, choose such a neighborhood $N_{s_{k}} \supset b_{k}$ of some point $s\in S$.  Then we have a countable subcover $\{N_{p_{k}}\}$ of $S$. As $N_{p_{k}} \cap S$ is at most countable for all $k$, $S$ must be at most countable.  So what am I doing wrong?  Or is Rudin's assumption of closedness extraneous?


I am using below sed command, but if MacAddressPasswordeRegisteryValue is WElcome12# then its producing WElcome12 and removing #. Any way to avoid it?  sed -i "s#^mac.address.sftp.user.password=.*#mac.address.sftp.user.password=${MacAddressPasswordeRegisteryValue#*=}#" $APP_CONFIG_FILE

I have a script that reads a text stream and generates a file of sed commands that is later run with sed -f. The generated sed commands are like:  s/cid:image002\.gif@01CC3D46\.926E77E0/https:\/\/mysite.com\/files\/1922/g s/cid:image003\.gif@01CC3D46\.926E77E0/https:\/\/mysite.com\/files\/1923/g s/cid:image004\.jpg@01CC3D46\.926E77E0/https:\/\/mysite.com\/files\/1924/g   Assume the script which generates the sed commands is something like:  while read cid fileid do     cidpat="$(echo $cid | sed -e s/\\./\\\\./g)"     echo 's/'"$cidpat"'/https:\/\/mysite.com\/files\/'"$fileid"'/g' >> sedscr done   How can I improve the script to ensure all regex metacharacters in the cid string are escaped and interpolated properly?


When running slope(analysis) from model I receive a high value of somewhere around 71. After then exporting model as python snippet and changing only the output raster name (using same input raster) I receive a high value of 45 in the output raster.  This makes absolutely no sense.  Has anybody ever experienced this?

This is actually a two part question:   Which methods are there to calculate average slope by unit (say km²) for a given area? Are there any special requirements on the data - like additional information besides height measurements? Which open source GIS implement methods usable to calculate average slope on a grid (e.g. TIF file)?


In my current project, I'm using the boxed versions of certain operations. The amsmath package provides convenient \boxtimes and \boxplus operators for this, which are the same size as \square.  However, I haven't been able to find a box with a slash (i.e. set-minus symbol). Is there a straightforward way I could make one, e.g. by somehow removing one of the lines from \boxtimes, or overlaying \square with an equally-sized slash symbol? The straightforward \not\square looks rather dreadful: . \cancel\square looks somewhat better, but the line still extends beyond the edges of the square: .

I know what my symbol or character looks like, but I don't know what the command is or which math alphabet it came from. How do I go about finding this out?


I use HP notebook and my os is windows 8.1. Someone made my guest account as administrator and removed administrator rights from my main account. So, I m not able to access anything from my main account. There is no option to give admin rights back to my main account, because the current admin account is guest account. I m completely locked out here. Someone please help me. Thanks in advance.

I accidentally disabled my admin account.  After I login to another account I found I can not get admin rights, because all admin accounts on my computer are disabled.  I clicked on 'run as administrator' but only see a smart card choice (all the admin accounts are disabled so no choice provided)    I don't want to re-install my OS, help!    Details:  I have account A on my computer.    I got a new computer so I want to give the old one to my mother.    Creating a new user account B for her and disable account A.    Logout and restart.    Successfully login B, now I found I could not get admin rights because no account choice is provided.    More informations about my machine:  OS is Windows 10 and my admin account is a Microsoft Account.  I have an arch-linux installed on my computer and dual-boot it using GRUB, so maybe I can not use safe mode.


I create a png file and view it on macOS with [...] image.save("mandel.png", "PNG") p = subprocess.run(["open", "mandel.png"], capture_output=True) print(p.stdout.decode(),p.stderr.decode())  But what have I to choose for windows? "open" doesn't work on Win10.

I need to be able to open a document using its default application in Windows and Mac OS. Basically, I want to do the same thing that happens when you double-click on the document icon in Explorer or Finder. What is the best way to do this in Python?


Using Tampermonkey I want to reverse the text on the bbc news website (why? because), obviously this is locally only. I have already written something to replace a part of it, the problem is accessing all the text on the page. Is there an efficient way of doing this in JQuery?  e.g. I have a reverse() function, given:
   Text1   Text2   <fieldset>     <legend>Text3</legend>   Is there some way of targetting Text1, Text2 and Text3 without touching anything else? I can write something to explicitly check the tagName while traversing the DOM and hope there's a text type, or something similar, but I'm wondering if JQuery already has something for doing this?  thanks

I would like to get all descendant text nodes of an element, as a jQuery collection. What is the best way to do that?


The new media library is awesome but its a bit inefficient. When the page loads, it puts ALL MEDIA ITEMS as the default view. Which causes the page to load a LOT of images. I'd like it to default to "Uploaded to this post".  I've tried other solutions, such as changing the default selection   But this is done via JS and when there's a lot of images on the page, it first starts loading the "ALL MEDIA ITEMS" tab and then switches tabs to "Uploaded to this post" so I think the better way to do this would be to reorder the select box so that "Uploaded to this post" is first and the default.  I'm not sure how to go about doing that. Or if its even possible with filters. Would love some feedback from the experts. Thanks!

When inserting media into a post, is there a way to change the default-view of the Media-Library from "All media items" to "Uploaded to this post"?    There is another thread where this question was extracted from:


I have just ordered a GTX 1660 OC edition 6GB GDDR5 and I have Ubuntu 18.04 x64 with Cinnamon UI.  I would like to know which driver do you advise to install for that GPU?  E.g. do you think I should use mesa (e.g. )? I heard a lot of improvements was made for GTX 1660 from mesa 19.3.  I would like to avoid any tearing/lagging issue I have read online about NVIDIA + Ubuntu + Cinnamon.  Thanks

Is there a package of Ubuntu drivers as driver pack solution? I tried to search for it, but I did not find it. If there is, how can I easily get it?


In Math Olympiad, I needed to create an equation for circle that connects points $A(3;0)$, $B(5;4)$, $C(0;3)$.  I did it in this way:  1) draw segments connecting those points - $AB, BC, CA$  2) draw perpendiculars from the centre of the segments  3) the point where all perpendiculars meet is the centre of circle that connects points $A(3;0)$, $B(5;4)$, $C(0;3)$  4) calculated the Radius of the circle ($R = 2.69$) and created equation:  \begin{align*}  (x−a)^2 + (y−b)^2 & = r^2\\ (x−2.67)^2 + (y−2.67)^2 & = 7.22 \end{align*}  [img]  But I am wondering if either is possible:  1) to solve it in easier/faster way   2) to create formula to get a centre of circle that connects points $A(3;0)$, $B(4;5)$, $C(0;3)$.

Get the equation of a circle through the points $(1,1), (2,4), (5,3) $.  I can solve this by simply drawing it, but is there a way of solving it (easily) without having to draw?


I've got my files (mostly text/code, nothing of heavy like videos etc.) in a directory on a remote server which I can only access by means of SSH. Can I mount it on my laptop to use it seamlessly from all the applications (incl command-line ones)?

How to mount a remote directory using SSH to be available  same as if it is  a local directory?


I can't install any thing using  apt-get install   It gives this error:     E: could not get lock /var/lib/dpkg/lock - open (11: Resource   temporarily unavailable)   E: unable to lock the administration directory (var/lib/dpkg), its   another process using it   I tried   dpkg --configure -a  dpkg: error: dpkg status database is locked by another process.  dpkg --configure -a --force-congnew dpkg: error: dpkg status database is locked by another process.   Although I have shut down and restart the system to kill all other hidden process but do not know how to fix it.  I am using all these commands as a super user.

I get this error when trying to use apt-get:  E: Could not get lock /var/lib/dpkg/lock - open (11 Resource temporarily unavailable) E: Unable to lock the administration directory (/var/lib/dpkg/) is another process using it?     How can I fix this?


The following code is from the AvalonEdit project:  // Creates a new TextEditor instance.  public TextEditor() : this(new TextArea()) { }   I have no idea what the : this(new ... part does. Could you please help explain the C# syntax?

I was curious about how other people use the this keyword. I tend to use it in constructors, but I may also use it throughout the class in other methods. Some examples:  In a constructor:  public Light(Vector v) {     this.dir = new Vector(v); }   Elsewhere  public void SomeMethod() {     Vector vec = new Vector();     double d = (vec * vec) - (this.radius * this.radius); }


There is a partial sum formula for $$\sum_{x=1}^n x^1 = \frac{n(n+1)}{2}$$ and even one when the exponent of $x$ is $0$: $$\sum_{x=1}^n x^0 = n$$ but I cannot find one for exponent $-1$: $$\sum_{x=1}^n x^{-1} = ?$$  I tried $$\frac2{n(n+1)},$$ but that failed miserably.

How to find the sum of the following series? $$1 + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + \dots + \frac{1}{n}$$ This is a harmonic progression. So, is the following formula correct? $\frac{(number ~of ~terms)^2}{sum~ of~ all ~the~ denominators}$ $\Rightarrow $ if $\frac{1}{A} + \frac{1}{B} +\frac{1}{C}$ are in H.P. Therefore the sum of the series can be written as : $\Rightarrow \frac{(3)^3}{(A+B+C)}$ Is this correct? Please suggest.


Citire liste de pachete... Terminat Se construiește arborele de dependență        Se citesc informațiile de stare... Terminat Unele pachete n-au putut fi instalate. Aceasta ar putea însemna că ați cerut o situație imposibilă sau că folosiți distribuția instabilă în care unele pachete cerute n-au fost create încă sau au fost mutate din Incoming. Următoarele informații ar putea să vă ajute la rezolvarea situației:  Următoarele pachete au dependențe neîndeplinite:  wine-stable : Depinde: wine-stable-i386 (= 5.0.0~bionic)                Depinde: wine-stable-amd64 (= 5.0.0~bionic) dar nu este pe cale să fie instalat E: Nu pot corecta problema, ați ținut pachete deteriorate.

I have followed all the instructions on .  In particular, I have run the following commands: sudo dpkg --add-architecture i386  wget -nc https://dl.winehq.org/wine-builds/winehq.key sudo apt-key add winehq.key sudo apt-add-repository 'deb https://dl.winehq.org/wine-builds/ubuntu/ bionic main'   The first three of the above seemed to work fine.  However, the last command gives me the following error: Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  winehq-stable : Depends: wine-stable (= 5.0.0~bionic) E: Unable to correct problems, you have held broken packages.  I'm running Lubuntu 18.04.3 on a USB live stick.  (However, if I remember correctly, a couple days ago I got the exact same error on a normal hard disk Lubuntu 18.04.3 installation.) I've read that a lot of people get similar errors.  Unfortunately I haven't found any solutions online that worked. Any help would be much appreciated.  Thanks! EDIT:  Thanks for the comments and suggestions everyone.  I'll try them out later today. In the mean time, here's something I don't understand.  Ubuntu 18.04 has been around for almost two years now.  In all that time, surely somebody has successfully installed wine, right?  What did they do to get it working?


Jootha is a Hindi word which means that the food, which actually belongs to me has been tasted by someone else, without my permission. In India this is considered as a taboo and states that the food is not in its original intended state.   My friends suggested a few words like preconsume and foreeat which after some searching and user comments indicated were not correct English words. The closest word that I found that conveyed a similar meaning was . It means a scrap or morsel of food left at a meal. But still this doesn't  convey the same meaning as clearly as the Hindi word.  Please suggest a word or a phase with which I can convey similar meaning as the Hindi word "jootha".

:     "Food left on plates after eating is   defined as garbage (jutha) because it   has been polluted by the eater’s   saliva. It may be handled in the   family.   Is there an English word for something that is not eatable or usable by others because it has someone's saliva on it?


cross posted from diy -- people suggested I ask the question here.  I live in a townhouse with a small kitchen and I am wondering if something like this item:   implies that it can be used as a microwave and as a conventional oven where you would bake things.  I understand the space inside it is limited but as my kitchen is very small if it can serve both roles, that would be a life saver. I understand I wouldn't be cooking with ovens much, but could you do the basic things, like baking, etc...

I have microwave oven, but I can't bake cakes and cookies in it. So I need an electric oven, but people are suggesting I buy a convection microwave to do both baking and normal microwaving. Will that work? Or do I really need to get an electric oven to bake?


In accessing array elements I have long been using syntax like arrayname[index]. However I saw this syntax 'index[array name]' in a program. It does compiles, giving output '3'. But is it a right or wrong syntax? int arr[5] = {1,2,3,4,5}; cout << 2[arr] << '\n';  I can't find explanation of such thing in previous posts or elsewhere so I open up this post. Thank you.

As Joel points out in , in  (aka: K & R), there is mention of this property of arrays in C: a[5] == 5[a]  Joel says that it's because of pointer arithmetic but I still don't understand. Why does a[5] == 5[a]?


By looking at the sheer number of residents on Gallifrey (as shown in The Day of the Doctor), we see both men women and several children.   How do(/did) the Time Lords reproduce? Is there any explanation about it?

How do Gallifreyans breed? Are they asexual - like Donna asked, 'Do you lop a limb off and sprout another one?'  And can humans and Gallifreyans inter-breed? Eight claimed he was half human on his mothers side, but that doesn't come up in any other incarnation.


What is the difference between sudo -i and sudo su?

What is the difference between the following commands:  su sudo -s sudo -i sudo bash   I know for su I need to know the root password, and for sudo I have to be in the sudoers file, but once executed what is difference?  I know there is a difference between su and sudo -s because my home directory is /root after I execute su, but my home directory is still /home/myname after sudo -s. But I suspect this is just a symptom of an underlying difference that I'm missing.


I put country style pork ribs in my crock pot this morning with bbq sauce and didn't realize I set the control to only warm. It was not noticed until it had been on warm for about 2 1/2 hours. I immediately turned it to high.  Will they be safe to eat after cooking on high for a few hours and low for a couple more?

I just bought all the ingredients to make a soup in the crock pot. I was planning on having it cook all day, but I just realized the recipe only calls for it to cook on low for 3-4 hours. If I cook it on low for 3-4 hours, and then put it on warm before I leave for work, will it be a bacteria minefield or will it be warm enough to keep the food safe from bacteria?


I need to delete all subscribers. This is around 10 million subscribers (That is not a typo)  Can I create a group - Delete the group and select delete from all subscribers (Top Level Business Unit)  Or is there an easier or better way to do this?

everybody,  in the last weeks we have defined addresses from the All Subscriber List that we want to keep and a number of 400k that we would delete.   The users we want to keep are divided into 4 different data extensions. Actually, the plan was to delete the All Subscribers and then upload the Data Extensions again and add the All Subscribers accordingly.  Is that possible? Or what would be the best course of action?  Thx


Given the following classes:  class animal { public:     virtual void noise() { }; };  class cat: public animal{ public:     void noise() {         cout << "mew" << endl;     } };   Why does this work (prints the correct noise):  animal *animals[2]; animals[0] = new dog; animals[0]->noise();   But this doesn't:  animal animals[2]; dog dog1; animals[0] = dog1; animals[0].noise();   Is there a way to make it work without using pointers?  The software wants me to add more text but I think I have already made my question very clear so this is just random text...

Someone mentioned it in the IRC as the slicing problem.


Most books show Ito diffusions satisfy Markov property, that is, $E[f(X_{t+h})\mid F_t]=E^{X_t}[f(X_h)]$. But I was wondering whether it's true that  $E[f(X_{t+h})\mid X_t]=E^{X_t}[f(X_h)]$.  In this , it seems that stationarity of transition of the processes implies  $E[f(X_{t+h})\mid X_t] = E^{X_t}[f(X_h)]$. If it's true, my question is solved. But I don't know why $E^{X_t}[f(X_h)]$ is $X_t$ measurable and how to connect it to the transition probability.

In every book I can find, the Markov property for ito diffusions, $E[f(X_{t+h})\mid F_s] = E^{X_t}f(X_h)$ is stated for $\textbf{bounded}$ Borel functions.   However, I have the following statement from a set of notes: $$g(t,S_t) = E[(S_T-K)^{+}\mid F_t]$$  Where $g$ is some Borel function.  How can this be justified? Our $f$ here is $(x-K)^+$ which is not bounded.  Thank you


Is there a valid solution to the ? why has it puzzled mathematicians and physicists for so long?

One can obtain the solution to a $2$-Body problem analytically. However, I understand that obtaining a general solution to a  is impossible.  Is there a proof somewhere that shows this possibility/impossibility?  Edit: I am looking to prove or disprove the below statement:     there exists a power series that that   solve this problem, for all the terms   in the series and the summation of the   series must converge.


So, I am setting up an ssh server. I have installed the ssh-server program on my server. However, I didn't want to connect to it through port 22, because reasons, so I set the server to listen through another port (2584). How do i set up my client to also connect through port 2584 rather than port 22?

I changed my SSH port in the /etc/ssh/sshd_config file and then restarted the ssh service. I implemented fail2ban and updated the port to my SSH under that config. I also then implemented the UFW firewall and allowed incoming connections to my new SSH port.  However, when I try and login with my SSH key using ssh -i /Users/myuser/.ssh/vpsssh user@555.555.555.555 it's trying to connect to port 22 instead of the defined port I have.


There was a series of Lego Star Wars episodes that aired on Cartoon Network a few years ago - "The Padawan Menace", "The Empire Strikes Out", and "The Yoda Chronicles".  While these episodes are indeed full of the classic Lego Star Wars humor (Yoda did not likely sit on Mace's lap and say "An awkward, this moment is"), does the larger theme of events have any place in Star Wars canon?

For all types of derivative works, namely:   Movies Novels Comic books Other written works (including RPG materials) Cartoons Video games Derivative movies (such as the infamous Ewok movies and even more infamous )   According to what rules does something become "canon" and who is responsible for the evaluation of a published work?


So i have a function that has to return 3 values, i haven't found a better way to do this other than returning a list. Is this code a good programming practice? And if not how to fix it.  Example function:  def func():     #code     return [a,b,c]   Main code:     #code    list = func()    k = list[0]    l = list[1]    m = list[2]

The canonical way to return multiple values in languages that support it is often . Option: Using a tuple Consider this trivial example: def f(x):   y0 = x + 1   y1 = x * 3   y2 = y0 ** y3   return (y0, y1, y2)  However, this quickly gets problematic as the number of values returned increases. What if you want to return four or five values? Sure, you could keep tupling them, but it gets easy to forget which value is where. It's also rather ugly to unpack them wherever you want to receive them. Option: Using a dictionary The next logical step seems to be to introduce some sort of 'record notation'. In Python, the obvious way to do this is by means of a dict. Consider the following: def g(x):   y0 = x + 1   y1 = x * 3   y2 = y0 ** y3   return {'y0': y0, 'y1': y1 ,'y2': y2}  (Just to be clear, y0, y1, and y2 are just meant as abstract identifiers. As pointed out, in practice you'd use meaningful identifiers.) Now, we have a mechanism whereby we can project out a particular member of the returned object. For example, result['y0']  Option: Using a class However, there is another option. We could instead return a specialized structure. I've framed this in the context of Python, but I'm sure it applies to other languages as well. Indeed, if you were working in C this might very well be your only option. Here goes: class ReturnValue:   def __init__(self, y0, y1, y2):      self.y0 = y0      self.y1 = y1      self.y2 = y2  def g(x):   y0 = x + 1   y1 = x * 3   y2 = y0 ** y3   return ReturnValue(y0, y1, y2)  In Python the previous two are perhaps very similar in terms of plumbing - after all { y0, y1, y2 } just end up being entries in the internal __dict__ of the ReturnValue. There is one additional feature provided by Python though for tiny objects, the __slots__ attribute. The class could be expressed as: class ReturnValue(object):   __slots__ = ["y0", "y1", "y2"]   def __init__(self, y0, y1, y2):      self.y0 = y0      self.y1 = y1      self.y2 = y2  From the :  The __slots__ declaration takes a sequence of instance variables and reserves just enough space in each instance to hold a value for each variable. Space is saved because __dict__ is not created for each instance.  Option: Using a  (Python 3.7+) Using Python 3.7's new dataclasses, return a class with automatically added special methods, typing and other useful tools: @dataclass class Returnvalue:     y0: int     y1: float     y3: int  def total_cost(x):     y0 = x + 1     y1 = x * 3     y2 = y0 ** y3     return ReturnValue(y0, y1, y2)  Option: Using a list Another suggestion which I'd overlooked comes from Bill the Lizard: def h(x):   result = [x + 1]   result.append(x * 3)   result.append(y0 ** y3)   return result  This is my least favorite method though. I suppose I'm tainted by exposure to Haskell, but the idea of mixed-type lists has always felt uncomfortable to me. In this particular example the list is -not- mixed type, but it conceivably could be. A list used in this way really doesn't gain anything with respect to the tuple as far as I can tell. The only real difference between lists and tuples in Python is that lists are , whereas tuples are not. I personally tend to carry over the conventions from functional programming: use lists for any number of elements of the same type, and tuples for a fixed number of elements of predetermined types. Question After the lengthy preamble, comes the inevitable question. Which method (do you think) is best?


I am loading WMS layer in Python console with simple code. Then I try to make the layer invisible in TOC, but not success. I run the code in QGIS 3.4.3 in Python console in Windows 10.  from qgis.core import QgsLayerTreeLayer,QgsProject   from PyQt5.QtCore import Qt  url_cur= "url='https://ags.iplan.gov.il/arcgis/rest/services/PlanningPublic/Xplan_2039/MapServer' layer='0'"  layer = iface.addRasterLayer( url_cur, 'a1', "arcgismapserver")  QgsProject.instance().addMapLayer(layer,False)  treeLay0 = QgsLayerTreeLayer (layer)  treeLay0.setItemVisibilityChecked (Qt.Unchecked )

How should one migrate code using QgsMapCanvasLayer to set layer visibility?  The  didn't say that QgsMapCanvasLayer is removed or replaced by another class. Yet, it is not listed in the  page either.   For qgis 2 code to set layer visibility :  ml = QgsMapCanvasLayer(lyr) ml.setVisible(False)   Does it require certain importS in QGIS3 or should it be replaced by something else?


Which entity does the "Jedi" in the title "Return of the Jedi" refer to? Does it refer to the general return of the Jedi Knights to the galaxy via Luke, or does it specifically refer to the redemption of Darth Vader and the return of the Jedi Anakin Skywalker, Chosen One of the prophesy?

I had always assumed the Jedi in the title of Return of the Jedi referred to Luke Skywalker's return from defeat. But Jedi is its own plural -- could it be referring to the rebuilding of the organization/movement/religion that presumably occurs after the Empire is defeated? Or maybe even to the return of Anakin's good side?  Yes, the title was originally Revenge of the Jedi, but that doesn't make it much clearer. It could still be either Luke's revenge, or the Jedi's revenge over the Sith, or even something else.  Did Lucas ever say exactly what it was he intended?


I'm trying to run a 64 bit guest Linux installation with a Windows 10 Professional (x64) host.  I have an Intel i7-7700HQ. In my BIOS I made sure VT is enabled. HyperV is also enabled.  When I run VMware Workstation it tells me this processor cannot have a 64 bit guest.   How can I tell if my processor can or cannot have a 64 bit guest? Is there any way to enable it, or am I forced to upgrade? If so, what processor would support this technology?

When I start VirtualBox, I only have 32 bit operating systems available. After some research I followed the steps on  but to no avail. My host OS is 64 bit, Intel Virtualization Technology and VT-d are both enabled in the BIOS, and Hyper-V platform is disabled in the Windows Feature list, yet I still only am presented 32 bit operating systems.  I find these    and they seem to solve the problem for everyone, but not for me.   I also tried  the installation without luck. How can I fix this to run a 64 bit Linux OS in VB?  EDIT I also have the latest version of BIOS.  Edit: This question is not a duplicate of  as I state that the solution to that question did not solve this problem.


I often add pictures to my questions. Most of the time they come out the right size. Well, that used to be OK always, up until I started posting screenshots taken by my mobile. For example, this one:  This way, I'm sure you'll agree it is huge, decidedly too big, it takes up the whole body of the question, I mean. At present, the only way I have to resize it is the following code: (Click image to enlarge)  [][1]  which I do not remember, and always have to recover from . Is there a simpler, less HTML-hacky (and, I'd expect, more Markdown-based) way of resizing it? PS The output of the above code is: (Click image to enlarge)

Is it possible to resize an image in an answer? For example,  has  that should have the image in the answer, but it's too big.  Is there a way to handle resizing?


I have a series given below and I have to check if it converges or diverges. $$\sum_{2}^\infty    \frac{1}{\ln(n)^{\ln(n)}}$$ I decided for a comprasion test. Firstly, I converted  denominator so that; $\ln(n)^{\ln(n)}=n^{\ln(\ln(n))} $ (quick trick using properties of "e" number.) Next step - comparison with using inequalities:$$ \frac{1}{n^2}\geqslant \frac{1}{n^{\ln(\ln(n))}} \Rightarrow  n^2 \leqslant n^{ln(ln(n))} $$ But it holds only for $n\geqslant e^{e^2}$. Because I know that $\sum_{1}^\infty    \frac{1}{n^2}$ converges I did the following : $$\sum_{2}^\infty    \frac{1}{n^{\ln(\ln(n))}} =\sum_ {2}^{\lfloor e^{e^2}\rfloor}    \frac{1}{n^{\ln(\ln(n))}}(=A)+\sum_{\lceil e^{e^2}\rceil}^\infty   \frac{1}{n^{\ln(\ln(n))}}(=B)$$ I called first part as A, and second part as B. I assumed that $-\infty \lt A\lt \infty \Rightarrow $ convergence. That is because we sum up to the finite number = $\lfloor e^{e^2}\rfloor$. Since our inequality holds for $n\geqslant e^{e^2}$ I did a comprasion test only for B. $$ \frac{1}{n^2}\geqslant \frac{1}{n^{\ln(\ln(n))}} \Rightarrow \sum_{\lceil e^{e^2}\rceil}^\infty    \frac{1}{n^2} \geqslant \sum_{\lceil e^{e^2}\rceil}^\infty    \frac{1}{n^{\ln(\ln(n))}}=B $$ $\sum_{\lceil e^{e^2}\rceil}^\infty    \frac{1}{n^2}$ converges and it is greater than series "B" implies that B converges as WELL. Is my thinking correct? Have I done any mistakes ?

How to test the convergence of following series $$\sum{\frac{1}{(\ln {n})^{\ln{n}}}}$$  I have tried Cauchy condensation test and gives me nothing


I am running ubuntu 16.04 server.  I'm basically making a script to do the following when the system boots:   Open a new screen in detached mode Run a command in this screen Open a new "window / virtual console" in the same screen (ctrl - a - n) Run another command in this "window"   When I connect to the screen after logging into this machine, i need to be able to ctrl-c a command running within the screen without the screen destroying itself.  Here is what I've tried so far:  screen -md -S name command   This works ok, except if the command finishes the screen destroys itself  screen -md -S name bash -c "command"   this just doesn't work and I don't know why  screen -md -S name bash --rcfile <(echo 'command')   Not quite sure (again) why this doesn't work.  screen -md -S name bash --rcfile scriptThatRunsCommand   This does exactly what I want for the first part, but I still do not know how to run another process in a new window of the screen  Basically all I need is to be able to run something else in a new "window" of this screen  I'd assume that there is a command built into screen that can do this, but I have not been able to find any documentation or online advice. I would also assume that whatever screen command would be used for this would have to also run bash --rcfile so I would be able to ctrl-c back to the prompt in the screen "window."  Whatever command does this can run from within the screen on the first "window" before my command runs or can run from outside the screen. Either is acceptable.

The .screenrc file allows the user to specify that they want multiple windows open when screen is first run.  Eg.  screen -t myWindowA 0 ""  screen -t myWindowB 1 "-${SHELL}"  screen -t myWindowC 2 "-${SHELL}"   What I would like is for each window to run some commands first, like:  screen -t myWindowA 0 "<go to directory a, source a.sh"  screen -t myWindowB 1 "-${SHELL} <go to directory b, source b.sh>"  screen -t myWindowC 2 "-${SHELL} <go to directoy c; start a watch on `ls -l`>"   Is there any way to do that?  Note this is similar to, but different from .


How can I prove this using induction. I proved for n=1 but now I'm feeling confused while I'm trying to prove for n+1 because of how the summation develops  $$ a^n-b^n=(a-b)\sum_{k=1}^{n}a^{n-k} b^{k-1} $$  NOTE: I really need to use induction to prove this, that's why the answer of the other question doesn't fit my question...

I'm trying to prove by induction that for all $a,b \in \mathbb{Z}$ and $n \in \mathbb{N}$, that $(a-b) \mid (a^n-b^n)$. The base case was trivial, so I started by assuming that $(a-b) \mid (a^n-b^n)$. But I found that: \begin{align*} (a-b)(a^{n-1}+a^{n-2}b + a^{n-3}b^2+...+b^{n-1}) &= a^n-b^n. \end{align*}  Doesn't this imply that $(a-b) \mid (a^n-b^n)$ as $a^{n-1}+a^{n-2}b+\dots+b^{n-1}$ is clearly an integer? This obviously isn't a proof by induction, but is there anything wrong with taking this approach to prove this result, other than the fact that it isn't what is being asked?   Aside, I'm having trouble getting started with the proof by induction. I've tried making the above equivalence useful during the induction step, but it doesn't seem to be helpful, so any hints would be greatly appreciated!


I am creating a stored procedure that inserts data into a summary table. When I run the stored procedure, it should populate the table with one row like so  Two of my tasks are to insert Average Sales Per Month and Average Sales Per Year. Based on this sales table(Sample)-It also contains data for 2017.  I can't seem to get the syntax correct. Everything I have tried thus far has been a failure. Can someone help me out with these two lines of code? Here is what I have so far: SELECT AVG(salesamt) INTO avgsalesmo FROM sales WHERE month(salesdate)  SELECT AVG(salesamt) INTO avgsalesyr FROM sales WHERE year(salesdate)

I am trying to INSERT INTO a table using the input from another table. Although this is entirely feasible for many database engines, I always seem to struggle to remember the correct syntax for the SQL engine of the day (, , , , and ).  Is there a silver-bullet syntax coming from an SQL standard (for example, ) that would allow me to insert the values without worrying about the underlying database?


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!

I have a question regarding testing for cointegration.  The situation is a follows: I have two time series that are both stationary at level when I consider "constant and trend". They are otherwise not stationary. The first differences are all stationary.  With regard to Cointegration testing: Do we test cointegration (Johansen) at level or at first differences? If we test with the level data, is it okay to model with a trend?


I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?


I'm trying to learn some logic to understand different kinds of foundations of mathematics. However, most of the logic texts I've seen will define things like formal languages, valuations and models using the word set repeatedly, before any mention of ZFC or other foundations is made. Then, ZFC (for example) is defined based on the previous discussion. I can't help feeling uncomfortable about this, as if there is some kind of circularity. Is it the case that set within ZFC and set within the general logician's vocabulary mean different things, and if so, could someone make this more  clear to me?  Btw, the texts I've been looking at are  W. Rautenberg - A Concise Introduction to Mathematical Logic, and W. Hatcher - The Logical Foundations of Mathematics.

I wonder about the foundations of set theory and my question can be stated in some related forms:   If we base Zermelo–Fraenkel set theory on first order logic, does that mean first order logic is not allowed to contain the notion of sets? The axioms of Zermelo–Fraenkel set theory seem to already expect the notion of a set to be defined. Is there are pre-definition of what we are dealing with? And where? In set theory, if a function is defined as a set using tuples, why or how does first order logic and the axioms of Zermelo–Fraenkel set theory contain parameter dependend properties $\psi(u_1,u_2,q,...)$, which basically are functions?


This was an idea in response to my answer on .  As we migrate questions from Meta.SO (or any other meta) to Meta.SE, those questions will be removed from the original site. So commonly asked questions will get asked again, migrated, closed as duplicate again, and asked again...  Searching before posting would not work, because the question would have been migrated to SE, and not searchable in Meta.SO. Hence the suggestion: all other meta sites (like Meta.SO) should include searches and "Questions that may already have your answer" from Meta.SE. (or any other meta sites)   This could indicate clearly that a question is from Meta.SE, or not and just have the results merged in. (There are pros and cons for each, from ease of development to interfacing issues.) Hopefully this would cut down on duplicate questions that are already in Meta.SE from appearing elsewhere.

I do not know if this is feasible, as I do not know the current design of meta sites.  This also might have been implemented already, for all I know.  I think that , questions with certain tags should be displayed indiscriminately across all meta sites, and belong to none in particular.  These questions would be the questions which apply to the entire SE site network, but not a particular site in general.  Questions such as general etiquette, feature requests, anything tagged with 'stackexchange' or 'stack-exchange', etc. should be spread across all meta sites.  One way to do this is to keep the question on the meta site it was originally posted in but include it in searches across any meta site.  The main reason to do this would be to try and reduce how often redundant questions are asked.  To that effect, .  However, I think that it wouldn't be very hard at that point to include it in searches as well.  The only alternative method I can think of would be to create a new site-wide meta questions site, which would be infinitely more cumbersome to the developers and the moderators who must migrate the questions.  Overall, I don't like posting duplicate questions, even if they are duplicates of meta questions from other sites.  I think it would be nice if all these questions with certain qualified tags were either made site-wide and inspecific to any site or at least indexed in all searches and included in the "similar questions" category (when asking a question).  Wouldn't it be ironic if somebody found a duplicate of this question from another meta site? :)


Prove that $4k < 2^k$ by induction.   It holds for $k = 5$. Assume $ k = n + 1 $. Then  $4(n+1) < 2^{(n+1)}$  $4n + 4 < 2^n * 2$  $2n + 2 \leq 2^n$  Now I just need to show that  $2n + 2 \leq 4n$  $n + 1 \leq 2n$  $1 \leq n$  And because I chose $n = 5$ which is greater than $1$, this should prove that the formula holds for $n \geq 5$.  Is this correct?

I did the following base case $n = 5$ $$\begin{align*}     4(5) &\lt 2 ^5\\     20 &\lt 32 \end{align*}$$ So true.  $$\begin{align*}     4n &\lt 2^n\\ n &\lt 2^{n-2}\\ \log_2(n)+2 &\lt n \end{align*}$$ But I don't think this is right. Where do I add in the $(n+1)$.


I did not run this command in terminal,but what will happen if i did?i'm just curious.And if something bad happens,how can we solve this?

This seems to be a chicken-egg problem. The most common task using sudo is installing and removing software.  sudo apt-get purge <appname>   But sudo itself can be removed.  sudo apt-get purge sudo # Do not run this command on production computers!   This is where the fun comes  ubuntu@ubuntu:~$ sudo bash: /usr/bin/sudo: No such file or directory   Although it's obvious that no person in his right mind will purge sudo (other than me), someone can be fooled to run this command (not directly, in its hex mode, or whatever it's called) or a person could SSH in disguised as tech guru and do the mess.  So is there a way of reinstalling sudo?


Is it possible to name a GRID with letters and also not from top down but from left to right?

I've been looking at creating an indexed grid and have used vector--grid, mmqgis--create grid and FSC Tools.  They all work fine but don't label the grid squares. With the one created by vector grid, there is left/bottom/right and top so if we sort by top then the highest value is the top left grid square -which I want called A1.  The next in the list is A2 and then when the top value changes it's row B etc.  Is there some switch or other tool that can add these labels?  I noticed there's a QGIS 2x plugin () but I haven't found one for v3.   I have tried the process in  but it doesn't work as expected.    I wonder if this has something to do with the row ID's being assigned based on the order the table was written in...it should be Top (highest to lowest) and Right (lowest to highest) to get the grid in the right order to test this. I have tried the sort and number plugin and changed 15 in the solution to 36 to represent the number of squares left to right but it still doesn't work.


What are open source tools for building a web gis application having PAN, Zoom, Query/search, Label etc options?  I have decided to use PostgreSQL for database and GeoServer as middleware but I am a bit confused in selecting the software to design the GUI for the client side.   I am a novice programmer, so will geoexplorer be a good option or are there some other tools which can be more easily customized for my work?

I want to start working on a web map at work to map some of our statistics by city.    I have an idea, but I'm not exactly sure where to start.   Are there any definitive resources that provide step by step guidance on how to do this?


I need to make a little spiral for a model I'm making you know those little things on the handle of a furnace

I need to model a simple spiral shape. I imagine the best way to do this is with curves, but I am unsure how to create a perfect spiral shape with curves. What's the best/easiest way to make a spiral tube?


I read this short story around 10 ago and haven't been able to find it ever since.   The hero of the story is a prolific scientist in some mathematical field, and he dies at around page 1. His soul is however conserved by "god", who then proceeds to reveal the big plan. Basically the "god" collects the souls of great minds, and everyone else just fades into oblivion. These souls then have to work for eternity and help "god" find out where he came from. In the end of the story the hero refuses to cooperate and swears to spend his eternity finding a way to destroy "god".  Please help me find it.

I am looking for a short story I read a long time ago.  In it, a man dies and finds himself in a dark and featureless afterlife with a disembodied voice that calls itself god.  That god reveals that there is indeed life after death, but only for a selected few, and it consists of nothing more than this void with no contact to others.   Faced with the prospect of eternity alone in that void, the man states his intent to find a way to end his own existence for good. The god answers that it will do anything in its power to prevent that.   After some more back-and-forth the man resolves to find a way to destroy god. God reveals that this is indeed the only reason for the existence of the universe and that afterlife: Because god wishes to find a way to cease to exist.  The story ends, I believe, with something akin to     "The man started to think about the problem. He knew he would succeed eventually; after all he had infinite time"


I'm wondering if there is a convenient way to update a struct with the values of  another struct in Matlab. Here is the code, with the use of fieldnames, numel and a for loop,  fn = fieldnames(new_values); for fi=1:numel(fn)     old_struct.(fn{fi}) = new_values.(fn{fi}); end   Of course, I don't want to loose the fields in old_struct that are not in new_values, so I can't use the simple old_struct=new_values.  Updating a struct is something we may want to do in a single short line in an interpreter.

I want to combine two structures with differing fields names.  For example, starting with:  A.field1 = 1; A.field2 = 'a';  B.field3 = 2; B.field4 = 'b';   I would like to have:  C.field1 = 1; C.field2 = 'a'; C.field3 = 2; C.field4 = 'b';   Is there a more efficient way than using "fieldnames" and a for loop?  EDIT: Let's assume that in the case of field name conflicts we give preference to A.


I'm working on translating some code from VisualBasic to Java and I've encountered a snag when using the ByRef keyword in VB. That doesn't exist in Java!  How should I simulate a ByRef call in Java?  Edit: Just to clarify for those who don't know VB, ByRef identifies a variable in the parenthesis after calling a function and makes it so that when that variable is changes inside of the function, it will also change higher up where it is called as opposed to ByVal where only the value of the variable is remembered. Changing a ByVal variable in the method will not affect the variable where it is called.

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


Does anybody know how i can use miracast on ubuntu mate 20.04 to stream from my laptop to my smart tv.

I couldn't find anything about Ubuntu acting as a  receiver or sender.   Can it work at all? Are there hardware prerequisites? Is WiFi a requirement or can it work over LAN or another kind of network connection? WiFi direct seems to be a necessary requirement, is it a sufficient one? (i.e. if a system supports WiFi direct does that mean it supports Miracast?) Are there differences in support between receiving/sending? How is the latency? (compared to the competition, i.e. VNC, commercial Miracast devices, etc.) How do I actually use it, if it's difficult?   Specifically, I plan to use it together with an Android phone (4.x Jelly Bean).


We will arrive on United from Heathrow and have 1 hour 45 minute connecting time to get to our flight to Portland, OR. Will that work?

Given the extensive time taken for immigration formalities in the US, what is the shortest time to consider between connecting flights in the US, when coming from abroad?  Until now I have always entered the US at my destination. This is not always the cheapest option. I was told that 3 hours is the advised time to go through immigration and boarding of a connecting flight. Online booking sites still offer connecting flights, with a transfer times sometimes even less then 1 hour.


I've heard that the big bang began in all places at once, but my physics teacher told my class that the universe was all once compressed into a single dense piece of matter. If my physics teacher is right, then did that dense piece of matter have the same mass as the entire universe now? And if it was so small and yet to dense, wouldn't it technically have been a black hole?

Extrapolation of the expansion of the Universe backwards in time using general relativity yields an infinite density and temperature at a finite time in the past.  If the matter contained within our galaxy were concentrated within a small radius wouldn't that lead to the entire universe being a black hole? If so how is it that all the matter of our observable universe could have originated from a region of infinite density?


Is it fine to strike off Expired US Visas in an old Indian Passport? I have some US Visas which the consulate itself has marked CWOP[Cancelled Without Prejudice], while some of them as old as 2015 expiry are not marked off. This creates confusion sometimes at the airlines when they take time to find the valid(unexpired Visa). This is in a Expired Indian Passport with one Valid Visa. I have a new Passport which is never used as the old one just expired.

There are many times when I'd like to jot a short note in my passport. For example, the business purpose of an entry into a country -- or for countries with automatic passport control and when I don't get a stamp, I'd like to notate my entry and departure.   Can one write in one's own passport? I wouldn't of course write over any stamps, but I might write near them. Or could I use a back page as entry and departure dates?  Yes, I could use a separate piece of paper or a computer file, but having them all in my passport would be handy -- especially when a border officer asks where I've been and why.   And if the laws vary by country, can you note this in your answer? Would it matter if my notations were in ink or pencil? These aren't doodles but business-like annotations and lists.


Guess the question itself sums it up, Is it feasible? If so, how?

I will be getting a point-and-shoot camera for taking portraits and only portraits.  Specifically portraits with a shallow depth of field.   Groups portraits sometimes.  It's just too much work to add lens blur at post-prod.  I understand that setting a P&S on macro mode gives a shallow focus and DOF.    How do I read P&S camera specs to shortlist those with the shallowest depth of field?   Added: By point-and-shoot, I mean a camera that is easy to use -- Not necessarily compact, inexpensive, or current.  Also, if there are two or three factors/specs to get a shallow depth of field, then which spec contributes the most to bokeh? which is second most contributing? the third, etc.?


Short  Would google index my web-page if it's not on my website but it's in the sitemap?  Long  We have a few product price pages i.e. for product bwm-x3, following are 3 URLs:  -> bmw-x3-price-in-city1 -> bmw-x3-price-in-city2 -> bmw-x3-price-in-city3   We have a link on our website to these pages if the price of bmw-x3 is available in the respective city.  Now, we are planning to also create pages for cities where we don't have prices but we have prices in nearby cities but we don't want to link these pages from website. Although, we want users to land on this page from google.

We use a  on Stack Overflow, but I have mixed feelings about it.  Web crawlers usually discover pages from links within the site and from other sites. Sitemaps supplement this data to allow crawlers that support Sitemaps to pick up all URLs in the Sitemap and learn about those URLs using the associated metadata. Using the Sitemap  does not guarantee that web pages are included in search engines, but provides hints for web crawlers to do a better job of crawling your site.  Based on our two years' experience with sitemaps, there's something fundamentally paradoxical about the sitemap:  Sitemaps are intended for sites that are hard to crawl properly. If Google can't successfully crawl your site to find a link, but is able to find it in the sitemap it gives the sitemap link no weight and will not index it!  That's the sitemap paradox -- if your site isn't being properly crawled (for whatever reason), using a sitemap will not help you! Google goes out of their way to make :  "We cannot make any predictions or guarantees about when or if your URLs will be crawled or added to our index"  "We don't guarantee that we'll crawl or index all of your URLs. For example, we won't crawl or index image URLs contained in your Sitemap."  "submitting a Sitemap doesn't guarantee that all pages of your site will be crawled or included in our search results"   Given that links found in sitemaps are merely recommendations, whereas links found on your own website proper are considered canonical ... it seems the only logical thing to do is avoid having a sitemap and make damn sure that Google and any other search engine can properly spider your site using the plain old standard web pages everyone else sees. By the time you have done that, and are getting spidered nice and thoroughly so Google can see that your own site links to these pages, and would be willing to crawl the links -- uh, why do we need a sitemap, again? The sitemap can be actively harmful, because it distracts you from ensuring that search engine spiders are able to successfully crawl your whole site. "Oh, it doesn't matter if the crawler can see it, we'll just slap those links in the sitemap!" Reality is quite the opposite in our experience. That seems more than a little ironic considering sitemaps were intended for sites that have a very deep collection of links or complex UI that may be hard to spider. In our experience, the sitemap does not help, because if Google can't find the link on your site proper, it won't index it from the sitemap anyway. We've seen this proven time and time again with Stack Overflow questions. Am I wrong? Do sitemaps make sense, and we're somehow just using them incorrectly?


I read a story a long time ago, I think in a short story collection.  The main idea was that a TV had been invented that could be set to any place and time in the past, and you could see what happened there and then.  Anybody know what it was?

While reading a question here whose answer was Stephen Baxter's "Light of Other Days" book, it reminded me of a short story I read with a similar idea. Probably read at least 30-40 years ago, in English. The fact that the Government has invented a device that can view the past is made public (by a whistleblower, I believe). Historians go nuts besieging the government to look at their favorite time periods to reveal the truth about various historical "facts" and or "mysteries" (Who shot JFK? Who was Jack the Ripper? Was Helen of Troy really that beautiful? Did Jesus exist? etc, etc.) And the government is stonewalls most of them and claims it's expensive to operate, hard to control to get exact time/location, etc. So someone (maybe the whistleblower?), knowing it's possible, does math/construction and builds his own version, and realizes it's easy to make, cheap to operate, and easy to use. So he makes plans to stick it to the government by releasing the info. Maybe he tries to force the government to release the info, or they realize he has made it, so they grab him and try to convince him to stop. But he is not convinced until they tell him, it can't see back very far (maybe just a few days/weeks, because it needs exponentially more power the further you look back.) Finally the agents tell him: "Don't you see, you can use it to see what's happening just a few minutes ago, or even now. Your company can't make widgets? Zoom in on your competitors and see how they make them. Think your wife is fooling around on you? Zoom in on her and track her to see if she is. Your pretty neighbor is taking a bath now? Zoom in and watch her... These devices mean no one will have any privacy now." At which point he tells them it's already too late. They kept him there so long that the letters he mailed will already be delivered to various newspapers, scientists, historians, etc.


Its pathetic how it was created in 2005 not so long ago when the Java 3D 1.31 API was released. Now after downloading the source code off the books website and implementing it onto my work-space it cant run. (The 3D Shooter Ch. 23) I downloaded Java 3D 1.5 API, installed it- went back to my source code and javax.media ect.., and EVERY imported class within the game simply couldn't be resolved... they are all outdated..   Please do not say how its meant for a positive curvature in your game development skills. No ~ I got the book to understand how to code 3D textures/particle systems/games. Without seeing results how can I learn?  If there is still hope for this book please tell me. Otherwise what other books match this one in Game Programming? This one was very well organized, documented and long. I am not looking for a 3D game prog. book on Java. Rather one that has the same reputation as this one but is a bit newer..

I'm thinking of picking up the book called "Killer Game Programming" by Andrew Davidson, but its pretty old, now. I know Java, and I've been messing with jMonkeyEngine for a few days, but I'm curious to see if I would benefit from the 3D chapters of this book.   The book was published was in 2005. Has Java changed to the point where this book would now be obsolete, assuming it was up to date at time of publication?


Essentially I want to plot a function with singularities like   $\frac{1}{(x-0.5)^2+(y-0.5)^2}\cdot \frac{1}{(x+0.5)^2+(y+0.5)^2}$    at a higher sampling rate.  I tried to avoid the singularities by capping with some value ($20$):  \begin{tikzpicture} \begin{axis}[view={55}{45}] \addplot3[surf, colormap/jet, samples=50, domain=-1:1] {min(1/((x-0.5)^2+(y-0.5)^2)* 1/((x+0.5)^2+(y+0.5)^2),20)}; \end{axis} \end{tikzpicture}   Which yields    But that really does not stop TikZ/pfgplots from having to evaluate the function near its singularities, so it gets quite slow at compiling. So here is my question:  Is there a better/faster way to plot functions that contain singularities? Or do i have to precompute the data and give it to TikZ/pfgplots manually?

I want to plot the function 1/(x²+y²), but since it tends to infinity in (0,0), I get a horrible plot:  \documentclass{article} \usepackage{tikz} \usepackage{pgfplots} \begin{document} \begin{tikzpicture}   \begin{axis}[grid=both]     \addplot3 [surf] {1 / (x^2 + y^2)};   \end{axis} \end{tikzpicture} \end{document}     By restricting the domain of z, I get anyway a not so nice plot:  \documentclass{article} \usepackage{tikz} \usepackage{pgfplots} \begin{document} \begin{tikzpicture}   \begin{axis}[grid=both,restrict z to domain=0:1]     \addplot3 [surf] {1 / (x^2 + y^2)};   \end{axis} \end{tikzpicture} \end{document}     I would like to get something smooth, which finish in a circle (the circle of the intersection of this function with the plane z=1 for example).  Something like this would be great:


Please excuse me if some of my terminology is off. I don't know much about bikes.  When I came home from college I noticed that the seat of my bike was way to high and the headset was really low, I have a old style quil stem head set,. So I decided to raise the headset. When I raised the headset I did not know that I was not supposed to completely remove the headset stem bolt. I tried screwing it back in but it doesn't work. So now the headset does not control the front wheel, and I have no idea how to fix it. Can someone PLEASE help me!!! I also have a question, why is it that when I hit the bicycle stem bolt with a hammer it fixes it but only for a short time period?

Trying to remove a seized quill stem and did a beginner's mistake of removing the stem bolt. I could not thread back the bolt.    Is there a better way to thread back the bolt to the wedge for me to start all over again the process of removing the quill stem?  Thanks


OS X 10.11.2 El Capitan  I want to create some alias, so I go to ~/ folder and there is no .bash_profile or .bashrc.    I have been looking for some info and I learn that .bash_profile is only read when bash launch an interactive login shell (default type of terminal in OS X) and .bashrc is only read when bash launch an interactive non-login shell. But I don't find how to create .bash_profile and .bashrc for my user. How can I do it?  After @klanomath answer:

So, I don't have .bash_profile neither .profile in my home folder. How do I create them? After that, what should I do so every time I open the terminal these files get read?


Find the limit or prove that it does not exist by $\varepsilon-\delta$ approach: $$ \lim_{x\rightarrow \infty}e^{-x } + 2\cos(3x)$$    Note:I found this question when I was doing exercise from the book . The book just need me to show it does not exist, but I think it would be interesting to strictly prove it by $\varepsilon-\delta$  language.       Update: This question is not duplicate to the other question at all, since I am asking a strictly proof by $\varepsilon-\delta$ approach here rather than just show it does not exist. I also emphasized the requirement in my Note when I post this question. Although those two questions hold the same functions, but they have different requirements.Hence, It actually totally different from another one.

I have calculus homework question that to be quite frank I don't even know how to begin to solve. Here is my attempt on how to to solve the question; however I'm not sure if I'm tackling this correctly. I'm hoping that someone here can tell me if I'm doing this correctly and if my answer would be correct.  Here is the question.     Find the limit or show that it does not exist:   $$\lim_{x\to \infty}(e^{-x}+2\cos3x)$$   My attempt to the solution is DNE or does not exist simply because cosine oscillates between -1 and 1 and it never approaches any one number to reach a horizontal asymptote. Is this answer correct? Or how should I approach this problem if it's not? Or should it be  $$-\infty$$ since that would be the the value of $$e^{-x}\quad ?$$Please forgive my stupidity if I'm incorrect in all fronts.


Every day, people post questions on Stack Overflow that need migration to SF, SU, or meta (which, by the way, sucks since a lot of those people don't have access to SU yet). People seem to have a tendency to downvote these questions, even if it isn't necessarily a "bad" question (which is when downvotes are sanctioned, correct?).  Why is this?

I suggest that when a post is migrated from one site to another, that the question vote score get reset to zero (or perhaps only a negative vote score is reset to zero). Often people will downvote a question when the only thing that's "wrong" with it is that it's posted on the incorrect site. After migration, those downvotes hang around as a negative score and may unfairly bias the treatment of the question.


The menu bar seems to redraw itself each time I switch from monitor to other.  of this happening.  seems to have the same problem.  I tried using guest account without any 3rd part applications but the same problem persists.  Any help troubleshooting is welcome.

When switching between two screens, all the icons in the menu bar appear to be re-drawn, causing an annoying jittery effect. This started happening after upgrading to Yosemite.  Is there any documentation available on this problem? Are others experiencing the same issue? Is there a fix available?  I currently have in my menu bar:   Twitter Dropbox Grabbox F.lux Caffeine Time Machine Menu Meters WiFi Sound Battery (incl. percentage) Time (digital) Account switcher Spotlight Notification Center   Though I doubt any one of them is the cause.


I am running a Samsung Chronos 7 with an NVIDIA Geforce GT 640m graphics card. I would like to utilize this graphics card so that I may use my computer for various computer games. Previously, when I tried to install drivers via the sudo command for downloading the current drivers for my card, Ubuntu would not boot past the splash screen, and eventually "gave up on finding the root". I am starting from a fresh install of Ubuntu 14.04, and I request some help on what to do.

I've just installed Ubuntu and I need either video, wireless, or some sort of other manufacturer (non-opensource) driver. How can I run the tool that will fetch all of these for me? I'd like graphical instructions.  Related:


I've been designing web graphics for a long time, but I've been requested to print out some new work. The client presented me a printed magazine page and asked me to make her logo the exact same color as the one on the page. Is there a way I can get the values (not the color) on my computer so I can then print it out and get it to look like the magazine color? I'm talking about some tool, formula, magic trick!!   I know I should be better at working my colors, but I'm not quite! Any help/advice will be appreciated.   Thanks!

I need to make a restaurant menu design that matches restaurant wallpapers. For some reason my client cannot get color codes used in wallpaper, but he provided me with a sample. (see below)    How can I get the correct color codes from the wallpaper? (someone mentioned that there are scanners for this purpose, but I could not find any information regarding that)  Let me know if this question should be in another site.