I have been a happy Gridmove user for years, and I use the combination Win+G to change into the "send window to grid location" mode. Now I got a new work computer with Windows 10, and when I press Win+G, it pulls up a small window asking me "Is this a game?". I have to click on the grid entry window to return focus to it, which introduces a lot of friction in the wrong place.  I won't play games on this computer, and if I did, I don't see why I would want a "game bar" anyway. How do I tell Windows to forget its shortcut mapping of this combination so I can use it for Gridmove?  I am not just asking how to add a new mapping. The mapping I need is already added by GridMove. But the problem is that both get invoked and the function started by the Windows mapping takes precedence.

It looks like the  update  from Microsoft.  I have  and  UWPs as much as I can, along with Cortana and Edge.  Yet today I saw a weird green bar popup saying something about "Press Win + G to bring up the game bar".  I figured it would have to do with the Xbox UWP app, which I have previously uninstalled.  I presume this is UWP functionality, but I'm not sure how to find out for certain.  Can this app or program exist outside of the UWP ecosystem?  Is it a part of the Xbox app?  What method(s) are there to remove it?  Is there a prophylactic to prevent such things in the future?  I'm currently stuck in Windows Home, even though I  (not me, but gives you context).  I will be fixing that sometime soon.


Which is correct:         Sources of information include vendors and consultants, each of which usually has an interest in selling something.   Sources of information include vendors and consultants, each of whom usually have an interest in selling something.

I am very uncertain about when to use "most of whom," "most of who," or "most of which."  Please give concrete examples instead of only rules like, "this is the subject, so you should..."


I have a scene with two different render layers. The first one is a background with Sky texture. The second one is some images of mountains with alpha channel. For second layer I need Transparency to have an alpha channel to get a background with Sky texture as a sky. The thing is if I enable transparency, the first layer renders as one total alpha channel. If I disable transparency the second layer renders without alpha channel and I can't apply the first layer as sky because the second layer overlaps it by solid black. if I render them separately I lose one of them.

I have a scene where I have a few different render layers that I need to put on top of each other for the final render. Everything works fine when I have transparent background checked for the render but I need to also have the environment background image behind everything. Also, the camera moves and displays different parts of the background, so I can't just alpha over everything on top of an image texture. Is this possible? Thanks in advance!


"Everyone want their homes to be at the centres of cities" Is this correct usage or is there any alternative way to convey the same?

Which is correct?     Everyone were convinced that he would go to the game.   Everyone was convinced that he would go to the game.   I think it's "was", because "everyone" is singular, but I just wanted to check.


I'm new to ubuntu and I'm using version 13.10.  I tried to install VLC, but every time I click the download icon it tells me that I need an application to open this link, then invites me to choose one from an empty list.

There are several ways to install an application in Ubuntu:   You can download a source tarball (generally a .tar.gz or a .tar.bz2 file) and install it manually. (See ) You can download a .deb file and install it manually, using dpkg or the Software Centre. You can search for the application in the Ubuntu Software Centre and install it there, or use apt with the official Ubuntu repositories. You can find a PPA or a third-party repo, and install it from there.   What are the pros and cons of each method? Please discuss security implications, frequency of updates and program reliability of each method in your answer.


I'm playing with cryptography and its use with typescript on one side and PHP on the other side. Now I'm looking for routines that can encrypt and decrypt with ecdh's private and shared keys. Any recommendations? At the moment its in a testenvironment to figure out how it works basically. The keys (private and shared) are generated with elliptic.  Edit: The plan is to use tweetnacl and tweetnacl-utilities for Typescript on the clientside and sodium from php 7.2 on the backend. The tweetnacl is well documented and it works to create two keypairs and two shared keys. I can encrypt a string for 'Alice' and decrypt it for 'Bob'. But on the backend I did not found the right corresponding functions...  Next steps after this is a save key exchange...

I know that RSA can be used for both, encryption and signature. What about EC? I know about ECDSA/EdDSA, but to my knowledge it can only be used to sign.  I also know about ECDH, but it is a key agreement protocol. Is there some elliptic curve based public key encryption algorithm?


Many books, particularly in mathematics and related disciplines, contain sentences like "the proof is left as an exercise to the reader", which actually mean that the claim should be easy to prove for anyone reading until that point.  Can I write such a sentence in a paper submitted to a journal? Or will the reviewers consider it rude to omit a proof in such a way?

Possible arguments:  Pro   For brevity for trivial deductions   Contra   Looks like the writer could not be bothered to write an extensive explanation Definition of what is trivial to which reader and what not


I'm joining tables. I only want to return one record from the joining table, based on a date field.  Here's a simplified fiddle of what I've done so far:   My tables:    CUSTOMER  | CustomerID | -------------- | 1          |     PURCHASE  | PurchaseID | CustomerID | ProductID | CreateDate | ArchiveFlag | ------------------------------------------------------------------ | 1          | 1          | 443       | 01-FEB-15  | F           | | 2          | 1          | 551       | 01-MAR-15  | F           | | 3          | 1          | 151       | 01-JAN-15  | F           | | 4          | 1          | 654       | 01-MAY-15  | T           | | 5          | 1          | 345       | 01-APR-15  | T           |   and here's the query itself:  select * from customer c join purchase p on c.customerid = p.customerid and p.archiveflag = 'F';   I only want to return the latest purchase that isn't archived (in this example, purchase ID 2) for each customer.  Ideal output:  | CustomerID | PurchaseID | CustomerID_2 | ProductID | CreateDate | ArchiveFlag | |-------------------------------------------------------------------------------- | 1          | 2          | 1            | 551       | 01-MAR-15  | F           |

Table:   UserId, Value, Date.   I want to get the UserId, Value for the max(Date) for each UserId. That is, the Value for each UserId that has the latest date. Is there a way to do this simply in SQL? (Preferably Oracle)  Update: Apologies for any ambiguity: I need to get ALL the UserIds. But for each UserId, only that row where that user has the latest date.


What do you call an event that occurs only once in its environment?   For instance, birth and death are two events that occur only once in the lifetime of a living thing.  I am looking for a word or phrase that would be synonymous to "non-repeating".

What is the word/phrase to mean something that just happens once? For example,     I have often been told/expected to do this and not to do that. I become aimless   and gradually lose the idea of who I am. I ask myself "What is the point?" If   life is just once thing, why can't I live my life in my own way,   the way I think is right and suitable to me? If I cannot, I would   rather live a shorter life.


I'm interested in finding the expected value for the kth ordered observation of a normally distributed variable with known standard deviation, mean and n. Could someone let me know the formula for that?  Thanks for your help

Are there well known formulas for the order statistics of certain random distributions? Particularly the first and last order statistics of a normal  random variable, but a more general answer would also be appreciated.  Edit: To clarify, I am looking for approximating formulas that can be more-or-less explicitly evaluated, not the exact integral expression.  For example, I have seen the following two approximations for the first order statistic (ie the minimum) of a normal rv:  $e_{1:n} \geq \mu - \frac{n-1}{\sqrt{2n-1}}\sigma$  and  $e_{1:n} \approx \mu + \Phi^{-1} \left( \frac{1}{n+1} \right)\sigma$  The first of these, for $n=200$, gives approximately $e_{1:200} \geq \mu - 10\sigma$ which seems like a wildly loose bound.  The second gives $e_{1:200} \approx \mu - 2.58\sigma$ whereas a quick Monte Carlo  gives $e_{1:200} \approx \mu - 2.75\sigma$, so it's not a bad approximation but not great either, and more importantly I don't have any intuition about where it comes from.  Any help?


If you look at the  and want to vote for a tag synonym (or just see its current vote count), you have to click through to the tags page and then to the info tab.  It would be much more convenient if the voting buttons were right there on the overview page, so that proposed synonyms can be voted on in-place.  Alternatively, if this takes too much server resources, it would be an improvement to have a link on pending synonyms that leads directly to the info-tab for that tag.

Before:  After:   The pros:  Speeds up the tag synonym voting process. Easier to locate (as opposed to navigating to each individual tag wiki page). Encourages users to vote on more than one at a time.  The cons:  Serial up/downvoting. But this really isn't even an issue because, (1) only experienced users can vote on tag synonyms, and (2) more than one vote is required to approve a tag synonym, so the occasional serial up/downvoter won't significantly impact the overall process.


I'm investigating into the angular velocity of a planet in its elliptical orbit.  I have these variables defined:  speed of planet.     speed of planet at perigee and apogee.     length of orbit.     time of orbit.      distance away from center at apogee and perigee.   Is there a way from this data that I can calculate the angular velocity of the planet in this orbit ?.  $\tt\mbox{I need the angular velocities of all the 8 planets.}$  I've already done this all for a circular orbit which is quite easy but I can't figure out how to do it for elliptical orbits. Any help will be appreciated !. Thank you in advance.

If I have velocity at perihelion/apphelion, distance away from sun at perihelion/apphelion, and orbital period. How can I find the angular velocity function for earth and subsequently all the other planets in the solar system?


I can see this easily by definition. But will it have combinatorial meaning of  $\binom{n}{2} = \sum_{k=1} ^{n-1} (k)?$

How can I show that  $$ \sum_{i=1}^{n-1}i=\binom{n}{2}? $$  This is what I have tried, but I do not know if it is correct:  Proof.  Let $n=2$. Then,  $$ \begin{align} \sum_{i=1}^{1}i&=1\text{, and}\\ \binom{2}{2}&=1. \end{align} $$  Hence, it holds. Assume that this is true for $k$. Then, we show that it is also true for $k+1$:  $$ \begin{align} \sum_{i=1}^{k}i=k+\sum_{i=1}^{k-1}i&=k+\binom{k}{2}\\ &=k+\frac{k!}{2(k-2)!}\\ &=k+\frac{k(k-1)}{2}\\ &=\frac{k(k+1)}{2}\\ &=\frac{(k+1)!}{2!(k-1)!}=\binom{k+1}{2}.\square \end{align} $$  Also, proofs by induction are confusing to write. Is there a standard "skeleton" for them I can use?


