I am new to ArcGIS.  How do I easily reproduce a spatial diagram such the one attached (Picture); from shapefiles on ArcGIS.    I very often have to reproduce networks on Powerpoint at different scale without loosing details such as number of lines from A to B. Exporting images directly from ArcGIS at certain scales makes those details difficult to notice, as lines close to each other tend to look like one.  Is there a way to export lines or graphics without losing the details, or is there a way to at least generate graphics without having lines overlapping?  (Note that in reality there only is about 30meters between the parallel lines, and that the distance between the red dot and the green square is 20km - I need to keep the relative location of point and the relative route of the lines, but at the same time represent all the lines although on the ground they are very close to one another )
Some common problems with displaying routes created from street data, such as bus routes, include:   Routes may overlap themselves, such as when a route takes the same road in opposite directions Routes may overlap other routes that take the same street. Routes are often overly detailed, or "noisy", owing to their derivation from street data. Indicating a route's direction unambiguously without overloading it with arrows can be a challenge.   What are some techniques for dealing with these issues in order to create a practical and usable route map, such as this ? Do you know of any such public transport maps that were produced by automatic techniques rather than manual illustration/digitization?  Specifically I am using ArcGIS 10, but solutions involving other software are welcome as well.  One technique I have had some success with for dealing with 1) is using ArcMap's  with a negative offset -- assuming the lines are oriented in the direction of travel, this will offset the lines such that the right and left-hand sides are distinct and oriented as you would expect (at least for  countries, for left-hand traffic countries one would use a positive offset). However the result tends to be a bit wonky around turns, interchanges and and U-turns, and is inflexible when dealing with multiple routes.  Another possibility that I am not very familiar with but which seems promising is  -- however, I have not had much luck in finding examples of using representations for transportation maps and whether it might fit the bill.
Let Y(1), Y(2), Y(3), Y(4), Y(5) denote the order statistics of a random sample of size 5 from a distribution having p.d.f. Help me to solve this problem please..  Let $Y_{(1)}, Y_{(2)}, Y_{(3)}, Y_{(4)}, Y_{(5)}$ denote the order statistics of a random sample of size 5 from a distribution having p.d.f. $f(y) = e^{(-y)}, 0 &lt; y &lt; \infty$, zero elsewhere. Show that $Z_1 = Y_{(2)}$ and $Z_2 = Y_{(4)} − Y_{(2)}$  are independent. Hint: First find the joint p.d.f. of $Y_{(2)}$  and  $Y_{(4)}$. How to fix slow wireless on machines with Intel wireless cards? I have looked through all the previous questions but turning power management off for the Wi-Fi card didn't work. This problem seems to be with the Lenovo Thinkpads. I switched to Ubuntu 11.10 from Windows 7 3 days ago so I'm new to the operating system. Defining scalable "white curly brackets" {| and |} (⦃ and ⦄) I would like to construct what Unicode calls "white curly brackets" that are in addition scalable. They look like ⦃ (≈{|) and ⦄ (≈|}) and have Unicode codepoints U+2983 and U+2984.  unicode-math has them as \lBrace and \rBrace, but (1) I don't presently use XeTeX or LuaTeX and (2) their design (shown in  on pages 3-4) is not to my liking: the brace part is too fat for my taste, and I would like the vertical bar to not leave any protrusions. I am trying to have them visually match the parentheses \llparenthesis, \rrparenthesis, \llbracket, and \rrbracket from stmaryrd.  Right now I am using a makeshift definition, which is sufficient for now, but the symbols don't scale (in general or with \left/\right). Here is sample code:  \documentclass{article} \usepackage{amsmath} \usepackage[only,llbracket,rrbracket,llparenthesis,rrparenthesis]{stmaryrd} % for comparison with 4 similar parenthesis symbols \usepackage{accsupp} % for ensuring the right Unicode codepoint upon pasting  \newcommand*{\llbrace}{%   \BeginAccSupp{method=hex,unicode,ActualText=2983}%     \textnormal{\usefont{OMS}{lmr}{m}{n}\char102}%     \mathchoice{\mkern-4.05mu}{\mkern-4.05mu}{\mkern-4.3mu}{\mkern-4.8mu}%     \textnormal{\usefont{OMS}{lmr}{m}{n}\char106}%   \EndAccSupp{}% } \newcommand*{\rrbrace}{%   \BeginAccSupp{method=hex,unicode,ActualText=2984}%     \textnormal{\usefont{OMS}{lmr}{m}{n}\char106}%     \mathchoice{\mkern-4.05mu}{\mkern-4.05mu}{\mkern-4.3mu}{\mkern-4.8mu}%     \textnormal{\usefont{OMS}{lmr}{m}{n}\char103}%   \EndAccSupp{}% }   \begin{document}  \noindent ok: \(\displaystyle\llbrace abc \rrbrace\) \(\textstyle\llbrace abc \rrbrace\) \(\scriptstyle\llbrace abc \rrbrace\) \(\scriptscriptstyle\llbrace abc \rrbrace\)  \noindent ok: \(\displaystyle \llbrace \frac{a}{b} \rrbrace\) \(\textstyle\llbrace \frac{a}{b} \rrbrace\) \(\scriptstyle\llbrace \frac{a}{b} \rrbrace\) \(\scriptscriptstyle\llbrace \frac{a}{b} \rrbrace\)  \noindent incorrectly scaled (\verb|\scriptsize|): {\scriptsize\(\llbrace abc \rrbrace\)} (large magnification required)  \noindent incorrectly scaled (\verb|\tiny|): {\tiny\(\llbrace abc \rrbrace\)}  \noindent \verb|\left| and \verb|\right| not possible before \verb|\llbrace| and \verb|\rrbrace|: \\ \indent \(\llbrace \left\llbracket\left\{\left[(a) \cdot bc^{2^3}\right]^4\right\}^5\right\rrbracket \rrbrace\) % Note: This is also not possible with \llparenthesis and \rrparenthesis from stmaryrd.  \noindent for comparison: \(\llparenthesis x \rrparenthesis, \llbracket x \rrbracket, \llbrace x \rrbrace; (x), [x], \{x\}\)  \end{document}   Lines 1 and 2 look just right with the present setup. Lines 3 and 4 demonstrate that my definitions don't scale. Lines 5a/b gives an example of where I would like to be able to use \left and \right. Line 6 juxtaposes different types of parentheses for visual comparison.  Is there an easy way to scale the glyphs I have constructed myself? Or is designing new glyphs the only way? While the vertical part of my glyphs doesn't leave any protrusions, the "brace part being too fat" part of my problem isn't being addressed by my code. With this in mind: I recognize that it might not be that easy to make the brace part of the glyph thinner (though if you can, more power to you), but I think that any solution that addresses the scaling problem for any manually constructed glyph cluster will be a valuable contribution to the community.    For a slightly different setup (original example code) with  \RequirePackage{fix-cm} \documentclass[12pt]{memoir} \usepackage{fixltx2e}[2006/09/13] \usepackage{amsmath} \usepackage{txfonts} \usepackage[only,llbracket,rrbracket,llparenthesis,rrparenthesis]{stmaryrd} \usepackage{accsupp}   in the preamble, one needs \mkern-5.7mu in the fourth argument to \mathchoice for "correct" scaling. To see what goes wrong in that case, it's best to include a line such as discontinuous small symbols in a footnote\footnote{\(\scriptscriptstyle\llbrace \frac{a}{b} \rrbrace\)}. This might help a potential answerer test things out. Can command substitution be nested in variable substitution? How do I update Ubuntu manually? I wanted to update Ubuntu manually, because I used CDMA USB modem and connected using wvdial, but it won't able to update Ubuntu via Update Manager, because my Ubuntu won't showing "Connected" message via network-manager.  Can I update Ubuntu manually? Am I should download separate files, or use terminal instead? This is basically the same as  for the Android app, except I am making the request for the iOS app.  When viewing a question in the iOS app, I'd like to see the total number of views for the question. Find the limit if it exists of $S_{n+1} = \frac{1}{2}(S_n +\frac{A}{S_n})$ Suppose that $S_0$ and A are positive numbers, let $$S_{n+1} = \frac{1}{2}\left(S_n +\frac{A}{S_n}\right)$$ with $n \geq 0 $.      (a)Show that $S_{n+1} \geq \sqrt{A} $ if $n \geq 0$       (b)Show that $S_{n+1} \leq S_n $ , if $n \geq 1$      (c) Show that $s= \lim\limits_{n \rightarrow \infty} S_n$ exists      (d) find s   (a) Show that $S_{n+1} \geq \sqrt{A} $ if $n \geq 0$  Given $$P_n:  S_{n+1} = \frac{1}{2}\left(S_n +\frac{A}{S_n}\right) \geq \sqrt{A}$$  $$P_0: S_{1} = \frac{1}{2}\left(S_0 +\frac{A}{S_0}\right) \geq \sqrt{A}  $$  We assume that $P_n$ is true  $$P_{n+1}: S_{n+2}= \frac{1}{2}\left(S_{n+1} +\frac{A}{S_{n+1}}\right)$$ by assumption $$S_{n+2}= \frac{1}{2}\left(S_{n+1}\left(1 +\frac{A}{(S_{n+1})^2}\right)\right) \geq \frac{1}{2}\left(\sqrt{A}\left(1 +\frac{A}{(\sqrt{A})^2}\right)\right)$$ $$ S_{n+2}= \frac{1}{2}\left(S_{n+1} +\frac{A}{S_{n+1}}\right) \geq \sqrt{A}  $$  It follows that $S_{n+1} \geq \sqrt{A} $    (b) Show that $S_{n+1} \leq S_n $ , if $n \geq 1$  $$S_{n+1} \leq S_n$$ $$\frac{1}{2}\left(S_n +\frac{A}{S_n}\right) \leq S_n $$ Dividing by $S_n$ $$\frac{1}{2}\left(1 +\frac{A}{S_n^2}\right) \leq 1 $$ $$\frac{A}{2S_n^2} \leq \frac{1}{2}$$ $$A \leq S_n^2$$ $$S_n \geq \sqrt{A}$$ As  $S_{n+1} \leq S_n$ yields a true statement, it follows $S_{n+1} \leq S_n$ is true.    (c) Show that $s= \lim\limits_{n \rightarrow \infty} S_n$ exists  Since $S_{n+1} \leq S_n$, the sequence is non-increasing,   using the non-increasing theorem stating that      if $\{S_n\}$ is non-increasing then $$\lim\limits_{n \rightarrow &gt; \infty} S_n = \inf\{S_n\} $$     (d) find s    Is the argumentation in (a) and (b) appropriate? Also, I have to admit I m getting less confident in my argumentation (c) and (d). How to proceed in (c) and (d)?  Much appreciated for your input or help. How to install Wi-Fi driver for Realtek RTL8821CE on Ubuntu 18.04? I'm trying to install drivers for my Wifi on my HP All-in-one desktop. I've been told to show the output of the command "sudo lshw -C network" so here it is:  *-network description: Ethernet interface product: RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller vendor: Realtek Semiconductor Co., Ltd physical id: 0 bus info: pci@0000:01:00.0 logical name: enp1s0 version: 15 serial: 48:ba:4e:5c:06:5f size: 100Mbit/s capacity: 1Gbit/s width: 64 bits clock: 33MHz capabilities: pm msi pciexpress msix bus_master cap_list ethernet physical tp mii 10bt 10bt-fd 100bt 100bt-fd 1000bt 1000bt-fd autonegotiation configuration: autonegotiation=on broadcast=yes driver=r8169 driverversion=2.3LK-NAPI duplex=full firmware=rtl8168h-2_0.0.2 02/26/15 ip=192.168.1.21 latency=0 link=yes multicast=yes port=MII speed=100Mbit/s resources: ire:31 import:e000(size=256) memory: fea04000-fea04fff memory:fea00000-fea03fff  *-network UNCLAIMED description: Network controller product: Realtek Semiconductor Co., Ltd. vendor: Realtek Semiconductor Co., Ltd. physical id: 0 bus info: pci@0000:02:00.0 version: 00 width: 64 bits clock: 33MHz capabilities: pm msi pciexpress cap_list configuration: latency=0 resources: import:d000(size=256) memory:fe900000-fe90ffff   Output from "lspci -nnk | grep -A2 0280":  02:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8821CE 802.11ac PCIe Wireless Network Adapter [10ec:c821] Subsystem: Hewlett-Packard Company RTL8821CE 802.11ac PCIe Wireless Network Adapter [103c:831a] 03:00.0 Unassigned class [ff00]: Realtek Semiconductor Co., Ltd. RTS5229 PCI Express Card Reader [10ec:5229] (rev 01) Let $S$ be a finite collection of real numbers (not necessarily distinct). If any element of $S$ is removed then the remaining real numbers can be divided into two collections with same size and same sum ; then is it true that all elements of $S$ are equal ?  (I know the result is true if the &quot;reals&quot; are replaced by &quot;integers&quot;.) If a function can only be defined implicitly does it have to be multivalued? What's in "standard system utilities" in the server install? My googlefu has failed me. What packages are part of the "standard system utilities" that is preselected during install?  TIA! (-: mathtools: \dddot cause the term to rise I have the following file:  abcde kwakwa &lt;0x1A&gt; line3 linllll   Where &lt;0x1A&gt; represents a byte with the hex value of 0x1A. When attempting to read this file in Python as:  for line in open('t.txt'):     print line,   It only reads the first two lines, and exits the loop.  The solution seems to be to open the file in binary (or universal newline mode) - 'rb' or 'rU'. Can you explain this behavior ? Does the force of kinetic friction increase with the relative speed of the objects involved? If not, why not? My request is simple: Many times, there will be a question where some people feel like it should be closed. At the same time, I'll feel like it's a perfectly legit question, and it should therefore NOT be closed. Right now, I have to wait till it gets enough close votes (which it always does for some reason, as soon as 1 or 2 people vote to close, e/o else decides to vote as well) and then vote to re-open. How about, as soon as there's one vote to close, there should be an option to counter the close vote, something like "vote not to close" or whatever. This would then bring the "Vote to close" number down by one. Only when the vote to close outnumbers the vote not to close by 5, that's when a question is indeed closed. Any thoughts? How can I stop the symbolic x coords to be plotted twice? Let   $$f(x) = (x-1)(x-2)(x-3)(x-4)(x-5),\quad -\infty&lt; x&lt;\infty.$$   The number of distinct roots of equation   $$\frac{d}{dx}f(x) = 0$$   is exactly ?     The only method that I know is to multiply and then find the derivative of function then apply Sturm's theorem but it seems vague when you have to solve the question in 3 to 5 minutes . So you are requested to suggest a plausible alternative approach. I installed the latest pgAdmin 4 (v2.1) but I found out that (), for the moment, the only way to establish a connection through an SSH tunneling is using another outside process, an  says:  I setup a tunnel as follows: ssh -f dpage(at)hostname(dot)enterprisedb(dot)com -L 5999: hostname.enterprisedb.com:5432 -N  (...) I was running on Mac, but the same procedure should work on Linux. On Windows, there's a tunnelling app in Putty iirc, but I don't know how to use it offhand.  I have found a simple . The connection is established but it seems, when I try to connect through pgAdmin it fails or is refused (using 127.0.0.1:3306 or 127.0.0.1:5432 as the tunnel's destination). Why? How to put terms in lexicographic order? I converted a raster image to vector in Illustrator CS6 using Image Trace then the Expand option, though when I save as an svg the image looks embossed. I suspect it's due to the layer background being white and the paths not lining up, but I'm unsure how to fix it or prove that theory without manually having to adjust every path.   This is how it looks in Illustrator before I export it:    The image looks like this when saved/exported with art optimized option: