find all strings between quotation marks
Regex pattern to choose data BETWEEN matching quotation marks
I'm trying to install a service using InstallUtil.exe but invoked through Process.Start. Here's the code:  ProcessStartInfo startInfo = new ProcessStartInfo (m_strInstallUtil, strExePath); System.Diagnostics.Process.Start (startInfo);   where m_strInstallUtil is the fully qualified path and exe to "InstallUtil.exe" and strExePath is the fully qualified path/name to my service.  Running the command line syntax from an elevated command prompt works; running from my app (using the above code) does not. I assume I'm dealing with some process elevation issue, so how would I run my process in an elevated state? Do I need to look at ShellExecute for this?  This is all on Windows Vista. I am running the process in the VS2008 debugger elevated to admin privilege.  I also tried setting startInfo.Verb = "runas"; but it didn't seem to solve the problem. How do I convert an argument list to a sequence of arguments? Basic desktop actions are not available on Ubuntu 20.04 In Ubuntu 20.04, on the desktop, there is a number of actions I wish I could do, such as, by order of importance :  use keyboard shortcuts such as select all, copy / paste. use drag &amp; drop with icons deactivate the &quot;mouse over&quot; highlight, and restrict the clicking area to only the icon, not the surrounding square  To put it simply, I'd like to have the exact same features as offered by the desktop of Ubuntu 18.04 (probably related to a specific version of GNOME, and not Ubuntu itself). Am I missing something obvious here? I actually see no reason why those actions are removed or deactivated on the desktop, since they all work in any Nautilus window. How to twist radial vector to make spirals? This is Problem 6 of the 2007 Indian National Math Olympiad (INMO).  If $x, y, z$ are positive real numbers, prove that $(x+y+z)^2(yz+zx+xy)^2 \leq 3(y^2+yz+z^2)(z^2+zx+x^2)(x^2+xy+y^2).$  My best idea was to expand this and simplify. Although that doesn't look very feasible. Another idea is to see that $x^2+y^2+xy \geq x^2+y^2$. Then we just have to show that $(x+y+z)^2(yz+zx+xy)^2 \leq 3(x^2+y^2)(x^2+z^2)(y^2+z^2)$ if that is even true. Can someone point me to a paper, or show here, why symmetric matrices have orthogonal eigenvectors? In particular, I'd like to see proof that for a symmetric matrix $A$ there exists decomposition $A = Q\Lambda Q^{-1} = Q\Lambda Q^{T}$ where $\Lambda$ is diagonal. Which focal-length lens is usually used for portrait photography, and why? What focal length or range of focal lengths are usually used for portraits?   What is used by professionals? Why would one select a certain focal length? What are the advantages and disadvantages of different choices, and are there certain situations where an unusual choice might be better? How to be sure API calls are using TLS 1.2 We are using .Net to make web service calls the Salesforce API. Is there a way to know for sure that the calls are using TLS 1.2? Are there any API logs or records of the protocol is use in Salesforce we can review to be confident the change is working? Can it happen that the image of a functor is not a category? On Hilton and Stammbach's homological algebra book, end of chap. 2, they wrote in general $F(\mathfrak{C})$ is not a category at all in general. But I don't quite get it. I checked the axioms of a category for the image, and I think they are all satisfied. Am I missing something? Thanks. Missing vertices in Edit Mode I have append a mesh (rex) from this .blend .  In edit Mode I see different vertices from objcet mode (see pictures). The vertices of belt are missing!  OBJECT MODE:   EDIT MODE:   How can I edit vertices of belt? Is It a bug?  This is my .blend  maybe can help. Ubuntu installation is slow, why? Upper bound on the number of charts needed to cover a topological manifold If $M^n$ is a compact topological manifold (not necessarily with additional structure), is there an upper bound on the number of charts needed to cover $M$ ? Does this bound depend on the dimension of $M$ ?  Thanks in advance...  Cheers Are there recommendations or pitfalls for playing an archer cleric? In my 4E game, a player is going to try an elven cleric with a longbow (and a mace, just in case). She chose mostly ranged powers. Are there any caveats to playing such a character, or any builds that I could recommend for her? Constructing a metric on a Lie Group Dropping z dimension programmatically It seems there is no geoalgorithm to drop z values in the QGIS processing toolbox. Can this be done programmatically using the Python console? At the moment I have to save the layer with unchecked 'Include z-dimension' checkbox (non automatic geometry type): Counting unique records across 2 columns and computing a score based on boolean values I have a table that looks like this in Google Big Query:  custID  InteractionDate Purchased?  Sales 1       20150312           F         0 1       20150312           T         200 1       20150314           T         150 2       20150221           T         400 2       20150221           F         0 2       20150221           T         120   ..that I need to transform to the following structure:   custID InteractionDate Success Sales  1     20150312          0.5    200  1     20150314           1     150  2     20150221         0.66    520   ..where in this second table the success column is defined as  count(purchase=Yes)/(count(purchase=Yes) + count(purchase=No)),   and sales is just the sum.  I'm quite new to BQ and no-SQL languages. I simply don't know how to do this, I've searched and seen examples that suggest using partition over but I simply haven't seen any example that does just this. Thanks a lot in advance. I cannot easily figure out which one is more appropriate to use:     It's important to me.        It's important for me.   Are they the same? If not, what's the difference? Computing sums of divisors in $O(\sqrt n)$ time? I have a sequence: $1,3,5,8,10,14,16,20,23,27,\dots$  I know that the recursive relation is:  $$p[i] := p[i-1] + \text{number of factors of $i$}, \quad \text{with $p[1]=1$.}$$  How do I solve this recursive relation in $O(n^{0.5})$ time? I have to write a program for it, and $n$ can be as large as $10^9$. So, some appropriate precomputation and prestorage is allowed, provided that they comply (memory and time wise) with the range of $n$. I am trying to install a Ralink wifi adapter in Ubuntu Desktop 14.04.  The system is not detecting the wifi.   lsusb lists the device as:  Bus 002 Device 004: ID 148f:7601 Ralink Technology, Corp.  I have the rt2800 USB driver listed in "/etc/modules"; Following some instructions on the web, I tried this command:  echo 148F 7601 | sudo tee /sys/bus/usb/drivers/rt2800usb/new_i  lsmod | grep rt2800 returns the following:  rt2800usb              26581  0  rt2x00usb              20041  1 rt2800usb rt2800lib              83150  1 rt2800usb rt2x00lib              48886  3 rt2x00usb,rt2800lib,rt2800usb mac80211              545990  3 rt2x00lib,rt2x00usb,rt2800lib crc_ccitt              12627  1 rt2800lib Do gravitons interact with each other? I always thought the non-linearity of Einsteins field equations implies that there should be direct graviton-graviton interactions. But I stumbled upon  which argues:     If gravitons exist, then, like photons and unlike gluons, gravitons do   not interact with other particles of their kind. That is, gravitons   carry the force of gravitation but are not affected by it. This is   apparent due to gravity being the only thing which escapes from black   holes, in addition to having an infinite range and traveling in   straight lines, similarly to electromagnetism.   Is Wikipedia correct? If not, why not? And what then are the arguments that there must be graviton-graviton interactions?    (As of this question being asked, the above paragraph has been removed from Wikipedia.)