I am playing around with Steam's new SteamPlay/Proton feature. I have installed the game, and now I want to install a third-party localization package, which comes in a form of self unpacking .exe file. The problem is that if I try to run this file, it starts to execute in context of ~/.wine, and I need it to execute in context of ~/.steam/steam/steamapps/compatdata/&lt;gameid&gt;/pfx, which steam has created to run my game. How do I specify where I want this file to run?  Sorry if my question is poorly formulated, I haven't really come to familiarity with wine, so I may confuse terms.
I'm trying to enable alsa on different prefix than default through winetricks.  More specifically, the prefix that has Rosetta Stone on it, as it cannot see my microphone.  When I open winetricks, it only lets me select default.  I tried anyway, on default, and it did not resolve the issue.  I saw some answers online, through the terminal, but that didn't work either.  Maybe I have the syntax wrong?  steve@stevelap:~$ WINEPREFIX=~/.PlayOnLinux/wineprefix/Rosetta sh winetricks alsa sh: 0: Can't open winetricks steve@stevelap:~$ sudo WINEPREFIX=~/.PlayOnLinux/wineprefix/Rosetta sh winetricks alsa [sudo] password for steve:  sh: 0: Can't open winetricks   Could anyone please offer assistance?  Thanks!
How can I completely remove a objects (e.g. particle system or groups used in particle systems) in blender using python?  The problem is this: I have a script, with which I create a scene (e.g. adding some normal objects and some group of objects with a particle system). For a research study I would like to repeat that that several times, without restarting blender. So I can create a scene, delete everything, e.g. with a script like this:  import bpy scn = bpy.context.scene for obj in scn.objects:     obj.select = True bpy.ops.object.delete()   If I rerun the script to recreate the scene with objects using particle system, the latter is not shown in the scene anymore (only the placeholders of the particle system). Now I'm not sure where exactly the problem lies, but I guess not everything is immediately deleted, running the script above. Only the startup of blender helps (but that's not what I want) or pushing the purge button. The purge button seems to start the command:  bpy.ops.outliner.orphans_purge()   But I can't get this piece of code to run in the console. It says that "the context is incorrect". Is there a way to purge the unused data by python script? Thanks a lot for any help. How to install Android Studio on Ubuntu? In  Deathly Hallows, when Harry, Ron, and Hermione are at No. 12, Grimmauld Place, Harry summons Kreacher from the kitchens at Hogwarts where the elf has been working on Harry’s orders given a year previously.  When the trio’s heist in the Ministry of Magic ends with Hermione inadvertently bringing Yaxley inside the perimeter of the Fidelius charm that protects Grimmauld Place, the trio leg it and dare not return there for fear that it’s now crawling with Death Eaters.  Before they leave for the Ministry in the morning, Kreacher is talking about making a stew or pot roast or something for dinner. After the trio go on the run and camp out in the tent, Harry thinks of poor Kreacher preparing a dinner they’ll never return to eat, but they dare not summon him lest a Death Eater tag along (like how Dobby ‘tagged along’ with Kreacher when Harry called him to have him follow Draco in Half-Blood Prince).  The next time we see Kreacher is during the Battle of Hogwarts where he leads the house-elves from the kitchen with battle-cries of “For Master! For Harry Potter!” (or something like that), so he’s clearly lost none of his new-found loyalty to Harry.  Harry is still Kreacher’s master throughout the book, and since he does not communicate at all with Kreacher after their escape from the doorstep, he cannot have ordered Kreacher to return to Hogwarts to work there again.  We know that house-elves can go against their masters’ wishes, but this usually entails them punishing themselves rather brutally, and Kreacher does not seem to have been constantly injuring himself for the better part of a year at Hogwarts.  So when and how does Kreacher leave his master’s house without orders and return to Hogwarts? Is it possible to make the -init method private in Objective-C? I need to hide (make private) the -init method of my class in Objective-C.  How can I do that? Offline update of Windows? What options, if any, exist for offline update of Microsoft  Windows?  If a solution exists please list your experience using it.    Background:  If for any reason a computer does not have a connection to  the Internet or the connection is too slow to download  several hundreds of megabytes every so often some kind of  offline Windows Update is required.  In a multi-computer environment a lot of bandwidth (and thus in some cases money) and/or  time could also be saved if it is possible to update in an  offline manner. Convergence of $A_nT$ to $AT$ in operator norm for compact $T$ $A_n:Y\rightarrow Z$ are operators that strongly converge to $A$. Also, $\|A_n\|_\text {op}\le c$ for $c&gt;0$. Given a compact operator $T:X\rightarrow Y$, I need to show that $A_nT$ converges to $AT$ in operator norm (all spaces in this question are Banach spaces).     I was unable to prove this and I also do not understand why we need to assume that $T$ is compact. Any ideas? An example to show that convergence of Cesaro sum to $0$ does not imply the original sequence converges to $0$. I'd like construct a non-negative sequence $\{a_{k}\}_{k=0}^{\infty}$ with $a_{0}=0$ such that the Cesaro sum $\frac{1}{n}\sum_{k=0}^{n-1}a_{k}\longrightarrow 0$ but $a_{n}$ does not converge to $0$.   I have a really bad attempt:  Define $a_{0}=a_{1}=0$, and $a_{k}:=\log(\log(k))$ for $k\geq 2$, then $a_{k}\longrightarrow\infty$. But $$\dfrac{1}{n}\sum_{k=0}^{n-1}a_{k}=\dfrac{\log\Big(\prod_{k=2}^{n-1}\log(k)\Big)}{n}$$ and Wolframalpha told me that this series converges to $0$ as $n\longrightarrow\infty$.  However, I have no idea about how to show this convergence to $0$. Also, I wish to have a sequence as simple as possible, since at some stage I need too how $f(k):=a_{k}$ is positive semi-definite.   Is there any simpler example?   Thank you! Is there a way to consistently increase the vertical spacing between equation lines in a gather (or gather*) environment from amsmath?  Specifically, I want to produce something like  \begin{gather*} a = b \\[2ex] c = d \\[2ex] e = f \end{gather*}   without having to write [2ex] at the end of each equation line.  I can think of some hacks that redefine \\ to automatically add the spacing, but is there some cleaner/better way to achieve this? The Node Editor won't work for the object selected I know there is a difference between assert and verify in Junit; the assert results in a runtime exception, causing test method execution to abort. To overcome this problem, we can have verify which will make test case fail, but allowing test execution to proceed rather than getting aborted.  I doubt there is any such built in approach in testNG. I do understand that best practices say, there should not be multiple asserts in same test case.  But, in practical world, we do come across scenarios where we need to have multiple checkpoints in one test case and we don't want our test method to abort because of one check point failure (test execution should proceed despite failure).  How can we use a soft assert mechanism, similar to verify, which will not abort test method when there is a checkpoint failure.  Example:  @Test(dataProvider = "getMailUrl") public void testMail(email,subject); Assert.assertFalse(subject.isEmpty);//1st checkpoint Assert.assertNotNull(email); //2nd checkpoint Assert.assertEquals(email, "feedback@yoursite.com"); //3rd checkpoint   Now, I want test execution to proceed, even if the 1st checkpoint (validation of subject being not empty) fails. Definitely we will be not be using assert (hard assert). We will need concept of soft assert similar to verify (facilitated by Junit).   I understand, we have to build a customListener implementing TestNG interfaces or extending existing listeners such as TestListenerAdapter. I am still struggling - how can we do this? Can I view Shared Albums in the iCloud Photos web interface? Zero search results when searching for [tagOne] [or] [tagTwo] score:-2 I'm able to search for the newest questions tagged with [xcode] and [ios] and score >= -2.    But I see 0 results when searching for the newest questions tagged with [xcode] or [ios] and score >= -2. Why does the guestbook chatbox not produce any network activity? I was trying to test if I was able to automatically send a message through curl by inspecting the network activity on chrome and getting the curl command, but I found out that in spite of messages showing up in the gestbook chat there was no any network activity. Why? Collection of clopen sets form a base for a countable completely regular space I have $X$ as a countable, Tychonoff space, and I want to show that the collection of clopen subset of $X$ form a base for the topology on $X$.  Can I first just define a base $\mathscr{B}$ of X, let $x\in X$ and $E \subset X$ is closed such that $x\notin E$. So $x\in X-E$, which is open.   I also noticed that the interval $[0,1]$ is uncountable. Can I define a function $f: X\to [0,1]$, then f is onto. Do I need to show that $f$ continuous next? I'm looking for a word that applies to all the things a person can wear, e.g. clothes, shoes, accessories, etc. It musn't be too generic, e.g. product, item, etc. Show that $f_n(z)=z^n$ converges locally uniformly on $|z|&lt;1$ but not uniformly.   I am really confused. I saw a seemingly reliable reference stating that $z^n$ does not converge uniformly to $0$ on $\{|z|&lt;1\}$ but it does converge uniformly on $\{|z|\le r,r&lt;1\}$. What is the nuance between the two former sets? With $r_n&lt;1,r_n\to 1$, shouldn't one conclude that $f_n(z)$ uniformly converges on $\{|z|&lt;1\}$? And besides, this source tells me what I have to prove for Homework is disproved, which really makes it more frustrating.  I would appreciate any help. Asking users to accept answer when they comment that it answers their question I've had a couple of answers today where the OP indicated via a comment that I solved their problem, but the question wasn't upvoted or accepted.  In both cases the person probably wasn't able to upvote since they were new, but they could have accepted my answer. I felt a little guilty asking them to accept the answer, but since it solved their problem I felt that it would help others who stumbled on the question trying to solve their own problem to know that my solution really was the answer. Is asking the OP to accept your answer when they've said that it solved their problem a reasonable thing to do or does that feel like nagging for reputation? Is it wrong to place the  tag after the  tag? Is there an easy way to put a box around a theorem in LaTeX? For example to state an important theorem. I tried using page 20 of the ntheorem , but I do not know how to use the package. Proving $\sum_{k=0}^n(-1)^k\binom nk=0$ Show that $$\sum_{k=0}^n(-1)^k\binom nk=0$$ So for odd $n$ we have an even number of terms. So $\binom nk=\binom n{n-k}$ which have opposite signs. Thus the sum is 0.  For even $n$ we have that $$\sum_{k=0}^n(-1)^k\binom nk= \binom n0+\sum_{k=1}^{n-1}(-1)^k\binom nk+\binom nn$$ Now $$\sum_{k=1}^{n-1}(-1)^k\binom nk= \sum_{k=1}^{n-1}(-1)^k\left[\binom{n-1}k+\binom{n-1}{k-1}\right]$$ What would that sum be in the square brackets?