How pass empty string if key not found in list of dict
Python idiom to return first item or None
where is `cd` located? SQL Server: Extract Table Meta-Data (description, fields and their data types) Ralink RT3290 bluetooth adapter does not work, but wifi works perfectly. number of prime ideals in algebraic integers Why is the Java plugin (JRE) disabled in Chrome? Why is the Java plugin (JRE) is disabled in Chrome? It is some security concern?  From official Java website:     Chrome no longer supports NPAPI (technology required for Java applets)   The Java plug-in for web browsers relies on the cross platform plugin architecture NPAPI,   which has been supported by all major web browsers for over a decade.   Google's Chrome version 45 (scheduled for release in September 2015) drops support   for NPAPI,   impacting plugins for Silverlight, Java, Facebook Video   and other similar NPAPI based plugins.   But anyone knows why? How it could be dangerous for Chrome user with latest version of Java JRE installed? Command-line completion from command history So, I've looked at history and at Ctrl+R, but they are not what I thought I knew. Is there a way that I can type in the beginning of a command, and cycle through the matches in my history with some bash shortcut?  # mysq(some shortcut key)   Gives me:  # mysqldump  --add-drop-table -e -q -n -C -u  (some shortcut key) #  mysql -u ben.dauphinee -p Let $a_1,a_2,a_3,\ldots$ be reals. Prove that if $\sum_{n=1}^{\infty} a_n^{2}$ converges, then so does $\sum_{n=1}^{\infty} \frac {a_n}{n}$.   For this I have shown the case for when $ a_n^{2} \le\frac {|a_n|}{n}$ $\Rightarrow$ $ |a_n|\le\frac {1}{n}$ $\Rightarrow$ $\frac {|a_n|}{n} \le \frac{1}{n^{2}}$ and we know that $\sum_{n=1}^{\infty} \frac {1}{n^{2}}$ converges and hence $\sum_{n=1}^{\infty}\frac {a_n}{n}$ converges by the comparison test. Now considering $ a_n^{2} \ge\frac {|a_n|}{n}$ $\Rightarrow$ $\frac {|a_n|}{n} \le a_n^{2}$ $\rightarrow$ combining the two cases for any n we have: $\frac {|a_n|}{n}\le\frac{1}{n^{2}}+a_n^{2}$ Hence using the comparion test again we know that $\sum_{n=1}^{\infty} a_n^{2}$ converges and $\sum_{n=1}^{\infty} \frac {1}{n^{2}}$ converges hence the sum converges so we can conclude that $\sum_{n=1}^{\infty} \frac {a_n}{n}$ is absoluetly convergent $\Rightarrow$ convergent.  Not to sure if this is correct, any help would be much appreciated, many thanks. Is it correct to sometimes capitalize words mid-sentence in computer user interfaces? I am studying the function and characteristic of an op-amp to build a line-following robot with the schematics below. However, in many tutorials, the way to differentiate an inverting and non-inverting op-amp is by looking at the connection to ground via the inverting or non-inverting terminal.  However, in the schematics, the op-amp is considered to have connections to ground, thus in this case, how do I differentiate it then?  I may have understood the whole concept wrongly. Pls help!    EDIT: Please ignore the switch as it may have been drawn wrongly by the supplier. I am trying to create a beamer animation using tikz, but I can't even get basic rotating of a tikz image working as desired.  I have a rectangle specified by  \draw[rounded corners,dotted] (-3.5,0) rectangle (-0.5,2);   I would like to rotate this rectangle about the point (-1,.5) (which is near the bottom right corner of the rectangle).  I've tried:  {\rotatebox[origin=c,x=-1,y=.5]{130}{             \draw[rounded corners,dotted] (-3.5,0) rectangle (-0.5,2);}}   But this produces an error.  If I just use the origin=c option, it compiles, but it rotates the rectangle about the point (0,0).  I've also tried it with just the x=-1,y=.5 (without the origin option), and it fails to compile.  I have searched the documentation, which is where I learned about the options x=xdim and y=ydim.  However, I can't find a single example demonstrating how these options should be used.  Any suggestions would be greatly appreciated.    Also, if there is a better command for rotating things that will be more suitable for use in a beamer animation, please let me know.  Thanks! After most recent kernel update (4.15.0-44-generic) my tablet freezes whenever plugged into docking station I performed the most recent kernel update on my Dell 5290 2-in-1 earlier today.  But moments after I plug it into its docking station, the screen flickers, blanks and freezes.  The only item left on the screen is the mouse pointer, and it is stuck.   If I leave the tablet not plugged in, it runs just fine.  It seems to be the docking station that triggers the freeze.  That said, I can log into the tablet via ssh even with the screen frozen.  So the system is still running.  But if I try to reboot the tablet via the reboot command, nothing appears to happen. sudo reboot -f will reboot the system, while sudo reboot will not.  Any ideas where I should start looking to identify this problem? Resizing an image in a post? Where to spend a night in the Mumbai airport My girlfriend and I have a layover at the Mumbai airport from 19:35 to 05:55 and we would like to sleep in a cheap place near to the airport (maximum 30 minutes away). Is there any cheap hotel near there? Or any cheap lounge where to sleep well? (flight at 05:55 is an intercontinental flight and we prefer to stay "fresh"). If not possible, is the airport a safe place to sleep? I have to maintain a large number of classic ASP pages, many of which have tabular data with no sort capabilities at all. Whatever order the original developer used in the database query is what you're stuck with.  I want to to tack on some basic sorting to a bunch of these pages, and I'm doing it all client side with javascript. I already have the basic script done to sort a given table on a given column in a given direction, and it works well as long as the table is limited by certain conventions we follow here.    What I want to do for the UI is just indicate sort direction with the caret character ( ^ ) and ... what?  Is there a special character that is the direct opposite of a caret?  The letter v won't quite cut it.  Alternatively, is there another character pairing I can use? I wrote a question about blocking certain characters in passwords. It became tremendously unpopular, and it seemed like everyone wanted to rain on my parade every day.  Eventually, I "got it," agreed completely with what people were saying to me, and just wanted to withdraw my question so that my reputation didn't slide even further downhill.  Unfortunately, the system is designed such that I can't withdraw my question or redeem myself. Instead, I just get daily reputation attacks. That's a terrible system, and it needs to be changed. sda1 -> Windows XP  sda2 -> Windows 7 sda3 -> Data Partition   I have created 4 primary partitions, I have 7xx GB left, how can I create one more partition? I've connected a USB to Serial bridge dongle, and running dmesg | grep tty outputted the following:  [    0.000000] console [tty0] enabled [603199.380677] usb 2-2: cp210x converter now attached to ttyUSB0   So now I'm trying to write to it as per  by running the following:  cat hello.txt &gt; /dev/ttyUSB0   and   sudo cat hello.txt &gt; /dev/ttyUSB0   But both result in the following error:  bash: /dev/ttyUSB0: Permission denied   What am I doing wrong?  Thanks I'm wondering if it's possible to hide a folder without renaming it with a dot on the Desktop.  Ubuntu 12.04  Thanks What is the optimal path between $2$ fixed points around an invisible obstructing wall? Every day you walk from point A to point B, which are $3$ miles apart. There is a $50$% chance each walk that there is an invisible wall somewhere strictly between the two points (never at A or B). The wall extends $1$ mile in each direction perpendicular to the line segment (direct path) between A and B, and its position can be at any random location between the two points. That is, it can be any distance between A and B such as $0.1$ miles away from A, $1.5$ miles away, $2.9$ miles away.... You don't know if the wall is present or where it is until you walk into it.  You must walk around the wall if present as there is no other way to circumvent it.  Assume the wall is negligible thickness (like a force field), all ground is perfectly flat, and the y coordinates at both A and B are $0$ (although I don't think the optimal path will change much if they weren't).  What strategy minimizes the average expected walk distance between A and B?  How do we know for certain this strategy yields the shortest average walking distance?  To get the $100$ bounty points, I would like a convincing argument from you as to why you feel your solution is optimal and cannot be beaten.  For those of you using computer simulation, anything reasonably close to optimal is a candidate for the bounty.   Can anyone beat the optimal solutions submitted so far?  There are still a few days to try.  Even a slight beat (if not due to roundoff error or some other error) would help prove previous solutions are non-optimal.  You can just use the table of $31$ points (x-y coordinates) and compute that path length and then if you can find better then I will accept that answer.  I think by Sunday night I may have to award the bounty otherwise it may get auto-awarded. Is it possible to insert arguments into functions when they're used like Function@ or //Function?