Is it possible to connect a PS3 Controller wireless (bluetooth) to the Google Nexus 4 without rooting it? There was a way on earlier Android versions, i heard. How about now?  Thank you
How do I connect a PS3 Controller with Xperia P?
In general, in most places, it is said that using TeX defaults is the best. However, TeX does provide things like \, and \quad etc. When one should use them? Both in general and in math mode in particular. In what order should you do linear regression diagnostics? Perl - Package/Module Issues How are the number of views in a question calculated? Search for text files where two different words exist (any order, any line) I'm looking for a way to search files where two word instances exist in the same file.  I've been using the following to perform my searches up to this point:  find . -exec grep -l "FIND ME" {} \;   The problem I'm running into is that if there isn't exactly one space that between "FIND" and "ME", the search result does not yield the file.  How do I adapt the former search string where both words "FIND" and "ME exist in a file as opposed to "FIND ME"?  I'm using AIX. Render semi-transparent volume with cycles I want to render an image of a fire in cycles, but as a png with a transparent background. Without a transparent background, the output image looks like this:    But as soon as I tick the "Transparent" checkbox under Render->Film, all the semi-transparent parts of the image are not rendered and it looks like this    which is clearly not what I want. I've tried to add a holdout shader or a transparent shader to my smoke domain material nodes, but it didn't help. I've only found answered questions for semi-transparent glass, but none for volumes. My node setup looks like this:    but the transparent shader doesn't do anything.  Has anyone an idea how to fix this?  Thanks  Edit: I've just changed the flow type to "Fire and Smoke" instead of "Fire" and now the semi-transparent parts render too, but I don't want the smoke. Given a countable collection of metric spaces $\{(X_n,\rho_n)\}_{n=1}^{\infty}$.  Form the Cartesian Product of these sets $X=\displaystyle\prod_{n=1}^{\infty}X_n$, and define $\rho:X\times X\rightarrow\mathbb{R}$ by  $$\rho(x,y)=\displaystyle\sum_{n=1}^{\infty}\frac{\rho_n(x_n,y_n)}{2^n[1+\rho_n(x_n,y_n)]}.$$  Show that $\rho$ is a metric on $X$ whose induced topology is equivalent to the product topology on $X$.  So basically what this problem is saying is that there's a canonical way to define a metric on the countable product of metric spaces.  I showed in a previous problem that the topology induced by $\rho_n$ is equivalent to that induced by $\frac{\rho_n(x_n,y_n)}{1+\rho_n(x_n,y_n)}$.  And thus we can go ahead and just assume that $\rho_n&lt; 1$ for all $n$ and replace our infinite series by  $$\rho(x,y)=\displaystyle\sum_{n=1}^{\infty}\frac{\rho_n(x_n,y_n)}{2^n}.$$  Now comes the interesting part: how should I go about showing that the product topology on $X$ and the topology induced by $\rho$ are equivalent?    The basis for the product topology given to me in my book's definition is that of cartesian products made up the $X_n$ except for finitely many which are $O_n$ for some open subset of $X_n$.  However I believe I was able to improve upon this and show that I could decompose these into a basis where the $O_n$ were all open balls induced by their respect $\rho_n$ metric.  For $\rho$ I'm using the basis of open balls that it induces, as I can see no other reasonable choice.    However I can't seem to match these two bases up.  There are many different points $\{x_n\}\in X$ which make my infinite series less than a certain value and there is so much freedom in which terms in the series I choose to reduce in size that it seems hopeless to try and fit an open ball induced by $\rho$ into any one of my basis elements for the product topology.    Is there a more appropriate strategy for proving these two topologies are equivalent? Let's stop displaying a user's accept rate My feature request (or anti-feature-request perhaps) is the following: Let's stop displaying a user's accept rate.  For those of you who know "Fawlty Towers", the whole issue of a visible accept rate and our behavior towards it starts to feel like .   We generally seem to agree that harassing a user about it is not appropriate and that our decision to answer a question should not depend on it, yet we display it in varying terrorist-threat-levels of color. Yes dear users, please don't pay any attention to the brightly orange colored percentage you see there. And whatever you do, don't bring it up.  But as long as you're displaying the accept rate, people will comment on it, criticize users for it and possibly reconsider answering because of it. And while I'm of the opinion that a low accept rate should not stop you from answering (we're here to make the internet better after all) and that the possible reputation gain (or lack thereof) should not factor in either, I can't blame users for considering it. It's in their face after all. And we're only people.   So let's take the issue off the table. Or at least partially. Information about a user's acceptance behavior can still always be gathered from the profile. But at least that would be less in-your-face.   "But it helps me to see if a user is a help vampire!" I'm still wondering if those are of the sparkly variety as well, but I digress. So what? If the question is bad, downvote it. Evaluate a question on its individual value. There is no need to take a user's history into account. There might be a correlation between the quality of a question and a user's accept rate, but there doesn't have to be. And if there is, the bigger problem is the question's quality.  "Exactly! A user with a low accept rate might indicate there's a problem!" I'm not arguing we should get rid of the accept-rate value within SO/SE. After all, this Q&amp;A works based on up and downvotes, as well as the acceptance of an answer. But why not use it behind the scenes to (very occasionally) nudge the user with a statement like:      "You have received several answers to your questions, yet have not accepted an answer as correct or helpful in a while. You might want to evaluate them and where possible ".    After all, in the various questions with regards to comments on low accept rates, if any comments are encouraged at all, then they are of this soft variety. So why not let the system take care of that?  I feel this would take the whole issue of accept rate off the table, while still providing the user with the information he might have missed or needs. (As a bonus, it would reduce the frequency with which the topic is brought up here on Meta) And those users who would ignore this information are most likely not convinced by a displayed percentage either. Hi I have to proof that for $\Omega$ a nested family of odd subsets of $V$ with $V$ finite, we have that $|\Omega|\leq\frac{3}{2}|V|$. I can prove that for certain constructions of $\Omega$, it is satisfies $|\Omega|\leq \frac{3}{2} |V|$, the problem I encounter is that I have to proof that my construction of $\Omega$ is optimal. (Since I have to prove that this holds for every family of odd subsets) Can anyone give me a hint on how to proof that every $\Omega$ satisfies this equation.    $\Omega$ is nested if for all $A,B\in\Omega$ either $A\subseteq B$, $B\subseteq A$, or $A\cap B=\varnothing$; a set is odd if its cardinality is odd. How to convert an array into comma separated strings in smarty template? How to install pygments on windows 7 When I run LaTeX file its gives error as  "! Package minted Error: You must have pygmentize installed to use this package", you must have pygments installed. when I go through minted documentation minted itself required pygments, so Tex friend How do I install this pygment, I don't know the procedure to install. Please guid me or any link pygement.exe file USB 2.0 device (scanner) does not work with xhci_hcd on USB 3.0 system New Graphics Card Preventing Boot Up Does "+" use in String concatenation affect efficiency? Bibliography with BibLaTeX: Do not abbreviate first given (first) name and abbreviate all further given names The first given name of an author or editor in my bibliography should be written out, but all further first names should be abbreviated (initials with a period -- and space if there are multiple first names/initials, see below). I am using style=authoryear with BibLaTeX (v. 2.7) and Biber (v. 1.7).  My bibliography looks like this:     Doe, John Arthur Kyle (2013). The secret life of John Doe.   It should look like this:     Doe, John A. K. (2013). The secret life of John Doe.   Minimal example:  example.tex  \documentclass{scrartcl}  \usepackage[ngerman]{babel} \usepackage[babel,german=quotes]{csquotes} \usepackage[backend=biber,style=authoryear]{biblatex} \bibliography{bibliography}  \begin{document}  \cite[123]{Doe} \printbibliography  \end{document}   bibliography.bib  @book{Doe,     title = {The secret life of John Doe},     author = {Doe, John Arthur Kyle},     year = {2013} }   (Worked with said versions of BibLaTeX and Biber, Texmaker (v. 4.0.3) and MiKTeX (v. 2.9.4813).)  I could not find a solution in biblatex.def and firstinits=true abbreviates all first names, including the first one. L293, L298 and SN754410 H-bridge drivers on low voltage power supply How to extrude and scale with an even offset? I'm quite new to Blender, so forgive me if this is a dumb question. I don't even know hot to describe it properly, so:      Basically I want to extrude a rectangle and then scale it along two axis, but without keeping the proportions; I want to reduce them of the same quantity, so that I get something similar to the frame of a picture. Prove $\sum\limits^m_{k=0} \frac{2n-k\choose k}{2n-k\choose n}\frac{2n-4k+1}{2n-2k+1}2^{n-2k}=\frac{n\choose m}{2n-2m\choose n-m}2^{n-2m}$ for- I'm looking for some sample code that will sort the list items in an HTML list by alphabetical order.  Can anyone help?  Here is a sample list for people to work with:  &lt;ul class="alphaList"&gt;     &lt;li&gt;apples&lt;/li&gt;     &lt;li&gt;cats&lt;/li&gt;     &lt;li&gt;bears&lt;/li&gt; &lt;/ul&gt; Alice has a secp256k1 key pair that she used some time ago when she communicated with Bob. Bob can no longer user secp256k1 but he only uses ed25519 instead.  Is there a secure algorithm that Bob can use to derive an ed25519 pubkey from original Alice's secp256k1 pub key and also Alice can derive the matching ed25519 private key from her original secp256k1 private key such that they can communicate securely via ed25519 encrypted messages?  Thanks!