I have some serious suspition that my boss installed some kind of spy software. Maybe a keylogger, screen capture or something to know what I do when he's not at the office.  I have nothing to hide so I don't know if he doesn't tell me anything because he didn't find anything out of place or because I'm being paranoid and he's not spying me.  Either way I want to be sure if I'm being spied because:   I don't want to work for someone he doesn't trust me me It's illegal and I won't allow anyone to store my passwords (I do access my personal email, homebanking and Facebook account during lunch breaks) and personal information.   So... how can I detect spy software in a iMac running OS X 10.6.8? I have full admin permissions know it.  I tried scanning all folders in my user's and system Library but nothing rang any bell but since I think any of this software would hide the folder (either by location or name)  I don't think I'll find a folder named Employeee Spy Data  I also looked all the processes running at different moments with Activity Monitor but again... it's not like the process would be called SpyAgent Helper  Is there a list of known possible folders / processes to look for?  Any other way to detect?
I'm looking at buying a second-hand Mac, probably one that does not include an OS installation disk.  How can I scan it to make sure that it has not had security threats installed on it?  Is there a CD or DVD image I can boot it up with to perform this scan offline?  Edit: prospective machine would be a 2011- or 2012-vintage MacBook Pro.  Also note that I don't have reliable access to high-speed internet, so solutions that involve downloading 5GB over the Internet are not ideal.  For others, though,  may be helpful.
Having problems with hair transparency using cycles. I ported over a model from daz studio (have done this a few times before with no issues).   Using a simple mix shader, transparent top, diffuse bottom, black/white texture in the fac.  Heres the blend  with images packed. Meta sites in "Your Communities" display different reputation While using the top bar to navigate across communities, I noticed that the reputation displayed on meta sites on that list does not match the one of their corresponding main sites:    I have noticed on past situations that reputation gained takes a bit to "update" on the display on Meta sites (that is, if you gain rep on SO, for example, it will take some time for you to see your updated rep on MSO).  However, I have never noticed this behavior here, on the Sites List of the top bar. Furthermore, the "delay" here seems to be more severe, as the "outdated" rep showed is of several days ago (for example, I turned 3k on SO almost exactly a week ago, but the rep shown on MSO is still &lt;3k).  Any idea what could be causing this behavior?    Update: 2 months later this persists: my main site rep updates correctly but their corresponding meta rep remains the same as in the image above.     Update: As per Catija's  I removed the site (MSO) and put it back in, but it didn't update the rep.   However, after removing one site (TWP Meta), waiting at least a day, and then adding it back I see that although the reputations still don't match, the number displayed did changed a bit (previously 29,924 but now 33,112): Stop Excel from automatically converting certain text values to dates Does anyone happen to know if there is a token I can add to my csv for a certain field so Excel doesn't try to convert it to a date?  I'm trying to write a .csv file from my application and one of the values happens to look enough like a date that Excel is automatically converting it from text to a date.  I've tried putting all of my text fields (including the one that looks like a date) within double quotes, but that has no effect. Normal subgroup of prime index Is there any difference between like best and like the best? Is there a difference between these two sentences? Are they the same?   What color do you like the best? What color do you like best?   Is there a difference in their meaning? Is the following conjecture true?     Given an $n&gt;1$ and a $k$ such that $0&lt;k&lt;n$ then $\gcd\left(\binom{n}{k}, n\right)&gt;1$   This was a question asked in my old Number Theory course that I recently remembered. It was posed after we learned that $p\mid\binom{p}{k}$ for $0&lt;k&lt;p$. We never resolved it either way. I expect it to be true and have an elegant answer, but I haven't been able to prove it. Mark's generosity in this crisis seems to more than make up for his earlier stinginess.   Should those sentences always be avoided, or are there cases where they are valid? How safely bring lamp wire into house? I'm considering replacing an outdoor lighting fixture with an LED motion-sensitive fixture, but I'm not sure how to safely do the wiring.  The location is protected (under a porch) but still needs to be weatherproof. Here's the existing fixture and mount:    The obvious replacement would be another lamp that included its own box cover, so that its wiring would be covered and protected. But, the fixture I like doesn't include such a cover:    You can see it's meant to be screwed into the wall, but doesn't cover anything. The power cable ends with bare wires which are meant to be wire-nutted to the supply wiring, probably inside a junction box. But, how do I get the wire safely into the junction box while keeping things weatherproof?  One option would be to replace the lamp's power cable with one ending in a grounded plug, and install a weatherproof outlet box. But that's ugly and complex.  Are there weatherproof junction box covers that include provisions for sealed entry of cables? How to connect a Nokia Lumia 730 to Ubuntu 14.04? Getting server name during servlet initialization Find the limit of $\frac{n^{x}}{(1 + x)^{n}}$ Let $x&gt;0$. Find $$\lim_{n\to\infty}\frac{n^{x}}{(1 + x)^{n}}.$$   What I was thinking involved an inequality, by reason of considering the fact that  $$(1 + x)^{n} &gt; C(n, k) x^{k}$$ for some $k$ such that $n&gt;k$. Expanding the binomial coefficient and taking the $n$ common from each bracket, we have something like $$(1 + x)^{n} &gt; C(n, k) x^{n} &gt; \frac {x^{k}n^{k}}{k! 2^{k}}.$$ But now, I am totally clueless. By intuition, I know that the limit has to be zero, so I just want to prove using the concept of inequalities that what I thought was the right approach (being the sandwich theorem). Any help would be appreciated! I'm currently working through the book Heisenberg's Quantum Mechanics (Razavy, 2010), and am reading the chapter on classical mechanics. I'm interested in part of their derivative of a generalized Lorentz force via a velocity-dependent potential.   I understand the generalized force   $$F_i = -\frac{\partial V}{\partial x_i} + \frac{d}{dt}\left(\frac{\partial V}{\partial v_i}\right)$$  that they derive from a Lagrangian of the form $L = \frac{1}{2}m|\vec v|^2 - V(\vec r,\vec v,t)$.  However, in the next (critical) step of the derivation, the author cites a theorem from Helmholtz saying      ...according to Helmholtz, for the existence of the Lagrangian, such a generalized force can be at most a linear function of acceleration, and it must satisfy the Helmholtz identities.   The three Helmholtz identities are then listed as:  $$\frac{\partial F_i}{\partial \dot{v_j}} = \frac{\partial F_j}{\partial \dot{v_i}},$$  $$\frac{\partial F_i}{\partial v_j} +  \frac{\partial F_j}{\partial v_i} = \frac{d}{dt}\left(\frac{\partial F_i}{\partial \dot{v_j}} +  \frac{\partial F_j}{\partial \dot{v_i}}\right),$$  $$\frac{\partial F_i}{\partial x_j} -  \frac{\partial F_j}{\partial x_i} = \frac{1}{2}\frac{d}{dt}\left(\frac{\partial F_i}{\partial v_j} - \frac{\partial F_j}{\partial v_i}\right).$$  I'm trying to understand where this theorem comes from. Razavy cited a 1887 paper by Helmholtz. I was able to find , but it is in German, so I could not verify whether or not it proved the theorem. Additionally, I could not find it in any recent literature. I searched online and in Goldstein's Classical Mechanics.   The only similar concept that I can find is in the  where we have three equations known as Helmholtz conditions. Are these two concepts one in the same? If so, how should I interpret the function $\Phi$ and the matrix $g_{ij}$ that appear in the Helmholtz conditions I found online?   If the cited theorem from Razavy does not relate from the inverse Lagrangian problem, could I have some help finding the right direction? How to partition an encrypted disk I've installed Ubuntu 13.10 and formatted my whole HDD ,and i chose to encrypt the disk and it automatically chose the LVM option (and put it as a logical partition) now after Ubuntu installed i tried to repartition the disk thru Live CD put GPartition gave me it's an encrypted partition and it can't be resized , i want to put the system's files and the home folder on partition and my private files on another one  Any help please ? What are the scope restrictions for setting shopt extglob. and other options? My non-interactive bash shell has extglob off. I would like to turn it on in the statement immediately before a command, but I have noticed that when shopt -s extglob is within an if .. then .. else block, it somehow does not register.   The following extglob-dependant command is not valid: syntax error near unexpected token '('.     Where can extglob be set, and why is there a restriction, at all? Does this apply to other options?  ... GNU bash 4.1.5     This works:    shopt -s extglob if true ;then     touch a.bcd; ls a.@(bcd) fi   This fails:    if true ;then     shopt -s extglob     touch a.bcd; ls a.@(bcd) fi ... line 17: syntax error near unexpected token `(' ... line 17: `touch a.bcd; ls a.@(bcd)' I am currently in the process of trying to repair a power supply that has had one of its DC rails fail. A resistor in the PSU has exploded and I am trying to find what value it is.    Band 1: White Band 2: Brown Band 3: Silver (Possibly Grey?) Band 4: Gold Band 5: Green    The weird thing is that the middle band appears to be silver, which should be invalid as far as I can tell. If you assume the silver is grey (although this is unlikely, as there still needs to be a grey colour as well and the band is metallic), it produces a value of resistor which is incredibly uncommon to the point it does not exist (91.8 Ohms 0.5%).  Apologies for the noobie question, I'm just stumped after hours of trying to understand why this is and coming up short :). Recently I have installed an older version of Ubuntu on my old machine. Whenever I try to install any software, I get an error saying it couldn't be found:  $ sudo apt-get install vlc Reading package lists... Done                Building dependency tree        Reading state information... Done     E: Couldn't find package vlc Is there a way to connect my MacBook Pro to two external monitors (either VGA or HDMI; no Thunderbolt) in such a way that the Mac screen serves as a third monitor?  What hardware do I need? Today, we had a math class, where we had to show, that $a_{100} &gt; 14$ for  $$a_0 = 1;\qquad a_{n+1} = a_n + a_n^{-1}$$  Apart from this task, I asked myself: Is there a closed form for this sequence? Since I didn't find an answer by myself, can somebody tell me, whether such a closed form exists, and if yes what it is? I think that the question is contained in the title. Suppose we begin from something that is false for example $1=0$. Is it possible using only $\Rightarrow$ (and of course $\lnot ,\wedge,\lor$)  to prove any possible statement? It has been ages since i studied logic at the university so i would prefer a simple explanation (if possible) Create SOAP envelope of XML and send it as HttpWebRequest to WebService