I'm using a PDF reader, iAnnotate, that allows one to search a document using java.util.regex.Pattern regexps.  Unfortunately, iAnnotate ignores case in all searches.  This happens even if you use an expression like [A] (it also finds "a"), and even if you specify the character in unicode (\u0041 means "A", but iAnnotate also finds "a").  Java regexps are not designed to ignore case by default, and I don't see any way to use them to override ignore-case behavior in the , but maybe there's something I'm not thinking of.  Any suggestions for possible regexp tricks to force a regexp to be interpreted with a specific case?  I know that this is strictly speaking an iAnnotate question, but I am interested in possible Pattern regexp solutions.
I've seen lots of examples of making an entire regular expression case-insensitive.  What I'm wondering about is having just part of the expression be case-insensitive.  For example, let's say I have a string like this:  fooFOOfOoFoOBARBARbarbarbAr   What if I want to match all occurrences of "foo" regardless of case but I only want to match the upper-case "BAR"s?  The ideal solution would be something that works across regex flavors but I'm interested in hearing language-specific ones as well (Thanks )  Edit  The link Espo provided was very helpful.  There's a good example in there about turning modifiers on and off within the expression.  For my contrived example, I can do something like this:  (?i)foo*(?-i)|BAR   which makes the match case-insensitive for just the foo portion of the match.  That seemed to work in most regex implementations except Javascript, Python, and a few others (as Espo mentioned).    The big ones that I was wondering about (Perl, PHP, .NET) all support inline mode changes.
Determining application path in a Python EXE generated by pyInstaller I have an application that resides in a single .py file.  I've been able to get pyInstaller to bundle it successfully into an EXE for Windows.  The problem is, the application requires a .cfg file that always sits directly beside the application in the same directory.  Normally, I build the path using the following code:  import os config_name = 'myapp.cfg' config_path = os.path.join(sys.path[0], config_name)   However, it seems the sys.path is blank when its called from an EXE generated by pyInstaller.  This same behaviour occurs when you run the python interactive command line and try to fetch sys.path[0].  Is there a more concrete way of getting the path of the currently running application so that I can find files that are relative to it? Why does main method in Java always need arguments? errors upgrading from 14.04 to 16.04 about Unknown Multi-Arch type for compiz, libkf5akonadisearch-bin packages I'm trying to upgrade my 14.04 machine to 16.04 using do-release-upgrade. After downloading the package lists for wily, I see the following errors:  Unknown Multi-Arch type 'no' for package 'compiz-core' Unknown Multi-Arch type 'no' for package 'compiz-gnome' Ignoring Provides line with DepCompareOp for package python-cffi-backend-api-max Ignoring Provides line with DepCompareOp for package python-cffi-backend-api-min Ignoring Provides line with DepCompareOp for package python3-cffi-backend-api-max Ignoring Provides line with DepCompareOp for package python3-cffi-backend-api-min Unknown Multi-Arch type 'no' for package 'libkf5akonadisearch-bin' Ignoring Provides line with DepCompareOp for package php-psr-http-message-implementation Ignoring Provides line with DepCompareOp for package php-psr-log-implementation Ignoring Provides line with DepCompareOp for package php-math-biginteger Unknown Multi-Arch type 'no' for package 'compiz-core' Unknown Multi-Arch type 'no' for package 'compiz-gnome' Ignoring Provides line with DepCompareOp for package python-cffi-backend-api-max Ignoring Provides line with DepCompareOp for package python-cffi-backend-api-min Ignoring Provides line with DepCompareOp for package python3-cffi-backend-api-max Ignoring Provides line with DepCompareOp for package python3-cffi-backend-api-min Unknown Multi-Arch type 'no' for package 'libkf5akonadisearch-bin' Unknown Multi-Arch type 'no' for package 'compiz-core' Unknown Multi-Arch type 'no' for package 'compiz-gnome' Unknown Multi-Arch type 'no' for package 'compiz-core' Unknown Multi-Arch type 'no' for package 'compiz-gnome' You may want to run apt-get update to correct these problems   It then proceeds to abort the installation. The suggested run of apt-get update doesn't seem to do anything. Googling for the above error messages yielded others having similar problems when upgrading to other, previous releases, although I've not come across any apparent fixes. It's suggested that an apt upgrade could fix the problem, but I don't see a way to easily do that (it's up to date with the latest trusty package).  What should I do in order to upgrade directly to 16.04? Problem with finding the GCD in the Field of Polynomials mod p I am really having trouble working a problem in my course. I will post it and then add what I have thought etc.  Let p be an odd prime, then using the Euclidian Algorithm, calculated the GCD of of $x^{p-1}-1$ and $x^2+1$ in $\mathbb{Z} / p\mathbb{Z}[x]$  Also, how does $p=1 (mod4)$ tell us that  $-1$ is a square in $\mathbb{Z} / p\mathbb{Z}$, infact that $-1$ is a square here if and only if $p=1(mod4)$.  My thoughts:   I know that $$x^{p}-x=(x)(x-1)(x-2)…(x-(p-1))$$ and so that in this sense our roots will be the congruence classes of $1,2,…p-1$  and also that $$x^{p-1}-1=(x-1)(x-2)…(x-(p-1))$$  But I get lost when trying to apply the EA to these polynomials,  like how can I do it when p is arbitrary?  Preferably id like to be able to understand/see how to do the first part first i.e. using division with residue and then move on to the second part. Any insight/hint or solution to this would be great,  Thank you all  Update:  When I try to do division with residue, I just get  $$x^{p-1}-1=(x^2+1)(x^{p-3}-x^{p-5}+x^{p-7}-x^{p-9}...)$$  for example,  $p=7$  $$(x^{6}-1)=(x^2+1)(x^4-x^2+1)$$  for $p=11$  $$(x^{10}-1)=(x^2+1)(x^{8}-x^{6}+x^{4}-x^{2}+1)$$  which for specific cases tells me that 1 is the gcd, but I dont know how to generalize that for the case with arbitrary prime p. Irreducible Components of the Prime Spectrum of a Quotient Ring and Primary Decomposition Can I run the python interpreter without generating the compiled .pyc files? I've been trying to prove   $$\sum_{k=1}^{n}{(-1)^{k+1} {{n}\choose{k}}\frac{1}{k}=H_n}$$  I've tried perturbation and inversion but still nothing. I've even tried expanding the sum to try and find some pattern that could relate this to the harmonic series but this just seems surreal. I can't find any logical reasoning behind this identity. I don't understand . Is there any proof that doesn't require the integral transform? Does the Polyjuice Potion Dark Mark work? I was just reading Harry Potter and the Deathly Hallows, and I was wondering, when Hermione Granger changed into Bellatrix Lestrange, she should've obtained the Dark Mark, temporarily.  Now, my question is: would the Dark Mark work if pressed? Recently, I was in a car and noticed a plane in the sky. What was interesting was that the plane seemed to go slower than my car because I passed the plane. Is there a physics reason to this? Calculate the sum of the infinite series $\sum_{n=0}^{\infty} \frac{n}{4^n}$ A previous problem had us solving $\sum_{n=0}^{\infty} \frac{1}{4^n}$ which I calculated to be $\frac{4}{3}$ using a bit of mathematical manipulation.   Wonderful. Thank you for all the prompt responses.  Could anyone suggest an alternate technique that does not involve differentiation? I tried to log into Minecraft today to find that my password isn't working. I tried to change it, but I can't login to my email because I forgot the answer to my security question. I tried changing the email to a different one, but that didn't work for some reason (it kept saying "invalid email"). I don't have my transation ID because I forgot which credit card I used.  Does this mean that I have to buy a new Minecraft account? Show that the sequence $a_{n+1}=a_{n}+\dfrac{a^2_{n}}{n^2}$ is upper bounded Let $\{a_{n}\}$ be defined with $a_{1}\in(0,1)$, and  $$a_{n+1}=a_{n}+\dfrac{a^2_{n}}{n^2}$$ for all $n\gt 0$.  Show that the sequence is  upper bounded.  My idea: since  $$a_{n+1}=a_{n}\left(1+\dfrac{a_{n}}{n^2}\right)$$ then $$\dfrac{1}{a_{n+1}}=\dfrac{1}{a_{n}}-\dfrac{1}{a_{n}+n^2}$$ then $$\dfrac{1}{a_{n}}-\dfrac{1}{a_{n+1}}=\dfrac{1}{a_{n}+n^2}$$ so $$\dfrac{1}{a_{1}}-\dfrac{1}{a_{n+1}}=\sum_{i=1}^{n}\dfrac{1}{a_{i}+i^2}$$ since $$a_{n+1}&gt;a_{n}\Longrightarrow \dfrac{1}{a_{i}+i^2}&lt;\dfrac{1}{a_{1}+i^2}$$ so $$\dfrac{1}{a_{n+1}}&gt;\dfrac{1}{a_{1}}-\left(\dfrac{1}{1+a_{1}}+\dfrac{1}{2^2+a_{1}}+\cdots+\dfrac{1}{a_{1}+n^2}\right)$$ But the RHS might be $\lt0$ for a sufficiently large starting value; for instance, with $a_{1}=\dfrac{99}{100}$ then $$\dfrac{1}{a_{1}}-\left(\dfrac{1}{1+a_{1}}+\dfrac{1}{2^2+a_{1}}+\cdots+\dfrac{1}{a_{1}+n^2}\right)&lt;0,n\to\infty$$  see:   so this method won't let me bound the series and I don't know what else to do. What will be the value of the following Infinite Product :   $$\displaystyle \prod_{k=0}^\infty \left(1+\dfrac{1}{2^{2^k}}\right)$$  It would be nice if anyone could spare the time and boil down to the absolute basics and tell how they reached the solution. How to differentiate formally? Electrical outlet on a dimmer switch? I live in an older house and have some outlets in our kitchen that don't make sense to me. We have one outlet that is tied to a dimmer switch on the opposite side of the room. I can detect that the outlet is hot using my voltage detector (when the dimmer switch is all the way on), but it pulses. I get about 6-7 beeps, then it skips one, beeps 6-7 more times, skips, continue. My GFCI tester shows an open hot. The outlet doesn't work.  I'm not very experienced with electrical work but this sounds highly unusual to me. Where should I start with fixing the issue? DropDown list onchange event and AJAX in MVC I am a Pakistani national and need to transit through Dubai International Airport (DXB).  I am not planning to leave the airport and both of my flights (arrival and departure) are from Terminal 3.  I am pretty sure that I do not need transit visa at the DXB, however it is no where mentioned on any of their official website.   Can anyone please provide me such a link stating that transiting without leaving the airport does not require visa at DXB, as I need to use this link as a proof for a visa application?  Thanks Can black holes be created on a miniature scale? A black hole is so powerful to suck everything into itself. So is it possible that mini black holes can be created? If not then we could have actively disproved the rumors spread during LHC experiment. ［I'm Done］ button is available after ［Save Edits］ even when nothing was edited in First Posts queue Is $x^x=y$ solvable for $x$?