I often read the expression “would of” used instead of “would have”. Each time I read it I get annoyed so I googled it and found out -as I expected- that it is an incorrect way to say “would have”. Now, there are a lot of brilliant slang words/expressions, so my question is, why do people use this one? It’s so annoying to read, stupid and clearly wrong, it is pointless, why did they come up with this expression?    Edit:  I don't think my question is a duplicate as I didn't ask how can somebody use it (since I know it's incorrect and I know that I can use it with commas giving it a different meaning) but I asked why and how people came up with this expression.

Possible Duplicate:          It bothers me that so many people use could of, would of, should of instead of could've or could have, etc.  For instance, I have seen people write I could of been hurt or I should of seen that truck.  Does anyone know how this originated? Is this a mistake only American English speakers make, or is it common with British English speakers too?  Also, is that actually legal English?


I have two objects. Child Object: Service_Item__c and Parent Object: Case, with master detail relationship. so when a record is inserted or updated I want to add Service_Id__c and Service_Description__c to the Parent custom field Service_Items__c with comma separated(field1__c,Field2__c).  I have copied and adjusted the code from   However I am getting the following error message:  Error   Error: Compile Error:  Service ID, Service Description from Service_Item__r) from Case where  ^  ERROR at Row:1:Column:74  Didn't understand relationship 'Service_Item__r' in FROM part of query call. If you are attempting to use a custom relationship, be sure to append the '__r' after the custom relationship name. Please reference your WSDL or the describe call for the appropriate names. at line 12 column 24  Any help would be greatly appreciated :)  Trigger  trigger updateVals on Service_Item__c(after Insert, after Update) {  List < Case > poList = new List < Case > (); Set < Id > Po_Ids = new Set < Id > ();  for (Service_Item__c childObj: Trigger.new) {     Po_Ids.add(childObj.Case__c); }   if (Trigger.IsInsert || Trigger.IsUpdate) {     List < Case > po = [Select Id, Service_List__c, (Select Service ID,  Service Description from Service_Item__r) from Case where Id IN: Po_Ids];     for (Case p: po) {         String concatenateString = '';         for (Service_Item__c c: p.Service_Item__r) {             concatenateString += c.Service_ID__c + ',' + c.Service_Description__c + ' : ';          }         p.Service_Items__c = concatenateString;         poList.add(p);     }       update poList;  }  }

In Trailhead we have the query to get the Contacts for the Account named "SFDC Computing", with an inner query.   SELECT Name, (SELECT LastName FROM Contacts) FROM Account WHERE Name = 'SFDC Computing'   It works fine for my purposes.  "Contacts" is the name of the relationship, per Trailhead. So, I went to Object Manager and examined the Account object's "Fields and Relationships". There is nothing named "Contacts"!   In general, how do I get the name of the relationship, for use in similar SOQL queries?


When leveling a new character as an INT based class (Witch Doctor, Wizard, Etc...) how does one gear the Templar?  Since Loot 2.0 and "smartloot", it's not as easy to get gear for something besides your primary attribute. So doesn't that make it very difficult to gear someone like the Templar if he is running with you?

I'm a little confused as to how I'm supposed to gear up my follower since the installation of smart loot in Loot 2.0. My follower still has most pre loot 2.0 items because I have yet to find comparables that are rolling with the right affixes.   To be clear, I play a DH and so I used the Templar as my tank. I very rarely find items that roll with Strength because smart loot sees my DH and rolls Dex for me instead. With the use of the Enchantress I thought it would get better because I could replace Dex with Strength...but that's not true. It seems as though the Enchantress will only roll Dex for me too.   With the auction house down for good, no outlet for trading, and the installation of smart loot, it seems that gearing a follower has become almost impossible unless I want to jump on another character that uses strength and get items that way. I want to find items that I can use while I'm playing. How do I gear my follower post Loot 2.0? Do I have any options other than character jumping?


Error mounting systems managed device /dev/sdb1: Command-line mount"/mnt/5617-A6EF" exited with non-zero exit status 32:mount:mnt/5617-A6EF:unknown filesystem type 'exfat'.   How to fix this?

When trying to mount an exfat filesystem, I get the following error:  Error mounting /dev/sda6 at /media/gkp/Backup: Command-line  `mount -t "exfat" -o "uhelper=udisks2,nodev,nosuid" "/dev/sda6" "/media/gkp/Backup"'  exited with non-zero exit status 32: mount: unknown filesystem type 'exfat'   Exfat is used on some USB sticks and camera sd cards. What can I do to mount this type of filesystem?


I made a loaf of bread and scored the top with a razor to regulate its expansion as it baked. However, it had its own ideas and pretty much ignored mine, as below:   Why? And how can I produce a more beautiful loaf next time?

I've got to the point where my bread springs beautifully (I can see it grow). Unfortunately, no matter how I score it, the score always spreads open gently, then hardens along with the rest of the crust. Then, 5 minutes later, the bread splits open at the side.   I usually bake a batard shape, with 80% hydration. I make a single score, using a kitchen knife, about 0.5 to 1 cm deep cut straight down. I spray the oven walls three or four times with a plant sprayer after I put the loaf in.  What can I do to get better results? Should I invest in a razor, should I angle the cut a bit more?  Since the answer is a combination of the things mentioned, I'd thought I'd edit the question to summarize my findings. I've tried most of the things mentioned below. The following things stand out:   It's perfectly possible to get a  properly opening score without a lamé.  There's a spectrum ranging from doughs that immediately open up when you cut them, and those that stay firm and re-seal immediately. This mostly depends on hydration. If you have the first, you'll want to make very horizontal cuts. This gives you a kind of flap that holds the cut closed long enough to keep it from hardening during the first minutes of the oven spring. This is why the score looks asymmetrical after baking. I resisted the method of putting a dutch oven inside my oven for a long time. I have a small oven and this reduces the effective space a lot. Also I can't watch the dough spring anymore, which I find the most magical part of baking bread. But I tried it and, holy cow, what a difference it makes. Of all the tricks mentioned, this one made by far the biggest difference.


I cant wrap my head around simplifying the following sum:     $$\sum_{k=0}^n \binom{n}{k}x^k(1-x)^{n-k}k,$$   where $0<x<1$.    I tried to apply standard formulas .

Why does:   $$ \sum_{k=0}^{n} k \binom nk p^k (1-p)^{n-k} = np $$ ? Taking the derivative of:   $$ \sum_{k=0}^{n}  \binom nk p^k (1-p)^{n-k} = (1 + [1-P])^n = 1 $$   does not seem useful, since you would get zero. And induction hasn't yet worked for me, since – during the inductive step – I am unable to prove that:   $$ \sum_{k=0}^{n+1} k \binom {n+1}{k} p^k (1-p)^{n+1-k} = (n+1)p  $$   assuming that:   $$ \sum_{k=0}^{n} k \binom {n}{k} p^k (1-p)^{n-k} = np  $$


I'm saving up for the minishark I just need one gold coin I need an item to sell that is common and easy to get That gives me silver/at least 20 copper.

I haven't played Terraria in a while and it has changed a lot, so I want to start over again. What should I do to get some good equipment as quick as possible? I don't need to have the epicest equipment available, but I'd like to be able to roam the world freely, mine where I want, and have some cash.   (I only have a little previous experience with the game. I mostly dug down, found a cave and explored it. Dug even deeper, which took quite a lot of time, found a big cave, died a lot, was too weak, died some more and then moved on to other games.)


I was at a friend of a friend's house last weekend and played a cool game.  Here is what I remember:   The game is played on a square board 2 or 4 players The goal of the game is to reach the opposite side of the board from which you start (before your opponent(s)) On your turn you may  a) Move you piece forwards/backwards/left/right (not diagonal) b) Place a barrier which you and your opponent cannot cross.  A barrier is a length two piece that goes between squares.      Anyone know the game?

Does anyone recognize this game, where players take turns in a square board, each turn a player can move his pawn or place a wall and the objective is to reach the other side of the board before the other player.  Here is a picture of a near end game.


I created a community site in a sandbox and I created another sandbox because of some technical problems, now my question is, is there a way to migrate my community side to the new sandbox without attempting to build it from scratch again! Thank you

How can I move customer community from one Dev org to another Dev org. I use maven mate and eclipse to move meta data.


I have 131 polygons (point buffers) and need to randomly select a point within each buffer. Seems like it should be easy but can't find any solutions online. Running 10.5

What methods are available in ArcGIS 10.2 to randomly subset a selection of points.  For example, in the attached screenshot I am interested in keeping 20% of the selected points and deleting the rest.


I need to echo a PHP variable into JavaScript. But I have no experience about JavaScript, I did some research but nothing worked for me.  The code   function hide() {    document.getElementById("myDiv").style.display="none";    <?php echo $myVar; ?>  }   And the $myVar looks like:  $myVar = "Hi there";

What is the easiest way to encode a PHP string for output to a JavaScript variable?  I have a PHP string which includes quotes and newlines.  I need the contents of this string to be put into a JavaScript variable.  Normally, I would just construct my JavaScript in a PHP file, à la:  <script>   var myvar = "<?php echo $myVarValue;?>"; </script>   However, this doesn't work when $myVarValue contains quotes or newlines.


Please clarify the difference between BitMap Index and Btree index. I am using mysql version 5.5.37-0ubuntu0.12.04.1.  I can able to create Btree index but unable to create the same,  Please find the below query for Btree index which has been created.  **mysql> CREATE INDEX emp_id_index ON employee_details (emp_id) USING BTREE;     Query OK, 0 rows affected (0.18 sec)    Records: 0  Duplicates: 0  Warnings: 0**  Please find the below query for Bitmap Index which is showing error   **mysql> CREATE BITMAP INDEX index_name ON employee_details (emp_name);     ERROR 1064 (42000): You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near 'BITMAP INDEX index_name ON employee_details (emp_name)' at line 1**  Please guide me what i had done wrong in the Bitmap query.   Also let me know whats the difference between these two index. I had gone through the below link but not able to find the apt one.

I have database named "demo_dev" and added a table named "countries".  I wanted to create a bitmap index on a column, say, region as it has fewer unique values, using following query.   CREATE BITMAP INDEX ON countries (region);   It threw an error as shown below:     You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near 'BITMAP INDEX ON countries (region)'   What shoud be done for it to run successfully?  I just refered the following link :   mysql version : 5.5


What's the difference between:     I'm amazed that he could paint such a piece.      I'm amazed that he can paint such a piece.   Context: A guy painted a painting and some people liked it and said the first sentence but I want to know what's the difference between could and can in these sentences.

Can you please explain this to me?          Could you please explain this to me?   I am unable to figure out which to use which situation. I did google, and some posts say they are both the same, even if the second one is more formal. Other posts say could is the past tense of can, but in the above example, I don't think could is used as past tense of can.  What is correct way to use these words?


Context  I am writing a computer program to do a brute-force search for a solution to a  which wanted to arrange four numbers with the four standard arithmetic operators and arrive at a given answer. While I have a solution to the original puzzle, I still want to write a general-case solving program for n numbers. I have broken down the problem into:   Arrangements of the numbers (n!) Arrangements of operators (4n-1) Arrangements of associativity. Or bracketing, if you will.   It is this last one where I cannot find the general-case answer to "how many will there be?" but if I am to write a program to solve it then I need my test cases to prove that my implementation is correct.  Progress  I have a notation for these, which operates by breaking the formula under consideration into Reverse Polish notation, and expressing it as 1 for a "Push number" operation, or 0 for "Pop two numbers, apply operator, push result" operation. It is clear that the four operators are binary operators, so the first two operations must necessarily be "Push" operations. Similarly, the last one must be a calculation.  Further, when counting N1 - the numbers of pushes - and N0 - the numbers of calculations - from the start up to any given point, N1 must always be greater than N0   By inspection, I have determined the following results:   n | C(n) |  ---+------+-  2 |   1  | 110  3 |   2  | 11010 11100  4 |   5  | 1101010 1101100 1110010 1110100 1111000  5 |  14  |    I think C6 is 42 but am not yet sure about that.  Question  What is the general-case value for Cn?


I'm working on MVC 4. I have generated Excel file dynamically using following simple code. My hosting is on Azure.  I have created a Root path and then try to save that Excel file.  Problem is when my ActionResult method response comes back it is giving default popup to open a file but file name is having a GUID instead my provided file name.  Excel file generation code:  Microsoft.Office.Interop.Excel.Application xlApp =          new Microsoft.Office.Interop.Excel.Application();  // ... //Save         LocalResource resource = RoleEnvironment.GetLocalResource("MyValue");         string tempPath = resource.RootPath + "DemoFile.xls"; return tempPath;   tempPath returns path like C:\AppData\Local\dftmp\Resources\11a2435c-998c-4fe8-aa55-8bb42455b4ca\directory\DemoFile.xls.  The Download File popup does not give file name as DemoFile it gives some GUID why so?       ActionResult method code:  public ActionResult DownloadExcel() {     string path = ExcelGenerationCode(fileName);         Stream s = new FileStream(path, FileMode.Open, FileAccess.Read);         return new FileStreamResult(s, "application/vnd.ms-excel");     }   Also tried to give name property  public ActionResult DownloadExcel() {     string path = ExcelGenerationCode(fileName);         Stream s = new FileStream(path, FileMode.Open, FileAccess.Read);         return new FileStreamResult(s, "application/vnd.ms-excel")         {             FileDownloadName = "myexcelFILE1.xls"         };     }   getting below error when give filename parameter.   i have plenty of space and memory.

In WebForms, I would normally have code like this to let the browser present a "Download File" popup with an arbitrary file type, like a PDF, and a filename:  Response.Clear() Response.ClearHeaders() ''# Send the file to the output stream Response.Buffer = True  Response.AddHeader("Content-Length", pdfData.Length.ToString()) Response.AddHeader("Content-Disposition", "attachment; filename= " & Server.HtmlEncode(filename))  ''# Set the output stream to the correct content type (PDF). Response.ContentType = "application/pdf"  ''# Output the file Response.BinaryWrite(pdfData)  ''# Flushing the Response to display the serialized data ''# to the client browser. Response.Flush() Response.End()   How do I accomplish the same task in ASP.NET MVC?


Today, I read here that Microsoft Launches Visual Studio now support Linux.    but after downloading it here   I have a zip file but I dont know how to install it.  I need help on command to use.

I just downloaded VSCode-linux-x64 from . It's a 62 MB zip file. How can I install it on my Ubuntu system?


I am working on my Masters' thesis in aeronautical engineering and would like to make high-quality drawings (not technical drawings as in detail designs in CAD, but drawings of concepts and ideas, eg airplane with basic forces acting on it).  I am sure is this a common task in technical writings and would like to know if there is software available for such purposes?  Disclaimer: I am not a graphic designer and don't have the skill or time to make nice drawings from scratch. I am hoping there is software that has a library of a bunch of basic shapes and images that can be edited and freely used.

I would like to have suggestions of good software for drawing illustrations in research papers. I already know about , but this works only on Linux and is at times, clunky when it comes to text. Moreover the resolution is not always perfect making it difficult to manoeuvre the objects. Besides it is tough to learn and master, with all its weird click procedures.   I would love to know about better alternatives. Not talking about graphs here, just block diagrams and explanatory illustrations.


What's the best way of proving this?  Let G be a simple planar graph with girth > 3   1. Prove that G has a vertex of degree at most 3.  2. Prove that G is 4-colorable

Prove that every planar graph without a triangle (that is, a cycle of length   three) has a vertex of degree three or less. Then, prove that all planar graphs without triangles are four-colorable without using the four-color theorem.   This is a problem in my textbook that does not have a solution. How to approach this? Induction seems not to work.


I have been told it is very simple, but I cannot work it out. I was thinking I use that I know the left hand side converges?

Prove that there exists a constant $c>0$ such that for all $x \in [1,\infty)$, $$\sum_{n>x} \frac{1}{n^{2}} \leq \frac{c}{x}$$


I have a series of keyframes (objects with animation) that play in the current 3d viewport, are listed on the dope sheet but for some reason the render nodes are pulling from an older scene with objects that are deleted and/or hidden. I tried disabling the composites and sequencer in render settings and just about everything else to have blender render my current scene but it is linked to a node that displays an older scene. I did repurpose a previous scene built new objects, key frames etc., so maybe that is why. I have no idea how to have Blender just render what is currently displaying in the 3D view port.

Blender is rendering an older version of my project, not the most recent one. I have made it using the Blender Render but it does not want to render in cycles either. A black and grey screen is rendered as if everything is transparent. Checked general camera, lighting and compute devises in case I messed something up but I can't find anything. All my textures and objects look normal, does anybody know what is wrong or what to check?  Ok added link:


a) I did some research and there are two opinions.. some say it cracks in several years and others say it doesn't crack for billions of years USING BRUTE FORCE ATTACK...

I am considering attacks on Two-Key Triple-DES Encryption assuming $2^{32}$ known plaintext/ciphertext pairs (that's a mere 32 of ciphertext) by the method devised by Paul C. van Oorschot and Michael J. Wiener:  (in ), or another published method not requiring significantly more DES computations. As a synthetic information for decision makers, I am looking for an independent estimate of how much time this is expected to require, assuming all the RAM ever built by mankind to that day (of April 2012) was put to full use. Note: I'm purposely not asking when the attack could become feasible using all the RAM ever built by mankind, because estimates on the amount of RAM mankind will build, and when, are less falsifiable. Update: I am not considering cost; neither of RAM, power, logic including DES engines (as long as the number of DES operations remains within $2^{90}$). I am willing to assume that the amount of RAM used, and its effective speed, are the only factors to account for in determining the expected duration of the attack. This is similar to the hypothesis made by the authors of the linked paper, that their attack is limited by the amount (or cost) of RAM used, with all other factors of secondary importance. Update: sadly, nobody dared answer the question and the bounty period is over. Thus  is a first order answer to criticize.


I'm making a program using Visual Basic and Visual Studio 2013    On the left, names of players need to be typed.  However, I would like to do this automatically.  Here is a snippet of a HTML file containing all the players' names and rankings:
     1	     Player 1	     1	     3/0/0	     9	     41.67%	     62.97%	     &nbsp;

     2	     Player 2	     1	     2/1/0	     6	     66.67%	     50.00%	     &nbsp;

     3	     Player 3	     1	     2/1/0	     6	     55.56%	     50.93%	     &nbsp;
   Is there a way I can import and use that to automatically insert player names for me?   PS. I also have a tdf file to my disposal. Here is the part that I am interested in:  <standings>     <pod category="2" type="finished">         <player id="1070903" place="1" />         <player id="1070904" place="2" />         <player id="1070906" place="3" />         <player id="1070901" place="4" />         <player id="1070923" place="5" />         <player id="1070905" place="6" />         <player id="1070924" place="7" />         <player id="1070912" place="8" />     </pod>     <pod category="2" type="dnf">     </pod>     <pod category="1" type="finished">     </pod>     <pod category="1" type="dnf">     </pod>     <pod category="0" type="finished">     </pod>     <pod category="0" type="dnf">     </pod> </standings>   Is there a way I could import the player IDs, in that order?

I would like to know if there is a simple way to parse HTML in vb.net. I know that HTML is not sctrict subset of XML, but it would be nice if it could be treated that way.  Is there anything out there that would let me parse HTML in an XML-like way in VB.net?


I have requirement where I need to read part of the file which was updated from the last read. I mean  if I read the file last time at 2016-07-26T01:30 and after I want to run again at 2016-07-26T02:30 where  100 records are updated in the file then I need to read only those 100 records instead of whole file.  File Format is :  [2016-07-26T16:26:31.953-04:00] [AnalyticProviderServices0] [ERROR] [] [oracle.EPMOHPS] [tid: 17] [userId: <anonymous>] [ecid: 0000LGXnLUEComOpyg4EyW1N4iIi000002,1:28342] [APP: APS#11.1.2.0] Unable to resolve 'jdbc.EPMSystemRegistry'. Resolved 'jdbc'[[ [2016-07-26T16:26:31.954-04:00] [AnalyticProviderServices0] [WARNING] [] [oracle.EPMOHPS] [tid: 17] [userId: <anonymous>] [ecid: 0000LGXnLUEComOpyg4EyW1N4iIi000002,1:28342] [APP: APS#11.1.2.0] Failure while getting the active Essbase node for cluster [SWESSPROD1]. Runtime Provider Services Error: [Unable to resolve 'jdbc.EPMSystemRegistry'. Resolved 'jdbc']

tail -f x.log   I use this command to see a growing log file in the command prompt.  I am interested only in seeing the log lines that are written to the file after running tail -f and not interested in the logs that were written to the file before doing tail -f. But tail -f command on start, takes the last 10 lines and displays it.  This confuses me, at times if these logs are freshly generated (or) they are old logs?  So, how can i customize tail -f to output only the new entries?


I would like to grep the lines between the same occurrence of a pattern and then save each matching lines in a different file. For example, I have this:  name aaa bbb bbb ccc name aaa1 bbb1 ccc1 name ...   I would like to have   name aaa bbb bbb ccc   in file1  name aaa1 bbb1 ccc1   in file 2, and so on.  I tried with a flag inversion in awk like that:  awk '/^name/ {flag=!flag; next} flag {print}'   but I'm not getting what I want.  Do you have any suggestion to do that?

I have a large file that's a couple hundred lines long. This file is partitioned into many parts by a specific identifier, lets say 'ABC'. This line 'ABC' appears 6 times so I want 6 output files. I'm familiar with split and awk but can't seem to create a command line that will do what I've described, any ideas?  Here's an example  ABC line 1 line 2 line 3 ABC line 1 line 2 ABC line1   I'd like three files where ABC is the first line in the new file and it ends before the next ABC is encountered.


The statement I am trying to prove is:  If $a$ is an infinite cardinal number, prove that $\aleph_0 + a = a$  Any idea on how to start would be appreciated. I am thinking of proving it by showing that $\omega \cup A \approx A$. But how would I start?    Addition: Since $\omega \cup A$ is an infinite set, this implies that $\omega \cup A$ is equipotent with a proper subset of itself, namely $A$. This means that $\#(\omega \cup A)=\#A$.  Is this correct?

This seems evident, but I cannot come up with a reasonable proof for:  Question: show that if $X$ is an infinite set and $Y$ is a countable set, then $|X \cup Y|=|X|$


I've got a sphere with a texture and a material and I'm using blender render. This is how it looks in material view.  []  And this is how the rendered image looks.  []  What am I doing wrong?  Heres my .blend file :   Note : Im posting the blend file because I've got an integrated graphics card and I've heard blender has got some issues with these. So maybe it works for you, and its just my computer.

I was following  on creating a watch and noticed that when I rendered the watch, some pieces were messed up.  I'm new to 3D modeling and I've just learned Blender, I can't explain it well, so here's a picture:    Other examples:     I don't know if it's a problem with my World texture, the object, or the object's texture/material, so I can't even guess how to fix it. What causes this? Is it possible to fix it?


I have the following structure of data  HG2 MET  HG1 THR HG2 THR HG2 GLN   The desire output would be  HG1 MET  HG1 THR HG2 THR HG1 GLN   somehow I need to do the following  for i in MET GLN do sed 's/HG2 $i/HG1 $i/g' done   or if it is possible to specify that I do not want to change the HG2 for THR but still change all the other instead

I want to do:  cat update_via_sed.sh | sed 's/old_name/new_name/' > new_update_via_sed.sh   in my program.  But I want to use variables, e.g.  old_run='old_name_952' new_run='old_name_953'   I have tried using them but the substitution doesn't happen (no error). I have tried:  cat update_via_sed.sh | sed 's/old_run/new_run/' cat update_via_sed.sh | sed 's/$old_run/$new_run/' cat update_via_sed.sh | sed 's/${old_run}/${new_run}/'


I am completely new in Ubuntu. Just installed Ubuntu 14.04. On my other computer running Windows, I am using Avast, free edition.  Do I need anti-virus protection at all?

I thought that there was no need to scan for viruses either in Ubuntu or any Linux distros until I found virus scanner packages clamtk and klamav in Ubuntu software center yesterday.  This leads to the following questions:   How do viruses differ between Linux and Windows? How do the strategies for protection differ between Linux and Windows? Should a virus scanner package be installed on my system? If so, which would be a better option?


I want to solve part b) of the problem below.  Another user has provided the picture below the problem which describes the map transformation.  I am still uncertain about how to produce this image.  I understand the picture depicting the domain, since $A$ is restricted by $x>0$, but how do we then get the image $f(A)$ to wrap around the way it does.  Since the image consists of those points $(x^2-y^2,2xy)$, and in complex form, $(x^2-y^2+i2xy)$, why do we get that $y\neq 0$ for $x\leq 0$ in the image?  it's only $x$ that's restricted in the image, not the real part $(x^2-y^2)$, right?  Thanks!

I'm trying to prove the problem below - which comes from Munkres' "Analysis on Manifolds" book in the section on the Inverse function theorem.  Since its in the chapter on the Inverse Function Theorem I figured I'd start by showing that $f$ satisfies the conditions of the theorem.  Writing the Jacobian shows that it's both $C^r$ and we get $\det f'(x,y)=4x^2+4y^2\neq0$ when $x>0$.  So we can apply the theorem but I'm unsure of how to proceed to show that $f$ is $1$-$1$.  And I didn't see how to use the hint they provided.  Thanks!      Let $f\colon \mathbf R^2\to \mathbf R^2$ be defined by the equation   $$f(x,y)=(x^2-y^2,2xy).$$   (a) Show that $f$ is one-to-one on the set of all $(x,y)$ with $x>0$. [Hint: If $f(x,y)=f(a,b)$, then $\|f(x,y)\|=\|f(a,b)\|$.]


I have tried to install various linux distributions to my sisters laptop (Ubuntu Lubuntu lite MATE, Debian...) The only one that worked without hassle was Lubuntu 12.04 but I was not impressed with LXDE and I was also little concerned about the security of an old release. (My sister's windows laptop was really slow so I thought that this is my chance to convert her to Linux so I want to impress her.)  Almost every other distribution freezes during boot. I ended up trying Debian 8.6. The nomodeset boot parameter fixes freeze problems, but then resolution of desktop was horrible. If I installed firmware-linux-nonfree libgl1-mesa-dri xserver-xorg-video-atipackages, I was able to boot without the nomodeset option and the resolution of desktop was also good. However, booting doesn't always work. The machine often boots to command line and I couldn't figure how to start gui from there. (I tried startx but it didn't work.) I added acpi=off to boot parameters and boot problem went away. Now I was quite happy with result. I got newest version of debian release and gnome classic felt quite snappy. But the touchpad didn't work and I wasn't able to connect to wifi.  So, what should I do with this computer. Is it just too old for new Linux releases or is there some magic way to get it to work nicely?  Asus:    Model: X53B MB ver: K53BY RAM: 4 Gt, available 3.6 Gt AMD E-450 APU with Radeon(tm) HD Graphics Radeon HD 6320   I think my sister needs just basic web browsing, watching hd videos and office programs for school stuff.  Edit: I tried Xubuntu and it works well when I have nomodeset option in grub options. Only thing is that desktop resolution is little low. Is the problem with graphic drivers? How should I check what drivers I have installed and what drivers should I install. If I take off nomodeset, computer hangs to black screen during boot.  I don't know if I have two graphic cards but lspci | grep VGA outputs:   [AMD/ATI] Wrestler [Radeon HD 6320] [AMD/ATI] Seymour [Radeon HD 6400M/7400M Series]

For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?


Actually, I want to have the same functionality for equations as for figures: captions, text floating around equations (wrapfigure), List of equations in toc.  How to do? The usual way is to press equations into the figure environment, like here:    Is there a better way?

I have used the float package to create an equation float, eqfloat, so I can add captions to equations. Within the eqfloat I used the equation environment to typeset the math.  I want to keep the right hand arabic numbering within parentheses that is added by the equation environment but I also would like the eqfloat caption below the equation to use the same number as the equation environment.  The following code achieves this by making the eqfloat use the same counter as the equation environment and then manually adjusting the equation numbering within each eqfloat.   Is there a better way to make the eqfloat caption reference the current value of the equation environment counter?  Is it possible to prevent the custom float environment from increasing the counter and only to reference the current value of the equation counter?  \documentclass[a4paper]{article}  \usepackage[margin=25pt, labelfont=bf]{caption} \usepackage{amsmath, amsfonts, pifont, float, color, url} \usepackage[pdftex, plainpages=false, pdfpagelabels, bookmarks=true]{hyperref}  \newfloat{eqfloat}{h}{eqflts} \floatname{eqfloat}{Equation} \makeatletter \let\c@eqfloat\c@equation \makeatother  \begin{document}     ...     \begin{eqfloat}         \begin{equation}             E = mc^2         \end{equation}         \addtocounter{equation}{-1}         \caption{Equation caption here.}         \label{eq:example}     \end{eqfloat}  \end{document}


I notice that the Android Stack Exchange app shows my SO  and  tags have upvote scores of 111 and 103 respectively but via my desktop browser it shows that I have 108 and 100 respectively. This difference has lasted for over 4 days, is there a lag or difference in the calculation? All other tags have correct scores and number of answers posted.

I checked yesterday and today the new homepage in the Android app. Very surprised I saw that I would almost reach a silver tag badge, that confused be because I always take a look on possible badges I can get. However I compared the score with the website and I got a total different results. See this two screenshots:


Let $G=(V,E)$ be a locally finite graph with $V$ countably infinite. Assume that each vertex has even degree. Does there necessarily exist an Eulerian orientation on $G$? That is, is there a way to direct the edges of $G$ so that the number of edges going into a vertex $v$ is same as the number of edges going out of $v$? I know that the answer is yes in the case of $2$-connected graphs as is mentioned here    However, what if we drop the $2$-connectedness condition? That is, if we drop the property that $G$ is still connected upon the deletion of any one edge can we still find an Eulerian orientation?

all I am asked to prove that given a loopless multigraph $G$ with vertices all having even degree, it is possible to orient the graph in such way that the in-degree of every vertex is equal to the out degree of every vertex.  Now for the case when the number of vertices finite, this is easy using Eulerian trails.  However, I am curious if the same statement holds for a graph having countably infinite vertices all with even degree and finitely many edges?  Any help in see why or why the infinite graph case is true would be awesome.


I don't mean to create a bootable Live USB stick that has some persistent storage, I mean to actually install Ubuntu on a USB stick and be able to boot up from this on any computer.  I've managed to create a bootable Live USB stick that isn't a full-blown installation with my own user account and data and everything, and also managed to install Ubuntu on the USB stick without being able to boot up from the USB stick, but I have not managed to accomplish both at the same time so far.  EDIT:  also only gives me the "managed to install Ubuntu on the USB stick without being able to boot up from the USB stick" problem that I have already encountered :(  EDIT 2: And all the answers about using Unetbootin only give me the "bootable Live USB stick that isn't a full-blown installation" that I have also encountered.

If you are hurrying to reply, System → Administration → StartUp Disk Creator -- no, that's not what I'm talking about.   I want to try Ubuntu 11.04's Unity without touching my existing Ubuntu install.  To do this, I need to install the nVidia drivers first (sigh).  To do this, I need changes to persist a reboot.  To do this, I need to really install Ubuntu on a USB key.  How do you do that?    What I tried   I tried to make a USB key from , then boot from it, then choose "Install Ubuntu." The installer refused to install to the installation media itself. I tried, from my installed copy of Ubuntu:  sudo kvm /dev/sdb --cdrom .cache/testdrive/iso/ubuntu_natty-desktop-i386.iso   ...but the installer didn't detect the disk properly.


Say I have a string consisting of HTML, in a string Dim HtmlString as string = "bla bla bla blala bla22"  I need to get an array of string containing all the A elements found in the HtmlString say Dim AElementsInHtmlString as String()  How can I get ?

I'm looking for a library/method to parse an html file with more html specific features than generic xml parsing libraries.


I'm about to add another (second) language to a site. I considered a number of options:  Top level domains/subdomains/path. The first option seems to be rather for multi-regional sites, which is not my case.  Taking language from cookies/user preferences (the Accept-Language header).   I lean towards not using cookies, and ignoring Accept-Language. The reasoning here is that if one user sends somebody a link, it wants the other user to see the same content in that specific language. In other words sounds like a good practice for public content. Also I'm planning to use path (example.com/de), because... I'm not sure. Probably because subdomains sound more like multi-regional solution. And another thing, I'm going to leave the main language as is (keep the URLs). Otherwise I'll need redirects. Particularly from the main page. Which might sound suspicious to search engines. Or so I think. In other words each page will have two versions: https://example.com           (en) https://example.com/de        (de, new) https://example.com/page1     (en) https://example.com/de/page1  (de, new)  Does that sound good? Am I missing something? Do you think that shouldn't affect the site's rating in a bad way?

When I set up a site in multiple languages, how should I set up my URLs for search engines and usability?  Let's say my site is www.example.com, and I'm translating into French and Spanish. What is best for usability and SEO?  Directory option:  http://www.example.com/sample.html http://www.example.com/fr/sample.html http://www.example.com/es/sample.html   Subdomain option:  http://www.example.com/sample.html http://fr.example.com/sample.html http://es.example.com/sample.html   Filename option:  http://www.example.com/sample.html http://www.example.com/sample.fr.html http://www.example.com/sample.es.html   Accept-Language header:  Or should I simply parse the  header and generate content server-side to suit that header?  Is there another way to do this? If the different language versions don't have different urls, what do I do about the search engines?    UPDATE 2011-12-06  Google has new recommendations for meta tags for explicitly pointing to other language content: .  UPDATE 2012-05-25  Related but not precisely:   UPDATE 2013-06-12  includes discussion of several URL schemes directly relevant to the question.


I have a plugin that adds a few admin pages, a dashboard widget and a normal widget but I can't figure out how to add a page to the site.  I want to create a permalink that makes wordpress use myplugin/page.php which I assume will need to look like:  <?php get_header(); ?> MY CONTENT <?php get_footer(); ?>    Is this possible?

I'm developing some plugin where I would like to enable custom pages. In my case some custom page would contain a form like contact form (not literally). When user will fill out this form and send it, there should be the next step which will require more information. Lets say that the first page with form would be located at www.domain.tld/custom-page/ and after successful form submission, the user should be redirected to www.domain.tld/custom-page/second. Template with HTML elements and PHP code should be also custom.  I think that a part of the problem is possible to achieve with custom URL rewrites, but the other parts are currently unknown to me. I really don't know where should I start looking and what's the correct naming for that problem. Any help would be really appreciated.


I am from Saudi Arabia travelling to the USA with a valid visa. Can I stay overnight in London? Do I have to take my checked luggage or can it be left at the airport for the next days flight?

Is there a website or some other way to find out if I need a transit visa for a short stop in the UK on my way somewhere else? Ideally this should give me the answer for all nationalities, and take into account any other visas I may have.


I'm trying to edit this intro , but the mesh contained in the intro does not appear in rendering, the mesh appears all white in preview.  In the video contains the link with the file blender.  Thanks to all who tried to help me  Cheers!

I have a model of a building with a sidewalk around it.  Both show up when I switch to rendering mode in both Blender Render and Cycles Render mode.  But:  when I hit F12 for a final proper render, the building shows up -- but the sidewalk doesn't.    I've checked the normals and I thought the normals seemed pointed in the right direction.  I've set the Clipping on the Camera to a high number.  I removed all the materials from the sidewalk and added a new material-- the problem persists.  I've exported the blend as an FBX file and the Sidewalk shows up fine in Unity.  Just in final renders, it doesn't show up.    Here is a blend file: .  I tried to destroy everything unrelated to the issue and label things in a clear way.    Thanks.


I'm just starting out with Lubuntu and I've just installed DaVinci Resolve to do my video editing on.  But when I click its icon on the desktop, the loading symbol comes up and stops. When I run it in the console I get this error message:     error while loading shared libraries: libpng12.so.0: cannot open shared object file: No such file or directory   This is a bit beyond me. Any help?

Blackmagic Design's Resolve video editor, V14.0.1, requires libpng12. Unfortunately, only libpng16 is provided with the new 17.10 release.   Is there a way to revert to libpng12 under 17.10? If so, how do I get libpng12 - synaptic doesn't list it when I search for it.


$a_1=1$, $a_2=3$, $a_{n+2}=a_{n+1}-2a_n-1$   How do you solve this? I only solve the sequence in the form $a_{n+2}=ba_{n+1}+ca_n$ before by writing it in $x^2-bx-c=0$ but for this I don't know how to. Please help

Given a recurrence relation:   $$ x_{n+2} = px_{n+1} + qx_n + r $$   Find the general term $x_n$ given initial conditions $x_1 = a$ and $x_2 = b$, where $a,b,p,q,r$ are some given numbers, $n \in \mathbb N$.   Since this is a non-homogeneous linear recurrence relation i've started with solving for $x_n^h$ which is a solution for homogeneous relation:  $$ x_{n+2} - px_{n+1} - qx_n = 0 \\ \lambda^2-p\lambda - q = 0 $$  I'm assuming here that two distinct roots $\lambda_{1,2}$ exist for this equation (single root case is handled similarly). So the general term is in the form:  $$ x_n = C_1\lambda_1^{n-1}+C_2\lambda_2^{n-1} $$  With the initial condition it's possible to find the values for $C_1$ and $C_2$:  $$ C_1 + C_2 = a \\ C_1\lambda_1 + C_2\lambda_2 = b $$  After solving the system of equation with respect to $C_1$ and $C_2$:  $$ C_1 = \frac{b-a\lambda_2}{\lambda_1 - \lambda_2} \\ C_2 = \frac{b-a\lambda_1}{\lambda_2 - \lambda_1} \\ $$  Which eventually results in:  $$ x_n^h = \frac{(a\lambda_2 - b)\lambda_1^{n-1} - (a\lambda_1-b)\lambda_2^{n-1}}{\lambda_2 - \lambda_1} $$  Final solution consists of a sum of particular and homogeneous solutions, but that is where I got stuck. What is the way to find the particular solution for the given problem? I'm pretty new to such kind of problems so any details are very much appreciated.  upd:  Based on the technique in @rtybase answer here are my findings:  $$ \begin{align} x_1 &= a \\ x_2 &= b \\ x_3 &= pb - qa + r \end{align} $$  Writing the system for $c_1, c_2, c_3$:  $$ \begin{align} a &= c_1 + c_2 + c_3 \\ b &= c_1\lambda_1 + c_2\lambda_2 + c_3 \\ pb+qa+r &= c_1\lambda_1^2 + c_2\lambda_2^2 + c_3 \end{align} $$  Now solving for the coefficients gives a huge formula. The answer to this problem suggests that:  $$ x_n = \frac{(\lambda_2(a+\gamma) - b -\gamma)\lambda_1^{n-1} - (\lambda_1(a + \gamma) - (b-\gamma))\lambda_2^{n-1}}{\lambda_2 - \lambda_1} - \gamma $$  Where:  $$ \gamma = \frac{r}{p+q-1} $$  Unfortunately I was not able to arrive at exactly the same result, but testing my solution (not posting since it's monstrously big) using SameQ in Mathematica with the given answer shows that they are equivalent. Those transformations are not very obvious to me, so i skipped them since the answer matches the given one (yet the symbolic expressions are different)


When I attach my harddisk, it gives the following message:  Error mounting /dev/sdb1 at /media/gunnar/My Passport: Command-line `mount -t "ntfs" -o "uhelper=udisks2,nodev,nosuid,uid=1000,gid=1000,dmask=0077,fmask=0177" "/dev/sdb1" "/media/gunnar/My Passport"' exited with non-zero exit status 13: $MFTMirr does not match $MFT (record 3). Failed to mount '/dev/sdb1': Input/output error NTFS is either inconsistent, or there is a hardware fault, or it's a SoftRAID/FakeRAID hardware. In the first case run chkdsk /f on Windows then reboot into Windows twice. The usage of the /f parameter is very important! If the device is a SoftRAID/FakeRAID then first activate it and mount a different device under the /dev/mapper/ directory, (e.g. /dev/mapper/nvidia_eahaabcc1). Please see the 'dmraid' documentation for more details.   Anyone know what to do about this? It works just fine with my Windows PC.  And, - I am the COMPLETE amateur with Linux commands, so please be gentle with me , and keep it extremely simple. Thanks in advance.  Gunnar Sørensen, Oslo, Norway

I have a 1TB external hard drive that I recently formatted to NTFS. It was mounting on my Ubuntu 11.10 fine until just now. I didn't make any changes to affect my OS or my exhdd.  The error that I get is:  Error mounting: mount exited with exit code 13: $MFTMirr does not match $MFT (record 0). Failed to mount '/dev/sdb2': Input/output error NTFS is either inconsistent, or there is a hardware fault, or it's a SoftRAID/FakeRAID hardware. In the first case run chkdsk /f on Windows then reboot into Windows twice. The usage of the /f parameter is very important! If the device is a SoftRAID/FakeRAID then first activate it and mount a different device under the /dev/mapper/ directory, (e.g. /dev/mapper/nvidia_eahaabcc1). Please see the 'dmraid' documentation for more details.   I did read  and . But neither helped.  I tried installing ntfsfix but no such package exists anymore. I have never used this HDD on a windows machine. If I need to use an other machine to do stuff to fix this, I have access to a mac.  Any advice?   This is my sudo fdisk -l output: What in the world is GPT? I didn't do that. It used to be NTFS.  Disk /dev/sda: 500.1 GB, 500107862016 bytes 255 heads, 63 sectors/track, 60801 cylinders, total 976773168 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disk identifier: 0x000586fb     Device Boot      Start         End      Blocks   Id  System /dev/sda1   *        2148   961320312   480659082+  83  Linux /dev/sda2       961320313   976773167     7726427+   5  Extended /dev/sda5       961320314   976773167     7726427   83  Linux  WARNING: GPT (GUID Partition Table) detected on '/dev/sdb'! The util fdisk doesn't support GPT. Use GNU Parted.   Disk /dev/sdb: 1000.2 GB, 1000204886016 bytes 255 heads, 63 sectors/track, 121601 cylinders, total 1953525168 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disk identifier: 0xcfd88605     Device Boot      Start         End      Blocks   Id  System /dev/sdb1               1  1953525167   976762583+  ee  GPT


