How does a mount from Find Steed act when unmounted?

I have read so many things already that I'm more confused than before. So decided to ask this by myself.  My paladin just got his Find Steed spell, and after some tweaking and talking, he decided to get a Worg and I was okay with it. This last session was his first time using it and I have few doubts when it comes to combat.  I know that while mounted, he uses the mounts movement and actions. But what about when unmounted? What if the combat began with him walking by his mount's side?   Does the mount share his initiative? Are the actions that the mount do, part of the Paladin's actions? Or are they both separately, having his Action, Movement and Bonus Action and then the mounts Action and movement?   We've stated that it can understand him but not talk back, he just telepathically receives feelings as a feedback to his commands, knowing that the mount understood what he needed. Last session he just said things to the mount like "I tell the mount to protect the ranger and the druid" and in case they got hit, it would attack them, but it didn't really do anything at all, as I didn't know when it would act and I had too many things already to remember about the mount.


Find the following limit: $$ \lim_{x\to\infty} \left( (x+2017)^{1+\frac{1}{x}} \: -\: x^{1+\frac{1}{x+2017}} \right) $$    I tried to exchange the infinity to zero by $x:=\frac{1}{t}$ and then use $\lim_{t\to 0^+}t^t=1$, but it doesn't lead to anything, I can't avoid having $\infty-\infty$...    The answer is 2017, as graph showed.


Express $\sqrt{3}\sin\theta - \cos\theta$ as: $a\cos (\theta + \alpha) $  Can someone please explain to me how to go about doing this?


I'd like to delete a question of mine that was downvoted and has close votes, so I flagged it and asked for a mod to delete it but they didn't.  Why can it not be deleted?    I can understand that users shouldn't be able to delete questions and answers that may be useful to others but in this case the community has decided it has no value.  Also, following question edits, the answer with upvotes no longer answers it.


how to block a specific cookie from a specific site

Relevant question, but does not answer my question:  - This is too specific about Google Analytics   I have started getting quite active on StackOverflow recently, so I've been opening fairly many links to , but since I'd need to resize the panels regularly to see the specific code posted in the way the code was intended, I usually end up with some pretty weird configurations for the panels. Because I would prefer not having to resize the windows to a more normal setting every time, I would like to block the window_sizes cookie from jsfiddle, but when I tried googling for how to block a single cookie from a specific site, I could find nothing.  I've also tried checking the settings for both Chrome and Firefox, but neither have the option to block a specific cookie, only to block certain domains.  I'm mostly wondering on how to block this specific cookie in Chrome (which is my default browser), but I think it might also be useful for anybody else having the same problem to also include the methods for other browsers too, if that's possible.


which one of the two is more spread? I want to read out the version number from  but I want to use the one which more people have.  If you know another way to get the latest stable version number from mysql please tell me ;)


Why does the following code for bubble sort give segmentation fault?

#include<stdio.h> #include<string.h> int main(){     char *a[]={"this","is","a","string"};     char temp[100];     for(int i=0;i<3;i++){                                        for(int j=0;j<3-i;j++){             if(strcmp(a[j],a[j+1])>0){                 strcpy(temp,a[j]);                 strcpy(a[j],a[j+1]);                 strcpy(a[j+1],temp);             }         }     }     for(int i=0;i<4;i++){         printf("%s\n",a[i]);     } }   The following code is for bubble sorting the strings.It gives segmentation fault.What is wrong in it?


Let $V$ be a vector space of dimension $n$. Let $\omega\in A_n(V)$. Then for any linear map $T: V\rightarrow V$, $T^\ast\omega=\det(T)\cdot\omega$. Can anyone explain why the last sentence is true?


How do I kill all of just one entity with /kill?

I like to play Minecraft and the bats are annoying and tried doing /kill @e [type = bat] then I pressed enter and all entities were killed. It ruined my world! How do I target the all of bats and ONLY the bats without killing anything else?


Black window flashes then disappears when I start Blender 2.72

I've been looking for a solution to my problem for a few days without finding it, so I'm posting my question here hoping I'm in the right place.  I had Blender 2.68 working very well, and I wanted to switch to version 2.72. Because I have Windows Vista 32-bit, I downloaded the 32-bit .exe file, which installed without problems, but when I try to open Blender, a small black window opens and quickly closes and then nothing.  I don't know what might be causing this, your help would be welcome. Thanks in advance!  Cordially, Fred


removing string duplicates in a list in python

I have a problem in my code where I have the following:  import random Probabilities={'AA':0.2,"TT":0.2, "GG":0.1, "CC":0.1, "AT":0.4} lst=[] klist=[] for i in Probabilities:     lst.append(Probabilities[i]) lst.sort() for i in lst:     for j in Probabilities:         if Probabilities[j]==i:             klist.append(j) jist=list(set(klist)) #klist.append(i) cist=[] cist.append(lst[0]) for i in range(1,len(lst)):     k=lst[i]+cist[i-1]     cist.append(k) p=random.uniform(0, 1) print (p) print(lst) print(cist) print(klist) print (jist)   When I run this I get something like  0.9939409413693211  [0.1, 0.1, 0.2, 0.2, 0.4]  [0.1, 0.2, 0.4, 0.6000000000000001, 1.0]  ['CC', 'GG', 'CC', 'GG', 'TT', 'AA', 'TT', 'AA', 'AT']  ['TT', 'AT', 'CC', 'AA', 'GG']   The part I need to fix is to change the last list printed to not only remove the duplicates, but keep the order of the previous list  So basically instead of    ['TT', 'AT', 'CC', 'AA', 'GG']   I want  ['CC', 'GG','TT', 'AA','AT']   when I do   jist=list(set(klist))   Thanks, A  PS. I am new to Stack Overflow, sorry for anything I may have not made clear/ improper etiqutte, etc.


Proof of the open interval $(-1,1)$ with respect to $*$ is a group

Hi,so I  just can't get my head through the solution for 4th problem.I successfully proved associative law and when I wrote an equation for finding identity element I did get the same thing,but then I don't understand how they get $e(1 - x^2) = 0$. I always get $x + e = x^2e + x$.  I'd appreciate if someone could explain. I understand that logically speaking, it should be $0$.


Error when start to attach mdf - : parameter name: ncolindex actual value was -1 (Microsoft.Sql Server.Grid Control)

Got the following error when first attempted to attach a database     parameter name: ncolindex actual value was -1 (Microsoft.Sql Server.Grid Control)   What does this mean and how do I correct ?


Can sentences end with 'only'? If yes, then in what cases you can or cannot? For example   P2: I have had some problems but overall XYZ has been great.  P1: No, XYZ is a great product  P2: You misunderstood me. I was saying that only. / I was saying only that.


Cap Value for Full Wave Rectifier Circuit

Why do we use a capacitor of specific value and not an arbitrary value for a full wave rectifier circuit?  For example in this circuit diagram below shows a 470uF capacitor so why can't I use a capacitor of 100uF or 1000uF?  How can I pick the correct value? Also what is the significance of capacitor C4?


I'm trying to implement a basic doubly-linked-list using nothing but the primitive types and classes. I was trying to create a doubly linked list where a new element can only be inserted at the end, although it can be deleted from any position, (based on a value that is searched throughout the list). My code is:  import java.util.*;  class node {     int data;     node next;     node prev;      static void insert(node start, int data)     {         node newNode = new node();         newNode.data = data;          if(start==null) {             newNode.next=newNode.prev=null;             start = newNode;         } else {             node t = start;             while(t.next!=null)             t = t.next;             newNode.prev = t;             t.next = newNode;             newNode.next=null;         }     }      static void delete(node start, int data) {         node t = start;         try {             while(t.data!=data)                 t = t.next;         t.prev.next = t.next;         t.next.prev = t.prev;         } catch (NullPointerException e) {             System.out.println("Data NOT found!");             }     }      static void traverse(node start) {         node t = start;         while(t!=null) {             System.out.println(t.data);             t=t.next;         }     } }  public class Main {      public static void main(String[] args) {         Scanner sc = new Scanner(System.in);          node start=null;          int ch=0;         while(ch!=4)         {             System.out.println("\n1. Insert Node");             System.out.println("2. Delete Node");             System.out.println("3. Print nodes");             System.out.println("4. Exit!");             System.out.print("Enter Your Choice: ");              ch = sc.nextInt();              switch(ch)             {                 case 1: System.out.print("\nEnter the value of the node to insert: ");                         int val = sc.nextInt();                         node.insert(start, val);                         System.out.println("DEBUG   :   Start val: "+start.data);                         break;                 case 2: System.out.print("\nEnter the value of the node you want to delete: ");                         node.delete(start, sc.nextInt());                         break;                 case 3: node.traverse(start);                         break;                 case 4: System.out.println("\nBye!!");                         break;                 default:    System.out.println("\nWrong value: Please try again!");             }         }         }  }   I get an error:     Exception in thread "main" java.lang.NullPointerException       at Main.main(Main.java:70)   It appears that the node start that I've defined in main() method doesn't really obtain the value stored by the insert() function. I'm guessing this is due to the fact that the updated value of start in the insert function, i.e., start = newNode; isn't really stored in the start var of the main method. This seems odd however, since in Java, the objects are supposed to retain their changed values given that their addresses are passed to the methods, and any change in the memory locations where the actual data of the object is stored is permanent. So, what is going on here? Am I doing something wrong?!    Here's stdin:     1   1   1   2   1   3   3   2   2   3   4     Here's my output:   Insert Node Delete Node Print nodes Exit! Enter Your Choice:  Enter the value of the node to insert:       on IDEOne.


Why does NavigableSet (which extends SortedSet) declare subSet(E fromElement, E toElement) again?

