Some of my Asian friends soak their beef stew meat in water or even boil it to "get rid of the blood and the bad smell", as they say.  It is my understanding that the red juices in the meat is not blood but myoglobin. The cow has been drained for day, extracting all the blood from the capillaries, so there should not be any blood left.  Why do they believe that they are getting rid of bad smell and blood? Are there differences in the way animals are slaughtered in Asia compared to the West?
I've begun cooking Asian food in the past year or so, and in many Korean and Chinese beef recipes, I see instructions to soak beef in water. Just plain water, not salt water or anything. And every recipe seems to have a different  time - from 5 minutes to like, multiple hours.  I inquired about this and was given various reasons for this step, including "to remove the blood (because it is simply undesirable", "To remove the blood, because it gives the meat a bad taste" or "To soften the beef".  I'm wondering:   Does soaking meat in water really remove that much blood? How much of a flavor component is blood and why would it give it a bad taste (especially since i've never soaked beef before and I've like the taste just fine)? What is the action of solute-free water on a piece of beef immersed in it? Can it really tenderise it to any degree, or is there any osmosis occurring or other such physical/chemical action?
Convert DOS line endings to Linux line endings in Vim If I open files I created in Windows, the lines all end with ^M. How do I delete these characters all at once? Nonabelian semidirect products of order $pq$? I just constructed the semidirect product in Lang, and I'm trying to tie some facts together. From Ash's Algebra, I know that if $p\lt q$ are distinct primes, if $q\not\equiv 1\pmod{p}$, then any group $G$ of order $pq$ is abelian.  Is the converse true, that for any primes $p\lt q$, if $q\equiv 1\pmod{p}$ then there exists a nonabelian group of order $pq$?  One example I found online is that $\mathbb{Z}_3\ltimes \mathbb{Z}_7$ is nonabelian, and here $7\equiv 1\pmod{3}$. I was considering then semidirect products $\mathbb{Z}_p\ltimes\mathbb{Z}_q$ where $q\equiv 1\pmod{p}$ and some homomorphism $\phi\colon \mathbb{Z}_p\to\operatorname{Aut}(\mathbb{Z}_q)$ I calculate that  $$ (1,0)(0,1)=(1+0,\phi_0(0)+1)=(1,1) $$ and $$ (0,1)(1,0)=(0+1,\phi_{-1}(1)+0)=(1,\phi_{p-1}(1)). $$ Is it true somehow that $\phi_{p-1}(1)\neq 1$ in each case to show the group is nonabelian? I guess if it did this would imply $\phi_{p-1}$ is the trivial automorphism, so maybe there's something there? If not, is there a way to show $\mathbb{Z}_p\ltimes\mathbb{Z}_q$ is nonabelian in these cases in general? Thanks. How can I detect when an Exception's been thrown globally in Java? How can I detect when an Exception has been thrown anywhere in my application?  I'm try to auto-magically send myself an email whenever an exception is thrown anywhere in my Java Desktop Application.  I figure this way I can be more proactive.  I know I could just explicitly log and notify myself whenever an exception occurs, but I'd have to do it everywhere and I might(more likely will) miss a couple.  Any suggestions? $f(f(x)f(y))+f(x+y)=f(xy)$ Find all functions $f\colon \mathbb R\rightarrow \mathbb R$ such that for all reals $x$ and $y$:   $$f(f(x)f(y))+f(x+y)=f(xy).$$   It was six hours ago in IMO 2017 (problem 2).  I tried  the standard way: $x=0$, $x=y$, $x=1$,etc. but without any success.   Let $f(0)=a$. Hence, for all $x\in\mathbb R$ we have $f(a(f(x))+f(x)=a$. What is the rest?   Also we have $(x-1)(y-1)-1+x+y-1=xy-1$ and  $1-(1-x)(1-y)+1-x-y=1-xy$. Regex matches but shouldn't How to combine complex powers? My computer name in System Preferences &gt; Sharing is set to &quot;archos&quot;, but is showing as &quot;iphone&quot; on Terminal. It just started doing this after I loaded Xcode for doing iPhone development: Last login: Mon Nov  7 14:46:55 on ttys001 iphone:~ travis$   Any ideas what could be causing this? I wanted to create a WP plugin. So I requested and my request was approved by WordPress.org But I don't want to develop that plugin anymore. How can I delete the repository forever or request its deletion. Proof by induction that $ 169 \mid 3^{3n+3}-26n-27$ $ 169$ | $3^{3n+3}-26n-27$ ?  Fulfilled for $n=0$. Induction to $n+1$: An integer $x$ exists so that  $ 169x= 3^{3n+6}-26n-27-26$ $ 169x= 27*3^{3n+3}-26n-27-26$ $ 169x= 26*3^{3n+3}+3^{3n+3}-26n-27-26$  An integer $m$ exists so that   $ 169x= 26*3^{3n+3}+169m-26$ ($ 13x= 2*(3^{3n+3}-1)+13m$)  Now I'm stuck although it looks simple. Thanks for any input in advance. Projectile Motion - Arrow In a 2D game, I simply want to draw the trajectory of an arrow in flight. With the code below, the trajectory (the parabola) looks right, but the angle (or rotation) or the arrow isn't.   float g = -9.8f; float x = (launchVelocity * time); float y = (launchVelocity * time) + (0.5f * g * (float)Math.Pow(time, 2)); float angle = (float)Math.Tanh(y / x);   What am I missing? Thanks. Maximum number of edges in a simple graph? I found that the maximum number of edges in a simple graph is equal to $$\sum\limits_{i=1}^{n-1} i$$  Where $n =$ number of vertices.  For example in a simple graph with $6$ vertices, there can be at most $15$ edges.  If there were any more edges then $2$ edges would connect the same pair of vertices and thus would not be a simple graph.  Is this a known theorem? 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']}) Can I visit Chicago during a 5.5 hour layover in O'Hare? How to ask "If you have any problem then ask me" in polite manner Windows 7 unidentified network (or limited access) after hibernate My windows 7 network will show limited access or unidentified network after coming up from hibernation.  In the office I normally use LAN connection, I turn-off my wireless card (DELL Latitude has on/off switch for the wireless card). When I back at home I will turn on the wireless card, but it will take about 15 seconds to detect my home WIFI and then show limited access. I will have to restart the notebook and it will be able to connect to my WIFI and internet.  The problem will be solved if I restart the notebook, but that defeats the purpose of hibernation doesn't it?  I have tried uninstalling the wireless card driver but still does not solve it. I also tried updating my network card driver but windows says I am using the latest driver. On support.dell.com also showing I am using the latest driver. IE 11 Missing F12 Developer Tools the F12 Developer Tools windows is empty on my machine.    I've tried the following solutions, but nothing worked Why aren't people voting for questions? Some items in Terraria drop only very rarely from certain enemies. It's a pain having to farm so many enemies to try to get these rare items. Is there any way to make them drop more often? Unable to install "quickly" on Ubuntu GNOME 15.10 When running:  sudo apt-get install quickly   To install quickly I get this output:  Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package quickly   Why the error and how can I install it then? Let $f:G\to K$ be a surjective group homomorphism and $H$ be a subgroup of $G$ satisfying $N_G(H)=H$. Then $N_K(f(H))=f(H)$. I'm trying to prove or disprove it. perhaps, this proposition is true. But, how can we prove it? Edit: I thought it is true because WIKI said it is true without proof