how to know the position of the first(left -> right) '1' bit in a char efficiently

Just like the title said, I have a char (e.g. 00101011), how can I know the position of first   '1' bit in it? (in this case, it is 6, or 5 if we consider the rightmost position is 0). I know a for-loop shift would be helpful, but is there a more efficient way?


Is it okay to say "easier" after a verb?

Is it correct to write 'browse easier' and 'search easier'? When I use my Word grammar check, it doesn't correct them. Edit: Perhaps I shouldn't have mentioned the grammar checker at all. I was looking for verification that the terms above were incorrect. I didn't want to write the following letter until I was sure. After reading your responses here, I sent it. In case you're curious, here it is: Hello XXXXXXXX, I am a XXXXXXXX customer who just received your letter promoting the new XXXXXXXX. I'm happy to learn about the changes that are coming. I'm writing because your letter says, "Browse easier" and "search for the shows and movies you love easier". 'Browse more easily' and 'search... more easily' are the way to write those sentences. Perhaps this was an honest mistake because no one who read the letter before it got mass-mailed knew better. In that case, please disregard this e-mail; (you may want to hire a better proofreader.) I'm writing in case XXXXXXXXXX knew it was incorrect but thought its customers needed words to be simplified to the point that they are wrong. We are not stupid. Most of us have an elementary level education, and therefore are familiar with adverbs. Wrong is not more attractive, ie. (XXXXXXincorrectly spelled product nameXXXX), it's just wrong. In the case of customers like me, it actually makes the company sending the letter less attractive.  Just a thought, (Signed)


Hand cursor is missing for "full site" link in mobile web footer

The hand cursor is missing for the full site link in the footer of mobile-web view. For other links the hand cursor is showing properly.  Recorded the same as gif:         While inspect the element I see the <a href is applied for the remaining links. For full site link onclick event is applied.  contact us full site


