To show that the only nonempty subset of $\Bbb R$ which is both open and closed in $\Bbb R$ is $\Bbb R$.  Let $A$ be a non empty subset of $\Bbb R$ which is both open and closed. Let $x \in A$. Then $(x- \epsilon ,x+ \epsilon) \subset A$ for some $\epsilon >0$. Then how to bring the contradiction by putting in the fact that $A$ cannot be simultaneously open and closed!!

So I know that $\mathbb{R}$ is both open and closed. But given a set, $X\subset \mathbb{R}$, $X\ne \emptyset $ that is both open and closed, how does one show that $X=\mathbb{R}$?    Here is my attempt: Using the definitions I was given, $X$ open implies that for every $x\in X$ there is a $\delta \gt 0$, $(x-\delta,~ x+\delta)\subset X$.    Also, since $X$ is closed , $B=\mathbb{R}$\  $X$ is open.    However, I don't know how to proceed. NB: This is not a homework problem.


, shares the following:    // Hello! I'm a self-increasing number! console.log( 9999999999999999 ); // shows 10000000000000000     I don't get why 9,999,999,999,999,999 is turned into 10,000,000,000,000,000. If we have 53 bits to store a number (out of the 64), given that representing the number above requires more bits than available (precisely 54 ?), why not return all the 53 bits we have oned, meaning we are representing the maximum number we possibly can (9,007,199,254,740,991) ?   The post here mentions 52 bits to store a number out of the 64, but I changed it to 53 after checking Number.MAX_SAFE_INTEGER and putting it into Window's calculator in programming mode - it gives 53 bits oned.

Is this defined by the language? Is there a defined maximum? Is it different in different browsers?


Why is StringBuffer needed in java? i am totally new to java, and was studying about operations on Strings and String methods when i saw another set of methods, which were similar somewhat similar, in section of StringBuffer. I studied about i, but was not able to grasp a clear idea about it.

Someone told me it's more efficient to use StringBuffer to concatenate strings in Java than to use the + operator for Strings. What happens under the hood when you do that? What does StringBuffer do differently?


How can I prove a well-known fact: $\mathbb {Z}_n (=:\mathbb {Z}/n\mathbb {Z})$ is an injective $\mathbb {Z}_n $-module?   I classified all ideals of $\mathbb {Z}_n $ and tried to use Baer's criterion from the fact that any $\mathbb {Z}_n $-module is a quotient of free one. Is it valid?

Let $R$ be a PID, $a\in R$ be a nonzero nonunit in $R$. Prove that $R/Ra$ is an injective module over itself.   If $R$ is a PID, every $R$- divisible module is injective, but the question concerns with $R/Ra$-module, so I have no idea to solve this problem. Help me.


I am having the same issue on QGIS 3.10 or the long term release, 3.4  If I go to Settings > Custom Projection and add a name and parameters, the "OK" button does nothing.  I have tried clicking the plus button before and after adding the name and parameters, it makes no difference.  I have read similar questions:        but none of their answers work for me.   I have tried uninstalling and reinstalling different versions of QGIS, and have tried granting write permissions to folders within the QGIS directory.

I am trying to define a custom CRS in QGIS 3.4 to work on some data in Central Asia. I want to use the Albers Equal Area Conic but change the parameters so that the transformation works best for my study area.   I first tried to go via "Settings" --> "Custom CRS". I defined the name and the +projstring as +proj=aea +lat_1=21 +lat_2=49 +lat_0=37 +lon_0=87 +x_0=0 +y_0=0 +datum=WGS84 +units=m +no_defs. But when I click "Ok", nothing happens.  I don't get an error message or any feedback, there's just no response. (I tried QGIS 3.10 as well, but the same problem occurred.) This looks like a bug to me or is there something I missed?  If this cannot be reproduced, I could also go the Python way, but I'm not so familiar with that. I've read through some documentation and found the following pieces of code but I'm not sure if they are in the right order or if something is missing:  my_crs = QgsCoordinateReferenceSystem() my_crs.createFromProj4("+proj=aea +lat_1=21 +lat_2=49 +lat_0=37 +lon_0=87 +x_0=0 +y_0=0 +datum=WGS84 +units=m +no_defs") my_crs.saveAsUserCrs("Albers_Central_Asia")


I want my laptop to stay running when it is on A/C-power even when it is idle and the lid is closed.  I managed to make it not suspend immediately when the lid is closed with:  /etc/systemd/logind.conf: [Login] HandleLidSwitch=ignore HandleLidSwitchExternalPower=ignore HandleLidSwitchDocked=ignore IdleAction=ignore IdleActionSec=1min   But around 1200 seconds after rebooting (no login on gdm) it suspends to RAM.  What am I missing?  $ uname -a Linux nlv 5.4.0-29-generic #33-Ubuntu SMP Wed Apr 29 14:32:27 UTC 2020 x86_64 x86_64 x86_64 GNU/Linux $ cat /etc/issue Ubuntu 20.04 LTS \n \l  $ cat /etc/systemd/sleep.conf (# comments removed for brevity) [Sleep]

I have a machine that I access only via SSH that I just updated to Debian 10 a couple of days ago. Since the update it seems to be going to sleep when it is inactive. This has never happened with previous updates like from 7 to 8 or from 8 to 9. It seems like maybe the sleep settings have reverted to a default state. How can I view and edit the power and sleep settings in the command line? Any guidance much appreciated. Thanks!


Rocky has 31 days to prepare for his Discrete Math final. He has decided to do at least one tough problem each day, but no more than 50 problems total. Show there must be a sequence of consecutive days in which he does exactly 11 problems.

From  by Richard Brualdi  We have a chess master. He has 11 weeks to prepare for a competition so he decides that he will practice everyday by playing at least 1 game a day. To make sure that he's able to take a couple of breaks, he also decides that he wont play more than 12 games per week.  My question is, how do you prove/dis-prove that there will be a succession of (consecutive) days in which he will play k games, $k \geq  22$?  Specifically, I don't quite understand the use of the pigeonhole principle here.  Thanks in advance! :D  EDIT  I'll try to clarify what I'm asking:  The goal is to prove that for every possible practice schedule that the chess master makes, there will always be a consecutive sequence of days such that he plays exactly k games.  So for example, if k = 22, how do you prove that no matter what his schedule is like, he will always play exactly k games in r days, $1 \leq r\leq  77$.  My main question is: what is the general method for proving different values of k? Are there values of k (from 1 to 132 inclusive) that are impossible to obtain?  Note that he does not necessarily have to play 132 games within 77 days! Also, keep in mind the bounds of k.


New to Linux but very happy with it so far and been able to learn a lot.  Currently opening a folder that contains Example.jar, then opening terminal, next entering  java -jar Example.jar to launch the jar file.  Ideally would like to double click a icon on the desktop to do the aforementioned.   Is this possible?  Running Linux Mint but believe the steps would be the same.

I started by searching guides. I found  but neither of the main methods works anymore in 11.10.   The first solution, I have created the desktop file, however the file location given as .gconf-> desktop-> unity-> launcher -> favourites no longer exists. I can get to /home/sayth/.gconf/desktop but there is no longer a unity folder. The second solution described right-clicking the desktop and creating a launcher. Right-clicking the desktop no longer produces a "create a launcher" option.   I manually installed geany 0.21 as the one in the repo's is outdated. It's installed and working correctly, and is executing from /usr/local/bin/geany.  How can I add it to the launcher?


If someone calls me brother-in-law , what are they to me? A girl called me brother-in-law , what is she to me? A girl who calls me brother-in-law , what should I call her?

Here at the Genealogy and Family History Stack Exchange we see many questions about relationship mapping which is also known as:   relationship calculation kinship terminology etc   If you are just trying to understand how to calculate "cousins and removes" then  provides an excellent guide.  However, if you are seeking an English term for a more complicated relationship between two members of an extended family, rather than asking a question like:          site users are encouraged to first review the answers below.    Note: This Q&A arises from  and is set to  to help make it canonical.


I realized ObjectMapper's writeValueAsString method takes an Object type as a parameter. But it is able to produce correct JSON from underlying class object(which is a subclass of Object class). Normally, Java compiler wouldn't be able to access fields of a subclass from a superclass. How does ObjectMapper do it?

What is reflection, and why is it useful?  I'm particularly interested in Java, but I assume the principles are the same in any language.


In windows, I just have to type title mytitle to change the title of the terminal. c:\title mytitle  How to do it in ubuntu?

I have several instances of terminals running in my working environment, what I would like is to set a specific title for each one, in order to have a clear idea what purpose the specific terminal serves i.e. Apache, editing_ini, postgres etc...  Of course from the command line.


Let $N$ normal in $G$ such that every subgroup of $N$ is normal in $G$ and $C_G(N) \subseteq N$. Prove that $G/N$ is abelian.  I tried to show that the commutator subgroup of $G$ is present in $N$ but was unsuccessful.

Question is that :  let $N\unlhd G$ such that every subgroup of $N$ is Normal in $G$ and  $C_G(N)\subset N$.   Prove that $G/N$ is abelian.  what could be the possible first thought (though for me it took some time :)) is to use that $C_G(N)$ is Normal subgroup (As in general centralizer is a subgroup). one reason to see this is that $C_G(N)$ is not Normal in General and $C_G(N)$ is not subset of $N$ in general.  As $C_G(N)\subset N$, we have $G/N\leq G/C_G(N)$   I some how want to say that $G/C_G(N)$ is abelian and by that conclude that $G/N$ is abelian.  I would like someone to see If my way of approach is correct/simple??   I have not yet proved that $G/C_G(N)$ is abelian. I would be thankful if someone can give an idea.  Thank You.


I have port 80 open from AWS lightsail console, and ufw status shows that port 80 should be open.   And yet, I cannot curl into port 80 nor can I telnet or ping or launch a server.   I've checked iptables and I can confirm that the rules from ufw apply there. However, when I run lsof -i -P -n it does not show any open port 80. Is there another firewall that is blocking 80?   Any help to troubleshoot this would be greatly appreciated!  Below is the result of ufw status  5432/tcp                   ALLOW IN    Anywhere                   22/tcp                     ALLOW IN    Anywhere                   80                         ALLOW IN    Anywhere                   80/tcp                     ALLOW IN    Anywhere                   443/tcp                    ALLOW IN    Anywhere                   5432/tcp (v6)              ALLOW IN    Anywhere (v6)              22/tcp (v6)                ALLOW IN    Anywhere (v6)              80 (v6)                    ALLOW IN    Anywhere (v6)              80/tcp (v6)                ALLOW IN    Anywhere (v6)              443/tcp (v6)               ALLOW IN    Anywhere (v6)   And when I run sudo lsof -i -P -n | grep :80 I get nothing returned.

I am setting up a ftp server on my Ubuntu 16.  After using the following command:  sudo ufw allow 21/tcp sudo ufw status verbose   I can see the output that says:     21/tcp    ALLOW    IN    Anywhere   But, if I type:  netstat -tnlp   It does not show the port 21 at all  Do I am doing something wrong?


Does all definitions need a reference? Is there any rules to when you need one(or more) and when you don't?

