Unexpected bitwise operation result
What's the function of the ~ bitwise operator (Tilde)
How to launch a command on network connection/disconnection? I have a wifi connection that requires to authenticate using a web form once the wireless link is established. I know how to automate the authentication with a script that uses curl/.  But how can I ask Windows to call my script every time I connect to a particular network connection?  I would be also interested in receiving the name of the wireless profile or the ESSID on the command-line of my script. How can I make things link url references, my index, table of contents, and cross references clickable links in documents produced by LaTeX? I generally use pdflatex to produce my documents. How do I check if a string is a number (float)? Will it be possible to create apps/games in Java SE or Java ME on new Ubuntu phones? Given an alphabet of size $n$, how many strings of length $c$ contain every single letter of the alphabet at least once?  I first attempted to use a recurrence relation to work it out:  $$ T(c) = \left\{ \begin{array}{cr} 0 &amp;\mbox{ if $c&lt;n$} \\ n! &amp;\mbox{ if $c = n$} \\ T(c-1) \cdot n \cdot c &amp;\mbox{ if $c &gt; n$} \end{array} \right. $$  As there's no strings that contain every letter if c &lt; n, and if c = n then it's just all permutations. When c > n you can take any string of size (c-1) that contains all letters (of which there are $T(c-1)$ to choose from), you choose which letter to add (of which there are $n$ choices) and there are $c$ different positions to put it. However, this gives out results that are larger than $n^c$ (the total number of strings), so it can't be right, and I realised it was because you could count some strings multiple times, as you can make them taking different inserting steps.   Then I thought about being simpler: you choose n positions in the string, put each letter of the alphabet in one of those positions, then let the rest of the string be anything:  $$ {c\choose{n}} \cdot n! \cdot n^{c-n} $$  But again this counts strings multiple times.  I've also considered using multinomial coefficients, but as we don't know how many times each letter appears in the string it seems unlikely they would be much help. I've also tried several other methods, some complicated and some simple, but none of them seem to work.  How would you go about working out a formula for this? I'm sure there's something simple that I'm missing. This is a  about setting up .     I have an office with many computers that share a single external ip (I'm unsure if the address is static or dynamic). Each computer connects to our mail server via IMAP using outlook. Email is sent and received by those computers, and some users send and receive email on their mobile phones as well.  I am using  to generate an SPF record and I'm unsure about some of the fields in the wizard, specifically:   Enter any other domains who may send or relay mail for this domain Enter any IP addresses in CIDR format for netblocks that originate or relay mail for this domain Enter any other hosts which can send or relay mail for this domain How stringent should SPF-aware MTA's treat this?   the first few questions i'm fairly certain about... hope i have given enough info. If H is a subgroup of G ( | G:H |=n, n > 1), then how can you show that G has a factor group G/N which is isomorphic to a subgroup D of the symmetric group Sn with |D| > 1.  I've been looking at Cayley's Theorem but it's not specific to the factor groups. Unhandled event loop exception in plugin org.eclipse.ui Is the force which throws a body on a rotating disk outwards centrifugal force? If some object is kept in a radial groove made on a disk and the disk is rotated with say constant angular velocity.   Now as we know that the object moves outwards ie away from the centre of the disk. I want to know which force is it which throws the object outwards.   As centrifugal force is a pseudo force and hence when the observer is in ground frame it shouldn't be present so which force exactly pulls it out. Reduce Spacing In $$ In math, one often needs to put a letter inside the symbols &lt;&gt;, e.g. to denote a cyclic group &lt;x&gt; generated by some element x. However, plain text displays the symbols &lt; and &gt; as an upside down exclamation point and an upside down question mark, respectively, while math type displays a large space like so:  &lt; x &gt;    Is there some way to reduce this spacing? Can I permanently block an update (non-driver) that will not install on my machine on Win10 pro? I have an update to Visual Studio 2010 that will NOT update and has failed hundreds of times. Manually installing it also fails, and no source has been found for manually getting this very old patch to install on Windows 10. I believe the problem is that Microsoft simply hasn't re-tested KB2890573 at all and it doesn't install on Win10 ver 1511 at all, anymore.  I do not want to use the MS utility that will postpone this update for a while. I want to permanently block it so it does not appear in the windows update list ever again. I have a HP Pavilion dm4-2070us which has an Intel Corporation Centrino Wireless-N 1000 adapter.   The problem is that my computer doesn't show the wireless networks after I upgraded my system to Ubuntu 11.10. Following is my output for sudo lshw -class network:  *-network DISABLED          description: Wireless interface    product: Centrino Wireless-N 1000    vendor: Intel Corporation    physical id: 0    bus info: pci@0000:01:00.0    logical name: wlan0    version: 00    serial: 8c:a9:82:81:5a:30    width: 64 bits    clock: 33MHz    capabilities: pm msi pciexpress bus_master cap_list ethernet physical wireless    configuration: broadcast=yes driver=iwlagn driverversion=3.0.0-12-generic firmware=39.31.5.1 build 35138 latency=0 link=no multicast=yes wireless=IEEE 802.11bgn    resources: irq:42 memory:c2500000-c2501fff  *-network    description: Ethernet interface    product: AR8151 v2.0 Gigabit Ethernet    vendor: Atheros Communications    physical id: 0    bus info: pci@0000:08:00.0    logical name: eth0    version: c0    serial: 2c:41:38:07:f3:e3    size: 100Mbit/s    capacity: 1Gbit/s    width: 64 bits    clock: 33MHz    capabilities: pm msi pciexpress vpd bus_master cap_list ethernet physical tp 10bt 10bt-fd 100bt 100bt-fd 1000bt-fd autonegotiation    configuration: autonegotiation=on broadcast=yes driver=atl1c driverversion=1.0.1.0-NAPI duplex=full firmware=N/A ip=192.168.1.7 latency=0 link=yes multicast=yes port=twisted pair speed=100Mbit/s    resources: irq:44 memory:c1400000-c143ffff ioport:2000(size=128)   The output for rfkill list all:  0: hp-wifi: Wireless LAN     Soft blocked: no     Hard blocked: no 1: hp-bluetooth: Bluetooth     Soft blocked: no     Hard blocked: no 2: phy0: Wireless LAN     Soft blocked: no     Hard blocked: no 3: hp-wwan: Wireless WAN     Soft blocked: no     Hard blocked: no   I have also searched about the status of the WiFi network being shown as disabled. Somehow everything pointed to the fact that my wireless device is switched off and it can be switched on from Windows only. However, I don't have windows partition and it has just Ubuntu 11.10 so I don't see any point in switching the device on in Windows. Expectation of Exit Time of Brownian Motion from Interval I am trying to solve the following:  Let $W_t$ be a brownian motion and $a,b &gt;0.$  Define $\tau$ to be the exit time of $W_t$ from $[-a,b]$, that is $$\tau = \inf\{t \ge 0\ :\ W_{t}(\omega) \notin [-a,b]\}.$$  Show that $\tau$ is integrable and compute $\mathbb{E}(\tau)$.  I have seen this stated without proof multiple places that $\mathbb{E}(\tau)=ab.$  What is the logical argument that backs up this statement?  How are we guaranteed $\tau$ is integrable? I am trying to get the Linux distro "PIXEL" to install some PPAS for Wine, and I have run into a issue where it will not install because of the following error:   sudo: add-apt-repository: command not found   I am trying to install wine using the PPA add-apt-repository ppa:ubuntu-wine/ppa and I would like some assistance doing so. LEFT OUTER JOIN in LINQ Is the integral $\int_0^\infty \frac{\mathrm{d} x}{(1+x^2)(1+x^a)}$ equal for all $a \neq 0$? Let $a$ be a non-zero real number. Is it true that the value of $$\int\limits_0^\infty \frac{\mathrm{d} x}{(1+x^2)(1+x^a)}$$  is independent on $a$? The idea behind the sum of powers of 2 I know that the sum of power of $2$ is $2^{n+1}-1$, and I know the mathematical induction proof. But does anyone know how $2^{n+1}-1$ comes up in the first place.  For example, sum of n numbers is $\frac{n(n+1)}{2}$. The idea is that we replicate the set and put it in a rectangle, hence we can do the trick. What is the logic behind the sum of power of $2$ formula? Is it possible to transfer Minecraft PE worlds to Minecraft PC? Can I remove a digital signature from a DLL? What happens if I use RAM of a faster speed than the CPU supports? Looking at the  CPU, under Memory types it says "DDR3-1333/1600". My question is, in what way does the CPU limit the RAM speed? What would happen if I put in a DDR3-2133 RAM chip together with the CPU, if the motherboard supports the faster RAM speed? Would it be better to get a RAM chip that is DDR3-1600 so it matches the CPU's listed frequency?