How to make executable file independent of Eclipse
How can I convert my Java program to an .exe file?
Difference between Login Shell and Non-Login Shell? I understand the basic difference between an interactive shell and a non-interactive shell.  But what exactly differentiates a login shell from a non-login shell?  Can you give examples for uses of a non-login interactive shell? Why does the max aperture change when use Nikon 60mm AF-D Micro on D90 camera? I have found that my Nikon 60mm Micro AF-D changes aperture from 2.8 to 3.2 when used with a D90. I have tried both A and M mode. Is it by design? Why?  I intend to buy  and it will lock the maximum aperture at 2.0 (my guess) instead 2.8. So should I buy it or not, or would it be better to buy the newer 50mm 1.4 AF-S version? Let $1, \omega, \dots, \omega^{n-1}$ be the roots of the equation $z^n-1=0$, so that the roots form a regular $n$-gon in the complex plane. I would like to calculate $$ \prod_{j \ne k} (\omega^j - \omega^k)$$  where the product runs over all $j \ne k$ with $0 \le j,k &lt; n$.    My attempt so far  Noting that if $k-j = d$ then $\omega^j - \omega^k = \omega^j(1-\omega^d)$, I can re-write the product as $$ \prod_{d=1}^{\lfloor n/2 \rfloor} \omega^{n(n-1)/2}(1-\omega^d)^n$$  I thought this would be useful but it hasn't led me anywhere.  Alternatively I could exploit the symmetry $\overline{1-\omega^d} = 1-\omega^{n-d}$ somehow, so that the terms in the product are of the form $|1-\omega^d|^2$. I tried this and ended up with a product which looked like $$\prod_{j=0}^{n-1} |1 - \omega^j|^n $$  (with awkward multiplicative powers of $-1$ left out). This appears to be useful, but calculating it explicitly is proving harder than I'd have thought.  The answer I'm expecting to find is something like $n^n$.    My motivation for this comes from Galois theory. I'm trying to calculate the discriminant of the polynomial $X^n+pX+q$. I know that it must be of the form $ap^n+bq^{n-1}$ for some $a,b \in \mathbb{Z}$, and putting $p=0,q=-1$, the polynomial becomes $X^n-1$. This has roots $1, \omega, \dots, \omega^{n-1}$, so that $(-1)^{n-1}b$ is (a multiple of) the product you see above. An expression for $a$ can be found similarly by setting $p=-1,q=0$. 9 rows is just way too small by default. Is this a text-editor for ants? Find the default application for a certain extension Given xdg-open and an extension, is there a way to get the application which xdg-open is set to for that particular extension?  For example given xdg-open and .jpg the result is eog. How do I load an mp4 video with multiple audio tracks into blender? I've recently started using OBS multiplatform to record game play. I currently have it set to record sounds on 2 different tracks. The first for system sounds (like gamesound, mumble, etc.) and the second to record the mic.  I am able to switch between tracks when I play the unedited video using VLC, but when I load the mp4 into blender, I only get track 1.  Did I do something wrong, or does blender vse not support multiple tracks?  Blender after loading mp4:  VLC video information:   UPDATE  For now, it seems like the solution will be to use an external tool to get the second audio track and import it into blender afterwards. A  has been logged with the Blender bug reporting tool.  UPDATE 2  The bug report has been closed/archived with the gist being "not a bug". It has been added to the . If you are looking to have support for multiple audio tracks, I would suggest looking at other video editing software until Blender adds support for this feature. Prove every element of $G$ has finite order. Let $G$ be a group such that the intersection of all its subgroups which are different from $\{e\}$, is a subgroup different from $\{e\}$. Prove that every element of  $G$  has finite order.  Assume that $a$ has infinite order in $G$. Then let $y\neq e$ belong to the intersection of all subgroups of $G$ different from $\{e\}$. Then $y=a^n$ and $y$ will also belong to subgroup generted by $a^2$ hence  $y=a^{2m}$ for some integers $m$. This contradicts that $a$ has infinte order.  Is this correct? When can a sum and integral be interchanged? Let's say I have $\int_{0}^{\infty}\sum_{n = 0}^{\infty} f_{n}(x)\, dx$ with $f_{n}(x)$ being continuous functions. When can we interchange the integral and summation? Is $f_{n}(x) \geq 0$ for all $x$ and for all $n$ sufficient? How about when $\sum f_{n}(x)$ converges absolutely? If so why? How do you find the directory of a command? I've become very accustomed to managing service startups on Redhat/RHEL platforms using chkconfig though that doesn't appear to be the Debian/Ubuntu way - How do I update runlevel information for system services on Ubuntu?  Ultimately looking for the equivalents of:  chkconfig --add &lt;service&gt; chkconfig --level 345 &lt;service&gt; on chkconfig --del &lt;service&gt; Recursively copy files from one directory to another I have all my music in a folder /media/kalenpw/MyBook/Music/ABunchOfOtherFoldersWithFilesInside. I want to copy all of the mp3s to /media/kalenpw/HDD/Music so I used:  cp -R /media/kalenpw/MyBook/Music/*.mp3 /media/kalenpw/HDD/Music   however this only copied the mp3s in the root music folder and did not open any of the artist subdirectories and copy those files.  I was under the impression -R would recursively copy all the files. How can I achieve said goal? I don't do math a long time, so I completely don't remember how to prove that: $$ \sum_{i=1}^\infty \frac{i}{2^i} = 2 $$  Can anybody help me? Why is there a diode connected in parallel to a relay coil? In most electrical circuits with a relay, a diode is connected in parallel to the coil of the relay. Why? Is it always a good practice? How can I have a pointer to the next struct in the definition of this struct:  typedef struct A {   int a;   int b;   A*  next; } A;   this is how I first wrote it but it does not work. I've designed for a campaign a duo of rogues. My character is as , and his follower is a Knife Mistress. Couple of question about them. Our party is about to ambush several . My Sniper will hide near their camp, and shoot the weakest one when fight begins. His follower will then rush the troll and slice him in several pieces. My Sniper has the Bleeding attack feat:  Bleeding Attack (Ex) Benefit: A rogue with this ability can cause living opponents to  by hitting them with a sneak attack. This attack causes the target to take 1 additional point of damage each round for each die of the rogue's sneak attack (e.g., 4d6 equals 4 points of bleed). Bleeding creatures take that amount of damage every round at the start of each of their turns. The bleeding can be stopped by a DC 15 Heal check or the application of any effect that heals hit point damage.  Emphasis mine. Thus, a normal enemy would bleed every turn, until he get cleaned of the bleeding effect. However, troll have a special ability, which is  5 (acid/fire)  Regeneration (Ex) A creature with this ability is difficult to kill. Creatures with regeneration heal damage at a fixed rate, as with , but they cannot die as long as their regeneration is still functioning (although creatures with regeneration still fall unconscious when their hit points are below 0). Certain attack forms, typically fire and acid, cause a creature’s regeneration to stop functioning on the round following the attack. During this round, the creature does not heal any damage and can die normally. The creature's descriptive text describes the types of damage that cause the regeneration to cease functioning.  So, the troll will automatically get rid of the bleeding effect during his first turn. My question is: Does the bleeding effect apply before the regeneration, or get neglected, because the troll will heal during his turn? Am I right to assume that, Bleeding attack effect getting triggered at the beginning of the troll turn, it will deal him the damages before the wounds heals? Allow setuid on shell scripts The setuid permission bit tells Linux to run a program with the effective user id of the owner instead of the executor:  &gt; cat setuid-test.c  #include &lt;stdio.h&gt; #include &lt;unistd.h&gt;  int main(int argc, char** argv) {     printf("%d", geteuid());     return 0; }  &gt; gcc -o setuid-test setuid-test.c &gt; ./setuid-test  1000  &gt; sudo chown nobody ./setuid-test; sudo chmod +s ./setuid-test &gt; ./setuid-test  65534   However, this only applies to executables; shell scripts ignore the setuid bit:  &gt; cat setuid-test2  #!/bin/bash id -u  &gt; ./setuid-test2  1000  &gt; sudo chown nobody ./setuid-test2; sudo chmod +s ./setuid-test2 &gt; ./setuid-test2  1000     Wikipedia :     Due to the increased likelihood of security flaws, many operating systems ignore the setuid attribute when applied to executable shell scripts.   Assuming I'm willing to accept those risks, is there any way to tell Linux to treat the setuid bit the same on shell scripts as it does on executables?  If not, is there a common workaround for this problem? My current solution is to add a sudoers entry to allow ALL to run a given script as the user I want it run as, with NOPASSWD to avoid the password prompt. The main downsides to that is the need for a sudoers entry every time I want to do this, and the need for the caller to sudo some-script instead of just some-script After a table of addresses is geocoded, ArGIS provides information about each geocoded address, among those the "match score" of the candidate to which the address was matched, which ranges from 0 to 100. According to their documentation "The match score is based on how well the locations found in the reference data match with the address data being searched."  It seems intuitive that 100 means an address with the exact name was found in the Address locator and 0 means no such address was found. However, I could not find any information about how exactly this score is calculated, particularly if values are somewhere between the extremes. I this known?  I found the pointer to  in the answer to , but I could not find any information in that paper that would answer the question. What is the best way to randomize an array of strings with .NET? My array contains about 500 strings and I'd like to create a new Array with the same strings but in a random order.  Please include a C# example in your answer. What's a way to implement a flexible buff/debuff system? Overview:  Lots of games with RPG-like statistics allow for character "buffs", ranging from simple "Deal 25% extra damage" to more complicated things like "Deal 15 damage back to attackers when hit."  The specifics of each type of buff aren't really relevant.  I'm looking for a (presumably object-oriented) way to handle arbitrary buffs.  Details:  In my particular case, I have multiple characters in a turn-based battle environment, so I envisioned buffs being tied to events like "OnTurnStart", "OnReceiveDamage", etc.  Perhaps each buff is a subclass of a main Buff abstract class, where only the relevant events are overloaded.  Then each character could have a vector of buffs currently applied.  Does this solution make sense?  I can certainly see dozens of event types being necessary, it feels like making a new subclass for each buff is overkill, and it doesn't seem to allow for any buff "interactions".  That is, if I wanted to implement a cap on damage boosts so that even if you had 10 different buffs which all give 25% extra damage, you only do 100% extra instead of 250% extra.  And there's more complicated situations that ideally I could control.  I'm sure everyone can come up with examples of how more sophisticated buffs can potentially interact with each other in a way that as a game developer I may not want.  As a relatively inexperienced C++ programmer (I generally have used C in embedded systems), I feel like my solution is simplistic and probably doesn't take full advantage of the object-oriented language.  Thoughts?  Has anyone here designed a fairly robust buff system before?  Edit: Regarding Answer(s):  I selected an answer primarily based on good detail and a solid answer to the question I asked, but reading the responses gave me some more insight.  Perhaps unsurprisingly, the different systems or tweaked systems seem to apply better to certain situations.  What system works best for my game will depend on the types, variance, and number of buffs I intend to be able to apply.  For a game like Diablo 3 (mentioned below), where nearly any bit of equipment can change a buff's strength, the buffs are just character stats system seems like a good idea whenever possible.  For the turn-based situation I'm in, the event-based approach may be more suitable.  In any case, I'm still hoping someone comes along with a fancy "OO" magic bullet which will allow for me to apply a +2 move distance per turn buff, a deal 50% of damage taken back to the attacker buff, and a automatically teleport to a nearby tile when attacked from 3 or more tiles away buff in a single system without turning a +5 strength buff into its own subclass.  I think the closest thing is the answer I marked, but the floor is still open.  Thanks to everyone for the input. The  from Goblin Punch states the following:     Hungry Coffin   HD 6 AC 14 Slam 2d6 or 2d8 Swallow 1d6 + swallow   Fly 9 Int 5 Morale 12   It says the Hungry Coffin has "HD 6". This doesn't help me at all, because I still don't know what its average HP is, or how to roll its HP. How do I figure this out? Thanks!