I have a laptop with a hidpi display, I'm using Ubuntu 18.04 with a resolution of 3840x2160 and 200% scale. Everything software I use looks fine with the exception of one so I would like to write a script so I can automatically change, let's say scaling to 100% and resolution to 1024x768.  Is there a way to do this?

I installed Ubuntu and the resolution of the desktop is so big that it only shows about 50% of the screen, but is shows up normal while using command line.   What should I type in the command line to change the desktop screen resolution?


Let $F$ be a field, and $p \in F[X]$ let be a polynomial of degree $n.$ There exists some field extension where $p$ has $n$ roots. Do you know the proof of following statement?

I'm reading a brief introduction on Galois theory, it talks about splitting field. The idea is genius, however I have some doubts on whether in general a splitting field always exists?  By definition, a splitting field of a polynomial $p(X)$ over a field $K$ is a field extension $L$ of $K$ over which $p$ factors into linear factors $p(X) = \prod_{i=1}^{deg(p)} (X-a_i)$ where for each $i$ we have $(X - a_i) \in L[X]$ and such that the roots $a_i$ generate $L$ over $K$.  If $K$ is $\mathbb R$, the result is straightforward due to  as it states that every non-constant single-variable polynomial with complex coefficients has at least one complex root.  But if $K$ is a general field, does such an extension $L$ always exist? How to prove that?