The interface NavigableSet<E> extends interface SortedSet<E> which declares the method SortedSet<E>   subSet(E fromElement, E toElement) .  However, when I look at , I see that it has declared the same method (with exactly the same signature). I also see that it says it inherits some methods (first, last, comparable) from .  Since by definition, interfaces only contain method signatures, why would any child interface redeclare the same method that the parent interface has already declared (and there's no difference in semantics, in the API javadoc)?  Edit: Came across a relevant and nice discussion here -


Consider the Lie algebra $\text{sl}(2,\mathbb{C})$ (commutator as Lie bracket) with its standard basis consisting of $$e=\begin{pmatrix}0&1\\0&0\end{pmatrix},\quad f=\begin{pmatrix}0&0\\1&0\end{pmatrix},\quad h=\begin{pmatrix}1&0\\0&-1\end{pmatrix}.$$  Define the map $R: \text{sl}(2,\mathbb{C})\rightarrow \text{End}(\mathbb{C}[x,y])$ on the basis as $h\mapsto x\frac{\partial}{\partial x}-y\frac{\partial}{\partial y},~e\mapsto x\frac{\partial}{\partial y},~f\mapsto y\frac{\partial}{\partial x}.$  I want to show that this is a Lie algebra homomorphism where $\text{End}(\mathbb{C}[x,y])$ is equipped with the commutator as Lie bracket. For that I will use the relations $[e,f]=h,~[h,e]=2e,~[h,f]=-2f$.  $R$ is of course $\mathbb{C}$-linear since it is defined as a linear extension.  In order to show $R([A,B])=[R(A),R(B)]$ for alle $A,B\in\text{sl}(2,\mathbb{C})$, it is enough to show this on the basis.  But here is my issue: For example $R([e,f])=R(h)=x\frac{\partial}{\partial x}-y\frac{\partial}{\partial y}\neq 0=x\frac{\partial}{\partial y}y\frac{\partial}{\partial x}-y\frac{\partial}{\partial x}x\frac{\partial}{\partial y}=[R(e),R(f)]$.  What am I doing wrong?


How can I render a composition(s) from the command line?

I've never used the python console before so I only know  commands from the documentation that I've looked up. But I've read that it can be a lot faster than just pressing ctrl+F12 because it doesn't need the GUI.. or something. I looked in other places as well but my brain started to melt from this programming nightmare thing. I also have multiple scenes that needs rendering, so if I could do them one after another, it would be a plus. So if someone could show a command that let's me render my animation(s) in the compositor from the command line, it would be most appreciated!


What is the problem that gets worse after you try to solve it?

Example sentence - This problem is a _____ which gets complicated every time you try to solve it.   Is there such a word that represents a problem which will become worse if/when one tries to solve it?  Note - After seeing the comments and answers I'd like to add that this is not a can of worms or Pandora's box because it doesn't create a new problem but just worsens.   Example: Magic leaves protecting a fruit by enclosing it. Every time a leaf is touched, all the leaves close together further, that is more tight than before.


Options to fix a stripped driveside BB thread- Shimano BB-93

I removed the BB (Shimano BB-93) from my Canondale Trail and found the drive side thread is stripped on BB and frame. See  and  What are the options for me to replace the BB? Is there an alternative part which will reach the good thread or other alternative? I'm aware there could be a machining/welding/tapping option, but would guess that would not be worthwhile on an ageing bike. Are there any alternative parts I could use?  mentions a Velo-orange option that clamps in place, but if possible I'd like to keep my recently replaced Hollowtech II crankset if possible I'm baffled by all the combinations, hoping someone has been down this path already and can suggest if there's a practical solution.


Exactly positioning and aligning objects

I'm trying to get productive with blender. Now I have this challenge I can't solve. I imported parts of a cnc chair I'm designing. Precisely positioning the parts is my goal. How can I do this ?   So I want to go from here:   To here:    In the last screenshot the part look aligned but not exactly :( I tried to figure out snapping but I get the impression that's not gonna cut it, I'd love something like sketchup style moving/rotating/positioning.  I've been also looking into the NP-station add on, I can't get that to work though.  Edit:   Thanks for the answers and replies. It looks like I want/need something like np-station or mesh align plus. Tiny-CAD only seems to work in edit mode (?) while I need to align and position objects. Getting into origin and the 3D cursor was useful too.  But I placing my bets on getting mesh align plus to work for now.


DualBoot Windows 8.1 and Ubuntu 14.04 on SSD + HDD

I have a notebook with 32GB SSD with Windows 8.1 installed and am thinking of installing Ubuntu 14.04 on dualboot, I have done a search online, but I'm still in doubt about which is the best way to install and configure the system so that both work without problems. I saw that some people had problems and as my knowledge is more User level I would like some advice and tips to prevent it.   Incidentally, it is possible to maintain the SSD just for Windows and create a partition on the HD to Ubuntu?   I thank the attention.   PS: My notebook is in this link below:


Ubuntu black screen when booting (after an update). Did typical things to no avail

I have a dual-boot system (Windows and Linux). Windows works fine, but I get a black screen when I try to boot into Ubuntu. I did what I found online, like editing GRUB (tried: nomodeset, nouveau.noaccel=1, noapic noacpi nosplash irqpoll). When I try booting in autorecovery mode, I am stuck indefinitely on a black screen that just says "Loading initial ramdisk ..." What can I do? I am a newbie to Ubuntu so I don't have implicit Linux knowledge yet.


Want to create Record in batch class and there is no record to query in start method

I had one batch class in which i am passing some data required for creating object record.But when i call that batch class from parent class variables are initialized but start method are not called as there is no record to query i also tried with iterable object but not able to do that.My code is as below  global class testBatchClass implements Database.Batchable<SObject>,Database.Stateful{     public List<sObject> sObjectList;     public string objectName;     public String dataList;      public testBatchClass(String objectName,String inputdata){          String listType = 'List<'+objectName+'>';         system.debug('list type value is'+listType);         List<SObject> castRecords = (List<SObject>)Type.forName(listType).newInstance();         this.sObjectList = castRecords;         this.objectName = objectName;         this.dataList = inputdata;      }     global Iterable<SObject> start(Database.BatchableContext batchableContext) {         return new sObjectList{};     }     global void execute(Database.BatchableContext batchableContext, List<sobject> scope){          List<OpportunityRenewal__mdt> mdtList = new List<OpportunityRenewal__mdt>([Select id,Api_Name_of_Fields__c,Sobject_Name__c from TestFileUploadCustomSetting1__mdt where Sobject_Name__c=:objectName]);         List<String> fieldName = new List<String>();         for(OpportunityRenewal__mdt md : mdtList){             if(md.Sobject_Name__c == objectName){                 fieldName = md.Api_Name_of_Fields__c.Split(',');                 break;             }         }         List<String> dataRowsSplit= dataList.split(',');         dataRowsSplit.remove(0);         for(String eachRow: dataRowsSplit){             List<String> splitString = eachRow.Split(',');             sObject sobj = Schema.getGlobalDescribe().get(objectName).newSObject();             for(Integer i=0; i <= splitString.Size(); i++){                 sobj.put(fieldName[i],splitString[i]);             }             scope.add(sobj);         }         if(scope != Null && scope.Size() > 0){             upsert scope;         }     }      global void finish(Database.BatchableContext batchableContext) {} }   Thanks


Viewing reputation notifications on chat.SE shows the wrong favicons

I just got some rep notifications while I was chatting on chat.SE. Thanks to , I have a top bar in chat, so I see something like this:    Now, suspecting that something may be wrong with the script showing it in the chat rooms, I went to the main chat.SE site, and... saw this same error.    To be sure, I spun up an incognito tab, where I don't have any scripts running (because normally I have 20+). And... still shows broken:    Apparently, English Language & Usage is now Stack Overflow en Español, Literature is now Magento, Mythology & Folklore is Network Engineering... Science Fiction & Fantasy and Meta don't seem to have been affected.


Singular or plural following a list of singular items

Here's the sentence:       I know what if, him, his, and will means/mean.


I have Ubuntu as my host OS and Windows 10 inside virtualbox.  I want to access windows C: drive in Ubuntu for some reason.  How to do that?


Are quantum computers just massively parallel computers?

I am a computer engineering major so I do not understand a lot of quantum science but from what I hear about quantum computers, it sounds like they are just massively parallel computers.  In quantum computers there are Qubits which are in a superposition state of 0 and 1. Two qubits are in the states 00, 01, 10 and 11 states simultaneously.   Now let us take a look at a NP-complete problem, . If it is a three variable satisfiability problem, classical computer would have to try every single combination, one after another. (000,001,010...)   But say if my computer has 8 cores I can ask each core to solve for just one of these combinations. So I will get the solution in polynomial time. For a N variable satisfiability problem I need 2^N cores and I will still be able to solve in polynomial time.  My question is, does the quantum computer do just that or is there more to it?  I am learning OpenCL and it utilizes the GPU which has a massively parallel architecture having thousands of cores(kind of). Then can it emulate a quantum computer to a certain extent?


Using sed, awk or grep to split a string with numbers

I have this file:  mmD_154Lbb_e_dxk_83233.orc 154L_bbe_Bddxk_3259.txt 14Lbe_3233.orc m2_154Lbbe_dxk_67233.op mZZ_1A4Lbbe_dxk_32823.op mmD_154Lbbe_dxk_99333.orc mmD_oS154be_dxk_12338.txt   I'm trying to use sed or awk to split the numbers and I don't have solution:  I need out put:  83233 2597 3233 67233 32823 99333 12338   How can I get it to split on each delimiter?  Thanks


How long the homologous arms of the "repair" sequence must be to do homologous recombination?

I am trying to figure out the details of the homolougous recombination in order to be able to insert a certain piece of DNA in the host genome after double strand break.. Does anybody know how long the homology arms of the repair template must be ? Can the left arm be longer than the right one? I have read several papers which have different sizes 90 bp vs kb.. In my case, i am not so much preoccupied by off target but the insertion should occur also on the desired site possibly at high frequency and as fast as possible. Thank you, Paola


Do physicists understand why time slows down the faster the velocity of an object?

Like do they understand the mechanism behind it? Is there a mechanism behind it? (for a lack of a better word) Or is it just thought to be a law without any further explanation?


how many pints cooked cabbage from 3 pounds raw?

How many pints of cooked cabbage should I be able to get out of 2 cabbage heads (about 3 pounds each) ? I am wanting to cook and freeze the cabbage.


Idea: Difficulty Ratings & User Experience levels

First off - I just came up with this idea - It's a spitball - Feel free to contribute (good and bad thoughts).  Reformed idea: Let the questioner mark their thought difficulty, and upvoting and downvoting affect that difficulty - any thoughts?    Idea Some way to separate beginner questions from more advanced questions, or show the level of the programmer's experience in a specific area, to help answer-givers find questions they could help with.  I think it would put in perspective how to better answer questions.  Related ideas for this: Maybe another rating tool for people to vote if they can't solve it (provided they have experience in the particular subject) or something.


The question asks to find the following limit.  $$\lim_{n\to \infty}\left[\frac{\left((n+1)(n+2)...(n+n)\right)^{1/n}}{n}\right]$$  I tried taking $\log$ but I do not think that we get an L' Hopital form after that.  There is another approach that I tried. I rewrote the expression as $$\lim_{n\to \infty}\left[\left(\frac{n+1}{n}\frac{n+2}{n}...\frac{n+n}{n}\right)^{1/n}\right]$$  If I take $\log$ now, won't the limit be 0? The answer in my book is $4/e$.


I used the ressurect command on one of my followers but now they don't act like a follower

My follower Faendal died and I wanted him to still be my follower so I used the resurrect command but now he doesn't let me say "I need you to follow me" and instead he acts like I didn't give Camilla the letter in his favor. How do I make him my follower again?  Edit: He doesn't even let me train in archery.


How to create users for site from a web-form submission?

I have added a webform into site to register a user, now i want users who added their information into form, to become a user of site .


I updated Winamp today from the market and now I'm having troubles playing shoutcast stations and some mp3's. Is it possible to rollback only the update I installed this morning? or am I out of luck?


Restricting user to a single db in postgresql

I've a PostgreSQL Server with 5 db and 2 users: postgres and forge, both with Superuser attribute.  I want to create a third user that can only see and use one and just one of the db and by using it I mean only perform select. I've tried different solutions but seems that the brand new user can access to all the other dbs.  Thank you


During emission spectrum $$\Delta E=h\nu,$$ where $\nu$ is the frequency. All books write that it is the frequency of photon, but photon is a particle and not a wave.  More than that what this frequency actually is? Is it the frequency at which energy packets are released?  This wave and particle nature is causing conflict!  What is the meaning of frequency of photon? I mean it is a particle and not a wave and frequency is a physical quantity associated with a wave.


Prove that $\left\lfloor \lfloor x/2\rfloor/2 \right\rfloor=\lfloor x/4\rfloor$ for all $x$.

This I approached the problem. I let $x = n + e$ where $n$ is an integer and $e$ is a decimal less than $1$ but not less than $0$. I substituted that into the equation to get $\left\lfloor \lfloor (n+e)/2\rfloor/2 \right\rfloor = \lfloor (n+e) / 4 \rfloor $  Then I will try for 4 cases.  case 1: $0 \le x < 1/4$  case 2: $1/4 \le x < 1/2$  case 3: $1/2 \le x < 3/4$  case 4: $3/4 \le x < 1$  Am I allowed to pull the n out of $\left\lfloor \lfloor (n+e)/2\rfloor \right\rfloor$?  If I can then i can simply plug in the cases into $e$, which will give me $0=0$ for all $4$ cases. Is that correct?


The situation is this.. I am performing a photoelectric effect experiment - just the usual - evacuated glass tube containing two metal electrodes connected to an external source of DC voltage (say an alkaline cell) and ammeter in series. I shine a light on one of the electrodes - the frequency is more than enough to cause eject photoelectrons, and the voltage of the cell opposes the electrons which are trying to get to the other electrode. The question is this - what happens to the current on increasing the intensity of light while keeping no. of photons falling on the electrode constant (in other words increasing the frequency)?   Does the current remain the same because the no. of photons falling on the electrode is constant and so no. of electrons being ejected is constant? Or does it increase because the electrons have more kinetic energy, ie, they are moving faster towards the other electrode so that the $t$ (time) term in $I$ = $q$/$t$ is less ($q$ remains constant because no. of electrons being ejected is still the same)?   This question appeared in one of my tests and the answer key says that the current remains constant but think that case 2 is correct and current would increase, which is why I asked this question.  Thanks.


Separate real and imaginary part of $\arccos(z)$

Beginning with  $$i \cos \left[ \frac{1}{n} \arccos \left( \frac{i}{\epsilon} \right) + \frac{m \pi}{n} \right]$$  where $m,n \in \mathbf{Z}$, $\epsilon >0$, $\epsilon \in \mathbf{R}$ and $i$ is the imaginary unit, I would like to obtain separately the real and imaginary part of the cosine argument:  (1)  $$\frac{1}{n} \arccos \left( \frac{i}{\epsilon} \right) + \frac{m \pi}{n} = x + iy$$  By simply applying the :  (2)  $$\frac{1}{n} \arccos \left( \frac{i}{\epsilon} \right) = \frac{\pi}{2n} + i \frac{1}{n} \ln \left[ \frac{1}{\epsilon} (\sqrt{1 + \epsilon^2} - 1) \right]$$  Similarly, if we apply the  of complex $\arcsin$, we obtain:  $$\arcsin \left( \frac{i}{\epsilon} \right) = -i \ln \left[ \frac{1}{\epsilon} (\sqrt{1 + \epsilon^2} - 1) \right]$$  Remembering (as stated ) that $$\mathrm{arsinh}(z) = -i\arcsin(iz)$$ we obtain  $$\mathrm{arsinh} \left( \frac{1}{\epsilon} \right) = - \ln \left[ \frac{1}{\epsilon} (\sqrt{1 + \epsilon^2} - 1) \right]$$  So we can write  $$x + iy = \frac{m \pi}{n} + \frac{\pi}{2n} + i\frac{1}{n} \ln \left[ \frac{1}{\epsilon} (\sqrt{1 + \epsilon^2} - 1) \right]$$  $$x + iy = \frac{\pi}{2} \left( \frac{2m + 1}{n} \right) - i\frac{1}{n} \mathrm{arsinh} \left( \frac{1}{\epsilon} \right) = \frac{\pi}{2} \left( \frac{2m - 1}{n} \right) - i\frac{1}{n} \mathrm{arsinh} \left( \frac{1}{\epsilon} \right)$$  But the correct result should be  (3)  $$x + iy = \frac{\pi}{2} \left( \frac{2m - 1}{n} \right) + i\frac{1}{n} \mathrm{arsinh} \left( \frac{1}{\epsilon} \right)$$  So, are there any errors? How to obtain (3) from (1)?


partial sequences of coin flips converge to uniform$[0,1]$

Let $\{B_i\}$ be iid Bernoulli$(\frac{1}{2})$ random variables and consider the number in $[0,1]$ whose binary expansion corresponds to the infinite sequence $\{B_i\}_{i=1}^{\infty}$, i.e. the number   \begin{align*} \sum_{n=1}^{\infty} 2^{-n} B_n. \end{align*}   Let $X_n$ be the $n^{th}$ partial sum, i.e.   \begin{align*} \sum_{k=1}^{n} 2^{-k}B_k. \end{align*}   Show that $X_n$ converges in distribution to a continuous Uniform$[0,1]$ random variable.   To show convergence in distribution, we can show that the CDF's of the $\{X_n\}$, which we can denote $\{F_n\}$, converge to the CDF of Uniform$[0,1]$, which is $F(x) = x$.  I tried to compute $F_n(x)$, which is \begin{align*} P(X_n \leq x) &= P(\sum_{k=1}^n 2^{-k}B_k \leq x) \\ &= P(\sum_{k=1}^n 2^{n-k} B_k \leq 2^n x)  \end{align*} I don't know how to simplify this expression.  Another approach I took was to compute the characteristic function of $X_n$ and show that it converges to the characteristic function of the uniform$[0,1]$ random variable. After some calculations, this amounted to showing that \begin{align*} 2^{-n} \prod_{k=1}^{n} (1 + e^{2^{-k}it}) \to \frac{e^{it} - 1}{it} \end{align*}  for each $t \in \mathbb{R}$. Again I am stuck here. Can anyone find a slick way to prove this intuitive result?


In Angel Beats, Kanade clearly entered the afterlife before even Yurippe did, yet Otonashi arrived later. Technically, Kanade must've died after Otonashi.  How is it possible that Kanade has Otonashi's heart?


Can we eliminate the comma after "2014" and "Indiana" below? The year and state are not parenthetical, and besides, the comma slows down the flow of the sentence. I think the two sentences below are correct without those commas. Do you concur?  The December 22, 2014 meeting has been canceled. The Gary, Indiana man was arrested on a charge of grand larceny.


Starcraft 2: Do workers (SCVs, probes) lose resources if re-assigned to another job?

Let's say I want to build a refinery with an SCV that's currently mining some of that sweet blue mineral.  Coincidentally, the SCV in question has JUST finished his particular mining run and, while moving him to the geyser, we see that he's holding onto mineral.  At this point in time, which of the following is more efficient / common practice among good players?  (i) Telling the SCV to drop off mineral at the command center before proceeding to build a refinery  OR  (ii) Telling the SCV to start building a refinery right away (i.e., no intermediate drop-off at the command center)  The underlying question is as follows: is an SCV (or probe) capable of "stashing away" his mineral while he building the refinery and collecting the first round of gas?    In other words, will he deposit the mineral (which he had when we reassigned him from mining duty to refinery-building duty) at the command center at the same time that he drops off gas for the first time?  Or does he lose the mineral the moment we reassign him?  (I am not really a Zerg player but the question seems less relevant for Zerg anyways given you'd lose the drone when you construct a building.)


