I am an experienced PC user, able to follow a clear recipe, but I have extremely insufficient software knowledge background, limited to a number of basic DOS and Power-Shell commands, as well as FireWall rules, but I am a newcomer to Linux. I would appreciate assistance in obtaining the suitable Linux driver for this USB Adapter, which performance is perfectly suitable, when used in Windows. From the information I was able to patiently collect, obtaining WiFi drivers for Linux is still an issue.  As requested,please find hereunder a copy of the terminal return to lsusb.    The adapter is fitted to a USB port, but apparently not not recognised.   I would like to tell that the answer to my problem had already been given by chili555, who is definitely a very experienced Linux specialist. Thank you very much for your sharply "on target" answers.
I am using UBUNTU 18.10 and I had problem with TL-WN822n v5 driver in UBUNTU and Kali (4.19.0-kali5-amd64)  The problem is driver=rtl8xxxu so I found a driver in this page :   and installed the driver on Kali and it worked perfectly fine but when I wanted to install it on my ubuntu, after I ran the sudo dkms install rtl8192eu/1.0; I got this error :   Kernel preparation unnecessary for this kernel.  Skipping...  Building module: cleaning build area... 'make' all KVER=4.18.0-25-generic...(bad exit status: 2) ERROR (dkms apport): binary package for rtl8192eu: 1.0 not found Error! Bad return status for module build on kernel: 4.18.0-25-generic (x86_64) Consult /var/lib/dkms/rtl8192eu/1.0/build/make.log for more information.   and This is my Log file (/var/lib/dkms/rtl8192eu/1.0/build/make.log) :  DKMS make.log for rtl8192eu-1.0 for kernel 4.18.0-25-generic (x86_64) Sun Jul  7 13:35:02 +0430 2019 make ARCH=arm64 CROSS_COMPILE= -C /lib/modules/4.18.0-25-generic/build  M=/var/lib/dkms/rtl8192eu/1.0/build  modules make[1]: Entering directory '/usr/src/linux-headers-4.18.0-25-generic'   CC [M]  /var/lib/dkms/rtl8192eu/1.0/build/core/rtw_cmd.o gcc: error: unrecognized command line option ‘-mlittle-endian’; did you mean ‘-fconvert=little-endian’? make[2]: *** [scripts/Makefile.build:325:/var/lib/dkms/rtl8192eu/1.0/build/core/rtw_cmd.o] Error 1 make[1]: *** [Makefile:1534:_module_/var/lib/dkms/rtl8192eu/1.0/build] Error 2 make[1]: Leaving directory '/usr/src/linux-headers-4.18.0-25-generic' make: *** [Makefile:1710: modules] Error 2   What's the problem ??
How to call a function on a directive scope from the controller I want to derive a closed formula for the integral $$I_n= \int \frac {dx}{\prod_{r=0}^n (x+r)}$$  On writing out first few terms we get   For $n=0$, $$I_0=\ln \vert x\vert+C$$ For $n=1$, $$I_1=\ln \vert x\vert-\ln \vert x+1\vert+C$$ For $n=2$ $$I_2=\frac {1}{2!}\left(\sum_{r=0}^2 (-1)^r\binom {2}{r} \ln \vert x+r\vert\right)+C$$ For $n=3$ $$I_3=\frac {1}{3!}\left(\sum_{r=0}^3 (-1)^r\binom {3}{r} \ln \vert x+r\vert\right)+C$$  Hence for generalized $n$ we have $$I_n=\frac {1}{n!}\left(\sum_{r=0}^n (-1)^r\binom {n}{r} (\ln \vert x+r\vert)\right)+C$$  Now this is just an observation but I want to prove that it is correct. I have tried lot of methods but not useful. Partial fractions would have been most useful but would go out on tedious task which is nearly impossible.  Also integration by parts won't help nor any trig substitution. So any ideas are welcome.  And ya,  this is not a homework question,  it's a question which I just saw in a integral challenge paper. Is it safe to delete from C:\Windows\Installer? I've been looking on an XP machine what is using all that diskspace, and it turns out C:\Windows\Installer is high up there on the list of directories that use the most diskspace.  It seems to contain a cache of msi and msp files.  Is it safe to delete those? To save diskspace, I've been deleting the "$KB...$" directories for ages without any problems. I want my Windows Updates in my system, why you would want to uninstall them is something that I have never understood. (Except when you're on an update revision board professionally or something of that order.) In &quot;Introduction to Mathematical logic&quot; by Elliot Mendelson , page $59$ . I couldn't understand the basic preliminary notations for the rigorous definition of Satisfiability. For example , at a line they said, &quot;Moreover, instead of talking about the $n$-tuples of objects that satisfy a wf that has $n$ free variables, it is much more convenient from a technical standpoint to deal uniformly with denumerable sequences. What we have in mind is that a denumerable sequence $s = (s_1, s_2 , s_3 , ... )$ is to be thought of as satisfying a wf $\beta$ that has ${x_j}_1 , {x_j}_2 ,  ... , {x_j}_n$ as free variables (where $j_1 &lt; j_2 &lt; ... &lt; j_n$ ) if the $n$-tuple $\langle {s_j}_1 , {s_j}_2 ,  ... , {s_j}_n \rangle$ satisfies $\mathscr B$ in the usual sense.&quot; I didn't quite understand why they used ${s_j}_1$ and ${x_j}_1$ instead of $s_1$ and $x_1$ . Maybe there is a critical detail I am missing out? Also , Another passage for the rigorous definition: &quot;Let $M$ be an interpretation of a language $\mathscr L$ and let $D$ be the domain of $M$. Let $\sum$ be the set of all denumerable sequences of elements of $D$. For a wf $\mathscr B$ of $\mathscr L$ , we shall define what it means for a sequences $s= (s_1, s_2, ... )$ in $\mathscr L$ to satisfy $\mathscr B$ in $M$. As a preliminary step, for a given s in $\sum$ we shall define a functions $s^*$ that assigns to each term $t$ of $\mathscr L$ an element $s^{*}(t)$ in $D$.&quot; They did say that for each $s = (s_1, s_2, ... )$ , there is a defined function $s^*$ , but even after further reading the text afterwards , I still did not understand how exactly $s^*$ is defined from $s$ . Can someone tell me where the gap in my understanding here is? What's the incentive to flag duplicates? I only say duplicates but I think this could be extended to several other flagging reasons. Since accepted answers/upvotes don't get reverted on questions I see people sometimes cut and paste the answer from a duplicate question without flagging as duplicate. In the end they can usually score a few upvotes and even an accepted answer.  Found this related question:   Seems to have a lot of popularity but nothing ever happened  Jeff on Dupes     Those arguing for “remove reputation from dupes” have no idea of the   Frankenstein monster you’d be creating.      That would be an awesome rep-denial tool for griefing others, first of   all.      Second, it creates a MASSIVE disincentive to participation — even if   you had no idea there were duplicates, you could be bushwhacked at any   time even if you contributed a fantastic answer. Oops sorry dupe!   Zero rep, buddy! Bzzzzt! Go away! Take your awesome answer elsewhere!      Incentives are fine, but penalties are an incredibly bad idea and   would actively hurt users and the network.   I guess this answers my question, even if I disagree with jeff. My options to link large image into AI file My .psd file has a resolution of 6m x 3m @ 150 DPI. This makes it 35433px x 5906px in size. Photoshop CS6 saves the file as .tiff or .psb only. When I first import into Illustrator I get an error that the file is not readable but I have tried many options. Last one is not supported by AI.  So I'm puzzled... is there a way to link large images into Illustrator? Disable commandButton after first click to prevent double submission I have an apex:commandButton on a visualforce page that invokes a method on the controller. There is currently no rerender value set for the button. Instead the controller method returns a PageReference to redirect the user as required.  E.g.  Visualforce:  &lt;apex:commandButton value="Save" action="{!save}"/&gt;   Controller:  public PageReference save() {     // save body ...      // return the user the a parent opportunity     return new PageReference('/' + opp.Id); }   Users are currently able to click on the resulting save button multiple times before the controller completes and returns the PageReference to redirect the browser to an opportunity.  How can I disable the commandButton after the first click?    I tried wrapping the commandButton in an actionStatus and facet, but the need to define the rerender property prevented the resulting PageReference redirect.  E.g.  This will render nicely in the browser and prevent multiple clicks, but doesn't redirect to the Opportunity on completion.  &lt;apex:actionStatus id="saveStatus"&gt;     &lt;apex:facet name="stop"&gt;         &lt;apex:commandButton value="Save" action="{!save}" status="saveStatus" rerender="saveParentBlock" /&gt;     &lt;/apex:facet&gt;     &lt;apex:facet name="start"&gt;         &lt;apex:commandButton value="Saving..." disabled="true" status="saveStatus"/&gt;     &lt;/apex:facet&gt; &lt;/apex:actionStatus&gt;     There is a similar question . I need to support an existing PageReference redirect, which slightly alters the requirements.  Force.com Discussion Boards:   Ideas: How do you empty the buffers and cache on a Linux system? Prior to doing some benchmarking work how would one free up the memory (RAM) that the Linux Kernel is consuming for its buffers and cache?    Note that this is mostly useful for benchmarking. Emptying the buffers and cache reduces performance! If you're here because you thought that freeing buffers and cache was a positive thing, go and read . The short story: free memory is unused memory is wasted memory. I am writing a document for which I need the margin to be exactly as follows: left, right, top and bottom text margin all equal to 1in, distance from bottom of the paper to page number equal to 0.75in (I don't have any footnote or header to set).  I tried to use the fullpage package in LaTeX but it does not give me the 0.75in to the page number. Is there a way to force that? I tried to set manually the margins for a 8.5x11 paper but I am not succeeding.    I tried but after writing:  \documentclass[PhD]{class_file} \usepackage[margin=1in,footskip=0.25in]{geometry}   I get the error message \paperwidth (0.0pt) too short.  I don't see the \paperwidth is set to 0.0pt anywhere though..  Also it seems to me that depending on which machine I use to compile my tex file, I get different margins, even when I set them up manually (without using geometry). Is it possible?    Using the geometry package things seem to work a bit better now (I changed machine and the problem with the paper width previously mentioned disappeared).   \usepackage[margin=1in,footskip=0.25in]{geometry}   gives me without problem upper, right and left margin of 1in. But the lower margin is 1.2in and I can't change it to be 1in even by using bottom=1in or bottom=0.8in. I really don't see how this can happen. Maybe a problem with the spacing between lines? The class files I am using can be fund at   I erased the margin settings of uclath12.clo as the margin I need are different from the ones that this file gives. Thank you. Why can Arwen decide her mortality? I need to find a reg ex that only allows alphanumeric. So far, everyone I try only works if the string is alphanumeric, meaning contains both a letter and a number. I just want one what would allow either and not require both. How do I write a correct micro-benchmark in Java? Sum of a power series $n x^n$ I would like to know: How come that  $$\sum_{n=1}^\infty n x^n=\frac{x}{(x-1)^2}$$  Why isn't it infinity? Primitive Pythagorean triple divisible by 3 I've been studying the Cox Proportional Hazards model, and  this question is glossed over in most texts.    Cox proposed fitting the coefficients of the Hazard function using a partial likelihood method, but why not just fit the coefficients of a parametric Survival function using the maximum likelihood method and a linear model?    In any cases where you have censored data, you could just find the area under the curve.  For example, if your estimate is 380 with standard deviation of 80, and a sample is censored >300, then there is an 84% probability for that sample in the likelihood calculation assuming normal error. Prove that equation has exactly 2 solutions How should a physics student study mathematics? Note: I will expand this question with more specific points when I have my own internet connection and more time (we're moving in, so I'm at a friend's house).  This question is broad, involved, and to some degree subjective.  (I started out as a physics-only student, but eventually decided to add a mathematics major. I am greatly interested in mathematics; the typical curriculum required for physics students is not deep or thorough enough; mathematics is more general (that means work!); and it only requires a few more classes. Naturally, I enjoy  immensely.)  This question asks mainly of undergraduate-level study, but feel free to discuss graduate-level study if you like.  Please do not rush your answer or try to be comprehensive. I realize the StackOverflow model rewards quick answers, but I would rather wait for a thoughtful, thorough (on a point) answer than get a fast, cluttered one. (As you probably know,  produces clear, useful writing; and a properly-done comprehensive answer would take more than a reasonable amount of time and effort.) If you think an overview is necessary, that is fine.  For a question this large, I think the best thing to do is focus on a specific area in each answer.    Update: To Sklivvz, Cedric, Noldorin and everyone else: I had to run off before I could finish, but I wanted to say I knew I would regret this; I was cranky and not thinking clearly, mainly from not eating enough during the day. I am sorry for my sharp responses and for not waiting for my reaction to pass. I apologize.  Re: Curricula:   Please note that I am not asking about choosing your own curriculum in college or university. I did not explicitly say that, but several people believed that was my meaning. I will ask more specific questions later, but the main idea is how a physics student should study mathematics (on his or her own, but also by choosing courses if available) to be a competent mathematician with a view to studying physics.  I merely mentioned adding a mathematics major to illustrate my conclusion that physics student need a deeper mathematical grounding than they typically receive.   And now I have to run off again. Training involved to ride 175 miles (281 km) in a day I want to be able to ride 175 miles (281 km) in a day (to do the ). I used to be able to do about 60 miles (96.5 km), only once hitting 80 miles (128 km), but I'm out of shape now. Wondering how I can systematically train to get to 175 miles at an average of 15 mph (24 km/h) Are there guides out there to help with this?  What's some advice?  [update] The  will happen each year, so my intention isn't to ride this year, rather what do I need to do to ride it in some future year? How can I run an external program from C and parse its output? I've got a utility that outputs a list of files required by a game.  How can I run that utility within a C program and grab its output so I can act on it within the same program? UPDATE: Good call on the lack of information.  The utility spits out a series of strings, and this is supposed to be portable across Mac/Windows/Linux.  Please note, I'm looking for a programmatic way to execute the utility and retain its output (which goes to stdout). Draw a bivariate normal distribution in TikZ For a small class I want to draw a bivariate normal distribution and show where the means from the two variables meet in the space. Has anyone done this in TikZ?