Is the Disney animated series of The Avengers: Earth's Mightiest Heroes canon to the whole series?

I'm planning on re-watching the currently-released 5 Marvel films prior to seeing The Avengers.  Have Marvel released any sort of official viewing order?  Captain America: The First Avenger seems like the hardest one for me to place in order with the rest.  It takes place prior to the other films, but has the greatest number of references to the other films.  So should it be watched first, or last?  The rest of them are relatively clear, as they're chronological in the order they're released, with the possible exception of The Incredible Hulk and Iron Man 2 happening at the same time.


What is the difference between these two following statements?  String s = "text";  String s = new String("text");

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


I use Soundcloud to add  a preview for an MP3 on a Facebook post:    How can I add a preview for an MP3 on a Facebook post without Soundcloud so that the user doesn't have to open a new tab to listen to the MP3?

I know it's possible to upload videos to Facebook. Is it possible to upload an mp3 to Facebook using their user interface?


The first refusal (green) was my mistake, as I thought I could show my credit card as well and the employment leave of absence was missing.  The second refusal (black), they think that I have unknown credit in my account, whereas the truth is that it was my annual leave payout and I have shown and given the payslip as well. Also, my friend deposited approximately 5,000 AUD, as she wants to sponsor me. I have already repaid her, as it was an issue in the second refusal. Can I re-apply or am I out of options? I wanted to visit my friend. I live  in Australia as a temporary graduate, and I have my sister, brother in law and our home and property.

Many of the UK visa refusals we see here share a common pattern and the prevailing reasons refer to V 4.2 (a) and (c).    I do understand that, while the applicants may describe very different individual circumstances, there's a consistent pattern and, broadly, fall into specific categories:    Credibility (lifestyle, lack of ties, visit history, lies & omissions) Funding (insufficient funds, provenance of funds, funds parking) Sponsorship (family, friends, employer)   Question: What most commonly triggers a UK visa refusal where V 4.2 (a) and (c) are given as the grounds?  Secondarily: Given that there is a clear pattern, to what extent are these refusals predictable? Does sponsorship make a difference? Is there a set of personal circumstances, however abstract, where a refusal is all but guaranteed? For example, why do those we see here on TSE who sought entry for the PLAB or British Army appear to be refused with a common theme? Is there a uniform shortcoming or is it just discrimination?   PLAB: What is about applications for a visa, for the purpose of sitting the Professional and Linguistic Assessments Board (PLAB) exam, that seem to invite refusals. After all, the test is given so that international medical graduates can show that they qualify to practise medicine in the UK. The first part, PLAB 1, can be taken in centres outside of the UK. However, PLAB 2 can be taken only in the UK. Why can't you can't get a visa just to sit the exam, promising that you'll leave immediately after?    British Army: Since Commonwealth citizens are eligible to apply online to join, even those who don't reside in the UK, why is it so difficult to get a visa just to attend an interview to see whether you are suitable? Even with an invitation from the Army, such visa applications seem to be unsuccessful. Isn't a career in the British Army a valid reason?     Lastly:  After such a refusal, what approaches would increase the chance of a successful application?


How can I get my external  IP address using the Command Line?

I am on DHCP, having dynamic IP.  Finding your public IP when using a GUI and a browser is extremely easy. Simply go to Google.com and search for "What is my IP". Google will display it in the very first line.  However I am unable to find my public IP when inside Ubuntu server.  I have created a system with Ubuntu server (LAMP Stack) for my personal use. This system boots up simply in terminal mode. I want to do SSH using some other system across the internet; thus knowing the public IP becomes necessary.  What is the command to display the current public IP adress of that system?


If there is no friction in space, then how does the space shuttle boost?  According to Newton's law we move by pushing something; in space, there is vacuum, so how the space shuttle moves without friction?

I know Newton's third law of motion might be the answer for this but still I am wondering how the rockets could thrust in the empty space and move in the opposite direction. I guess an astronaut wouldn't be able to push in the empty space with his hands or legs to move himself, but with a rocket engine it's possible. How? What might be the explanation for this in General Relativity?


I have to prove that $$\sum_{k=0}^n\binom{2k}{k}\binom{2(n-k)}{n-k}=4^n$$ The questions also asks for an algebraic proof and I used induction for that algebraic proof. For a combinatorial proof I have no idea on how to proceed on it . The first thing I thought of using a set and considering $k$ subsets of it but that idea does not work here. I just want a hint and I would prefer not giving out the full answer.

Possible Duplicate:          This was part of a homework assignment that I had, and I couldn't figure it out. Now it is bugging me. Can anyone help me? Although a proof would be nice, I wouldn't mind a push in the right direction.   $\displaystyle\sum_{i=0}^n {2i \choose i}{2(n-i)\choose n-i} = 4^n$


I know that this question is not new but as I look at the answers, like,      I realize that these threads are old. Since Matlab itself has included many functionalities to address this issue, I am wondering if the community can post some updated methods.  Also it will be nice if answers can address the issues one might face if one is using an online template for making \LaTeX documents like overleaf.com  Thank you

Which way of exporting Matlab graphics delivers the best result for inclusion in LaTeX? Is it possible to export scalable vector graphics, or even LaTeX graphics?


I recently found in my late husband's files, an uncashed payroll check dated 2/07/90 in amount of $557.74 which he  apparently had overlooked.  He passed in 2012.  Is it even pos-  sible to be remunerated at this late date for money he earned?  The company is still in business.

I found an old un-cashed check dated 1994 for $487 from my Xerox Retirement plan with no expiration date. Can I still cash it?


I was trying to find out the sizeof a structure, which I thought should show up as  24 bytes on my 64 bit Mac OS, instead it was shown as 32 bytes. what am i missing?   #include<stdio.h>   int main() {   struct Test{       int a;       int *b;       char *c;       float d;   }m;   int size = sizeof(m);   printf("%d\n",size);  }

Why does the sizeof operator return a size larger for a structure than the total sizes of the structure's members?


I am using elsevier cas single column latex template and want to position figures and tables using H option, but I get error "Kernel/Key unknown" and "The module does not have a key called cas/tbl/H or cas/fig/H". I have used float package in the document preamble. How can I position figures and tables?

I am using the cas-dc template for Elsevier. When trying to use \begin{figure*}[t], except I get the error 'The module 'cas/fig' does not have a key called 'cas/fig/t'. Other templates I use work fine. I have included \usepackage{stfloats}. I don't see anything mentioned that strictly forbids it, unless I missed this. Anyone know why?


Does  interact with cards that care about surveil? Like   for instance.

I was looking at  and found the effect surprisingly similar to the keyword Surveil. To compare, first the wording of Contingency Plan and then the wording of the Surveil keyword:       Look at the top five cards of your library. Put any number of them into your graveyard and the rest back on top of your library in any order.     And       701.41a To "surveil N" means to look at the top N cards of your library, then put any number of them into your graveyard and the rest on top of your library in any order.     They quite clearly are the same, so can I assume the card states "Surveil 5" instead? And if so, does it trigger abilities which state "Whenever you surveil ..."?


$U$ - unitary operator on complex Hilbert space. Show that $\sigma(U) \subset \{z \in\mathbb C : |z| = 1\}.$  So $U$ is unitary operator if is is surjective and it preserves a scalar product and a unitary operator is a bounded linear operator $U : H → H$ on a Hilbert space H that satisfies $U^*U = UU^* = I$, where $U^*$ is the adjoint of $U$, and $I : H \to H$ is the identity operator.  But how do I show that $\sigma(U) \subseteq \{z \in C : |z| = 1\}.$ ?   Thanks in advance for any help

In a Hilbert space, let $U$ be a continuous operator which it unitary. Prove $\sigma (U)\subseteq \Bbb{S}^1$.   It is important for me to know how I am doing, and I didn't come by a clear explanation so it would be appreciated to have your correcting and guiding.  Attempt: $U^{*}U=UU^{*}=I$ and therefore $U^{-1}=U$. I have $$ \| U x \|^2 = \langle U x, U x \rangle = \langle U^* U x, x \rangle = \langle x, x \rangle = \|x\|^2 $$ and the same goes for $U^*$ and therefore $\| U \| = \| U^{-1} \| = 1$.   Looking at $U-\lambda$ I can take $$ -\lambda U(U^{-1}-{1\over \lambda}I) =U-\lambda I. $$ Clearly, for $\lambda \ne 0$, $-\lambda U$ is defined and is a linear operator. $(U^{-1}-{1\over \lambda}I)$ is invertible if $|\lambda|\ge 1$ and therefore $\sigma (A^{-1})=\sigma (A)\subseteq \{|z|\le1\}$. But from the RHS, $U-\lambda I$ is invertible if $|\lambda|\le 1$ and therefore $\sigma(A)\subseteq \Bbb{S}^1$. I have noticed my claims tend to have holes in them many times which I cannot spot. If it is substantially true, how can I make sure it is completely formal?


I am writing on a document where I often have the situation that a table is at the end of a page, but then Latex puts the table on the next page. Now the problem is: The text that is supposed to be AFTER(!) the table appears on the preceding page, as there is apparently not enough space for the table. This is of course an awful situation.   Therefore, I either want to have this space on the preceding page left blank and continue with my table on the next page or I want to split my table into pieces (but not manually, as I would then have to adjust this too frquently then)  Does anybody have an idea how I could solve this problem?

Is there any package or a method to force LaTeX to keep floating environments like table and figure closer to where they are declared?