I was playing with extension functions and tried to do binarySearch function on lists. And I realized that there is an extension function already that is builtin in Kotlin. However, it is very slow: -  public fun <T: Comparable<T>> List<T?>.binarySearch(element: T?, fromIndex: Int = 0, toIndex: Int = size): Int {      rangeCheck(size, fromIndex, toIndex)       var low = fromIndex      var high = toIndex - 1       while (low <= high) {          val mid = (low + high).ushr(1) // safe from overflows          val midVal = get(mid)          val cmp = compareValues(midVal, element)           if (cmp < 0)              low = mid + 1          else if (cmp > 0)              high = mid - 1          else              return mid // key found      }      return -(low + 1)  // key not found }   I have edited the function and removed the function call (compareValues) and the replacement function is way faster   test_buildin_binary_search         8s35m test_binary_search           584ms   ^based on my test I will attach it down.  the new one: -  fun rangeCheck(size: Int, fromIndex: Int, toIndex: Int) {     when {         fromIndex > toIndex -> throw IllegalArgumentException("fromIndex ($fromIndex) is greater than toIndex ($toIndex).")         fromIndex < 0 -> throw IndexOutOfBoundsException("fromIndex ($fromIndex) is less than zero.")         toIndex > size -> throw IndexOutOfBoundsException("toIndex ($toIndex) is greater than size ($size).")     } }  fun <T : Comparable<T>> binarySearch(list: List<T?>, element: T?, fromIndex: Int = 0, toIndex: Int = list.size): Int {     rangeCheck(list.size, fromIndex, toIndex)      var low = fromIndex     var high = toIndex - 1      while (low <= high) {         val mid = (low + high).ushr(1) // safe from overflows         val midVal = list.get(mid)         val cmp = element?.compareTo(midVal as T) as Int          if (cmp < 0)             low = mid + 1         else if (cmp > 0)             high = mid - 1         else             return mid // key found     }     return -(low + 1)  // key not found }   It is not an extension function so far. But I believe that the inside function call is the reason of making it slow.  Q1. why compareValues is not an inline function? maybe due to design decisions? where it is not always a good idea to inline it?  Q2. Is there a keyword that gives the programmer the freedom to inline function "f1" for example where f1 is not inline function?  I mean why there is no keyword like "inlineit" and it is used as: -   fun f1() {     println("something")  }   fun main() {      inlineit f1() // line 1      f1() // line 2  }   Where in this case f1() will be inlined only when we use the keyword inlineit in front of its name, in above code f1() in line 1 is inlined but in line 2 is not.  The junit test: -  class BinarySearchTests() {     private val max = 10_000_000     private val times = 10_000_000     private val largNumbers = (0..max).toList()     private val r = Random(System.currentTimeMillis())      @Test     fun test_binary_search() {         var found = false          repeat(times) {             val item = r.nextInt(max)              val r = binarySearch(largNumbers, item)              if (r != null) found = true         }          assert(found)     }       @Test     fun test_buildin_binary_search() {         var found = false          repeat(times) {             val item = r.nextInt(max)              val r = largNumbers.binarySearch(item)              if (r != -1) found = true         }          assert(found)     }  }   Thank you


Is the use of semicolon applicable anywhere in this sentence?

Here's the sentence -      On further statistical analysis, these benefits were found to be both   short term (0-30 days) and long term (31-360 days) and in both STEMI   and UA/NSTEMI patients, irrespective of whether PCI was done or not.   I was tempted to write this sentence in the following way:     On further statistical analysis, these benefits were found to be both   short term (0-30 days) and long term (31-360 days), and in both STEMI   and UA/NSTEMI patients; irrespective of whether PCI was done or not.   Any thoughts on what the right way is?


is there any way i can replace the text in this pattern #abcd# to #{abcd} in notepad ++?

Im trying to replace the this pattern #abcd# to #{abcd} in notepad++, is there anyway i can make use of search and replace option in notepad++ for this


Comma rule with 'however' - is this pedantry?

I have seen, on the website of an illustrious university, the use of 'however' which I always thought to be wrong. It is used twice in the same way, which makes me think it isn't a typo.  Changing the context a little, the sentence is:     You are not required to take exams for this subject, however coursework is continually assessed.   The rule for the punctuation as I know it is:  [...]. However, [...] (We didn't study. However, we passed.) [...]; however, [...] (We didn't study; however, we passed.) [...], however, verb [....] (We didn't study. We, however, passed) [...], however. (We didn't study. We passed, however.)  The only time this isn't true is when 'however' means 'no matter how' (We will not pass however hard we study.)  My question is this: Is the website wrong, or has this punctuation usage now moved on enough that it is now seen as somewhat pedantic to worry about it if the meaning is clear?  There are numerous answers on the site about the standard rule, and this is not exactly my question. I would like to know if anyone is aware of a shift in modern usage that would mean publishers, editors etc. nowadays accept the removal of the superfluous punctuation if the meaning remains clear.


let $f$ be a function of bounded variation on a closed and bounded interval $[a,b]$.then $f$ is measurable.  the proof is as follows: let $f$ be a function of bounded variation on a closed and bounded interval $[a,b],$ then by Jordan's theorem , $f$ is the difference of 2 increasing functions on $[a,b].$  EDIT: I found the proof here:


How to find angular distance between points?

I have the following problem. I have several points on the plain, and there is another point somewhere in the middle of them. The goal is to find angular distance between any two points.  My only thought so far is to draw a line between a central point and all the lines from the central point to all the others and see where these lines intersect the circle. If we shift the coordinates to make central point (0,0), then it becomes  x² + y² = 1 y = m*x  (m is trivial to calculate here)  x² + (m*x)² = 1  (1+m)(x²) = 1  x = ±sqrt(1/(1+m))  plus/minus is trivially resolved by seeing where the original point was in relation to the centre.  y = m*x  (Of course if the points are in vertical alignment m is undeterminant, but that is trivially resolved by setting x=0 and y to either 1 or -1).  Then i can easily through pythagorean distance find the distance of these points on the circle. But something tells me that there must be a much easier way to turn all these into a single value as projections on a circle.


NullReferenceException in Swipe Controller Script

I am Getting a Exception in My Swipe Controller Script name Dot.Here is the Code  using UnityEngine;   public class Dot : MonoBehaviour  { private Vector2 firstTouchPosition; private Vector2 finalTouchPosition;  public float swipeAngle =0; // Start is called before the first frame update void Start() {     firstTouchPosition = new Vector2(0,0);     finalTouchPosition = new Vector2(0,0); }  // Update is called once per frame void Update() {  }   void OnMouseDown() {     firstTouchPosition = Camera.main.ScreenToWorldPoint(Input.mousePosition);      Debug.Log(firstTouchPosition); }  void OnMouseUp() {     finalTouchPosition = Camera.main.ScreenToWorldPoint(Input.mousePosition);     Debug.Log(finalTouchPosition);     CalculateAngle(); }  void CalculateAngle() {     swipeAngle = Mathf.Atan2(finalTouchPosition.y - firstTouchPosition.y, finalTouchPosition.x - firstTouchPosition.x)*180/Mathf.PI;     Debug.Log(swipeAngle); }  }     Please Tell ME What Im Doing Wrong.


Why isn’t the integral of $x^2$ from $0$ to $5$ equal to the integral of $\sqrt x$ from $0$ to $25$?

My calculator says that the former is 41.67, and that the latter is 83.34. Why is that? Shouldn’t they be equal?


How can I remove unwanted CSS found in the parent theme?

I'm working on a sub-theme of Bootstrap Barrio, which includes a table.css stylesheet. I don't want this stylesheet from the parent theme to be included in my sub-theme.   How do I eliminate a CSS file from sub-theme's parent?


I observed the word "darkweb" in newspapers of late, and wondered if it is one word or two words. I could not get a definite answer when I did a Google search. No one seems to have addressed this issue. Now, my specific question is, which is acceptable usage? - "darkweb", "dark-web" or "dark web"?


I did a VF page, to show a message. how can I resize it to fit full component? thank you!  this is the code I have.


I need  to use the less command with the syntax highlighting of the vim command for python, C, bash and other languages.  How do I apply syntax highlighting colors according to vim colors for less command?


Java support for  "(?pattern)" in patterns

I was wondering if Java had an equivalent to C#’s named pattern matching.  For example, in C# I can do something like this:  var pattern = @";(?<foo>\d{6});(?<bar>\d{6});"; var regex = new Regex(pattern , RegexOptions.None); var match = regex.Match(";123456;123456;");  var foo = match.Groups["foo"].Success ? match.Groups["foo"].Value : null; var bar = match.Groups["bar"].Success ? match.Groups["bar"].Value : null;   This just seems like a clean way to grab groups.  Can Java do something similar, or do I need to grab groups based on index position?  String foo = matcher.group(0);


Open "similar questions" links in a new tab

When I ask a question, a sidebar appears on the right suggesting me questions similar to mine. Often, halfway through writing a question, an interesting suggestion pops up and I want to quickly check whether that question has an answer that might help me and save a duplicate for the site.   I think that it would be more convenient if those links opened in a new tab, because often I want to just open the question, look at it, realize it's of no help, close it and return to writing my question, or maybe keep both open and compare the two. As it is right now, each time I click on one of those links my browser asks me if I'm sure that I want to leave the page, unless I right click and select "open in a new tab".  For example, on Physics SE there is an additional list, "questions that might already have your answer", that already opens link in a new tab and I find it much more convenient.  I know it's a minor issue and I might as well right click, but I wanted to ask whether other users feel it would be better this way.  EDIT: to make things more clear, I'm aware of the other instances of similar questions linked by Monica Cellio in the comments. My point was that, for example, on Stack Overflow, this feature is already implemented in this list     and in Physics SE in this list    I'm not sure about other sites. It is convenient because one can quickly check the content of multiple question for comparison with their own, while the site wide "similar questions" list does not do that


I see that the latest Wireshark has been release. I would like to have it since it has some features that I need.    Unfortunately, if I use sudo apt-get install wireshark the newest version I got only 3.0.5.  How can I install the lastest one ?


What makes a tag "meta" and are such tags inappropriate?

Apparently I inadvertently irked a moderator by creating a tag.  The moderator told me that my tag was "meta" and therefore not appropriate.  Having been a SO user for a long time (and a lurker on MetaSO), it was not clear to me what makes my tag "meta" and why meta tags would be inappropriate.  Many of the questions I see on SO aren't really about the topics in the title or the existing tag list.  For example, , isn't really about C++ or SetWindowText (or the Windows API as tagged).  It's simply somebody who had a bug, couldn't find it, and tried to outsource the debugging.  This seems to be a common category of question on SO.  So I started tagged questions like this with the label "findmybug".  Lots of frequent SO contributors regularly answer questions in this category rather than voting to close them as "Too Localized".  I took that as a cue that I should also try to answer rather than voting to close.  But leaving these questions open and tagged with "c++" and "winapi" even though the question isn't really about C++ or the Windows API seemed misleading.  Someone searching for answers on using SetWindowText from C++ probably isn't making exactly the same mistake and won't find that entry useful.  (In the end, the sample question was closed as "Too Localized", but this doesn't seem common for these types of questions.)  The Tags page says:     A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.   It seems to me that the "findmybug" tag does group these similar questions together.  So from that perspective, it seems to fit.  Lots of users seem to enjoy answering these types of questions, so it makes sense they'd want a way to find them.  If you want to suggest that all the questions I would tag as "findmybug" should be closed as "Too Localized", that's fine.  But I'm trying to ask the more general question:  What makes a tag meta, and are meta tags inappropriate?


How to compile the kernel with debug symbols?

I've already finishing compiling the kernel from source,  but how to compile it with debug symbols,what additional steps to I need to take?


Add some bottom padding to code snippets

Currently it's impossible to see the bottom line of code snippets because the horizontal scroll bar is positioned over the top of them ():    Please could you add some bottom padding so that it's possible to view the last line of code snippets?  Unlike  which is a support question with a workaround answer, this is a feature request suggesting a clear action hence not a duplicate.


I started off with changing to the folder I want to change permissions for, and that is the opt folder.  $ cd /opt/ test@testVM:/opt$   So I tried changing the permissions for this folder now using:  sudo chmod 775   And that hasn't worked. It showed this message:  Try 'chmod --help' for more information.   There is something I am forgetting or leaving out.  Please can you show me what I am doing wrong?  Thanks in advance.


is it possible to dual boot Ubuntu on Ideapad s540 or Thinkbook 15 OR simply are these both Ubuntu compatible versions?

I would like to buy Lenovo IdeaPad s540-151ml with following specification available in my region core i7 10510uu 1.8ghz 8gb ram DDR4 1tb + 128SSD 15.6 FHD IPS nvidia mx250 2gb Genuine Windows 10 But before all, I need this laptop to mainly running Ubuntu latest version where I will be mostly working on in future. So would like to know will this be compatible for running Ubuntu first of all. Also, I can go with Thinkbook 15-ml with following specs. core i7 10510u 1.8ghz 8gb ram DDR4 1tb 15.6 FHD RADEON 620 2gb DOS if that is best suitable for running Ubuntu distributions. BS: I am a software developer working on both the OS and I need a laptop for hard-use not just for entertainment. Mainly I can't afford a Thinkpad. And so far I have seen some reported compatible issues with Lenovo Ideapad s540 when it comes to supporting Ubuntu on the internet. Please help me out on this prior to buying a laptop Regards


Let us assume $<x_n>$ is a convergent sequence, and it converges to L. Now consider the sequence $<S_n>$: $\frac{1}{n}\sum_{j=1}^{n}<x_j>$ Does it converge to L as well? My idea is that, as n can be infinitely large, I can always make $x_n$ closer to L; I have n elements in the sum, so $S_n$ must converge to L. But I can’t formalise it. Could someone help? Thanks


Why should the Standard Model be renormalizable?

Effective theories like Little Higgs models or Nambu-Jona-Lasinio model are non-renormalizable and there is no problem with it, since an effective theory does not need to be renormalizable. These theories are valid until a scale $\Lambda$ (ultraviolet cutoff), after this scale an effective theory need a UV completion, a more "general" theory.  The Standard Model, as an effective theory of particle physics, needs a more general theory that addresses the phenomena beyond the Standard Model (an UV completion?). So, why should the Standard Model be renormalizable?


Calling generic method with Type variable

I have a generic method   Foo<T>   I have a Type variable bar   Is it possible to achieve something like Foo<bar>  Visual Studio is expecting a type or namespace at the bar.


Can abilities like misfortune be used on nat 1/20?

about abilities that require seeing dm rolls got me wondering about the before the results of the roll are revealed part. Since natural 1's and 20's are automatically failures and successes on attacks and saving throws, could the ability affect either?


Where does the mustache go during the transformation?

In the past late 2000s/early 2010s, the villainous character of Red Hulk was brought to the Marvel comics universe, to mixed reception. Later on, it was revealed that this character was       General Thunderbolt Ross, longtime nemesis of the Hulk   and man with an impressive moustache. When Red Hulk was introduced, he had no moustache, and in various appearances, when transforming, his moustache disappears. Why does the moustache disappear instead of just growing with Red Hulk?


Is "happened Tuesday" (without "on") a valid pattern?

The album was released Tuesday and has been well-received by […]   Shouldn't it be "released on Tuesday"?  Where did the "on" go?  I think dropping the preposition is confusing, but I see it written and said so frequently (with clearly the same intended meaning) that I'm doubtful whether I should be correcting it.  Is this pattern valid English?  Is it region-specific?  Does it have a name?


Suppose we are considering some fluid. As I currently understand, viscosity exists because of the following: supposing we draw one infinitesimal surface on the fluid, then the fluid parcels on either side have different momentum.   Since a fluid parcel is made up of a large number of molecules and its velocity is the average velocity of those molecules if some molecules cross the surface into the other fluid parcel they will change the average velocity of the fluid parcel they migrated into.  In that case, this will change the momentum of the fluid parcels and since change of momentum is related to force this will give rise to one kind of force which will be the viscosity force.  Is that understanding right? I thought at first there was something to do with the collisions of molecules but what I said above is what I understood when I read about it on the book. If it's not like that, how we should think about viscosity qualitatively?


How do I select background music for my RPG campaign?

Music is an essential component of my games. When running games set in the Star Wars universe, the music of John Williams adds a new dimension to the experience, both for me and for my players. Now that I'm starting a fantasy campaign, I'm a bit more uncertain about which music to use.  How do I create a soundtrack suitable for using in a fantasy campaign?  Specifically:   What sort of characteristics make for good back ground music? What makes for bad background music? What should I look for to get a fantasy feel? Which genres/sub-genres support fantasy games? What are good sources for fantasy background music?   A few notes:   Because the music will be used in the background of game sessions, most of the tracks should be one minute or longer, to avoid repetitive loops. Likewise, soundtracks with a variety of themes are preferred, so that they can easily support different modes of the game: exploration, combat, and chases, to name a few. Orchestral or acoustic music is preferred over music with vocals or electric instruments.


In 50 AD, the Heron of Alexandria came up with the well-known formula, that, given the three side lengths of a triangle (or even two and an angle, thanks to trigonometry) you can get the area of said triangle by using this formula:  $$ \text{if } s=\frac{a+b+c}{2},\\ \text{then} A=\sqrt{s(s-a)(s-b)(s-c)} $$  But the book it came with (mathematics 1001) did not give a mathematical proof to this. So I tried and failed to get a proof to this. This is how my train wreck went…  $$\begin{align} \text{equation }&\sqrt{s(s-a)(s-b)(s-c)}\\ \text{substitute }&\sqrt{\frac{a+b+c}{2}(\frac{a+b+c}{2}-a)(\frac{a+b+c}{2}-b)(\frac{a+b+c}{2}-c)}\\ \text{eliminate fractions}&\sqrt{a+b+c(a+b+c-2a)(a+b+c-2b)(a+b+c-2c)}\\ \text{comb. Like terms }&\sqrt{a+b+c(b+c-a)(a-b+c)(a+b-c)}\\ \text{associative property }&\sqrt{(a+(b+c)((b+c)-a))((a-(b+c))(a+(b-c)))}\\ \text{difference of 2 squares }&\sqrt{((b+c)^2-a^2)(a^2-b^2-c^2)}\\ \text{square of two numbers }& \sqrt{((b^2+bc+c^2)-a^2)(a^2-b^2-c^2)}\\ \text{polynomial multiplication}& \sqrt{2(a^2b^2-b^2c^2+a^2c^2)+a^2(b-c+a^2)-(b+c)(b^3+c^3)}\\ \end{align}$$ The issue is, I don't know how to get to $A$, the area. Does anyone know how to continue the proof train?? Thanks in advance.


Shrink my database log file, make sense?

I am now taking log backups daily after a long gap(1.5 years). Now when I run,  DBCC SQLPERF('logspace')   Result,  Database  Log Size (MB)   Log Space Used (%)    Status master     1.742188     64.09753               0 tempdb     51.17969     33.19341               0 model      0.9921875        48.4252            0 msdb       4.554688     55.6711            0 MyDb       15618.68     0.7029594              0   Should I shrink the log file. If yes then how?


A word evoking the feeling of being "part" of a work of fiction

I'm seeking a word for the experience of being intensely, vividly involved in a TV show or novel.     I have a continuous event occur when I am reading or watching tv...that I'm not exactly sure how to describe. If a show or novel gets really intense I have a habit of getting...overwhelmed by what is occurring. Like...it feels real and like I am a part of it and I get nervous and my heart rate speeds up and I feel like it's actually happening and I end up needing to take a break from what I'm doing sit and breath for awhile and remind myself that it's not real.    Is there a word for this situation?


I can't install any apps on Ubuntu 18.04 LTS

Any time I try installing any app, the system says "E: Could not get lock /var/lib/dpkg/lock -frontend - open (Resource temporarily unavailable)"  And I tried correcting it on terminal but it said "cannot remove 'var/lib/dpkg/lock - frontend' : No such file or directory"  What should I do now?


Using .Net, how can I determine if a type is a Numeric ValueType?

But here's an example:  Dim desiredType as Type if IsNumeric(desiredType) then ...   EDIT: I only know the Type, not the Value as a string.  Ok, so unfortunately I have to cycle through the TypeCode.  But this is a nice way to do it:   if ((desiredType.IsArray))       return 0;   switch (Type.GetTypeCode(desiredType))  {       case 3:       case 6:       case 7:       case 9:       case 11:       case 13:       case 14:       case 15:           return 1;  }  ;return 0;


Is Ubuntu license required to be eligible for LTS support?

Must I buy an  to get security fixes for 5 years (LTS)?   free support for nine months with security fixes, high-impact bug fixes and conservative, substantially beneficial low-risk bug fixes ... Current long-term support (LTS) releases are supported for five years, and are released every two years.


Journal doesn’t react for several months – should I withdraw?

I submitted a paper to a journal in mathematics. For the last three and a half months, the status of the article is with editor. I sent a mail to the editorial office to update the status. They replied me saying they will ask the handling editor to contact me. After one more month I asked to expedite the process. No reply. Now for the last three and half months, there is no change in the process.  Is it better to withdraw the article or wait for some more time?


How to make "L" shaped arrows with curved edge

I simplified this example from , however what I am looking is an "L" shaped arrow that curves when it gets to the same height as A which can be seen in the below figure. The red curve is the one that I want.    Here is the code that I have right now for the black arrow.  \documentclass{article} \usepackage{tikz} \begin{document} \begin{tikzpicture}   \node[anchor=east] at (0,0) (text) {A};   \node[anchor=west] at (5,5) (description) {B};   \draw (description) edge[out=180,in=0,->] (text); \end{tikzpicture} \end{document}


I have implement Get() for http get requests. And I am making a rest call to that function with some authentication headers. When supplied with valid authentication headers, it works. But When I use invalid header, I should get "No Response" in my rest client. This needs to implement. Could anyone say what should do for this.  I am using DHC ReST client chrome extension as my Rest client. Given below the GET implementation  public stream Get() {   if(WebOperationContext.Current.IncomingRequest.Headers.AllKeys.Contains("Authorization"))   {     //Validating the header     ...     if( valid header)     {        WebOperationContext.Current.OutgoingResponse.ContentType = "application/xml";        byte[] bytes = Encoding.UTF8.GetBytes(xml);        var stream = new MemoryStream(bytes);         stream.Seek(0, SeekOrigin.Begin);        return stream;     }      if(invalid header)     {       //I need to generate no response codes from here.       //I tried, throw exception, change status code, return null stream but nothing worked.     }   } }


Why are films where the bad guy "wins" at the end so rare?

It seems that there is a rarity in films where the bad guy wins at the film's conclusion ("bad guys" being defined by the culture of the movie makers). By "win" I mean the good guy(s) have been defeated.  I'm not talking about bad guys with whom we sympathize such as Jack Sparrow in Pirates of the Caribbean, Léon Montana in The Professional, or any number of criminals & scoundrels depicted having a heart of gold. Rather the Villain or Antagonist in the James Bond or Marvel comics sense. Hans Gruber in Die Hard. Thulsa Doom in Conan the Barbarian.  Are there actually rules, written or unwritten, preventing a script with victorious villains ever being made into a movie? Is it assumed audiences wouldn't be interested in such a film and ticket sales would suffer? Or is there any other reason those movies are so apparently rare?


I am trying to unistall a Windows application installed in Wine.  When I run the command:  wine unistall - -software   it says uninstall: command not found.


confused on output. returning two variables and still prints

int addmult(int ii, int jj){   int kk, ll;   kk = ii + jj;   ll = ii * jj;   return (kk, ll); } void main(void){   int i=3, j=4, k, l;   k = addmult(i, j);   l = addmult(i, j);   printf("%d, %d\n", k, l); }     I thought that it wasn't possible to return two variables from a function. How does the compiler know to print ll instead of kk? I know that in the function ii=3 and jj=4, k=7 and l=12, but then it goes on to return two variables.  Could someone please elaborate on why it ends up printing:  12, 12


Validating dates in SharePoint so they cannot choose a date before today's date, how would I write that formula?

I am back at this form I have people fill out in SharePoint Designer and have a new small issue, here is my formula:  =AND([Requested Posting Date]>=[Date of Request]+1,IF([Date of Request]="New",[Date of Request]>=TODAY(),TRUE))   If they choose today's date (The Date of Request field) they have to choose at least One (+1 day) (the Requested Posting Date) into the future and everything is working there, but they can choose a past date which is causing some issues.  How would I go about setting up the formula above that I am currently using to only allow you to choose today's date for the Date of Request field and nothing in the past? Let me know how I would set it up so they can't choose past dates with the formula above in a SharePoint form.  It is for people requesting work or tasks to be completed by me and I have two date pickers. I just need to know how to get the date pickers to not allow you to choose a past date, as if they were grayed out (the past dates, that is); how would I write that?


I have some code here that takes a double amount that serves as a dollar amount and outputs the amount of coins it contains. I have been trying to get it to execute "1.69" correctly for a long time, putting in a ridiculous amount of parenthesis to make sure it works; however, the output is never correct. Currently, as it stands below, the output is 6 Quarters, 1 dimes, 1 nickle, and 3 pennies, which is "1.68," and I cannot for the life of me figure out why. Any ideas? Thanks.      ChangeJar2(final double _amount_){      quarters = (int) (_amount_/.25);// Computes # of quarters     dimes = (int) ((_amount_-(quarters*(.25)))/.1);// Computes # of dimes     nickles = (int) ((_amount_-(quarters*(.25))-(dimes*.1))/.05);// Computes # of nickles     pennies = (int) ((_amount_-(quarters*(.25))-(dimes*(.1))-(nickles*(.05)))/.01);// Computes # of pennies      System.out.println(quarters + " " + dimes + " " + nickles + " " + pennies);   }// End of ChangeJar(final double _amount_) Constructor


I see "There are no review queues available to you" when clicking the review icon without any explanation

This has appeared as the dropdown on my review queue button today:        I can't find out anything about it.    What does it mean? Why aren't there any review queues available to me? How long it's going to stay there?! :(


Is there a way to launch Terminator when right clicking "Open in Terminal" for Ubuntu 18.04?

Currently when I right click on a directory and select Open in Terminal the default is still GNOME terminal. I have Terminator installed. Is there a way to make it default instead?  I have read , and wonder if the situation has been improved?


Link rendering on PDF export of careers should be better

Currently the link rendering of a link in a text area of careers renders as all black without an underline.  At the very minimum this sucks for computer users and is completely worthless for people who print out the pdf.  I propose two features:   Links should be rendered as blue with an underline (or at least blue!) Links should (maybe optionally?) be rendered back to markdown when printed, and (again maybe optionally?) shortened, for the print version.


Proving that {$v, T(v), ..., T^{n-1}(v)$} is a basis of $ V $

Let dim $V = n$ and $T: V \rightarrow V $ be a linear map such that its only invariant subspaces are $0$ and $V$. Prove that {$v, T(v), ..., T^{n-1}(v)$} is a basis of $ V $, where $v \neq 0$.   I assumed that as this is a set of n vectors, it is sufficient to show that if they are either linearly independent or spanning, then it is a basis of V.  I tried to prove linear independence by contradiction. Assuming linear dependence,  $$ \exists j \in \{0,..,n-1\} $$ such that  $$ \lambda_j T^j = \sum_{i = 0}^{j-1} \lambda_i T^i(v)+ \sum_{i = j+1}^{n-1} \lambda_i T^i(v) $$  $$ \Rightarrow T^j(v) \in span\{T_i(v): i\neq j , i\in\{0,...,n-1\} \}$$  But from here I didn't know where to use the fact that the only invariant subspaces are $0$ and $V$


prove $\lim\limits_{x \to \infty}(1+ 1/n)^n = e$ without using l'Hospitals rule

I did $y=(1+1/n)^n)$ so $ln(y)=n*ln(1+1/n)$ so then $ln(y)=Ln(1+1/n)/(1/n)$ which sith l'hospitals rule becomes $ln(y)=(-1/(n^2 + n))/(-1/n^2)$ which simplifies to $n/(n+1)$ which using l'hospitals rule is $1$ so the answer is e. how do you solve this without l'hospitals rule


Variable variable class extensions in PHP--is it possible?

Is something like the following possible in PHP?  $blah = 'foo1';  class foo2 extends $blah {     //... }  class foo1 {     //... }   This gives an error.  I want to dynamically set $blah so I can extend whatever class I want.  Edit: The reason for wanting to do this because I wanted to use a function out of another class in a related class. In the end it would have been something like:  Final extends foo1 extends foo2 extends foo3 extends foo4 extends parent { ... }   In the end I decided to instantiate the other class within the class and use it. Not the best options because they both you 2 of the same classes, but this won't be used that often, so it will work for now.


Easy way to write contents of a Java InputStream to an OutputStream

I was surprised to find today that I couldn't track down any simple way to write the contents of an InputStream to an OutputStream in Java. Obviously, the byte buffer code isn't difficult to write, but I suspect I'm just missing something which would make my life easier (and the code clearer).  So, given an InputStream in and an OutputStream out, is there a simpler way to write the following?  byte[] buffer = new byte[1024]; int len = in.read(buffer); while (len != -1) {     out.write(buffer, 0, len);     len = in.read(buffer); }


So, I've come across this term while using other software as well. However, with respect to Blender, what are they? How does one use/access them and if possible could a simple animation be demonstrated using this?


Asker deletes his question a minute after I answered it. What can I do? Is this a common pattern?

I'm new to this platform, please bear with me. I answered a question on SO today, where the asker needed a specific SQL query. As soon as I had answered it and before anyone else could read or upvote it, the author deleted the question, rendering my answer useful to him but to no one else. From what I read here on META, this has been a pattern of behaviour of some users for years, and it seems like nothing has been done to prevent the negative impact on people who make an effort to answer:      For me, this was the fourth or fifth question all in all that I answered on all of the SE platform, and I have to say, as a newbie, this is a really sobering start. The question was perfectly valid albeit pretty simple. The UI states clearly that the user deleted the question himself. I can only speculate on his reasons of course, but I strongly suspect that the question would still be open if I hadn't answered it. Are there any plans to prevent this kind of lame behaviour with a technical solution? Since this problem seems to have existed for so long, I suspect no. How do others here prevent this from happening to them? Are there any best practices you can recommend like waiting longer or commenting/upvoting before answering?


I want to watch Bleach, but the anime has a lot of filler content not in the manga. I'd rather not watch the filler content and only watch the episodes which are directly related to the plot. To be clear, I'm defining a filler episode as one which is not based on any story in the manga or based on extra manga chapters which have nothing to do with the overarching story.  Which episodes are filler?


Render Partial View to String and Convert to PDF

Is there a way to render my Partial View to String or Html? and used that to convert to PDF?  I guess, the only item I need to accomplish is to Render my Partial View to String or HTML, if it's possible.  I already have a tool that can get .htm/.html files and convert it to PDF.  Thank you.


Suppose a clinical test was applied to detect cancer. The test has the property that $90\%$ of the cases that suffered cancer they were positive, while $5\%$ of the cases that did not have cancer were diagnosed as positive. Assuming that $1\%$ of patients in a hospital have cancer What is the probability that a randomly selected patient, who was diagnosed positive, in one actually have cancer?  My try:   I believe that the two events of the total are the people who has cancer($90\%$ positive and 10% negative) and people who doesn't ($95\%$ negative and $5\%$ positive).  I Also know that the events of having cancer and the diagnosed are independent. I don't know how to pursue.


I'm new in ML and I would like some explanation about dummy variables from any experienced data scientist.  I've understood through reading on the web that pre-processing the data is a really important step before even thinking about the model we want to implement. One subject is how we deal with categorical variables and the answer I found  so far on the web was turn it into dummy variables. However, I'm struggling to understand why we do that. What's the reason hidden behind this method? Is that something we do automatically as soon we see a categorical variable in our dataset?   Why do algorithms learn better from  $K-1$ columns made of $1$ and $0$ than from $1$ column made of $K$ features?   Is there something else we can think of doing when we see a categorical variable?


extended asm in gcc: Segmentation fault when it executes "stosb"

The problem is, when the program steps to the line: stosb, it will display an error: "Program received signal SIGSEGV, Segmentation fault." I don't know why, any ideas?  Under ubuntu x86_64, using "gcc -o test test.c" to compile and link.  #include <stdio.h>  static inline char * strcpy(char * dest,const char *src) {     int d0, d1, d2;     __asm__ __volatile__("1:\tlodsb\n\t"                          "stosb\n\t"                          "testb %%al,%%al\n\t"                          "jne 1b"                          : "=&S" (d0), "=&D" (d1), "=&a" (d2)                          : "0" (src),"1" (dest)                          : "memory");     return dest; }  int main(void) {     char* src_main = "Hello_src";     char* dest_main = "Hello_des";     strcpy(dest_main, src_main);     puts(src_main);     puts(dest_main);     return 0; }


Is $(V^\perp)^\perp=\overline{V}$ when $V$ is a subspace of a Hilbert space $H$?

Why is $(V^\perp)^\perp=\overline{V}$ when $V$ is a subspace of a Hilbert space $H$? I googled about this but only $V$ as a subspace of finite vector space. Any reference or proof or idea are welcome.


How to draw a circle on a plane with OSL (Open Shading Language)?

This is my very first day of learning Open Shading Language. I have watched few videos in Youtube and learned a little.   Right now, for learning purpose only, I want to know what OSL codes can draw one black circle against the white ground of plane, but I can't find any tutorial to teach me that.   Next, I want to know how to do a circle grid like this below.    And this too.


homeomorphism between a compact and a Hausdorff space

As I was going over my lecture notes I found the following problem which we haven't proof in class In the example we know $H$ is a Hausdorff topological space and $C$ is a compact topological space and we need to find a homomorphism between them. And my lecture notes say it suffices to find a continuous bijection $f$ from $C$ to $H.$ So I guess the following proposition which we haven't proof must hold If $H,C$ and $f$ as above then $g=f^{-1}$ is continuous. How can I prove this? Thank, You


Editing /etc/hosts and /etc/sysconfig/network doesn't chane the hostname

We have tried both the /etc/hosts and also /etc/sysconfig/network. Edited both files and service network restart. Yet the hostname is showing as localhost.localdomain. How to resolve on this? Googling almost all talking about the same method too.


Trying to take the line from a logfile, remove some text, and put it into a new text file in a batch script

I am trying to take the last line from a logfile and remove some text from the beginning and end of it and put it into a new text file. I have minimal batch experience, any help is appreciated.  last line:   Opening track for playback: "D:\Music\musicfile.m4a"   Path to the logfile:   %USERPROFILE%\Documents\file.log   What I want the last line to look like when it is done:   musicfile


Product of two Lebesgue integrable functions not Lebesgue integrable

I have a homework problem that says;  Give Borel functions $f,g: \mathbb{R} \to \mathbb{R}$ that are Lebesgue integrable, but are such that $fg$ is not Lebesgue integrable.  I saw this page too: , but the question does not mention boundedness.  I also am not sure what to do with the fact that the functions are Borel. (Any help on this would be especially appreciated)  I know that if $fg$ were Lebesgue integrable then both $\int (fg)^+\,d\mu$ and $\int (fg)^-\,d\mu$ would be finite. This could lead to utilizing the finiteness of their difference (the function's integral) or their sum (the absolute value). I also know that $f+g$ are Lebesgue integrable if $f$ and $g$ are so I thought of using $$fg = \frac{1}{4}\,\big( (f+g)^2 - (f-g)^2 \big)\longrightarrow \int (fg)\,d\mu = \frac{1}{4}\,\int (f+g)^2\,d\mu - \frac{1}{4}\,\int (f-g)^2\,d\mu,$$ assuming linearity of the integral etc.  I also thought of the Hölder inequality, $$\int \mid fg \mid d\mu \leq \bigg( \int \mid f \mid^p d\mu \bigg)^{(1/p)}\,\bigg( \int \mid g \mid^q d\mu \bigg)^{(1/q)},$$ but there was no mention in the question of what $L^p$-space this was in. Maybe by the definition I gave it is such that $p=1$ and $q=1$? Then $$\int \mid fg \mid d\mu \leq \bigg( \int \mid f \mid d\mu \bigg)\,\bigg( \int \mid g \mid d\mu \bigg).$$  However, I still can't seem to think of an approach to show that $fg$ is not Lebesgue integrable, while $f$ and $g$ are.  Thanks for any guidance!


get value from loaded page in javascript

I have main.aspx and second.aspx.The code in main.aspx:  <form id="form1">

 </form>   And in second.aspx:
     <asp:Textbox runat="server" id="txt1"></asp:Textbox>     <input type="button" id="bttn" value="send"></input>
   At the run time I'm loading second.aspx page into main.aspx div id="main".  $("#main").load("second.aspx #second");   I'm trying to get the textbox value from main.aspx.But when I tried   $("#bttn").click(function(){     var t=$("txt1").val();     alert(t); });   It gives nothing.It seems to be never going into the function.How can get the value from the textbox.


What is the length of a sine wave from $0$ to $2\pi$? Physically I would plot $$y=\sin(x),\quad 0\le x\le {2\pi}$$ and measure line length.  I think part of the answer is to integrate this: $$ \int_0^{2\pi} \sqrt{ 1 + (\sin(x))^2} \ \rm{dx} $$  Any ideas?


In the DLC Reign of Giants, summer now induces overheating (the opposite of winter's freezing) and before the summer comes, there are piles of ice on the map, much like and rock boulders, that you can mine. When the summer finally comes, these piles completely melt and the only way to cool off that I found is to wear a hat made out of watermelon and twigs.   →               →   I've seen the inverse-fireplace that I can craft using some nitre and electric doodads, but that is stationary and I want to be able to do some things during summer, but as it lasts 15 days, I'm not sure I'll be able to without proper preparations.     I thought I could just leave the top world for caves and stay there, but it's very difficult, since I didn't have any lighting gear and the light coming from the top world still induces overheating at about the same rate.  What resources do I need to have gathered to safely roam throughout the world in summer without the fear of overheating?  So far I've found that there are items that instantly reduce overheat value by a pre-set amount and can be used only a few times, and the items that constantly reduce overheating, but they spoil or break over time. Other methods require being stationary or within vicinity of some objects. I also found out that standing close to base (don't know which structures though) reduces overheating (maybe it's like trees, or maybe they absorb heat).


The offensive/spam flags in chat are shown to every moderator from a parent site (on chat.stackexchange.com that is every SE 2.0 moderator, more than 200 right now) and 10k chat users as well. This is potentially far more users than a flag on an SE site itself is shown to.   I don't think it is necessary to show the flag to so many users at once. This can lead to the impressive sight of an entire horde of moderators descending onto one chat room when some flagging is going on, but it often notifies far more people than necessary to act.  Another huge disadvantage of notifying so many users at once is that only the fastest users to act decide on the fate of the flag. If you read up on the context of the flagged message, odds are that by the time you're finished with that someone already validated or dismissed the flag. This leads to hasty decisions on those flags because the users that take their time won't get to decide on the flag.   I propose that the chat flags are first shown only to mods and users in the same chat room, if there are enough users present that the flag could be acted on (so either one moderator or six 10k+ users). If they don't act after a short while or not enough privileged users are present in the room, the flag should be escalated to the mods and users of the parent site. If those users don't act on the flag, it be shown to all moderators and users on Chat.SE.  The exact delay should be just long enough to allow present and active users to handle the flag. Given the high speed that flags are currently handled in many cases, 30-60 seconds might be enough. Though looking at some hard data on flag handling times might be a better way to come up with a useful length.   It might also be useful to increase the number of users that see the flag incrementally even at the stage where all 10k users and moderators are notified. You don't need all of them, and the wide exposure .  The advantages would be:   Not bothering users that are not needed to come to a quick decision Allows local differences in chat culture to be policed more consistently Higher chance of showing the flag to users that already know the context   But there is also a danger to this, if flags are handled locally and nobody outside the room can see them, the potential for abuse is much higher. This could allow a chat room to develop a very hostile culture, and just flag away anyone that complains, or just dismiss valid flags.   There should be an obvious way for a user to involve moderators from outside the chat room. This could be the "flag for a moderator" option, they would remain global by default and ignore the escalation system. That would also need some UI work as this option is currently rather well hidden and I suspect that many chat users don't even know that there are two types of flags. I've posted my ideas about this


I'm using a lm555 IC in monostable mode. When my input varies from 5v to 0v the output goes from 0v to 5v. But this only happens perfectly if it happens just a pulse at the entrance, in case my input changes from 5v to 0v and continue at 0v for the rest of the time the output does not work correctly. What I want is the following, when my input changes from 5v to 0v and continue to 0v, I want my output to remain high only for the time I have determined.  What I have:    What I need:    I thought I could do that with transistor input, but I did not find a way to do it. If anyone knows something similar thank you.


How many positive integral values of $n$, less than $100$, are there such that $n^3+72$ is completely divisible by $n+7$?

How many positive integral values of $n$, less than $100$, are there such that $n^3+72$ is completely divisible by $n+7$ ? MY WORK :- Well we know that $a+b$ divides $a^3+b^3$ thus $n+7$ divides $n^3+7^3$ thus it divides $n^3+343$. Now if $n+7$ divides $n^3+72$ then it divides their difference. Thus $n+7$ divides $343-72=271$. Now the factor of $271$ are $1$ and $271$ only. So if $n\lt100$ then there are no values possible; hence answer should be $0$. However in answer key it's said $1$. I want to know why it's $1$ ??


LinkedList Iterators as local var or parameter do not have value saved at recursion why?

this code prints Kth to the last element in the LinkedList using recursion.  With LinkedList containing abcdef and k=4.  The expected output is cdef  With recursion, I wanted to use a local Iterator to trace the position of the node, itrLocal in method kToLast().  But, I found that itrLocal was not  saved when returned from the recursive call.   Is this a bug ?    import java.util.Iterator; import java.util.LinkedList;  //with recursion  O(n) space and O(n) time. public class KthToLast {      public KthToLast() {     }      public static void main(String[] args){          LinkedList s = new LinkedList();          s.add("a");         s.add("b");         s.add("c");         s.add("d");         s.add("e");         s.add("f");          KthToLast k = new KthToLast();         LinkedList resultList= new LinkedList();         int n = k.kToLast(s.iterator(), 4, resultList);          }//main       private int kToLast(Iterator<String> itr, int k, LinkedList resultList)    {          Iterator<String> itrLocal = itr;           if (!itr.hasNext()) {            return k;          }         else {             String data = (String) itr.next();              int n=  kToLast(itr,k, resultList)-1;              if (n >= 0) {                 resultList.add(data);             }             if (n==0){                 Iterator reverse = resultList.descendingIterator();                 while (reverse.hasNext()){                     System.out.print(reverse.next());                 }//if                //value of data is reserved for each recursion             if  (n >= 0) {              /* why would itrLocal change with itr ? itrLocal at each                  recursion call was not reserved.   is this a bug ?              */               while (itrLocal.hasNext()){                   System.out.println(itrLocal.next());               }                            }//if                        return n;                    }//else                  }//ktolast }//class


Do I have to go through immigration for a connection in Canada (Montreal)?

I plan on flying from the US to Europe (Schengen) through Montreal airport (Trudeau Airport, YUL). The flights US-Montreal and Montreal-Europe are two different bookings. For the sake of simplicity, let's say I do not have any checked-in luggage.  According to the , if I connect from USA towards a non-US international destination with automatic luggage transfer (or no checked-in luggage), I have to "go to the special international connections customs counter". But does that involve only customs or also immigration? I am particularly interested in knowing if my passport will be checked, if that makes sense.  So, do I have to go through some form of immigration/passport check when connecting in Montreal from the US to Europe?


What does the bars above the health bar mean?

After drinking an energy drink, there are little yellow and white bars above the health bar. What are those? What do they represent?


Let's consider two statements: Zorn's lemma and theorem about existence of maximal ideals in commutative ring with $1$.  It's easy to prove that Zorn's lemma implies existence of maximal ideals.  I wonder if the converse proposition is true, i. e., does existence of maximal ideals implies Zorn's lemma? My approach was to construct a ring structure on an ordered set which satisfies Zorn's lemma condition such that existence of maximal ideal implies existence of maximal element in the set, but I didn't succeed.


Reputation, Tag score and Community Wiki

I am aware of the rules regarding tag badges, this is not about them.  I recently converted a number of my old answers to Community Wiki. It appears that a consequnce of this is that I lost some tag badges, that's easily solved.  When something becomes CW reputation earned up to that point is maintained but new votes have no effect on reputation (non tag badges for up/downvotes are still earned though).  In respect of tag score, when something becomes CW all points are lost no matter when they were earned.   This seems to be the only place on SE where things are lost due to retrospective actions why is this ?


Let m be the least common multiple of a,b and c be another common multiple. Prove that m divides c.

I have tried to solve the problem. I have started by assigning m=(ab)/d, where d is the greatest common divisor of a and b. Then I set up c = aq. That is where I am stuck. I am really not sure what to do next.


Why doesn't more light bounce off of things in the manner of sound?

If I'm sitting in the den with my door slightly cracked, I can hear my wife washing dishes in the kitchen down the hall. But why can't I also 'see' images of her washing dishes if, say, I looked up on my wall?   Broken down:   Sound waves bounce off things.   Light waves bounce off things.  You can hear sound of someone washing dishes in the next room.  Why don't you can't see the light (visuals) from them?


Ubuntu Dock -- Set a custom transparency level on Ubuntu 18.10

I want it to be something like 90% opaque, so the icons are easier to see on light-colored themes.


Something special about energy eigenstates when it comes to time evolution?

A particle is subject to an infinite square well potential with  $$V(x)= \begin{cases}  0  &   −a \lt x \lt a\\   \infty &  \,\,\,\,\text{otherwise} \end{cases}$$  At a time $t=0$ its wavefunction is given by $$\psi(x, t=0)=\frac{1}{\sqrt{5a}}\cos\left(\frac{\pi x}{2a}\right)+\frac{2}{\sqrt{5a}}\sin\left(\frac{\pi x}{a}\right)$$       (a) What are the possible results of an energy measurement at $t = 0$, and with what probabilities?     Re-writing the terms in $\psi(x,t=0)$ as $$u_1(x)=a^{-1/2}\cos\left(\frac{\pi x}{2a}\right)\qquad \text{&} \qquad u_2(x)=a^{-1/2}\sin\left(\frac{\pi x}{a}\right)$$ such that $$\psi(x,t=0)= \frac{1}{\sqrt{5}}u_1(x)+\frac{2}{\sqrt{5}}u_2(x)$$ with energies $$E_1=\frac{\hbar^2 \pi^2}{8ma^2}\qquad \text{&} \qquad E_2=\frac{\hbar^2 \pi^2}{2ma^2}$$ and probabilities $$P(E_1)=\frac15 \qquad \text{&} \qquad P(E_2)=\frac45$$       (b) If no measurement is performed, what is the wavefunction $\psi(x, t)$ at all times $t$? What are the possible energies and their probabilities if a measurement is first performed at time $t$?     At a time $t$ the wavefunction is given by $$\psi(x, t=0)=\frac{1}{\sqrt{5a}}\cos\left(\frac{\pi x}{2a}\right)\exp\left(\frac{-i E_1 t}{\hbar}\right)+\frac{2}{\sqrt{5a}}\sin\left(\frac{\pi x}{a}\right)\exp\left(\frac{-i E_2 t}{\hbar}\right)$$    The problem is that I cannot answer the second part of the question (b).    The answer states that:      Because the two terms are energy eigenstates, the relative probabilities do not change and are as in the previous part.     I have some questions about the above statement: why does an "energy eigenstate" mean that the probablities don't change with time? Or, put in another way, does a "momentum eigenstate" (for example) have constant relative probabilities when measured at any time?   The answer seems to be implying there is something special about energy eigenstates when it comes to time evolution. The eigenvalues of energy measurements don't seem to change regardless of how many times you measure them, and no matter how long you wait until you measure them. I'm not sure if this is the case, but could someone please explain why all quantum operators (except Hamiltonian) do not exhibit this behaviour.


How to show an message box from terminal in Ubuntu

I want to show an message box from terminal in Ubuntu, I have GNOME 3 desktop environment.  How should I proceed?


How to find out what is in an Ubuntu package

When viewing a package on the Ubuntu repositories (e.g. launchpad), there is usually only a sentence or two describing the package contents. Is there a place online to see more detail about package contents? Often, downloading a separate docs package is the only way I can get any more info.  Responding to a comment (and other posted answers): I would like something different from listing the file names, since my question is about understanding the technical functionality provided by various packages, for example, what versions of various standards the package implements or where to find the corresponding documentation.


A square bracket '[' with a double vertical line

Perhaps, that's a very easy question - I wonder what's the code of the symbol that looks like the square bracket [ but whose vertical line is double, like in || represented by $\|$.


How to get the items from adapter and store it in list?

I am getting list from adapter which is working fine. Now I need to store it in the list in MainActivity on button click. But I am getting crash as,     java.lang.NullPointerException: Attempt to invoke virtual method 'void com.savedayreq.RoutePlanDayRequests.setPartnerId(java.lang.String)' on a null object reference                                                                                at com.view.RoutePlanVisitChangeActivity$2.onClick(RoutePlanVisitChangeActivity.java:92)   line number 92 is this code.   submitChangeRequest.setOnClickListener(new View.OnClickListener() {             @Override             public void onClick(View view) {                 adapter = (RoutePlanVisitChangeAdapter) mRecyclerView.getAdapter();                 List<RoutePlanDayRequests> routePlanDayRequests=null;                 RoutePlanDayRequests requests = null;                 for (int i = 0; i < adapter.getItemCount(); i++) {                     Retailers selectedView = adapter.getItem(i);                      View dataView  = mRecyclerView.getChildAt(i);                     Spinner toDaySpinner = (Spinner) dataView.findViewById(R.id.to_day);                       //i can print this oldDay,newDay, msisdn line..                     String oldDay = selectedView.getRoutePlanDayOfWeek();                      String newDay = toDaySpinner.getSelectedItem().toString();                     String msisdn = selectedView.getMsisdn(); //i can also print this line in log.          //***But I am getting crash from this line no 92..***                      requests.setPartnerId(selectedView.getMsisdn());                     requests.setParentPartnerId(selectedView.getMsisdn());                     requests.setApproverId("1");                     requests.setStatus("0");                     requests.setRetailerPrmId(selectedView.getMsisdn());                     requests.setOldDay(oldDay);                     requests.setNeweDay(newDay);                     routePlanDayRequests.add(requests);                      updateServiceList(AppUtils.getMsisdn(mSharedPreferences),routePlanDayRequests); }


Proving a binomial sum identity $\sum _{k=0}^n \binom nk \frac{(-1)^k}{2k+1} = \frac{(2n)!!}{(2n+1)!!}$

Mathematica tells me that  $$\sum _{k=0}^n { n \choose k} \frac{(-1)^k}{2k+1} = \frac{(2n)!!}{(2n+1)!!}.$$  Although I have not been able to come up with a proof.  Proofs, hints, or references are all welcome.


Below is some code (removed much of it for clarity) which shows my issue of concurrent list modification:  for (final Week week : this.demand.getWeeks().getAllWeeks()) {     final List<Week> weeksExcludingThisWeek = this.demand.getWeeks().getAllWeeks();     weeksExcludingThisWeek.remove(week); }   As far as I was aware I was removing the reference to the same week object, but in a different list than is used in the for loop.   How do I prevent this from occurring?


Series proof $\sum_1^\infty|a_n|<\infty$ then show that $\sum_1^\infty{a_n^2}<\infty$

Iam stuck with this proof. There seems to be no property to help. If $\sum_1^\infty|a_n|<\infty$ then show that $\sum_1^\infty{a_n^2}<\infty$ and that the reverse isnt true.


Show that $\lim_{x\rightarrow\infty} f(x) = \infty$ if $f$ is a convex function such that $ \lim_{x\rightarrow -\infty}f(x) = −\infty$

I need to prove the theorem      Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a convex function such   that $ \lim_{x\rightarrow -\infty}f(x) = −\infty$. Show that $\lim_{x\rightarrow\infty} f(x) = \infty$   I can see clearly why this must hold by doing a graph where $f(x)$ converges to a constant when $x\rightarrow\infty$. But I have no idea of how to do a formal proof of this.


what is the "ordered" of "De Lima ordered arrested by RTC" in news headline

De Lima ordered arrested by RTC    From this   I somewhat understand of Headlinese. However, I still don't understand ordered. I mean, I can understand was is omitted in following sentence.     De Lima (was) arrested by RTC   But in the sentence, two past participles are arranged side by side. I tried to study Headlinese but I couldn't find answer clearly.   Could somebody make a perfect(normal) sentence from the headline? I read someone said it can be various cases. Then could you make some sentences which is possible to suppose.  So far, my best attempt is that      De Lima (was) ordered (to be) arrested by RTC   I'm not sure, though.  Thank you in advance.


It's my first time doing this kind of task, so I'm a little unsecure if my method is right.   Heres my setup and what I`ve done so far.  I`m using a PCAN USB (Peak System) + PCAN View tracing a J1939 Network using extended identifiers. The application has no numerical indication about the bus load, only status like bus ok, heavy bus... So I decided to convert the trace record into a CSV and then analyzing it with Python.  Once I had it converted, I was interested in get 4 fields of information: message ID, data size (how many data bytes in that message), how many times that message was sent, and the message itself.  Cycletime was calculated as the total recording time divided by how many times that message was sent.  Message Size was calculated considering:  Start of Frame - 1 bit  Identifier A - 11 bits  Identifier B - 18 bits  Substitute Remote Request - 1 bit  ID Extension Bit - 1  Remote Transmission Request - 1  Reserved Bits - 2  Data Length Code - 4  Data Field - 0-64 bits  Cyclic Redundance Check - 15  CRC Delimiter - 1  ACK Slot - 1  ACK Delimiter - 1  End of Frame - 7  ________________________________TOTAL (considering a 8 byte message): 128bits Load was calculated as 128bits*1000/cycletime  % of Bandwidth was calculated as Load/250000  Am I Missing Something?  Is there another method that's more accurate?


I want to block specific user from sending emails. I tried doing these things which did not help:   Commented user in /etc/passwd Wrote passwd -l user and restarted sendmail service.   User can't receive mails - that's OK, but they still may send mails. I use Sendmail (port 25) and Dovecot (port 110 POP3).  Any ideas to block a user from sending mails?


Property of modular arithmetic. $a \bmod p = b \bmod p \iff p \uparrow |a-b|$

As I am doing revision, I stumble upon a proof in one of my computer science books (sparse with proofs). At one point they mention that to compute the equality of bit strings, then they check if  $$a \bmod p = b \bmod p$$ and states that this is only true if $p$ divides $|a-b|$, which they denote as $$p \uparrow |a - b|.$$  Note that $p$ is a prime.  Why is this?


Time dilation effects near the end of the movie

There are two main occurrences of time dilation having effect in the movie:      the dilation with a smaller effect (1 h -> 7 years) on the water planet, and one with a larger effect later when they use Gargantua as a slingshot.    Having said that,       why doesn't Cooper experience enormous time dilation effects when he starts falling into the black hole? I.e. merely passing near the event horizon makes them experience time dilation of ~50 years, but him falling into the abyss turns out to be void of that effect?


Proof for $A \cup B = B$ if and only if $A \subset B$

I am trying to define a proof for  $A \cup B = B$ if and only if $A \subset B$  I started with:  $$A \cup B$$ $$x \in A \lor x \in B$$   but I am unsure on how to continue.


I have recently created my website and hosted it through 000webhost. I have also begun researching on how to make my website 'searchable' from googles search engine.  And so i came across google webmasters and its tools. I created a sitemap and submitted it, and added the needed tags to my website head.  I then asked google to fetch and render my links that i wanted google to have appear when searched for, as shown below:    As soon as it said that my web links were indexed i could search for my website with almost all of my meta tag searches and find it on the two listed pages. A few days later, after using the same search parameters i can no longer find my website, so i went to my index status and it now says that it is currently indexing 0 links as shown below:    I dont understand why this is? and also how can i get my website indexed by google for me to search for it?


Seeking API for Countries, States, Cities and Airports?

I'm looking for an API or data source (or multiple sources) that provide the following information:   Countries Information: ISO code, Region, Capital, population, languages, currencies and climate. States Information: name and time zone Cities Information: name and time zone Airports Information: IATA, ICAO codes, longitude, latitude, altitude and time zone. Hotels Information: how many stars, number of rooms, longitude, latitude and type of rooms.   I want this information to be highly accurate and include latitude, longitude and time zones. also, I don't mind if it was a paid source. I can't use any source that have an affiliated program  I have checked geonames.org restcountries.eu world bank APIs booking.com they either have missing information or inaccurate


I want to write a program which will translate a number into text, but I am not sure how to read those numbers and about the rule.  999,999 =?   Nine hundred ninety nine thousand and nine hundred ninety nine? Nine hundred and ninety nine thousand and nine hundred ninety nine?     123,909,909 =?   one hundred twenty three million nine hundred nine thousand and nine hundred nine? one hundred and twenty three million nine hundred nine thousand and nine hundred nine?   1,000,000,000,000,000 =?   one million billion?   What is the rule to read them?


Why didn't Katie Holmes play Rachel Dawes in The Dark Knight?

Katie Holmes played Rachel Dawes in Batman Begins but Maggie Gyllenhall played the character in The Dark Knight.   Was there any particular reason why Katie Holmes didn't continue on in the role?


How does the propagation of gravity work for photons?

As explained in the answers to  post, photons apparently exert a gravitational pull on other objects. It has also been explained on this site, that gravity propagates at the speed of light.  I'm wondering, though, how do you reconcile these two facts? I'm trying to imagine the gravitational field made by a photon and it seems like there are some paradoxes. For example, how can gravity propagate ahead of the photon at the speed of light, if the photon is also travelling at the speed of light? My guess is the solution is probably found in relativity, but I certainly can't figure it out.   Right now, the best I can do is to think about gravity as sound, and a photon as an object travelling at the speed of sound. Can anyone help me out?


Is There A Facility To Submit Useful Articles

I just implemented some functionality in a rails application I am working on that I thought might make a useful "How To" article. I'm wondering if I can do this on SO as there are some questions (old, and already answered) similar to what I've done.  I figured it might help out people looking for similar info.


I have South Africa refugee passport. I am Eritrean. Can I travel to Greece without a visa?

I need to visit Greek with a South African refugee document. Can I travel without a visa?


How do I submit wallpapers to be considered for inclusion in Ubuntu?

I take photos from time to time, and if I take an exceptionally beautiful one, I'd like to submit it for inclusion in Ubuntu. Where do I send/upload it?


Finding the number of zeros of a polynomial in the closed disk

Find the number of zeros of $f(z)=z^6-5z^4+3z^2-1$ in $|z|\leq1$.   My attempts have not gotten far.   I know we can examine the related equation $f(w)=w^3-5w^2+3w-1$ in $|w|\leq1$, letting $w=z^2$.  It is clear that $f(w)=0$ for $|w|=1$ if and only if $w=-1$.   My main problem is that this seems obviously like an application of Rouché's theorem, where we let $g(w)=5w^2$, whereupon we have the relation $|f(w)|< |g(w)|$ for all $|w|=1$, with the sole exception that equality holds when $w=-1$.   I would like to use Rouché to equate the number of zeros of $f$ and $g$, but my understanding of Rouché is that the inequality should be strict with no exceptions.


How to find and replace multiple strings in multiple html files?

I'd like to create a list of words that need to be replaced across multiple HTML files. How can I do that?  eg. replace:   cat with dog parrot with monkey fish with tiger   across all HTML files in the selected catalog.


What is the simplest possible experiment that proves that there are atoms?

As I known all the matter consists of atoms. What is the simplest possible experiment (with as little scientific equipment as possible) that can prove that there are atoms?


I have a legal site started in 2011, which used to rank top 5 for a particular keyword now disappeared to 6th page in google organic rankings.  The site hit its peak in 2017, but dropped in rankings dramatically and never recovered as of Oct 2019. You will see in the graph, the massive drop in Jan 2019, is attributed to converting our site from html to wordpress.    I cant seem to think of any other reason , except competitors reporting by site as spam to google. There is no manual penalty or nothing. I disavowed bad links last month, the rankings slightly improved but as as high as 2017 levels. We have setup 403 redirects of all old pages to new pages when moving our site html to wordpress.  The site has excellent quality content despite this rankings never recovered. I have exhausted all options in SEO.   Which google core update or algorithm hit this site? What could have caused this rankings drop?  Any suggestions will give us some hope.


This is mostly out of curiosity.  I was wandering if anyone has encountered any good usage for Object.finalize() except for debugging/logging/profiling purposes ?  If you haven't encountered any what would you say a good usage would be ?


How do I make the  in the center of the page?

I want the div #container to be in the center of the page. Like horizontally and vertically. I tried to make position: absolute; top: 50%; bottom: 50%; left: 50%; right: 50% but it didn't work. And it has to be like in the center of the page no matter the size of the display. Thank you in advance!   Heres my code:    @import url('https://fonts.googleapis.com/css?family=Catamaran:100,200,300,400,500,600,700,800,900|Droid+Sans:400,700|Josefin+Sans:100,100i,300,300i,400,400i,600,600i,700,700i|Open+Sans:300,300i,400,400i,600,600i,700,700i,800,800i|Oxygen:300,400,700|Roboto:100,100i,300,300i,400,400i,500,500i,700,700i,900,900i|Ubuntu:300,300i,400,400i,500,500i,700,700i');  #container {   width: 30em;   background-color: #eee;   height: 30em;   border-radius: 50%;   position: absolute;   top: 50%;   left: 50%; } #wrapper {   width: 30rem;   height: 30rem;   border-radius: 50%; }

sKoolBook

              <form method="POST" id="chooseSchool">        </form>


Does 4.0-72mm on the lens when equivalent focal length is 24-432mm mean crop factor of 6×?

The Samsung WB250F has 4.0mm-72.0mm printed on its lens, and its 35mm equivalent focal length range is 24mm-432mm.    Does that mean it has a 6x crop factor?


Dual boot with windows 8.1 "write the changes to disks?" problem

I have a pop-up message while installing Ubuntu alongside Windows:    Is it normal? If i continue is it format my entire hard disk? What should i do?


Jquery .click() not working with livesearch

I've implemented a live search basing on the string written in an input form. Results are displayed correctly in this way:  <input type="text" class="form-control" name="search_client" id="search_client" required autocomplete="off">

 Joo Fogn

 Peter Nash

   However I'd like to autocomplete the input with the showed result when a user click on one of the possible results.  To do it, I though to intercept the click on the result and give the result value to the input, as follows:  $(".result_name").click(function(){          $("#search_client").val($(".result_name").data("value")); });   However when I click on a result, nothing happens. How can I fix it?


Quality-loss by resampling an image bigger?

If you have an image you want to make bigger(in realife-size for example for printing), I would use the crop tool of Photoshop with WxHxResolution, use centimeters/inches and then set my ppi.  My question is, wether this approach is right and how strong the quality loss then will be, especially when also setting a higher ppi?


What would the punctuation be after "But I had to ask myself"

I want to write this      But I had to ask myself what do I want to learn more of and am I ready to devote myself?   Please help me with this whole sentence punctuation and wording!


Show that $\mathbb{R} \times X \to X: (\lambda, x ) \mapsto \lambda x$ is continuous

I'm proving that on a normed space $(X, \Vert.\Vert)$, the function $\mathbb{R} \times X  \to X: (\lambda, x ) \mapsto \lambda x$ is continuous on its domain, where the domain is equiped with the maximum norm $d_M((a,x),(b,y)) = \max\{|a-b|,\Vert y - x \Vert\}$  I fixed a point $(\lambda_0,x_0)$. I have to prove that:  $$\forall \epsilon > 0: \exists \delta > 0: \forall (\lambda, x) \in \mathbb{R}\times X: \max\{|\lambda- \lambda_0|, \Vert x - x_0\Vert \} < \delta \implies \Vert\lambda x - \lambda_0 x_0\Vert < \epsilon$$  I did the following:  $$\Vert \lambda x - \lambda_0 x_0\Vert \leq (|\lambda - \lambda_0| + |\lambda_0|)\Vert x - x_0\Vert + \Vert x_0\Vert |\lambda - \lambda_0| < (\delta+ |\lambda_0|)\delta + \Vert x_0 \Vert \delta$$  Can I choose $$\delta := \min\left\{\sqrt{\frac{\epsilon}{2}}, \frac{\epsilon}{2(|\lambda_0| + \Vert x_0 \Vert + 1)}\right\}$$   to make the expression smaller than $\epsilon$?


How to extract and join files xxx.zip, xxx.z01 and xxx.z02

I have three files 1.zip, 1.z01 1.z02. I would like to extract and join them into a file, by right clicking 1.zip and selecting "Extract Here". But then there comes an error:     7-Zip 9.04 beta  Copyright (c)   1999-2009 Igor Pavlov  2009-05-30   p7zip Version 9.04   (locale=en_US.utf8,Utf16=on,HugeFiles=on,2   CPUs)      Error: /home/tim/Desktop/1.zip:   Can not open file as archive      Errors: 1   I was wondering what the problem it is and how I can solve it?  Thanks and regards!    ADDED: Is my usage of "unzip -FF" wrong? It seems not work:  $ unzip -FF 1.zip  Archive:  1.zip warning [1.zip]:  zipfile claims to be last disk of a multi-part archive;   attempting to process anyway, assuming all parts have been concatenated   together in order.  Expect "errors" and warnings...true multi-part support   doesn't exist yet (coming soon). file #1:  bad zipfile offset (local header sig):  0   Thanks again!  2nd ADDED: Still ain't right.  $ cat 1.z01 1.z02 1.zip > combined.zip && unzip -FF combined.zip Archive:  combined.zip warning [combined.zip]:  zipfile claims to be last disk of a multi-part archive;   attempting to process anyway, assuming all parts have been concatenated   together in order.  Expect "errors" and warnings...true multi-part support   doesn't exist yet (coming soon). warning [combined.zip]:  209829313 extra bytes at beginning or within zipfile   (attempting to process anyway) file #1:  bad zipfile offset (local header sig):  209829313   (attempting to re-compensate)  extracting: 1.wmv   bad CRC ee181eef  (should be f3c61875)   It generated 1.wmv, which can play well only until  midway in Gnome Mplayer.  3rd ADDED: Am I using 7z wrongly:  $ 7z e 1.z01  7-Zip 9.04 beta  Copyright (c) 1999-2009 Igor Pavlov  2009-05-30 p7zip Version 9.04 (locale=en_US.utf8,Utf16=on,HugeFiles=on,2 CPUs)  Processing archive: 1.z01  Error: Can not open file as archive  $ 7z e 1.zip  7-Zip 9.04 beta  Copyright (c) 1999-2009 Igor Pavlov  2009-05-30 p7zip Version 9.04 (locale=en_US.utf8,Utf16=on,HugeFiles=on,2 CPUs)  Processing archive: 1.zip  Error: Can not open file as archive


For any smooth manifold $M$, does there exist some coordinate chart $(U,(x^i))$ such that $M\setminus U$ has measure zero?

Assume that $M$ is connected. Ideally, I would like $U$ to be connected, though that's not strictly necessary.  If this were true, it would instantly make integration on compact oriented manifolds much easier, since we can simply pass to Euclidean space $\mathbb{R}^n$ in order to evaluate the integral. Intuitively, it seems like it must be true. Consider the following examples:   $\mathbb{S}^n$ – we use the stereographic projection $\mathbb{T}^n \cong (\mathbb{R}/\mathbb{Z})^n$ – we consider $U=(0,1)^n$ $\mathbb{RP}^n$ – we consider $U_0=\{[1:x^1:\cdots:x^n]\, \big\vert\, x^1,\ldots,x^n\in\mathbb{R}^n\}$ If $M$ and $N$ have smooth charts $(U,(x^i)$ and $(V,(y^j))$ defined almost everywhere, respectively, then $M\times N$ has smooth chart $(U\times V, (x^1,\ldots,x^n,y^1,\ldots,y^m))$ defined almost everywhere.   However, I have no clue about how to prove a statement like this, and I suspect that any counterexample would be very difficult to find.


One feature of the SE sites is that many (most?) of the pages will persist their sort and filtering options.  For example, when I click on the Questions link on any of my regular sites in a browser, it always defaults to the Newest sort, because that is how I prefer to read the sites and is the way I more than likely was reading it during my last session.  The iOS app doesn't always do this.  If you goto a site, tap Questions, choose a sort, tap a question, and then tap the back link, the sort persists.  If you goto a site, tap Questions, choose a sort, goto another site, ..., then go back to a site and tap Questions, the sort will be back at Active.  This is inconsistent and annoying.  Please persist the sorts/filters during a session and between sessions.


So for the last few months I've been doing a lot of forecasting for my company and specifically I've been looking at monthly forecasts of total weight of different categories of products output's each month.  I've been using time series models such as Arima, ETS, and tslm() within R to do my forecasting, as well as using cross validation to select a model. Over the last two days I've been presenting my results and discussing implementation of my forecasts.  But, I've been asked the same question multiple times and I don't know the answer to it, so let me ask you guys.  If this has been asked before, I apologize.  I'll write out a few questions that hopefully will make clear what I'm trying to understand.  Also, I'd like to keep technical answers about the models in the context of R, since that's what I'm using.   Do time series models take into account the number of days in a month? Particularly, do time series models consider the number of business days in a month? (or is there a way to incorporate this?) Do we even need to worry about this when forecasting using a time series model or does the model account for this?   For instance, lets say in October of 2014 a certain category sold 35,000 lbs of a product, and that there were 31 days, 23 of which were business days.  Well for this year, 2015, there are still 31 days, but now there are only 22 business days.  Just some background on the data, I have monthly data that starts in August of 2008.    So would it possibly be better to average the weight per month with the number of business days and forecast out this way since the # of business days change month to month and year to year?


Can boot from Win 10 USB stick but not from others

My ASUS T100TA has Windows 10 Home 20H2 installed.  I can boot from a Win 10 USB stick and a Win 8.1 stick but I can't boot from a Ubuntu stick or a WinPE stick. I have tried using Rufus and UUI and using GPT and MBR formats but nothing helps. Safe Boot is disabled. My BIOS does not have Fast Boot. What allows only a Windows USB install stick to work when others won't? Thanks!


What is the difference between a conference paper and a workshop paper?

I recently participated in a conference. Several workshops were organized in parallel with the conference, and I also took part in one workshop to see what kind of material is presented there.  To me, there was no major difference between the conference paper presentations and the workshop paper presentations. Both usually discuss work that is in progress, i.e. could benefit from some new ideas. I didn't see a huge quality difference between workshop paper presentations and conference paper presentations. Both conference papers and workshop papers presented interesting ideas that usually had some merit.  My understanding is that the workshop papers are also peer-reviewed and additionally will be published in conference proceedings. So no difference here, either. Also, in both cases, questions and occasionally even some criticism were raised by the audience.  So, what is the difference in practice between workshop papers and conference papers?  Related question, not exactly the same:


Ive been having problems doing a Ubuntu install () and think it may be the USB stick was not written properly.  How can I write and verify the image (was using windows to do this but do have another Linux box I can use to make the USB). I know there is a verify in the installation menu but would rather do it manualy (i.e. with CLI).


The questions should not display the negative votes

There has been a trend now two persons downvote it then it goes on like that. So let there be down voting but do not display the downvotes till the user votes on it. Else the user reads it with an impression that the question is not good.  Am I missing something?


How to remove Ubuntu 12.10 from dual boot with Win 7?

I have dual booted Ubuntu with Windows 7. I wanted to uninstall Ubuntu. So as per an answer for one of the related questions on this site I did the following:   Deleted the Ubuntu Partition through Windows. As per the answer now I was supposed to boot Windows from USB & then do "repair startup".   But Windows could not find any problem hence nothing was done. So when my laptop booted normally (i.e. from HDD) it was showing some error like GRUB:/ unknown file system. I dont remember the exact words but it was something like this. Thus I couldn't boot windows neither Ubuntu. So again I had to install Ubuntu.  But now my question is how do I remove Ubuntu so that my laptop returns to the previous state of installing Ubuntu?  UPDATE: Seems that it wasnt on this site. My mistake :P .Here is the link


Can we construct a divergent sequence where the difference between consecutive terms is less than epsilon for $n \geq N$?

Can we find examples of sequences $a_n$ where $a_n$ is divergent and for any $\epsilon > 0$, there exists an $N \in \mathbf{N}$ such that $|a_{n+1} - a_n| < \epsilon$ for all $n \geq N$?  My initial guess is that we can construct some sequence that oscillates between two values whose difference can always be made to be less than $\epsilon$. Something like $a_n = \frac{n}{n + 2}$ for odd $n$, $a_n = \frac{n + 1}{n+2}$ for even $n$. Does this seem right?  If so, I think this is a pretty cool way to satisfy both conditions, but it would be even cooler if we could do it with a monotonic sequence. Is there some monotonic $a_n$ that satisfies both of these constraints? Thanks for your time!


Suppose f is a twice differentiable function with $f(0)=0$ and $f(1)=1$, $f'(0)=f'(1)=0$. Then show that $|f''(x)| > 4$ for some $x$ in $(0,1)$

Any help would be appreciated.  My initial attempts were using Lagrange's Mean Value Theorem first between $f(0)$ and $f(1)$ to show that $f'(t)=1$ for some $t$ in $(0,1)$.  Now applying LMV between $f'(t)$ and $f'(0)$, and $f'(t)$ and $f'(1)$ I could prove it if t lies in either $(0,1/4]$ or in $[3/4,1)$. Don't really know where to go next.


Calculating the size of an array by dereferencing its pointer

A colleague of mine asked this question:   The answers are all pretty definitive in that you cannot work out the size of an array that is referenced by a pointer.  My initial thought was to first dereference the pointer and then calculate the size of the array itself. Why would this not work? Does dereferencing the pointer not give you the full array?


I received data saved as geodatabase from Esri (10.x) and want to open or work with it in Qgis 2.0.1. The files are like following    I read a lot in the site about this subject but I still have no idea how it could work.   Can somebody give me step by step advice?


Lenovo z50/70 Laptop doesn't wake up after suspend running Ubuntu 14.10

Once my laptop goes to suspend, it doesn't wake up. I can see the LED lights saying that PC is on but screen remains black.  I am really new to Ubuntu and just recently installed it.   My laptop is Lenovo z50/70  Using Ubuntu 14.10 - haven't really done any customization on it.


How many input pixels influence output pixel in an FCN type architecture?

Let's say I have 8 back to back convolutional layers with zero padding such that the input and output dimensions are the same. There are no max-pooling layers between the layers. All the layers use a 3x3 filter. I want to calculate how many pixels influence each of the output layers. How do I go about doing this?   I know that if there is only 1 layer, then each of pixel in the output is influenced by 9 pixels from the input. If there are 2 layers, then I'm guessing there would be 25 pixels influencing each pixel in the output. This is because if the second layer runs a 3x3 filter over layer 1, then those 9 pixels correspond to a 5x5 grid in the input layer. Am I properly calculating this?


How to temporarily turn off NetworkManager from the command-line?

The network interface should not make a request for an IP over DHCP. So, what is the command to turn off NetworkManager in Ubuntu?   Update:  I am writing a script in which the interfaces receive static IPs. For this to happen I need to put a line in the script which will turn off NetworkManager. But when I'm not using that script I want to have DHCP on the interfaces.


Is there an easy way to figure out which DLCs have you bought already?

Assume you bought a game on steam and 7 out of 10 DLCs that are available for that game. When you go (in the steam application) to "LIBRARY" -> "game XY" -> "DLC", you get a list of all DLCs that are available for the game XY but none of the DLCs are marked as bought or not... (?!) At least I don't see any marks. If you click on a specific DLC though, you get "You already own XY", or the "Buy XY" depending on having/not having the DLC.  Is there an easier way to find out which DLCs you are missing than clicking to each DLC? Perhaps a place (that I haven't found yet) with a list of all the DLCs available for that game and some small icons that would tell you if you have that DLC or not?   I am asking because if a game has lots of DLCs, it is a bit tiresome to click and check all of them.


I have a table where a column with gray background is used. The table has subdivisions: Sub and Type. The gray column (central Total column in the attached code) has white lines/spaces where the subdivision lines are present, between Sub and Type. Can these white lines/spaces removed.  Also there appears a small white patch below the last gray row how can that be removed.    MWE  \documentclass[11pt]{article}   \usepackage{booktabs} \usepackage{colortbl} \definecolor{Gray}{gray}{0.8} \newcolumntype{g}{>{\columncolor{Gray}}c} \begin{document} \begin{table*} \begin{tabular}{rrrr>{\bfseries}grrrrr}\toprule  & \multicolumn{3}{c}{\emph{Sub}} & &  \multicolumn{4}{c}{\emph{ Type}}   \\ \cmidrule{2-4} \cmidrule{6-9}  \textbf{C} & sc & ss & ma & Total& L & B & P & O \\ \midrule 5&  0&  1&  5&  6&  1&  3&  2&  0\\  6&  0&  1&  42& 43& 23& 9&  1&  10\\ 7&  8&  4&  19& 31& 19& 9&  1&  2\\  8&  3&  3&  39& 45& 22& 11& 11& 1\\ 9&  14& 11& 41& 66& 47& 9&  4&  6\\  10& 4&  21& 35& 60& 23& 8&  13& 16\\ \hline \rowcolor{Gray} \textbf{Total} & 29 & 41 & 181 & \textbf{251}& 135& 49& 32&  35 \\ \bottomrule \end{tabular} \end{table*} \end{document}


Here's something I noticed while testing a client-side fix for .  If you follow a permalink / shortcut URL with an https: protocol, like:      you'll get redirected to:      even though, in fact, the https: version of the target URL would work just fine.  This rather frustrates any attempts to fix such links in post text to use HTTPS.  The same happens with other similar shortcuts too.  For example:      redirects to:      However, other non-permalink redirects do retain the correct protocol.  For example:      correctly redirects to:      It seems this is because those redirects are actually using relative URLs in the Location: header, which, while , does seem to work in most modern browsers.  Presumably, the permalink redirects could be changed to work the same way.


This question is building from the .  I am trying to plot the a point on this plot with coordinates 0.7201 + j0.5093.  When I put this point in like this  \node[solid, cross out, draw=black] at (0.7201,0.5073) {};   I also tried  \node[solid, cross out, draw=black] at (35.27:0.882cm) {};   no luck.  The point goes to the left bottom corner of the plot.  How to get this point 0.7201 + j0.5093 to show up like this:    Here is his original solution:  \documentclass[12pt,tikz,border=2pt]{standalone} \usepackage{pgfplots} \usepgfplotslibrary{polar}  \begin{document} \begin{tikzpicture}   \begin{axis}     [       height=15cm,       unit vector ratio = 1 1,       ymin=0,       xmax=1.1,       ymax=1.1,       samples=100,       axis lines=center,       ticks=none,     ]      \pgfplotsinvokeforeach{0,...,9}     {       \def\zet{(.1*#1)}       \pgfmathsetmacro{\factor}{\zet/sqrt(1-\zet^2)}       \addplot[data cs=polar,domain=0:.35*sqrt(1-\zet^2)] (180*\x,{exp(-pi*\factor*\x})         node [at end, sloped, anchor=south,font=\tiny, inner sep=0pt]{$\zeta{=}0.#1$};       \addplot[data cs=polar,domain=.35*sqrt(1-\zet^2):sqrt(1-\zet^2)] (180*\x,{exp(-pi*\factor*\x});     }      \pgfplotsinvokeforeach{.1,.2,...,1}     {       \def\a{#1}       \addplot[data cs=polar,domain=0:\a] (180*sqrt(\a^2-\x^2),{exp(-pi*\x)});     }   \end{axis} \end{tikzpicture} \end{document}


I am getting the following error in the top menu bar:     An error occurred, please run Package Manager from the right click   menu or apt-get in a terminal to see what is wrong.  The error message   was: "Error: BrokenCount>0". This usually means that your installed   packages have unmet dependencies.   Any suggestions?


In Terminal, can I find out the current Finder folder?

It is commonly asked how to get a Terminal prompt from a Finder window.  I am asking the opposite.  I would like a command-line way of determining the working directory of the "current" Finder window.


I've just put a new web page live, and now one of my sentences is bugging me. The sentence in question is:     It was developed internally and made available for the world.   The part that I'm not sure about is made available for the world. Is for correct here, or would the appropriate word be to?   It sounds right to me, but I'm not sure if I'm breaking a rule.


Prove continuous functions $f$ and $g$ are equal

Suppose $f,g$: $\Bbb R$ → $\Bbb R$ are continuous functions such that $f(r) = g(r)$ for all $r$ in $\Bbb Q$. That is to say, $f$ and $g$ are equal on the rational numbers.   Prove that  $f(x) = g(x)$  for all $x$ in $\Bbb R$


Let $G$ be a finite group of order $pq$, where $p,q$ are distinct prime numbers. Show that $G$ is not simple.  Here is my attempt:  $|G|=pq$. If $G$ is not simple, then it has non-trivial subgroups, i.e., subgroups other than the identity and itself.   Let $H$ be a subgroup of order $p$. By Lagrange's Theorem, $|H| \mid |G| \Rightarrow p \mid pq$. Similarly, let $K$ be a subgroup of order $q$ so that $|K| \mid |G| \Rightarrow q \mid pq$. Hence, $G$ is not simple.  I was hoping somebody could verify my proof and point out any errors. As always, any help or advice is greatly appreciated.


salesforce lightning event e.force:navigateToComponent is disabled now?

Yestoday e.force:navigateToComponent is accessble but today  salesforce lightning event e.force:navigateToComponent is disabled ? why?


easiest way to create bootable windows 10 usb from debian

The title describes it all...  I have previously tried with Balena Etcher but it didn't work as expected.  Also, i can't get WoeUSB installed on my Debian because i have some pathetic problems with Snap. Is there another way that is not extremely complicated?


I have been using the garamondx font package with pdflatex to typeset my CV for years without any problems. During my latest round of keeping it up to date, suddenly ligatures no longer want to typeset. MWE:  \documentclass[11pt]{article}  \usepackage{garamondx}  \begin{document} Sufficiently pacific \end{document}   Result (copied from the resulting PDF):  Su`ciently paci∏c   I would argue that this is clearly incorrect. I have tried looking at the documentation, which suggests the addition of \usepackage[full]{textcomp} before loading, but that doesn't have any effect. I've tried using fontenc to change the font encoding, but always get the same result. I also tried uninstalling and reinstalling the package, but to no avail.  Every other font I've tried gets the ligatures correct. I've also tried the ebgaramond and garamond packages, but these versions of Garamond are too heavy for my taste.  Has anyone else observed this behavior? I'm using MikTeX on Windows 7    When I add \listfiles to beginning of the MWE above, the log file contains the following garmondx-related lines:  ("C:\Program Files (x86)\MiKTeX 2.9\tex\latex\garamondx\garamondx.sty" Package: garamondx 2014/10/08 v1.092  `garamondx' v1.092. 2014/10/08 GaramondNo8 with expert features (Michael Sharpe )  ...  LaTeX Font Info:    Try loading font information for T1+zgmx on input line 7.  ("C:\Program Files (x86)\MiKTeX 2.9\tex\latex\garamondx\t1zgmx.fd" File: t1zgmx.fd 2012/10/29 Fontinst v1.933 font definitions for T1/zgmx. ) ("C:\Users\craigim\Documents\My Dropbox\LaTeX\Projects\GaramondMWE.aux") LaTeX Font Info:    Checking defaults for OML/cmm/m/it on input line 7. LaTeX Font Info:    ... okay on input line 7. LaTeX Font Info:    Checking defaults for T1/cmr/m/n on input line 7. LaTeX Font Info:    ... okay on input line 7. LaTeX Font Info:    Checking defaults for OT1/cmr/m/n on input line 7. LaTeX Font Info:    ... okay on input line 7. LaTeX Font Info:    Checking defaults for OMS/cmsy/m/n on input line 7. LaTeX Font Info:    ... okay on input line 7. LaTeX Font Info:    Checking defaults for OMX/cmex/m/n on input line 7. LaTeX Font Info:    ... okay on input line 7. LaTeX Font Info:    Checking defaults for U/cmr/m/n on input line 7. LaTeX Font Info:    ... okay on input line 7. LaTeX Font Info:    Checking defaults for TS1/cmr/m/n on input line 7. LaTeX Font Info:    Try loading font information for TS1+cmr on input line 7.  ("C:\Program Files (x86)\MiKTeX 2.9\tex\latex\base\ts1cmr.fd" File: ts1cmr.fd 2014/09/29 v2.5h Standard LaTeX font definitions ) LaTeX Font Info:    ... okay on input line 7.  ("C:\Program Files (x86)\MiKTeX 2.9\tex\context\base\supp-pdf.mkii"


If $R$ is a commutative simple ring with identity , then is any matrix ring $M_n(R)$ also simple?

If $R$ is a commutative simple ring with identity , then is any matrix ring $M_n(R)$ over $R$  of matrices of size $n$ also simple ?


Are Docker questions on-topic? A question was closed some time ago: . Since Docker doesn't relate to programming, should the tag be deleted?  Should a new one, , be added? This tag would be about the files that are used with Docker instances, and I don't see this as ontopic at Server Fault.