Example:  Tell her  and teller  Or cellar and sell her
When two phrases are pronounced alike but have different spelling and meaning, can we call them homophones?  e.g. "ice-cream" and "I scream", "nitrate" and "night rate", "that's tough" and "that stuff".  Or is there another term for them?  What linguistic phenomenon distiguishes these near homophones?  I've checked the putative duplicate at  but it isn't exactly what I'm asking here.
For example:  javac Foo.java Note: Foo.java uses unchecked or unsafe operations. Note: Recompile with -Xlint:unchecked for details. Label equations arbitrarily When I have equations, as in  \begin{equation} ... \end{equation}   Can I arbitrarily assign the numbers to the equations? Instead of the usual order (1), (2), (3), ..., I'd like something like (1), (2.1), (2.2), (2.3), (3.1), (3.2), (4), ... I have a list of requirements for a program, but I don't know what program meets these criteria. That's about general-purpose software, for example, not a programming IDE or statistical workbench, questions about which would certainly go to respective sites.  Is this question appropriate on Stack Overflow? Where should I ask about it? On Super User or elsewhere? The annihilator of a module is an ideal Let $R$ be a ring and let $M$ be an $R$-module. Define the annihilator of $M$ to be the following subset of $R$:  $Ann_R(M) =\{r\in R \mid rm = 0_M  \text{ for all } m\in M \}$  Prove that $Ann_R(M)$ is an ideal of $R$.  please help as much as you can a full answer is greatly appreciated   Thanks To debug a JACK/Pulseaudio issue, I want to understand when and why the pulseaudio daemon is started by systemd (on Fedora).  Using:  $ ps -o'pid,ppid,args' `pgrep pulse`   I see that the pulseaudio daemon is being started by systemd (pid=1)   PID  PPID COMMAND 2738     1 /usr/bin/pulseaudio --start   However, I was unable to find any unit-file on my system containing pulseaudio or even just pulse.  My specific questions are:  A) Is there a way to determine the systemd unit that caused the creation of a specific process (in my example output, process 2738, the PA daemon)?  B) Are there alternative approaches to find out which unit-dependency chain or other settings of systemd resulted in the invocation of /usr/bin/pulseaudio --start? Inset in Blender not coming out even Is there a way to convert an image to grayscale? Carry over long sequence of missing values with Postgres I have a table like this:  create table foo (foo_label text, foo_price int, foo_date date);  insert into foo (           values           ('aaa', 100,  '2017-01-01'),           ('aaa', NULL, '2017-02-01'),           ('aaa', NULL, '2017-03-01'),           ('aaa', NULL, '2017-04-01'),           ('aaa', 140,  '2017-05-01'),           ('aaa', NULL, '2017-06-01'),           ('aaa', 180,  '2017-07-01')         );   As you can see a few values on the foo_price column are missing.  What I need is that missing values get filled up with the "previous" available value in this way:   foo_label | fixed_foo_price | foo_date -----------+-----------------+------------  aaa       | 100             | 2017-01-01  aaa       | 100             | 2017-02-01  aaa       | 100             | 2017-03-01  aaa       | 100             | 2017-04-01  aaa       | 140             | 2017-05-01  aaa       | 140             | 2017-06-01  aaa       | 180             | 2017-07-01   My attempt:  select      foo_label,      (case when foo_price is null then previous_foo_price else foo_price end) as fixed_foo_price,     foo_date from (   select        foo_label,        lag(foo_price) OVER (PARTITION BY foo_label order by foo_date::date) as previous_foo_price,        foo_price,       foo_date       from foo ) T;   As you can see from here:    It doesn't fill completely the '100' series.  Any idea how can I get the wanted result? ASP.NET Stress Testing Is there a way to test an application where you simulate a hundred different clients connecting to a IIS server and asking the same data? At the customer where our project is running they have 400 computers and they often do stress tests with all computers. I on the other hand have only got my laptop... (and a development server).  (In my case the data is asked through a WebORB Gateway). Avoiding the second leg of an international flight - different rates for a return ticket? Possible Duplicate:          I am in the process of booking a flight from LAX - ZUR. I found a flight for approx. 1100 USD. However, if I book that flight and then continue, after a 5 hour layover, onward to SVO, The flight is approx. half of the initial price, and the first leg of the second flight is the exact same flight as the first booking. Assuming I travel light and do not check any baggage, are there any potential issues with this? Seems like a hell of a way to save a good chunk of change. Are there recommendations or pitfalls for playing an archer cleric? In my 4E game, a player is going to try an elven cleric with a longbow (and a mace, just in case). She chose mostly ranged powers. Are there any caveats to playing such a character, or any builds that I could recommend for her? More Efficient Spatial join in Python without QGIS, ArcGIS, PostGIS, etc I'm attempting to do a spatial join much like the example here: . However, that approach seems really inefficient / slow. Even running this with a modest 250 points takes almost 2 minutes and it fails entirely on shapefiles with > 1,000 points. Is there a better approach? I'd like to do this entirely in Python without using ArcGIS, QGIS, etc.  I'd also be interested to know if it's possible to SUM attributes (i.e. population) of all the points that fall within a polygon and join that quantity to the polygon shapefile.       Here is the code I'm trying to convert. I get an error on line 9:  poly['properties']['score'] += point['properties']['score']   which says:     TypeError: unsupported operand type(s) for +=: 'NoneType' and 'float'.    If I replace the "+=" with "=" it runs fine but that doesn't sum the fields. I've also tried making these as integers but that fails as well.  with fiona.open(poly_shp, 'r') as n:    with fiona.open(point_shp,'r') as s:     outSchema = {'geometry': 'Polygon','properties':{'region':'str','score':'float'}}     with fiona.open (out_shp, 'w', 'ESRI Shapefile', outSchema, crs) as output:         for point in s:             for poly in n:                 if shape(point['geometry']).within(shape(poly['geometry'])):                       poly['properties']['score']) += point['properties']['score'])                     output.write({                         'properties':{                             'region':poly['properties']['NAME'],                             'score':poly['properties']['score']},                         'geometry':poly['geometry']}) It seems that containing lava in solid glass, stone and iron blocks may not be sufficient to prevent wool from burning, even if the lava is completely encased.         After some delay, it seems that fire will jump onto the wool above the iron.   Are solid blocks more effective than airspace, or not? If so, Does it matter whether the corner block is filled in? What are the exact rules on distance that I need, and how can I prevent flammable blocks from being eliminated by nearby lava? Bonus: Does a flowing lava block behave differently than a lava source block when it comes to fire creation? Compiling LaTeX document empties .bbl file I'm trying out biblatex for the document I'm compiling, using the biber backend on my miktex distribution. Everything, including biber, should be up to date, assuming the MiKTeX repository currently holds the latest versions of everything.  This is what the biblatex documentation (p. 101) says about how often I have to run biber to update my .bbl file:     Whenever a reference to a work which has not been cited before is   added, this procedure must be repeated. This is also the case if the   last reference to a work which has been cited before is removed   because some citation labels may change in this case.   So if I make changes to my document (which is a very common activity in the process of writing a document), but leave the citations unchanged, I should not have to re-run biber before compiling the changes. However, every time I compile my document, regardless of the compiler or documentclass, the .bbl file is emptied. Consequently, the next time I compile the document without running biber, the bibliography is removed (seeing as the .bbl file contains nothing), and all my citations are broken. For this reason, I have to run biber before every time I compile the document, which largely counters the benefit of externalizing the bibliography in the first place.  How can I make the compilers stop overwriting my .bbl file and make everything behave as described in the biblatex manual?  Upon investigating the contents of the auxiliary files, I found that the .bbl file (after running biber, before compiling) begins with the following lines:  % $ biblatex auxiliary file $ % $ biblatex bbl format version 2.3 $   Does the biblatex version 2.8 still mark the .bbl files as version 2.3? If not, could this be the problem? And if so, why does my 2.8 version of biblatex (partly) behave as version 2.3?  Any help solving this problem would be much appreciated. Stack Exchange- Area 51 Android App I am trying to use Stack Exchange Andoid App to use my accounts in Stack Overflow &amp; Area 51.   For the Area 51, there is only Area 51 Discussion. Even Area 51 Discussion isn't working in the App!   VERSION 1.0.51  When adding this site, it's showing the correct full name as in this screen-shot:     However, when I pin this site to my fav sites in Stack Exchange, it is showing: Unknown Site. When clicking it, it shows black screen then just quit the App!  Here is the screen-shot:       Is the site not yet capable with Android? or is it a bug in the App itself?  PS: this question isn't duplicate:   In the previous versions of the App, the site was opening but with Unknown Site name. However, in this version, it quits the app when pressing the area site! It isn't opening at all! This question is also to track this bug in the App. As it's about the site name issue &amp; the content as well. Do numbers exist independently from observers? How do I  prevent .xsession-errors from eating disk space? Suppose that $\hat{x}$ is the least squares solution of $Ax = b$.  That is, $\min{|r|}, r = Ax - b$ with respect to $x$.  Is $\hat{x}$ also the least squares solution of $JAx = Jb$?  I suspect so, but I'm not sure how to prove it.  If $J$ is invertible, it's easy enough to prove as you can just cancel it out from both sides.  But what if it's not invertible? Decoupling caps, PCB layout I guess I've been somewhat ignorant when it comes to the finer details of pcb layout. Lately I've read a couple of books that try their best to lead me on the straight and narrow. Here is a couple of examples of a recent board of mine, and I have highlighted three of the decoupling caps. The MCU is a LQFP100 package and the caps are 100nF in 0402 packages. The vias connect to ground and power plane.     The top cap (C19) is placed according to best practices (as I understand them). The other two are not. I haven't noticed any problems. But then again the board has never been outside the lab.  I guess my question is: How big a deal is this? As long as the tracks are short, does it matter?  The Vref pins (reference voltage for the ADC) also have a 100nF cap across them. Vref+ comes from an onboard TL431 shunt regulator. Vref- goes to ground. Do they require special treatment like shielding or local ground?    EDIT    Thanks for great suggestions! My approach has always been to rely on an unbroken ground plane. A ground plane will have the lowest possible impedance, but this approach may be too simplistic for higher frequency signals. I've made a quick stab at adding local ground and local power under the MCU (The part is an NXP LPC1768 running at 100MHz). The yellow bits are the decoupling caps. I'll look into paralleling caps. The local ground and power are connected to the GND layer and the 3V3 layer where indicated.  The local ground and power are made with polygons (pour). It's going to be a major rerouting job to minimize the length of the "tracks". This technique will limit how many signal tracks can be routed under and across the package.  Is this an acceptable approach? I have encountered this question while tring to figure out why every sequential space $X$, is a quotient spaces of a metric space. If I understand correctly, given a sequential space, every sequence (including it's limit) can be identified with the space $Y=\{0\} \cup \{\frac1{n+1}|n \in N\}$. So The space $X$ can viewed as a quotient space of $\bigoplus_{(x_n) \in C} \{(x_n) \} \times Y$ where $C$ is the set of all converges sequences in $X$. My question is, How can I show that this space is metrizable?  Thank you! Shir