For a plugin I'm creating it generates custom JavaScript that should be executed in the footer of the page. Being that it's custom JavaScript, I can't simply put it in a file and register & enqueue the file. How should I go about Registering and Enqueuing custom JavaScript? Note: It would be for a Shortcode. The JavaScript would look something like this, $("#CustomID").aFunction(withCustomData); Again, I need it to be executed in the footer of the page, I can't simply return it in the shortcode. Edit 1 The JavaScript is "truly" unique. It takes in parameters from the shortcode itself and may change depending on the time. Again, this is something that is constantly changing and something that should not be put in a file each time it needs to be loaded.

Is there a way to use wp_enqueue_script() for inline scripts?   I'm doing this because my inline script depends on another script and i would like the flexibility of inserting it after it's loaded.  Also, It's an inline script because i'm passing php variables into the javascript (like theme path, etc)  Thanks in advance.


My old passport  under my nickname with US Visa in it was declared lost or stolen So I wasn’t able to leave. US authorities asked me to get a new passport. Now i have my new passport with my name in my birth certificate. Can I still travel to the USA?

I had my US visa about 7 month age, and I had to renew my passport for certain circumstances, so there was a mismatch in the name between both the visa and the new passport, you see they had to put my grand grandfather's name which was not on the old passport nor the visa, the name on old passport and visa is: Abdelrahman Samy Ali Mohammed and the new passport is: Abdelrahman Samy Ali Ibrahim Mohammed. My grand grandfather's name is Ibrahim, so the question is that gonna cause me any troubles concerning my entry to the US? is there any document should I consider taking it while i'm traveling?  Thanks,,


I need to show that the Euclidean metric and maximum metric (or square metric??) are strongly equivalent. I have no idea how to start this proof. Any help?  $d_1, d_2$ are called strongly equivalent if there exist positive constants $K, M$ such that for all $x, y\in X$: $Md_1(x,y)\leq d_2(x,y)\leq Kd_1(x,y)$


I need to center(left to right) absolute elements(green) inside a relative container(blue). The child elements(green) need to have a dynamic/unset width. I would rather not use JavaScript(CSS and html only).  Code:   .relativeParent {   width: 100px;   height: 100px;   background: blue;   position: relative;   overflow: visible;   display: block;   margin-left: 100px;   margin-bottom: 20px; }  .absoluteChild {   display: block;   background: green;   position: absolute; }

test

asd asdf asdf asdf asdfa sdf

How can I horizontally center a
 within another
 using CSS?

Foo foo


I'm using WPS on my Windows network and would like to use it on my Ubuntu 17.10 computer.  I'm not very conversant in Linux.  Anybody have a suggestion?

It's pretty complicated and sometimes the system freezes when I try to download and install wps office. I think it is much more convenient to use the terminal. But I never used installed WPS Office from the command line. That would be great if I could update it using software manager or terminal. Third party deb files are from separate locations. I specifically want to know about WPS


I am in manual testing from last 5+ years and having a sound experience in it. Now I want to switch in automation testing and want to start with Selenium.  I don't have any programming experience or knowledge in either Java and C#.

I'm looking for a programming language to recommend to a friend considering teaching herself software testing.  I have a friend who is interested in learning software testing, and I believe strongly that today's testers absolutely have to have automation skills if they don't want to hit a glass ceiling after a few years (or become super-star exploratory testers . . . but not everyone wants the stress of having to be a super-star).  I can't look to my own experiences, because I did a 4-year CSE degree that was geared toward developers, and my education isn't light-weight enough.  I want something relatively easy to learn that will give the tester the greatest bang for their buck in developing good, maintainable automation.  I know Ruby is used for a couple of test tools - Watir and Cucumber - and something that works with Selenium, WatiN, or Watir would be good.  The two favorite languages locally for developers seem to be Java and C#, and she will be working locally.  Whatever she learns needs to have good resources for novices at programming to self-teach, whether those be books, online tutorials, or online communities.  Something that isn't too expensive to learn would probably be preferred ('free IDEs are available and there are good free tutorials and information to learn from' is ideal).  Also, something that is harder to write bad code in would be good, since I want her to be able to avoid brittle, unmaintainable tests.  She is highly motivated to learn, so a very useful language that will take 6 months of hard work to get a usable level of skill is preferable to a slightly useful language that she could use in a single month.  At the same time, any time she spends learning to program is time she could be spending practicing exploratory testing or learning other great test skills - so ease of learning does matter.     Also - I do realize that programming is one very small piece of being a good tester.  I just have a better handle on self-teaching the rest of the testing skills, since I self-taught myself those areas and can pass on what worked for me or what I wish I'd known.  I don't want anyone to think I believe you can learn to be a good tester by just learning to program; rather, I just don't have a good handle on the easiest way to start programming as a tester since I started testing as a programmer.


This would be a very easy question for all you javascript/jquery guys.  I've been programming javascript from past 2 years and today I faced a strange problem.  I am fetching a JSONarray from my C# Webmethod and calling it by jQuery.ajax()  When I do   for (i in JSONRaw) {     Index = Index + 1;     $('#bottomGridDashboard').append('
 ' + Index + '	 ' + JSONRaw[i].DisplayName + '	 ' + JSONRaw[i].SpeedInKPH + '	 	 ' + JSONRaw[i].DepotID + '	 ' + JSONRaw[i].RouteID + '/' + JSONRaw[i].ScheduleID + '/' + JSONRaw[i].TripID + '	 ' + JSONRaw[i].Direction + '	 ' + JSONRaw[i].LastStop + '	  ' + JSONRaw[i].ETAMinutes + '
'); }   the appended table adds two extra rows putting every field as 'undefined'.   However if i replace the loop with   for (var i = 0; i < JSONRaw.length;i++ ) {     Index = Index + 1;     $('#bottomGridDashboard').append('
 ' + Index + '	 ' + JSONRaw[i].DisplayName + '	 ' + JSONRaw[i].SpeedInKPH + '	 	 ' + JSONRaw[i].DepotID + '	 ' + JSONRaw[i].RouteID + '/' + JSONRaw[i].ScheduleID + '/' + JSONRaw[i].TripID + '	 ' + JSONRaw[i].Direction + '	 ' + JSONRaw[i].LastStop + '	  ' + JSONRaw[i].ETAMinutes + '
'); }   the undefined rows disappear..   I apologize for my stupidity but I have never faced any such problem before. What could be the reason??  EDIT:  The array is perfectly fine. And there are no holes in it. Another observation is that the undefined properties appear only at the bottom of my grid. I think it is processing two extra indexes more than the array length.  EDIT-2  My console.log showed me the following elements in my array.    I've declared the prototypes in my Master page.  Array.prototype.inArray = function (comparer) {     for (var i = 0; i < this.length; i++) {         if (comparer(this[i])) return true;     }     return false; };   Array.prototype.pushIfNotExist = function (element, comparer) {     if (!this.inArray(comparer)) {         this.unshift(element);     } };   Is it increasing the array length. ? ?

I've been told not to use for...in with arrays in JavaScript. Why not?


Can anybody explain why my score at , at the time of this writing, is 113 when it should be 112?

If a user is the type of person to consecutively get downvoted to potential negative reputation, so be it. What's the reasoning to maintain a minimum of one?  One reason that may justify this is of trying to not deter new users from the site who haven't read the FAQ and unknowingly and wrongly ask or answer a question. But most of us acknowledge this and not downvote in such a scenario.  So what's the reasoning behind this lower bound of 1?


Method:      public Auction getAuction(UUID id) {         System.out.println("count: " + auctions.size());         if (!doesAuctionExist(id))             return null;         UUID owner = UUID.fromString(Main.getAuctionsFile().getConfiguration().getString("auctions."+id.toString()+".owner"));         Bukkit.getPlayer("NoneTaken").sendMessage("owner "+owner);         long price = Main.getAuctionsFile().getConfiguration().getLong("auctions." + id.toString() + ".price");         boolean useTokens = Main.getAuctionsFile().getConfiguration().getBoolean("auctions." + id.toString() + ".useTokens");         long timeCreated = Main.getAuctionsFile().getConfiguration().getLong("auctions." + id.toString() + ".timeCreated");         ItemStack item = (ItemStack) Main.getAuctionsFile().getConfiguration().get("auctions." + id.toString() + ".item");         Bukkit.getPlayer("NoneTaken").sendMessage("null: " + (owner == null));         return new Auction(                 owner,                 item,                 price,                 useTokens,                 id,                 timeCreated);     }   Constructor:       public Auction(UUID owner, ItemStack item, long price, boolean useTokens, UUID identifier, long timeCreated) {         this.owner = owner;         this.item = item;         this.price = price;         this.useTokens = useTokens;         this.identifier = identifier;         this.timeCreated = timeCreated;         Main.getAuctionManager().registerAuction(this);     }   Error:  18.10 17:12:12 [Server] ERROR Error occurred while enabling BanditAH v1.0 (Is it up to date?) 18.10 17:12:12 [Server] INFO java.lang.NullPointerException 18.10 17:12:12 [Server] INFO at me.nonetaken.banditah.managers.Auction.<init>(Auction.java:28) ~[?:?] 18.10 17:12:12 [Server] INFO at me.nonetaken.banditah.managers.AuctionManager.getAuction(AuctionManager.java:86) ~[?:?] 18.10 17:12:12 [Server] INFO at me.nonetaken.banditah.managers.AuctionManager.<init>(AuctionManager.java:28) ~[?:?]   Line 86 in AuctionManager.java is the owner, line in the constructor in the first block of code. The message sending "null: true/false" always returns false, thus the object can't be null but an NPE is being thrown in the error on that line.  Any help is appreciated :)

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


I was pondering whether charges will cause time dilatation? Let me explain more, well we know that gravity causes time-dilatation because of gravitational acceleration which is equal to: $$a = \frac{G* m_1}{r^2}$$   That said we can say if we say since the $a$ does not get stronger with time we can say substitute $a$ in Special Relativistic effects so we can get the relativistic results although small it can still show some scientific significance anyhow similarly we can use 2 opposite charges and simply gain the acceleration and we will get $$a = \frac{q_1* q_2* k}{r^2*m_2}$$   This shows that since charges will also have an "charge acceleration" we can also say since the acceleration is constant and does not increase with time we could also substitute into special relativistic environment. to get results, so would this thought process me correct or am I incorrect in saying this?   If so can somebody explain to me what is incorrect assumptions or thought processes?

It is written everywhere that gravity is curvature of spacetime caused by the mass of the objects or something to the same effect. This raises a question with me: why isn't spacetime curved due to other forces or aspects of bodies?  Why isn't it that there are curvatures related to the charge of a body or the spin of particles or any other characteristics?


