We have JSON HTTP Post request that triggers from  one salesforce object to external system and we want to extend this functionality for other object. This code Fires and creates a Record in external system when the criteria matches. We want to have this functionality on other object in salesforce. I know we can Reuse the code and I don't want to end up creating another Class that does the same thing for different criteria. how do I store HTTP Request in separate class/method and Call out that whenever I need to Here is the code public class RadarUpdate { @future (callout=true) public static void postcallout(string Id) {  //querying patient relations record Patient_Satisfaction__c c = [select id,Name, Patient_First_Name__c,Patient_Last_Name__c, Reporter_Phone__c,Reporter_First_Name__c,Reporter_Last_Name__c, Reporter_Email__c, Description_of_Feedback__c from Patient_Satisfaction__c where Patient_Relation__c ='Referred to Privacy Office' order by lastmodifiedDate desc limit 1]; //generating JSON  JSONGenerator gen = JSON.createGenerator(true); gen.writeStartObject(); gen.writeObjectField('name', c.Patient_Last_Name__c + ', ' + c.Patient_First_Name__c); gen.writeObjectField('incident_group_id', 7448); gen.writeObjectField('description',c.Description_of_Feedback__c); gen.writeFieldName('submitted_by'); gen.writeStartObject(); gen.writeStringField('given_name',c.Reporter_First_Name__c); gen.writeStringField('surname', c.Reporter_Last_Name__c); gen.writeStringField('phone',c.Reporter_Phone__c); gen.writeStringField('email',c.Reporter_Email__c); gen.writeEndObject(); gen.writeFieldName('custom'); gen.writeStartObject(); gen.writeStringField('TRIPSS ID',c.Name); gen.writeEndObject(); String jsonS = gen.getAsString();  System.debug('jsonMaterials'+jsonS); //generating Http request Http http = new Http(); HttpRequest request = new HttpRequest(); request.setEndpoint('https://api.radarfirst.com/incidents'); request.setMethod('POST'); request.setHeader('Content-Type','application/json;charset=UTF-8'); request.setHeader('User-agent', 'Salesforce-integration-client'); request.setHeader('Authorization','Bearer eyJhbGciOiJSU0'); request.setBody(jsonS); // Set the body as a JSON object HttpResponse response = http.send(request); if (response.getStatusCode() != 201) { System.debug('The status code returned was not expected: ' +     response.getStatusCode() + ' ' + response.getStatus()); } else { System.debug(response.getBody()); } }  }

To consume REST services there is a lot of boilerplate code needed:   Build Apex Objects to model the responses Code to deserialize REST responses to those classes Handling of HTTP requests, responses and errors ...   Did anyone come up with patterns or best practices codified into an open source library or framework that one could just reuse in a similar project without reinventing the callout-wheel over an over again?  Like the zillions of trigger-frameworks that exist as repos on Github...


I know Time Machine promises to keep one backup per hour for the past 24 hours, a daily backup for the past month and a backup per week beyond that. What I’m wondering is: if you’ve connected an external Time Machine drive multiple times on a given day, which of those backups gets kept and which ones get deleted?  I had always assumed Time Machine would keep the last backup of a day (and similarly, the last backup of a week), but that doesn’t seem to be true: I made two backups last Sunday and wanted to get a file back from the second one, but found that only the first one is still on the drive. Some digging through the Console logs shows that Time Machine deleted the second Sunday backup yesterday.  Does Time Machine perhaps simply keep the first, rather than last, backup of a day? Or does it use another criterion to decide which backup to keep, for example the smallest or biggest backup of the day?

During its "Cleanup" phase, Time Machine has recently been deleting backups from several months ago—even though these aren't the oldest backups, and my backup drive isn't full.  My backups go back to January 2012, yet just today, Time Machine deleted backups from May 21, June 11, July 2, and July 23 (all in 2012). And plus, my Time Machine drive still has 200 GB free.  Why's it doing this? Shouldn't it just either delete my backups from January 2012 first (if it needs the space), or just delete the expired backups in the past 24 hours or 30 days (based on its normal rules)?


Humans are carbon-based cellular lifeforms, and as such we tend to leave disgusting residue on all surfaces after a while. And I'm sure someone's spilled a few bottles of synthehol at the lounge. And yet, the Enterprise always seems clean.  So who or what cleans this stuff up?  From CGPgrey via the HI podcast.

I have noticed that guest quarters on the Enterprise D have fruit bowls on their tables.  A prominent instance is the fruit bowl in Berlinghoff Rasmussen's quarters in "".  The first thing that Rasmussen does when Data takes him to his guest quarters is take a piece of fruit and shove it in his pocket.  Who replicates fruit for these fruit bowls before guests arrive?  More generally, who removes unused fruit and tidies quarters after guests leave?  Is there a ship hospitality staff, perhaps including Guinan's wait staff in Ten Forward?


By closed universe, I mean just something like 3-D analog of a closed ring or a sphere.  I think it can be one of arguments that the universe must not be closed. Is that right? The paradox is just the fruit of man's imagination that does not actually exist.