Just for the record, my rims are brand new (~800 km) and clean. I have a set of KoolStop salmon brake pads (actually 2 sets, .... well, front and rear).  I installed them ~600 km ago and I already had to tighten them (adjust the cable tension) twice in the rear, once in the front. And looking at the pads, the rear are obviously thinner than they were when new and same in the front (although less noticable).  The efficiency is still very good but is that kind of wear normal? what is the usual lifespan of pads like those?  I heard only good about KoolStop stuff,... so don't think it could come from the very pads. The installation was done properly too, the pads do not touch the rims at all when brakes are released (~2mm away).


:  ; linear recursion (define (factorial n)   (if (= n 1)       1       (* n (factorial (- n 1)))))  ; tail recusive: ; linear iterative process:  (define (alt-factorial n [counter 1] [product 1]                        (if (> counter n)                            product                            (alt-factorial n (+ counter 1) (* product counter)))))   (* n (factorial (- n 1))) This return statement multiplies the recursive call with n whereas this return statement: (alt-factorial n (+ counter 1) (* product counter)), with the help of a counter and product variable, is able to put all the calculation within the recursive call. Is this what makes it a tail call and is this all there is to it? Does it not matter that it is using variables because the compiler optimizes to simply use the return value in the next call? Sorry if this question is scattered I'm just having a hard time grasping the concept.


Determine whether $L=\{w:|w|_a=2^n+273\text{ for }n\in \mathbb{N}\}$ is regular.

Given the alphabet $\Sigma=\{a, b\}$ and for the next Language $L=\{w:|w|_a=2^n+273\text{ for }n\in \mathbb{N}\}$ determine whether the language is regular.  Firstly, I think this language is regular. And i was thinking about two options of solving this one, But i'm not not sure if i use them correctly.  Lets say i wanna write a regular expression for this kind of language:  $$b^*ab^*ab^*\dots ab^*$$  And i need to repeat it $2^n+273$ times. And altough $n\in\mathbb{N}$, The expression above gives me all the the words that are in language.  Or am i looking at this question the wrong way?


1st occurrence of digital-currency/bitcoin-like technology in scifi

this  asserts the story "Spondulix" by Paul Di Filippo in Sept 1995 issue of Science Fiction Age is possibly the first appearance of a digital-currency/bitcoin-like technology in science fiction. is that about right? are there others?       What was the 1st instance of digital currency in Sci-fi?


Websites on Ubuntu 8.04 LTS with Plesk are infected with viruses

I am running Plesk 9.5 on Ubuntu 8.04 LTS and have about 15 websites infected with some malicious code appended to the end of java files. I have installed Clamav and it has managed to pickup the infected files which have a pattern of starting with either /*km0ae9gr6m*/ or /*gootkitstart*/ and ending  with /*qhk6sa6g1c*/ or /*gootkitend*/    My Plesk panel is up to date and security patches were installed. How can I isolate the security vulnerability on the server?


Parse markdown automatically (just emphasis) without luatex

I want to parse markdown emphasis automatically in XeLaTeX. This basically means converting asterisks either side of a word into the \emph{word} that LaTeX uses. I know that more complex Markdown parsing is impossible, but this seems quite simple. Unfortunately, I don't know how to go about replacing something that is not a command.


how to get the name of a file in C++ using Win32 Handle?

I'm trying to get the name of a file using Win32 handle in C++.  I have two more concerns, the file might be empty (opening the file may not work) and I can't use all the fancy functions (e.g. GetFinalPathNameByHandle) which are supported by Windows Vista and above.   Thanks for the help!


$A \bigotimes \mathbb{Z}_m \cong \frac{A}{mA}$, I need help with tensors!

So, i'm just starting trying to understand tensor products. A basic exercise is given by showing the following equality:  $A \bigotimes \mathbb{Z}_m \cong \frac{A}{mA}$  Well, how about the map $\gamma(a,\bar{x})= ax$ mod $mA$.  And now i'm lost. Can anyone give me some insight please? Thanks!


How do I fix "missing operating system" when Windows partition was marked as biosgrub?

I have a MacBook pro and have downloaded bootcamp Windows 7, and was trying to dual boot Ubuntu. I got it to download and start and went into the installation setup and it asked me to do something with the partitions and I was messing around and accidentally marked the Windows folder as biosgrub.   It then froze and I forced it to shutdown, but when it rebooted, it said missing operating system and I can't boot Windows anymore. I can get into system recovery and can still see the files, but it just won't boot. I could restore OS X and buy another Windows disk, but I was wondering if there was another way.


Installing MySQL 8 on Ubuntu 18.10 failing

I have installed mysql-apt-config package from  the package installed is mysql-apt-config_0.8.13-1_all.deb.   While following solution from  when I run command sudo apt install mysql-server I am receiving this response  Reading package lists... Done Building dependency tree        Reading state information... Done The following additional packages will be installed:   libaio1 libevent-core-2.1-6 mysql-client-5.7 mysql-client-core-5.7   mysql-common mysql-server-5.7 mysql-server-core-5.7 Suggested packages:   mailx tinyca The following NEW packages will be installed:   libaio1 libevent-core-2.1-6 mysql-client-5.7 mysql-client-core-5.7   mysql-common mysql-server mysql-server-5.7 mysql-server-core-5.7 0 upgraded, 8 newly installed, 0 to remove and 0 not upgraded. Need to get 15.0 MB/20.6 MB of archives. After this operation, 159 MB of additional disk space will be used. Do you want to continue? [Y/n]    System is trying to install mysql-server-5.7 & mysql-client-5.7 instead of MySQL 8.   What should I do to resolve this problem?  I am using Ubuntu 18.10 (Cosmic)


