Slow wireless with rt2800pci
Ubuntu 14.04 slow wireless connection
Poincaré inequality for a subspace of $H^1(\Omega)$ The following is the well known  for $H_0^1(\Omega)$:       Suppose that $\Omega$ is an open set in $\mathbb{R}^n$ that is bounded. Then there is a constant $C$ such that   $$ \int_\Omega u^2\ dx\leq C\int_\Omega|Du|^2\ dx\quad \textrm{ for all   }\ \ \color{red}{u\in H_0^1(\Omega)}. $$   Here is my questions:    Can the condition $u\in H_0^1(\Omega)$ be relaxed so that the inequality is still true? More precisely, suppose $H$ is a subspace of $H^1(\Omega)$ such that for any $u\in H$, $u|_\Gamma=0$, where $\Gamma$ is a ([Added:]nonempty) closed proper subset of the boundary $\partial\Omega$ and the idenity is in the sense of trace. In other words, $u$ is only zero on a part of the boundary. Do we still have the Poincaré ineqaulity in $H$?    [Added:] This question is motivated by the following exercise Detection of the Electric Charge of a Black Hole By the "No Hair Theorem", three quantities "define" a black hole; Mass, Angular Momentum, and Charge. The first is easy enough to determine, look at the radius of the event horizon and you can use the Schwarzschild formula to compute the mass. Angular Momentum can be found using the cool little ergosphere Penrose "discovered". However, I don't know how to determine the charge of the black hole.   How can an electromagnetic field escape the event horizon of a Reissner-Nordström black hole? Is there any experiment we could theoretically do to a black hole to determine its charge? Why does the One Ring make the wearer's clothes invisible? The One Ring turns invisible the person wearing it.  Is there an explanation for how it does this? It seems that direct contact with the skin activates the Ring's invisibility effects;  why would it also affect the person's clothing, weapons, etc, as well? The Invisible Man's clothing is visible, so why aren't Frodo's clothes visible?  The Hobbit makes it clear that Bilbo's clothing is invisible, since Smaug doesn't see it.  Is there any possiblity that this varies from character to character? Show that the square of any prime number is the Factof of some integer Processing time/speed for Mosaic to New Raster I have a question on speeding up “Mosaic to New Raster” or finding an alternative.  After completing a suitability analysis we are trying to define movement corridors.  We used a modified CircuitScape that left 4 folders, each containing 1080 raster tiles across our study area.  We now need combine all 1080 rasters in each folder then combine these 4 combined rasters into a final raster which will be analyzed for paths.  I tried a python script that just wouldn’t work so I went on to Model Builder.  It iterates through the grids in the folder, collects the values (raster names), then mosaics all to a new raster.  It has been running for 5 days now and the results window indicates it is working.  I’m hoping it will conclude in the next day or 2.  But, we still have 3 more folders, each with 1080 rasters, that need to be mosaicked.  So….is there a way to speed up Mosaic to New Raster or is there an alternative I could use to produce the final grid?    The cell size is 270 meters, 540 x 540 columns and rows, 1 band, 32 bit floating. Why is a ConcurrentModificationException thrown and how to debug it I am using a Collection (a HashMap used indirectly by the JPA, it so happens), but apparently randomly the code throws a ConcurrentModificationException. What is causing it and how do I fix this problem? By using some synchronization, perhaps?  Here is the full stack-trace:  Exception in thread "pool-1-thread-1" java.util.ConcurrentModificationException         at java.util.HashMap$HashIterator.nextEntry(Unknown Source)         at java.util.HashMap$ValueIterator.next(Unknown Source)         at org.hibernate.collection.AbstractPersistentCollection$IteratorProxy.next(AbstractPersistentCollection.java:555)         at org.hibernate.engine.Cascade.cascadeCollectionElements(Cascade.java:296)         at org.hibernate.engine.Cascade.cascadeCollection(Cascade.java:242)         at org.hibernate.engine.Cascade.cascadeAssociation(Cascade.java:219)         at org.hibernate.engine.Cascade.cascadeProperty(Cascade.java:169)         at org.hibernate.engine.Cascade.cascade(Cascade.java:130) There are several unknown numbers in mathematics, such as optimal constants in some inequalities. Often it is enough to some estimates for these numbers from above and below, but finding the exact values is also interesting. There are situations where such unknown numbers are necessarily natural numbers, for example in Ramsey theory. For example, we know that there is a smallest integer $n$ such that any graph with $n$ vertices contains a complete or an independent subgraph of 10 vertices, but we don't know the exact value of $n$.  What kinds of unknown small (less than 100, say) integers are there? What are the smallest unknown constants which are known to be integers? Or, more rigorously, what is the smallest upper bound for an unknown but definable number that is known to be an integer?  I know that asking for the smallest unknown integer is ill-defined since we do not know the exact values. The more rigorous version of the question is well-posed, but I do not want to keep anyone from offering interesting examples even if they are clearly not going to win the race for the lowest upper bound.  An answer should contain a definition of an integer quantity (or a family of them) and known lower and upper bounds (both of which should be integers, not infinite). Conjectures about the actual value are also welcome. I have given one example below to give an idea of what I'm looking for. I would like to configure my Ubuntu 12.04 server to synchronize its clock with a specific NTP server. Where to set this up? Is it possible to save a Diablo 3 chat session or save some in game notes Which set is unwell-orderable? In textbook it says that every well-orderable set is equipotent to an initial ordinal number. However, of course unwell-orderable cannot equipotent to any ordinal number, but is there any set is unwell-orderable? By axiom of regularity we know that every set is well-founded, so can we conclude that every set is well-orderable? If not, which set is unwell-orderable? Evaluate the integral $\int_0^\infty \frac{dx}{\sqrt{(x^3+a^3)(x^3+b^3)}}$ Born's Rule, What is the Reason? How to compare the strings using < (Greater than symbol) Below is my input file:  PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:16:46.523.177, 2 PS Sensor Value = -5.501000 , Min = -5.583000 , Max = -5.319000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:16:46.523.210, 3 PS Sensor Value = 15.996000 , Min = 15.814000 , Max = 16.078000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:16:46.523.231, 4 PS Sensor Value = -16.505000 , Min = -16.587000 , Max = -16.323000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:16:46.523.263, 5 PS Sensor Value = 6.509000 , Min = 6.327000 , Max = 6.591000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:16:46.523.302, 6 PS Sensor Value = 4.002000 , Min = 3.820000 , Max = 4.084000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:17:46.481.557, 1 PS Sensor Value = 6.199000 , Min = 6.017000 , Max = 6.281000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:17:46.518.691, 2 PS Sensor Value = -5.503000 , Min = -5.585000 , Max = -5.321000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:17:46.523.156, 3 PS Sensor Value = 15.996000 , Min = 15.814000 , Max = 16.078000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:17:46.523.195, 4 PS Sensor Value = -16.505000 , Min = -16.587000 , Max = -16.323000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:17:46.523.221, 5 PS Sensor Value = 6.509000 , Min = 6.327000 , Max = 6.591000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:17:46.523.240, 6 PS Sensor Value = 4.002000 , Min = 3.820000 , Max = 4.084000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:18:46.480.644, 1 PS Sensor Value = 6.199000 , Min = 6.017000 , Max = 6.281000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:18:46.522.615, 2 PS Sensor Value = -5.501000 , Min = -5.583000 , Max = -5.319000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:18:46.522.729, 3 PS Sensor Value = 15.996000 , Min = 15.814000 , Max = 16.078000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:18:46.522.765, 4 PS Sensor Value = -16.505000 , Min = -16.587000 , Max = -16.323000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:18:46.522.788, 5 PS Sensor Value = 6.509000 , Min = 6.327000 , Max = 6.591000 PA43410-2,1,3,/vobs/atlas-idc/src/utils/logger/IDCLogger/IDC.cpp,48,19:18:46.522.810, 6 PS Sensor Value = 4.002000 , Min = 3.820000 , Max = 4.084000   I need to compare the PS Sensor Value, Min and Max value. (Min greater than PS Sensor greater than Max)   I'm expecting the output like below and here I should have only the normal lines.  What is normal lines? :  If Min value greater than PS Sensor value &amp;&amp; PS Sensor value  is greater than Max value then the line is normal lines and that should removed.        Expected Output:                                                                                                                                    PA43410-2  PS Sensor Value = 6.509000 , Min = 6.327000 , Max = 6.591000 PA43410-2 PS Sensor Value = 6.199000 , Min = 6.017000 , Max = 6.281000  Eg:     If   Min &lt; PS sensor value &lt; Max,    // Don’t care the normal  lines.          Throw this line away.    Else           Pull this line to consolidated new file. //Only focus on abnormal lines. Does an adjective or longer modifier apply to both nouns when they are joined with 'and' [or 'or']? Can you grab the blue shirts and socks?   Is the above sentence stating that both the shirts and the socks are blue? Or only the shirts?  At this stage, I am leaning towards the earlier (only the shirts) — though writing "Can you grab the blue shirts and blue socks?" seems redundant. Keyboard shortcut for switching between different keyboard layouts in Ubuntu Mate Is there a pre-assigned keyboard shortcut for switching between different keyboard layouts in Ubuntu Mate? Extract substring in Bash Please stop using SoftwareEngineering.SE as your toilet bowl Stack Overflow users have been using the "off topic - belongs on SoftwareEngineering.SE" close reason as an alternative to all the other close reasons. It'd be helpful if people actually read the FAQ and the six  before voting to migrate questions like:   , no redeeming value to favorite lists that become argumentative , "help my exact situation" questions are too localized , fails 5 out of the 6 guidelines , fails 4 out of 6 , too localized and too vague , too broad   Absent a reversal of the Stack Overflow community from viewing SoftwareEngineering.SE as the Stack Overflow cesspool, can the "off topic - belongs on SoftwareEngineering.SE" close reason be removed in favor of manual migration by moderators who can actually spend the 10 seconds to determine if the question should be closed outright first?    To say that SoftwareEngineering.SE is such a nebulous place and nobody knows what its scope is as the reason why crappy questions keep getting migrated there is to miss the point. Good questions are good questions on all of the sites, and questions that are too vague, that are too argumentative, too localized, and too broad are universal close reasons. There is no special dispensation for SoftwareEngineering.SE to have bad questions, even if you personally think the questions on there suck.  Even the six subjective guidelines for subjective questions are universal guidelines: they affect all sites. So even if you had no idea what the consequences of using the "off topic - belongs on SoftwareEngineering.SE" close reason were, there are still all of the other close reasons for which bad questions, like the ones above, can be closed. While reviewing "First Posts" on Stack Overflow, I often come across new users posting comments as answers. It seems (at least to me) they are not doing this because they are unaware of how Stack Overflow works but because they can't comment on any question they are forced to put it as answer.  I have found duplicate questions for my request like:   ,  and    but the best explanation I have found is an  to .     I think the main reason this isn't supported is there's no way to   downvote comments, which would make them attractive to spammers. If   somebody comments on the top answer in a question the only way to get   rid of it is for six people to flag it. Comment flags don't show up on   10k tools, so it needs to be six people that happen to stumble across   the spam comment, or a moderator that checks the list manually. People   can comment every 15 seconds, so that can get out of hand pretty   quickly. Comments also aren't listed on the user's profile page, so   it's hard to see at a glance if a user has been spamming   So I am suggesting allowing new users (with less than 50 reputation points) to comment only 5 times every day or only 25 times times until they reach 50 reputation points or any other variation of it. How do I revert a Git repository to a previous commit? Live CD asks for a username and password