I'm new to SalesForce. What happens when the Convert button on the Lead Details page is clicked? I've read that   The lead is marked as 'closed'. An Account object is created. An Opportunity tied to the Account is also created.   Where is this workflow documented? Where can I see the code that does it?  How can I intercept or extend this to create/re-parent other objects that need to lose their association to the lead and be associated with the new Account and Opportunity.  When I explore Customize > Leads, there are no validation rules, triggers, assignment rules, processes, or whatnot that would lead me in the right direction (excuse the pun).  I've also explored create > Workflow and Approvals to no avail.  Is this covered in any of the Force.com Workbooks, or perhaps any 3rd party books.  Mucho Puzzled.  Edit (1): I found the following:   which covers the general process.  and this:    This may help someone else looking for the same thing.  Edit (2): Marked as duplicate  I checked the referenced question regarding the order of trigger execution. In the context of this question, I do not care about the order of trigger execution; my question attempts to elicit what changes when a lead is connverted and how the process might be extended. The two links in Edit (1) answer the process side of the question and the mechanism by which the process can be extended.


In these sentences:     "Some (composes/compose) delightful music"   "Some of them (write/writes) wonderful books"     Which form of the verb should I use?


How to send find -exec to output file with {}

I am trying to find and replace text inside several .sas files using find -exec along with sed, but I would like to direct the output to new .sas files named according to the result of the find command (if that makes sense to anyone). Something like this: find . -type f -name "*.sas" -exec sed 's/2020/2021/g' {} > {}_new \; I'm new to Unix, and I've googled this question but couldn't find anything that specifically addressed the issue of naming the new output .sas file using the find command result of {} as a prefix.


Does someone know how to prove this? Let S and T be non-empty subsets of a topological space (X, τ) with S ⊆ T. (iii) Hence show that if S is dense in X, then T is dense in X. (iv) Using (iii) show that R has an uncountable number of distinct dense subsets. I just wanna prove the fourth item using the result of the third. I tried to do it by contradiction, but i don't know what exactly i have to do!


Prove that if $\sum |a_n|^2$ converges then $ \sum \frac{a_n}{n}$ converges

Let $ \{a_n\}\in \mathbb{C}$. Prove that if $\sum |a_n|^2$ converges than $\sum \frac{a_n}{n}$ converges.  Note that this problem is taken from the first chapter on series of a calculus book, so it should be solvable with very basic tools (e.g. the only convergence test introduced was the comparison test and nothing about absolute convergence is assumed).  I have tried a few thing but nothing worked. Could you give me a hint on how to approach the problem?


Is it possible for electromagnetic waves in the Extreme Low Frequency range to carry HQ video and audio signals?

I had just finished this interesting read on a  and was wondering how Brain computer interfaces are touting in the near future to pick up thoughts that might need the same bit rates as HQ video and audio.


I've got problems with installing PHP 5.5.13 (last stable build) on a CentOS 6.5 (64 bit) machine, through yum.   It is not a part of the CentOS, EPEL or REMI repos as far as I can see. I get 5.4.29 with either of those repositories.


printf() function evaluation of pre and post decrements in C

#include<stdio.h> int main() {     int i = 2;     printf("\n %d %d %d \n",--i,i--,i);    //   0 2 2     return 0; }   The output prints 0 2 0 and not 0 2 2.I couldn't understand, as I assumed that the printf() evaluates from right to left.


Is the existence of a right identity and right inverses a sufficient condition for $(G,*)$ to be a group?

I have come across an exercise that I cannot solve and honestly, to me, it doesn’t even seem true.  It goes like this:   Let $G$ be a non empty set and $*$ an associative operation on $G$ such that:   $\exists e\in G:\forall x\in G: x*e = x$ (right identity) $\forall x\in G: \exists y\in G: x*y = e$ (right inverse)   Prove that $(G,*)$ is a group. (Hint: start by proving that $g*g = g \implies g = e$).  I tried to solve this in the following way:  $g*g = g \implies (g*g)*r = g*r \implies g*(g*r) = e \implies g*e = e \implies g = e$ where $r$ is a right inverse of g.  We can actually see that the statements $g*g = g$ and $g = e$ are equivalent.  After this I tried to prove that the statements implied the existence of a left identity and its equality with $e$, but I had no success so far.  Hope you can help and thank you in advance.


I am receiving a message saying I have duplicate sources but I can't seem to find a duplicate of the line described, any ideas?

I receive this meassage when I run sudo apt-get update in the terminal:- Duplicate sources.list entry  precise/partner i386 Packages (/var/lib/apt/lists/archive.canonical.com_ubuntu_dists_precise_partner_binary-i386_Packages)  So i ran the command gksu gedit /etc/apt/sources.list and checked the source to find there was no duplicate, not that I can see anyway. Here is the source:-  # deb cdrom:[Ubuntu 12.04 LTS _Precise Pangolin_ - Release i386 (20120423)]/ precise main restricted deb-src http://archive.ubuntu.com/ubuntu precise main restricted #Added by software-properties  # See http://help.ubuntu.com/community/UpgradeNotes for how to upgrade to # newer versions of the distribution. deb http://gb.archive.ubuntu.com/ubuntu/ precise main restricted deb-src http://gb.archive.ubuntu.com/ubuntu/ precise restricted main multiverse  universe #Added by software-properties  ## Major bug fix updates produced after the final release of the ## distribution. deb http://gb.archive.ubuntu.com/ubuntu/ precise-updates main restricted deb-src http://gb.archive.ubuntu.com/ubuntu/ precise-updates restricted main multiverse universe #Added by software-properties  ## N.B. software from this repository is ENTIRELY UNSUPPORTED by the Ubuntu ## team. Also, please note that software in universe WILL NOT receive any ## review or updates from the Ubuntu security team. deb http://gb.archive.ubuntu.com/ubuntu/ precise universe deb http://gb.archive.ubuntu.com/ubuntu/ precise-updates universe  ## N.B. software from this repository is ENTIRELY UNSUPPORTED by the Ubuntu  ## team, and may not be under a free licence. Please satisfy yourself as to  ## your rights to use the software. Also, please note that software in  ## multiverse WILL NOT receive any review or updates from the Ubuntu ## security team. deb http://gb.archive.ubuntu.com/ubuntu/ precise multiverse deb http://gb.archive.ubuntu.com/ubuntu/ precise-updates multiverse  ## N.B. software from this repository may not have been tested as ## extensively as that contained in the main release, although it includes ## newer versions of some applications which may provide useful features. ## Also, please note that software in backports WILL NOT receive any review ## or updates from the Ubuntu security team. deb http://gb.archive.ubuntu.com/ubuntu/ precise-backports main restricted universe multiverse deb-src http://gb.archive.ubuntu.com/ubuntu/ precise-backports main restricted universe multiverse #Added by software-properties  deb http://security.ubuntu.com/ubuntu precise-security main restricted deb-src http://security.ubuntu.com/ubuntu precise-security restricted main multiverse universe #Added by software-properties deb http://security.ubuntu.com/ubuntu precise-security universe deb http://security.ubuntu.com/ubuntu precise-security multiverse  ## Uncomment the following two lines to add software from Canonical's ## 'partner' repository. ## This software is not part of Ubuntu, but is offered by Canonical and the ## respective vendors as a service to Ubuntu users. deb http://archive.canonical.com/ubuntu precise partner # deb-src http://archive.canonical.com/ubuntu precise partner  ## Uncomment the following two lines to add software from Ubuntu's ## 'extras' repository. ## This software is not part of Ubuntu, but is offered by third-party ## developers who want to ship their latest software. # deb http://extras.ubuntu.com/ubuntu precise main # deb-src http://extras.ubuntu.com/ubuntu precise main deb http://repository.spotify.com stable non-free   I can see there are two lines of deb  precise partner but one has #deb-src at the beginning of it.  Hashed out no?   I'm quite new to linux OS and have little to none sourced editing skills so any help would be most appreciated.  Thank you:)


Does the alternating sum of prime reciprocals converge?

$$\sum_{n = 1}^\infty \frac{(-1)^n}{p_n}$$ where $p_n$ is the $n$th prime.  I have computed this to 10000 rather than infinity. My results suggest that convergence does happen but it's very slow. But I can't even be sure about the first few digits: $-0.26959$?  I have looked at the "questions that may already have your answer" and some of the "similar questions," but they involve somewhat different formulas.