Take the following gedankenexperiment in which two astronauts meet each other again and again in a perfectly symmetrical setting - a hyperspherical (3-manifold) universe in which the 3 dimensions are curved into the 4. dimension so that they can travel without acceleration in straight opposite directions and yet meet each other time after time.  On the one hand this situation is perfectly symmetrical - even in terms of homotopy and winding number. On the other hand the Lorentz invariance should break down according to , so that one frame is preferred - but which one?  So the question is: Who will be older? And why?  And even if there is one prefered inertial frame - the frame of the other astronaut should be identical with respect to all relevant parameters so that both get older at the same rate. Which again seems to be a violation of SRT in which the other twin seems to be getting older faster/slower...  How should one find out what the preferred frame is when everything is symmetrical - even in terms of GRT?  And if we are back to a situation with a preferred frame: what is the difference to the classical Galilean transform? Don't we get all the problems back that seemed to be solved by RT - e.g. the speed limit of light, because if there was a preferred frame you should be allowed to classically add velocities and therefore also get speeds bigger than c ?!? (I know  is only a local theory but I don't understand why the global preferred frame should not 'override' the local one).  Could anyone please enlighten me (please in a not too technical way because otherwise I wouldn't understand!)  EDIT Because there are still things that are unclear to me I posted a follow-up question:


When selecting the color of a material, I have the option to change diffuse and specular color. Where do I change the ambient color?  When I export to .obj/.mtl, I get Ka 0.000000 0.000000 0.000000, which I then need to adjust manually.  How can I set this value in Blender?  According to phong model, every object has ambient, diffuse, and specular color. That's why exporting to .obj/.mtl has Ka Kd Ks elements. However, in blender I can only set specular and diffuse color. How can I set ambient color resulting non-zero values of Ka after exporting to .obj/.mtl?

I'm exporting a model from Blender into OBJ and MTL files. When I look at the generated MTL file I see that the "Ka" component of the material is all zeros, and there is no information about the reflectance and translucency of the material either. Have a look:  newmtl BigWall Ns 15.000000 Ka 0.000000 0.000000 0.000000 Kd 1.000000 1.000000 1.000000 Ks 1.000000 1.000000 1.000000 Ni 1.000000 d 1.000000 illum 2   Here the Kd and Ks colours have the correct value (all white) but the Ka is set to black.  I've seen that the illum statement can provide some hints on whether reflectance is used, but it does not give me any coefficients.  So how can I make Blender export the ambient coefficient or an ambient colour to this file? And from where can I take the coefficients of reflectance and translucency?  Thanks.  BTW: I found these similar questions here but they were not answered, I hope to run with better luck:       EDIT: Blender's documentation  claims to be able to export ambient colour and shading settings like transparency.


Question: After enzymes are exposed to high temperatures and undergo denaturation, then returned to their optimal temperature and renatured, can the enzyme's active site return to it's original shape and will it function at the same level of efficiency as it did before being denatured and renatured?  Some background I wrote to the question: I am just beginning to learn Cell Biology, I hope what I've written is correct.  When you raise the temperature of an enzyme, at first it will increase the efficiency of the enzyme's activity, but eventually as the temperature rises, the enzyme with stop functioning and undergo denaturation, which means that the 3D formation of the protein is unraveled, so it doesn't function anymore. From what I've managed to research, the high temperature changes the shape of the active site in the enzyme, which is what allows the enzyme's activity in the first place.  I know that some proteins cannot be renatured (like adding heat to an egg will fry it and there is no way to unfry it), but some can be renatured (like heated milk, when it cools down the protein bonds will reestablish themselves).   But will the enzyme's active site return to it's original shape and manage to function at the same level of efficiency as it did before? Or is the damage permanent?

For computer modeling purposes, I am looking for some referenced quantitative measurements of the effect(s) of temperature on biochemical reactions.  Question  In particular, my question is:  How does temperature influence the rate of protein degradation?  Reducing the scope of my question  My question might be too broad in the sense that there might have too much variance in how different proteins respond to temperature in order to draw in general tendency. If this is so, someone willing to answer may reduce the question to transcription factor, to  or even to .    I am NOT looking for..  I am not looking for a theoretical explanation of how temperature influences this process (I have basic understanding of the importance of the activation energy as displayed on a Maxwell-Boltzman distribution and of the Michaelis-Menten equation).  I am looking for..  I am looking for a function that I can plug in my algorithms to incorporate the influence of various temperatures on the process I want to simulate. I want to simulate the average gene network from an average standard eukaryote. For other purpose, I chose parameter values coming from the yeast. A index such as the  would be very useful as well.  Similar already-answered question  Similar questions have been asked and answered  and


Is there an example of a ring $A$ (with unity) which is isomorphic as unital rings to $A\times A$?  Any such ring can't have invariant basis number so in particular can't be commutative.

I know from  that $R \times R$ can be isomorphic to $R$, as $R$-modules.     But can they ever be isomorphic as rings?


Should I be buying workstations and servers from Dell/HP or build them myself? What exactly are we paying these companies extra for?

This is the  for "Should I build coomputing hardware myself?" questions.   I have put together countless PCs, but never a large server. The geek in me says build it, but the realist in me says let the manufacturer handle it when there is a problem. Ignoring the time penalty involved with the initial assembly time of a built one, which is a better solution? Have you ever run into a problem with a home build server that would have been solved easier/quicker/cheaper by going with a manufacturer? Are there any features that manufacturers give that aren't easily attainable with a home built server?


When I type a program name in Windows Command Line (e.g. sfc), the sfc.exe is executed. I understand that the program is in Path environment variable so it gets found. My question is how does sfc execute sfc.exe? Is this some aliasing?

On Windows 10, I have a file called truffle.js in my current folder. I write truffle in the cmd window, expecting to invoke the truffle program which resides elsewhere on my path.  Instead, truffle.js is opened in my favorite IDE (.js files are associated with that IDE). I thought this behavior is only like this for executable files, .bat, .com and .exe. Why does it happen for a .js file?  Note: I subsequently discovered I have no truffle at all installed on my path, but my question remains: why is Windows completing the extension which I did not specify on a non-executable file?  Even after installing truffle and restarting cmd, I can't get the real truffle to run in a folder that contains a file truffle.js.


My book says that that a set is closed if its complement is open. Can a set be closed for other reason or is this if supposed to be an iff? Is there a way to prove this statement?

I was wondering if this proof was right.  $\Leftarrow$ Suppose $E$ is closed. Then choose $x\in E^{c}$, then $x\notin E$, and so $x$ is not a limit point of $E$.   Hence there exists a neighborhood $N$ of $x$ such that $E \cap N$ is empty, such that $N \subset E^{c}$. Thus $x$ is an interior point of $E^{c}$ and $E^{c}$ is open  $\Rightarrow$ Then suppose $E^{c}$ is open. Let $x$ be a limit point of $E$, then every neighborhood of $x$ contains a point of $E$, so that $x$ is not an interior point of $E^{c}$. Since $E^{c}$ is open, this means that $ x \in E$, Therefore $E$ is closed.


I'm given a system represented by a Hilbert space $L^2([0, 1])$.  In this space, the momentum basis is $\frac{1}{\sqrt{L}} \exp{\frac{2 \pi i nx}{L}}$. It seems like Heisenberg uncertainty would be violated for any particle in a momentum eigenstate. So I reasoned that this is somehow equivalent to the particle in an infinite box. But the problem seems to still exist there:    If we have a particle in an infinite box of width 1. We measure its momentum. Now it's in an eigenstate of momentum, such that $\Delta p$ is 0. And $\Delta x \leq 1$ (since the particle must be inside the box). Obviously something is wrong with this reasoning. What's wrong?

Let a (free) particle move in $[0,a]$ with cyclic boundary condition $\psi(0)=\psi(a)$. The solution of the Schrödinger-equation can be put in the form of a plane wave. In this state the standard deviation of momentum is $0$, but $\sigma_x$ must be finite. So we find that $\sigma_x\sigma_p=0$. Is something wrong with the uncertainty principle?


I have created a dynamic table where by a click of a button it will generate a new row every time the button is pressed. Everything works as it supposed to but the class attribute in the select tag or any other input does not work properly. How do I get it to work. Any Idea??  Here is the .js code that works and adds new row on button click:          $('.plusbtn12').click(function () {             $(".quoteTable12").append('
<select class="js-select2 form-control c_solutions" name="i_solution[]" style="width: 100%;" data-placeholder="Choose one.."></select>	<input class="form-control" type="text" name="i_quantity[]" placeholder="Quantity">	<input class="form-control c_costing" type="text" name="i_cost[]" placeholder="Cost">
');              var options = "";              $.getJSON("getSolution12.php", function (data) {                  for (i = 0; i < data.length; i++) {                     options += "<option>" + data[i] + "</option>";                 }                  $('.quoteTable12 tr:last').find('.c_solutions').html("");                 $('.quoteTable12 tr:last').find('.c_solutions').append(options);                 $(".c_solutions").change();              });         });

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


I have been staring at this integral for a while and I don't quite know how to take the first step. Is there some trick that I have to use to manipulate the function first?  Integral in question:  $$\int^{2\pi}_0 \frac{dx}{a + \cos x}$$  Any help/hints/insights is deeply appreciated.

Let $a<1$ be a positive constant. How can I compute the following integral?  $$ \int_{0}^{2\pi} \frac{1}{1 + a \, \, \cos(x)} dx  $$


I'm new in econometrics and I'm working in a probabilistic model and using Stata for this, but when I was going to compare the Logit and Probit I did not know which one win in this case, because there is a tie between them. If somebody could help me, I would be so grateful.

What is the difference between  and ?  I'm more interested here in knowing when to use logistic regression, and when to use Probit.  If there is any literature which defines it using , that would be helpful as well.


I have run into a weird unresolved external symbol error with this class. I have a C++ library based on Qt where LIBDATASHARED_EXPORT is an alias for __declspec(dllexport) or __declspec(dllimport).  class LIBDATASHARED_EXPORT SaveFile {     class Index     {     public:         operator bool() const; //<--- defined in cpp     };  public:     template<typename T> load()     {         Index idx;          if(idx) //<--- complains about unresolved symbol...         {          }     } };   When I use this in another project where I link with the library I get the unresolved external symbol about the SaveFile::Index::operator bool() const when instantiating the template method. When I put the definition of SaveFile::Index::operator bool() const in the header it works fine. The definition of SaveFile::Index::operator bool() const is indeed in the same .cpp file as the rest of the class' definitions so it should be defined at the point of instantiation.  What is the problem here and how do I fix it?

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


So before the page redesigns I (and not only me I guess) got problems with being unable to get the flag summary without switching to address bar if I had no flags - the number was shown only if you have some helpful ones.  Since the page redesign the activity tab has a link to your flags which looks like "X helpful flags". But wait, it doesn't appear to be a link if I have some declined, disputed, aged out or active flags, but no helpful. Please make it be a link always.

The Problem  Currently if I flag a post, I cannot check the status of the flag unless I have prior helpful flags. This means, for example, that a new user who wants to check the status of his first flag cannot do so while it is pending (active).  This feature request is based on my experience on MSO, where I wanted to check the status of my flag but could not get to the summary page without cheating (tweaking my SO link to work with MSO). It also stems from this question, where the OP indicates he had the same issue:   My Proposal  If I have flagged any post, then show me a "flags" link (red arrow in image below). If I have any helpful flags, then the number of helpful flags should be displayed (blue arrow). If I have not flagged anything, then neither should be displayed (as with current site functionality).


I installed Ubuntu 16.04, encrypted home directory. Jotted down system info including password, etc., in a document which will presumably be in /home/mike/somewhere. Hadn't printed the file to hardcopy yet. Installed steam, which when executed hard-crashed the machine, no jumpout to F1, no ssh'ing in from local machine, nothing. Rebooted, and realized I cannot remember my robust password nor had I printed out my file.   How do I reset the password is the question?  Before you answer, here's what I've tried and does NOT work in Ubuntu 16.04 under these circumstances:   Booting in to recovery mode, dropping to command line gives "Give root password for maintenance" Booting and pausing at grub stage, editing the boot line by changing ro to rw and add init=/bin/bash, (also deleting the splash text, i can't remember the exact words), hitting F10 to boot with new options, results in blank screen, then the regular GNOME GUI log-in. Tried a few variations on this. Booting from live USB stick, dropping into terminal with F1, I can log in, and sudo. Hope is born! I mounted /dev/sdb2 (my Linux installation) to /mnt, sudo chroot /mnt. I change to /mnt. I successfully change mike's password. Reboot: rejects the new password.   I had made a second user on the machine to run a process, and that home directory is not encrypted. I did the live USB stick boot, dropped into terminal, changed password on the second user, and promoted him to a sudo-er as well. Rebooted normally, logged in as him, am able to change password for mike, sudo into mike: all variations on this theme result in asking for passphrase to unencrypt the home directory.  Is this hopeless or is there a back door I don't know about?

I am using a cloned hard drive in attempts to restore some old files.   The cloned drive has 2 users, one with an encrypted home drive, one without. Both are administrators. When I couldn't get into the main user (with the encrypted home directory), I logged in as the 2nd user and changed the password.   It seems that I somehow broke the relationship between the encryption passphrase and the user. I'm pretty sure I have the passphrase. Is there a way to get to the data?


I have found a cool world and I'm trying to get the seed for it. Is there a command or setting for it?

When a map is created randomly, how can we find the seed that it has generated ?  I want to find some cool map in single player and when I'll find one, I want to get that seed and create it on my SMP server.


On the new , there is a top tag section of the reputation box, which shows the reputation earned next to the name of the tag.  However the hover tooltip is unnecessarily squished horizontally making it hard to read. This seems to be regardless of the length of the tag.           Could the width of this tooltip be extended, like the other tooltip for the total reputation earned?

Update:  Thanks for all the feedback and bug reports! I am locking this thread so people don't keep answering it when we no longer monitor it.  If you see a bug or want to raise a feature request, please do so in the usual manner, as a new question.    Some of you may have noticed that  the  and  pages that we have been talking about for a while now on .  Most? Well, yes, the new design is dependent on a SE network-wide update (a new base css framework) that the design team have been working on. This is an ongoing effort and we will be launching the new pages as sites are moved to the new design.  You've all been hugely helpful already - much of what we love most in here came from  and  you gave us on Meta.     But it's possible that it's not quite perfect yet. If you find any bugs and have any feedback to give, please post these as answers to this post.  Just post one issue per answer - that would help us focus on specific items one at a time.


We have a Java rcp product, we need to generate results reading an xml file ie,Data source is XML file. Which tool / library I need to use to view/ populate xml data in bar,pie charts ?

I know the following libraries for drawing charts in an SWT/Eclipse RCP application:    (Links to an article on how to use it)    Which other libraries are there for drawing pretty charts with SWT? Or charts in Java generally? After all, you can always display an image...


The story is about a series of anomalous incidents leading to the death of many people. Turns out, these explosions centered around dogs. Aliens are in orbit, intent on destroying every dog on the planet because their extrapolations show how dogs will be the triumphant race in the universe. The story ends deep underground where the military has a bunch of dogs, and they're training them to get revenge on those aliens. Last scene is from a dog's point-of-view, about wanting to feel grass under his feet, sunshine on his face, and wanting to please humans by chasing a ball.

I read a SF short story years ago, I think it may have been in high school back in the 1970s. Aliens come to earth, to kill all the dogs, because they see Man as destroying himself, and dogs as evolving to take Man's place, thus being a threat to the aliens. Humanity agrees to kill all the dogs to get rid of the aliens, but in fact have taken border collies (?) deep underground in order to save them and ensure that they evolve.  Does anyone know the title/author of this short story?  Thank you in advance for your assistance.


Here is my error message:   Round 0 of The War  Player 0: Exception in thread "main" java.lang.NullPointerException     at WAR1.printHand(WAR1.java:113)     at WAR1.main(WAR1.java:93)   This is the code:  import java.util.Scanner;   public class WAR1 {      private int cardNum;     final static String[] suits = {"Spades", "Hearts", "Diamonds", "Clubs"};     final static String[] ranks = {"2", "3","4","5","6","7","8", "9","10", "Jack", "Queen", "King", "Ace"};      WAR1 (int theCardNum) {         setCardNum (theCardNum);     }      public void setCardNum (int theCard) {         cardNum = (theCard >= 0 && theCard <= 51)? theCard: 0;     }      public int getCardNum() {         return cardNum;     }      public String toString() {         return ranks[cardNum%13] + " of " + suits[cardNum/13];     }      public String getSuit() {         return suits[cardNum/13];     }      public String getRank() {         return ranks[cardNum%13];     }      public int getValue() {         return cardNum%13;     }         private WAR1[] deck = new WAR1[52];     private int topCard;      WAR1() {          topCard = 0;          for (int i = 0; i < deck.length; i++)             deck[i] = new WAR1();      }      public void shuffle() {          topCard = 0;          for (int i = 0; i < 1000; i++) {             int j = (int)(Math.random()*52);             int k = (int)(Math.random()*52);             WAR1 tmpCard = deck[j];             deck[j] = deck[k];             deck[k] = tmpCard;         }     }      public WAR1 dealCard() {         WAR1 theCard;         if (topCard < deck.length) {             theCard = deck[topCard];             topCard++;         }         else             theCard = null;          return theCard;     }        public static void main(String[] args) {          WAR1[][] hands = new WAR1[2][1];          Deck myDeck = new Deck();          for (int i = 0; i < 26; i++) {             System.out.printf("\n Round %s of The War \n", i);                   for (int player = 0; player < hands.length; player++)                     hands[player][0] = myDeck.dealCard();              for (int player = 0; player < hands.length; player++) {                 System.out.printf("Player %d: ", player);                 printHand(hands[player]);             }              int player1 = hands[0][0].getValue();              int player2 = hands[1][0].getValue();              if (player1 > player2)                 System.out.println("Player One Wins The War");             else if (player2 > player1)                 System.out.println("Player Two Wins The War");             else                 System.out.println("The War Is A Tie");          }     }       public static void printHand(WAR1[] hand) {          for (int card = 0; card < hand.length; card++)             System.out.printf("%s", hand[card].toString());          System.out.println();      }  }   What am i doing wrong??

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


Question:  A roulette wheel has 21 red, 21 black numbers and 4 zeros, A player places $20 bets on red numbers. If the roulette wheel spins a red number the player gets his $20 back and wins another $20. If the roulette does not spin a red number the player loses his bet. the player sits down with $40 and keeps playing until he has no money. How many spins can he expect to be able to play until he has no money?   This problem has got me in a bit of a pickle. I know I have to use the binomial theory but I am getting confused on what you would consider the number of successful trials.  Eg. to go bust after 2 spins you would have to land on a colour other then red twice. This probability is 23/44 and each event is independent.   For 4 spins there are 2 ways to go bust. For 6, there are 4 ways to go bust and so one and so forth.  I am not sure if I am heading the right path but the probability of going bust after 4 attempts say is:  Pr(x=4) = 2!/(2-4)!*4! * (21/44)^4!(23/44)^(4-2)...  Am I heading down the right path?

A roulette wheel has $21$ red numbers, $21$ black numbers, and $4$ zeros. A player places $20$ dollar bets on the red numbers. If the roulette spins a red number, the player get his $20$ dollars back, and wins another $20$ dollars. If the roulette does not spin a red number, the player loses his bet. The player sits down with $40$ dollars, and keeps on playing until he has no more money. How many spins can he expect to be able to play until he has no more money?


It's been going on for some time, but the phenomenon which was once seen as almost an act of rebellion is now becoming more commonplace. God, capitalized, is increasingly seen only at the start of a sentence. Leaving aside whether one believes in a god, or in the Christian God Himself, why is this convention not being criticized?   God is after all a proper noun, the name of a deity which for over 2,000 years we have all heard of, and know by that very name. It matters not that god or God may or may not exist. It is a name. And like any other name that belongs to a real person or a fictional character in a book, it ought to be spelled with a capital letter.   I always feel uncomfortable writing about God with a capital letter, I always feel there is a hoard of die-hard atheists ready to accuse me of being a creationist, god forbid. (Should that have been: "..., God forbid"?)  Is the spelling of the Christian "God" politically incorrect?  Is God with a capital letter, grammatically speaking, an archaic tradition? And if so, why?  EDIT: From the answers so far posted, no one has yet mentioned the political and social consequences this deceptively innocent, lowercase spelling may have had on us, on today's society. And this has lead me wondering, whether in the history of the English language there has been anything similar; any linguistic subversion, spoken or written which was in reality a show of defiance toward an established authority such as a government or political leader.

Aside from proper noun usage, like "We're on a mission from God", when should "God" be capitalized? A few examples:   That's a god awful question. Oh my god! No god-damn way. He played the part of the cannibal god   It occurs to me that whenever used for decisive emphasis, by referencing deity, it is effectively functioning as a proper noun as well? For comparison:   That's a really awful question. Oh my stars! (no viable equivalent) He played the part of the cannibal chief   PLEASE, no rants or tangents. This is a grammar question.


I am using an Motorola XT1022. I have moved the games and apps from the internal to SD card to free the internal memory, but still there are some moved apps files that are occupying the internal memory. So I can't install any other apps.  Can you tell me how to move that apps files to the SD card?

I have noticed that when I move apps to the SD card, it doesn't move everything. Is this a bug or a known behaviour or something weird going on with my phone?  Here's an example:   Start point: Phone free space: 18MB Install Skype app: Phone free space: 3MB, Skype is apparently using 15MB for the App Move Skype to SD Card: Phone free space: 8MB, Skype is now apparently using just 5MB for the App.   What appears to have happened is it's only moved some of the App, not the whole thing. It's a real pain for me as I have an HTC Desire, which doesn't have much internal memory (I live on the balance of the low memory warning). It's running the official HTC Gingerbread install...


My aim is to edit the file (whose owner is user1) using a script where user2 doesn't have permission to directly edit the file but it should be edited when executed through script by user2. So I set SUID on the script My script has the following content  #!/bin/sh echo "Enter variable a" read a echo "Enter path" read Path echo "Enter variable b" read b sed -i -c "/#Hello variable \<$a\>/{h;n;s/\$Initial_Value=.*/\$Initial_Value=$b/}" "$Path"   The script replaces some matching pattern in the file provided as input Permissions of the script are as follows  -rwsr-xr-x 1 user1 user1 648 Jul 21 08:03 Script.ksh   Permissions of the file which script modifies are as follows  -rwxrwxr-x 1 user1 user1 224 Jul 21 10:46 file   Permissions of the directory under which the file is present  are as follows  drwxrwxr-x 6 user1 group1 122880 Jul 22 11:17 directory   The script is executed by user2 who is part of group1 where the file exists, and executing user2 will not have permissions to directly edit the file.  To edit the file indirectly using script I have set SUID bit on the script. I thought that when executed by user2 it will get executed with the permissions of user1 But when I am executing the script, SED is giving below error.  sed: cannot copy Path/sedFKvRSo to Path/file: Permission denied

As an experiment in playing with the suid bit, I tried writing a script to run apt-get update from a bash script, and then set the suid bit on it, so I could just run ~/update or something.  apt-get update could be anything here - some program that listens on a privileged socket, or writes to / or anything else that has to be run as root. Please don't latch on to apt-get update here.  First try is this, which didn't work, failing with can't get lock, are you root?. The reason would seem to be .  #!/bin/bash apt-get update   So I thought I'd try to bypass the shell, but this didn't work either, for the same reason.  #!/usr/bin/perl system("apt-get", "update").   I've got the permissions correct (afaik) - sudo chmod 4755 ~/update.  Have I misunderstood setuid, or am I just missing something simple?


While taking refuge from the , I ended up on my profile page, whereupon I came across the most awful bug.       There should be  space in there!

A little pedantic, but once I noticed it I couldn't unsee it.   When I hover over the tag score for a user who has asked and answered a question in the tag on Meta, there is no space after the first period.  For example, if I hover over my score for the  tag, I get this:        I also tried an example on the main site, hovering over Jon Skeet's tag score for generics. Sure enough, the space was there. (I haven't asked a question on the main site, so couldn't use my own profile.)  UPDATE: As pointed out by @MichaelLiu on  question, the space is now missing on the main site too. Here's his image:        Can we add the spaces back?


Also, why is the weak interaction force $10^7$ times smaller than the strong nuclear force?

Why is gravity stronger than other forces at the macroscopic level, yet weaker than other forces at the quantum level? Is there an explanation?


My understanding is that general relativity concludes that gravity isn't real because it does not exist in all frames of reference. Also that mass and energy warp spacetime into a curved geometry. Does that then mean that objects in orbit are actually traveling in straight lines in curved spacetime?

Firstly I think shades of this question have appeared elsewhere (like , or ).  Hopefully mine is a slightly different take on it.  If I'm just being thick please correct me.  We always hear about the force of gravity being the odd-one-out of the four forces.  And this argument, whenever it's presented in popular science at least, always hinges on the relative strength of the forces.  Or for a more in depth picture .  But, having had a single, brief semester studying general relativity, I'm struggling to see how it is viewed as a force at all.  A force, as I understand it, involves the interaction of matter particles with each other via a field.  An energy quantisation of the field is the force carrying particle of the field.  In the case of gravity though, particles don't interact with one another in this way.  General relativity describes how space-time is distorted by energy.  So what looked to everyone before Einstein like two orbiting celestial bodies, bound by some long distance force was actually two lumps of energy distorting space-time enough to make their paths through 3D space elliptical.   Yet theorists are still very concerned with "uniting the 4 forces".  Even though that pesky 4th force has been well described by distortions in space time.  Is there a reason for this that is understandable to a recent physics graduate like myself?     My main points of confusion:   Why is gravity still viewed as a force? Is the interaction of particles with space time the force-like interaction? Is space-time the force field? If particles not experiencing EM/weak/strong forces merely follow straight lines in higher-dimensional space (what I understand geodesics to be) then how can there be a 4th force acting on them?     Thanks to anyone who can help shed some light on this for me!


Apologies of this has come up recently / been done to death, I've only just discovered Meta Stack Overflow.  I signed up for Stack Overflow just after its launch nearly a year ago, and the quality of answers was so high it was a genuinely fantastic resource.   However, my recent experiences have been anything but positive. It appears to me now:   Users are only interested in spraying quick answers in the hope of gaining some reputation points Users have no real interest in following up and engaging in dialogue or answer improvement Any question that is 'deep' or difficult or cannot be answered with a quick, fired-off, answer, either doesn't attract any response at all or attracts facile / low grade / sarcastic answers A lot of the high quality users have lost interest People seem more interested in having a rep than actually answering, helping, guiding, teaching and sharing knowledge   I am finding myself returning to some of the older specialist forums after being frustrated here, and actually getting better answers and discussions than I can here.  Has anyone else experienced this? Is anything in the works to try and tackle it?   Edit: Why the down vote? Is anything even slightly critical of Stack Overflow deserving of instant opprobrium?   Some points:   I am in no way criticising Jon Skeet and the other 'power' users who have given a huge amount of their time and knowledge, they are fantastic guys but they can't be expected to answer everything I know it's a question and answer site. Providing a response and following up with edits in response to questions or requests for clarification about an answer is what made Stack Overflow so good originally and should be a fundamental part of what happens here. I don't have a problem with quick answers - if they're useful then all the better if they're also quick, who needs an answer six months later? I don't expect people to code solutions for me - I'm a self-starter, self-finisher and happy to figure things out from suggestions from experienced guys. I don't need or want to be force fed.   , asked today, clearly explained and not too deep, technical, or obscure. All I was looking for was a response from someone technically competent and with a bit of experience solving the problem I had posted about. Instead I got one facile answer, one completely sarcastic answer and one that made a vaguely interesting point about associative databases but still fairly useless given the question. You be the judge..

Today I had some time and felt like writing a relatively good answer on Stack Overflow; explaining both the underlying mechanisms and good practices, unlike usual declarative answers in a "do that" style.  It took me like an hour of time, $50 if I were free lance. It'll bring me nothing but 3-5 occasional views, and - if I get lucky - some ignorant comments.  You know, it's quite discouraging.  Instead of pride for the job that was done, I feel frustrated. I know, this answer may offer help to the OP, if he ever notices it (being already satisfied with other answers).  So the only fate the answer will meet is to sink forever, below thousands other questions, falling like snow.  So, being a programmer, I am thinking of efficiency. It's a waste of time to spend so much effort to answer one question when there is no way to [actually] reuse it. So, I wouldn't do it again but just turn back into short answers mode without explanations.       Seeing other answers, I don't think I am only one with such feeling.  The current policy is driving knowledgeable and educational users away, yet it attracts inexperienced ones in numbers. Ones who will tell you to use [some technology] which they never have laid their hands upon. Ones who write answers just because they have learned some "good practice" from other questions, and this "knowledge" becomes an endless source of rep points.  The idea of Stack Overflow is rotten. It was excellent when trees were high and traffic was low.  It turned bad now; it has become a honeypot for all the "enthusiast programmers" of the world, eager to share their 2 cents faster than you can say the word "close".  You're killing a great resource. Despite all the nice words and proper declarations, it discourages the reuse of the knowledge. And encourages fast on-site answers.  Of course, the rules will tell you contrary. It's all nice and proper (if you don't mind it's strict mutual exclusivity). But mechanically, technologically it works in the way I described.  I tried to write a tag wiki. You know, it was biggest waste of time in my life. As a matter of fact, it is not a wiki at all; you can't even link to a certain section. Not to mention that nobody ever has the idea to read tag wikis.  Reference questions? Don't make me laugh. There is no good mechanism to store and categorize links. Favorites, although intended for the different purpose, are a chunk of crap when you want to use it as a reference. So, you can't compete with 30-seconds answers: a question will get 5 answers before you can even find an appropriate link.  Okay, I can organize links myself but, there are some problems:   I am just a human. I cannot remember everything I am just a human and I cannot answer questions at rate of 1 qpm. One person cannot fight the Tide. It's helpless. When technology makes people writing fast [incomplete] answers -  no good will of proper declarations can do a thing.  Even if a question gets finally closed, it won't hurt anyone - the hydra grew two more already.   You'll call me a brute for insulting honest users and innocent volunteers, but that's fact: There are much more inexperienced users than experienced ones. And inexperienced users have much more spare time to hang over than experts who have their job to do. So, from that fact we can conclude that most of the answers on Stack Overflow have a low quality. Nobody cares. But I do.   There should be a technical way to limit the activity of not-so-knowledgeable-yet-eager-to-answer users. There should be a technical preference for the closing a question over answering it (have a silly answer for the silly question? welcome to comments). There should be a technical solution to accumulate and structure knowledge, a system that lets you choose a good answer instead of writing it by hand.   That's the only way. Otherwise Stack Overflow will remain an automated dispenser of bad practices.  Well, I just felt like letting it out again. Thank you for reading.


For $(x,y)\in R^2$, consider the series $\lim_{n \to \infty} \sum_{l,k=0}^n \frac{k^2x^ky^l}{l!}$. Then the series converges for $(x,y)$ in $ \\ 1.(-1,1)\times(0,\infty)\\ 2. R\times(-1,1) \\ 3. (-1,1)\times(-1,1) \\ 4. R\times R $   I considered the series separately. The series $\sum_{k=0}^n {k^2x^k}$ converges for $x<1$ and the series $\sum_{l=0}^n \frac{y^l}{l!}$ converges in (0,$\infty$) and in $[-1,1]$. I don't how to solve further, can we apply Able's test here?

For $(x,y) \in \Bbb R^2 $ ,consider the series $\lim_{n \to \infty } \sum_{l,k=o}^n \frac{k^2x^ky^l}{l !} $ .Then the series converges for $ (x,y)$ in   1.$(-1,1)\times (0, \infty )$                     2.$\Bbb R \times (-1,1)$   3.$(-1,1)\times(-1,1)$                            4.$\Bbb R \times \Bbb R $  I don't know how to find the convergence of series in $\Bbb R^2$ .


I have exceeded my account registration, (which is one), and I want to reset all of my Minecraft settings - I want everything deleted except Minecraft itself because I still want to play on servers.   So I need to know how to wipe out Minecraft out or delete previous account registrations.

When I open the game, the screen stays at the Mojang sign and then crashes. It has something to do with my texture pack, but I can't start the game to change it and it won't let me delete the texture pack folder alone.  I've already deleted the bin and resources folders in the minecraft folder and downloaded the game again. I opened it but the same problem was still there.  How do I properly perform a clean uninstall of the game?


CREATE PROCEDURE procedura @Dzien date = GETDATE AS SELECT DATENAME(WEEKDAY, @Dzien) 'Jaki dzień tygodnia?' GO   When I use normal execution, then it works: EXEC procedura @Dzien='01-01-2010'; It doesn't work without declared value: EXEC procedura;  Any idea why it is so? Thank You in advance for the reply.

I tried changing a default parameter value with this:  ALTER PROCEDURE [dbo].[my_sp] @currentDate datetime = GETDATE()   and all the SQL pre-compiler gave me was this error:     Msg 102, Level 15, State 1, Procedure my_sp, Line 8 Incorrect syntax near '('.   I have already created the procedure. (I'm not sure if that's relevant.) I was using a null default value and checking for that later, but that doesn't seem proper. Can I do this in one line?   Update: I was going off of :      [ = default ] Is a default value for the parameter. If a default value is defined, the function can be executed without specifying a value for that parameter.            Note:     Default parameter values can be specified for CLR functions except for the varchar(max) and varbinary(max) data types.         When a parameter of the function has a default value, the keyword DEFAULT must be specified when the function is called to retrieve the default value. This behavior is different from using parameters with default values in stored procedures in which omitting the parameter also implies the default value.   Am I reading this wrong?  Many thanks.


I am taking the course on Machine Learning and unable to grasp the concept of MLE for linear regression. Can anyone give some numerical example ? Most of the content I read on internet was theoretical.  Following is my understanding : For estimating MLE I will need input variable vectors (say X ), Output variables (Y), and σ². If Model is Y = (A1) + (A2)X + e, then I have to maximize P(Y|X,σ²) and find out value for A1 and A2 is this correct?  Thanks.

Notation: $\textbf{w}$ is an M-dimensional vector of parameters (including the bias parameter), $\textbf{x}_n$ is an M-dimensional vector of the features of each training example, $\textbf{t}$ is an N-dimensional vector of target values - where $t_n$ is the output of the nth training example and finally, $\Phi$ is an $M \times N$ design matrix.  During studying linear regression, I naturally came across the derivation of the normal equation. In his book, Christopher M. Bishop begins by the log of the likelihood function given by:  $$ \frac{N}{2} \ln \beta - \frac{N}{2} \ln(2\pi) - \frac{\beta}{2}\sum_{n=1}^N\{t_n - \textbf{w}^T \phi(\textbf{x}_n)\}^2 \tag{1} $$  With the goal of calculating the maximum likelihood of the parameters, he then calculates the derivative with respect to $w$:  $$ \bigtriangledown p(\textbf{t}| \textbf{w},\beta) = \beta \sum_{n=1}^N\{t_n - \textbf{w}^T \phi(\textbf{x}_n)\}\phi(\textbf{x}_n)^T \tag 2 $$  After which he sets the derivative to zero, in order to maximise the likelihood function  $$ 0 = \sum_{n=1}^N t_n \phi(\textbf{x}_n)^T - \textbf{w}^T \bigg(\sum_{n=1}^N \phi(\textbf{x}_n)\phi(\textbf{x}_n)^T \bigg) \tag 3 $$  So far so good. But then, the result for the maximum likelihood of the parameters $w$ is written as:  $$ \textbf{w}_{ML} = (\Phi^T\Phi)^{-1} \Phi^T \textbf{t} \tag 4 $$  My own derivation from equation $(3)$ to equation $(4)$ goes along the following lines:  \begin{align*} \Phi^T \Phi \textbf{w} &= \Phi^T \textbf{t} \tag 5 \\  (\Phi^T \Phi)^{-1} \Phi^T \Phi \textbf{w} &= (\Phi^T \Phi)^{-1} \Phi^T \textbf{t} \tag 6 \\ \textbf{w} &= (\Phi^T \Phi)^{-1} \Phi^T \textbf{t} \tag 7 \end{align*}  My question is this: How does one go from equation $(3)$ to equation $(4)$. How does the supposed $ \textbf{w}^T \phi(\textbf{x}_n) \phi(\textbf{x}_n)$ become $\Phi^T \Phi \textbf{w}$ ? I do of course understand that given the dimensions of the matrix $\Phi$ and the vector $\textbf{w}$, that this is the only way to multiply the two entities. But what is the steps that one would follow in a formal derivation in order to reach such a result?


$ file /etc/alternatives/java /etc/alternatives/javac /etc/alternatives/java:  symbolic link to /usr/lib/jvm/java-11-openjdk-amd64/bin/java /etc/alternatives/javac: broken symbolic link to /usr/lib/jvm/java-11-openjdk-amd64/bin/javac

On Ubuntu 12.04 LTS I have installed Sun's JDK7, Eclipse, and the Arduino IDE. I want the Arduino to use OpenJDK 6 and want Eclipse to use Sun's JDK 7.   From my understanding I need to manually choose which Java to use before running each application. This led me to the update-java-alternatives -l command. When I run this I only see the following:   java-1.6.0-openjdk-amd64 1061 /usr/lib/jvm/java-1.6.0-openjdk-amd64   but when I run update-alternatives --config java I see the following:   *0  /usr/lib/jvm/java-6-openjdk-amd64/jre/bin/java   auto mode 1  /usr/lib/jvm/java-6-openjdk-amd64/jre/bin/java   manual mode 2  /usr/lib/jvm/jdk1.7.0/bin/java                   manual mode 3  /usr/lib/jvm/jre1.7.0/bin/java                   manual mode   I don't understand why the update-java-alternatives doesn't display the same 3 options. I also don't understand how to switch between OpenJDK6 and JDK7. How I can go about using the OpenJDK6 for Arduino development and Sun JDK7 for Eclipse/Android development?


Does a proof exist that the mean of two symmetric, independent random variables is also symmetric? Or is the conjecture false?  I would be interested to learn about references to this question, or perhaps a shown proof.

If $X$ and $Y$ are two random variables with probability density functions which are symmetric around their respective means, their sum, $X+Y$, has a probability density function which is symmetric around its mean as well. Could someone offer a proof outline? Thanks.    Edit: whuber's example (see comments) shows that the simply specifying symmetric marginals does not result in a symmetric sum Dilip Sarwate's response gives two conditions, each of which is sufficient by itself: circular symmetry of the joint and independence of the marginals


I found on another thread* that if $(X+Y)$ is independent $(X-Y)$, and if $X,Y$ are i.i.d., then $X,Y$ are $\mathcal{N}(0,1)$ distributed.  Is also the opposite true? Being $X,Y$ i.i.d $\mathcal{N}(0,1)$, then $X+Y$ is independent of $X-Y$?   here *

If $X \sim \mathrm{Normal}(\mu,\sigma^2)$ and $Y \sim \mathrm{Normal}(\mu,\sigma^2)$ are independent random variables, how do I prove that $X+Y$ and $X-Y$ are also independent?  What happens with the independence between $X+Y$ and $X-Y$ when $X \sim \mathrm{Normal}(\mu_x,\sigma_x^2)$ and $Y \sim \mathrm{Normal}(\mu_y,\sigma_y^2) $  Thank you


Terms like Machine Learning, Statistical Learning, Statistical Machine Learning and Deep Learning are often used interchangeably.  Is following structure true/accurate as far as someone could classify it?   Machine Learning is the main topic and one branch of the whole AI field.   Statistical Learning and Statistical Machine Learning are the same. It's a subbranch of Machine Learning, a tool  which uses statistical approaches to extract information from data. Deep Learning is another tool of machine learning. It's Not clearly separated from Statistical Machine Learning. Some people call it deep learning, when it has more than two hidden layers, since statistical machine learning also uses neural networks sometimes.

I know it's a rather debated question on Stack Exchange communities but let me explain the points of this question.  I'm writing my capstone on Machine Learning and I need to clarify deeply, giving valid references, the differences among Data Mining, Big Data, Statistical Learning and Machine Learning. As far as I understand (I'm reading The Elements of Statistical Learning, An Introduction to Statistical Learning which are well known books) and based on the questions linked below, those are basically Machine Learning. Correct me if you do not agree with me.  However, I can't find an article or book with a detailed discussion on the origins of those fields and relationship of each other and I can't cite, like, the questions below. They're not considered valid references.


i want to call a batch apex from trigger when all the data load in that object is completed.But I am doing this I am getting the below error.  System.AsyncException: Database.executeBatch cannot be called fro...  It looks like we need to create a custom object and a checkbox field where we need to update that field on data load and then write a trigger on that object to ensure that the batch gets called once. Is there any other wayout?

I was wondering if it is possible to call a batch from a @future method? The reason I am asking as you may have guessed is because I am trying to call batches from a trigger. Eg: Leads are inserted then call batch after insert trigger on Leads.  I know it is possible to call Database.executeBatch, however there is a limitation to the number of batches you can send. With current FlexQueue implementation you can invoke up to 100 batch calls per a transaction.   But my question is what if I need to send more than that per a transaction?  I was thinking of calling a @future method and in that method I call the batch, but I get this error:      System.AsyncException: Database.executeBatch cannot be called from a   batch start, batch execute, or future method.   Pseudocode:  trigger leadTrigger on Lead(after insert) {      //some code      TriggerHelper.callTheBatch();  }   public without sharing class TriggerHelper {      @future      public static void callTheBatch() {          MyBatchClass myBatchClass1 = new MyBatchClass();          Id batchId = database.executebatch(myBatchClass1, 50);      }  }    Any suggestion or idea?


Special Relativity tells us - the faster things travel their time is slower relative to a stationary observer.  Do massless particles, like photons travelling at the speed of light, “experience” zero time and in their frame of reference travel "instantaneously". Putting it in a thought experiment. Imagine travelling to a distant star. On reaching the star, several decades have past as shown on the spaceship's clocks and on our aging bodies. Now consider doing the same journey but incredibly close to the speed of light (not possible in practice but not violating any physical laws) we would see the clocks have changes only by a few minutes and our bodies are unchanged. Wouldn't it be reasonable to extrapolate and predict that if we were to travel at a smidgen less than speed of light, it would appear (to us astronauts) to have taken close to zero time?

I read with interest about Einstein's Theory of Relativity and his proposition about the speed of light being the universal speed limit.    So, if I were to travel in a spacecraft at (practically) the speed of light, would I freeze and stop moving?  Would the universe around me freeze and stop moving?  Who would the time stop for?


Over on Science Fiction & Fantasy, I've just been re-awarded a  that I had earned almost a year ago. When I visit the badge page, I see that they say they're awarded for different things:  Awarded 4 mins ago  for reviewing Low Quality Posts Awarded May 14 '20 at 5:18  for 1000 reviews, over 200 actioned in the old review system  What does "in the old review system" mean? What's changed in the review system, and why was I (and everyone else) awarded the badge again?

I suddenly got four Steward badges re-awarded on SFF. I actually earned these between 2016 and 2020, but now they're  (?), and the old ones say:  for 1000 reviews, over 200 actioned in the old review system  There's an "old" review system??? A glance at the "Recent Badges" sidebar on the  shows that dozens of Steward badges are suddenly being re-awarded. This hasn't happened on all sites, apparently - e.g.  there are no new Steward badges today - but the root cause is presumably something network-wide rather than an SFF-specific phenomenon, so I'm posting this on main meta. What happened? Is someone messing with the badge system again? :-)


In ArcMap, when I zoom out (or in) a single mouse-click (not dragging a rectangle, just a click), what is the change to the ratio?  If it is different between coordinate systems please explain it on GCS_WGS_1984.

I only occasionally use the Fixed Zoom In/Out buttons on the Tools toolbar of ArcMap and had always assumed that they zoomed in/out by a set scale factor.  However, using ArcGIS for Desktop 10.2, I just set my scale to be 1:10,000,000 and then hit the Fixed Zoom In button 10 times while recording the subsequent scale each time and was surprised to see:  10,000,000 8,000,000 6,000,000 5,000,000 4,000,000 3,000,000 2,500,000 2,000,000 1,500,000 1,250,000 1,000,000   Dividing each scale denominator by its successor shows a sequence of: 1.25, 1.33, 1.2, 1.25, 1.33, 1.2, 1.25, 1.33, 1.2  Curious about what happened in between the scales above I experimented a little to discover that the first issuance of the Fixed Zoom In button simply takes the scale to the first of those listed above and then starts following the same pattern.  Try starting with 1:8,000,001 to see ...  8,000,001 8,000,000 6,000,000 5,000,000 4,000,000 3,000,000   This seems like quite a neat solution, but not one that I had realised was in place - does anyone know if it has been documented anywhere?    I've looked in the Online Help without success.  In answer to @DevdataTengshe, the scales currently in my available list (see below) seem to bear no relation to those used by Fixed Zoom In/Out.    However, when I add 1:7,500,000 into my available list it does seem to insert that as an additional scale step ...  10,000,000 8,000,000 7,500,000 6,000,000 5,000,000 4,000,000   This makes the algorithm being used even more mysterious to me.


I would like to have further clarification on this topic. I am a US citizen who goes in and out of the Schengen area regularly. For instance, 10 days each month, but every once in a while 30 consecutive days in Schengen. I have not stayed more than 90 total days during a 180 day period. Given that I do not reach 90, I understand there would be no need to have a waiting period to re-enter. I can continue to regularly come and go, as long as I watch out for the 90 days within a revolving 180. Is this correct?  Thanks for your help.

I have searched the web a lot and could not find an answer that fits my situation. Here are two links that are quite contradictory:       My situation:  I've visited Portugal in December 2012 for 29 days on a Schengen visa valid from December 1st, 2012 to February 1st, 2013 for research purposes (I am a Ph.D. student). I want to visit Sweden from February 10th, 2013 to May 10th, 2013 (89 days). I have applied for a Schengen visa again (for research). How will the 90/180 rule work in my situation?


Edit 1: I did not know that the question has already been asked. Sorry for inconvenience.  let $x,y \in \mathbb R$ such that $1<x^2-xy+y^2<2$. Prove that $\frac{2}{9}<x^4+y^4<8$.  This question is duplicate of question that was originally asked by Hatim Blilet but the question was put on hold. But I am still interested in question.  $\mathbf{My}$ $\mathbf{approach}$ : I tried proving the inequality by adding the $xy$ term to all sides and squaring all sides of inequality. After that using the maximum value of the quadratic expression obtained on the rightmost part; I got the term 8. But now I have the problem of finding minimum value of leftmost part.  The expression I got was $$ -(x^2y^2-2xy-1)\lt x^4+y^4 \lt -(x^2y^2-4xy-4)$$.  Also to square both sides we need to prove that $$1\gt xy$$  Second approach : I multiplied all sides by 2 to get $$ 2\lt {(x -y)}^2+x^2+y^2 \lt 4$$.but couldn't proceed further with this method.   Can somebody please tell me how to solve this problem

$x$ and $y$ are real numbers.  Given that $1<x^2-xy+y^2<2$, how can I show that $\frac 29<x^4+y^4<8$ ?  Then can I use that to prove that for any natural number $n>3$  $$x^{2^n}+y^{2^n}>\frac 2{3^{2^n}} \text{?}$$


I will be buying a 2TB hard drive soon, and would like to use it as media storage. I would like to be able to read/write from both Windows (version 7, 64bit) and Ubuntu Linux, and I need support for files greater than 4GB in size (so I think this rules out FAT32).  I'm using IFS drives at the moment to access my linux ext4 partitions, and I find it unstable. Does this mean NTFS? Is there something else I'm missing?

I would like my external drives to be readable and writable from Linux, Mac OS X and Windows.   FAT32 works, but the 4 GB file size limit is a showstopper these days. Are there any alternatives?


I have about 450 html files I need to edit. I have the directory they all are in, so that narrows things down from the perspective of searching.  What needs to be changed is a bit of known text, some unknown text, then some known text again. This would be an example:  Line 1
 Some random text here   Line 2:  More text
   The above segments needs to be removed.  Below would need to be replaced. It would span multiple lines, but will be consistently the same all across.
Old Footer
   With:
New Footer text
   I've found that I need to use SED, but I am not sure what exactly to put in.

I've noticed that, if I add \n to a pattern for substituting using sed, it does not match. Example:  $ cat > alpha.txt This is a test Please do not be alarmed  $ sed -i'.original' 's/a test\nPlease do not/not a test\nBe/' alpha.txt  $ diff alpha.txt{,.original}  $ # No differences printed out   How can I get this to work?


So,I have this assembly inline C program to count how many of each letter of the alphabet are there in a string. I am working with Visual Studio 2019 and the program works but when it prints the values it exits with code 5 when in release mode and with code 26 when in debug. I need it to exit with code 0. Is there any problem with the assembly part or is there anyway I can force exit 0?  #include <stdio.h>  void main() {          char string[] = "This iS A sTriNg";           unsigned short occurrence[26];       __asm     {         SUB EAX, EAX         SUB EBX, EBX         SUB EDX, EDX         SUB EDI, EDI         MOV AL, 97d                                EmptyArray :         MOV occurrence[2 * EBX], 0         INC EBX         CMP BX, 25         JG EndLoop         JMP EmptyArray  EndLoop:           SUB EBX, EBX         MOV BL,string[0]         CMP BL,0         JE End         XOR EBX,EBX  //----------------------------------------------Control every string letter------------------------------------------------------------------------          Loop:             MOV CL, string[EDX]             CMP AL, CL                        JE OccurrenceLowecase             SUB AL, 32                                CMP AL, CL             JE OccurrenceUppercase             ADD AL, 32                                     INC EDX                                         CMP ECX, 0d                                       JE  ChangeLetter             JMP Loop  //-------------------------------------------Occurrence Lowercase--------------------------------------------------------------------------------------------  OccurrenceLowercase:                 INC BX             MOV occorrenze[2 * EDI], BX                        INC EDX                                        JMP Loop  //-------------------------------------------Occurrence Uppercase--------------------------------------------------------------------------------------------  OccurrenceUppercase:             INC BX             MOV occorrenze[2 * EDI], BX                        INC EDX               ADD AL,32             JMP Loop   //-------------------------------------------Change verification letter-------------------------------------------------------------------------          ChangeLetter:                 INC AL                //Increment AL to pass to the other letter             INC EDI             SUB EBX, EBX                         SUB EDX, EDX                          CMP AL, 91d             JE End             CMP AL, 123d          //Control if AL has the value after z or Z              JE End             JMP Loop   //----------------------------------------------THE END-----------------------------------------------------------------------------------         End:     }       {         int i;         for (i = 0; i < 26; i++)         {             printf("%c: %d\n", 97 + i, occurrence[i]);         }     } }

What is the correct (most efficient) way to define the main() function in C and C++ — int main() or void main() — and why? And how about the arguments? If int main() then return 1 or return 0?  There are numerous duplicates of this question, including:       — For C++, with a very good answer indeed.     Related:


I have one program that seems to remember when my HDMI external was set up to be on the opposite side as it is now.    So when I click on the task bar icon I can see the animation of it flying off in the wrong direction and out of view.  I remember the "Move" function exists but can't figure out how to do it when the whole thing is invisible.  Seems to me all I should have to do is hold the Windows button and use arrows until it shows.  But I can't make that work even though the animation shows which direction it went.  So my question is, (without going into display properties and switching things all around), how can I move that program so it is visible?

Someone asked a very similar question in regards to window recovery for windows xp:   I'm using windows 8 (or 8.1 now). I run Dual Monitors. On Monitor 2 I sometimes have the input switched to something else other than the windows display (Mac or PS3). If there was a program that was displaying on Window #2 that does not have 'move' where I could potentially alt-space-m arrow keys. Is there another way to get that program to display on Window #1?  I tried right click on the program and doesn't seem to be anything there. I tried Windows Key and Arrows. I Tried right click toolbar and cascade.  I'm hoping this is a DUP or Softball question because this annoys the crap out of me.  Thanks!!


As a researcher, I often need to quote from the previous authors. Sometimes, it happens that there are spelling mistakes in the part I want to quote. I treat this as a human error and write the correct spelling. However, I am unsure how should I handle if there is some (relatively) serious error? For example, I found the word choosed (instead of chose). Should I simply copy with the wrong word, or fix it? If I change it, the previous authors (from whom I took the quote) may be unhappy. If I do not change it, the reviewers (who would be reviewing my paper) may be unhappy by seeing my lack of care while writing a paper. This question is different from , as I am confused whether or not to correct. Since I am writing a formal paper, I cannot use sic. Originally asked here

I've got an upcoming work in which I quote a couple sentences from a scholar's book.  There's an unambiguous typo in it; the author just switched a few words around.  Do I really have to quote him verbatim, adding "sic" to point out the error?  Or can I just "quote" him, with the typo fixed?


I have a brand new Samsung J6, worked without problems for a few days and suddenly got stuck on the Samsung logo when powering on. Managed to enter the recovery menu and delete the cache partition, after which the phone started, but the touchscreen wasn't working. I tried restarting in Safe Mode, but the problem persisted. After that, I went back to the recovery menu and did a factory reset. Touchscreen still not responding to any input.  I contacted my carrier to send the phone for service, but they require the phone to be unlinked from a Google account (basically, Factory Reset Protection). As far as I know, FRP won't trigger if you perform the factory reset from the settings app on the phone, but that's not an option due to the non functional touchscreen.  I've been looking at what the Google console offers, but there doesn't seem to be a way to decouple the phone from the account, it's mostly to deal with lost or stolen devices. I tried the remote wipe feature on another phone, but that still triggers FRP.  Linked account is part of G Suite, though I don't think there's any special phone management system in use.  Is there a page where I can tell Google to stop associating that particular phone to my account?  I've found nothing of the sort in the following pages:

I won a Samsung Galaxy S6 Edge, signed into it with my Google account, played around with it, wiped it, and sold it.  Now the person can't get past setup because it's saying he must login with an account previously synced to the phone.   Is there anything I can do from my side to remove this lock?


I am trying to collect most cards relevant to pauper. Because MTGO pauper is more popular than paper pauper, and because it is so easily available electronically, it is easy to find data and analysis on the most frequently used cards in pauper. I did this.  The problem is that there are some cards (most notably Hymn to Tourach and High Tide) not available on MTGO but are essential paper pauper commons. Other popular pauper cards include Goblin Grenade, Desert, Pyrotechnics, and Sinkhole. So they are easy to miss when starting a paper pauper collection, though I suppose you'd eventually come across them in pauper tournaments.  The question:  Is there a list maintained of cards printed at common for paper, but not MTGO? If so, please provide link. If there is no such list but it turns out to be very few cards, then the answer should contain the list of cards.

I am trying to collect most cards relevant to pauper. All cards that have ever been printed at the common level on paper are legal for pauper, except for .  Because MTGO pauper is more popular than paper pauper, and because it is so easily available electronically, it is easy to find data and analysis on the most frequently used cards in pauper. I did this.  The problem is that there are some cards, such as Chainer's Edict, that are common on MTGO but have never been printed as paper commons. They are therefore not legal for play with paper pauper.  Is there a list maintained of cards printed at common for MTGO, but not paper? If so, please provide link. If there is no such list but it turns out to be very few cards, then the answer should contain that short list of cards, followed by "as of x date."  Note: For the exact opposite list of cards, see:


I'm trying to find a book I heard about once.  Little is known:    it was already in print in 1990's there were moving walkways (used for chasing in one scene) hero was predetermined to work as cleaner/sweeper, wanted to become an author of these tests ("books", "long books") that were used to determine profession,  and it was revealed that those who don't pass the test are actually rare genius.   It sounds much close to "Brave New World" or Gattaca's scenario, or Heinleins "Roads must roll", but is neither.    The most reason I'm interested in finding this book is, that Iar Elterrus's novels (these I'm currently worshipping) contains a ton of references to such plot, and I want to discourage myself knowing if the plot was actually "stolen" or not.  Also, references to such universes (psychological screening, massively genetic prenatal-tested society?) are welcome in comments even if they don't match the full request.

In the story I'm trying to recall, everybody on their thirteenth birthday (?) is assigned by some kind of brain analysis method a profession and given some kind of pill (?) that instantly (?) grants them the required knowledge and skills to start working immediately. Some professions are more sought after than others, especially in view of the olympic (?) games regularly held on a profession-by-profession basis.  The protagonist, however, is turned down from this system and dismissed with some general reason and has to work his way to adulthood the boring old way: studying from books. Eventually he rejects from his status as a "special" student and goes on the run, hiding from the teachers and envying the normal people.      Eventually, it turns out that the protagonist was actually smart enough that being spoonfed premade information was a waste. What he actually was assigned to was advancing the bundles of knowledge themselves, as well as being front line in the technological progress.  "Somebody has to write those textbooks! You can infuse knowledge about how to use today's technology, but you can't do that for tomorrow's - people that get assigned a profession become tied with their assigned technology and are only as relevant as that. If you want more, you must learn how things actually work, and there's no shortcut for that." (not an actual quote, but a specific passage as I remember it.)  The troubles the protagonists underwent were actually planned and necessary for him to acknowledge and accept his role in society.   This story was certainly longer than a couple pages, but it wasn't very long either. If it's a short story, it was probably written by Asimov, but I can't be sure. It rings me of Brave New World given the theme of government-issued population planning, but it certainly doesn't fit with anything else in the actual plot. Any idea?


When I was studying the Android source code, I encountered the following C ++ function:  int clone_result; clone_result = syscall(__NR_clone, flags, child_stack, parent_tid, new_tls, child_tid);   The above function calls to the following assembly function:  ENTRY(syscall)     mov     ip, sp     stmfd   sp!, {r4, r5, r6, r7}     mov     r7, r0     mov     r0, r1     mov     r1, r2     mov     r2, r3     ldmfd   ip, {r3, r4, r5, r6}     swi     #0     ldmfd   sp!, {r4, r5, r6, r7}     cmn     r0, #(MAX_ERRNO + 1)     bxls    lr     neg     r0, r0     b       __set_errno_internal END(syscall)   I only know a little knowledge of the assembly process callI know that this assembly function is a system call and will enter the syscall function of the kernel, but I don't know its details.  For example: How does the syscall function in c ++ pass 6 parameters to this assembly function?  I know that 'swi # 0' calls kernel functions, but how does it pass parameters to kernel functions?  What should be understood about ‘ldmfd ip, {r3, r4, r5, r6}’ and ‘ldmfd sp !, {r4, r5, r6, r7}’?

It's been a while since I last coded arm assembler and I'm a little rusty on the details. If I call a C function from arm,  I only have to worry about saving r0-r3 and lr, right?  If the C function uses any other registers, is it responsible for saving those on the stack and restoring them? In other words, the compiler would generate code to do this for C functions.   For example if I use r10 in an assembler function, I don't have to push its value on the stack, or to memory, and pop/restore it after a C call, do I?  This is for arm-eabi-gcc 4.3.0.


I am trying to install Ubuntu 13.04 after an upgrade t Ubuntu 13.10(13.10 not compatible with Zend Server/Apache 2.2)  It seems after the 'preparing to install screen the installation just sitting there, nothing happens" but busy indicator spinning... no error msg??

I've got a HP probook 4515s, AMD Sempron SI-42 (2,1 Ghz), ATI Radeon HD 3200, only 1GB ram.  I'm installing Ubuntu 12.04 with a CD right now, and it seems to take about 20 minutes since.  And its also my first time I use ubuntu and I wanted to know how to set up wlan ( a friend told me it doesnt work on my pc) And maybe a link to a site telling my which things I need to install and what I should know and stuff.


I have been following the project for a while now and I have been refurbishing PCs with Ubuntu for years now. Because of what I've seen of Ubuntu, I would love to see it go further into the mobile world. Does anyone know what CPUs will be supported? All the official page says for the supercomputer edition is a cortex a9 or atom.

With the announcement of the Ubuntu Phone OS I'd like to know what phone (and tablet) models are supported at this time.  Note from foss & Oli: We are making this the master question for all future "Will this work on <insert random tablet/phone/device here>?!" questions


While citing a range of papers, i want the output to be:     ... a range of citations  [1-4]    Not :     ... a range of citations [1,2,3,4]    I followed the answers in this  but i found the following errors:   1- while using Cite package,this error comes:     ! Paragraph ended before \@citex was   complete.   2- And by using Natbib package, nothing changes.     ... a range of citations [1,2,3,4]   here you are the used packages in my code:  \documentclass[review]{elsarticle}  \usepackage{caption} \usepackage{subcaption} \usepackage{tabularx} \usepackage{rotating} \usepackage{graphicx}  \usepackage{adjustbox}   \usepackage{circuitikz} \usepackage{siunitx} \usepackage{floatrow} \usepackage{array} \usepackage{booktabs} \usepackage{ltablex} \usepackage{lineno,hyperref} %\usepackage{cite} %\usepackage{natbib}

In my kile documents, I want to add multiple citations. For this I use the command   \cite{cristo,taylor,polgar,phillips,speirs,simoes,roberto}   The names in this command give numeric references, which is what I wanted, but not in the way I want it. It gives [1,2,3,4,5,6,7] instead of [1,2,4-8]. Is there any other way to manage this? My bibliography style is elsarticle-num, and I use bibtex for the bibliography.   I use this preamble in my document:  \documentclass[review,preprint,twocolumn,3p]{elsarticle} \usepackage{graphicx} \usepackage{color} \usepackage{url} \usepackage{ctable} \usepackage{booktabs} \usepackage{cite} \usepackage{tabularx} \usepackage{array} \usepackage{soul} \usepackage{multirow} \usepackage{lineno} \usepackage{subfigure} \usepackage{amssymb,amsmath} \newcommand{\tab}{\hspace{5mm}}


I has windows and ubuntu in dual-boot. Once I logged in Windows and erased ubuntu partition. After that I've got a "no such partition" error with a blanking grub prompt.   Now the problem is that I'm on a bus right now with unrooted Samsung S7 with an SD card. Is there any way to use it as a live cd?

I have absolutely no experience with Linux, and I desperately need to get my computer back up and running again with Windows.  How do I remove Ubuntu and reinstall Windows?    Editor's note: many of the answers are about removing Ubuntu from dual-boot but keeping Windows (which is a bit complicated), while other answers are about removing Ubuntu from single-boot (which is easy: basically just format the disk while installing Windows). The question as written is ambiguous between dual-boot or single-boot.


So in Harry Potter and the Order of Phoenix, Harry gets in trouble for use his patronus. He was charged with performing underage magic inform of a Muggle. But that Muggle, Dudley, knew about magic.   Hogwarts even broke this rule when they sent hundreds of letters to Harry in the philosophers stone, and that was when Dudley knew nothing about magic.   (Just want to add I know this ended up a plot by Umbridge to get Harry kicked out of school, or killed,  but the use of improper magic department wouldn’t have been in on it.)

Something always bothered me with Fudge's accusations:     “Disciplinary hearing of the twelfth of August,” said Fudge in a   ringing voice, and Percy began taking notes at once, “into offences   committed under the Decree for the Reasonable Restriction of Underage   Sorcery and the International Statute of Secrecy by Harry James   Potter, resident at number four, Privet Drive, Little Whinging,   Surrey." - OotP Ch. 8 "The Hearing"   Harry cast the Patronus Charm, so he violated the Decree for Reasonable Restriction of Underage Sorcery alright - extinuating circumstances aside - but how did he breach the Statute of Secrecy?  The only witnesses were Dudley and Mrs. Figg, both of whom already knew that Harry is a wizard. Earlier, even Hermione gets it wrong (don't tell her!):     They haven’t even reported that you broke the International Statute of   Secrecy. We thought they would,... - OotP Ch. 4 "#12"   Yes, Harry does use magic in front of a Muggle, Dudley, but even Dudley is not so thick that the fact that Harry's a wizard would come as a revelation to him. Harry cannot breach the Statute of Secrecy to someone already in the know.  Shouldn't Dumbledore point out that glaring error in the indictment sooner rather than later? Or at least mention it, at all?  Is there maybe a source that mentions the Statute of Secrecy containing a clause, that even the mere possibility of magic being witnessed by an uninitiated muggle is sufficient for its breach?? Cause if so, wouldn't even adult wizards have a really tough time doing anything, ever.  Possibly related:


I did some partitioning of my file disk (E:\) which I didn't like, so I removed the partitions I made and resized the original partition back to the full disk space. I kept a small bit of unallocated space which I couldn't add to the partition, I don't know why. Now I'd like to add that bit of unallocated space to the actual partition using EaseUS Partition Manager (the program I used to remove the earlier partitions about a year back), but it doesn't want to add the remaining 7.8MB to the partition. How do I fix this?  I cannot seem to remove the number 7,8 nor drag the allocated partition (E:) to the beginning of the file. I already tried making the unallocated space bigger by shrinking the partition, but once I added it back to the partition, the 7,8MB remained unallocated.

I've been wondering this for a while, why is there free space at the end of a drive that was formatted to NTFS in windows?  You can only see the unallocated space in Linux. So why is it there? Does it serve a purpose?


I have a big problem with my drive because when I try to put anything on it it says that is write protected.I seen that with diskpart would work but nothing,same with regedit.I need help quick with any methods that would work because I need to use the drive.

When I plug in my USB flash drive, it shows up on my computer as write-protected or read-only. I am unable to transfer data to it, nor can I modify or delete any files already stored on it. I also cannot repartition or reformat the drive using Windows Disk Management, DiskPart, GParted, or other tools. The drive does not have a write-protect switch.  Why did this happen and what can I do about it? Is there a way to remove the write protection?  (Note that this can happen with some memory cards, too, as they often use controllers similar to those used in flash drives. In some cases, the system may report that the drive or card was formatted successfully even though it was never actually formatted; the original data reappears when the device is reinserted.)     This question comes up often and the answers are usually the same. This post is meant to provide a definitive, canonical answer for this problem. Feel free to edit the answer to add additional details.


I have found a null pointer exception when I was randomly generating a 2D array. I used the same methods before and it never gave me a null pointer exception.  Here is the main method.      public static void main(String[] args)      {     int row = 5;     int column = 6;      double[][] matrix = new double[row][column];      for(int i = 0; i < row; i++)     {         for(int j = 0; j < column; j++)             matrix[i][j] = Math.random()*20;     }     b = getB(matrix, row, column);     printArray(matrix);     System.out.println("");     System.out.println("");       elimination(row, column);     backSubstitution(row,column);     printSolution(column);  }   The debugger told me that the line that caused the exception lies in the findMaxPivotRow method inside the elimination method.  public static void elimination(int rows, int cols) {     int pivotRow;     double multiplier;      for (int r = 0; r< rows; r++)     {         pivotRow = findMaxPivotRow(r, rows);         swapRow(r, pivotRow);          for (int i = r+1; i < rows; i++)         {             multiplier = matrix[i][r] / matrix[r][r];             b[i] -= (multiplier * b[r]);              for (int j = r; j < rows; j++)             {                 matrix[i][j] -= (multiplier * matrix[r][j]);             }         }     } }  public static int findMaxPivotRow(int k, int rows) {     double max_value = matrix[k][k];     int max_row = k;      for (int r = k; r < rows; r++)     {         if (Math.abs(matrix[r][k]) > max_value)         {             max_value = matrix[r][k];             max_row = r;         }     }     return max_row; }  public static void swapRow(int k, int pivotRow) {     double[] swap;     double multiplier;     double swap_b;      swap = matrix[k];     matrix[k] = matrix[pivotRow];     matrix[pivotRow] = swap;      swap_b = b[k];     b[k] = b[pivotRow];     b[pivotRow] = swap_b; }   The line that caused the exception is this line  double max_value =  matrix[k][k];   I searched the null pointer exception in 2d array online, and it tells me that the error is either the array is not initialized or the code is outside of the bounds. I used the debugger very thoroughly and it showed me that the indices are in the correct positions.  I know there are a lot of codes I have thrown at you, but you can read the main method, the first few lines of elimination and findMaxPivotRow method.  If you can find why that lined caused the null pointer exception, that would be very helpful. Thanks.

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


The vector space of all finite sequences $x = (x_n)$ (i.e. $x_n = 0$ for all but finitely many indices $n \epsilon N$) is a normed space with respect to $||x||_{\infty} := sup_{n \epsilon N} |x_n|$.  I haven't really understood Banach spaces well, So I'm really stuck here!

Let $S$ be the set of all sequences $x=\{x_n\}$ of real numbers such that only a finite number of the $x_n$ are nonzero. Define $d(x,y)=\max|x_n-y_n|$. Is the space complete?   Completeness means that any Cauchy sequence converges to a point in the space. Suppose we have a sequence $\{\textbf{a}_i\}_{i=0}^\infty$, where $\textbf{a}_i=(a_{i1},a_{i2},\ldots)$. Since $\{\textbf{a}_i\}$ is Cauchy, for any fixed $k$, the real sequence $a_{1k},a_{2k},\ldots$ is also Cauchy, hence converges to a real number $b_i$. I'm not sure, however, whether the sequence $\{\textbf{a}_i\}$ converges to the sequence $\textbf{b}=(b_1,b_2,\ldots)$, or whether the sequence $\textbf{b}$ belongs to $S$.


Can someone help me by explaining the difference. From what I understand the === does an exact match but what does this mean when comparing with null ?

I'm using  to go through JavaScript, and it's returning many suggestions to replace == (two equals signs) with === (three equals signs) when doing things like comparing idSele_UNVEHtype.value.length == 0 inside of an if statement.  Is there a performance benefit to replacing == with ===?   Any performance improvement would be welcomed as many comparison operators exist.  If no type conversion takes place, would there be a performance gain over ==?


Im not sure what to do for this one, any help would be appreciated.

A ring $R$ is a Boolean ring provided that $a^2=a$ for every $a \in R$. How can we show that every Boolean ring is commutative?


I have installed both Windows and Ubuntu on a single hard-drive. The Windows OS is split into 2 partitions, C and D and I want to enlarge the C partition by taking 3GB from the D partition. Can I do this using the Disk Management from Windows and without affecting the Ubuntu OS?

My family PC has Windows Vista and lately it has became unusable, having strange errors and taking hours to do anything at all, so I'm installing Ubuntu 11.10 alongside it.  I went into GParted to resize the Vista partition but found that it had an exclamation point in a red circle next to it:   I tried to resize it but the Resize/Move button was grayed out.  I thought that this might have to do with the exclamation point so I looked at the information and found a load of errors:   What does the exclamation point mean?  How can I resize my partition?  UPDATE 1  I booted into Safe Mode with Command Prompt in Vista as suggested by eug and ranchkdsk c: /F /R (/F Fixed errors on the disk, /R Locates bad sectors and recovers readable information) and got:  Chkdsk cannot run because the volume is in use by another process.  Would you like to schedule this volume to be checked the next time the system restarts? (Y/)   When I reboot it doesn't run chkdsk, I'm selecting Safe Mode with Command Prompt again because I can't boot normally.  How can I stop it being used?  UPDATE 2  I tried doing what Luis suggested.  Here is the terminal output:  ubuntu@ubuntu:~$ sudo ntfsfix /dev/sda3 Mounting volume... OK Processing of $MFT and $MFTMirr completed successfully. NTFS volume version is 3.1. NTFS partition /dev/sda3 was processed successfully. ubuntu@ubuntu:~$ sudo apt-get install ntfsprogs Reading package lists... Done Building dependency tree        Reading state information... Done Note, selecting 'ntfs-3g' instead of 'ntfsprogs' ntfs-3g is already the newest version. 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   I still cannot resize the partition.  Ntfsfix doesn't look like it did anything and ntfsprogs is already installed.  I can access the hard drive and do backups with the Ubuntu Live CD which I'm using now.  Any other suggestions?  UPDATE 3  I attempted to use the ntfsresize command but I got an error:  ERROR: Volume is scheduled for check. Run chkdsk /f and please try again, or see option -f.   This is because I ran chkdsk in Vista Safe Mode with Command Prompt and it couldn't do it because it was in use but offered to do it at the next reboot.  I reboot and I get to the menu to the menu to choose whether to Start Windows Normally, Safe Mode, etc instead of checking the disk.  Is there any way I can unschedule?  EDIT  I just found out that I could use the -f option to force it.  It failed and told me to run chkdsk /f in Windows and then reboot twice.  But the chkdsk program is in the partition I am trying to check so it says it is in use.


I'm new to GIS and need to learn for an internship. I've been reading a lot and now need help picking technologies to use... particularly the map serving technologies.  Project requirements -    Free Web Based Service Able to display layers/features over Google Maps/Bing Maps Able to select individual features/layers (Seems like open layers does this?)   e.g. select individual/multiple points/polygons  Works on 64 bit Red Hat Compatible with PHP, PostGIS (seems like they all do)   What I've narrowed it down to so far...  GeoServer - Seems to be the easiest to learn and install. Not sure if I can use Google Maps with it though. Maybe with a WFS? Most questions tagged on this site.  MapServer - Seems tricky to install on 64 bit. (No MapTools FGS yet for 64 bit) 2nd most questions tagged on this site.  MapGuide - Looks cool and has cool features but it looks "youngest" and the documentation is behind so it might be hard to get things going fast. (by the time the internships over.) Least most tagged.

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


I don't bother to log in when switching to data.stackexchange.com for a quick query, but today when I did that I found the following captcha:    FWIW, typing in that text does not work for me.  So, developers, please check out  at your earliest convenience.

According to this , I thought the new recaptcha API was used network-wide. Though today, when going to  (which for whatever reasons never recognized me automatically), I got this message instead of a usable captcha image.   V1 Unsupported Please direct siteowner to   (Doing a second try doesn't show this message anymore, and the recaptcha v1 works as intended.)  According to , the reCAPTCHA v1 API will stop working on March 31, 2018:  What happens to reCAPTCHA v1? Any calls to the v1 API will not work after March 31, 2018. Starting in November 2017, a percentage of reCAPTCHA v1 traffic will begin to show a notice informing users that the old API will soon be retired. Most websites around the world have already switched to reCAPTCHA v2, where humans pass effortlessly. With our advanced risk analysis engine, reCAPTCHA v2 can effectively separate humans from bots and always stay ahead of the attackers. If your site still uses reCAPTCHA v1, please upgrade to reCAPTCHA v2 immediately. We no longer support reCAPTCHA v1. Any calls to the v1 API will not work after March 31, 2018. Please register a new key and upgrade to v2.  I'm really hoping this will not take  to fix, because we've only got three and a half weeks left!


the explain of "had true teachers been" structure and meaning of "theta"  Mr. Evans and his associates after the first disturbance, physical and mental, caused by this spirit irruption, settled down to study what it really meant. They came to the conclusion that the matter could be divided into three phases. The first phase was the actual proving to the observer that the thing was real. The second phase was one of instruction, as even the humblest spirit can bring information as to his own experience of after-death conditions. The third phase was called the missionary phase and was the practical application. The Shakers came to the unexpected conclusion that the Indians were there not to teach but to be taught. They proselytized them, therefore, exactly as they would have done in life. A similar experience has occurred since then in very many Spiritualistic circles, where humble and lowly spirits have come to be taught that which they should have learned in this world had true teachers been available. One may well ask why the higher spirits over there do not supply this want? The answer given to the author upon one notable occasion was, "These people are very much nearer to you than to us. You can reach theta where we fail."

"I would have been prey for those cats had you not come, am I right?" Is this grammatically correct?   I dont understand that "had you not come" part. Is this some kind of conditional? Shouldn't there be something like "If you didnt come"?


I have been working on problems from Complex Analysis by Ahlfors, and I got stuck in the following problem: Evaluate:  $$ (1 + i)^n - (1-i)^n  $$  I have just "reduced" to:  $$  (1 + i)^n - (1-i)^n  = \sum_{k=0} ^n i^k(1 - (-1)^k) $$  by using expansion of each term.  Thanks.

I'm wondering if there is a formula for the value of $(1+i)^n+(1-i)^n$?  I calculated the first terms starting with $n=1$ to be, in order, $2$, $0$, $-4$, $-8$, $-8$, $0$, $16$, $\dots$  So it seems to be some sequence of positive and negative powers of $2$ with $0$s thrown in. Is there a more explicit formulation of what $(1+i)^n+(1-i)^n$ is, based on $n$?   With the binomial theorem, I get it equal to $$ \sum_{k=0}^n\binom{n}{k}i^{n-k}(1+(-1)^{n-k}). $$ Can this be made nicer? Thanks.


My laptop has only one VGA port, so I was wondering if I can just buy a "Y-cable" and plug in 2 screens?  My graphic card is GeForce GT 640M LE.  PS: I want to extend my screens, not duplicate them.

I have a laptop with a graphics card that supports 2 displays. I would like to know the easiest way to set it up so I can close my laptop lid and use 2 external monitors (unique displays).  I use it primarily for office applications and video and want a quality, clear picture.  The laptop has 1 VGA port and I have 2 24" 1920x1200 monitors that have VGA and DVI ports. So a few questions:   Can I just use a VGA splitter? (seen mixed feedback on this) Would it a VGA to 2 DVI splitter give a better picture quality? (if it exists) Would I be better upgrading laptop to one with 2 digital ports ( I just see a lot with VGA and HDMI though)   specs: Model: Toshiba Satellite C675-S106 (Windows 7) Graphics Card: Intel HD Graphics 3000 (supports 2 displays) Processor: Intel Core i3-2350M