In my research paper, I have set aside space to define terms (each having a bullet point). My confusion is how I go about defining these terms. Do I quote a dictionary, another research paper in the field, or do I paraphrase either one? , but the author doesn't cite any source. Does this mean the words fall under 'common knowledge'?


I bought minecraft a few months ago on my phone (andriod) i just got a new phone (iOS) will i need to buy minecraft again or can i log into my play store and just re download without paying?

I bought Minecraft PE on kindle and want to play on ipad? Can this be done or do i have to re-buy? Many thanks!


I'm using Blender 2.8 but this question probably applies to older versions as well.  Scenario:   I have an Empty located at the origin. I have a Bezier Curve. The Empty has a Follow Path constraint targeting the Bezier Curve. This successfully causes the Empty to move along the path.     What I need is a way to access the modified location of the Empty after the constraint is applied. I only seem to be able to get to the original unconstrained location (0, 0, 0). E.g.  >>> D.objects['Empty'].location Vector((0.0, 0.0, 0.0))   Help is appreciated.

I have an object following a NurbsPath (path is the parent of the tracker object)  and I am trying to print its position in each frame. but the "location" attribute always print the same value, doesn't matter in which position over the path the object is.  I guess I am querying the wrong property.. this is the code I am using:   import bpy  sce = bpy.data.scenes[0]  obj = bpy.data.objects["tracker0"] print(obj.location[0])  for i in range(0, 20):     sce.frame_current = i     print(obj.location)


Wikipedia  that a definable (real) number is a number "that can be uniquely specified by its description". I naïvely thought that this was the same as "a number which may be computed", but  I found out that it is not the case, because for example numbers related to Chaitin's $\Omega$ are definable but not computable. Could someone explain me what a specification is, then? I always thought that $\Omega$ was a probability value, which was not a real specification.

Reading  Wikipedia page I found this definition:     A real number $a$ is first-order definable in the language of set   theory, without parameters, if there is a formula $\phi$ in the   language of set theory, with one free variable, such that $a$ is the   unique real number such that $\phi(a)$ holds in the standard model of   set theory.   A few lines later we find the statement:     Assuming they form a set, the definable numbers form a field....   But, since they are a subset of the set of real numbers, why shouldn't they be a set?   Coming back from this question to the definition, I've another doubt: if ZFC is consistent this does not means that every set-theoretic object (and so any real number) is definable in some model?  Reading the whole article does not lessen my confusion .... and the ''talk'' is too difficult for me and it does not help.  More generally, this Wikipedia article is "disputed" ad has many "!" So I doubt that it is not reliable.  A brief surf on the web give me many pages on this subject but I've  found nothing that I can understand and give a response to the question: we can well define what is a definable real number?


What are the pros and cons of logistic regression and SVM (support vector machines)?

Can someone please give me some intuition as to when to choose either SVM or LR? I want to understand the intuition behind what is the difference between the optimization criteria of learning the hyperplane of the two, where the respective aims are as follows:     SVM: Try to maximize the margin between the closest support vectors LR: Maximize the posterior class probability    Let's consider the linear feature space for both SVM and LR.  Some differences I know of already:   SVM is deterministic (but we can use Platts model for probability score) while LR is probabilistic. For the kernel space, SVM is faster (stores just support vectors)


i'm a beginner in Blender. I'm making a school assignment where i need to use the bevel. When i try to bevel a corner, instead of only rounding the corner, it goes further than only the corner i've selected. I'm using the normal shortcuts: ctrl + B and scrolling to get more segments. I've tried multiple times and i can't find a solution anywhere...  Has anyone had this problem?  Thanks :)

I'll preface this by saying I'm very new to Blender - I'm trying to put a bevel on an edge, looks something like this:    As you can see, the vertical side is much longer than the horizontal side.  When I apply to bevel to the edge there, the bevel stretches proportionally - so there's 'more' bevel on the longer side.  I want to bevel without any 'ratio' like that - just a 45-degree bevel, if that makes any sense.  Do I have to put in a loop cut to make the side lengths equal?  I tried using a sub-surf modifier, but it applies on a bunch of nearby edges, when I just want to round this one corner.


I get a lot of emails from recruiters sending irrelevant jobs to me, so I have a standard response that I copy and paste into replies. At the moment I do this manually from a saved text file. Is there a quicker way of doing this?   I was imagining there would be some way to save a reply so 1 button or shortcut would send this reply.

I wanted to send a single email to different users. I save an email to drafts and send the email to a user and it goes to the sent box instead of staying in the drafts box. Is there a way I can send an email repeatedly from the drafts box?


The following does not evaluate correctly and shows a field even when the cond4 is not met  <aura:if isTrue="{!and(cond1, cond2,cond3, cond4)}"> SHOW A FIELD  </aura:if>   However, when I put cond4 in the front of the and, then it works as expected and does not show the field when cond4 is not met.  <aura:if isTrue="{!and(cond4, cond2,cond3, cond1)}"> SHOW A FIELD  </aura:if>   any clues

As I use the client side to enforce various pieces of business logic with aura:if statements, I'm finding that a given formula operator cannot handle more than two parameters.  For example, this works:  <aura:if isTrue="and(v.myAttributeString == 'Open', v.myAttributeBoolean == true)">     //do some stuff </aura:if>   But the following does not work (or at least the third "v.myAttributeSecondString" is not evaluated):  <aura:if isTrue="and(v.myAttributeString == 'Open', v.myAttributeBoolean == true, v.myAttributeSecondString == 'Yes')">     //do some stuff </aura:if>   Has anyone seen the same effect occur? Any documentation on this? Am I crazy and this actually does work, just not for me?  Thanks!