How to make wget trust my self signed certificate (without using --no-check-certificate)?

Ubuntu 12.04 OpenSSL 1.0.1 14 Wget 1.13.4   My setup:   create our own CA (our_own_ca.crt) generate a certificate which is signed with the above CA (graphite.local.crt) Concatenate that cert and the CA cert into a bundle file   Nginx configuration:  ssl_certificate /etc/ssl/certs/graphite.local.crt; ssl_certificate_key /etc/ssl/certs/graphite.local.key; ssl_client_certificate /etc/ssl/certs/our_own_ca_chained.crt;   with:  our_own_ca_chained.crt = graphite.local.crt + own_own_ca.crt   To install this CA into the trusted store, according to /usr/share/doc/ca-certificates/README.Debian, I just need to copy it to the /usr/local/share/ca-certificates/, then run update-ca-certificates. Here's the output:  Updating certificates in /etc/ssl/certs... 1 added, 0 removed; done. Running hooks in /etc/ca-certificates/update.d.... Warning: there was a problem reading the certificate file /etc/ssl/certs/our_own_ca.pem. Message:   Extensions not allowed in v2 certificate done. done.   After that, we have something like belows in /etc/ssl/certs:  lrwxrwxrwx 1 root root   17 Mar 11 05:27 99ff557c.0 -> our_own_ca.pem lrwxrwxrwx 1 root root   17 Mar 11 05:27 dc79b3f0.0 -> our_own_ca.pem lrwxrwxrwx 1 root root   50 Mar 11 05:27 our_own_ca.pem -> /usr/local/share/ca-certificates/our_own_ca.crt   then curl worked:  curl -I   HTTP/1.1 302 FOUND Server: nginx Date: Wed, 11 Mar 2015 05:30:30 GMT Content-Type: text/html; charset=utf-8 Connection: keep-alive Vary: Cookie Location: https://graphite.local/account/login?next=/ Strict-Transport-Security: max-age=15768000   but wget does not:  wget https://graphite.local --2015-03-11 05:31:22--  https://graphite.local/ Resolving graphite.local (graphite.local)... 127.0.0.1 Connecting to graphite.local (graphite.local)|127.0.0.1|:443... connected. ERROR: cannot verify graphite.local's certificate, issued by `xxx':   Self-signed certificate encountered. To connect to graphite.local insecurely, use `--no-check-certificate'.   I also tried to use the --ca-certificate but got the same error.  Did I miss something?


Dont know how to connect AC-97, HDAUDIO, and USB connectors to motherboard

I will provide pictures so you guys can see, but basically I recently bought a new case for my pre-built Lenovo k330b. I can't find how I'm supposed to position the connectors. Please help me out with this weird situation. Do I need to get an entirely new motherboard? Is there any adapter I can buy? Any help is welcome. Thank you!


External monitor not working on full resolution with MacBook

I know this problem has been answered before, but I could not make any of the presented solutions work for me. I just bought a Phillips 245B monitor with QHD (2560x1440) so I could run it in native resolution with my MacBook Pro (15-inch, Mid 2010) and its NVIDIA GeForce GT 330M GPU. Unfortunately the maximum resolution that IOS lets me choose is 1080p. I tried already:  Preferences -> Displays -> option-click on Scaled Resetting the PRAM A different Mini Display Port to HDMI adapter (from Gravis) and a Mini Display Port to display port adapter, which resulted in a "no video output" on the monitor. Creating a new EDID file like , which resulted in the monitor staying black.  I hope one of you guys can help me :-) Cheers


OK!  So, I have my (large) single speed in the DC area -- but have just relocated to the LA area. I'm wondering; What is the best and most economical way to have my bicycle shipped across the states?  I'm hopping for an option that is $100 or preferably less.


Show G is a group only knowing associativity, G is finite, and cancellation laws

Let $G$ be a set with an associative operation defined on it.  Assuming $G$ is finite and both cancellation laws hold, show that $G$ is a group.  Is knowing that $G$ is associative under an operation and finite enough to say that it is closed? Also how can I build an identity from this?


Is there always a frame in which spatially separated events are simultaneous?

In relativity, if two events are simultaneous in a specified frame, they cannot be simultaneous in any other frame.   My question is this: given any two events, is there always a frame in which these two events are simultaneous? For example, if I drop a blue ball on one side of a tennis court, and my friend drops a red ball on the opposite side of the court one day later -- from my frame one day later -- is there a frame in which the blue and red balls hit the ground simultaneously?


Rendering colours have changed to purple

I have been rendering my very first animation and all has gone well (albeit very slowly). I had to stop the rendering to do something else and when I started it up again all the rendered images (png) have started to come out purple! Any suggestions please.


Unwanted space after \labeltext with \nameref package

