Where do computers/servers in a Windows Domain get their time settings from?
Setting NTP on Windows 2008 Domain
Are if and whether equivalent in sentences like the ones below?     How to determine if my saddle is too high?   How to determine whether my saddle is too high?         We should check if everything is okay now.   We should check whether everything is okay now. Plurals of acronyms, letters, numbers — use an apostrophe or not? When I was in high school back in the 1970s, I was taught that to make a plural of an acronym, a letter, or a number, one should add an apostrophe and "s". Like I would have written this sentence, "... back in the 1970's ..." I would write "one CD, two CD's". Etc. I followed this rule faithfully for years until a co-worker told me it was wrong. Now I can't find any source that agrees with what I was taught.  Is this a rule that has changed over time? Was the convention in the 70s that one should use an apostrophe but this has changed and now we do not? Or were my high school English teachers just confused? Integration of $\int\frac{1}{x^{4}+1}\mathrm dx$ How do you handle uneven tiles while rendering a tile map? Here is what I want to do with my tile map that I am unsure of. As you can see the top walls are way larger then the bottom and side ones (this is also an issue with my corners which are odd shapes [more like an L then a square] as well as larger then the 40x40px that my current tiles are).    I have also attached the tile sheet I am using for the tiles to show you what the corners and tops look like compared to the rest of the tiles.  What I’m thinking is I might be able to just draw them using the same array I have if I use the tiles width and height instead of a set WxH? I dont know how well this will work, but were the blocks that will have different values will be blocks the player/NPCs can’t step on then it may not be an issue, again I’m not even sure if that is a viable solution.  My code in case you want to see how I'm currently handling it:  (pastebin) (edit:im not handling it, meant how I'm currently doing the map)  tl;dr - how can I take take my 2d looking tile map and change it to have different size tiles? or is there a better way to do what I am trying to do? Is there a name of a method that I should be looking for while googling? I want players to be able to click text to run an OP command even if that player is not an OP. For example something like:  Console: Do you want to enable Fly? [If you do, Please click here]  *Player1 clicks that text*  Console: /fly Player1   Is something like this possible? The use of the Axiom of Choice in this proof of the sequence lemma Formula for coordinates (lat, lon), azimuth and distance. I would like to know how to find a set of coordinates on a small circle some distance from another point.   For example, lets say A = (39.73, -104.98) #Denver  B = (39.83, -106.06) #point approximately 50 nautical miles away from A along the great circle track to C  C = (40.75, -111.88) #Salt Lake City, approximately 323 nautical miles away from A  How do I get the set of orange coordinates when I don't know the angle but I do know the cross track distance?  For concreteness, lets say the outer points near B have a cross track distance of +- 30 nautical miles and the inner points have a cross track of +- 15nm.  And the points near C have a cross track of +- 25 nm.  Also I have an initial bearing from A to C of -1.34 #radians What licence is subscriber content provided under 4.0, 3.0 or them all? In the footer it says:     site design / logo © 2018 Stack Exchange Inc; user contributions licensed under  with . rev 2018.8.7.31273   However, in the footer under Company > Legal > '6. Content Permissions, Restrictions, and Creative Commons Licensing' it instead doesn't specify which CC BY-SA licence we're releasing our content under. It also links to the CC BY-SA 4.0 license:     The CC-BY-SA Creative Commons license terms are explained in further detail by , but you should be aware that all Public Content you contribute is available for public copy and redistribution, and all such Public Content must have appropriate attribution.   Since  if subscriber content is only provided under 4.0, where the footer says 3.0 it can cause users to break the licences.  The footer under Area 51 also mentions that content is licensed under CC BY-SA 2.5.  Since it's not defined which version of the license the content is provided under, I also interpret it to potentially mean all the versions.    What license is subscriber content licensed under? De Rham Cohomology of the tangent bundle of a manifold I would like to compute the de Rham cohomology of the tangent bundle $TM$ of a manifold $M$. It seems to me that we can just homotopy each fibre to a point, and that this would give a homotopy equivalence between $TM$ and $M$. Since de Rham cohomology is a homotopy invariant, this would imply that $H^*_{\text{dR}}(TM) \cong H^*_{\text{dR}}(M)$.     Is it always true that the tangent bundle of a manifold is homotopic to the manifold itself by the homotopy of each fibre with a point? Set Snap Mode with PyQGIS I am trying to set snap mode within QGIS plugin.  So far, I have tried:  QgsSnappingUtils().setSnapToMapMode(QgsSnappingUtils.SnapAdvanced)   and  QgsSnappingUtils().setSnapToMapMode(2)   without success.  QGIS Snapping options (Settings>>Snapping Options...) continue with:  Snapping mode = Current layer  Any hint? (Using v 2.14.0) Does JavaScript have the interface type (such as Java's 'interface')? Boliviana de Aviacion (BOA) tariff codes I am trying to book one-way tickets on BOA on Jan 13 2015 from La Paz (LBP) to Buenos Aires (EZE) from their website.  Their website asks me to make a choice between 7(!) different tariff codes - they are SSEEOB, QEEOB, TMEEOB, VEEOB, HEEOB, BEEOB, YOW. The prices are different for every tariff, but other than that I cannot see any obvious difference and there is no explanation available. Also I am unable to find anything useful on their website  Could anyone from Bolivia or familiar with BOA explain what is going on there and what choice am I supposed to make? Subdivision surface modifier creates pinching at corners I've only been 3D modelling for a few days now, so this may just be a newbie mistake:  However, because this model is for use in a game I am trying to stay away from proximity loops for performance reasons. Instead, I have used edge creases to maintain the structure of the model. It has led to certain vertices not being affected by the subsurf modifier, causing undesirable lighting at high subsurf levels.  Manually moving each point in a bit seems kind of sloppy but I'm not too sure what the best way to go about this is.  If any more information is needed I'll give what I can, thanks in advance :) proving logical equivalence $(P \leftrightarrow Q) \equiv (P \wedge Q) \vee (\neg P \wedge \neg Q)$ I am currently working through Velleman's book How To Prove It and was asked to prove the following  $(P \leftrightarrow Q) \equiv (P \wedge Q) \vee (\neg P \wedge \neg Q)$  This is my work thus far  $(P \to Q) \wedge (Q \to P)$  $(\neg P \vee Q) \wedge (\neg Q \vee P)$ (since $(P \to Q) \equiv (\neg P \vee Q)$)  $\neg[\neg(\neg P \vee Q) \vee \neg (\neg Q \vee P)]$ (Demorgan's Law)  $\neg [(P \wedge \neg Q) \vee (Q \wedge \neg P)]$ (Demorgan's Law)  At this point I am little unsure how to proceed.   Here are a few things I've tried or considered thus far:  I thought that I could perhaps switch some of the terms in step 3 using the law of associativity however the $\neg$ on the outside of the two terms prevents me from doing so (constructing a truth table for $\neg (\neg P \vee Q) \vee (\neg Q \vee P)$ and $\neg (\neg P \vee \neg Q) \vee \neg (P \vee Q)$ for sanity purposes)  I can't seem to apply the law of distribution since the corresponding terms are negated.  Applying demorgans law to one of the terms individually on step 2 or 3 doesnt seem to get me very far either.  Did I perhaps skip something? Am I even on the right track? Any help is appreciated Callback after the record was created using e.force:createRecord Are there a way to add callback after the user created a record and clicked the Save button?  I am using a custom tab and custom components and open the Create a record modal window using e.force:createRecord, but I was not able to find out how to attach callback to the event.  I even found :     Currently force:createRecord event does not accept any callback method or any after save event to handle custom action. Current force:createRecord always redirects to the newly created record. But in case if you want to just close the force:createRecord popup after save and refresh some other related component using the refresh is not possible.    So, is it really impossible? If so, what are current workarounds here? Let $L$ denote the set of all lines in the Euclidean plane $\Bbb R^2$. We say that two lines $L$ and $M$ are parallel if either $L = M$ or $L$ and $M$ have no points in common.  Using Euclid’s Parallel Postulate prove that parallelism is an equivalence relation on the set $L$.  I need some help determining if I have the right idea about this.  $L=L$ which means that $L$ is parallel to itself. So this is reflexive.  Suppose we have $L || M$. Then Either $L=M$ or $L$ and $M$ share no points. So Then $M=L$ or $M$ and $L$ share no points. Then $M||L$. So this is symmetric.  Suppose we have $L || M$ and $M || N$. So then either $L=M$ or $L$ and $M$ share no points and either $M=N$ or $M$ and $N$ share no points. So we have that either $L=N$ or $L$ and $N$ share no points. So $L || N$. So then this is transitive.  So from all of this, parallelism is an equivalence relation. I'm not sure if this is correct or not. Any help would be appreciated. When does the amount of skew or prevalence of outliers make the median preferable to the mean? I know that "deviations in the data are devil", and when the distribution is highly skewed, it is better to consider median as average rather than mean, but how to decide these hard-limits.  For example:   CASE 1:   Assume X = 10,20,30,40,50,60,70 In this case, I think that it is better to use mean and that it will give very accurate results.  CASE 2:   Assume X = 10,20,30,40,50,60,70,7000 In this case, I think that it is better to use median instead of using the mean.  CASE 3:    Assume X = 10,20,30,400,500,600,700 In this case, I think it is better to use IQR (Inter Quartile Range)    But I'm stuck with how to decide these hard-limits i.e. which to use in which condition, in general.   I've found a tool working on subjected principle, which takes context-less sample-distribution as input and determines whether mean is close/moderate or against the null-hypothesis.  Find References:-     (For Mean Test)  (For Median Test)   What I'm really looking is a good answer which states how to derive these conclusions. Questions on "All Horse are the Same Color" Proof by Complete Induction I'm bugged by the following that's summarized on p. 109 of .     False theorem: All horses are the same color.      Proof by induction:      $\fbox{$P(n)$ is the statement: In every set of horses of size $n$, all $n$ horses are the same color.}$   $\fbox{Base Case or $P(1)$:}$ One horse is the same color as itself. This is true by inspection.   $\fbox{Induction Step:}$ Assume $P(k)$ for some $k \geq 1$.   $\fbox{Proof of $P(k + 1) :$}$   Since $\{H_1, H_2, ... , H_n\}$ is a set of $n$ horses, the induction hypothesis applies to this set. Thus, all the horses in this set are the same color.   Since $\{H_2, H_3, ... , H_{n+1}\}$ is also a set of $n$ horses, the induction step likewise holds for this set. Thus, all the horses in this set are the same color too.         Therefore, all $n +1$ horses in $\{H_1, H_2, H_3, ... , H_n , H_{n+1}\}$ are the same color. QED.   The issue the instructor was trying to point out is clearly valid. For the case $n = 1$, there is only ${H_1}$. So this case says nothing about possible overlapping elements of each set of $(n + 1)$, for instance $H_2$ in the above proof.    But it was proposed in the class discussion that this was the only problem. Had you been able to prove $P(2)$ true, then a proof of the above format would have been fine.    My interpretation is that yes, you could prove all horses are the same color, if you can prove that any set of two horses will be the same color. But this format would not work.  Why not? The problem I see is that the above proof is for the existence of at least one particular pair of sets of horses of sizes $n$ and $n + 1$, such that in each set, all horses are the same color.  Particularly when the set of size $n$ is a subset of the set of size $n + 1$.  In order to prove the induction step, don't you need to prove that sets of sizes $n$ and $n + 1$, do not necessarily contain the same, overlapping elements?  You could prove that any horse can be added to a set of 2 horses.  Take the last two, and they must be the same color, and so on.  Wwhatever color the first two happen to be, all other horses must thus be the same color.    Am I misinterpreting the example, or am I making a logical error? Thanks in advance. Suppose $R\neq 0$ is a commutative ring with $1$. Let $M$ be a free $R$-module. I would like to prove that $M$ is a flat $R$-module. Everywhere I have looked (mostly online) this is proved by first proving that every free module is projective, and then proving that every projective module is flat. Unfortunately, Atiyah &amp; Macdonald's "Introduction to Commutative Algebra" (Chapter 2) does not discuss projective modules. But the result that every free module is flat comes very handy in the exercises.   So my question is,     Is it possible to prove that every free module is flat just by   definitions and without appealing to projective modules?   Thanks! How to make a WMS GetFeatureInfo request in Leaflet? I am trying to make a WMS GetFeatureInfo request using Leaflet. I can not find something in the documentation to describe this process. Can you please provide with an example demostraing how to do something like this?