I want to compare two icons (one is the icon set to the button and the other is an image icon declared just above the if statement. Java gives me null pointer exception for the comparison. what's the problem? (Is it a syntax error? am I using an incorrect method for comparing the icons?)      final ImageIcon x=new ImageIcon("X.png");     final ImageIcon o=new ImageIcon("O.png");      if(jbutton[0][0].getIcon().equals(x)&& jbutton [1][0].getIcon().equals(x)&& jbutton[2][0].getIcon().equals(x))      {         JOptionPane.showMessageDialog(null, "insert message here");         hasWinner=(true);     }     else if (jbutton[0][1].getIcon().equals(x)&& jbutton [1][1].getIcon().equals(x)&& jbutton[2][1].getIcon().equals(x))     {         JOptionPane.showMessageDialog(null, "insert message here");         hasWinner=(true);     }

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I am trying to find the following math angle symbol in latex.  My effort is as \documentclass[a4paper, 12pt]{article}  \usepackage[margin=1in]{geometry} \usepackage{amsmath} \setlength{\parindent}{0cm}  \begin{document}      Complex numbers $z_1$ and $z_2$ are given by      \begin{align*}         z_1 &= 5\leftharpoonup-60^\circ \\         z_2 &= 4\leftharpoonup45^\circ      \end{align*}      \end{document}  its output is as

I am looking for suggestions on how to typeset complex numbers in the modulo-argument form, sometimes called phasor notation. Have already checked  but nobody mentions this in particular. I am explicitly excluding exponential and sine-cosine notations. My MWE is as follows  \documentclass{article} \begin{document}     $z = r \angle \phi$ \end{document}   I think it looks ugly, specially if the angle has many digits, ie  $z = 1.19 \angle -78.2039^{\circ}$   I was thinking of an \angle replacement which maybe would extend the lower segment up to the last digit. What do you think?  EDIT: It looks like the steinmetz package doesn't do a good job with the vertical space if the \phasor{} argument has a \fraction{}{} with parenthesis, see:  \documentclass{article} \usepackage{steinmetz}  \begin{document}     Something.     \[I = I \phase{\left(\frac{A_0}{B_0}\right)}\]     This line is too close to the upper equation, don't you think?      \[I = I \phase{\left(\frac{A_0}{B_0}\right)}\]     Whereas this line is NOT so close to the upper equation. \end{document}   Strangely, commenting the first line (% Something.) fixes the problem. Is there any way to fix this?


I'm running Ubuntu 18.04.1 x86_64  My wifi card is Broadcom Limited BCM43142 802.11b/g/n  I got my wifi working by installing bcmwl-kernel-source   I can connect to other networks on ubuntu (WPA2-PSK most of the time)  I can connect to the network in question on my dual booted Windows 10.  I have tried a number of solutions but one of them have helped me the slightest.  I managed to fix this same problem on some other version of Ubuntu by simply altering my /etc/NetworkManager/system-connections/ file.  I have installed a couple of other tools like wicd but they haven't done any good, they might need to be removed, but I'm keeping them until the need arises.   I'm on the same machine on another network so I can send outputs, feel free to ask for them or any other stuff.  Thank you for any help.  Some extra info: On windows 10 and on other ubuntu machines with different network cards, this network does not require a ca certificate. There are multiple routers on each floor of my hostel, (repeaters if you will).

I recently upgraded my Ubuntu from 16.04 to 18.04 (clean install, full wipe). Now I can no longer connect to the corporate network at my office (perhaps related to these bugs: , ). What proved to fix this issue in Ubuntu 16.04 is the answer to ; Downgrade wpa_supplicant to 2.1.  However, even with the linode repository, this fix can no longer be applied. There is no version for wpa_supplicant below 2.6 to the best of my knowledge for Ubuntu 18.04.  My question is this: How can I downgrade wpa_supplicant to 2.1 for Ubuntu 18.04?  Configuration needed for corporate the wifi connection:   Security: WPA & WPA2 Enterprise Authentication: Protected EAP (PEAP) Checkbox No CA certificate required. Inner authentication: MSCHAPv2


I have the following table. I need to format it so that the figures displayed are rounded to two digits after decimal place. I searched and all the solutions I found involve the use of a Latex package. I can't use a package (I think?) because I'm working with ShareLatex.  \documentclass{article} \usepackage{booktabs} \usepackage{tabularx} \begin{document} \begin{table}[tbp] \centering% \newcolumntype{C}{>{\centering\arraybackslash}X} \caption{Differences}% {\normalsize \begin{tabularx}{\textwidth}{lCCCC} \toprule Economy&year&nef\_en&gdi\_wer&inf\\\tabularnewline \midrule\addlinespace[1.5ex] Belize&2006&4.240267&-7.113768&-11.35403 \tabularnewline Central African Republic&2014&8.2&25.28281&17.08281 \tabularnewline Iran, Islamic Rep.&2012&30.5&27.35739&-3.142611 \tabularnewline Iran, Islamic Rep.&2013&34.78927&39.26636&4.477088 \tabularnewline Iceland&2009&16.27129&12.00581&-4.265474 \tabularnewline Kenya&2006&6&14.45373&8.453734 \tabularnewline Kenya&2007&4.3&9.758881&5.45888 \tabularnewline Kenya&2008&16.2&26.23982&10.03982 \tabularnewline Kuwait&2008&6.3&10.58271&4.28271 \tabularnewline Myanmar&2013&8.876498&5.524279&-3.352219 \tabularnewline Mongolia&2007&17.70245&9.045246&-8.657202 \tabularnewline Mongolia&2013&12.5&8.604828&-3.895172 \tabularnewline Mongolia&2015&1.9&5.775949&3.87595 \tabularnewline Chad&2011&2.040816&-3.704296&-5.745112 \tabularnewline Chad&2012&7.512763&14.01821&6.505443 \tabularnewline \bottomrule \addlinespace[1.5ex] \end{tabularx}% } \end{table}% \end{document}

Is it possible to have automatic rounding of numbers in a table?  Say that I have this, made in the usual way with a tabular environment:  pi  | 3.14592654 e   | 2.7182818284 phi | 1.6180339887   Can I control how many significant digits are shown without truncating the numbers manually myself?   So for example, if I need four significant digits, the numbers should appear as  pi  | 3.1459 e   | 2.7183 phi | 1.6180   Bonus points for actually rounding the numbers according to the usual rules without simply truncating them.    I understand this is probably non-trivial, so here's a relaxed version that will also work in my circumstances (all numbers have one and the same precision and character count):  (How) Can I control how many characters are rendered in a column of a table?  So if I define the text in the columns as:  \begin{tabular} % some black magic column definition    text & alongword\\    text & anotherlongword\\    text & morelongwords\\ \end{tabular}   I'd like to get something like:  text along text anoth text morel   I know there are non-TeX ways to do this, and I will probably resolve to writing a script if all else fails, but I'm curious whether there's a way to do it solely with TeX & friends.


I've been trying to save  webpage using all of the methods that I know, but none of them have worked so far. The website itself has some great functionality. It is able to render MathJax in realtime, without any noticeable lag. I want to be able to use it offline, so I wanted to save it. I haven't been very successful. I'm on MacOS. Here is what I have tried so far:   Save as on Safari as a Web Archive (.webarchive) – doesn't preserve the page's functionality Save as on Safari as Page Source (.html) – Completely messes the page up HTTrack – doesn't preserve the webpage's functionality Save as on Chrome as Webpage, Complete (.html) – messes up layout and functionality WebDumper – gives me a "Forbidden" error itsucks – messes webpage up SiteSucker – messes webpage up ScrapBook (firefox) – messes up A couple of other things that I can't remember anymore.   I just want to save the website and be able to use it offline. I noticed something interesting, however. When I'm in Safari and I go offline, the webpage performs fine. This undoubtedly means that the webpage can run offline with no problem – I just need a way to save it properly. I suppose I could create a virtual machine, load up the site on it and then save it as a snapshot and use it whenever I want to offline, but that seems like quite a disproportionate solution for such a seemingly simple problem.  On a side note: would it be possible to save a webpage like  (iPhone 6S page) with all of the scrolling animations, embedded pictures and videos and all the rest? I've only tried creating a Web Archive using Safari, but it only saved the nice scrolling animation – not the embedded pictures and such.

How can I download all pages from a website?  Any platform is fine.


I know following expression is true:  [1, 2] instanceof Array   And that's a correct approach to distinct an Array from Object. But why following expression is false?  0 instanceof Number

"foo" instanceof String //=> false "foo" instanceof Object //=> false  true instanceof Boolean //=> false true instanceof Object //=> false false instanceof Boolean //=> false false instanceof Object //=> false  12.21 instanceof Number //=> false /foo/ instanceof RegExp //=> true  // the tests against Object really don't make sense  Array literals and Object literals match... [0,1] instanceof Array //=> true {0:1} instanceof Object //=> true  Why don't all of them? Or, why don't they all not? And, what are they an instance of, then? It's the same in FF3, IE7, Opera, and Chrome. So, at least it's consistent.


What I have: A custom post type. A front end posting form which creates new posts with post_status = pending until they are manually reviewed and status changed to published.  What I need: While I can go to the listing of posts and see if there are any with "Pending" to authorize; what I want is to add a round icon with a number inside just like what WordPress does when there are new comments. I can write the code to extract the number of pending posts but I have no idea how to insert it in the admin menu.  This is the code created by wp when a new comment is added:  1   A screenshot which shows one new comment, i need the same at Items.  I have been looking for a solution to this for a while now and cannot find it anywhere; my next stop if no one can answer me here is to take apart the WP core and see how they do it there.

Much like how the Plugins or Comments menu items have these number notifications in a bubble for updates and unmoderated comments respectively, I'd like to use that bubble to display the number of CPTs which have a "Pending review" status. How to go about doing that?  I have found , but not quite sure where to go from there.  That would be neat to have; as I need this feature on a site that uses user-generated content (custom post types). Whenever users submit a new CPT, its status is set to "Pending review", and I want the site admins to quickly glance at the menu to see how many items need their attention.  EDIT: I now have this code:  // buuble notifications for custom posts with status pending add_action( 'admin_menu', 'add_pending_bubble' );  function add_pending_bubble() {     global $menu;      $custom_post_count = wp_count_posts('custom-post-name');     $custom_post_pending_count = $custom_post_count->pending;      if ( $custom_post_pending_count ) {         foreach ( $menu as $key => $value ) {             if ( $menu[$key][2] == 'edit.php?post_type=custom-post-name' ) {                 $menu[$key][0] .= ' ' . $custom_post_pending_count . '';                 return;             }         }     } }   ...which does work, albeit a bit inconsistent. Sometimes displaying, sometimes not. Also, if I have multiple CPTs, how do I apply this code for each and every menu item of those CPTs? The above code will work with only one CPT.


Can any one provide step by step installation of Open stack installation on Ubuntu 14.04?  Or   Is there any script like  for auto installation. I have tried devstack on Ubuntu but it didn't work ( Credentials Not Working ).   did work (Installation) but there is no username or password for the installation, so there is nothing to check its working or not.  Is there any way to install Openstack on Ubuntu?

How do I install ? Is there an easier way other than official installation instructions?


What is the purpose of flagging a post or comment? What does it do?

After reading , I feel I don't quite understand this function. What are the guidelines for flagging a question as "Requires Moderator attention"?


in C#   SPWeb web = SPContext.Current.Web; PublishingWeb publishingWeb = PublishingWeb.GetPublishingWeb(web); publishingWeb.CustomMasterUrl = "/_catalogs/masterpage/mycustom.master"; publishingWeb.CustomMasterUrl.SetInherit(true, true); publishingWeb.Update();   this code will change the master page and "Reset all subsites to inherit masterpage"  Is there a CSOM equivalent for CustomMasterUrl.SetInherit(true,true)?

I am able to change the master page using the below code  var web = ctx.Web;     var masterPageUrl = String.Format( "{0}/_catalogs/masterpage/filename.master", ctx.Web.ServerRelativeUrl );     web.MasterUrl = masterPageUrl;     web.CustomMasterUrl = masterPageUrl;     web.Update();     ctx.Load( web );     ctx.ExecuteQuery();   This works fine and it changes the master page to desired file.  But the problem is after doing that i have to manually goto      "site settings" -> "goto the top level settings" -> "master page"   and then check the "Reset all subsites to inherit this site master page setting"   Is there  a way to avoid this manual step and achieve this using CSOM?


My task is to compare two numbers and return true if they are equal by three decimal places. When I print out the value of diff it is 0.0001, but it still doesn't enter the if(diff <= 0.0001) block.     public class DecimalComparator {     public static boolean areEqualByThreeDecimalPlaces(double num1, double num2) {         double diff = Math.abs(num1 - num2);          System.out.printf("%f", diff);         if(diff <= 0.0001) {             return true;         } else {              return false;         }     }      public static void main(String[] args) {         boolean test = areEqualByThreeDecimalPlaces(3.1756, 3.1755);         System.out.println(test);          test = areEqualByThreeDecimalPlaces(3.176, 3.175);         System.out.println(test);     } }

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


With ctrl + cmd + space, macOS launches Emojis & Symbols, also know as the Character Viewer.  Is there a shortcut to launch the Keyboard Viewer?

KeyboardViewer app is saved from this AppleScript.  on run {input, parameters}     if application "KeyboardViewer" is running then         quit application "KeyboardViewer"     else          activate application "KeyboardViewer"     end if     return input end run   Dock toggle save. Adding shortcut to above, needs some work...   Syntax error Can’t set application "KeyboardViewer" to some object. Access not allowed.  tell application "System Events"     set application "KeyboardViewer" to (keystroke "K" using control down) end tell


I tried to configure a NFS server with my Red Pitaya board, with a custom Ubuntu image, exactly as this page tells me to .  However when I try to mount my directories on my Client I got this error:  sudo mount 10.30.xx.xxx:/var/nfs/general /nfs/general mount.nfs: Protocol not supported   Where 10.30.xx.xxx is my Host's IP. I googled this error and found that executing this command  in my Host should tell me the allowed Protocols of my NFS service, so I got his:   rpcinfo 10.30.xx.xxx |egrep "service|nfs"    program version netid     address                service    owner     100003    2    tcp       0.0.0.0.8.1            nfs        superuser     100003    3    tcp       0.0.0.0.8.1            nfs        superuser     100003    4    tcp       0.0.0.0.8.1            nfs        superuser     100003    2    udp       0.0.0.0.8.1            nfs        superuser     100003    3    udp       0.0.0.0.8.1            nfs        superuser     100003    4    udp       0.0.0.0.8.1            nfs        superuser     100003    2    tcp6      ::.8.1                 nfs        superuser     100003    3    tcp6      ::.8.1                 nfs        superuser     100003    4    tcp6      ::.8.1                 nfs        superuser     100003    2    udp6      ::.8.1                 nfs        superuser     100003    3    udp6      ::.8.1                 nfs        superuser     100003    4    udp6      ::.8.1                 nfs        superuser   I proceed to use the option vers (and nolock because the console tells me to) but still got the same error with all 3 versions (vers=2,vers=3,vers=4)  mount -o rw,nolock,vers=2 10.30.xx.xxx:/var/nfs/general /nfs/general mount.nfs: Protocol not supported   How come all 3 versions are not supported? Am I using the options wrong?

I want to mount the NFS share of a Zyxel NSA310s NAS. Showmount, called on the client machine, shows the share:  $ showmount 10.0.0.100 -e Export list for 10.0.0.100: /i-data/7fd943bf/nfs/zyxelNFS *   The client's /etc/fstab contains the line:  10.0.0.100:/i-data/7fd943bf/nfs/zyxelNFS /media/nasNFS nfs rw  0 0   But mounting does not work:  sudo mount /media/nasNFS/ -v mount.nfs: timeout set for Mon May 25 17:34:46 2015 mount.nfs: trying text-based options 'vers=4,addr=10.0.0.100,clientaddr=10.0.0.2' mount.nfs: mount(2): Protocol not supported mount.nfs: trying text-based options 'addr=10.0.0.100' mount.nfs: prog 100003, trying vers=3, prot=6 mount.nfs: trying 10.0.0.100 prog 100003 vers 3 prot TCP port 2049 mount.nfs: portmap query retrying: RPC: Program/version mismatch mount.nfs: prog 100003, trying vers=3, prot=17 mount.nfs: trying 10.0.0.100 prog 100003 vers 3 prot UDP port 2049 mount.nfs: portmap query failed: RPC: Program/version mismatch mount.nfs: Protocol not supported   nfs-common is installed. What else can be missing?


I've been scouring the internet for this and I'm pretty sure it's an /ɛ/ or /ei/ but I've also seen it pronounced as a long /i/ (as in beat) or as a weird /aeo/.

The Encyclopædia Brittanica still uses the symbol "æ". However, I still hear everyone pronounce it as "Encyclo pee dia", when their spelling suggests more along the lines of "Encyclo pah dia" or "encyclo pay dia". In a more general sense, should æ or Æ always be pronounced as a long e sound? When I see it used, it is in dæmon, æther, or æon.    makes it clear that they should be pronounced with another sound along the lines of ah or eh... confusing because I want to pronounce it as "ai" or "ay". Given the name "Aion" as a recent videogame, and the common pronunciation of a CS mailer-daemon as "Daymon", clearly others behave the same way.  The problem lies in that  æ used to be pronounced as ah/eh, and now seems to be pronounced as ay. Encyclopædia is the only exception... being pronounced as ee?  How do I pronounce it when seen in English? ee, ay, or ah/eh?


Let $E$ be a non-empty subset of $R$, let $n \geq 1$ be an integer, and let $L < K$ be integers. Suppose that $\frac{K}{n}$ is an upper bound for $E$, but that $\frac{L}{n}$ is not an upper bound for $E$. Show that there exists an integer $L < m \leq K$ such that $\frac{m}{n}$ is an upper bound for $E$, but that $\frac{m-1}{n}$ is not an upper bound for $E$.  The author has given the hint to use cntradiction and then induction to prove but I am not able to make any progress on this question.  It is a step in the proof of existence of least upper bound.  (Reference: Analysis 1, Terrence Tao, Exercise 5.5.2, page 121)

Terence Tao, Analysis I, 3e, Exercise 5.5.2:     Let $E$ be a non-empty subset of $\mathbb{R}$, let $n \ge 1$ be an   integer, and let $L < K$ be integers. Suppose that $K/n$ is an upper   bound for $E$, but that $L/n$ is not an upper bound for $E$. Without   using Theorem 5.5.9, show that there exists an integer $L < m \le K$   such that $m/n$ is an upper bound for $E$, but that $(m-1)/n$ is not   an upper bound for $E$. (Hint: prove by contradiction, and use   induction. It may also help to draw a picture of the situation.)    does not do the trick for me, since I'm looking for the proof by contradiction, equipped only with the set of propositions and theorems covered so far.  What I'm actually looking for is an entry point to the proof, since I find it quite hard to negate the assumption.  My attempt is to induct over $n$. Assume I have been able to prove the statement for $n = 1$, is the following a valid negation of the assumption?  For all integers in the range $(L, K]$, at least one of the following statements holds:   $(m-1)/(n+1)$ is not an upper bound and $m/(n+1)$ is not an upper bound. $(m-1)/(n+1)$ is an upper bound and $m/(n+1)$ is not an upper bound. $(m-1)/(n+1)$ is an upper bound and $m/(n+1)$ is an upper bound.   If I were able to prove that there is an integer in the given range such that none of the above holds, am I done?       Theorem 5.5.9 (Existence of least upper bound). Let $E$ be a non-empty subset of $\mathbb{R}$. If $E$ has an upper bound, (i.e.,   $E$ has some upper bound $M$), then it must have exactly one least   upper bound.     I went through another loop considering  of Steve Kass, but I ended up wondering why the proof needs induction at all:  Assume for all integers $m$ where $L < m \le K$ we have that $m/n$ and $(m-1)/n$ are upper bounds of $E$. Then $(m-1)/n = L/n$ is also an upper bound. But $L/n$ is no upper bound, by assumption. Assume $m/n$ and $(m-1)/n$ are no upper bounds. Then $m/n = K/n$ is also no upper bound. But $K/n$ is an upper bound, by assumption.   Hence, there is an integer in the range $(L, K]$ s.t. $m/n$ is an upper bound for $E$, and $(m-1)/n$ is not.


I do not mean that I deserved a Kofia hat, but today I asked and answered questions, all of which have at least one upvote.  Are there another requirement for the hat?     Kofia           first post between 12/26 and 1/1

first post between 12/26 and 1/1   Does that mean your very first post as a user should be made in those days?  Or that you should be the first user to post any post on a site starting 12/26?  Or something else?  The first option seems somewhat more likely but I'm not sure I'm parsing the description right.


I have a method that I want to send several parameters or one or none  public void CalcBreakpoint(int tolerance, [I want to send several parameters or one or none]) { //my code }   for example something I want to call it as CalcBreakpoint(200, "string value1", "string value 2", "String Value 3")  and in other occasions I would call it as  CalcBreakpoint(500, object1, object2)  I would like to avoid overloading because 90% of the code is the same.   How to pass several values as parameters in a method? such as   public void CalcBreakpoint(int tolerance, [ONE_PARAMETER])

Note: This question was asked at a time when C# did not yet support optional parameters (i.e. before C# 4).  We're building a web API that's programmatically generated from a C# class. The class has method GetFooBar(int a, int b) and the API has a method GetFooBar taking query params like &a=foo &b=bar.   The classes needs to support optional parameters, which isn't supported in C# the language. What's the best approach?


Angular displacement isn't a vector quantity (according to some websites) then how angular velocity can be a vector? shouldn't it be a scalar?

Does anyone have an intuitive explanation of why this is the case?


Sometimes I want to refer (using \ref) a \label from some other tex file. What is the right way to do it?  (It's, of course, possible to \include all files in one and then use \includeonly — but it breaks e.g. page and section numbering.)

I want to cross-reference between different .tex files, just because I want to put every chapters separately.  Let's say in file chapterI.tex I have \label{a} and I want to access this in file chapterII.tex using something like \ref{a}. How to do this exactly in LaTeX, moreover if LEd have an easy feature to cover this, it will be better (I have put those both files in the same project).  I found another question with similar title, but I just didn't really understand. It's here: .


I am running Ubuntu Gnome 16.10 with gnome-shell 3.20.4. I usually see my graphic interface run on TTY7. But now (new install) I see GDM run on TTY1 and my graphic interface on TTY2. Why GDM and gnome-shell are separate? And why it's run graphic interface on TTY2 and not in TTY7. It is a wrong configuration or it is totally normal to see this ?  On my TTY7 I can see : /dev/sda4/ clean: xxx/xxx files, xxx/xxx blocks

I am running Ubuntu Gnome 16.10 (64bit). Gnome-shell version 3.20.4.   When I start my computer, I eventually see GDM3 offering a login prompt, as expected.   After I login, my monitors flash a little (like they're unplugged and then replugged in), and then I am brought to the gnome 3 desktop.   However, if I hit  CTRL + ALT + F1, I am brought back to GDM3, offering a login prompt.   If I then hit CTRL + ALT + F2,  I am brought back to my Gnome 3 desktop.  So it seems like GDM3 continues to run in TTY1 while the desktop runs in TTY2.   Questions   Is this how things are supposed to work? I thought the desktop was supposed to use the same TTY (or whatever you call it) as the display manager.  Am I using more graphical resources by having things setup this way? Is there a way to have GDM3 pass off the display to Gnome Desktop after I login? Is there any advantage do doing #3?


I have a deceased cousin that has a yDNA-12 test from 2004.  I would like to upgrade their test to yDNA-111, BIG-Y, and Family Finder Autosomal.  I'm concerned that their sample is twelve years old and may not be a good one, plus I don't have access to their login on FTDNA.  Also, how long are these samples retained by Family Tree DNA?  How should I approach this with FamilyTreeDNA to get permission and maximize the information we can get out of this sample?  Should I instruct them to upgrade in a particular order?  Should I inform them of the goal and let them drive the process?  Can the Big-Y be done together with the upgrade of the STRs to 111?  Or perhaps it is better to do Big-Y on other distant cousins and based on results of those do targeted testing?

I posted this general question over at the forum on FamilyTreeDNA. Though I received a reply, there is still no answer to my question, so I thought I'd try my luck at posting here.  Anyhow, in early 2009 I bought two kits for the Genographic Project and dutifully had my father do his cheek swabs: one kit for his Y-Chromosome, and one for his mtDNA. Once that was completed, I had his samples transferred to Family Tree DNA.  Then, late in 2009 I paid to have an mtFullSequence done on his mtDNA sample.  My father passed away in 2015. In early 2016, I phoned FTNDA to discuss. The first thing they did was arrange to merge his two original samples into one kit. Then, they suggested doing Family Finder. I did that and recently obtained the interesting results.  So, all told what I have done on my father is:   Y-12 (originally done for the Genographic Project) mtFullSequence Family Finder   My father's Y Haplogroup is R-M269 and I am being presented with the M343 SNP pack on FTNDA.  My question is, what now? My father is gone so the sample that remains with FTDNA is old and finite (their customer service says they still have "one container" of his DNA). His siblings have all passed away -- unfortunately, with no samples taken. What is the best way to make use of the sample of my father's DNA that is left?  Should I refine the Y-Chromosome to Y-111? That seems the most natural (though I'm a male and carry it too). Should any SNP tests best be done on his remaining sample as opposed to on me? Or, should I do nothing and just let his 2009 samples continue to sit at FTDNA?  By phone, FTDNA said that they should have enough left to do the Y-111 and a SNP pack which is great, but I'd love to know independent of their customer service if that is the wisest way to make use of the remaining DNA sample which they have?  Full disclosure: I did have my father do 23andMe in 2010 and I did have his blood drawn and sent to a DNA Bank. I hope to never touch his banked DNA (except maybe to do a full sequence someday), but at least it does exist. My question now is solely how to best make use of my father's remaining sample at Family Tree DNA?


I had a friend recently ask me about the use of the particle "the" in different contexts that she was having trouble understanding and I found I was unable to explain the use. The lesson she had done was similar to this one:    Where "the" is explained as a word for a specific noun known to both speaker and the listener such as      The bike was red.   However a number of the examples she was given(and were not really explained in the material she showed me) were of the form     The bike is one of the most efficient means of transportation.   or     The squirrel is a small mammal   Neither of these examples are referring to a specific noun, they are referring to a generalization, "The bike" is true for every bike and the same for the squirrel example. Further to her confusion was that the sentences were not plural when referring to a generalization of "every bike" when she tried to correct the sentences as "the bikes are".   Would it be possible for someone to give me a explanation of this use or point me to something that has an explanation. I found it quite difficult to try and explain and the best I could come up with was that it's similar to "The idea of a bike is. . ." or "The idea of a squirrel is. . ." which I don't think is entirely accurate. The main trouble comes from "The" being used for a specific item, and in these cases the noun in question being used as a generalization. Am I just thinking about this wrong?

I know that the definite article "the" can be used to mean a generic idea of something as in "the lion is the king of the animals." In this sentence, the in "the lion" is used to imply the general image of lions, so not specifying a particular lion.   However, I am confused in identifying where a "the" in a sentence is used for a general idea or a specific reference. For example, in the sentence "the price of gas is soaring", I heard that "the" in the sentence is an example of the generic use of the. Although I can easily understand the generic use of "the" in the lion example, but I do not understand how there is an general idea about gas price. Soaring gas price is something real,and gas prices in different regions( in a hypothetical situation) can be different. So, if I say "the price of gas is soaring", do I mean the price of gas that is determined by the world's oil system or can I say "the gas price" even when I am indicating the state of gas price in "a particular region"?    I know it is even difficult to understand my question, but I hope someone could find what I am confused about and give an answer.


For the following example, is there a way to get the type of a and b as int and string?   class test(object):     def __init__(self):         self.a = 1         self.b = "abc"  test_obj = test() for var in vars(test_obj):      print type(var) # this just returns string type as expected (see explanation below)

How do I find out a name of class that created an instance of an object in Python if the function I am doing this from is the base class of which the class of the instance has been derived?  Was thinking maybe  might have helped me out here, but it doesn't seem to give me what I want. And short of parsing the __class__ member, I'm not sure how to get at this information.


I am working on a program that I am having trouble with it. I have been working with this program for a day and did not work. The output came only letters, @ symbol and numbers. Here is the description of the program.  Generate a Fibonacci sequence. Each number in the Fibonacci series is the sum of the two preceding numbers in the sequence. The first two numbers in the sequence are both 1. The third number is 2, the fourth number is 3, the fifth number is 5, and the sixth number is 8. The program should be able to return a specified amount in the fibo sequence. If a number is specified that is out of range, a -1 should be returned.  I have done the code and the runner code. My output will be similar to this.  1  1  2  3  5  8  89  987  10946  1346269  165580141  1836311903  1  1  1  -1  Here is my code   public class Fibonacci {     int[] fibArray;     public Fibonacci()     {         fibArray = new int[50];         this.setFibo();     }     public void setFibo()     {         fibArray[0]=1;         fibArray[1]=1;         for(int idx = 2; idx<fibArray.length; idx++){             fibArray[idx] = fibArray[idx-1] + fibArray[idx-2];         }     }     public int[] getFibo()     {         return fibArray;     }     public String toString()     {         return this.getFibo() + "\n";     } }      Here is my runner code.   public class FibonacciRunner {     public static void main(String[] args) {         int[] fibArray = {1,2,3,4,5,6,11,16,21,31,41,46,1,1,2,1,2,11};         Fibonacci fibo = new Fibonacci();         System.out.println(fibo.getFibo());         System.out.println(fibo.getFibo());         System.out.println(fibo.getFibo());         System.out.println(fibo.getFibo());         System.out.println(fibo.getFibo());         System.out.println(fibo.getFibo());         System.out.println(fibo.getFibo());         System.out.println(fibo.getFibo());         System.out.println(fibo.getFibo());         System.out.println(fibo.getFibo());         System.out.println(fibo.getFibo());         System.out.println(fibo.getFibo());         System.out.println(fibo.getFibo());         System.out.println(fibo.getFibo());         System.out.println(fibo.getFibo());      } }

In Java, arrays don't override toString(), so if you try to print one directly, you get the className + '@' + the hex of the  of the array, as defined by Object.toString():  int[] intArray = new int[] {1, 2, 3, 4, 5}; System.out.println(intArray);     // prints something like '[I@3343c8b3'   But usually, we'd actually want something more like [1, 2, 3, 4, 5]. What's the simplest way of doing that? Here are some example inputs and outputs:  // Array of primitives: int[] intArray = new int[] {1, 2, 3, 4, 5}; //output: [1, 2, 3, 4, 5]  // Array of object references: String[] strArray = new String[] {"John", "Mary", "Bob"}; //output: [John, Mary, Bob]


I have prepared a cover page and the first chapter of my dissertation. Both of these are in different tex files.  I read that in order to have everything in a master file you need to use the include command. It does not work for me so far.  Here is the minimal example.  % cover_page.tex \documentclass[10pt,a4paper]{article} \usepackage[latin1]{inputenc} \usepackage{amsmath} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{graphicx}  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%   %%%%%%% %%%%%%%%%%%%%%%%%%%%%%         TITLE, AUTHOR FOLLOWS            %%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  \title{\textbf{{\huge Proposal}} \\[8pt] Essays on ...} \author{by Me} \date{} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%    DOCUMENT BEGINS    %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%   \begin{document} \maketitle \thispagestyle{empty} % no number in the first page  \vspace{3cm} \begin{center} Advisor:  \end{center}  \vspace{2.5cm}   \begin{minipage}[c]{14.5cm} \centering Proposal  \end{minipage}    \vspace{3cm}  \begin{minipage}[c]{14.5cm}  \centering Department \\   University \\ \end{minipage}   \vspace{2.5cm} \begin{center} \date{A month} \end{center}  \newpage \thispagestyle{empty}  \begin{center} \begin{tabular}{lllll}  Advisor & \hspace{2cm} & \hspace{1cm} & Me & \hspace{2cm} \\[25pt]   \cline{1-2}\cline{4-5}  \textit{Signature} & & & \textit{Signature} &  \\[25pt]   \cline{1-2}\cline{4-5}  \textit{Date}  & & & \textit{Date} &  \\   \end{tabular}   \end{center}   \end{document}   Now let us move on chapter_1.tex  \documentclass[10pt,a4paper]{article} \usepackage[latin1]{inputenc} \usepackage{amsmath} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{graphicx} \title{My title} \author{PSK} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%    DOCUMENT BEGINS    %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  \begin{document} \maketitle \thispagestyle{empty} % no number in the first page  \newpage  Some stuff here   \end{document}   And last, but not least the master file:  \documentclass{article}  \begin{document} \include{cover_page.tex} \include{chapter_1.tex}  \end{document}

I have two documents A and B. Both of them are separate documents. But document A also has to include document B.   Now if I use \include{B} i get the following error:  ! LaTeX Error: Can be used only in preamble.  See the LaTeX manual or LaTeX Companion for explanation. Type  H <return>  for immediate help.  ...                                                l.1 \documentclass                   [11pt]{article} ?    So how can I force to include document B with the "style" and "template" of document A?


I am using Firefox and Chrome. There a few websites only which I don't  want anyone to know I visit. But they appear in browser history or when I start typing they also come as auto complete. I have to manually delete them.  Is there any way or add-on which I can install and then I can define the sites that I don't want to appear in history?  Incognito mode is also available, but if I use that, all of my cookies are cleared and I have to enter all my log-in stuff again.

I use Firefox very intensively, and from time to time I clear the browser history. But unfortunately the history is being filled very fast and it always keeps the history I'm not interested in:   Some sites does not make any interest for me at all, and I would like never include them to the history tracker. Other web applications, like Google Reader, use #-links to navigate through the application content, and e.g. for Google Reader the old URLs simply become obsolete because I use "Mark as read". So I don't even see any reason of tracking the #-links in history.   Is there any way/extension/etc to support the features to support either white-lists or black-lists, or particular URL tracking for Firefox? Thanks in advance.


I bought flight tickets from Air France to travel from Israel to Japan and back. On the flight back, the first leg (Tokyo Narita >> Paris CDG) is operated by Japan Airlines, then the second leg (Paris CDG >> Israel BG) is operated by Air France.  Both companies have different baggage rules. JAL allows 2 checked baggages per person, with a total linear dimension of 203 cm, while AF allows 1 checked baggage per person, with a total linear dimension of 158.  When I check my reservation details on the AF site, it simply says that I'm allowed 2 checked baggage items on the flight back, so I don't suppose the number of suitcases will be a problem. But I am worried about the dimensions - 203 cm is quite a bit larger than 158 cm. If I check in a 203 cm suitcase in Tokyo, will it cause problems when they transfer it to the AF plane?

I am flying with two different airlines in one ticket. Finnair from Helsinki to Vienna and Qatar airways from Vienna to manila. Which airline baggage policy should I follow? There is no indicated baggage allowance in my electronic ticket.


This is a follow-up to . My next question is what to do when the question is bad, but the answer is not.  Here is an example of . The question is closed as "too localized", and the answer is flagged as "not an answer". On one hand, I would agree that the answer is not definitive in any way; on the other hand, it has a decent probability of sending a reader in the right direction - after all, it helped the OP. That is why I would be hesitant to remove the answer.  What is the preferred course of action in this situation? Should I disregard the potential helpfulness and second the flag, or would it be better to dispute it?

Take a look at . It's a really crappy question that (especially for the first revision) really deserves its -4 score.  However, one user has written what (to me, who doesn't know jack about Objective C) looks like a great answer, tutorial style.  Knowing nothing about the topic, I can't really judge this or do anything about it, but I just feel bad that the answerer has gone through some lengths to write up a (seemingly) good answer for a question that hardly anybody will ever look at. I can't even upvote the answer, because I don't know if it's good.  One idea that I had was a "Flag for pro attention" kind of thing that make the question show up in some lists for people that are active in the particular tag(s). However, I think things like that have been discussed before, and not really come to a conclusion. I myself can't think of a good way to accomplish this.  But I also don't want to leave this question rotting there. So how would you handle this  and similar cases?


I am reading about free will and it seems to me that for everyone free will is associated with consciousness and this is why the Libet experiment has been so important in this debate.  I do not understand why we could have free will only if it is our consciousness that acts freely and not just our brain (listen for example  and ).

Philosophical zombies may lack a consciousness, but does this preclude the ability to have a free will? Why does consciousness matter, for agency, or at all, if determinism is real?   (I've framed the question, as such, to make room for more than a Hume answer to my inquiry.)


What question tag should go with the following sentence:     That should be easy.   Will it be shouldn't that or shouldn't it or something else, and why?

The complete sentence is:     Two hours should be enough time for passengers to travel from Taipei to Kaohsiung by high speed rail, isn't it?   Is it grammatically correct to use "isn't it" in the above sentence? If not, how would you revise it?


We got introduced to Princess Reiners in season 2, episode 1, and we were given flashes in the ending theme that she had a dark personality. This was later confirmed in episodes 9 and 10 when her brother, Prince Zanac, calls her a monster to her face. When she turned around, she had the anime crazy face, but didn't actually change form into a literal monster of any kind.  Over on the MAL forum for , they simply refer to her as a yandere. On , they say she's a psychopath.  I always considered the anime crazy face to be a metaphor for viewers, not a literal change for other characters in-story. Aside from her dark personality / face twisting, and the fact that she plans out big, complicated, moves, I don't understand what the big deal is. Why would she be called a monster? How would anyone else in Yggdrasil would know that she is a "monster"? Or is she a monster in a literal sense?

From the ED song, it seems like the Princess has dark/other personality which we all don't know about.  Is it true? Is there any story of hers to begin with?  The specific scenes from the ending:


Do you know the cafe down the street? I always go there after work. You should drop by/in someday.   Can both "by" and "in" be used here? Is there a difference between them? Which one is more natural?

Suppose a lonely mother who has a son who does not give his mother a call for a long time (he doesn't go to his mother home to make sure what is going on and how is his mother's conditions from each viewpoint); then once when son for a reason goes to her home, mother wants to ask (kindly and with a smile on her lips) why you do not visit me at all for a long time; in this scenario do the following sentences mean the same? Which one doesn't sound natural and why? If no what is the difference between them?        Why don’t you come in?   Why don’t you drop in?   Why don’t you check in?   Why don’t you step in?   Why don’t you come by?   Why don’t you drop by?   Why don’t you check by?   Why don’t you step by?   Why don’t you come over?


I'm new to trying to find the time complexity of a program and im stuck on this code where the inner loop only ever runs at most twice. sum = 0; for(int i = 0; i<n; i++){      for(int j = 1; j<n*n; j*=n) {            sum++;         }     }  From what I've seen so far, nested loops like these are usually O(n^2), but since the inner loop only ever runs at most twice does this mean that the programs time complexity is O(n) or would it still be O(n^2)? Also is the inner loop O(1) or O(n)?

I need to calculate the time complexity of the following code:  for (i = 1; i <= n; i++) {   for(j = 1; j <= i; j++)   {    // Some code   } }   Is it O(n^2)?


I recently got a new laptop for Christmas, I love it. There is one crucial error though. It runs Windows 8. I cannot stand Windows, let alone Windows 8. I want to keep Windows 8 for the simple fact that this is a gaming PC, and sadly Linux is in the shallow end of the dream pool in that department. I cannot get the Ubuntu live USB to boot. In fact I cant get any Linux USB's to boot. I have tried every suggestion I have seen, other than updating the UFCI BIOS. That scares me. I have tried going into legacy mode, changing the way the SSD works, turning off fast boot, turning off secure boot, and  I even turned off the MSI boot logo. Nothing worked. I can boot into the USB but when I select Try Ubuntu without installing, it goes to a black screen and that's it. Any help would be appreciated.  Specs: 16 GB of RAM 750 GB SSD Intel core i7 Nvidia GeForce GTX 770M  If you need any other info feel free to ask.

I'm absolutely new to Linux. I would like to know how to install Ubuntu alongside the pre-installed Windows 8+ OS.  Should I do it with Wubi, or through the Live USB/DVD?  What steps do I need to take to correctly install Ubuntu?


I read that if I extend the C: drive partition to the left, the boot will get corrupted. Is there any way to do it without hurting the boot?  Here is a screenshot of my Disk Management screen for clarification:

I have some unallocated space before my Windows 7 partition.    Can I move the Windows 7 partition so that the free space is after it instead than before it, and then extend the partition to use all of the currently unallocated space?


I want to create a table just like this. How do I go about it? Do I use tables? A combination of tables and tikz maybe?

How to get the node at the top corner of the cell in the table with borders and does not mess with the alignment of the empty cell in a table?  \documentclass[12pt]{standalone} \usepackage{tikz} \usepackage{array} \begin{document} \begin{tabular}{|c|c|c|c|c}\cline{1-4}  20 \raisebox{0.2cm}{\small 4} & \raisebox{0.2cm}{\small 6} & \raisebox{0.2cm}{\small 8} & \raisebox{0.2cm}{\small 8} & 40\\  \cline{1-4}  & & & & 60\\ \cline{1-4}  & & & & 50 \\ \cline{1-4}  \multicolumn{1}{c}{20} & \multicolumn{1}{c}{30} & \multicolumn{1}{c}{50} & \multicolumn{1}{c}{50} &  150\\  \end{tabular}


We are trying to migrate from SQL Server 2012 to SQL Server 2014 on Windows 2012 R2 OS.  After the upgrade, we are doing performance testing and observed huge difference in running a simple query from only one table (No joins at all).  The query is getting executed in 4 seconds in SQL Server 2012, but taking more than 1 minute in SQL Server 2014.   The SQL Servers are installed on 2 different VMs (different IP addresses).  They have only one SQL Server instance on each machine.   The processor / ram / hard drive space is same between 2 machines.   The machines have the same applications installed. We are running the same select query from the SQL Server Management Studio directly.

During the migration of one of our databases from SQL Server 2012 (SP1, CU2) to SQL Server 2014 (SP1), we have experienced some strange issues.  One of the queries that completes within seconds on SQL Server 2012 seem to be hanging on SQL Server 2014.  SELECT  DISTINCT      src.[Id] FROM     [stg].[BaseVolumes] src JOIN          [tmp].[Dates] d ON src.[CalWeek_Nmbr] = d.[CalYrWkDense_Nmbr] WHERE        EXISTS (SELECT  *             FROM                     (SELECT     ctry.[ISOCode]                  AS  [Mkt_Code]                             , so.[Code]                     AS  [SlsOrg_Code_AK]                             , so.[DistributionChannelCode]  AS  [DistChnl_Code_AK]                             , prd.[SupplierCode]                AS  [SKU_Code_AK]                             , cl6.[Code]                        AS  [CstHierLvl06_Code_AK]                             , lp.[BaseDateID]                   AS  [Dte_EK]                  FROM   [PM_APP].[edw].[BaseVolumeDayCurrent]   lp                  JOIN   [PM_APP].[dbo].[Country]                ctry    ON  lp.[CountryID] = ctry.[ID]                  JOIN   [PM_APP].[dbo].[SalesOrganisation]      so      ON  lp.[SalesOrganisationID] = so.[ID]                  JOIN   [PM_APP].[dbo].[Product]                prd     ON  lp.[ProductID] = prd.[ID]                     JOIN   [PM_APP].[dbo].[CustomerLevel6]         cl6     ON  lp.[CustomerID] = cl6.[ID]                  WHERE                        lp.[ModifiedByApp] = 1) lkp             WHERE                    src.[Mkt_Code]                  =   lkp.[Mkt_Code]                 AND src.[SlsOrg_Code_AK]        =   lkp.[SlsOrg_Code_AK]                 AND src.[DistChnl_Code_AK]      =   lkp.[DistChnl_Code_AK]                 AND src.[SKU_Code_AK]           =   lkp.[SKU_Code_AK]                 AND src.[CstHierLvl06_Code_AK]  =   lkp.[CstHierLvl06_Code_AK]                 AND d.[Dte_EK]                  =   lkp.[Dte_EK]         )   Row count:   BaseVolumes:            23108  Dates:                  18628  BaseVolumeDayCurrent:   108115503  Country:                249 SalesOrganisation:      29 Product:                18446 CustomerLevel6:         295   Wait stats showing high CXPacket, but there is one hanging task with SOS_SCHEDULER_YIELD, (print from sys.sysprocesses)   spid | blocked | waittime | lastwaittype          | cpu     | physical_io   76   | 0       | 9886044  | CXPACKET              | 13902   | 31192  76   | 0       | 0        | SOS_SCHEDULER_YIELD   | 9829719 | 83077  76   | 0       | 11248    | CXPACKET              | 11110   | 0 . . .   Attached are the execution plans from SQL Server 2012 and SQL Server 2014.       Any help much appreciated.


Why Java's Collection.contains() use 'Object o' as the parameter, unlike Collection.add() which uses the generic E?  This gives rise to potential mistakes like  HashSet<Integer> hash = new HashSet(); hash.contains(1.42); //will always be false

Why isn't  generic?    Seems like Collection<E> could have boolean remove(E o);   Then, when you accidentally try to remove (for example) Set<String> instead of each individual String from a Collection<String>, it would be a compile time error instead of a debugging problem later.


So the question is completely stated by the title. My own thoughts:  I can prove that $x^2 + 1 = y^3$ has no solutions for $x,y \in \mathbb{Z}$ by using the factorization: $$ y^3 = (x-i)(x+i) $$ in $\mathbb{Z}[i]$, using the fact that $\mathbb{Z}[i]$ is a UFD and that $(x-i)$ and $(x+i)$ are coprime we obtain that they are both cubes and it follows that this is impossible.  Now I would like to apply similar reasoning for this equation, we factor it as follows: $$ y^3 = (x-\sqrt{-5})(x+\sqrt{-5}) $$ in $\mathbb{Z}[\sqrt{-5}]$ but this time $\mathbb{Z}[\sqrt{-5}]$ is not a UFD. However, since $\mathbb{Q}(\sqrt{-5})/\mathbb{Q}$ is a finite seperable field extension we find that the integral closure of $\mathbb{Z}$ in $\mathbb{Q}(\sqrt{-5})$ is a Dedekind domain, this integral closure is exactly our ring $\mathbb{Z}[\sqrt{-5}]$ (which follows from the fact that $-5 = 3 \neq 1 \text{ mod } 4$). In a Dedekind domain we know that we write ideals uniquely as a product of maximal ideals, we can apply this to the ideal $(y)$, $(x-\sqrt{-5})$ and $(x+\sqrt{-5})$ for this to be useful we must first prove that the ideals $(x-\sqrt{-5})$ and $(x+\sqrt{-5})$ are coprime, for this it suffices to show that there is no prime ideal $P \subseteq \mathbb{Z}[\sqrt{-5}]$ that contains $(x-\sqrt{-5})$ and $(x+\sqrt{-5})$.  Let $P$ be a prime ideal s.t. $x-\sqrt{-5},x+\sqrt{-5} \in P$, then it follows that also: $$ 2\sqrt{-5} = x+\sqrt{-5} - (x-\sqrt{-5}) \in P $$ and thus by the given equality: $$ -20 = (2\sqrt{-5})^2 \in P^2 \subseteq (y)^3 $$ so we find an element $a+b \sqrt{-5} \in \mathbb{Z}[\sqrt{-5}]$ s.t. $-20 = (a+b\sqrt{-5}) \cdot y^3$ using the norm: $$ N(r + s \sqrt{-5}) := r^2 +s^2 5 $$ we obtain from this equality thath: $$ 400 = (a^2 + 5b^2) \cdot y^6 $$ but as $400 = 2^4 \cdot 5^2$ we find that $y$ must be equal to $1$ and thus we find that: $$ x^2 + 5 = 1 $$ which is clearly impossible as for $x \in \mathbb{Z}$ we have $x^2 \geq 0$.  From this we can conclude that $(x-\sqrt{-5})$ and $(x+\sqrt{-5})$ are indeed coprime so their decomposition in a product of maximal ideals is disjoint (i.e. we find maximal ideals $\mathfrak{p}_1,\dots,\mathfrak{p}_r$, $\mathfrak{q}_1,\dots,\mathfrak{q}_s$ and natural numbers $e_1,\dots,e_r,f_1,\dots,f_s$ s.t.:  $$(x-\sqrt{-5}) = \mathfrak{p}_1^{e_1}\dots\mathfrak{p}_r^{e_r}, \qquad (x+\sqrt{-5}) = \mathfrak{q}_1^{f_1}\dots\mathfrak{q}_r^{f_r}$$ where all $\mathfrak{p}_i$ and $\mathfrak{q}_j$ are different. For $(y)$ we also find such a decomposition, which implies that the decompositions of $(x-\sqrt{-5})$ and $(x+\sqrt{-5})$ must be of the form: $$ (x-\sqrt{-5}) = \mathfrak{p}_1^{3e_1}\dots\mathfrak{p}_r^{3e_r}, \qquad (x+\sqrt{-5}) = \mathfrak{q}_1^{3f_1}\dots\mathfrak{q}_r^{3f_r} $$ which implies that there is some ideal $I$ in $\mathbb{Z}[\sqrt{-5}]$ s.t. $(x+\sqrt{-5}) = I^3$ so we find elements of $I$: $a_i+ b_i \sqrt{-5} \in I$ for which: $$ x+\sqrt{-5} = \prod_{i=1}^3(a_i+ b_i \sqrt{-5}) $$ and then I would like that this is impossible, but at this point I'm stuck.  I'm sorry if my own idea is absolutaly worthless but this is the first time I try to solve this kind of exercise.

Find all integral solutions  $x^3-9=y^2$  I tried many times but still no idea how to solve it. I will be grateful for any help.


This is an example from a question sheet (non-assessed) of a university class. If M is a non-orientable, closed, connected 3 manifold, prove $H_1(M;\mathbb{Z})$ is an infinite group. I know that since $M$ is non-orientable it follows that $H_3(M;\mathbb{Z}) = 0$ and since $M$ is connected $H_0(M;\mathbb{Z}) = \mathbb{Z}$. I want to apply a combination of Poincare duality and Universal coefficient theorem to try and find a contradiction if $H_1(M;\mathbb{Z})$ has no free part. However poincare duality doesn't apply here so I'm stuck.  I would appreciate any hints as to how to proceed.

I'm doing past papers for a first course in algebraic topology.  The question is:     Let $M$ be a 3-dimensional, closed, connected, non-orientable manifold. Show that $M$ has infinite fundamental group.   Is there any way of answering this question without simply quoting a classification theorem for 3-manifolds with finite fundamental group?


First of all let me tell you why i ask this question (perhaps i'm in the wrong way):  My program will use SQLite. Every tuto/docs i found regarding SQLite talk about DatabaseHelper. This means that database is created and filled from code.  I have a lot of data to place in my database during apk installation, and i don't want to keep useless data that serves only installation.  So my idea :   -write a file (e.g : .xml) with my my database tables contents (like 10000 lines for a couple of tables).  -At first launch (or during installation) init my database with that data file  -then delete that data file that is not needed anymore to free some "disk" space.  Is it a good idea?  Can we do it?  Or with other words, how to init a "big" database without using useless disk/memory space?  PS : i don't have any server to host a file ;)  EDIT : i'm not sure we can talk of duplicate as i'm looking for deleting temporary file just used during installation. if my database cost 10MB, why using: 10MB of bdd + 10MB of data file that served only once during installation? Duplicate question just talk about bdd init, not temporary init file.

If your application requires a database and it comes with built in data, what is the best way to ship that application? Should I:   Precreate the SQLite database and include it in the .apk? Include the SQL commands with the application and have it create the database and insert the data on first use?   The drawbacks I see are:   Possible SQLite version mismatches might cause problems and I currently don't know where the database should go and how to access it. It may take a really long time to create and populate the database on the device.   Any suggestions? Pointers to the documentation regarding any issues would be greatly appreciated.


I'm going to start a new campaign soon, and I thought it would be fun to scare my players in the first session by having them start the game falling from the sky.  The thing is, I don't wanna kill them in the very first session, but the only ways I can think of for a level 1 character to not take damage from a fall that high up is feather fall (no spellcasters), or that feature monks get until 4th level.   Should I just scrap that idea entirely?  I feel like there has to be a way of dropping them from that high up without killing them, but I also don't want to just have them conveniently fall on hay or something like that. I want them to be the ones to figure out how not to die, but I can't even figure it out myself.

The core question  What is a way for a 16th level character to avoid potentially fatal falling damage - but are not Feather Fall, Levitate, magic items that grant the properties of these spells, or the Monk's and Barbarian's class features (Slow Fall and Rage)?   The context  I am planning a short campaign in D&D 5e that starts out with my players imprisoned upon an airship. The airship gets attacked, and all passengers are hurled towards the ground from a substantial height (more than 3000 feet).   The details   These are 16th-level characters (because we want to do a high-level adventure). I won't tell my players that they "should" or "might take" magical starting equipment or spells that give them flying speed, etc. They are stripped of their equipment (because they were imprisoned, by even stronger characters). The fall should be lethal, if they do not intervene. I'm considering moving the damage cap for falling up for this very reason (I plan to use the "a creature falls 500 ft at the start of a round" rule). I want to avoid the "raging barbarian just fell out of the sky and just tanks the impact" scenario, if possible. I've modified the fall damage as follows: terminal velocity is about 150 ft/s IRL, about 80 in 5e under the "500ft per round or 6 seconds" rule, so I was thinking maybe 40d6 (a quarter of the max velocity in feet). Enough to potentially kill/make high-level players unconscious.   My current ideas are as follows:   The cargo from the ship - that contains their equipment, which they can recover later in the campaign - also includes Scrolls of Feather Fall. The scrolls are scattered in the air around them and can be grabbed and used. This has the caveat that Feather Fall is only on the Bard's, Sorcerer's, and Wizard's spell list, so if we don't have one player with this class, RAW they cannot read this scroll. A player could grab a sail from the airship and use it as a improvised parachute - this is probably far out of the rules, but I might rule this as a DC 20 Acrobatics or Athletics check? The players can attempt to fall into water, a lake or something similar. This will reduce their damage, but might still kill them.     I am looking for a solution that   works for (almost) all classes or   lets one player save the whole party or    somehow negates the fall damage otherwise


I am trying to get the post time of picture instagram by C#. For example i got the next string from the server (JSON):   {"created_time":"1447156299","text":".........} what is the time?

There is this example code, but then it starts talking about millisecond / nanosecond problems.  The same question is on MSDN, .  This is what I've got so far:  public Double CreatedEpoch {   get   {     DateTime epoch = new DateTime(1970, 1, 1, 0, 0, 0, 0).ToLocalTime();     TimeSpan span = (this.Created.ToLocalTime() - epoch);     return span.TotalSeconds;   }   set   {     DateTime epoch = new DateTime(1970, 1, 1, 0, 0, 0, 0).ToLocalTime();     this.Created = epoch.AddSeconds(value);   } }


Show $\limsup_{n\rightarrow \infty }(-a_{n}) = -\liminf_{n\rightarrow \infty }(a_{n})$ for a sequence $(a_{n})\subset\mathbb{R}$  Attempt: $\limsup_{n\rightarrow \infty }(-a_{n}) = \inf_{n\geq1 }(\sup\begin{Bmatrix} -a_{n},-(a_{n+1}),... \end{Bmatrix} )$  Now using the fact $-\sup(-A) = \inf(A)$ where $A\subset\mathbb{R}$  $= \inf_{n\geq1 }(-\inf\begin{Bmatrix} a_{n},a_{n+1},... \end{Bmatrix} )$ $= -\inf_{n\geq1 }(\inf\begin{Bmatrix} a_{n},a_{n+1},... \end{Bmatrix} )$  I would like to show $-\inf_{n\geq1 }(\inf\begin{Bmatrix} a_{n},a_{n+1},... \end{Bmatrix} )= -\sup_{n\geq1 }(\inf\begin{Bmatrix} a_{n},a_{n+1},... \end{Bmatrix} ) = -\liminf_{n\rightarrow \infty }(a_{n})$ but im not sure the previous inf(-inf) = -inf(inf) step is even correct.  Still trying to wrap my head around this concept!

Prove: $\displaystyle\liminf_{n\to\infty}(-a_n)=-\limsup_{n\to\infty}(a_n)$   My general idea was: if $a$ is partial limit (PL) of $a_n$, then $-a$ is a PL of $-a_n$ so it follows that $s$ is the maximal PL iff $-s$ is the minimal PL.   But how do you show it rigorously ?


Can I uninstall Windows 10 and go back to Windows 7? I am locked out of 10 at the login password screen. Even when I was in there, I could not download pictures from my camera to the laptop. I was crazy for installing it.

I joined in the  and I don't like it. However, this question may also be relevant to those who install the full version of Windows 10.  How can I downgrade back to Windows 8/7 from Windows 10 or Windows 10 preview?


I am new to Sharepoint and I am trying to troubleshoot a problem with importing  AD profiles on Sharepoint 2013  Anytime I run the 'User Profile Service Application' Job that is supposed to Synchronize the profiles, it fails shortly after and returns the error message:     Operation is not valid due to the current state of the object.   This system was previously working and I am picking up the responsibility with no knowledge in the way it was initially setup.  This issue been going for a couple months before I began to notice it and I am at a loss as to where to start troubleshooting.  EDITS:    -Another answer shared mentioned that when you are importing from AD, you may not need the FIM service;   -My Sync connection is setup and populates when queried.    If you need anymore information or have any ideas as to where I should start looking, please let me know.

I just found this morning that there are a lot of critical errors since 9/9/2015 in SharePoint, all of them being the Event ID 6398. Here's the error:  The Execute method of job definition Microsoft.Office.Server.UserProfiles.UserProfileImportJob (ID 9c4b1113-cc57-46e0-83c4-75c1c64f909a) threw an exception. More information is included below. Operation is not valid due to the current state of the object.  When I go see which job is causing this issue (with the id), it points right toward the User Profile Service Application - User Profile Incremental Synchronization job. And in fact, when I go see users in SharePoint, I can see that they're not up-to-date since about a week (surely since 9/9/2015). I tried to search for solutions, but they were more "Disable the faulty job" than anything else and I don't think disabling this job is a solution. I also found a solution that would be to restart the SharePoint Timer Service on the server, but I'm quite hesitant about this, since I don't know the impacts of restarting the service (even if I don't think it would cause any problem). I'm using SharePoint 2013 if it can be of any help. Is anyone ever faced this problem and maybe have a solution? Thanks.


The environment is:  \documentclass{beamer} \usepackage{xparse} \usepackage{expl3}   Or:  \documentclass{article} \usepackage{xparse} \usepackage{expl3}   Following is an accustomed command sequence, \pog, which is written with the two package commands, sparse and expl3, except the second line one that is merely for expressing question but not a affirmative command in term of certain package:   If documentclass={Beamer}{% if   }%if   {%if   }%if   The complete command: \pog  \NewDocumentCommand{\pog}{m o O{Detail} m m}{ %newCS If documentclass={Beamer}{% if \IfValueTF{#2}{ %if     \tl_set:Nn \l__hezilun_tmp_tl {#4}     \tl_case:Nn \l__hezilun_tmp_tl {%  case         \c_enum_tl { %c_enum_tl             \begin{frame}{#1}              \begin{columns}                 \begin{column}{0.5\linewidth}                     \begin{figure}                         \includegraphics[width=\linewidth]{pics/#2}                     \end{figure}                 \end{column}                 \begin{column}{0.5\linewidth}                     \begin{block}{#3}                         \begin{#4}                             #5                         \end{#4}                     \end{block}                 \end{column}             \end{columns}          \end{frame}         }%c_enum_tl          \c_desc_tl { %desc_tl                  \begin{frame}{#1}                     \begin{columns}                 \begin{column}{0.5\linewidth}                     \begin{figure}                         \includegraphics[width=\linewidth]{pics/#2}                     \end{figure}                 \end{column}                 \begin{column}{0.5\linewidth}                     \begin{block}{#3}                         \begin{#4}                             #5                         \end{#4}                     \end{block}                 \end{column}             \end{columns}         \end{frame}         }%desc_tl     }%case }%if {%if \tl_set:Nn \l__hezilun_tmp_tl {#4}       \tl_case:Nn \l__hezilun_tmp_tl {%  case         \c_enum_tl { %c_enum_tl                    \begin{frame}{#1}                         \begin{#4}                             #5                         \end{#4}                     \end{frame}         }%c_enum_tl          \c_desc_tl { %desc_tl                \begin{frame}{#1}                                             \begin{#4}                             #5                         \end{#4}                      \end{frame}         }%desc_tl     }%case }%if  }%if {%if     \tl_set:Nn \l__hezilun_tmp_tl {#4}     \tl_case:Nn \l__hezilun_tmp_tl {%  case         \c_enum_tl { %c_enum_tl             \paragraph{#1}                     \begin{figure}                         \includegraphics[width=\linewidth]{pics/#2}                     \end{figure}                        \subpragraph{#3}                         \begin{#4}                             #5                         \end{#4}             }%c_enum_tl          \c_desc_tl { %desc_tl                 \paragraph{#1}                     \begin{figure}                         \includegraphics[width=\linewidth]{pics/#2}                     \end{figure}                        \subpragraph{#3}                         \begin{#4}                             #5                         \end{#4}         }%desc_tl     }%case {% if }%newCS \ExplSyntaxOff

Is there a way to programmatically determine which document class is in effect?  I'd like to be able to write conditional macros that behave differently depending on which document class is currently being used.


First let's block all incoming / outgoing traffic.     vi /etc/sysconfig/iptables   *filter :INPUT ACCEPT [0:0] :FORWARD ACCEPT [0:0] :OUTPUT ACCEPT [0:0] -A OUTPUT -j DROP -A INPUT -j DROP -A FORWARD -j DROP COMMIT   Next: let's test ping  ping 8.8.8.8 PING 8.8.8.8 (8.8.8.8) 56(84) bytes of data.   at that point ping stalls.. perhaps will wait until times out.   Now let's disconnect the network interface and try again:  ping 8.8.8.8 connect: Network is unreachable   beautiful, it stopped instantly. ( no stalling or waiting for time out )  Some recommended using "REJECT" in the iptables-rules and even play with the -j REJECT --reject-with flags..  I have tried them all. there is no way to send the same signal the kernel is sending to the program when the network interface is disconnected. ( via iptables )  This is what I want to do for now:     figure a way to ensure Kernel tells ping that network is   disconnected.    ( or run a command in another terminal manually to send such a signal )   this way ping will not stall. it will simply say  connect: Network is unreachable   and stop.  Can it be done & how ?

Fist let's block all Incoming, Outgoing signals  via iptables.     vi /etc/sysconfig/iptables   *filter :INPUT ACCEPT [0:0] :FORWARD ACCEPT [0:0] :OUTPUT ACCEPT [0:0] -A OUTPUT -j DROP -A INPUT -j DROP -A FORWARD -j DROP COMMIT   start iptables:   service iptables start   My Ethernet Cable is plugged in. let's try something via terminal  ping 8.8.8.8 PING 8.8.8.8 (8.8.8.8) 56(84) bytes of data.   that is all. just 1 line. after that it stalls. clearly iptables is blocking it successfully  now I am going to disconnect my Ethernet cable. my internet is disconnected.  let's try it again:  ping 8.8.8.8 connect: Network is unreachable   this time .. instantly.. it returns that message.  Clearly, weather it is "ping" or any other program.. it is determining if a network interface is up or not before it executes it's internet command.  of course soon as it executes.. it is not able to pass through iptable rules. but what seems evident is.. it does not first consult to the iptables..  it first checks to see if a network interface is connected or not.   I would like to figure out how I can manually let it know that network interface is connected.  in other words unless I tell it network interface is up.. it should simply behave the same way it behaves when network interface is not connected ( when the ethernet cable is not plugged in)  how can this be done ?


I have an Android app installed on tens of thousands of devices that includes two different automated crash reporting libraries. There have been numerous NullPointerException reports with the output below on a variety of devices. The exact TelephonyManager.java line number referenced varies, likely due to minor differences in Android releases; however, all impacted devices are running Android 10. Some users have reported observing this same error in logcat output after a crash, identical to what is reported by the two libraries. Users are unable to determine a pattern of events that leads to the crash. I have not been able to duplicate it myself. java.lang.NullPointerException: Attempt to invoke virtual method 'java.lang.Throwable android.os.ParcelableException.getCause()' on a null object reference     at android.telephony.TelephonyManager$1.lambda$onError$2(TelephonyManager.java:5352)     at android.telephony.-$$Lambda$TelephonyManager$1$DUDjwoHWG36BPTvbfvZqnIO3Y88.run(Unknown Source:6)     at android.os.AsyncTask$SerialExecutor$1.run(AsyncTask.java:289)     at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1167)     at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:641)     at java.lang.Thread.run(Thread.java:919)  Unfortunately, the output does not reference any of my app's classes. The most useful clue appears to be that TelephonyManager line number, but that is such a large class with so many versions depending on the exact Android release, I have not been able to identify the actual code it is referring to. How can I diagnose what is causing this exception with such a vague error message, with no reference to any of my app's code? I realize it is a NPE related to TelephonyManager, but it seems like the actual error might be pointing to the exception routine itself, as if the OS is unable to determine the true exception.

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


So currently I am starting to work on a 2d top down space shooter game, and I have just got to networking. So far the client can draw a ship at a desired x, y and rotational coordinate with any set of vertex data (referenced from pre-existing vectors of data). The problem I am having is just the main idea of how the game loop should revolve around the networking. My idea was have each loop of the game set to 1000/60ms, and then ask the server for some data, render it and sleep for the remaining time in the frame. Problem with that is that I realised a normal ping to a game server is around 100ms, meaning the game would only be getting around 10fps. The solution I assume is to only receive events 10 times a second versus the 60 refreshes the game is getting, but how would you render and be polling to receive data at the same time? Finally I am using enet as the networking library if anyone is interested because it seems to be pretty simple in its concept, but if there is a better one for this type of game out there it would be nice to know. (I did try googling all of this stuff but its kind of hard to describe exactly what I am confused about, so thanks for any help).

We are making a multipler first person shooter. The client sends it's position to the server at a fixed rate (currently at 10Hz). The server sends a single message contatining all player's positions to all players at the same rate (10Hz).  As expected, the movement is pretty choppy since the 60fps game is only recieving updates 10 times a second. What is the best way to smooth this movement? The most obvious way would be to interpolate between the last two packets, so that the interpolation finishes as we recieve a new packet. But this adds an instant 100ms delay for all players.  The other way would be to use the velocity and acceleration inferred from the last few packets to predict where the player is before the next packet arrives, however if the prediction is wrong, the player would tend to jump as soon as a new packet is recieved.  Does anyone know how AAA titles solve this problem?


I tried asking general high level (newb-ish) questions about the ESP8266's firmware, how it works, Arduino IDE, sketches in general at Arduino Stack Exchange but was told it was off-topic. I think the IoT site doesn't seem like the right place either and Arduino Stack Exchange seemed like the most relevant to me. Which site should I post this question?  Does flashing ESP8266/ESP-01 firmware mean uploading a new 'sketch' and why different firmware? Hi, I am new to IoT and I am now in love with this. However I'm a little confused right now with the jargon. My question is similar to . But I do have some extra questions though.  When using ESP as standalone microcontroller, and if I uploaded a sketch written on the Arduino IDE, does that count as 'Arduino firmware' other people are referring to?  On the Arduino IDE, uploading sketches onto the ESP8266 seems easy by just installing extra libraries from Board Manager and selecting the right board. Is this step equivalent of doing this but for different firmwares such as AT, NodeMCU and Micropython?  For the NodeMCU dev boards, is the default firmware on the module NodeMCU firmware? If I were to use the Arduino IDE to upload a sketch, does that mean I have overwritten the NodeMCU firmware with my custom 'Arduino firmware' sketch?  To the extent of my knowledge, when using NodeMCU firmware, I would need to code in LUA language using some sort of LUA IDE and if I flashed/uploaded micropython I would need to code in micropython using exclusively the Thonny IDE. And there is no way to code in micropy or LUA from the Arduino IDE.  Is the reason for using other firmware is because of how the code is compiled and the language used?

I came across the following question:    This can be easily flagged for too broad or opinion based, but I wonder on which stack-exchange site can one ask answers for such a question?


In my math class, we understand how to work problems with imaginary numbers in them, but do not understand the purpose or reasoning behind them.

I've always enjoyed solving problems in the complex numbers during my undergrad. However, I've always wondered where are they used and for what? In my domain (computer science) I've rarely seen it be used/applied and hence am curious.  So what practical applications of complex numbers exist and what are the ways in which complex  transformation helps address the problem that wasn't immediately addressable?  Way back in undergrad when I asked my professor this he mentioned that "the folks in mechanical and aerospace engineering use it a lot" but for what? (Don't other domains use it too?). I'm well aware of its use in Fourier analysis but that's the farthest I got to a 'real world application'. I'm sure that's not it.  PS: I'm not looking for the ability to make one problem easier to solve, but a bigger picture where the result of the complex analysis is used for something meaningful in the real world. A naive analogy is deciding the height of tower based on trigonometry. That's going from paper to the real world. Similarly, what is it that is analyzed in the complex world and the result is used in the real world without imaginaries clouding the problem?  The question:  is nice but covers a more mathematical perspective on interim results that make solving a problem easier. It covers different ground IMHO.


I have some wonders about 127.0.0.0/8 network and have 2 question about it.  Firstly, why 127.0.0.0/8 is not considered as private network? I wonder this because  does not mention about it. Where 127.0.0.0/8 differs from other private networks?  Secondly, I realized I can send ping successfully to all IP addresses in 127.0.0.0/8, just like lo interface has all this IP addresses. What is the technical reason of this case?

From my understanding, all IP addresses of the form 127.x.y.z are loopback addresses. Now that seems to be quite a waste to me; indeed, already more than one address seems like a waste.  Is there any use in having so many loopback addresses?


#include<stdio.h> int main() {     int a=2;  if(a==3,4)   printf("hello"); return 0; }   Warning: Condition is always true  Why is it always true??


My MainActivity.class is invoking putExtra towards SecondActivity.class via setOnClickListener  Intent intent = new Intent(MainActivity.this, SecondActivity.class); intent.putExtra("sentString", stringName); startActivity(intent);   SecondActivity.class setOnClickListener  //    Recieve the extra sent from MainActivity.class Intent SecondActivityIntent = getIntent(); String mString = SecondActivityIntent .getExtras().getString("sentString");  //    Send extra to another activity ThirdActivity.class SecondActivityIntent.putExtra("sentString", mString); startActivity(SecondActivityIntent);    ThirdActivity.class setOnClickListener  //    Recieve extra from SecondActivity.class Intent thirdActivityintent = getIntent(); String mString = thirdActivityintent.getExtra().getString("sentString"); //    This time I am calling SecondActivity.class but I will not send extra thirdActivityintent = new Intent(ThirdActivity.this, SecondActivity.class); startActivity(thirdActivityintent);   ThirdActivity.class is causing an      'java.lang.String android.os.Bundle.getString(java.lang.String)' on a null object reference   what does this error mean? Is it because SecondActivity.class is expecting to get an extra from any calling activity? I don't intend to putExtra on ThirdActivity or am I force to. How can this be solve?