My Overall CPU condition is fine, but one of my processors (the first one) seems to be heavily working (and I can feel that from my fan noise and the heat).    I checked task manager and resource monitor to see which process is taking that much power. Found nothing. I guessed that maybe not all the processes are actually shown in resource monitor so I installed Process Lasso and Process Explorer (both are more or less similar to Windows' resource monitor). Still found nothing. I also set all affinities to 1-7, meaning that all my processes can be start on all my CPUs except the first one. Yet, there is a huge load on my first CPU.    By some research, I found that it may be the case that my first CPU's clock is somehow set to be really high, which I guess, means more power consumption, more fan speed and more heat (I don't have a concrete knowledge about the clock, so not sure if my guess is really correct). Noting that my Maximum Frequency in resource monitor, is actually suggesting that my CPU (don't indicates which one) is working with nearly 130% of maximum frequency (= boost speed/base speed *100 = 3.6/2.6 *100 = 138 %) or my maximum boost speed frequency to be more precise. So I tried to change my maximum processor state to something considerably less than 100% (say 50) to see If there is any difference in heat and noise. Nothing again even after reboot.    My system is dual-boot and I don't have that problem in my other OS (Ubuntu 16.04). No noise or heat.  So here are my questions:   Is my first CPU really working that much? If so, then how it's possible to have such normal average CPU usage (the average is incredibly close tho the mean of all other CPUs)? Why affinity change doesn't made any difference on the CPU usage? The CPU usage of all my processes is less than what is actually is being used. Look at resource monitor picture: I have selected all the processes and now the orange line shows the amount of CPU that is taken by them. I checked the same in safe mode. Orange line, exactly coincides the total usage in safe mode. So I'm suspecting that something is happening in my normal boot. What may be the reason and how I can solve it?   My system is:   Intel core i7 - 4720 HQ  2.6 GHz upto 3.6 Windows 10 (64 bit) NVidia GTX 950 M     PS:   This screenshot, shows the Process Lasso's interface. Those 8 green bars on upper right show my CPU usage. Also the column called Rules, indicates the affinities on the processes.


Can GTA V Online work between Xbox 360 and Xbox One

Can someone on an Xbox 360 play GTA online with people on Xbox One and vice versa? Some guys in a lobby said he was on the 360 playing with me (I have an Xbox one) but I have a feeling he wasn't in the right state of mind. Is it possible?


I am currently working on a project, and i've hit an impasse. I was modeling a tree, and just finished. Then I went and made another one. However the two trees that I made are for some reason the same object. It would be greatly appreciated if I could get help on this matter. Thx!


Mean number of throws to exceed a threshold

Say that you have a die with n faces, and you need to throw the die until the sum of your results exceeds a given threshold. What is the average number of throws needed? I think that to compute that average, you need the probability distribution of exceeding the threshold for a given number of throws, but I can't seem to find any "classical" distribution fitting that description...


why size of a struct with only a bit is 4 byte but not 1 byte

I think it should be 1. Because 1 byte is enough to hold this BOOL. And if I comment "BOOL b:1", it becomes a empty struct, and its size is 1 now.  #include <iostream> #include <string> using namespace std;  enum BOOL { FALSE=0, TRUE=1 }; struct A {   BOOL b:1; };  int main() {   std::cout << sizeof(A)  << std::endl; //output 4. }


My Wordpress (hosted on GoDaddy) was hacked via SQL injection a few months ago. I hired a consultant to help me clean out WP and the site is functioning back to normal. Unfortunately, as part of the hack, they took over my SMTP server and sent out a ton of spam mail.   Now, whenever I send email to a new address, it immediately bounces back as 552: Message rejected for spam or virus content. It should be noted that to addresses that I used to mail before (friends, colleagues, etc), the messages get through just fine. It's only when I try to contact people that have never received a message from me. I am assuming that this is related to my domain being blacklisted as a spam provider.   Some basic research indicated that this message might be specific to GoDaddy and I might need their help. Some sites even suggested leaving GoDaddy altogether. I doubt that would help in my scenario because the spam email was tied to my domain name, so I think my overall domain name is "bad".   What are some of the steps that I can take to try and get my domain off any blacklists? Is there a way for me to verify that my domain has been blacklisted? I really haven't dealt with anything like this before and just want to be able to send email from my domain again.


Have a US felony but want to visit the UK

Back in June 2007 I was sentenced to 9 months jail time and 3 years probation for a felony (soliciting to promote prison contraband) and a misdemeanor(possession of marijuana).  I want to visit London specifically in 2020, but am worried that with my record I could be turned away.  Even though I'm from the US, should I get a visa?  Don't really want that extra cost, but I don't want to be turned away either.


Where is the mistake?  Statement: For $n\in \mathbb{N}_{0}$ is $2n=0$.  Bais: Show that the basis holds for $n=0$ : $2*0=0$.  Assumption: The statement is valid for all $k\leq n$ : $2*k=0$ for all $k \leq n$  Inductive Step: For $k = n+1$ is $k=a+b$ for two natural numbers $a,b \leq n$. It is $2(n+1) = 2a + 2b = 0+0=0$.  It is obviously wrong. I have a few ideas but I would like to be sure where the exact mistake is.  The first thing I noticed was that in this equoation $2(n+1) = 2a + 2b = 0+0=0$ the left side $2(n+1)$ is always positive but the right side isn't.  I cant find a mathematical mistake here so I thought the Assumption is wrong. I always thought the Assumption is valid for a specific n. It is is indeed freely selectable but specific. Is that right and is that the problem with this induction?   If it isn't - maybe it might be the fact that there aren't two natural numbers below 1 that $ a+ b =k$ and thet you cant use the assumption two times?


I recently found my old Raspberry Pi laying in a drawer and I took a look at it. I noticed that the conductor traces are in a zigzag form.    What's the reason behind this? Especially because there's plenty of space to just make a straight trace.  I am sure there has to be reason for this because I have never noticed this on the PCBs I deal with at work.


What is wrong with this bijection from all naturals to reals between 0 and 1?

I will use binary.  I claim to have a bijection $f \colon \mathcal{N} \to \left[ 0, 1 \right)$ where $\mathcal{N}$ is the set of natural numbers $\left\{ 0, 1, 10, 11, 100, \dotsc \right\}$ as follows:  $$ \begin{array}{l|l} x \in \mathcal{N} & f(x) \in \left[ 0, 1 \right)\\\hline 0 & 0.0 \\ 1 & 0.1 \\ 10 & 0.01 \\ 11 & 0.11 \\ 100 & 0.001 \\ 101 & 0.011 \\ 110 & 0.101 \\ 111 & 0.111 \\ 1000 & 0.0001 \\ \hspace{.6em}\vdots & \hspace{.9em}\vdots \end{array} $$  It's basically the .  I claim to have everything on this list.  Diagonalization?  Go ahead!  Constructing a number that differs from $f(i + 1)$ in its $i$-th fractional digit yields $0.11111\!\ldots = 0.\overline{1}$ which is $1$, and that should not be on the list anyway!  Why does this not work? I think it has something to do with integers supposedly not having infinite digits, while reals supposedly do.


! LaTeX Error: File `scrartcl.cls' not found. - TeXworks

Hye, I am new to Latex and using TeXworks software for document generations. It is working properly for simple article class but as soon as I added \documentclass{scrartcl}, it started giving me above error. I downloaded scrartcl.cls and added it in the same path where article.cls was but it is still not working. Both class files are currently in ..\MiKTeX 2.9\tex\latex\base. Any suggestions?


Creating Digital Elevation Model from Contour Data using QGIS?

In ArcGIS I used to create DEMs from contours with ease. However, we recently opted to stop using ArcGIS (for various reasons), and switching to QGIS.    The reason I use contour data is it is all that is available to me from our surveyor general (20m contour lines).    How can I convert them into DEMs?  There is no step by step GUI tut for GRASS on the matter, GDAL only uses point data, and IDW Interpolation does not produce a good quality DEM either.


Is complement of open dense set measure zero in $\mathbb{R}^n$

We are given an open set which is dense in  $\mathbb{R}^n$ is it necessary that its complement has measure zero?


I tried to convert html to plain text with the following function but still getting error while converting.   private static string HtmlToPlainText(string html)         {             const string tagWhiteSpace = @"(>|$)(\W|\n|\r)+<";//matches one or more (white space or line breaks) between '>' and '<'             const string stripFormatting = @"<[^>]*(>|$)";//match any character between '<' and '>', even when end tag is missing             const string lineBreak = @"<(br|BR)\s{0,1}\/{0,1}>";//matches:
,
,
,
,
,
             var lineBreakRegex = new Regex(lineBreak, RegexOptions.Multiline);             var stripFormattingRegex = new Regex(stripFormatting, RegexOptions.Multiline);             var tagWhiteSpaceRegex = new Regex(tagWhiteSpace, RegexOptions.Multiline);              var text = html;             //Decode html specific characters             text = System.Net.WebUtility.HtmlDecode(text);             //Remove tag whitespace/line breaks             text = tagWhiteSpaceRegex.Replace(text, "><");             //Replace
 with line breaks             text = lineBreakRegex.Replace(text, Environment.NewLine);             //Strip formatting             text = stripFormattingRegex.Replace(text, string.Empty);             text = text.Replace(">", "");              return text;         }   when I tried to debug the code it display \r and \r\n also in plain text output.This function is not properly convert the html to plain text. Can anyone suggest me any other conversion function?  Thanks


Why does copying the same amount of data take longer if spread across many separate files?

I noticed that copying 24Mb worth of data from one folder to another took about 30 seconds because (I'm assuming this is the reason) it was over 1,000 separate files. Copying 24Mb shouldn't take so long. Why does the number of files make a different?  I'm running Windows 7 on a MacBook (4GB ram, Intel(R) Core(TM)2 Duo CPU P7450 @ 2.13GHz, 32-bit Operating System)  EDIT: NTFS is the file system used on the drive


I would like to know the equipment and the step by step process, as I have already tried to do it, but it didn't work.  I have already watched several videos, but it is not the same to talk to someone that really loves, and knows how to do it. I don't know anybody that knows how to brew anything xD


I was preparing for an area exam in analysis and came across a problem in the book Real Analysis by Haaser & Sullivan. From p.34 Q 2.4.3, If the field F is isomorphic to the subset S' of F', show that S' is a subfield of F'. I would appreciate any hints on how to solve this problem as I'm stuck, but that's not my actual question.  I understand that for finite fields this implies that two sets of the same cardinality must have the same field structure, if any exists. The classification of finite fields answers the above question in a constructive manner.  What got me curious is the infinite case. Even in the finite case it's surprising to me that the field axioms are so "restrictive", in a sense, that alternate field structures are simply not possible on sets of equal cardinality. I then started looking for examples of fields with characteristic zero while thinking about this problem. I didn't find many. So far, I listed the rationals, algebraic numbers, real numbers, complex numbers and the p-adic fields. What are other examples? Is there an analogous classification for fields of characteristic zero?


Was Ned Stark actually a good swordsman?

Inspired by this question (), the OP mentions Ned in a way that he thinks Ned is a great swordsman. I don't recall anything from the books or show that indicate anything at all about his swordsmanship, he's usually talked about it terms of his honor, or skill as a commander.  Aside from vague "we were great once, Ned" comments from Robert (and weren't we all great in our youth? :) ), what evidence do we have that Ned was notable as a swordsman?


Python - Compiling/ securing as standalone executable

I'm rather new to Python, though hope to use it for both programming and scripting.  I've written basic scripts, and did some digging for compiling.  I'm currently using py2exe (With a different setup.py script someone else made) so that it becomes ONE simple .exe, without dependencies (python DLL, etc.)    You're probably wondering what my problem is.  Well, I decided to check the security of the executable, and view it in Resource Hacker.  I was able to view all the parts of the script I DIDN'T want people to be able to find out.  (Ex: Password inputs).    Can anyone give me a simple, working method, for converting PYTHON code to a STANDALONE executable that CANNOT allow viewing of the original python script via something like Resource Hacker?   I am not thoroughly knowledgeable in the field.. I'm also not developing commercially (Yet), I just want to make things for myself, that I may also make for other people.. Though I might freelance for random people online doing things.  Anyways point being, if I had a script where it prompted you for a password, and if you got it correct it continued, else, it cancelled and exited.... then once I make it a .exe, opening in Resource Hacker, and viewing the "Python Script", I scroll to the bottom, and bam! It shows the passwords.  Now when I say I'm new, I mean, really REALLY new.  Anyways, if you don't mind explaining, "Encryptions", "Hash's", etc... I would prefer to be enlightened towards these subjects.'   Your help is appreciated.


Nullpointerexception when retrieving bson document from Mongodb and adding to a Arraylist

Below is the code to retrieve last 10 posts from DB and return a List.  I am facing Null Pointer exception at posts.add(doc) line.  Am I doing anything wrong?  public List<Document> findByDateDescending(int limit) {      List<Document> posts = null;     Bson sort = Sorts.descending("date");     MongoCursor<Document> cursor =  postsCollection.find().sort(sort).limit(limit).iterator();     try{         while(cursor.hasNext()){             System.out.println("Whats wrong with code");             Document  doc = cursor.next();             System.out.println(doc);             posts.add(doc); ----Null pointer exception         }     }     finally {        cursor.close();     }     return posts; }


Handling 'underscores' and special characters in latex listing package

How to handle the 'underscore' and the special character in latex listing. I am working on a simple prolog style code   \begin{lstlisting}[label=LE, name=R_E]     $\alpha_{1}$ = *M1*  °h1°(^A^, ^B^) :- °b1,1°(^B^, ^A^), °b1,2°(X).     $\alpha_{2}$ = *M2*  °h2°(^A^, ^B^) :- °b2,1°(^B^, ^A^), °b2,2°(X). \end{lstlisting}   This produces an output as shown below:     Below is my latex listing command:  \lstset{language=Prolog, numbers=left, numberstyle=\scriptsize, numbersep=3pt, basicstyle=\scriptsize \ttfamily, tabsize=3, captionpos=t, stepnumber=1, frame=lines, breaklines=true, showspaces=false, commentstyle=\scriptsize\ttfamily \color{mygreen}, moredelim=**[is][\color{vc}]{°}{°}, % To use text color inside a listing, we use a dilimiter moredelim=**[is][\color{kw}]{*}{*}, moredelim=**[is][\color{darkgreen}]{^}{^}, %moredelim=**[is][\color{cyan}]{<?}{?>}, keywordstyle=\color{cyan}, morekeywords={type,value,href,xmlns,owl,/owl,rdf,/rdf,date,source,start,id,name,language,as, refersTo}, morecomment=[s]{<!--}{-->}, morecomment=[s][\color{grey}]{<<}{>>} escapeinside={}  }   But its not printing the character 'α' nor the underscore next to it. Similaryl, also next to 'h' and further 'b'


A question about compact and complete metric spaces

I have a question about compact and complete metric space.  These two concepts how related to each other.   Is  compact metric space complete?  If the question is elementary I apologize you.    Thank you.


Proof Involving Factors Of Arbitrarily Large Numbers

For prime $p$, show whether $$\prod_{p \geq 1} p^{\lfloor \frac{x}{p-1} \rfloor} \sim x!$$ as $x$ approaches infinity, and   explain.   I don’t know that it’s true, but I thought that it followed, if perhaps somewhat indirectly, from the fact that an arbitrarily large positive integer has, on average, 1 factor of 2, $1/2$ factors of 3, $1/4$ factors of 5, et cetera, so the product of the integers should approach the product of the approximations.


Can't shrink drive to create a partition greater than 30gb on windows 7?

I have windows 7 and want to install ubuntu alongside it. I have a 1tb hard drive and when I go into disk management it says by c drive (I only have one drive) has 670gb of free space. I want to shrink 132gb for ubuntu but on the window where I choose how much I want to shrink it says "Size of available shrink space in MB: 30885" which is about 30gb. The there is a message at the bottom of the window that says "You cannot shrink a volume beyond the point where any unmovable files are located. See the "defrag" event in the Application log for detailed information about the operation when it was completed."  Does this mean I can only reserve at most 30gb for ubuntu even though I have 670gb of free space on my c drive, is there any way to fix this without reinstalling windows 7?


I need help in folloving lemma.  Lemma: Any product of $k$ commutators is expressible in the form $a_1^{-1}a_2^{-1}...a_{2k}^{-1}a_1a_2...a_{2k}$  I guess author means that any product  $[x_1,y_1][x_2,y_2]...[x_k,y_k]$ can be expressible in that form $a_1^{-1}a_2^{-1}...a_{2k}^{-1}a_1a_2...a_{2k}$ where $[x_i,y_i]=x_i^{-1}y_i^{-1}x_iy_i$.  I tried to prove it by induction on $k$ but I failed.  If anyone can prove it,I would be thankful.


Prove that a group generated by two elements of order $2$, $x$ and $y$, is isomorphic to $D_{2n}$, where $n = |xy|.$

I am completely stuck at the question     Let $G$ be a finite group and let $x$ and $y$ be distinct elements of order 2 in $G$ that generate $G$. Prove that $G \cong D_{2n}$, where $n = |xy|.$   I have proved that     Let $x$ and $y$ be elements of order 2 in any group $G$. If $t = xy$ then $tx = xt^{-1}$.   Can I get some hints?


Populating second level dynamic HTML content based on first level dynamic HTML content using jQuery

I have three different divs, div 1, div 2 and div 3.  Step 1: I will display few pre-defined number of buttons in div 1 which when clicked, will populate dynamic content into div 2.   Step 2: This dynamic HTML content contains few random number of buttons which when clicked should show their respective content in div 3.  I am using String Template 4 to populate these html files. So I have means to get the necessary information into page and also identify each button by a unique identifier. Since Step 1 deals with pre-determined number of buttons, I have individual actions defined for each button and I am able to show their respective dynamic content. However to identify Level 2 button click actions, I am grouping them together with a common class name eg: "dynamicbuttons".  However I am unable to register the action to display any kind of content in div 3.   Here's my jQuery sample code:  $(document).ready(function() {     $('#button1A').on("click", function(event) {         $('#div2').html("
 This is normal div 2

<input type='button' id='button2' class='dynamicbuttons' value='Button 2'>");         $('#div2').show();     });     $('#button1B').on("click", function(event) {         $('#div2').html("
 This is heavily populated div 2

<input type='button' id='button2A' class='dynamicbuttons' value='Button 2A'>

<input type='button' id='button2B' class='dynamicbuttons' value='Button 2B'>");         $('#div2').show();     });     $('.dynamicbuttons').on("click", function(event) {         $('#div3').html("
 This is div 3
");         $('#div3').show();     }); });   I have created a jsfiddle with my scenario here :   Can someone provide me any pointers on how to solve this problem?


if...else...if statement (command not found error)

Can someone tell me what is wrong with this loop?    The error that I have is on the line 107 (first line of the loop). It says:      [V2016057174800: command not found.    I am trying to associate two the same filename from two different documents (if that makes sense).


How can I bring gnome sticky note back in unity?

If I'm right, panel applet is no longer supported in Unity. How can I bring sticky notes back? Is there any application or AppIndicator that has the same functionality (like show all notes when logged in)?  Not tomboy please :), I don't like its interface.


How do I reference the current directory inside a terminal command file?

I'm creating a .command file (with macOS) that I want to be able to drop into any folder and have it create a .txt file relative to what ever folder it exists in.  Eg.  cd . echo -e "write this to the log" >> log.txt exit   The above doesn't work though. I've also tried cd pwd.   Is this possible to do?


Massive overlap between sites regarding Linux

A question about Linux could belong on these sites on the StackExchange network:   unix.stackexchange.com superuser.com, if it is about using software rather than programming AskUbuntu.com, if it is about Ubuntu serverfault.com, if it is about professional infrastructure maintenance stackoverflow.com, if it is about   a tool mainly used for programming OR shell scripting    So technically, a question about simple shell scripting to create a firewall on Ubuntu could belong on any of those 5 sites.  This is likely to lead to many questions being asked on multiple sites, and scattering of questions amongst these sites, making it harder to find questions that already exist when searching one of those sites.  What can/should we do about this?  In particular, should we comment on questions that seem to be unlikely to be answered, to suggest that they should be deleted by the asker and reposted on what we think is "the most appropriate site"? Should we flag them for migration? Should we allow questions to appear on multiple sites (a perennial proposal)?


Is the fabric of space time a real thing?

With ny limited intelligence I think Einstein said that the gravity is caused by a curvature in spacetime.But unless there is an actual feelable fabric(or someting similar) how is a curvature caused by an object transmitted through free space ?And if there is in fact such a medium would I "fall" into the curvature caused by the sun if I were anywhere near it(I assume I dont have enough mass to orbit the sun like planets do).


trying to prevent ddos with cisco pix 501

I'm getting dos on a dedicated server with windows+apache, ive asked support to install a firewall and got a cisco pix 501, the attacks are on port 80 to a certain site, what can I do to block it?  I thought of putting a cap on amount of connections Disallowing access for certain ip ranges (the attackers use mainly ukraine and india)  Any ideas?  more than that, how do I do it with the cisco? any command lines would help


Is there an idiom for "looking for something in the wrong place"?

I want to express how someone might have an unfulfilled social need and seek to satisfy it in the wrong place. For example: someone has a romantic social need yet seeks for it to be satisfied from a popular, professional Twitch streamer; or someone has a friendship social need yet seeks to satisfy it with their therapist, which is inappropriate/unprofessional. Is there a common idiom that describes something like this? Or can you come up with one? I came up with "looking for an orange in an apple orchard", but I'm not sure if it captures what I want to say. (also, I read the responses to , , and , but they don't have the nuance I'm looking for). Thanks in advance!


How do I mock a C++ class with destructor resource deallocation?

I'm trying to mock out a C++ class for testing using Google mock. That class allocates shared memory resources in the ctor, and deallocates them in the dtor. But my mock doesn't need or use those resources.  I can provide a different, protected ctor which doesn't allocate the resources, and this doesn't alter the other already existing ctors. But the dtor will still try to deallocate which fails miserably.  I'm looking for suggestions. I can alter the code under test, I have the source and it's our code. But I'd prefer to alter our production code as little as possible, for 2 reasons: 1) I don't want to risk changing the behaviour so much that I'm not really testing the same code, and 2) this pattern of ctor alloc/dtor dealloc likely occurs many, many time throughout the code and any changes I make might lead to more and more work.  Over-simplified pseudo c++ code example:  class MyClass : MyBaseClass {     MyClass(int a) : myResource(0) { slowAllocation(myResource, a); }     // dtor dies horribly if myResources isn't a valid resource     virtual ~MyClass() { deallocate(myResource); } protected:     MyClass() : myResource(0) {} // for test     MyResourceClass *myResource; }   Ideas:  A) Alter the dtor so it doesn't dealloc if it's running in test mode. This could be #ifdef'ed out most likely. This might not be too bad, as long as the #ifdef never gets set incorrectly by the build.  B) Stackoverflow faeries vanish my problem before my eyes.  C) Refactor the code, change inheritance and introduce factories such that I can avoid inheriting the dtor code I don't want. I used to write a lot of Java and I'm thinking of the interface/concrete class separation. This could have future benefits too, there are a couple of other cases where I want to derive a class and change the implementation from using a linked list to a concurrent set, but I still have to carry around linked list members (like a head pointer) that I'd no longer use (since I can't un-define data members the way I override methods).  I thought I'd give B) a try, but failing that I'm leaning toward A) - unless the audience sees other problems with that. C) is a lot of work, I'd rather do that only as need case-by-case.  Anyone have experience with a problem like this?


Feature Request: Offical Reputation Rules Page

Reputation doesn't work quite as simply as:     Here's how it works: if you post a   good question or helpful answer, it   will be voted up by your peers: you   gain 10 reputation points. If you post   something that's off topic or   incorrect, it will be voted down: you   lose 2 reputation points. You can earn   up to 200 reputation per day, but no   more. (Note that votes for any posts   marked "community wiki" do not   generate reputation.)   There are rep recalculations, the cap isn't always 200 if things get removed, per day is not clearly defined.  Sure all this stuff is defined in various posts via the meta site. But why not have an official page for the reputation rules? So change it to something like:     Here's how basically it works: if you post a   good question or helpful answer, it   will be voted up by your peers: you   gain 10 reputation points. If you post   something that's off topic or   incorrect, it will be voted down: you   lose 2 reputation points. You can earn   up to 200 reputation per day, but no   more. (Note that votes for any posts   marked "community wiki" do not   generate reputation.) If you want the details of all the ins and outs of reputation, which you probably don't really need to know, see the link:reputation rules.


I would like to ask if it is possible to connect several voltage regulators? For example: . To achieve larger amperes. Here is an example of my scheme.


Capitalize letter of string in razor view

I have one string which is class course type as "database subject".I want to display it as "Database Subject" means capitalize the string. And given string is dynamic.   foreach (var registration in Model.Registrations) {    <br /><text> - -@registration.Class.Type.Course</text>    // Database Subject   }   I want to implement above changes in razor view.


select dynamically created elements using jquery

I'm trying to have dynamically generated elements call functions, or be selected by jquery to do another action. Not having much luck so far.  html  <button id="staticButton">static button</button> <button id="onClickButton" onclick="onClickFunction()">onClick button</button>

buttons created using static button

buttons created using dynamic buttons

   js  element_number = 1;  $('#staticButton').on('click', function(){     $('#from-static').append(         '<button id=' + element_number + ' >' + 'Dynamic Button #' + element_number + ' generated by static button</button>
'     );     element_number = element_number + 1; });   how would I select the newly generated buttons?  $('?').on('click', function(){     var currentId = $(this).attr('id');      $('#from-dynamic').append(         '<button id=' + element_number + ' >' + 'Dynamic Button #' + element_number + ' generated by Button #: ' + currentId + '</button>
'     );     element_number = element_number + 1; });   another approach perhaps: add an onclick event to generated buttons that call a function  function onClickFunction(){     alert("should this work?");   }   but clicking on the button I get: ReferenceError: onClickFunction is not defined


The joint distribution of $(X,Y)$ is given:  $f_{(X,Y)}(x,y)=e^{-(\theta x +\frac{y}{\theta})}$, $0<x,y<\infty$  Find the distribution of $U=XY$ and $V=\frac{X}{Y}$. Also find the conditional pdf of $V$ given $U=u$.  I have transformed $(X,Y)\rightarrow (U,V)$, and found the joint distribution of $(U,V)$ as the following:  $f_{(U,V)}(u,v)=\frac{1}{2v}e^{-(\theta \sqrt {uv}+\frac{1}{\theta}\sqrt {\frac{u}{v}})}$, $0<u,v<\infty$  But I cannot find the marginal pdf of $U$ and $V$ and the conditional pdf of $V$ given $U=u$.  Please anyone help me solve it. Thanks in advance.


Apart from physics, I love music and I want to learn about musical acoustics.   I know some things, but the problem is that most of musical acoustics books are written for musicians. That means that there're no demonstrations, and the physical concepts are explained so briefly. You can usually find formulas for the vibrating string or tubes, frequencies of the notes, etc. But I know that already!. On the other hand, acoustics books doesn't include information about musical acoustics. Or the basics, again.   I'm trying to find a musical acoustics book (or books, or articles) which fulfill:   Written for physicist. I want demonstrations of the formulas, even if they're sketched. Complete information about musical instruments. Not only vibrating strings / tube formulas. I want also information about vibrating membranes and metals, application of the formulas to particular cases (for example, difference between violin and viola, or clarinet and saxophone). Application of acoustics/waves concepts to music. For example, acoustic impedance, or diffraction.  Basic concepts about sonority. Tuning system. Differences of tuning system between instruments.   Of course, I've studied waves in my undergraduate course. I know about solving the wave equation for a particular case with initial conditions, wave packets, Fourier analysis...


Calculate the maximum DPI a camera can shoot

I am trying to determine at what DPI a certain camera can shoot, namely  , however the technical specs at the official site do not give any details about it.   Is there a way to calculate the maximum possible DPI a given camera can shoot provided we have the sensor type and its number of pixels (just as the in the link above) ?


Getting UTC java.uti.Date from LocalDateTime Java 8

I need to convert a LocalDateTime to UTC date, here is my code      LocalDateTime ldt = LocalDateTime.now();     System.out.println("Local date Time " +ldt);      ZonedDateTime ldtZoned = ldt.atZone(ZoneId.systemDefault());      ZonedDateTime utcZoned = ldtZoned.withZoneSameInstant(ZoneOffset.UTC);      System.out.println("UTC Zone"+utcZoned);      Instant i = utcZoned.toInstant();     System.out.println("Instant "+i);     Date out = Date.from(i);     System.out.println("date from Instant "+ out);   The output comes as   Local date Time 2019-05-08T16:23:53.109 UTC Zone2019-05-08T22:23:53.109Z Instant 2019-05-08T22:23:53.109Z date from Instant Wed May 08 16:23:53 MDT 2019   Till 3rd statement all is good. But when we get Date object from Instant it converts the Date object back to Local Time.   How can we get Date object as UTC from LocaldateTime??


I am using Linux Mint. Someone is trying to access my computer via my MAC Address and open port. I have some questions:   I know that there are different type of port like TCP and UDP. Should I close ALL (TCP and UDP, ...) the open (Listing) port to keep my computer save from hacking? How to close a port, if it is required?


A module as an external direct product of the kernel and image of an idempotent function

If $f:A\rightarrow A$ is an $R$-module homomorphism such that $ff=f$, show that   $$A=\ker f\oplus{\rm im}~f$$   Here is a part of what I made as a proof.  Let $a\in A$. $f(a)\in{\rm im}~f$, $f(a)\in A$ since $f$ is from $A$ to $A$, $a-f(a) \in A$ since $A$ is a module.  Consider $f(a-f(a))$. Since $f$ is a module homomorphism, $$f(a-f(a))=f(a)-ff(a)=f(a)-f(a)=0,$$ therefore $a-f(a)\in\ker f$. We have $a-f(a)\in\ker f$ and $f(a)\in{\rm im}~f$. $$(a-f(a))+f(a)=a-f(a)+f(a)=a$$ So $a\in A$ can be written as the sum of an element in $\ker f$ and an element in ${\rm im}~f$ and since $\ker f$ and ${\rm im}~f$ are submodules of $A$, we have $$A=\ker f+{\rm im}~f.$$  I was also able to show that the intersection of $\ker f$ and ${\rm im}~f$ is $\{0\}$.  I showed this proof to one of my senior and he said that what I actually did in my proof was show that $A$ is the Internal Direct Sum of $\ker f$ and ${\rm im}~f$.  Looking back at the problem, what is asked is to prove that $A$ is the External Direct Sum of $\ker f$ and ${\rm im}~f$.  I got the internal and external direct sum wrong but I understand them now. Now how would I go on proving the problem?  Here are some of my questions/ideas:   Since I'm trying to prove that $A$ is an external direct sum may I assume that $A=X\oplus Y$ where $X$ and $Y$ are modules? Then try to prove that that $\ker f=X$ and ${\rm im}~f=Y$? Also, if $A$ is the external direct product of $\ker f$ and ${\rm im}~f$ then that means that an element in $A$ is of the form $(x,y)$ where $x\in\ker f$ and $y\in{\rm im}~f$ right? Does that mean that I have to define $f$ in $X$ and $Y$? Is it possible to salvage my proof above? When does the internal direct sum equal to the external direct sum? I know that it is always the case that the two are isomorphic. If I remember correctly in groups it is possible for the internal direct product and the external direct product to be equal.   I hope you guys could clarify some things to me and point me in the right direction. Thank you!


I maxed out my Werewolf perks and did all three Totem quests for Aela, so I wanted to get rid of my lycanthropy.  Simply going to Ysgramil with a Glenmoril's Witches head doesn't work, I can press the "Activate" button near the blue flames all I want, but it doesn't work. Several sources said that to be able to cure your own lycanthropy you had to start the quest "Purity" for either Vilkas or Farkas.  After a couple of radiant quests with two Witches' heads in my inventory Vilkas finally asked me to help him find a cure for his lycanthropy and he starts following me around for this quest. As soon as I leave Jorrvaskr, however, he says a random line and goes back inside. The quest is suddenly moved to my finished quests log, without it registering as either Completed or Failed...  I reloaded the autosave in Jorrvaskr and got the quest again, this time asking Vilkas to follow me. He said I already have a follower (which should be him) yet the quest was moved to my finished log again, this time without even leaving Jorrvaskr. Talking to Vilkas again led to him giving another radiant quest.  What else can I do?  Perhaps on a related note; Farkas won't give me any radiant quests whatsoever, so I can't cure him at all.


I need a regular expression to remove white space in the beginning and it should allow spaces in between two words

Here is my source code. I have written a directive in angularjs to eliminate spaces. It's perfectly working for spaces between words but is still allowing spaces at the beginning.  function customValidation() {     return {      require: 'ngModel',      link: function(scope, element, attrs, modelCtrl) {         modelCtrl.$parsers.push(function (inputValue) {           var transformedInput = inputValue.toLowerCase().replace(/ /g,'');            if (transformedInput!== inputValue) {            modelCtrl.$setViewValue(transformedInput);            modelCtrl.$render();          }                    return transformedInput;                 });      }    }; }


Finding $\displaystyle \binom{n}{0}-\binom{n}{1}+\binom{n}{2}\cdots \cdots +(-1)^r\binom{n}{r}$   Try: using Identity $\binom{n}{r}=\binom{n-1}{r}+\binom{n-1}{r-1}$  So $$\sum^{r}_{k=1}(-1)^r\bigg(\binom{n-1}{k}+\binom{n-1}{k-1}\bigg)$$  Ciuld some help me how to find sum of that series, Thanks


How to use a transformation to solve a differential equation

I would like to solve:  $$\dot{y} = -\frac{2y(t)}{5t} +\frac{3}{5y(t)^4} $$  I was given a hint to use the transformation.  $$ z(t) = t^\alpha y(t)$$ where $\alpha \in \mathbb{R}$. I've seen this been done before but it seems like you just guess the solution. Is there a way to go about this?


How to switch logo and menu links based on subdomain?

my D7 site will be accessible from 4 different subdomains: - a.site.com - b.site.com - c.site.com - www.site.com (or just site.com)  I already enabled a domain cookie for .site.com and the login works across all subdomains.  Now I want to be able to show a different logo logo based on the subdomain and I also want to be able to switch the main menu links.  I tried the context module but didn't find a way to detect the subdomain.  I don't want to use the domain access module. I was thinking about modifying the theme to switch the logos. Can I do the same for the menu links?   Does anyone have a  better idea?


Is there an equation for the strong nuclear force?

The equation describing the force due to gravity is $$F = G \frac{m_1 m_2}{r^2}.$$ Similarly the force due to the electrostatic force is $$F = k \frac{q_1 q_2}{r^2}.$$    Is there a similar equation that describes the force due to the strong nuclear force?  What are the equivalent of masses/charges if there is?  Is it still inverse square or something more complicated?


Continuous image of a locally connected space which is not locally connected

The question is pretty much in the title, I'm looking for an example of a locally connected space and continuous mapping such that the image is not locally connected.  Thanks!  EDIT: Corrected the phrasing to the intended meaning.


Valid way of plotting Out-of-Bag error combined randomForest model

Due to RAM limitations, I had to split up my 68 tree model into 4 models of 17 trees each. I used the combine() function to combine the 4 models into one. When I ran plot.randomForest() on the model, I got the error Error in array(x, c(length(x), 1L), if (!is.null(names(x))) list(names(x),  :   'data' must be of a vector type, was 'NULL'.  Digging into the randomForest object, I found that the err.rate attribute is missing. And found it actually says so in the combine() help function:     The confusion, err.rate, mse and rsq components (as well as the corresponding components in the test compnent, if exist) of the combined object will be NULL.   I could fairly easily make a plot of Out-of-Bag error with a different line per model. But is there a valid way to still plot the err.rate of the different models so that the x-axis still represents the number of trees? I could make one long vector that is ordered on err.rate, but I am not sure whether this would be a valid representation.  I can't offer a reproducible sample because the data is way too large to share.


How can I keep combat from becoming a boring brawling match?

Background  I am DMing for a group of brand new players who come into D&D without really much of any role-playing experience, even as far as video games. The group is small with 3 players; A Forest Circle Druid, a Beastmaster Ranger who likes to get into melee, and a War Domain Cleric.  We are running through the "Lost Mines of Phandelver" campaign to start with. I am new at DMing myself. We play without maps or tokens, mostly because I work 55 hour weeks and don't have a lot of time to make maps. The party is currently level 2 and so far I haven't been making any changes to the combat encounters.  The Issue  Some encounters are starting to follow a pattern where the enemies come at the players, who are basically standing side-by-side. The number of enemies tends to be about four, and so on their turn they move into attack range in (almost) a 1-on-1 face-off with one player character facing two enemies. Then there is a boring brawling match where each player or the enemies roll to hit, roll damage, and repeat. The player who beats their enemy first moves on to help a teammate, until they win the battle.  The players do use spells at the start of the battle to quickly take out one or two enemies before the bash-match, but don't want to use too many resources too quickly (a concern that is well-founded)  This happened once before, and I wrote it off as something that will get better, but on our last session it happened again and I was suddenly very aware that the players were bored as the combat dragged on while everybody was getting poor attack rolls. I tried to make the enemies change tactics, by grappling and shoving, which slightly mitigated the effect but was too little and too late to turn the overall battle into a good experience.  Question  While at least roughly following the starter campaign encounter concepts, how can I keep combat from becoming a boring brawling match for this party?


How to set custom name for Exported Excel file in Javascript

I have this JS code which perfectly exports excel. I have tried various ways so that it will take custom names for the files. Currently, its always taking download.xls as default file name. Any idea on how to set custom filename in this code? Thanks in advance.  function Export()     {         var tab_text = "

";         var textRange; var j = 0;         tab = document.getElementById('TicketTable'); // id of table          for (j = 0 ; j < tab.rows.length ; j++) {             tab_text = tab_text + tab.rows[j].innerHTML + "
";         }          tab_text = tab_text + "
";         tab_text = tab_text.replace(/]*>|<\/A>/g, "");//remove if u want links in your table         tab_text = tab_text.replace(/]*>/gi, ""); // remove if u want images in your table         tab_text = tab_text.replace(/<input[^>]*>|<\/input>/gi, ""); // reomves input params          var ua = window.navigator.userAgent;         var msie = ua.indexOf("MSIE ");          if (msie > 0 || !!navigator.userAgent.match(/Trident.*rv\:11\./))      // If Internet Explorer         {             txtArea1.document.open("txt/html", "replace");             txtArea1.document.write(tab_text);             txtArea1.document.close();             txtArea1.focus();             sa = txtArea1.document.execCommand("SaveAs", true, "SubmittedBilling.xls");         }         else              //other browser not tested on IE 11             sa = window.open('data:application/vnd.ms-excel,' + encodeURIComponent(tab_text));         return (sa);     }


transformations from a sphere using R for raster and polygon data

I am planning on using the MODIS burned area products which were produced by Maryland University. These come as either polygons or rasters. In the user guide it says  A shapefile version of the MCD45 product is derived from the monthly Geotiff version by the University of Maryland. The shapefiles are available with the same projection (Plate-Carrée) and geographic extent as the Geotiff sub-continental windows  I used the following code in R to convert the projection from sphere-based datum to WGS 1984 UTM ZONE 38N (into the same projection as the rest of my data, including the dem data).  Is the code below correct for converting these projections?  library(raster) projection(fire) <- projection(dem)   How would I do this for polygon data?


this might seem a very basic question but i have been thinking about this  a lot. The thing i know about deleted files is that it doesn't really disappear from the hard disk. It simply get unlisted from sort of a data structure that contains the files and their info or it get overwritten(not sure).  My questions are:    Did i describe it correctly at the beginning? If not please correct me. Where do deleted files go physically? In what part of the hard disk?  if a storage device has a limited space(it certainly does), How can it contain an endless amount of deleted files along with the actual files in it?


mod_rewrite: web page has a redirect loop

I'm trying to have a parameter that comes just after he hostname, as in:  www.domain.com/parameter  For this reason, I've set the following rewriteRule, for two parameter values that I'd like to operate with:  RewriteRule ^(en|pt)$ /index.php?language=$1&%{QUERY_STRING} [L]   Works fine! Although, I need to create a new rule, to redirect any request without one the parameters listed.  For that reason, I thought this would work:  RewriteCond %{REQUEST_FILENAME} !-f RewriteCond %{REQUEST_URI} !^(en|pt)$ RewriteRule ^(.*)$ /pt/$1/ [L,R=301]   But unfortunately is showing a redirect loop.  I've been getting:  http://hostname/pt/pt/pt/pt/pt/pt/pt/pt/pt/pt/pt/pt/pt/pt/pt/pt/pt/pt/pt/pt/pt//   Any tips on how to fix this are appreciated!


If a said to b "do this or that", would b be disobeying a if it did both? In others words, in English is "or" the same as xor, the exclusive or?


I have some string, which I will receive from UI:  String str = "12a47b4cea";   It represents sequence of hexademical numbers. How can I convert it into a byte array?  Expected output is:  byte[] arr = new byte[] {0x12, 0xa4, 0x7b, 0x4c, 0xea };


What book has super-powered teens including a boy with yellow eyes who can see a few seconds into the future?

I have been looking for a book about a group of teens with superhuman abilities. It is centred on a boy that has yellow eyes that can see into the future for a few seconds. I can't remember anything else about the book.


Using question mark instead of table name in PDO prepared statements

I need to know can I use question marks (?) in PDO prepared statements as table name or not.    $table = $_POST['table']; $id = $_POST['id']; $sql = "UPDATE ? SET priority = priority + 1 WHERE id = ?"; $q = $db->prepare($sql); $q->execute(array($table,$id));   I'm getting this error:       Warning: PDO::prepare() [pdo.prepare]: SQLSTATE[42000]: Syntax error or access violation: 1064 You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near '? SET priority = priority + 1 WHERE id = ?'


Prove that continuous functions mapping irrationals to rationals must be constant

Let $f\colon[0,1] \to \mathbb{R}$ be a continuous function  such that any irrational number is mapped to a rational number. Then $f$ must be a constant.  Well, the context isn't that much, I was reading some interesting function constructions on Hardy's book. Then raised this question.   As the solution suggest it is an elementary exercise. But definitely interesting.


Why have I not been awarded my badge yet?

I recently achieved a flag weight of 500 over on StackOverflow.  I am curious as to why that has not resulted in my earning the Deputy badge.  I realize that the description of the badge states that you must "achieve a flag weight of 500 by reviewing and flagging appropriately", but a fair number of my flags have not come directly through the review interface.  I tend to spend most of my time browsing the site for questions I can answer, and flagging questions and answers that I happen across that I think should be flagged.  Is this my problem?  Do I need to have spent my time actually in the review interface?


What to list as affiliation when work spans multiple institutions?

I began working on a paper during my undergraduate degree in the summer of 2014. I continued to work on the same paper into summer 2015, at which time I graduated and moved to a different university to pursue a graduate degree. However, all experiments failed and my collaborators and I were unable to produce any meaningful results. In fall 2015, while enrolled in graduate studies at the second university, I realized that the question at the centre of this paper could be answered using a completely different method. I contacted my collaborators and we have been able to produce some great results.   Now I am writing the paper and wondering what I should list as my affiliation, since the project was begun at one university but overhauled and completed at another. I see four options:    The old university The new university Both the old and new universities The old university, with a “present address” note    What is standard practice in a situation like this, where work is begun in one lab but completed in another? Does the re-design of the project from the second university complicate the issue?


SELECT ? FROM table WHERE id = ? not working correctly

I've got a little question. I want to get specific information out of my database via mysqli query:  public function get_searchorder_single_information($soid, $information) {          global $mysqli;          $stmt = $mysqli->prepare("SELECT ? FROM pr_hr_searchorders WHERE id = ?");         $stmt->bind_param('si', $information, $soid);         $stmt->execute();         $stmt->bind_result($result);         $stmt->fetch();         echo $result;          $stmt->close();      }   In my example, $information is set 'job', but it can have other values, too (e.g. 'salary'). When I try to use my query with this variable, echo outputs just 'job' and not the value that is saved in my database. When I write 'job' instead of the '?', echo outputs the correct value.  So now I could make a function for each information I search, but this would end in spaghetti code. So I ask you if there is any possibility to use my search query like above with correct output. How would I do that?  Thanks in advance and sorry for my bad english writing.


Can we use though and although interchangeably? Somebody told me that the difference is that though cannot be used at the beginning of a sentence. Is that the rule?


I am trying to calculate this integral by DI method but didn't know how to do it (not looking for using gussian formula) :$  \int_{-\infty }^{+\infty} e^{-x^{2}}\,dx $ . Can anyone help me ?


I am looking at my favorited posts and I am wondering what "kviews" means?


Finding gaussian distribution given 15th and 50th percentile.

My knowledge of statistics are small so I need a little bit of help.   I have some data showing the relationship between age and walking speed. The numbers of walking speed are presented only as the 15th and the 50th percentile.  For example:  Child(0-12 years): 1.07m/s (15th percentile)  1.33m/s (50th percentile).   I need to find how many percent is between 1.0m/s - 1.2m/s and 1.2m/s - 1.4 m/s etc.  That is the likelihood of observing a child walking between 1.0 and 1.2 m/s etc.   Is that possible? Please help me out.


Is it possible that $a_n>0$ and $\sum a_n$ converges then $na_n \to 0$? (without assuming $a_n$ is decreasing)

Can it be proven that : If $a_n>0$ and $\sum a_n$ converges then $na_n \to 0$ (without assuming $a_n$ is decreasing)  Please note This question does not require $a_n$ to be decreasing as condition,  Is it possible to prove $na_n \to 0$ without requiring $a_n$ to be decreasing? I keep thinking that $a_n>0$ and $\sum a_n$ converging then that implies that $a_n$ must be decreasing anyway(not monotonically decreasing necessarily )  Is it possible that $a_n>0$ and $\sum a_n$ converges then $na_n \not \to 0$?  There are already answered questions that assume $a_n$ to be decreasing as a requirement: (this question does not assume $a_n$ is decreasing)       was the post that made me ask this question, a counter example of monotonoic decreasingness of $a_n$ was given in comments by the OP.


Warn users that they might be committing vote fraud

It looks like this guy  without even knowing it.  I don't get the impression that he was trying to harm anyone with this process.  What about a warning message that triggers after a person upvotes (or downvotes) the same person X times within Y time span (with X and Y being thresholds that are well below the limit that actually results in a vote fraud reversal)?  Say, twice within 15 minutes?  Maybe display a warning pop-up that says:     Whoa, Camel!  It looks like you're starting to perform serial voting on a particular user.  Did you know that    I have little doubt that this guy would have stopped had he been (gently) warned.  Perhaps others will stop, too.


How can I prevent the mantel above a gas fireplace from getting hot?

When I moved into this house, the unvented gas fireplace had no mantel or hood. It worked OK, although I thought the tile above the fireplace (and the sheetrock behind it) got rather hot. When I burned it for long periods, I would take the picture we have hanging above it down. A couple of years ago I bought a wood mantel, painted it white and hung it above the fireplace. Now the mantel gets hot. I doubt it would burst into flames, but its too hot to touch and would probably peel the paint off if left on too long.   I figured I needed a fireplace hood. Off to ebay and went and bought a hood. It sticks out 4.5 inches. I found a bargain on a brass one for $30 and thought it looked fine but my wife informed me it was ugly and looked like something from the 70's. Once again, I learned I have no taste.    Turns out the hood didn't help much, the tile above the fireplace and the mantel still gets hot. Not only that, it blocks some vents at the top of the fireplace which the instructions say is a no-no.   It appeared to me the heat needs to be directed up and away. I had some aluminum flashing laying around so I made a prototype shield. My idea was just to test it and if it works make one out of sheet metal as soon as I find a shop with a sheer and a brake. The good news is that it works great. The bad news is that its ugly.      Ok, the questions:   Has anyone else had an experience with the mantel getting so hot? Has anyone seen a mantel heat shield like this I can buy? If I stick with the homemade route - any ideas on how I can make it look better. (I do plan to paint it black and maybe cut it back some) Any other creative ideas of what i can do for this problem? Maybe put a shield directly under the mantel?


How to split a single row into multiple row ?  DECLARE @var VARCHAR(50) SELECT @Var = 'brook|456|US'  SELECT SPLIT(@var)   Result:  brook 456 US


I'm a brand new user so I'm not sure of my way around the system yet. I want to change my computer's name, so I tried to edit the name in /etc/hostname, but it is a read-only file. Adding the ! character didn't help. I'm using vim to edit the file.


Masking name with RegEx Non-ASCII character

I'm struggling with masking the entered names. I did this with RegEx in Javascript. But I have a problem. If there is a non-ASCII characters in the entered name, it does not detect it. My codes are like this:   var name ="Román Ærelto"; var regex =/\b(\w{0,1})(\w{0,}?)(\w{0,0}?)\b/g; console.log(name.replace(regex,(_, first, middle, last) => `${first}${'*'.repeat(middle.length)}${last}`));    Expected Result: R**** Æ****  How can i solve this problem. Or do you have another solution for masking name? I don't want to use for-loop Thank you for your help.


Element chasing proof that $(A\setminus C)\setminus(B\setminus C) = (A\setminus B)\setminus C$

I would like to construct a formal proof of the following:  $$(A\setminus C)\setminus(B\setminus C) = (A\setminus B)\setminus C$$  Let $a∈A$ be an arbitrary element, we will show that $a\in A \cap \overline B \cap \overline C$.  For LHS, since $a\in A$, we have that $a\in (A \cap  \overline C) \cap  (\overline B \cap \overline C)$. This is equivalent to $a\in (A \cap  \overline B) \cap \overline C$.    For RHS, since $a\in A$, we have that $a\in (A \cap  \overline B) \cap \overline C$  $\therefore lhs \equiv rhs$ and this concludes the proof  I would be grateful for any feed back on this element chasing proof. Is it flawed or where should improvements be made?  Thanks


Change asp.net textbox border color to red when empty value and green when not empty using javascript

I want to change the border color to red when the textbox value is empty in onblur event and change the border color to green when not empty.  At first time when the page is loaded I click on the textbox and leave the focus away from the textbox it changes the border color to red, afterwards I type some value in the textbox and leave the focus away, it changes the border to green, till now it is working fine. When I delete the text from the textbox and leave the focus it does not changes the color to red it remains in green color, what I have done wrong please help me in this regard...      <form id="form1" runat="server">

         <asp:TextBox ID="TextBox1" autocomplete="off" CssClass="form-control"  runat="server" onblur = "Validate('TextBox1')"></asp:TextBox>

 </form>   I need to change the border to red when no value in the textbox instead of green border when value is deleted from the textbox.


How can I handle autocorrelated residuals?

In the Breusch-Godfrey test we use a model  $$ e_t = \varepsilon_t + \beta_1 \varepsilon_{t-1} + \dots+ \beta_p \varepsilon_{t-p}. $$  If we reject the null hypotesis of no serial auotocorrelation of the error, it means that the residuals follow an auto-regressive model of order ($p$).  If I want to avoid this problem, I must add a certain number of lags of the response variable $y$ as regressors in the original model. However, in some cases this method is not useful.   Are there other options to consider?


Localisation isomorphic to a quotient of polynomial ring

Let $R$ be a commutative ring and $A=\{1,a,a^2,\dots\}$ for some $a\in R$. Prove that $A^{-1}R$ is isomorphic to $R[T]/(aT-1)$.    I guess I'm meant to find a surjective homomorphism between $A^{-1}R$ and $R[T]$ and then use first isomorphism theorem. What homomorphism should I use?


What do you call a person who doesn't keep his word?

What do you call a person who doesn't/can't usually keep his/her word ?


When choosing cards for a deck, one of the most important things to consider is the number of land you put in. The biggest issue is mana curve, of course. What shortcuts are best for determining the proper amount of land with a given mana curve?


I UV unwrapped my mesh, but the image texture doesn't show in my object

I just created a 3D model of a barrel and UV unwarped. That thing below is the screenshot of the UV image editor.   Then I clicked new button below the UV image editors window and gave a name barrel and unchecked the alpha option, and selected blank to color fill option then clicked ok. then I changed the viewport to texture mode. I can't see the color grid texture on my object. Image below.   i am using blender 2.78n thanks in advance for any help.


If I kill a caster with Mage Slayer does the spell still happen?

Mage Slayer's first benefit says...     When a creature within 5 feet of you casts a spell, you can use your reaction to make a melee weapon attack against that creature.   Does casting a spell encompass the entire spell effect or just the initation of the spell effect? If the latter, will the effect continue even if the caster dies from the Mage Slayer attack?


After Palpatine became Chancellor, why not hedge his bets by getting DNA from Anakin and secretly cloning an army of super-Force-sensitive warriors pre-programmed to serve only him? A Sith master must always worry about their apprentice turning on him, and the Kaminoans were shown capable of programming genetic orders into their clones that could not be disobeyed. Plus, the Anakin Clone Army could be ready in about 10 years which would not be too long for his plans.


How to use "between" for more than two objects?

Hi I have been wondering for years what was the correct way to use "between" with more than two things to compare.  I am currently working on my thesis so I think I should finally ask what the rule is. So far this is what I have:  "I am using the results to develop mathematical relationships between characteristics and efficiencies and capacity."  What I would like to express is that I am using the results to develop mathematical relationships between characteristics and efficiencies, as well as between characteristics and capacity.  Can I do that without repeating "between characteristics" ?  Thank you


My secondary mirror won’t go up with the main mirror?

I don’t see that anything is broken it just doesn’t follow the main mirror i push it up manually and it stays up but when taking a picture it doesn’t go up with the main mirror it stays down making my pictures have a black band  .. can I DIY it maybe ? do you know if this is worth the fix I don’t want it to cost more than the camera itself ..


80s/90s Scifi movie where an alien family is stuck on Earth

When I was younger I remember watching a copied VHS that had a partial sci-fi movie on it. From what I remember a humanoid alien family somehow gets stuck on earth.   There were 2 sisters whose hair changed from white to brunette/blonde in sunlight.   They had an orange fuzzy alien like pet with maybe 3 legs, and it was apparently a young whatever and it smoked coal at some point.  I've tried looking for family oriented scifi movies from the 80s/90s and have had no luck finding this title.


Why should we use IRLS in logistic regression?

I am really confused on why should we take IRLS as it seems that using gradient that with one derivatives at a time would solve the problem, what is the meaning of introducing Hessian matrix? Or did I understand anywhere wrong with that algorithm?


I have an array of objects. Then I want to add another object and stick it to the one that already existed in my array. Which means the index of the new object should be larger by one in relation to my already existed object and rest of the element's indexes should be incremented by one.   For example:    I have array of 6 elements My new object is stick to existed object with index = 2 New Object enters into an array with index = 3 and all objects with indexes previously greater then 2 now get one place higher   I tried to split my array into two starting from index = 2, push my new element, and then join and again but my code do not work well.  for (var i in myArray) {   if (myArray[i].name === inheritedRate.inherit) {     var tempArr = [];     for (var n = i; n < myArray.length; n++) {       tempArr.push($scope.myArray[n]);       myArray.splice(n, 1);     }     myArray.push(inheritedRate);     myArray.concat(tempArr);   } }     in other words I have an array which looks like this:   myArray = [   {name: "not selected"},   {name: "not selected"},   {name: "selected"},   {name: "not selected"},   {name: "not selected"},   {name: "not selected"}, ]   And I want to put there an external element to make it look this:   myArray = [   {name: "not selected"},   {name: "not selected"},   {name: "selected"},   {name: "new element"}, // inserted   {name: "not selected"},             {name: "not selected"},   {name: "not selected"}, ]


Evaluating a summation related to binomial expansion

How do you evaluate this summation $$\sum_{t=0}^{n}{t\binom{n}{t}x^t(1-x)^{n-t}}$$ where $0 < x < 1?$


Barlow knife quote meaning in Mark Twain's Adventures of Tom Sawyer

True, the knife would not cut   anything, but it was a "sure-enough" Barlow, and there was   inconceivable grandeur in that - though where the Western boys ever   got the idea that such a weapon could possibly be counterfeited to its   injury, is an imposing mystery and will always remain so, perhaps.   Doesn't seem to be your normal construct in regards to "...such a weapon could possibly be counterfeited to its injury..."  What does "to its injury" mean here?


We've tried this a few times. First time we used an old ceramic container and it started sheding on the inside and ruined it. Next time we used a new metal garbage can with one of those super sized 10 gallon zip lock bags as a liner. It went rank very quickly. This could have been due to our packing though. Before we get into this again, what is you recommendation for a good container? I hate the thought of plastics but it seems it might just be the best choice as long as it's made for food storage.


My USB security key is set up, but still not an option on Win10 login screen

I have a FEITIAN BioPass K27 USB Security Key that I am trying to use to log in to my Windows 10 (Version 2004 - 19041.450) PC. I have gone through all the setup steps as shown below, including setting up a PIN linked to the USB key (Windows Hello):      And yet, in the end, this security key login option doesn't appear on my windows login screen:  This personal PC is not linked to Azure, it's not on a company domain, etc...but I fear that all this stuff is required as per . Did MS really not provide a way for simple, isolated, personal computers to login with a USB key??


How do I interpret the "Move" information for each Pokemon?

Each Pokemon you capture has two moves, listed on the profile displayed when you select them.  According to  question, one is a 'standard' and one is a 'special' attack, which requires charging before use.  However, I'm not clear on how to interpret the information the page tells me.  For example, here is a Golbat and an Oddish:    Presumably the ones with the blue lines are the specials, but what does the size and quantity of the blue lines indicate?  What about the number at the right hand side?


What is compilation tag in web.config or app.config for?

I've noticed there is a compilation section in web.config like:  <compilation debug="false" targetFramework="4.5.2">   <assemblies>     <add assembly="DevExpress.ExpressApp.Xpo.v15.2, Version=15.2.9.0, Culture=neutral, PublicKeyToken=b88d1754d700e49a" />     <add assembly="DevExpress.ExpressApp.v15.2, Version=15.2.9.0, Culture=neutral, PublicKeyToken=b88d1754d700e49a" />     <add assembly="DevExpress.ExpressApp.Web.v15.2, Version=15.2.9.0, Culture=neutral, PublicKeyToken=b88d1754d700e49a" />     <add assembly="DevExpress.Persistent.Base.v15.2, Version=15.2.9.0, Culture=neutral, PublicKeyToken=b88d1754d700e49a" />   What is it for? Where are these assemblies being added?


TeXShop: (R) gets converted into circled R

I am having a bit of trouble finding a solution. When I type (R) TeXShop changes it into circled R. I changed the setting in Language & Text, disabling "Use the symbol and text substitution." However, TeXShop still converts my (R) into circled R. I was not able to find an option in TeXShop. I feel like it is somewhere I just can't find it.


Is it possible to burn a filename watermark in the corner of a concatenated image slideshow and have it change for each image?

What I want to do: I have a folder with a great bunch of images. Using these files I want to create a slideshow video, while I want the filename of each of the original images burned into the bottom right corner.  What my current state is: I made a script to fetch all .jpg files in the folder and make a ffmpeg-readable list and I know how to concat the images to a slideshow and everything works as intended. I also figured out how to use FFmpeg's drawtext to get a handsome filename stamp.   Now the problem: Currently FFmpeg grabs the last filename from the file list (for example IMG_9935.jpg) and burns it into the entire video. But what I want to happen is, that it changes with each 'new' image - just like a timecode would change during the course of the video.  Is any of this possible?  As a side note: "Why don't you burn the filename beforehand?" I'd like to keep it as flexible as possible. So if there's another way round, I'd like to go that way.  for i in *.jpg; do echo "file '$i'" >> files.txt; done  ffmpeg -r 1/3 -f concat -safe 0 -i files.txt -vf "eq=text=$(echo $i | rev | cut -d / -f 1 | rev): fontcolor=0x808080: fontsize=14: x=w-tw- 10:y=h-th-10" -c libx264 filename.mp4


I have Windows 10 installed in my laptop and i'd like to install Ubuntu 18.04 too. I just create a bootable USB and install Ubuntu (with the option 'Install alongside Windows 10')? Is there anything I need to do with Secure Boot? As i see in System Information my BIOS Mode is in Legacy and secure boot is unsupported. Do I proceed with the installation or do I have to change any values from BIOS or anywhere else?


How to find Time Complexity of given piece of code?

We need to find out the maximum no-adjacent subset-sum in the given array,     no-adjacent: we cannot pick adjacent elements while forming the   maximum subset-sum.   For example:  arr = [5, 3, 7, 14]  Solution : [5, 14] : 19 maximum sum  Explanation:  5 and 14 are not adjacent numbers and their sum is maximum.  Code  int main(){     //input    int n;    cin>>n;    vector<int> arr;    while(n--){       int x;       cin>>x;       arr.push_back(x);    }     int max_adj = INT32_MIN;     for (int i = 0; i < arr.size(); i++)       max_adj = max(max_adj, maxSum(arr, i));   }   int maxSum(vector<int> &arr, int vidx) {     if (vidx >= arr.size()) {        return 0;    }     int max_ = 0;     for (int i = vidx + 2; i < arr.size(); i++) {        max_ = max(max_, maxSum(arr, i));    }     return max_ + arr[vidx]; }   The above approach is a brute force/naive recursive approach to solve this problem. I know there exists a better dp solution.  But, I am just looking for a way how to find out the     Big O time complexity   of this recursive solution mathematically.


Count unique values in column B with respect to column A

I have two columns in Microsoft Excel, A and B. The input is displayed below  A      B ABC    1 ABC    1 ABC    2 ABC    2 ABC    2 DEF    1 DEF    3 DEF    3 CDE    1 CDE    2 CDE    3 CDE    4   I need an output like below whose meaning is also explained  ABC   2.....which means (two unique values with ABC, which is 1 & 2) DEF   2......(1 & 3) CDE   4.......(1,2,3,4)


Present Perfect vs. Present Perfect Progressive

I am taking a Mooc on grammar and punctuation on Coursera, and have been asked a question during a lecture:  Do these two sentences have similar meaning or different meaning? Julie has studied French for two years. Julie has been studying French for two years.  I thought the answer was : different meaning. In the first case, Julie has studied French for two years, but may not be studying it still. In the second case, if she has been studying for two years, it means that she is still studying it. Weel, the answer was that the two sentences had the same meaning. It was not an error of correction in the quizz, as the teacher later explained:  These two sentences have pretty much the same meaning. A lot of times present perfect and present perfect progressive have the same meaning and can both be used.  And continued with:  Here is some other examples where the two sentences have about the same meaning. Bart has lived in Ireland for two years. Bart has been living in Ireland for two years. Sofia has worked at Apple for four months. Sofia has been working at Apple for four months.  Can someone explain this to me? Thank you!


Let $4$ and $5$ be the only eigenvalues of $T$. Show $T^2-9T + 20I = 0$ , T is self adjoint.

Let $T$ be a self adjoint operator on a finite dimensional inner product space. And let $4$ and $5$ be the only eigenvalues of $T$. Show $T^2-9T + 20I = 0$ .  proof:Let $T$ be a self adjoint. And let $4 , 5$ be the only eigenvalues of $T$. Then $Tv = 4v, Tv = 5v$ for some $v \neq 0$. Then $Tv = 4v, Tv = 5v$ if and only if $(T-4I)v = 0, (T-5I)v=0$.  Then $ (T-4I) (T-5I)v=0$ implies $(T^2 -5T -4T + 20I^2)v = 0$, implies   $(T^2 -9T + 20I)v = 0$, so we have  $T^2 -9T + 20I = 0  $. Can someone please check this? if it's not correct, could I please have some help on it? Thank you


On Conjugacy Classes of Alternating Group $A_n$

In Dummit & Foote, page 131  Let $K$ be a conjugacy class and suppose that $K$ is subset of $A_n$ .  Show that if $\sigma$  belongs to $S_n$ then , $\sigma$ does not commute with any odd permutation if and only if the cycle type of  consists of distinct odd integers.  Deduce that $K$ is a union of two -conjugacy classes in $A_n$ if and only if the cycle type of  an element of $K$ consists of distinct odd integers.   [Hint: Assume first that $\sigma$  belongs to $S_n$ does not commute with any odd permutation. Observe that $\sigma$ commutes with each cycle in its own cycle decomposition, so that each cycle must have odd length. If two cycles have the same odd length , find a product of  transpositions which interchanges them and commutes with $\sigma$ . Conversely, if the cycle type of $\sigma$ consists of distinct integers, prove that $\sigma$ commutes only with the subgroup generated by the cycles in its cycle decomposition.]  the exercise number 21 , i uesed the hints to prove that the cycles of cycle decomposition of $\sigma $ must be of odd length , but i don't know how to prove that the cycle type is distinct . the text said find transposition which interchanges them and commute $\sigma$ , my question is , interchange what ?!!! what does this mean ? can anyone help ?


I am struggling with Hartshorne, Exercise II.5.6 (a):  If $A$ is a ring and $M$ a quasi-coherent $A$-module, show that for every $m\in\Gamma(X,M)$ the equality $\operatorname{Supp}(m)=V(\operatorname{Ann}(m))$ holds, where $\operatorname{Supp}(m)=\left\{x\in\operatorname{Spec}(A)\mid m_{x}\neq 0\right\}$ and $\operatorname{Ann}(m)=\left\{a\in A\mid am=0\right\}$.  I can reduce it to the case where $M$ is a quotient of the structure sheaf of $\operatorname{Spec}(A)$, but I have no idea where to continue.


Remove object with multiple angles of its background?

I have this image:  My goal is to remove the pillars on the side of the edge of the image so that it looks something like this: (I did a terrible clone job)  I have the a photo taken at a different angle:  Are there tools in photoshop that can help me achieve my goal?


How to prove a random variable taking values in $[0,1]$ range has variance no larger than $\frac{1}{4}$?

How can I prove that a random variable taking values in $[0,1]$ has variance no larger than $\frac{1}{4}$? If it matters, discrete and continuous proofs are both welcome.


i am just trying to destroy my session with session_destroy but its not getting destroy this is my code of logout.php  <?php session_destroy(); //print_r($_SESSION);exit;   ?> <script type="text/javascript">     location.href=root_path+"index/"; </script>   i am getting a waring  Warning: session_destroy(): Session object destruction failed in F:\xampp\htdocs\synthesis\module\login\logout.php on line 3   if i remove third line from comment and click again on logout its showing me array of $_SESSION with all data and if i do comment it again without refreshing browser and then refresh the browser then session is getting destroy i am calling this page from my index page and on index page i have written session_start


got refusal two times from Swiss Embassy,

Hi i had tried two times from Swiss embassy with my cousin sister . When I was tried first time I did not have much more travel history only had Thailand Visa. I had show my salary only 20000/- per month and and her 15000/- my fund was just made in one month around 2 lac. my ITR was around 2.5 lac without.   So i thought that was a biggest mistake from my side because our funds and salaries was too low. than i again try last year in 14 august 2018. That times We have got Thailand, Singapore, Indonesia,and Dubai Visa on our Passport. I had show my salary 25000/- and her 19000/- and Funds was around 5 lac per person but its deposited in a month only and all are cash deposits. My stay was around 4 nights in Switzerland and 3 nights in Austria. Flights are just hold not booked and Hotel was just booked but without payment my visa company created a Tour itinerary according to the Visa process Condition But again I got refusal.  Now we are again going to try now i have maintained my funds from last 6 months and showing my salary 40000/- and her 32000/- per month in bank account with online transfer. ITR my 4.40 lac and her 3.90 lac. funds are maintained 3 lac per persons.and now we having 3 more visa Hong Kong, Macau and China.   So my Question is should i try or not? Please Suggest me what should i do?   Edit: the refusal reason was “Your intention to leave the territory of the Member States before the expiry of the visa applied for could not be ascertained.“


How to obtain "equation environment's size" for integral sign in caption? The one using inline math mode is too small (see caption):    I've tried using equation environment inside caption but seems not allowed. Any idea? Is there not an equivalent of \dfrac for integral?  MWE:  \documentclass{article} \usepackage{amsmath} \usepackage{pgfplots}  \begin{document}  \begin{figure}[t]     \centering     \begin{tikzpicture}     \begin{axis}     \addplot[mark=none,black,thick] coordinates {(0, 0) (1, 1)};                                     \end{axis}     \end{tikzpicture}     \caption{$T = \int_{0}^{1}f(x)dx$} \end{figure}  \end{document}


What is the underlying explanation behind fictitious/pseudo forces?

What is the underlying explanation behind ?   The popular example of the bus: Lets say you are standing in a bus and the bus is moving with a constant velocity, we can therefore agree that you are in an inertial reference frame and therefore the law of inertia applies in your reference frame.   However, as soon the bus decelerates you feel a "push" forward, moreover the frame is no longer inertial, at this point we agree that the law of inertia doesn't hold for that frame since you changed the state of your motion while no force is acting on you in your frame. Consequently, in order to make up for the "discrepancy" between the law of inertia and such situations we introduce a pseudo force (stating that this is the force that caused us to change states) in order to be able to effectively use Newtonian mechanics in a broader domain.   This is the popular explanation as to why pseudo forces are introduced, however no one really touches on to the underlying principles of the occurrence of a pseudo force, so I'm looking forward for a more in depth explanation into the nature of a pseudo force (i.e why it occurs from a physical perspective?), rather than just saying that we introduce it in non-inertial reference frames, for reasons similar to the above.  If we assume its nothing more than just a human correction used for mathematical and physical analysis, and simultaneously we can't say that inertia is the reason we tend to fall forward in the situation stated above since it is a non-inertial frame, then what would be the explanation exactly to such tendency of changing states of motion in an example like the above


Was there a brief system glitch which caused some questions to be posted twice?

On Math SE, I saw there were 2 questions from 2 different users which were both repeated about a minute apart from each other, interlaced among each other, as shown below:  In case anybody wishes to check on the details of any of them, the 4 questions in the order shown are , ,  (note: currently deleted), and . It's possible each user just simply tried accidentally posting more than once, but this seems to occur quite rarely from my experience, and for this to happen with 2 users at basically the same time seems quite unlikely. Also, as for 's suggested duplicate of , I believe that most often occurs with the 2 questions posted at basically the same time as each other, but both of the 2 duplicates here were each posted about a minute apart from their earlier one, so I'm not sure if it's the same issue. I checked the list of recent SO questions from around that same time, but didn't see any duplicate questions, exact or otherwise, occurring from the same user, although it's possible any such duplicates were already deleted. Nonetheless, is this something anyone else also saw around that time? Does anybody know if the SE system may have caused these repeats to occur rather than it being due to the users themselves? Note I will check those posts sometime later and, if either user gives feedback as to something they did which may have caused these duplicates, I'll update this post with those details. Update: After about 2 weeks, neither user of the duplicated questions has indicated anything, nobody has reported anything similar happening elsewhere, and there's been no official feedback. Note the 1st & 3rd questions shown above were posted 1 minute & 6 seconds apart, while the 2nd & 4th questions were posted 1 minute & 8 seconds apart. On rereading the suggested duplicate post, I realize a situation described there of initially double-clicking on the Review button and then shortly afterwards clicking on it again may cause the question to be posted twice, with each one being about a minute apart. As such, I am now fairly certain this is just the same issue, with these 2 sets of duplicates occurring so close together in time being just a coincidence.


how to parse string containing Unicode ID's as well as plain text for display in datagrid view

I am trying to parse a string (returned by a web server), which contains non-standard (as far as I can tell) unicode Id's such as "\Ud83c" or "\U293c", as well as plain text.  I need to display this string, emojis in tact, to the user in a datagrid view. btw, I am blind so please excuse any formatting errors :(  full example of what my code is parsing: "Castle: \Ud83d\Udc40Jerusal\U00e9m.Miles" the code I wrote which is failing miserably:   Public Function ParseUnicodeId(LNKText As String) As String     Dim workingarray() As String     Dim CurString As String     Dim finalString As String     finalString = ""     ' split at \ char     workingarray = Split(LNKText, chr(92))     For Each CurString In workingarray         If CurString <> "" Then             ' remove leading U so number can be converted to hex             CurString = Right(CurString, Len(CurString) - 1)             ' attempt to cut off right most chars until number can be converted to text as there is nothign separating end of Unicode chars and start of plain text             Do While IsNumeric(CurString) = False                 If CurString = "" Then                     Exit Do                 End If                 CurString = Left(CurString, Len(CurString) - 1)             Loop             If CurString.StartsWith("U", StringComparison.InvariantCultureIgnoreCase) Then                 CurString = CurString.Substring(1)             End If             ' convert result from above to hex             Dim numeric = Int32.Parse(CurString, NumberStyles.HexNumber)             ' convert to bytes             Dim bytes = BitConverter.GetBytes(numeric)             ' convert resulting bytes to a real char for display             finalString = finalString & Encoding.Unicode.GetString(bytes)         End If     Next     ParseUnicodeId = finalString End Function   I tried to do this all kinds of ways; but can't seem to get it right.  My code currently returns empty strings, although my guess is that is because of some of the more recent changes I have made to cut off the leading U or to try and chop off one char at a time.  If I take those bits out and just pass it something like "Ud83c", it works perfectly; its only when plain text is mixed in that it fails, but I can't seem to come up with a way to separate the two and re-combine at the end.


I tried to simulate a 400 meters race using multithreading concept.In this application totally 5 groups are created and they are named by country names,each group should have 2 players.First player is allowed to run for the first 200 meters followed by the next player in the group and the winner group has to be announced.Since i am a beginner in multithreading concept i tried to implement the first 200 meters process without concerning the next 200 meters process.But running the code doesnt print anything on the console.please help me to get through this...  RelayDemo.java  public class RelayDemo implements Runnable {     public void race()     {         for(int i=0;i<200;i++)         {             if(Thread.currentThread().getName()=="rakesh"||Thread.currentThread().getName()=="nathan"||Thread.currentThread().getName()=="max"||Thread.currentThread().getName()=="villiers"||Thread.currentThread().getName()=="decapro")         {             System.out.println("The distance covered by"+Thread.currentThread().getName()+"is "+i);         }      } } public void run() {     this.race(); } }   ExcecuteRelay.java  public class ExcecuteRelay {  public static void main(String[] args)  {     RelayDemo r=new RelayDemo();     ThreadGroup t1=new ThreadGroup("india");     ThreadGroup t2=new ThreadGroup("australia");     ThreadGroup t3=new ThreadGroup("usa");     ThreadGroup t4=new ThreadGroup("africa");     ThreadGroup t5=new ThreadGroup("france");     Thread r1=new Thread(t1,r,"rakesh");     Thread r2=new Thread(t1,r,"kishore");     Thread r3=new Thread(t2,r,"nathan");     Thread r4=new Thread(t2,r,"johnson");     Thread r5=new Thread(t3,r,"max");     Thread r6=new Thread(t3,r,"tim");     Thread r7=new Thread(t4,r,"villiers");     Thread r8=new Thread(t4,r,"duminy");     Thread r9=new Thread(t5,r,"decapro");     Thread r10=new Thread(t5,r,"lues");     r1.start();     r2.start();     r3.start();     r4.start();     r5.start();     r6.start();     r7.start();     r8.start();     r9.start();     r10.start();         // TODO Auto-generated method stub  }  }


How can I know the file size of the downloaded file before downloading it?


Is it:      "Neither of my brothers do anything to help my parents."    or      "Neither of my brothers does anything to help my parents."   Both sound right to me and I'm not sure which is right.


How to prove this limit: $\lim\limits_{n \to \infty} \frac1{\sqrt[n] n}=1 $?

This is what I am trying to prove: $$\lim_{n \rightarrow \infty} \frac1{\sqrt[n] n}=1 $$  How do I go about this?


Adjective for "terrified yet calm and capable"

What is an adjective to describe the duality of a first responder (such as an EMT responding to a terrorist attack) who is terrified for the wounded, yet simultaneously calm, detached, and capable enough to give aid?


How much power does a cell phone charger actually use?

I was trying to figure out how much power I actually use when I am charging my phone. Here are the specifications of my charger:   Input: 100/240 V, 50–60 Hz, 0.15 A Output: 5 V, 0.7 A   I've heard that in order to calculate this, you need to pay attention to the input.  $$P = V\cdot A = 240\ \mathrm V\cdot 0.15\ \mathrm A = 36\ \mathrm W$$  I charge my phone for 4 hours a day at most. In that case, I use 144 watt-hours a day, and 51840 Wh a year, or 51.84 kWh. And that seems awfully lot, considering that all the articles I've read about the power consumption of chargers stated that they used about 2 kWh a year. I know I charge my phone too much (I really need a new battery), but it still doesn't add up. Are my calculations wrong? And if they are, what is the correct number?


System freezes when using too much memory in Python

I am using Python (both 2 and 3) for data analysis. When loading large data sets (eg. into a numpy array) then my whole system freezes. It does not react to anything, also not Ctr + Alt + F1. So I have to do an hard reset.  I have this problem in both Ubuntu and Debian.  Is there a way to execute a Python script "save", so that the script crashes and not the whole system?


Can a Jedi manipulate electronics? For instance could they scramble the machine code running on a robot?   If they can't why not? They can manipulate physical objects so manipulating the insides of a computer shouldn't be a problem should it?


Given matrix $A$, find the number of solutions of $X^2 = A$.

Given the matrix:      $$ A =      \begin{pmatrix}     0 & 0 & 1 \\     0 & 1 & 0 \\     1 & 0 & 0 \\     \end{pmatrix}  $$      Find the number of solutions (in $M_3(\mathbb{R})$) of the equation $X^2 = A$.    I tried writing $X$ as:  $$ X =      \begin{pmatrix}     a & b & c \\     d & e & f \\     g & h & i \\     \end{pmatrix} $$  And then I multiplied $X$ by itself and created a system with the terms of $X^2 = A$, but $X^2$ is very messy and I got stuck. I couldn't solve this problem. Is there another (and possibly better) approach to this?


Leafpad not available for newer releases of Ubuntu?

I see that my favourite text editor Leafpad has been dropped by Debian and now also from Ubuntu versions 19.04 Disco Dingo and onward. How can I get this simple text editor installed now?