I'm using the \nameref package and I need to obtain a labelled text within round brackets, but it adds some space before the right bracket, while it doesn't add space after the left bracket. Here is the MWE:   \documentclass[a4paper, 12pt]{article}   \usepackage{nameref}  \newcounter{mylabelcounter}  \makeatletter \newcommand{\labelText}[2]{% #1\refstepcounter{mylabelcounter} \immediate\write\@auxout{%   %\string\newlabel{#2}{{1}{\thepage}{{#1}}{mylabelcounter.\number\value{mylabelcounter}}{}}   \string\newlabel{#2}{{1}{\thepage}{{\unexpanded{#1}}}{mylabelcounter.\number\value{mylabelcounter}}{}} }% } \makeatother   \begin{document}   (\labelText{A}{label:textA})  \end{document}   How can I do to avoid the unwanted addition of space before the right bracket?  N.B. adding \hspace{-xpt} doesnt't works as the space added isn't fixed but depends on the type of letter.  Thank you!  Edit: I added the MWE


Dissolve (merge) polygons QGIS based on attribute values only when are adjacent

I am a fairly new user of QGIS having a question regarding dissolve functionality.   I am working with the  provided by EU, which I have imported in QGIS. I have created a new layer with only Denmark and Netherlands as you can see in the picture below.     The corresponding attribute table is the following.    The fields describe the ID and name for each NUTS node, as well as the country code. I have introduced a new attribute field, called Merge_attr.  I have managed to dissolve the polygons with the same attribute value of Merge_attr. However, I would like to dissolve polygons based on the Merge_attr value only when they belong to the same country and potentially only when they are adjacent.  Can we constrain dissolve functionality to only polygons that are adjacent?  This means that the following should not take place (yellow polygons got merged even though not adjacent):


What's the maximum amount of RAM Ubuntu 20.04 can support?

Pretty straight forward I simply want to know the maximum specifications of RAM Ubuntu 20.04 can support.


So I downloaded the iso : ubuntu- 14.04.3 -desktop- amd64 in order to burn it to a USB key to this I used the pendrive which allows me to burn the iso on my key . After that I opened the app Wubi to install ubuntu on my laptop . After install and reboot , I can not seem to open ubuntu on my PC , he wrote me that there is an error on the file whose path is:  /ubuntu/winboot/wubildr.mbr  I do the same steps on my computer and everything is working normally .... :( :( :(  I do not understand why my laptop it does not work ... I tried to reinstall it with other means but the problem persists. And I do not want to erase Windows 10 to put ubuntu .  There is anyone who could help me please ???? :'(   ...


Can you use mods in Civilization V multiplayer?

When I load mods in Civilization V it only has option to start single player game. So is there any workaround or method for loading mods in multiplayer games? I am mostly interested in using some Interface only mods


Why is $\int_{-\infty}^\infty |g(x)|\,dx = \int_0^\infty \mu(\{x : |g(x)| \ge t\})\,dt$ true?

Why do we have the following equality$$\int_{-\infty}^\infty |g(x)|\,dx = \int_0^\infty \mu(\{x : |g(x)| \ge t\})\,dt,$$where $\mu$ is Lebesgue measure?


I am a bit confused when to use, and how to identify the need to use the following transformations: log, quadratic and inverse, in a linear model. Usually the models I'm looking at have around 8-10 quantitative variables. My main issue is that I'm not sure what to look out for. For e.g in log, is the shape of the distribution and skew/kurtosis values sufficient? So if the skew/kurtosis indicates a distribution closer to a normal distribution, then it makes sense to use log on the variable?


Show matrix A is invertible if and only if $a_0 \neq 0$ with $A^n+a_{n-1}A^{n-1}+....+a_1A+a_0I=O$.

Let $A$ be a real square matrix en let $I$ be the identity matrix with the same size. Let $n>0$ be the smallest natural number for which there exist  $a_0,a_1,...a_{n-1} \in {R}$ such that $A^n+a_{n-1}A^{n-1}+....+a_1A+a_0I=O$.  Show that A is invertible if and only if $a_0\neq0 $.  So i need to proof    $A$ invertible $\rightarrow$$a_0 \neq 0$ $a_0 \neq0 \rightarrow$ $A$ invertible    I don't really know where to start with 1, and with 2 I tried to prove it with a contradiction but I don't think it's right either.


Why is "echo" so much faster than "touch"?

I'm trying to update the timestamp to the current time on all of the xml files in my directory (recursively).  I'm using Mac OSX 10.8.5.  On about 300,000 files, the following echo command takes 10 seconds:  for file in `find . -name "*.xml"`; do echo >> $file; done   However, the following touch command takes 10 minutes! :   for file in `find . -name "*.xml"`; do touch $file; done   Why is echo so much faster than touch here?


Let $p$ be a prime. Suppose that $\gcd(a, b) = p$. Find $\gcd(a^2,b)$ for all integers $a$ and $b$.

Let $p$ be a prime. Suppose that $\gcd(a, b) = p$. Find $\gcd(a^2,b)$  for all integers a and b.   I was able to prove that $\gcd(a^2,b^2) = p$ but I don't know if it helps.  Any help is greatly appreciated.


Prove for positive integers a,b,c and d (where b does not equal d), if gcd(a,b) = gcd(c,d) = 1, then a/b + c/d is not an integer

Prove for positive integers $a,b,c$ and $d$  (where $b  \neq 0$ , $d \neq 0$ and $b \neq d$), if $\gcd(a,b) = \gcd(c,d) = 1$, then $\frac{a}{b} + \frac {c}{d}$ is not an integer.  I understand that if $\gcd(a,b)$ and $\gcd(c,d) = 1$, at least one number in each pair is a prime or is $1$. As for after that, I'm totally stumped, could I get some tips, clues, help?


Can a method be overloaded to return different types without a unique parameter list in its signature? In C#

I have two identical methods, one returns a Vector2 and the other a Vector 3. For convenience I'd like to not have different method names.   If I declare a variable like this  private Vector2 to;   ...and call a method that returns a type on it  to = getMousePosition();   I would like it to automatically use the Vector2 method, so it should return a Vector2. I don't know if this is possible however as when I try I'll get this console error  A member `DrawBouncingLine.getMousePosition()' is already defined. Rename     this member or use different parameter types   Which is reasonable enough. But I was wondering all the same.  The method I use looks like this  private Vector3 getMousePosition() {     Vector3 _mousePosition = new Vector3 (Camera.main.ScreenToWorldPoint(Input.mousePosition).x, Camera.main.ScreenToWorldPoint(Input.mousePosition).y, 0);     return _mousePosition; }  private Vector2 getMousePosition() {     Vector2 _mousePosition = new Vector2 (Camera.main.ScreenToWorldPoint(Input.mousePosition).x, Camera.main.ScreenToWorldPoint(Input.mousePosition).y);     return _mousePosition; }


What is the difference between the two pieces of code that follow:

This first one uses asterisk by the other_pipes list: nlp = spacy.load("en") other_pipes = [pipe for pipe in nlp.pipe_names if pipe != "ner"] nlp.disable_pipes(other_pipes)  However this other one doesn't: nlp = spacy.load("en") other_pipes = [pipe for pipe in nlp.pipe_names if pipe != "ner"] nlp.disable_pipes(*other_pipes)  Even so they had similar outputs: First: [('tagger', <spacy.pipeline.pipes.Tagger at 0x2103ab55c88>),  ('parser', <spacy.pipeline.pipes.DependencyParser at 0x2103a84cc48>)]  Second: [('tagger', <spacy.pipeline.pipes.Tagger at 0x222faa86cc8>),  ('parser', <spacy.pipeline.pipes.DependencyParser at 0x222f97bcca8>)]


What aberration causes the common "cross pattern" in astronomy images?

I am trying to understand the origin of the plus/cross-sign aberrations commonly seen for point sources in astronomical images, even ones created with professional-grade, high-quality optics. The one in the image below clearly has some chromatic dependence but its pattern tells me it's not purely chromatic aberration. I can't understand what physical cause gives rise to this particular pattern so commonly.  Thanks.


I have updated my system's hostname in /etc/hostname file as master. I have also mapped my /etc/hosts file like  <ip> master   Still, when I type $ hostname, I get a different hostname.  I basically want to change my hostname from the default one to "master".   What file am I missing out?


Grant external users access to sharepoint external facing site

Can some please tell me how to grant external users access to SharePoint external facing site? I have a SharePoint 2013 Enterprise Standalone server.


I have the following requirements regarding encryption of url parameters. As I am newly to encryption I can not figure out how to perform all steps using some c# library. Can anybody help me with example code to perform this steps? Encrypt Requirements 1 Generate a secret key from the given password. 1) Receive the password which is coupled with the system name. (This is already available) 2) Generate a random nonce in byte-array as the password’s salt which has a length 16-bytes. 3) Set the number of iterations for secret key as 65536. 4) Set the length of secret key as 256-bit (not bytes). 5) Set the algorithm name for key derivation using PBKDF2 with HMAC and SHA-2. 6) Set the algorithm name of key generation as “AES”. 7) Create a secret key with the function of library or tool with all sets above.  2 Encrypt the JSON-string with the above generated secret key. 1) Generate a random nonce in byte-array as the IV (initial vector) which has a length 12-bytes for encryption. 2) Select encrypt mode for the crypto in your function or tool for encryption. 3) Set the name of crypto algorithm which is for AES in GCM mode and without any padding. 4) Set the length of authentication tag for GCM as 128-bits (not bytes). 5) Convert your JSON-string which contains customer information to a byte-array(plainText) with character set UFT-8. 6) Encrypt the plainText with all sets and the secret key in last step to a new byte-array(cipherText)  3 Prefix the generated IV and password’s salt to the cipherText . 1) Create a new byte-array (cipherTextWithIvSalt). 2) Add the 12-bytes IV in cipherTextWithIvSalt at first. 3) Add the 16-bytes password’s salt in cipherTextWithIvSalt after that. 4) Add the cipherText in cipherTextWithIvSalt at last. 5) cipherTextWithIvSalt is now in form “IV + salt + cipherText”  4 Encode the cipherTextWithIvSalt. 1) Encode the cipherTextWithIvSalt to a new byte-array (encodedCipherTextWithIvSalt) by using Base64   Build a displayable encrypted string.  1) Build a new string from byte-array encodedCipherTextWithIvSalt with character set UTF-8.  Thank you in advance!


How Do You Recover An Encrypted Partition?

I was reformatting one of my extra hard drives with Windows DiskPart and accidentally selected the wrong hard drive.   I used the clean command, but it wasn't long before I realized I cleaned the wrong one. I only cleaned the drive, I did not format it or tool with it in anyway.   The drive I wiped had two partitions on it, one was unencrypted and the other was encrypted with TrueCrypt. Is it possible to recover my encrypted partition? I do not have a backup of the header, but I've heard it's possible.   If anyone can shed some light on the situation, or point me in the right direction, it'd be greatly appreciated. Thank you!


NullPointerException When Trying to Use Paint Method In Another Class

I am trying to code up a game where a rectangle moves according to keyboard inputs on the bottom of the screen, and when spacebar is pressed, it releases a bomb implemented by another rectangle being shot up. I have a Bomb class that implements the spacebar initiated bombs. However, whenever I run, I get a nullPointerException error. Code for the two classes is below. Help would be much appreciated.   SuperLeaperPro4000 Class:  package SuperLeaperPro4000;  //need to import this; import java.awt.*; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import javax.swing.*; import java.awt.event.KeyEvent; import java.awt.event.KeyListener;  public class SuperLeaperPro4000 extends Canvas implements ActionListener, KeyListener{ //Declare and initialize timer Timer animator = new Timer(1, this); //Global variable declarations //coordinates of first rectangle int x= 0; int y= 900; //velocity variables of first rectangle int velX= 0; int velY= 0; Graphics g;  public SuperLeaperPro4000() {     //add key listener     addKeyListener(this);     //enable key listener     setFocusable(true); }  public static void main(String[] args){      //create a JFrame named Animation;     JFrame frame= new JFrame("Animation");     //create a new instance of the scribble class     Canvas canvas= new SuperLeaperPro4000();     //set the size of the canvas     canvas.setSize(1000, 1000);     frame.setResizable(false);     //add the canvas     frame.add(canvas);     //make sure window is maxed     frame.pack();     //stop program when closed     frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);     //let the frame be seen     frame.setVisible(true); }  public void paint (Graphics g) {      //draw the rectangle that will move according to keyboard inputs     g.drawRect(x, y, 50, 50);     animator.start(); }  public void actionPerformed(ActionEvent e) {     //update x     if (x+velX>=0 && x+velX<=950) {         x= x + velX;     }     //update y     if (y+velY>=0 && y+velY<=900) {         y= y + velY;     }     repaint(); }  //method that gets called whenever user presses keyboard key public void keyPressed(KeyEvent key) {      //if user presses left arrow key, update left velocity;     if(key.getKeyCode()==KeyEvent.VK_LEFT) {         velX= -1;     }     //if user presses right arrow key, update right velocity;     else if (key.getKeyCode()==KeyEvent.VK_RIGHT) {         velX= 1;     }     //if user presses space, go up;     if (key.getKeyCode()==KeyEvent.VK_SPACE){         Bomb haymaker= new Bomb(x, y, 10, 10, 0, -5);         haymaker.paint(g);     } }  //method that gets called whenever user releases keyboard key public void keyReleased(KeyEvent key) {     //when the user releases the keys, set the velocities back to 0     if(key.getKeyCode()==KeyEvent.VK_LEFT || key.getKeyCode()==KeyEvent.VK_RIGHT) {         velX= 0;     } }  public void keyTyped(KeyEvent key) { } }   Bomb Class:  package SuperLeaperPro4000;  //need to import this; import java.awt.*; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import javax.swing.*; import java.awt.event.KeyEvent; import java.awt.event.KeyListener;  public class Bomb extends Canvas {  //field values int x; int y; int height; int width; int velX; int velY;  //constructor for a bomb public Bomb(int x, int y, int height, int width, int velX, int velY) {     this.x= x;     this.y= y;     this.height= height;     this.width= width;     this.velX= velX;     this.velY= velY; } public void paint(Graphics gs) {     gs.drawRect(this.x, this.y, this.height, this.width); }  public void fire(int velocity) {     this.velX= velocity; }  public int getX() {     return this.x; }  public int getY() {     return this.y; }  public int getWidth() {     return this.width; }  public int getHeight() {     return this.height; }  public int getVelX() {     return this.velX; }  public int getVelY() {     return this.velY; } }


correlation coefficient bivariate normally distributed

Suppose that X,Y and X,Z are bivariate normally distributed. We have  $E(X)=0, Var(X)=10$,  $E(Y)=0, Var(Y)=6$ and $ρ_{xy}=0.87$  Moreover,  $E(X)=0, Var(X)=10$, $E(Z)=0, Var(Z)=4$ and $ρ_{xz}=0.87$  Will also Y and Z be bivariate normally distributed ? (I guess yes) If yes, which is their coefficient of correlation?  Posted also here:   Added after comment of Whuber: Indicating as K the joint distribution of Y and Z,i know from the theory of the problem i'm dealing with that K is for sure a bivariate normally distributed. I expect this will pose some constraint on the value of $ρ_{yz}$


How to set featured image in wp_insert_post

I have a register form with upload field and when the user registers i create a new post. I need to have the uploaded picture on the featured image of the post.  I have see something like this but i don't understand all :s   $upload_dir = wp_upload_dir(); $image_data = file_get_contents($image_url); $filename = basename($image_url); if(wp_mkdir_p($upload_dir['path']))     $file = $upload_dir['path'] . '/' . $filename; else     $file = $upload_dir['basedir'] . '/' . $filename;  file_put_contents($file, $image_data);  $wp_filetype = wp_check_filetype($filename, null ); $attachment = array(     'post_mime_type' => $wp_filetype['type'],     'post_title' => sanitize_file_name($filename),     'post_content' => '',     'post_status' => 'inherit' ); $attach_id = wp_insert_attachment( $attachment, $file, $post_id ); require_once(ABSPATH . 'wp-admin/includes/image.php'); $attach_data = wp_generate_attachment_metadata( $attach_id, $file ); wp_update_attachment_metadata( $attach_id, $attach_data );  set_post_thumbnail( $post_id, $attach_id );   But how to get the image url because the image is not yet sent ...


Calculate $181^{-1} (mod\,29)$. As part of the calculation write $181 * A ≡ B (mod\,29)$ where $A \& B$ between 0 and 28. These are my calculations: $$181 (mod\,29) ≡ 7(mod\,29)$$ $$=>181^{-1}(mod\,29) ≡ 7^{-1} (mod\,29)$$ Because 29 is a prime number, so with fermat's theorem: $7^{28} (mod\,29) ≡ 1$ $$7^{-1} (mod\,29) ≡ 7^{27} (mod\,29) ≡ 7 * 7^{26} (mod\,29) ≡ 181 * 7^{26} (mod\,29)$$ $$A = 7^{26} (mod\,29) = 16$$ $$B = 7^{27} (mod\,29) = 25$$ It was incorrect so I'm hoping someone points out my mistake.


Equivalent of *Nix 'which' command in PowerShell?

How do I ask PowerShell where something is?    For instance, "which notepad" and it returns the directory where the notepad.exe is run from according to the current paths.


I have seen descriptions of the "line with two origins" using quotient spaces. My professor has defined it in an alternate way. However, I can not wrap my head around how the following descriptions forms a line with two origins.   Consider $X=\mathbb{R} \setminus \{0\} \cup \{p,q\}$, that is $X$ is the union of the reals minus $0$, and two points. Consider sets of the type  $U_a = (-a,0) \cup \{p\} \cup (0,a)$  $V_a=(-a,0) \cup \{q\} \cup (0,a)$  where $a >0$. And let  $\mathcal{B}=\{U_a\}_{a>0} \cup \{V_a\}_{a >0} \cup \{ \text{all open intervals of} \hspace{2mm} \mathbb{R} \hspace{2mm} \text{not containing the origin} \}$  Then $\tau=\{\bigcup_{\alpha} B_{\alpha} \big | B_{\alpha} \in \mathcal{B} \}$.  How is this a line with two origins?


The integer part of $\sum_{k=0}^{44}\frac{1}{\cos(k^\circ)\cos((k+1)^\circ)}$

What is the integer part of the number $$\sum_{k=0}^{44}\frac{1}{\cos (k^\circ)\cos((k+1)^\circ)}$$    I tried to solve it using partial fractions but could not get a result. Please help me out.


Getting rid of arc in glasses whilst making it look the bottle is full

I'm trying to create a wine bottle, but I get very unrealistic looking glass results:    , what I want to achieve is something like this:    ,     I fail in the first stage of material. How do I get this? No matter where I light the bottle from, those arc don't go away and the bottle material is very unsatisfactory.     Here is the blend:


I'm trying to create a style using for coloring \ and brackets in code sample (PStricks) using the listings package; I tried using the answer given by Marco Daniel in  using literate for colors in ( ) but, it did not work in my case, as it only colors ( and not ). This is the MWE:  \documentclass{article} \usepackage[T1]{fontenc} \usepackage[svgnames]{xcolor} \usepackage{listings} \usepackage{beramono} \definecolor{colKeys}{rgb}{0,0,1} \definecolor{colIdentifier}{rgb}{0,0,0} \definecolor{colString}{rgb}{0,0.5,0} % Create a personal style colorate \  \lstdefinestyle{mystyle}{%     language=PSTricks,%     texcsstyle=*\color{blue},     keepspaces=true,     basicstyle=\ttfamily\small, %     identifierstyle=\color{colIdentifier}, %     keywordstyle=\color{colKeys}, %     morekeywords={psrotate},     stringstyle=\color{colString}, %     commentstyle=\itshape\color{gray}, %     columns=flexible, %     keywordstyle=[2]\color{Purple}, %     morekeywords=[2]{showgrid,nodesep,linecolor,dotscale,linewidth,unit,showpoints},     deletekeywords=[1]{begin,end,pspicture,endpspicture},%     keywordstyle=[3]\color{NavyBlue}, %     morekeywords=[3]{begin,end,pspicture,endpspicture},     keywordstyle=[4]\color{Orange}, %     morekeywords=[4]{psEllipseTangents},%     extendedchars=true, %     showspaces=false, %     showstringspaces=false, %     breaklines=true, %     breakautoindent=true, %     xleftmargin=0pt,     literate=*{\{}{{\textcolor{NavyBlue}{\{}}}{1}         {\}}{{\textcolor{NavyBlue}{\}}}}{1}         {[}{{\textcolor{NavyBlue}{[}}}{1}         {]}{{\textcolor{NavyBlue}{]}}}{1}         {(}{{\textcolor{NavyBlue}{(}}}{1}         {)}{{\textcolor{NavyBlue}{)}}}{1}% }[tex] % need for \ color \lstset{style=mystyle} \begin{document} First \begin{lstlisting} \begin{pspicture}[showgrid=true](10,10) \psdot(2,4) % a simple dot \psellipse(7,7)(3,1.5) \psEllipseTangents(7,7)(3,1.5)(2,4) \pcline[nodesep=-1cm,linecolor=blue](2,4)(EllipseT1) \pcline[nodesep=-1cm,linecolor=blue](2,4)(EllipseT2) \psdots(EllipseT1)(EllipseT2) \uput[-80](EllipseT1){T1} \uput[115](EllipseT2){T2} \end{pspicture} \end{lstlisting} Second \begin{lstlisting} \pspicture(-0.5,-3.5)(8.5,4.5) \psset{unit=0.75} \psaxes{->}(0,0)(-0.5,-3)(8.5,4.5) \psdots[linecolor=red,dotscale=1.5](2,1) \endpspicture \end{lstlisting}  \end{document}


Can SQL server automatically capitalize words like FROM and WHERE when building a query?

What I would really like is to not have to hit the caps lock button as often as I do for a few key words. I know that many just use lower case only but all of the queries we write at the company I work for do this so it would be nice to not have to worry about it as much.   There are probably other issues that would arise from doing this but I kind of just want to give it a shot for a little while if I can. Thank you.


Why are direct flights more expensive than connecting

I am an American living in Tokyo. I plan to go back to the US (NYC) to visit my family and for Christmas and New Year. Flights from Tokyo Narita to JFK on ANA (return) are $1,400. Of course this is too expensive. However, when I checked flights from Manila to New York, it was $600 return, on ANA's site and using the same NRT-JFK and back $1,400 flights. When I find flights from Tokyo to Manila, they were $500 return (on ANA as well). Sure, $1,100 is less than $1,400, but this is still expensive. Why is this? Also, can I book the MNL-JFK flights for $600 and not get on the flights to and from Manila?


How do I write the symbol x cross in LaTeX. I want the x with a line across the centre point of X. I searched the internet but couldn't get it.    This is a picture of the symbol


How to handle multiple parameters from a user's selection in a checklist menu?

I'm creating script that runs commands based on information from a checklist dialog:  dialog --checklist "Choose what you want to install:" 0 0 0  1 mysql on 2 java on  3 git off 2> tempfile     I have the correct data in tempfile (1 2), but I don't know how to use this data in future in my script.


This sounds like a scam to me, am I wrong?

This was an  about a California startup checking company called Aspiration that pays 1% interest that lets you choose how much you pay in “fees.” Is this garbage? It sounds like garbage.


If $g^2 = e$ for all $g \in G$, then $G$ is abelian

Let $G$ be a group. Prove that $g^2 = e$ for all $g \in G$, then $G$ is abelian. ($e$ is the identity element.)  My Solution: Let $a,b \in G$. Then $a(ab)b = a^2b^2 = e^2 =e$. Now I tried to reverse $ab$ in the brackets to get the same solution to show that the group is also commutative but I was not able to do so.


Printer stopped working after upgrade 16.04 to 18.04

After an upgrade from 16.04 to 18.04 my printer stopped working.  The printer is an Epson E360-dn.  After printing a test page the I get the message Printing followed by Printing Stopped with the Printer's state message saying "Filter Failed".  The printer is network attached.  After reading about similar problems and trying different things (reinstalled cups; sudo aa-complain cupsd then systemctl restart cups.service; deleted printer and reattached as a usb device; dug through the error logs) I am at a loss as to where to go next.  The only error message I can find in /var/log/cups/error_log is an error 32 (Broken pipe)   cindy@Calanthe3:/var/log/cups$ tail error_log     I [08/Oct/2018:17:10:45 +1000] Expiring subscriptions...     D [08/Oct/2018:17:10:45 +1000] [Client 126] con->http=0x5573beab3140     D [08/Oct/2018:17:10:45 +1000] [Client 126] cupsdWriteClient error=0, used=0, state=HTTP_STATE_POST_SEND, data_encoding=HTTP_ENCODING_LENGTH, data_remaining=106, response=0x5573bea747d0(IPP_STATE_DATA), pipe_pid=0, file=-1     D [08/Oct/2018:17:10:45 +1000] [Client 126] Writing IPP response, ipp_state=IPP_STATE_DATA, old wused=0, new wused=0     D [08/Oct/2018:17:10:45 +1000] [Client 126] bytes=0, http_state=0, data_remaining=106     D [08/Oct/2018:17:10:45 +1000] [Client 126] Flushing write buffer.     D [08/Oct/2018:17:10:45 +1000] [Client 126] New state is HTTP_STATE_WAITING     D [08/Oct/2018:17:10:45 +1000] [Client 126] Waiting for request.     D [08/Oct/2018:17:10:45 +1000] cupsdSetBusyState: newbusy="Dirty files", busy="Active clients and dirty files"     I [08/Oct/2018:17:10:46 +1000] Expiring subscriptions...     cindy@Calanthe3:/var/log/cups$ tail error_log     D [08/Oct/2018:17:11:01 +1000] [Client 126] HTTP_STATE_WAITING Closing for error 32 (Broken pipe)     D [08/Oct/2018:17:11:01 +1000] [Client 126] Closing connection.   I tried re-booting from a 18.04 live usb.  I installed the printer with just the default drivers and printing worked out of the box.  Clearly this is related to the upgrade process.  Any ideas of what needs to be reset to defaults or reinstalled for this printer to work?


In The Two Towers, Fangorn describes Gandalf as the wizard with the greatest love of trees. Why would he not think of Radagast in this way?


Connect to SQL Server with Windows Authentication in a different domain

I am trying to connect to a remote SQL Server on a VPN in a different domain. When I enter the Server name on the SQL Server and choose Additional Connection Parameters to add some extra stuff needed by my school:  Integrated Security=SSPI; User ID=DOMAIN\username; Password=Password   I get the following error:     Login failed. The login is from an untrusted domain and cannot be used with Windows authentication.


Bash nested command substitution not working

Hi I have a bash script that intend to run via watch ./script.sh  It's to debug a cooling problem with my laptop, however the script I wrote isn't working as intended.  I'm quite new to bash scripting so I'm sure its something simple.  I have a line in my script that has a nested command substitution but the inner command doesn't appear to work or at least it looks like the inner command doesn't know the value of $i. Any help appreciated.  here's the script:  echo "THERMAL ZONE 2:" echo "Cur Temp: $(cat /sys/class/thermal/thermal_zone2/temp)"  for i in {2..7} do echo "cooling_device$i STATE: $(cat /sys/class/thermal/thermal_zone2/cdev$i/cur_state) TRIP POINT TEMP: $(cat /sys/class/thermal/thermal_zone2/trip_point_$(cat /sys/class/thermal/thermal_zone2/cdev$i_trip_point)_temp)" done   and heres the output:  THERMAL ZONE 2: Cur Temp: 43000 cat: /sys/class/thermal/thermal_zone2/cdev: No such file or directory cat: /sys/class/thermal/thermal_zone2/trip_point__temp: No such file or directory cooling_device2 STATE: 1 TRIP POINT TEMP:  cat: /sys/class/thermal/thermal_zone2/cdev: No such file or directory cat: /sys/class/thermal/thermal_zone2/trip_point__temp: No such file or directory cooling_device3 STATE: 1 TRIP POINT TEMP:  cat: /sys/class/thermal/thermal_zone2/cdev: No such file or directory cat: /sys/class/thermal/thermal_zone2/trip_point__temp: No such file or directory cooling_device4 STATE: 0 TRIP POINT TEMP:  cat: /sys/class/thermal/thermal_zone2/cdev: No such file or directory cat: /sys/class/thermal/thermal_zone2/trip_point__temp: No such file or directory cooling_device5 STATE: 0 TRIP POINT TEMP:  cat: /sys/class/thermal/thermal_zone2/cdev: No such file or directory cat: /sys/class/thermal/thermal_zone2/trip_point__temp: No such file or directory cooling_device6 STATE: 0 TRIP POINT TEMP:  cat: /sys/class/thermal/thermal_zone2/cdev: No such file or directory cat: /sys/class/thermal/thermal_zone2/trip_point__temp: No such file or directory cooling_device7 STATE: 0 TRIP POINT TEMP:


How do you simulate an LCD projector where a lamp projects a patterned light onto a surface? (cycles)(cycles)

I found an answer for Blender Internal engine at   But I want to accomplish something similar in Cycles.  I tried attaching a texture node to the lamp's node tree, but it seems the color pattern is based on the world coordinates and does not rotate with the spot lamp.    What is the correct node setup for a cycles lamp so that its texture rotates and moves with the lamp?


Is there a way to change the input data type?

I'm coding in python and I want to find out whether there's a way to change the data type of an input. I've devised a code to represent my question:         menu= input("test>>> ")     if (menu)==("forprint"):     fortimes= input ("range>>>>")     forprintwhat= input ("print>>>>>")     for x in range (fortimes):         print (forprintwhat)  Now obviously, I get this error: Traceback (most recent call last): File "C:/Users/vas71/AppData/Local/Programs/Python/Python38/leaf.py", line 15, in <module> for x in range (fortimes): TypeError: 'str' object cannot be interpreted as an integer  Note: the error message says 'line 15' because I'm copying it from a larger body of text. My question is, how do I make the string an integer so that my code works? Is it possible? Thank you for the help!


Disclaimer: I'm a starting-level-student.  How do I prove or deny this?  $$\lim_{n\to \infty} \sqrt[n]{2^n - n^2} = 2$$  I have a feeling that this expression doesn't getting closer to 2 but I can't find how to prove this.  I've tried 2 ways:  First -   $$|\sqrt[n]{2^n - n^2} - 2| < \epsilon$$  from the definition of limits, trying to evaluate this expression and deny it but I'm not getting anywhere.  So can I get some help on how to solve this ?


Can I use "and" many times in one sentence?

I was always under the impression I should not use and more than once. I have this text:     I appreciate that all my previous work experience is within office based industries however I am a quick learner, keen and enthusiastic and am looking to change to ensure longevity of career and that the remainder of my working life is spent doing something that I enjoy and that I can feel passionate about.   Are there too many ands in that sentence?


Prove that $ m_{a} \geq m_{g} \geq m_{h} $ using strict inequalities unless $ a = b $.

$ m_{a} = \frac{1}{2} (a + b) $   $ m_{g} =  \sqrt{ab} $   $ \frac{1}{m_{h}} = \frac{1}{2}(\frac{1}{a} + \frac{1}{b})$   Attempted Solution:  I believe I have shown the first step, which is $ m_{a} \geq m_{g} $ but i'm stuck on showing $ m_{g} \geq m_{h} $  $ \frac{a + b}{2} > \sqrt{ab} $  $ (\frac{a + b}{2})^2 > (\sqrt{ab})^2 $  $\frac{a^2 + 2ab + b^2}{4} > ab$  $a^2 + 2ab + b^2 > 4ab $  $a^2 -2ab + b^2 > 0 $  $(a - b)^2 > 0 $   so if $a = b$ we have $(a -b)^2 \geq 0$  Therefore, $m_{a} \geq m_{g} $  Now, i'm not sure if that is correct or not, if not can you please guide me to the complete solution or if I am correct on this part, provide a solution for $m_{g} \geq m_{h} $


How to get permission number by string : -rw-r--r--

I need to set the same chmod, how to get number for -rw-r--r-- ?


Should one use singular or plural form when the number is equivalent to one or negative one?

I understand that for a countable noun, one is supposed to use the singular form if and only if the number is equal to one or negative one; for example:   one degree negative one degree 0.75 degrees   Now my question is, what if the number is not expressed explicitly as one or negative one, but is essentially equal to one? For example, which of the following is correct:   1.0 degree or 1.0 degrees? negative four over four degree or negative four over four degrees?   Edit: I just realised that for the difference between 1.0 degrees and 1.0 degree, it has been answered . However, the question about negative four over four degree or negative four over four degrees remains unclear to me.


Is there such thing as a design pattern for game character attributes?

I'm toying with the idea of a character based game. The characters, robots, monsters, heroes (and weapons I suppose) will all have various attributes as per a D&D game for example.   They player should be able to configure those attributes to personalize their character, so maybe they'll be given 100 points at the start to allocate how they see fit to things like strength, speed, etc...  Also, I'd like the player to be able to add additional options, like maybe shields or individual spells, things like that.   Is there a standard design pattern for things like that?   I'm hacking my way through a prototype right now, and I've been considering an Options  object that accepts an Option in the constructor, with methods addOption() and getOption.  For my implementation of Option I did the following:   class Option{    final String optionKey;   String optionString;   int optionInt;   long optionLong;   float optionFloat;   char optionType;    public Option(String optionKey, Object option){      this.optionKey = optionKey;      if(option instanceOf String){        optionString = (String) option;       optionType = 's';   }else if(option instanceOf int){      optionInt = (int) option;     optionType = 'i';     }else if(option instanceOf long){      optionLong = (long) option;     optionType = 'l';     }else if(option instanceOf float){      optionFloat = (float) option;     optionType = 'f';     }     }  public String getOptionKey(){   return optionKey; }  public String getOptionValue(){   return optionValue; }  public void setOptionValue(String optionValue){   this.optionValue = optionValue; }  public void getOptionType(){   return optionType; }  }   But now I'm thinking this is a bit much, and perhaps I should be using an options class that encapsulates a Hashmap instead. So maybe something like this:   class Options{  HashMap<String, Object> options;   public Options(String key, Object value){     options = new HashMap<String, Object>();     options.put(key, value); }  public void putOption(String key, Object value){      options.put(key, value); }  public void getStringOption(String key){      return (String) options.get(key); }  public void getFloatOption(String key){      return (float) options.get(key); }  //....... and so on...  }   I'm thinking the version directly above is better, is there a standard for this type of thing?


How do computers calculate an angle from its trig value(s)? How did mathematicians calculate them without computers?

If I know sin/cos/tan... of an angle x, how do I know the x without look at the table? How do computers calculate the angle? How the table of sin cos tan was constructed? How the old mathematicians knew this angles without computers?


How to calculate the run rate midway through an over?

Basically the one thing which I know about run rate is,it is calculated by dividing runs scored to number of overs.  But my question is, how to calculate the run rate midway through an over?


Send a parameters to self page with link and get it without page refresh in php

I want a page (showmarker.php) that It is used in Google Maps and Markers:  marker.set("type", "point");     marker.set("id", c);     google.maps.event.addListener(marker, 'click', (function(marker, c) {         return function() {             window.location.href = "showmarker.php?location=" + c;              canter=myLatLng;         }     })(marker, c));   this function active with click on each marker.I want send c parameter to showmarker.php without page refresh and get it with php.Please Help me...


$A^{\perp\perp}=A$ for a closed subspace $A$

This question is essentially the same as , but I have fewer "known" results. (Specifically, the linked Q/A proves that $A^{\perp\perp}=\overline{A}$ for a linear subspace $A$, assuming that $A^{\perp\perp}=A$ for closed $A$ is already known. As far as I'm concerned that's just another way to phrase the problem.)     Prove: If $V$ is an inner product space over $\Bbb C$ and $A$ is a linear subspace of $V$, then the topological closure $\overline{A}$ is equal to the double orthocomplement $A^{\perp\perp}$. Equivalently, if $A$ is a closed subspace, then $A^{\perp\perp}=A$.   To recap the definitions: $A^\perp=\{x\in V:\forall y\in A,\langle x,y\rangle=0\}$, while $\overline{A}$ is the topological closure induced by the norm $||x||=\sqrt{\langle x,x\rangle}$.  The converse to this, $A^\perp$ is closed, is a simple application of continuity of the inner product operation; from this we can deduce $\overline{A^\perp}=A^\perp$ and one half of the goal: $\overline{A}\subseteq A^{\perp\perp}$. I have also managed to prove $\overline{A}^\perp=A^\perp$ by another continuity argument.  If we additionally assume that $V$ is complete (i.e. a Hilbert space) and use the projection theorem (if $A$ is closed then $V=A+A^\perp$), we can write $V=\overline{A}+A^\perp$, so that given $x\in A^{\perp\perp}$ we can decompose $x=u+v$ for $u\in \overline{A},v\in A^\perp$; then $0=\langle x,v\rangle=\langle u,v\rangle+\langle v,v\rangle=|v|^2$, so $v=0$ and $x\in\overline{A}$ as desired.


I have installed ubuntu besides Windows XP and it is using only 5.9 GB of total drive space.  I would like to know how to increase the size?


The tag  has no tag wiki, and SO invites me to help create one.  I've got the reputation.  I think Database-design really needs a tag wiki.  I'd like to help.  But I don't feel quite up to creating a tag wiki on my own for three reasons.  First, I'm not too sure what a good tag wiki looks like, and I don't know the tools that create tag wikis.  Second, the subject of database-design can get quite controversial.  There are experienced professionals that I respect that hold very different and mutually contradictory views on what constitutes good database design.  Third, most of today's database design neophytes are interested in building a database to be embedded in a single application, and to be managed without a DBA.  Most of the classic works on database design were based on the idea of strategic data management spanning multiple departments, multiple applications, one or more DBAs, and several kinds of stakeholders.  The goals of good design are completely different in these two cases.  So I'd like two kinds of help:  First, how do a get skills at building a good wiki?  Second, is there any way several of us could collaborate on a Database-design wiki before launching it on an unsuspecting public?    Edit based on first response.  The most valuable thing I've learned from the response is that the tag wiki should outline the issues more than the answers.  Accordingly, I've come up with a document that reflects my first attempt at describing the issues concerning database design.    I'm not entirely happy with it, but it's not a disaster, IMO.  It's too long, and it's not as clearly bulleted as the C# tag wiki.  Some of that difference may be appropriate. It does clarify most of the issues connected to good database design.  I've left a lot for the closely related data-modeling tag wiki, that doesn't exist yet either.  I'm tempted to go ahead and create the wiki, and post my effort.  After that the community process can correct for my blind spots.  But maybe I should post it here first,  and let the meta discussion give some feedback and correction first.  Opinions?    I've decided to go ahead and post my first effort at a tag wiki for Database-Design.  It will probably be heavily maintained both by me and by others.  But it's a start.  There probably needs to be a parallel effort on a tag wiki for data modeling  (sp?).


What is this green dot near the light in this photo and what's causing it?

Here is the photo:   Is there a name for this effect and is there any way to prevent this from happening? This photo was taken on a Nikon D60 with a Nikkor 50mm 1.8G lens.   The setting were f/1.8 1/40 ISO-400  This is not the same as the question is it normal to get significant lens flare with a 50mm f/1.8 Canon prime lens? as this question is mainly based on what this effect is called, not whether it is normal or not.


Creating a DateTime in a specific Time Zone in c#

I'm trying to create a unit test to test the case for when the timezone changes on a machine because it has been incorrectly set and then corrected.  In the test I need to be able to create DateTime objects in a none local time zone to ensure that people running the test can do so successfully irrespective of where they are located.  From what I can see from the DateTime constructor I can set the TimeZone to be either the local timezone, the UTC timezone or not specified.  How do I create a DateTime with a specific timezone like PST?


Keep trying to update Ubuntu 12.04 but it keeps telling me that my package system is broken. I run apt-get -f install and get this :      owner@MyLaptop:~$ sudo apt-get -f install [sudo] password for owner:  Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... Done The following packages were automatically installed and are no longer required:   thunderbird-globalmenu linux-headers-3.5.0-34-generic   linux-headers-3.5.0-32-generic compiz-plugins compiz-plugins-main   python-compizconfig python-central linux-headers-3.5.0-23   linux-headers-3.5.0-32 linux-headers-3.5.0-34 linux-headers-3.5.0-23-generic Use 'apt-get autoremove' to remove them. The following extra packages will be installed:   indicator-session The following packages will be upgraded:   indicator-session 1 upgraded, 0 newly installed, 0 to remove and 399 not upgraded. 4 not fully installed or removed. Need to get 0 B/75.8 kB of archives. After this operation, 0 B of additional disk space will be used. Do you want to continue [Y/n]? Y dpkg: warning: parsing file '/var/lib/dpkg/status' near line 12465 package 'indicator-session':  `Depends' field, reference to `libcairo2':  `>' is obsolete, use `>=' or `>>' instead dpkg: warning: parsing file '/var/lib/dpkg/status' near line 12465 package 'indicator-session':  `Depends' field, reference to `libcairo2':  version value starts with non-alphanumeric, suggest adding a space dpkg: error: parsing file '/var/lib/dpkg/status' near line 12465 package 'indicator-session':  `Depends' field, reference to `libcairo2': version contains ` ' E: Sub-process /usr/bin/dpkg returned an error code (2)   The details I get from the update manager are:      The following packages have unmet dependencies:  indicator-session: Depends: libc6 (>= 2.3.6-6~) but 2.15-0ubuntu10.10 is installed                    Depends: libcairo2 (>= } 1.2.4) but 1.10.2-6.1ubuntu3 is installed                    Depends: libdbus-glib-1-2 (>= 0.78) but 0.98-1ubuntu1.1 is installed                    Depends: libdbusmenu-glib4 (>= 0.4.2) but 0.6.2-0ubuntu0.1 is installed                    Depends: libdbusmenu-gtk3-4 (>= 0.4.2) but 0.6.2-0ubuntu0.1 is installed                    Depends: libgdk-pixbuf2.0-0 (>= 2.22.0) but 2.26.1-1 is installed                    Depends: libglib2.0-0 (>= 2.26.0) but 2.32.3-0ubuntu1 is installed                    Depends: libgtk-3-0 (>= 3.0.0) but 3.4.2-0ubuntu0.7 is installed                    Depends: libgudev-1.0-0 (>= 147) but 1:175-0ubuntu9.3 is installed                    Depends: libpango1.0-0 (>= 1.14.0) but 1.30.0-0ubuntu3.1 is installed   Any help will be appreciated, Thanks.  EDIT: This is what I get when I run apt-cache policy indicator-session:      indicator-session:   Installed: 0.3.96-0ubuntu1   Candidate: 0.3.96-0ubuntu1   Version table:      0.3.96-0ubuntu1 0         500 http://us.archive.ubuntu.com/ubuntu/ precise/main i386 Packages  *** 0.3.96-0ubuntu1 0         100 /var/lib/dpkg/status


When I am experiencing DDoS @10Gbps, if I have BGP router with 10M table entries in it, can I perform search on the offensive network?  I would do this the way, that first I would remove routing to me for first /8 and see if DDoS will stop. And then search this way the source of the DDoS on the complete 32bit address space.  I am not familiar with BGP a lot, not sure how long it propagates and how long such search would take and what would be impact. Also not sure if I can actually prevent some network stop routing to me by their ip numbers I download from RIPE and Arin.  This is particularly for dealing with spoofed attacks, as normal ones can be traced more effectively.  Or how much bandwidth do I need and no of locations to sustain any kind of DDoS in Europe? I can re-route traffic with Route 53 latency based DNS. Recent disclosed strike I read about was around 13Gbps, would 20Gbps be enough?


Is it possible to get bokeh in cellphone photos?

I have wondered how to get some parts of the image out of focus when using smartphone cameras (or if it can even be done). Recently found out about the concept of bokeh, and am interested in techniques to use it in image composition for cell phone cameras (the typical 8MP low aperture size digicams prevalent in recent Android devices).


What is a good use case for static import of methods?

Just got a review comment that my static import of the method was not a good idea. The static import was of a method from a DA class, which has mostly static methods. So in middle of the business logic I had a da activity that apparently seemed to belong to the current class:  import static some.package.DA.*; class BusinessObject {   void someMethod() {     ....     save(this);   } }    The reviewer was not keen that I change the code and I didn't but I do kind of agree with him. One reason given for not static-importing was it was confusing where the method was defined, it wasn't in the current class and not in any superclass so it too some time to identify its definition (the web based review system does not have clickable links like IDE :-) I don't really think this matters, static-imports are still quite new and soon we will all get used to locating them.  But the other reason, the one I agree with, is that an unqualified method call seems to belong to current object and should not jump contexts. But if it really did belong, it would make sense to extend that super class.  So, when does it make sense to static import methods? When have you done it? Did/do you like the way the unqualified calls look?  EDIT: The popular opinion seems to be that static-import methods if nobody is going to confuse them as methods of the current class. For example methods from java.lang.Math and java.awt.Color. But if abs and getAlpha are not ambiguous I don't see why readEmployee is. As in lot of programming choices, I think this too is a personal preference thing.   Thanks for your response guys, I am closing the question.


Show that $\frac{1}{s-1}+\sum_{n=1}^{\infty}\left[\frac{1}{n^s}+\frac{1}{s-1}\left(\frac{1}{(n+1)^{s-1}} - \frac{1}{n^{s-1}}\right)\right]$ converges when $0<s<1$.  Note that this series is equivalent to $\sum_{n=1}^{\infty}\frac{1}{n^s}$. It might seem counterintuitive that the series converges if $0<s<1$.


To show that differential equation $\lvert{dy\over{dx}}\rvert\,+\mid{y}\mid+1=0 $ has no real solution.

The given differential equation $$\lvert{dy\over{dx}}\rvert\,+\mid{y}\mid+1=0 $$  I don't know how to deal with modulus sign in order to prove the statement  Reference-Different Equations by Shipley L Ross Ch1 Exercise 7(a)


Convert $\frac{d^2y}{dx^2}+x^2y=0$ to Bessel equivalent and show that its solution is $\sqrt x(AJ_{1/4}+BJ_{-1/4})$

I have been following the thread " Convert Airy's Equation $y''-xy=0$  to Bessel equation $$t^2u''+tu'+(t^2-c^2)u$$ " but I can't join the dots to a solve similar equation $y''+x^2y=0$ so as to obtain a solution of the form $$\sqrt x\left(AJ_\frac{1}{4}+BJ_{-\frac{1}{4}}\right)$$ I actually get an equation that looks this way $$t^2\frac{du}{dt}+t\frac{du}{dt}+(t^2+\frac{5}{64})u$$ The above equation can not yield the desired solution. Please help me to clearly see this. Thank you.


How would you approach a shader for a glittery eyeshadow

Something like this. Probably some kind of noise mask with some metallic, low roughness?


how to get unique items from the Arraylist, preserving the natural order

For example ArrayList :   Integer[] intArray = new Integer[] { 0, 1 , 0 , 2 , 3 , 3 , 5 , 6 , -4 ,6 };  ArrayList<Integer> list = new ArrayList<Integer>(Arrays.asList(intArray));   need to get non-repeating values, preserving order  1 , 2 , 5 , -4   0, 3 and 6 are removed because they occur more than once.


Getting Class object from its string name in C#

I'm using C# for developing mobile applications(Monotouch, monodroid). I have a class by this definition:  public class TempIOAddOn : BaseIOAddOn  {     public TempIOAddOn ()     {     } }   And I use this code to access an instance of class by its string name:  BaseIOAddOn tempIOAddOn;             Type t= Type.GetType("TempIOAddOn" );             tempIOAddOn  = (BaseIOAddOn)Activator.CreateInstance(t);   But after executation, t is null.  I tried below code also:  BaseIOAddOn tempIOAddOn;             tempIOAddOn = (BaseIOAddOn )System.Reflection.Assembly.GetExecutingAssembly().CreateInstance("TempIOAddOn" );   But again I face with null. tempIOAddOn is null.  What is wrong with me?


Sort dict values to decending order in Python

I have a dictionary like this.  d = {'"mn': '800"', '"kl': '700"', '"ng': '1100"'}   How to sort this into descending order. like below  ng,1100  mn,800  kl,700


The text in my lstlisting is running out of screen on the right. I googled, but only found problems with the code box's position on the left side, and white lines. My problem is that it does not know when to move text to the next line. All below shows as a single line, where most is outside the frame on the right. Any help is much appreciated. I compile using pdflatex.  \documentclass{article} \usepackage{listings} % Required for insertion of code \begin{document} \appendix \section{Appendix} \begin{lstlisting} This random text is going of screen to the right. This random text is going of screen to the right. This random text is going of screen to the right. This random text is going of screen to the right. This random text is going of screen to the right. This random text is going of screen to the right.  \end{lstlisting} \end{document}


What "finitely generated" vector space means?

Can someone please help me understand the concept of "finitely generated" vector space, I am having a hard time visualizing and understanding it..  Thanks :)


Let $(X, \|\cdot\|_X)$ be a normed vector space and $(X^{\ast},\|\cdot\|_{X^{\ast}})$ its dual space. I have to prove, that  $$ \forall x\in X:\quad \|x\|_X = \sup_{T\in X^{\ast}}\{|T(x)| : \|T\|_{X^{\ast}}=1\}$$  How can I show this using Hahn-Banach theorem?


NullPointer Exception when parsing JSONObject

Getting a NullPointer Exception when running this code:  public class MainActivity extends AppCompatActivity {  TextView textView; String JSONstr; String title; JSONObject weatherInfo;  @Override protected void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState);     setContentView(R.layout.activity_main);     textView = (TextView) findViewById(R.id.textView);      weatherThread weather = new weatherThread();     weather.execute();      Log.d("LOL1","TESTING");      try {         weatherInfo=new JSONObject(JSONstr);         title=weatherInfo.getJSONObject("query").getString("created");     } catch (JSONException e) {         e.printStackTrace();     }   } public class weatherThread extends AsyncTask<Void, Void, Void>{     @Override     protected Void doInBackground(Void... params) {         URL url;         URLConnection urlConnection;         InputStream inputStream;         BufferedReader bufferedReader;         try {             url=new URL("https://query.yahooapis.com/v1/public/yql?q=select%20*%20from%20weather.forecast%20where%20woeid%20in%20(select%20woeid%20from%20geo.places(1)%20where%20text%3D%2208852%22)&format=json&env=store%3A%2F%2Fdatatables.org%2Falltableswithkeys");             urlConnection = url.openConnection();             inputStream = urlConnection.getInputStream();             bufferedReader = new BufferedReader(new InputStreamReader(inputStream));             JSONstr=bufferedReader.readLine();             bufferedReader.close();             Log.d("TEST",JSONstr);         } catch (IOException e) {Log.d("ERROR",e.toString());}         return null;     }      @Override     protected void onPostExecute(Void aVoid) {     }      @Override     protected void onPreExecute() {         super.onPreExecute();     } }   }  This is the link to the JSONObject      https://query.yahooapis.com/v1/public/yql?q=select%20*%20from%20weather.forecast%20where%20woeid%20in%20(select%20woeid%20from%20geo.places(1)%20where%20text%3D%2208852%22)&format=json&env=store%3A%2F%2Fdatatables.org%2Falltableswithkeys   I tried looking at other posts but they had completely different code than mine. The error is coming up around the try catch statement.    Thank you in advance  Edit: Why did you mark this as a duplicate to a question about "What is a null pointer exception". This question is why is it showing up under specific circumstances.


In  , it is written that :     the sum of the residuals within a random sample is necessarily zero, and thus the residuals are necessarily not independent. The statistical errors on the other hand are independent, and their sum within the random sample is almost surely not zero.   But one of our assumptions are $\mathbb E(\epsilon_i)=0$ . Doesn't it imply $\sum\epsilon_i=0$ . If so , then errors CANNOT  also be independent because  Wikipedia says that $\sum e_i=0$ implies residuals are not independent .  N.B : $\epsilon$ denotes statistical error while $e$ denotes residual .   Following this question , another question arises :   In  , in the section of MULTILEVEL ANALYSIS at very beginning it is written that :     The usual assumption is either the sample units themselves or the corresponding RESIDUALS in some statistical model are independently and identically distributed .    But in Wikipedia , they have mentioned RESIDUALS are not independent (i.e., dependent) .  Then how is the assumption "either the sample units themselves or the corresponding RESIDUALS in some statistical model are independently and identically distributed ? "


In The Force Awakens, Poe gives BB-8 the instruction to go as far away as possible. And BB-8 does. So far, so good. But then BB-8 meets Rey and is instantly attached to her, and she isn't able to shake him off. In the end, she just gives in and lets him go with her.  But why? What is BB-8's reasoning? I mean, even much later in the movie, when she takes a walk outside Maz's castle, she finds he's never more than a couple of paces behind her. So, why? What's going on between BB-8 and Rey?  Does he know something we don't?


Is it: Less than/Fewer than 20 percent of the doctors replied.  Thank you.