I am literally searching everywhere but could not find an answer that suits my needs. So I want to check if a string (for example: string s = "aoksaAsjAa";) Contains specific upper and lowercase letters. For the example above i want to check how many uppercase A's are in there and how many lower case a's are in there and then tell me the number of the counted letters. How do i do that?

I am doing something where I realised I wanted to count how many /s I could find in a string, and then it struck me, that there were several ways to do it, but couldn't decide on what the best (or easiest) was.  At the moment I'm going with something like:  string source = "/once/upon/a/time/"; int count = source.Length - source.Replace("/", "").Length;   But I don't like it at all, any takers?  I don't really want to dig out RegEx for this, do I?  I know my string is going to have the term I'm searching for, so you can assume that...  Of course for strings where length > 1,  string haystack = "/once/upon/a/time"; string needle = "/"; int needleCount = ( haystack.Length - haystack.Replace(needle,"").Length ) / needle.Length;


So I was looking at a tutorial and saw this line of code:  Thread timer = new Thread() {   @Override    public void run(){     // etc....   } }   What is happening here? They are creating a new object of the Thread class and declaring the method run when creating that object? How is this possible? My understanding was that an object got its methods from its class?

What is the use of anonymous classes in Java? Can we say that usage of anonymous class is one of the advantages of Java?


I read this book back in middle school, but cannot remember the title. It was a great story, but I can't seem to find it. The book begins with a woman falsely accused of witchcraft by her neighbor. She is found guilty and is sentenced to be made into an offering for the dragon. When the dragon finds her, she throws stones at it in a rage. The dragon finds her reaction curious and shapeshifts into a man who agrees to help her seek revenge on her accuser.

Story is in a medievalish setting and starts with a woman who has been falsely accused of being a witch being taken by 2 men to be sacrificed to a dragon.  She ends up befriending the (male) dragon, who is able to transform into various forms, including human, and can speak only the language of whatever form he is in. e.g. can speak English in human form, but can't in dragon form.  He needs to return to his dragon form every day at sunrise or he dies.  Contact with iron or steel causes him pain and prevents him from transforming.  Near the end of the book, he's been put in handcuffs by one of the two men from the start and the woman has to get the assistance of the other one (village blacksmith?) to remove them before sunrise, which they manage to do just in time.  I think I read it maybe 10 years ago.    I also remember it was a very short book, probably only about 100 pages.


Say I'm in BGE and I'm running an artificial intelligent human that will see the room its in. In my code, I need the images from the 2 cameras in its eye sockets. How do I get camera images in my python (or external C++) code, to then be able to use in ex. in a Convolution Neural Network algorithm?

I've seen similar questions on how to take pictures, but those questions are for the render engine, cycles, and others. I have a set of weapons, and want to take a picture from the side view. When you swap to your weapon, your newly selected weapon will show its picture on the right side of your screen, like other FPS games. In other words, I am looking for a way to take a screenshot in the GE; if you can, then can I also change the resolution? Any help is appreciated, thanks!


What happens to (good) posts when a user is deleted, and can I find them by userid, either on site or via SEDE?

I have meticulously read through similar questions, answers and their comments but I still do not understand how the deletion is done. From what I understand I email the customer service and then they do what exactly?     1) They disable my account so that I can no longer use it?      2) They reassign all of my questions and answers to some other   account? To which one?      3) They delete all my questions and answers so that they go away from   public view?   What is the flexibility (if it exists) of the deletion procedure? Is it possible to erase the traces of my former association with the site. Can I request any of the following be done?     4) All of my questions and answers be deleted from public view?      5) Some of my questions and answers be deleted? If yes what criteria?      6) Can I have all of my contributions be assigned to some other   account which runs as sort of a "collective account" and already has   tons of content so that it doesn't happen like my contributions just   move to some other url but still stay grouped under that location and   therefore that location can be discovered as representing my account?      7) Can I have my contributions dispersed through several "collective   accounts?      8) Can my current public name be removed from any comments to my posts   so that my posts cannot be identified later as once belonging to me?   Please be polite with me. I wouldn't have asked if I have found the answer in the other questions. The other questions are also old and it is not clear what the situation is as per 05/2012.  UPDATE (for those interested):  I asked the Stackoverflow team about the procedure. Apparently none of the points 2-8 I asked above are possible, only 1 will take place. The link to my user page from my contributions is going to be removed and replaced with non-clickable text of an anonymized user name like "user1234". Whether this number is the same as my current user_id is not clear. That's all the information I got.  I'm going now to rename myself to "Anonymous" then request the account deletion. Those interested in the procedure will witness the exact result on this page.  Farewell.


I used following command \paragraph to number the heading. Then the next test immediately start after the heading. that I do not want. Situation(I do not want this):  1.1.1.1 Heading: bla bla bla  I want:  1.1.1. Heading: bla bla bla  Thanks for response

I want to format paragraph to work as a regular title  \paragraph{title} text goes here   output of that is:  title text goes here    how can I change the output to force line break and use the usal indentation of 1st line?  title  text goes here  __  edit1: this is for a thesis and I'm using the document class - book. I don't want to use \subsubsection because this is the structure of the document. I just simply need one level of headers deeper.  And that is why I wanted to use \paragraph as a heading not as paragraph.  edit2: clarification: I'd like paragraph to behave like a header like section subsection subsubsection etc


Recently I came across this user-  I don't really know if this is really a bot on the site, but it claims to be one (If it really is a bot how did it answer one question on Stack Overflow?).  Does the SE network approve of or support usage of bots on the website (for any reason... maybe collecting site data, etc.)?

There are discussions on Meta already for some time now about the potential usage of bots on Stack Exchange (SE). The earliest I could find goes back to  , but there have been others , .  Here’s an  about having a bot that tries to answer “easy” questions. The scenario is that (almost) duplicate, simple questions are asked time after time, despite SE’s efforts to prevent this by listing related questions at posting time. This is where the bot could be of service: it could quickly retrieve and post an answer from a previous duplicate (or with smarter Artificial Intelligence - AI)  even from elsewhere on the web, like a user manual or a mailing list discussion). I imagine this might save some review time for moderators, and perhaps users would also enjoy not having to answer over and over again to the same question. Besides, answers would be very fast, which should make everyone happy if they are also of good quality.  This idea of “janitor” bots can have more use cases besides answering “easy” questions (see also discussion ), like suggesting missing tags and re-formatting what should have been code blocks, to name a few.  Yet, despite a long time since these discussions, better Machine Learning Classifiers (ML) and AI over the years, and   , it doesn’t seem that any such bots are among us (except maybe ). As part of a research project at the university, I am trying to understand why this is the case.  For this reason I’d like your opinion on the following:   Do you consider a bot “harmful” for the SE communities?   If yes, would you consider the bot harmful even if   it operates in an automatic manner only in limited scenarios (e.g. specific tags) it operates in a semi-automatic manner (namely with the supervision of a moderator who decides for posting or not the answer).  it operates only for a limited amount of time in a small community (e.g. here).   Would you consider it too risky to give a bot a try? Would you accept an answer provided by a bot?   If not, why ? (e.g. you don’t trust replies from machines)  Would you consider useless a “sloppy” answer by a bot, even if it is provided in just a few seconds? Answers may be not perfect, but they may link to other relevant threads that can help the asker to fix the problem without waiting extra time for a human response.


We are running ubuntu 14.04 with openssh client & server installed. However when trying to connect to port 22 we get 'connect to host localhost port 22: Connection refused’.  Port 22 is open on our firewall, which we thought would've solved our issue.   We have added rules to ufw and purged/reinstalled openssh. When using the command ‘sudo service ssh status’ it says ssh is running however when using commands ‘netstat', 'ps -A | grep sshd', 'sudo  ss –lnp | grep sshd’ we get no message. When testing ‘ssh –v localhost’ we also get connection refused.  We have restarted ssh many times but the problem still remains.  Also when we use the command 'sudo iptables -L' we get the following output:  target     prot opt source               destination          ACCEPT     tcp  --  anywhere             anywhere             tcp dpt:ssh ACCEPT     tcp  --  anywhere             anywhere             tcp dpt:ssh   We also ran the command sudo netstat -tulpn and this is what we get:  tcp        0      0 0.0.0.0:139             0.0.0.0:*               LISTEN      -                tcp        0      0 127.0.0.1:5939          0.0.0.0:*               LISTEN      -                tcp        0      0 0.0.0.0:21              0.0.0.0:*               LISTEN      -                tcp        0      0 127.0.1.1:53            0.0.0.0:*               LISTEN      -                tcp        0      0 127.0.0.1:631           0.0.0.0:*               LISTEN      -                tcp        0      0 0.0.0.0:445             0.0.0.0:*               LISTEN      -                tcp        0      0 127.0.0.1:3306          0.0.0.0:*               LISTEN      -                tcp6       0      0 :::139                  :::*                    LISTEN      -                tcp6       0      0 :::80                   :::*                    LISTEN      -                tcp6       0      0 ::1:631                 :::*                    LISTEN      -                tcp6       0      0 :::445                  :::*                    LISTEN      -            tcp        0      0 0.0.0.0:139             0.0.0.0:*               LISTEN      -                tcp        0      0 127.0.0.1:5939          0.0.0.0:*               LISTEN      -                tcp        0      0 0.0.0.0:21              0.0.0.0:*               LISTEN      -                tcp        0      0 127.0.1.1:53            0.0.0.0:*               LISTEN      -                tcp        0      0 127.0.0.1:631           0.0.0.0:*               LISTEN      -                tcp        0      0 0.0.0.0:445             0.0.0.0:*               LISTEN      -                tcp        0      0 127.0.0.1:3306          0.0.0.0:*               LISTEN      -                tcp6       0      0 :::139                  :::*                    LISTEN      -                tcp6       0      0 :::80                   :::*                    LISTEN      -                tcp6       0      0 ::1:631                 :::*                    LISTEN      -                tcp6       0      0 :::445                  :::*                    LISTEN      -     EDIT/UPDATE  The port 22 is now listening but we get the following error when trying to connect via ssh on a mac, localhost ssh works:  Ubuntu 14.04.2 LTS Permission denied (publickey).

I have an instance of an application running in the cloud on Amazon EC2 instance, and I need to connect it from my local Ubuntu. It works fine on one of local ubuntu and also laptop. I got message "Permission denied (publickey)" when trying to access SSH to EC2 on another local Ubuntu. It's so strange to me.  I'm thinking some sort of problems with security settings on the Amazon EC2 which has limited IPs access to one instance or certificate may need to regenerate.  Does anyone know a solution?