\citefield{key}{author} and \citefield{key}{journal} of biblatex do not work

Consider following MWE:  \documentclass[varwidth]{standalone}  \usepackage{biblatex} % version 3.3 with biber 2.4 (TexLive 2015) \begin{filecontents}{\jobname.bib} @article{example,   author  = {AUTHOR A, AUTHOR B},   journal = {NAME OF JOURNAL},   title   =  {NAME OF PAPER},   year    = {2016},   volume  = {12}, } \end{filecontents} \addbibresource{\jobname.bib}  \begin{document}  \begin{itemize}   \item \citefield{example}{author}   \item \citefield{example}{journal}   \item \citefield{example}{title}   \item \citefield{example}{year}   \item \citefield{example}{volume} \end{itemize}  \fullcite{example} \end{document}     As you can see author and journal are not given. What is the problem or is there a bug in this biblatex version?


Specifying map service parameters when publishing with ArcPy?

I publish map services on a ArcGIS server using the typical arcpy script below. I need to better specify some service parameters. For example, the service should be available in WMS instead of KML, with anti-aliasing and some specific pooling parameters.  Is there a way to specify these parameters using some arcpy functions?  connection6546543 = 'C:/blabla/arcgis on myserver.eu (admin).ags' folder1116 = "Myfolder"  def publishService(mxdPath, service_name, summary, tags):     sddraft = 'C:/services/' + service_name + '.sddraft'     if os.path.isfile(sddraft): os.remove(sddraft)      # Create service definition draft     map = arcpy.mapping.MapDocument(mxdPath)     arcpy.mapping.CreateMapSDDraft(map, sddraft, service_name, 'ARCGIS_SERVER', connection6546543, True, folder1116, summary, tags)      # Analyze the service definition draft     analysis = arcpy.mapping.AnalyzeForSD(sddraft)      # Print errors, warnings, and messages returned from the analysis     print "The following information was returned during analysis of the MXD:"     for key in ('messages', 'warnings', 'errors'):         print '----' + key.upper() + '---'         vars = analysis[key]         for ((message, code), layerlist) in vars.iteritems():             print '    ', message, ' (CODE %i)' % code             print '       applies to:',             for layer in layerlist:                 print layer.name,             print      # Stage and upload the service if the sddraft analysis did not contain errors     if analysis['errors'] == {}:         print 'Create service definition...'         sd = 'E:/services/' + service_name + '.sd'         if os.path.isfile(sd): os.remove(sd)         arcpy.StageService_server(sddraft, sd)          print 'Publish service...'         arcpy.UploadServiceDefinition_server(sd, connection6546543)         print "Service successfully published"         print 'Clean sd'         if os.path.isfile(sd): os.remove(sd)     else:          print "Service publication failed: Errors during analysis."      print arcpy.GetMessages()      print 'Clean sddraft'     if os.path.isfile(sddraft): os.remove(sddraft)     Detailed solution  The detailed solution I developed with the answers is the code snippet below. It has to be inserted between the draft service creation and draft service analysis. It modifies some parameters (UsageTimeout, KML off and WMS on, etc.) but can easily be adapted to others.  import xml.dom.minidom as DOM   (...)  # change service parameters doc = DOM.parse(sddraft) keys = doc.getElementsByTagName('Key') for key in keys:     if key.firstChild.data == 'UsageTimeout': key.nextSibling.firstChild.data = 6000     if key.firstChild.data == 'WaitTimeout': key.nextSibling.firstChild.data = 60     if key.firstChild.data == 'IdleTimeout': key.nextSibling.firstChild.data = 20000     if key.firstChild.data == 'MinInstances': key.nextSibling.firstChild.data = 1     if key.firstChild.data == 'MaxInstances': key.nextSibling.firstChild.data = 1 services___ = doc.getElementsByTagName('TypeName') for service__ in services___:     if service__.firstChild.data == 'KmlServer':         service__.parentNode.getElementsByTagName('Enabled')[0].firstChild.data = 'false'     if service__.firstChild.data == 'WMSServer':         service__.parentNode.getElementsByTagName('Enabled')[0].firstChild.data = 'true'  # save changes if os.path.exists(sddraft): os.remove(sddraft) f = open(sddraft,"w") doc.writexml(f) f.close()


If I know $AB$, how can I calculate $BA$?

Let $A∈\mathscr{M}_{3×2}(\mathbb{R})$ and $B∈\mathscr{M}_{2\times3}(\mathbb{R})$ be matrices satisfying   $AB =\begin{bmatrix} 8 &2 &−2\\ 2 &5 &4\\ −2 &4& 5 \end{bmatrix}$. Calculate $BA$. (Golan, The Linear Algebra a Beginning Graduate Student Ought to Know, Exercise 426.)   Maybe it can be solved by solving a system of equations, but I think there is a shorter way since this problem was in my exam.  Thanks.


Loop in PGFPlot axis environment / Adding value above data points

I have two problems when trying to add the value of a data point above the data point. I am trying to solve this with a for-loop:  \documentclass[12pt]{article} \usepackage{tikz} \usepackage{pgfplots} \pgfplotsset{compat=newest} \begin{document}  \begin{tikzpicture} \def \myvalues{{50,50,31,25,24,24,24,24,24,24,24,24,24,24,24}}%   \begin{axis}[     width=\textwidth,     height=.40\textwidth,     xlabel={x},     ylabel={y},     xtick={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15},     ytick={20,25,30,35,40,45,50},     xmajorgrids,     ymajorgrids, ] \addplot [black, mark=*, mark options={solid}] table {% 1 50 2 50 3 31 4 25 5 24 6 24 7 24 8 24 9 24 10 24 11 24 12 24 13 24 14 24 15 24 };   \pgfplotsinvokeforeach{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}{         \pgfmathparse{\myvalues[#1-1]};     \node at (#1,\pgfmathresult+2){\pgfmathresult};     }  \end{axis}   \end{tikzpicture} \end{document}   Problems:   Document compiles without errors, but the nodes don't show up in the plot. How can I add an if-statement into the for-loop? For example to change the color of the node to red for the nodes 4 and 12?   Thanks a lot!  -


How to avoid using sudo when working in /var/www?

I want to stop having to use sudo everytime I work in /var/www. How can I do that? I simply want to put all of my sites into this directory and work with them without too much pain.


Help! I backed up my "common" folder when I reset my PC, but now, when I try to copy it into "steamapps", Steam doesn't detect the files AT ALL. I have really slow internet, so I'd be looking at about a week of re-downloading my 14 games if I can't resolve this!  I'm on windows 10.


Which 64-bit server image to use for Intel Pentium G3220?

Soon, I'll have to install an Ubuntu Server on a computer with a Intel Pentium G3220 64-bit instruction set processor. So I'm looking at the current LTS Server edition, 14.04.4. However, the page says:   (via  then "Other images"):     There are three images available, each for a different type of computer:         64-bit Mac (AMD64) server install image   Choose this to take full advantage of computers based on the AMD64 or EM64T architecture (e.g., Athlon64, Opteron, EM64T Xeon, Core 2). ...     Mac (PowerPC) and IBM-PPC (POWER5) server install image   For Apple Macintosh G3, G4, and G5 computers, including iBooks and PowerBooks as well as older IBM OpenPower 7xx machines.     PowerPC64 Little-Endian server install image   For POWER8 Little-Endian computers, such as Power Systems S8xxL/LC Linux-only servers.        Ok, I don't get it - which one of these is applicable for an Intel Pentium-processor based system? As far as I know, Pentium is not AMD, nor is it PPC?


Cannot FInd a Driver for a Wireless PCI Card, Netis Systems WF-2117

I'm running 12.04 and do not have a clue how to set up my wireless card. The strange thing is the box says that it's made by netis.  But on a query (lspci) of the device, it says:  01:02.0 Network controller: Ralink corp. Device 5362  I guess Ralink manufactured their chips. I looked on the NETIS site, and they only have a windows driver. I looked on the Ralink site, which has moved, and they do not have a driver for that device or model number.  Could someone suggest a driver that might work as far as the ralink ones go or is there a workaround maybe?  Hoping someone else has some time and can walk a newb through this task.


How do I render nodes, now that node_view() has been deprecated?

In Drupal 7 I frequently use node_view() for rendering nodes (using view modes) in blocks or pages as follows:  $nids = array(123,456,789); $nodes = node_load_multiple($nids); foreach ($nodes as $node) {   $node_view = node_view($node, 'teaser');   $output .= drupal_render($node_view); } $build['nodes']['#markup'] = $output; return $build;   node_view()/entity_view() has been deprecated and replaced by a view builder as explained in change record . The information is not detailed enough for me to be able to figure out how to achieve the same result.  How can you render nodes in Drupal 8 so that the output can be used in the render array of a block or page?


How can I get past this C4430 Compiler Error in C++?

I'm extremely new to the coding scene and, even more so to coding with C++.  I'm currently building a side program for my class as it was strongly recommended, but I can't seem to get it to compile.  I keep getting a C4430 error (missing type specifier - int assumed).  I'm not seeing anything like this in my reading material either, so I figured I'd reach out here for help as a second set of eyes is always a good idea.  If it matters, I am coding this with Microsoft Visual Studio 2019 Community Edition.  I'm still learning, but I'm also used to coding in Java at this point so I'm at a loss.    The program itself is a program I have written in Java, that I have adapted for use in C++.  It's a very basic salary calculation program that spits out weekly, monthly, and annual wages while also accounting for Taxes.  Initially, it had included the scanner utility in Java, but I haven't seen anything like that in C++ yet.  Ideally, it would spit this information out without a problem.   I have tried adding return 0; to the end of my code, but I am still getting the C4430.  I have also reclassed my main as double instead of int, to no avail.  I have included my code, below:  #include <iostream> double salaryCalculator; main () { double hourlyWage = 15.00; int hoursWorkedWeek = 40; double weeklyWage = 0.0; double monthlyWage = 0.0; double annualWage = 0.0; double overtimeHours = 3.0; double overtimeMulti = 1.5; double overtimeHourlyWage = 0.0; double overtimeTotalWage = 0.0;  overtimeHourlyWage = hourlyWage * overtimeMulti; overtimeTotalWage = overtimeHourlyWage * overtimeHours; std::cout << "You have /n" << overtimeHours << "hours of overtime at a rate of " << overtimeHourlyWage << "an hour, for a total of " << overtimeTotalWage;  weeklyWage = overtimeTotalWage + (hoursWorkedWeek * hourlyWage); std::cout << "Your weekly wage is: /n" << weeklyWage;  monthlyWage = weeklyWage * 4; std::cout << "Your monthly wage is: /n" << monthlyWage;  annualWage = weeklyWage * 52; std::cout << "Your annual wage before taxes is: /n" << annualWage;  enum class TaxDeductions; { };         double incomeTax = 0.11;         double stateTax = 0.04;         double socialSecurityTax = 0.062;         double medicareTax = 0.0145;          double firstWTax = weeklyWage * incomeTax;         double secondWTax = weeklyWage * stateTax;         double thirdWTax = weeklyWage * socialSecurityTax;         double fourthWTax = weeklyWage * medicareTax;         double weeklyTax = firstWTax + secondWTax + thirdWTax + fourthWTax;          double firstMTax = monthlyWage * incomeTax;         double secondMTax = monthlyWage * stateTax;         double thirdMTax = monthlyWage * socialSecurityTax;         double fourthMTax = monthlyWage * medicareTax;         double monthlyTax = firstMTax + secondMTax + thirdMTax + fourthMTax;          double firstATax = annualWage * incomeTax;         double secondATax = annualWage * stateTax;         double thirdATax = annualWage * socialSecurityTax;         double fourthATax = annualWage * medicareTax;         double annualTax = firstATax + secondATax + thirdATax + fourthATax;            double weeklyTakeHome = weeklyWage - weeklyTax;         double monthlyTakehome = monthlyWage - monthlyTax;         double annualTakeHome = annualWage - annualTax;          std::cout << "Your weekly total take home is /n" << weeklyTakeHome;         std::cout << "Your monthly total take home is: /n" << monthlyTakehome;         std::cout << "Your annual total take home is /n" << annualTakeHome;          return 0;     }   Thank you for your time.


Get the different values assigned to a zip code

I have a map to which I added a zip code layer and another layer which contains values assigned to every square kilometer within each zip code. I'm trying to find out how many different values there are in each zip code and what they are.   So for example, if a zip code has 10 values assigned to it in total, 5 of them being 1.5, 3 of them being 2.1 and the remaining two being 6.4, this zip code basically has 3 different values, namely 1.5, 2.1 and 6.4. That is what I want to know. Is there a way to do this without manually checking all the values in every zip code?    This is a screenshot of my data. The value that I'm working with is under the column BI. I need a table which gives me a list of the long/lat in every zip code and the corresponding values. I can't do anything on excel yet since I don't know which lat/long goes with which zip code.


I am currently using \documentclass[12pt,reqno]{amsart}   I am currently using    \bibliographystyle{apalike}          \bibliography{harry}   with   \usepackage[numbers]{natbib}   I want my references sorted by as they appear in text with numbers. However the references are sorted by alphabetical order.


How can I decrease a DC voltage without a resistor

I would like to light up a 2 W LED with a 3.7 V power source in the most efficient way possible. The Vf of the LED is 2.4 V. Is there any way I can reduce the voltage to 2.4 V from 3.7 V without using resistors as with a required current of 350 mA, the power wasted as heat in the resistor is too high. I am looking to find an easy way of accomplishing this as the circuit has to be used in a low cost device that needs to be efficient and cheap.


This may be a naive but i am not able to understand how javascript assign values to its variables. In this , i came across the following code.  function greaterThan(n) { return m => m > n; } let greaterThan10 = greaterThan(10); console.log(greaterThan10(12));   How is m assigned the value 12 ? This does'nt give compile time as well as runtime error. Only if i remove m =>, i get an error that m is not  defined.


How are the age restrictions followed by ICC for under 19 cricket tournaments?

I have some doubts under this topic,   Can a player aged 19 play under 19 international cricket match? (Since 19 is not under 19) Consider a player having birthday during the series/tournament. How the age will be calculated for him?


Evaluate $\lim_{n\to\infty} [{1\over kn}+{1\over k(n+1)}+{1\over k(n+2)}+\cdots+{1\over k(n+p-k)}]$ where $k<p$

There are four options. Which of them is correct?- (a)${p\over k}$ (b)${k\over p}$ (c)$\log({p\over k})$ (d)${\log p\over k}$ I somehow want to use the rule for evaluating this kind of sum using integration, i.e. $\int_{0}^{1} f(x) \ dx=\lim_{n\to\infty} {1\over n}\sum_{r=1}^{n}f({r\over n})$  But the given expression $\lim_{n\to\infty} [{1\over kn}+{1\over k(n+1)}+{1\over k(n+2)}+\cdots+{1\over k(n+p-k)}]={1\over k}\lim_{n\to\infty}{1\over n}\sum_{r=0}^{p-k}\frac{1}{1+{r\over n}}$, sum running from $0$ to $p-k$ instead of $n$. So, how to evaluate this limit? Thanks for assistance in advance.


How to proof that $e^{x^2}$ does not have a primitive function?

I was wondering how you proof that the function $f(x)=e^{x^2}$ does not have a primitive function. I have heard en read this example multiple times, but I don't know how to proof it.


Return by reference inside a switch statement

I want to return by reference to a variable that's inside a switch, like for example: sometype & getbar();  void foo() {         switch ( {statement} ) {         case {statement}:             sometype & handle = getbar();         ...  But I'm getting compiler errors:  initialization of 'identifier' is skipped by 'case' label initialization of 'identifier' is skipped by 'default' label  And it looks like it's not possible to do this: void foo() {         sometype & handle;         switch ( {statement} ) {         case {statement}:             handle = getbar();         ...  Because a reference variable requires initialization. Is there a way to do this with keeping the switch statement?


Can you install 3rd party software on ubuntu?  We use microsoft office at my business and I word like to install it onto ubuntu to prevent any formatting problems at work.  Is this possible?


transfer of heat from lower to higher temperature

Can heat be transfer from low temperature body to high temperature body? Because according to second law of thermodynamics it can be transfered. But how?


Is a post doc advisor who makes superficial contribution entitled to authorship?

I am a postdoc with two advisors (not something I would recommend for everyone). I would describe the involvement of my two advisors in the project I undertook as quite superficial. I met and discussed a lot with them, they gave me some useful ideas, but they didn’t contribute much to the core of the project.  I didn’t even feel they put genuine effort to understand what I was doing.  Most of their feedback was related to ideas that didn’t work or was not implemented. If the right for authorship is defined by a significant intellectual contribution, then I wouldn’t really describe their role as such.   Is it ethical to include them as coauthors in the article summarizing this project, with an author contribution statement that describes each one’s role?   In this case their role will be something like giving useful tips, analyzing the results, ..etc.


Sorting a list using Lambda/Linq to objects

I have the name of the "sort by property" in a string. I will need to use Lambda/Linq to sort the list of objects.  Ex:  public class Employee {   public string FirstName {set; get;}   public string LastName {set; get;}   public DateTime DOB {set; get;} }   public void Sort(ref List<Employee> list, string sortBy, string sortDirection) {   //Example data:   //sortBy = "FirstName"   //sortDirection = "ASC" or "DESC"    if (sortBy == "FirstName")   {     list = list.OrderBy(x => x.FirstName).toList();       }  }    Instead of using a bunch of ifs to check the fieldname (sortBy), is there a cleaner way of doing the sorting Is sort aware of datatype?


Why does a ring homomorphism induce a continuous map between spectra?

Let $\varphi: A \rightarrow B$   be a ring homomorphism. Let $f =\mathrm{Spec}(\varphi) : \mathrm{Spec}(B) \to \mathrm{Spec}(A)$ be the map associated to $\varphi$.  Why is the map $f$ is continuous?  I think we need to use $IB$ (the ideal of $B$ generated by $\varphi(I)$).  Then we got $f^{-1}(V(I)) = V(IB)$. (why?)  Could someone tell the details of this proof? Thank you :)


How to get Capital letters in the first letter i entered

If i entered "name" in my text box while it saved it must be saved like "Name"   Capital letters in the first letter of Alphabet  It must not show any error messages it must directly save


Voting on a post after X hours after you edit it

After you try to vote on a post that was last edited X hours ago, you get the following message:    There is an unfair workaround - You can make a trivial edit to the post, then vote again on it.  While trivial edits shouldn't be encouraged, they still give you the ability to vote whenever you want on whatever you want, which can not fair sometimes.  Why it is designed that way? Shouldn't this be changed? I mean, shouldn't it be an error if you try to change your vote after editing someone's else post just because you want to change your vote?


I need help converting from base 36 to base 10

As an example, I want to convert:  1j16qd5g0lc  To:  5589146303201280  But currently ‘tonumber’ converts it to:  5.5891463032013e+15  I understand that there is a bit.tonumber function that might work better but that function is not available to me. Could someone implement what I need easily? I am not too familiar Lua.  Thank you! :)


Nikon in-camera vs lightroom jpg conversion

I'm just getting started with Lightroom 4.  I've been shooting RAW + JPG using my Nikon D7000, but would like to just shoot RAW and then convert to JPG in Lightroom.  What's the most efficient way to convert a group of files to JPG and end up with approximately the same look and quality that I get out of the in-camera conversion?  Does Lightroom apply any processing if I just import all the files and then directly export them to JPGs without changing anything?


Find a simpler description of the following set: $\bigcup_{i=0}^{\infty}[i, i+2]$?

I asked a similar question last night asking for an explanation of the statement, however I was unable to find how to prove such a statement, so I have a proof, however I think it is wrong, so I'm just asking for it to be checked and if it is, for it to be corrected, thanks!   Question  Describe the following set, and prove your answer correct. (Here brackets denote intervals on $\mathbb{R}$.)  $\bigcup_{i=0}^{\infty}[i, i+2]$  Working  $[i,i+2]=${$x\in\mathbb{R}|i\leq x\leq i+2$}  Thus, with the union we have {$x\in\mathbb{R}|i\leq x\leq i+2$}$=[0, \infty)$  Now, note that $\bigcup_{i=0}^{\infty}[i, i+2]=[0, 2]\cup [1, 3]\cup [2,4]\cup...\cup[k, k+2]\cup...$ for some $k\in\mathbb{R}$  Consider $x \notin [0, \infty)$ then $|x|>[0, \infty)$, so $\exists$ some $i\in\mathbb{N}$ such that $i<|x|$. Thus, $x\notin (0, \infty]$  $\therefore x$ is not the union  Thus, we have shown the union of $[i, i+2]$ is on the interval $[0, \infty)$ so;  $\bigcup_{i=0}^{\infty}[i, i+2]=[0, \infty)$


Can I transfer some money into my bank account before applying for a UK visa?

I'm going to apply for a visit visa with 2 of my dependants. I'm wondering if I can use my UK bank statement which has been idle for couple of years. Currently, I'm living in Pakistan since I completed my education back in 2013. I'm wondering If I transfer some amount in that account before applying for a Visit visa. This is important to add here that my bank account is active but no transaction has made since September 2013!


The subring of $k[x, y]$ generated by $\{x y^{i}: i\geq 0\}$ is not finitely generated over $k$

Let $R$ be the subring of $k[x, y]$ generated by $\{x y^{i}: i\geq 0\}$. Can someone explain why $R$ is not finitely generated as a ring over $k$ (i.e. finitely generated as a $k$-algebra)?   By definition, $R$ is the smallest subring over $k$ containing the set $\{x y^{i}: i\geq 0\}$. So it contains all expressions $x y^{i}$, but it also contains all polynomials in $x y^{i}$ with coefficients in $k$, such as $x y^4 + 7 x y^8$. Now, let's assume, to the contrary, that $R$ is generated by $n$ elements $f_1, f_2, …, f_n$. Then each $f_j$ is a polynomial in $xy^{i}$ (as $i$ ranges over finitely many choices). But where do we get a contradiction from here?   Source. This example is taken from Mariano's answer .


Finding the generators of the adjoint representation

Let $G$ be a lie group and $\mathfrak{g}$ it's associated lie algebra.I can quite easily show that if there is a Lie group representation $\rho_{G}$ from $G$ into $L(G)$:  $$ \rho_{G}: G \rightarrow \mathfrak{g} \;  ; g \rightarrow Ad(g)  $$  Such that for any $X \in \mathfrak{g}$,  $Ad(g)X:=gXg^{-1}$  Then we have a corresponding lie algebra representation $\rho_{\mathfrak{g}}$:  $$ \rho_{\mathfrak{g}}: \mathfrak{g} \rightarrow End(\mathfrak{g}) \; ; X \rightarrow ad(X)$$  Such that $ ad(X)Y = [X,Y]$   But why is it true that the generators of this are the structure constants? (i.e the basis of the adjoint algebra is the structure constants?)    Since $ad$ is just a LA homomorphism, if $T_{\alpha}$ is a generator of $\mathfrak{g}$ then, $ad(T_{\alpha})$ must be a generator of $End(\mathfrak{g})$? But $ad(T_{\alpha}) = [T_{\alpha},-]$ Clearly I'm seriously confused about something here...  EDIT   I think my confusion has something to do with a lack of understanding of dual spaces.(?)   The point is, $ad(T_{\alpha}) = [T_{\alpha},-]$ is indeed the corresponding basis operator in the adjoint representation However that operator can be defined (in a certain basis) as a matrix - and the natural basis to define that matrix in is our original $\{T_{\rho}\}$. In which case:     $$ ad(T_{\alpha})_{\text{Basis of}\mathfrak{g}} = \begin{pmatrix} [T_{\alpha},T_{1}].... [T_{\alpha},T_{n}] \end{pmatrix} $$    So that the components of $ad(T_{\alpha})$ in this basis are indeed the structure constants - although technically, it is more correct to say that $ad(T_{\alpha})$ is the abstract generator?


How to run Blender through RDP on Windows Server 2008 R2 - opengl error

I want to render my blender project in rdp. But some error has appeared. What is the best solution for this problem? I've spent many hours trying to troubleshoot this problem.


Can we have a "This is spam" radio in the Low Quality Posts queue?

I see a spammy post every now and then in the Low Quality Posts review queue, but there isn't a relevant comment I can leave the spammer. Therefore, I have to choose 'No comment Needed'. Can we have yet another choice?  This post is spam Flag this post as spam  Currently I have to press the link button on the side, go the the post, mark it as spam, then go back to the queue and mark it for deletion. Quite a hassle, don't you think?


Is the tag wiki retained for a tag that gets removed for having no entries?

If a tag wiki becomes inaccessible due to a tag being eliminated, is the data destroyed? Or would it be able to be recovered by just recreating the tag?  On Gaming we had one tag for a particularly difficult case that a wiki entry was written for. There has been some debate as to what we should keep the tag as, which has led to the only instance of the tag being renamed a few times and eventually left on a new tag. The nightly script eventually cleaned out the original tag, and the wiki is inaccessible. So would I be able to retrieve this by reverting to the original tag, or is a rewrite of the wiki necessary?


It's said that if  is spared in  quest, he remains in the Dawnstar sanctuary and can be later hired as a follower. Well I did just that and I can't find him anywhere. Where exactly is he? Does he disappear and only reappear after some other moment in the game?


$X$ is a non negative ramdom variable, prove that $EX = \int_{0}^{\infty} P(X>t)dt$. Well I don't know how to start to prove this, I have a clue that says to me that is: write $P(X>t)$ as the integral of the index function and use the Fubini's theorem.


What are these circular splotches on my negatives?

This is my first roll of Tri-X 400, developed with D76 using Massive Dev's chart in this order:   developer  stop bath (tap water) fixer  tap water (quick 1 minute wash) Photo Flo (2 minutes) tap water (final wash, 11 minutes)   then off to the scanner the next day (V500 flatbed) for scanning.  There are some weird effects going on however in most of the frames, as well as the usual pixelated look I've grown accustomed to with flatbed scanning 35mm.  I've highlighted the spots in the photos below:      I am wondering what this is and how I can fix it. Using distilled water maybe?


A block in understanding a proof of Sylow's Theorem

If $G$ is a finite group of order $n$ and $p$ is a prime divisor $|G|$, then according to one of Sylow's theorems $G$ has a subgroup of order $p^m$, where $p^m$ is the highest power of $p$ which is a factor of $|G|$.  Here is a rough outline of the proof I am trying to understand. Let $|G|=k\cdot p^m$, where $k \in \mathbb{Z^+}$.  The proof begins by defining the set $X=\{A \subseteq G:|A|=p^m\}$ and the action of $G$ on $X$ by left translation, $G \times X \rightarrow X:(g,A)\mapsto gA$. The size of $X$ is the binomial coefficient ${k \cdot p^m}\choose {p^m}$. Here is where I lose the line of argument:  (1) the size of $X$ is not divisible by $p$, and (as a result)...  (2) ... there must be an orbit $G(A)$ whose size is not a multiple of $p$.  Any clarification as to why this is the case?


I have these old lens, that I mounted on a Nikon F601m, now broken:   Nikon AF Nikkor 50mm 1:1.8 Nikon AF Nikkor 28mm 1:2.8 Sigma UC Zoom 70-210mm 1:4-5.6   Now I am thinking of buying a used Nikon D300, but I ask if I can still use my old lens. Thank you.


Basic buoyancy question: Man in a boat with a stone

This comes from a brain teaser but I'm not sure I can solve it:     You are in a rowing boat on a lake. A large heavy rock is also in the boat. You heave the rock overboard. It sinks to the bottom of the lake. What happens to the water level in the lake? Does it rise, fall or stay the same?   I'd say that the water level drops, because when you drop the stone in the lake, the water level rises according to the volume of the stone, BUT the water level decreases by a volume of water weighting the stone's weight, when you take it off the boat.  Is that correct?


What are some good roll tables for a DM screen?

I made myself a low-budget DM screen out of cardboard, but it doesn't have any tables or information. Does anybody know any essential tables for it? If so, can you share the link with me? I already printed out a weather table.


The app doesn't have a way to show your own questions. It would be nice to get a quick handle to those.


I want to backup my home directory to an external drive nightly using a cron job to execute rsync.  I am unsure of the exact behavior of rsync's symbolic link flags.   rsync's -a flag includes the -l flag (i.e. "copy symlinks as symlinks").  Does this just mean it will copy the link or that it will follow the link and copy everything in the link-to directory?  I want to avoid that because I have links to directories full of media files that would involve copying hundreds of gigabytes I don't need to back up. Fearing (but not certain) that rsync -a would copy all those media files I instead added the --no-links flag.  This does not seem to be behavior I want.  It just ignores copying any link which is problematic because I do have links I want copied (e.g. links to common header files from different project directories). Assuming #1 above (without the --no-links flag) is what I really want and it just copies the link without copying the linked-to files, will the links break when they are backed up?  For example I may rsync source directory /home/me/projects/misc to /media/extdrive/backup/home/me/projects/misc.  In this case I assume rsync is not smart enough nor does it try to correct the contents of symlinks for the relative directory changes.  Is this correct?  This is okay, it doesn't matter if the links are broken in the backup directories so long as they would be fixed and working if such time comes when they need to be restored.


Site choice dropdown cannot be shown on Android app

Steps to reproduce:   Ask a question, open the "Ask on which site?" dropdown menu. Press the back button.   Issue: the menu will disappear and you can't bring it back by tapping the arrow or the field. Only typing text or selecting another field then tapping back will return the dropdown menu.


SQL Server - what isolation level for non-blocking select statements?

I have a long running transaction (called, say, T1) that performs some deletes, updates and inserts on a table in SQL Server 2008 R2. At the same time, another process periodically runs select statements from this table.   Under default isolation settings (READ COMMITTED I think?), T1 blocks any select statements from running until the transaction commits or is rolled back.   What I'd like to see is for the select statements to function on consistent data even while the transaction is underway. I believe SNAPSHOT isolation can help, but am not sure if I'm going in the right direction. Would this be the best isolation level for this application?  Secondly, I don't have any control over the process that is calling the select statements, but I do have control over the .NET application that calls T1. Would any isolation level changes be required on both the select statements and T1, or would it be sufficient to mark  just T1 as having a different isolation level?


How could a normal razor/scissor cut Superman's hair?

As the title suggests, my question is simple here, how Superman was able to cut his hair using normal razors and scissors? As no Earthly material is strong enough to cut Superman's any body part.   Shouldn't his hair also be as strong as his whole body?


Make "appendix X" be shown in the appendix title as in the toc

I would like the appendix numbering to be in the format of: Appendix A The contents of the appendix A Appendix B The content of the appendix B Also I would like have it like this in the toc. Is there a way to do it? I couldn't find it anywhere.


Can someone enable syntax highlighting for verilog and system-verilog code in SO?


How to tell the sizes of files and folders, sorted, and in MB, GB, instead of a long integer?

On a Mac, using Bash, I tend to do  du -sh *   to tell the sizes of files and folders in the current directory, in MB and GB.  But if I want to sort them by the sizes, I might do  du -sh * | sort -g   and it won't work well, because the M and G is not taken into account (so 44MB might be thought to be larger than 20GB, because 44 is greater than 20).  Is there a way not to write a program and just use UNIX commands and/or a Bash function to do that?  If I care about the files and folders that are in the GB range, I can do:  du -sh * | egrep "^\s*\d+(.\d+)?G\s" | sort -g   and it will show  2.6G    ski video clips 7.6G    trip 2012.mp4  12G    trip photos     but if TB or MB is to be considered, then the above will not work.  Is there a way to do this more generally using UNIX / Mac OS X commands?


Running Sublime 2 from the launcher opens Sublime 1 version

I previously had Sublime 1 installed on my system. I subsequently installed Sublime 2. I unpinned Sublime 1 from the launcher, opened Sublime 2, and pinned it to the launcher. However, when I run Sublime 2 from the launcher, Sublime 1 runs instead. How can I fix this issue? Thanks.


Why is voltage equal across the resistors connected in parallel?

Say I have a circuit and three resistors connected on parallel. Then if I want to calculate equivalent resistance i use the ohms law(V=IR). Call the three resistors R1,R2,R3 and current passing through them as I1,I2,I3 respectively. Now in my textbook it was given from here as follows:- Let I=I1+I2+I3, which is the total current passing through the resistor. By ohm's law, V/R = (V/R1)+(V/R2)+(V/R3) So the equivalent resistance equals the sum of reciprocals of each  resistor. The thing which confused me is why is potential difference equal for all of three resistors connected in parallel? I am confused with the fact that ,if resistance is changing then voltage must also change (by ohm's law) then why isn't it true here?


Prove that $PSL(2,\mathbb{Z})$ is free product of $C_2$ and $C_3$

Prove that $PSL(2,\mathbb{Z})=C_2 \star C_3$.  Now $C_2 \star C_3=\langle a,b\ |\ a^2, b^3 \rangle$ i.e. the free product.  But how do I show that presentation of $PSL(2,\mathbb{Z})$ is this?


How to swap columns in a tsv file, while keeping the tab delimiter?

For example, you have:     name  1   2   3   4   5   6   7 8   With tab delimiter ^  And I want to switch between 2 columns (for example 7th and 8th if you start with 0) so it would look like:     name  1   2   3   4   5   6   8 7   Eventually, it should be probably other column indexes..  I tried using awk but got a lot of errors. Could you explain?  The command I tried was:  awk ' { t = $10; $10 = $9; $9 = t; print > "test2.txt"; } ' test.txt    It created a new file, but without the tab delimiter. (With space delimiter)


window.postMessage not working from iframe to parent document

I'm trying to send a simple message from a child document (an iframe) back to its direct parent using the window.postMessage API.  Within the parent document I have the following:  window.addEventListener("message", receiveMessage, true); var receiveMessage = function(event) {     console.log("Recieved event " + JSON.stringify(event)); }   Then, in the iframe I have the following:  window.parent.postMessage('message', '*');   Based on everything I've read, this should work and my log message should be written to the console.  Except it's not working.  I'm aware that using the * as the targetOrigin is not always secure, but at this point I just want to sort out the linkage.  Any ideas or anything obvious that I'm missing?


Simply put, every House has some characteristics they search after. Gryffindor has  bravery, Slytherin has purity, and Ravenclaw has intelligence. But Hufflepuff?     Said Hufflepuff, ‘I’ll teach the lot,   And treat them just the same.'   Hufflepuff takes students from far and wide (ideally), as there are no special requirements for being chosen. Thus, logic would dictate that there would be more Hufflepuffs- someone not brave, or pure, or intelligent, but is, like, really good at pottery would go in just the same as that one weird kid that is only good at music.  Hufflepuff should be an enormous umbrella of students rejected from other houses, and schools, but we can see that is not the case:    Each table has the new students from each house. Each number is roughly equal, which seems wrong. If so many students can become Hufflepuffs, why aren't there more of them?  Where are all the Hufflepuffs?


How to make apt recognize an installed tar package?

I've installed Oracle Java. I want to be able to remove OpenJDK, but when trying to do so apt wants to install another version of Java.   How can I configure apt so that it knows I already have a third-party Java installed so I can remove these OpenJDK packages?


Formal definition of equation and unknowns

I was just wondering about the formal definition of equation, I mean in terms of logic and the theory of sets. Suppose for example I wanted to define an equation on $\mathbb{R}$, of course it might be anything instead. I know every number is a set, and also I know that equality of sets has been defined previously. So I often hear people say something like "A linear equation is an object of the form $a_{1}x_{1}+a_{2}x_{2}+ \cdots + a_{n}x_{n}=b$".  But how do you justify the part of "$x_{i}$ is an unknown". Because in that case I would also say that $3(2)+4(5)=0 $ is an equation.


Definition of norm when dealing with inner product space

Is it possible to have a norm in an inner product space, such that $\lVert v\rVert\neq\sqrt{\langle v,v\rangle}$?  In my linear algebra class, we've defined $\lVert v\rVert$ to be equal to $\sqrt{\langle v,v\rangle}$, for each $v\in V$, where we were dealing with an inner product space $(V,\langle.,.\rangle)$.  However, now in a more advanced class in Analysis where we're going to work in multiple dimensions, the norm is defined on a vector space, such that certain properties hold. Does this mean that the definition in my Linear Algebra book was too specific, in the sense that it's also possible to have a norm in an inner product space where the above equality doesn't hold? Or is it true that for each inner product space, the norm equals $\sqrt{\langle v,v\rangle}$?


How to edit Sysconfig file using batch file

My Sysconfig file looks like below   <?xml version="1.0" encoding="utf-8"?>   <configuration>     <appSettings>     <MESCustomMenuID value="" />   </appSettings>   </configuration>  I want to change tag value <MESCustomMenuID value="" /> to <MESCustomMenuID value="SOLUMTE" />  I tried below coding to change tag value @echo off set CWD=%~dp0  set _FilePath=C:\Epicor\ERPDT\Client-Pilot\config\ set _FileName=Default - Copy.sysconfig  set _WrkFile=Default - Copy_bak.xml set OldStr="<MESCustomMenuID value="" />" set NewStr="<MESCustomMenuID value="SOLUTMES" />"   set _Found=Not found  SETLOCAL SETLOCAL ENABLEDELAYEDEXPANSION  for /f "usebackq tokens=*" %%a in ("%_FilePath%%_WrkFile%") do (     set _LineChk=%%a     if "!_LineChk!"==%OldStr% (         SET _Found=Found          SET NewStr=!NewStr:^"=!          echo !NewStr!         ::echo ^<MESCustomMenuID value="SOLUTMES"^>         ) else (echo %%a)         )>>"%_FilePath%%_FileName%" 2>&1  The code above is collapsed sysconfig file XML tags


Sony A7 raw processing in Lightroom, way off

I shoot raw with a Sony A7sII and I am really satisfied with the results of the image previews, until I import them into Lightroom. Lightroom shows the processing thumbnail which reflects how I perceived the image in camera, but it then immediately processes the RAW in a different way with the colors dramatically off.  I am using Lightroom 2015.3 with Camera Raw 9.3, for reference.  Lightroom has a "Camera Calibration" feature in the Develop Settings which is always set to Profile Adobe Standard by default, with the 2012 process. Some of the other profiles more so reflect what I saw in camera and the thumbnail, but after Lightroom processes a RAW for its own catalogue preview, there is no way to undo it for reference. This is very aggravating and I will probably just shoot RAW+JPG to get around it, but this makes my shooting slow down in the field and is less practical.  Is there any way get the RAW processing more reflective of what I perceived in camera for the Sony A7 files?


Probability of observing at least $k$ heads if coins have different probabilities of heads?

I have a collection of Bernoulli RVs $\{X_1, \ldots, X_N\}$ and know the success probabilities of each: $\{p_1, \ldots, p_N\}$.  Is there, in general, a way to efficiently compute the probability of observing at least $K$ successes without enumerating possible outcomes?


I have a few guest machines on VMware. Up until now I was keeping my time sync with ntpd inside guests. Now our VMware admins decided to setup VM hosts to keep time, so VMs don't have to. I disabled ntpd in guests, so far so good.   The problem is that I don't completely trust VMware host's timekeeping and would like to monitor time offset in guests with respect to public time sources.  How can I do that?


How to Keep Section Numbering but Not Include in Table of Contents

I would like have sections in the appendix numbered but not appearing in the table of contents.  If I use the \section command then the section is numbered and appears in the table of contents.  If I use the \section* command, then the section is removed from the table of contents but also the numbering is removed.  How I can keep the numbering?


I want to warp text in a custom shape but I don't want it to be distorted

In the logo I'm making, there is a circle which has text wrapped around it on the upper half. I used the warp tool but it distorts the text and doesn't give the desired effect.  I can't use the type on path tool because that is not the effect I want.   I want the individual letters to be straight and the only way I can think of doing that is to mannually edit each letter to sit around the circle. I was wondering if there was another, more efficient way to fo that.


Ubercart Recurring Payments and Subscriptions:Charge automatically?

I'm using Drupal 6 and Ubercart 6.x-2.7. In my online store I'm going to manage subscription for the products. Every product can be subscribed for some period of time, weekly, biweekly, monthly, semiannually. I'm going to use PayPal PayFlow Pro and PayPal Website Payments Pro gateways to receive payments.   The issue is here how to manage getting recurring payments through this payment gateways? Any php code or something else?  Here I'm including how this process works:   Customer adds required products in his shopping cart.  In the cart there is a select-box per every product for subscription(options: just one time, daily, weekly...) Customer checks out from the site paying with Credit/Debit card or PayPal account.   Question: How to charge automatically the fee for subscription in the selected period?


If the input: int[] nums= [1,2,3], target=4; why the output res=0; the res has not been accumulated?      public int combinationSum4(int[] nums, int target) {         int res=0;         helper(nums,target,res);         return res;     }      private void helper(int[] nums, int target, int res){         if (target==0) {             res++;             return;         }         else if (target<0) return;         else {             for(int i=0;i<nums.length;i++){                 helper(nums, target-nums[i],res);             }         }      }


by this command service --status-all . I can find all services status. in every line there is + or - or ?. Easy to guess + and - which may be refer to running service and not running (I'm not sure).But do not know this ? symbol meaning before services.


On which Canary island is it possible to sleep on the beach?

We are planning a two-night trip to the Canary Islands. The cheapest options include Lanzarote and Las Palmas for flights. Travel dates are last week of November, so I guess weather should be okay. I have never been to these islands. I'd like to sleep on the beach in a tent or mattresses. Is that possible, safety, legality, and weather? It would also be nice to know how populated with tourists the islands are.


Minecraft and Hamachi: Connection timed out

For the longest time, I've been using Hamachi to play with 1 or 2 friends on Minecraft. As of about a year ago, the service has abruptly stopped working (despite me having not changed any settings or preferences, as far as I know) and it just throws a java.net.ConnectionExeption: Connection timed out: no further information: error.  I don't know why this is. The Hamachi network is set to be a Home network, I've tried using Radmin VPN as an alternative (which does the exact same thing), I've turned on the "Allow other network users to connect through this computer's Internet connection", and I've had my friends try to host the server instead. No matter what I do, it returns the same error.  I have looked at other posts on Arqade and all around the Internet regarding people with the same issues, but none of the solutions that are replied seem to actually work with my situation. If anyone here has any idea why Hamachi is doing this, please help me out.


Exporting PDF with Hyperlinked Attributes from ArcMap?

I'm using ArcGIS 10.1 and would like to export a map to a pdf, preserving feature's attributes. I would like to be able to identify, for example, a point feature from the map on pdf with its underlying features (essentially hyperlink to a document or URL). I know one can export to such a pdf in ArcMap, with an advanced option of exporting features with attributes. I use Adobe Acrobat Pro v.10, and cannot seem to be able to find a way to bring these attributes up.   Is this possible?


Why is NULL interpreted as zero in arithmetic operations?

I never knew that PHP (at least ver. 5.6.25) considers NULL as 0 while performing simple arithmetic operations.  Recently, while hunting for the cause of a bug, I came across this. A simple test (indeed) confirms this:  $a = null;  echo $a + 1;    // 1  echo $a - 1;    // -1  echo $a * 1;    // 0  echo $a / 1;    // 0  echo 1 / $a;    // INF (**E_WARNING : type 2 -- Division by zero**)   From my "limited" knowledge of C, NULL is (void *)0. Now, my guess is that PHP "magic" type casting is somehow casting void * to int *?!!   Why did PHP do this? Isn't such "magic" casting (of null) something which should have been left for explicit conversions? What exactly is happening here (if my guess was wrong)?


$15x\equiv 20 \pmod{88}$ Euclid's algorithm

Use Euclid's algorithm to find a multiplicative inverse of 15 mod 88, hence solve the linear congruence $15x\equiv 20 \pmod{88}$  So far I have:   $88=5\cdot15+13$  $15=1\cdot13+2$  Backwards substitution gives  $15v+18w=1$   $1=15-1\cdot13$   $=15-1(88-5\cdot15)$   $=15\cdot15-1\cdot88$   now very stuck what to do from here:(


Is there a app like Flux for the Ubuntu Touch?

I was wondering if there is a app like i have on my Ubuntu laptop. To add a blue light filter. The program i use on my laptop is called Flux. Is it possible to install the same app as i installed on my laptop, on my Ubuntu-phone?  Or is there another app that have the same options?


When using memoir and hyperref I can't make chapters lowercase in the TOC or I get all sorts of errors.  Here's a MWE:  \documentclass{memoir} \usepackage{lmodern}  % \renewcommand{\cftchapterfont}{\scshape}              % WORKS \renewcommand{\cftchapterfont}{\scshape\MakeLowercase}  % DOESN'T WORK  \usepackage{hyperref} % Without hyperref it's all good  \begin{document}   \tableofcontents*   \chapter{One}   \clearpage   \chapter{Two} \end{document}   Any ideas what's going on and how to fix it?


Show that $x^2+y^2+z^2=999$ has no integer solutions

The question is asking us to prove that $x^2+y^2+z^2=999$ has no integer solutions.    Attempt at a solution:   So I've noticed that since 999 is odd, either one of the variables or all three of the variables must be odd.   If I assume that only one variable is odd, I can label the variables like this:  $$x=2k_1+1$$ $$y=2k_2$$ $$z=2k_3$$  By substituting, and doing some algebra, I can conclude that $k_1^2+k_2^2+k_3^2+k_1=249.5$, which is not possible since all $k_i\in\Bbb Z$.  If all three are odd, I can rename the variables like this:  $$x=2k_1+1$$ $$y=2k_2+1$$ $$z=2k_3+1$$ Eventually I conclude that $k_1^2+k_2^2+k_3^2+k_1+k_2+k_3 = 249$, but I don't know where to go from there.   An alternative I've considered is brute-forcing it, but I'd rather avoid that if I can. Any assistance here would be greatly appreciated.


How does one handle a bottleneck of enemies in a doorway?

As a new DM I'm still learning how to control the monsters in a battle. A situation came up last game and although it was fine and fun, I wonder if there are better strategies for a DM to avoid a bottleneck in a doorway.  Scenario: PCs were up against a door deciding whether they should go in. Hobgoblins on the other side of the door open it and an encounter ensues. However, the encounter is basically the PC at the door trading blows with the NPC at the door, while their respective allies in the back try to shoot over their friends' heads. Although you can move through an ally's space, you can't occupy an ally's square. This leads me to assume that you can't move in to an ally's square, attack from it, and move back out of the square (though please correct me if I'm wrong).  This scenario and understanding of the rules brings me to my question.  What tactics can a DM use in a combat scenario like the one above to make sure that the NPCs are all contributing to the battle? Especially if they have no ranged weapons, is there a way that they can all try to attack?


Is there any software for visual display of disk space?

I'm looking for an application which allows me to see what is consuming the most disk space and also to delete the files from there.


I have been given, by someone else, a line of code that I am having trouble understanding.  inputString = "[1,2,3,4,5,6,7,8,9,10,11,12]"  a = inputString[1:-1].split(',') z = zip(a[::2],a[1::2]) # this line print a print z   I understand the split function and how that is operating. I even understand the zip function. What I don't understand is what a[::2],a(1::2) is doing. I have tried modifying these bits of code and get varying results, but nothing that allows me to comprehend what modifying the code does. I am fairly new at Python, and could use a little help.  Typical, unmodified result from the code looks like this:  ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10', '11', '12'] [('1', '2'), ('3', '4'), ('5', '6'), ('7', '8'), ('9', '10'), ('11', '12')]   I am trying to get the result of 'a' to split into groups of 4 instead of groups of two, ie:  ('1','2','3','4'),('5','6','7','8')....etc.


We all know that SSDs have a limited predetermined life span.  So the question for me is how do I check in (Ubuntu) Linux what the current health status of my SSD is? And maybe an estimation how long it will take?  Graphical tool is preferred, but command line tool would also be fine.  I'm using Xubuntu 12.04 LTS


A coin is tossed three times. The probability of zero heads is 1/8 and the probability of zero tails is 1/8. What is the probability that there is at least one head and at least one tail?  So, if P(zero heads)= 1/8 , then that should be the same of p(all tails)?  We would use the complement rule and Multiplication Rule?   P(at least one head) = 1 - P(no heads) = 1 - 1/8= 7/8 P(at least one tail) = 1 - P(no tails) = 1 - 1/8= 7/8  would I multiply the two values?


GNOME 2 allows one to either save the session automatically or manually (i.e. save the session as it looks right now). This is a nice feature because it restores the various desktop states between logins (and system restarts):   which apps were open where (physically) on the desktop were they open what specific window sizes were these apps set to   Looking around, I can't find the feature in GNOME 3? Did I not look hard enough?


Reference Before Assignment (call works in immediate window)

I have a .py config file that sets up a set of global variables. Among them is a variable called nMin. kNeighbors is another global variable defined in the exact same way as nMin. All the other variables included in the block are local variables   for i in range(PopLength):     noveltyMetric[i] = np.average(behavior[i][0:kNeighbors])     if noveltyMetric[i] > nMin:         ...   In the loop, the program references kNeighbors with no issue, but on the next line I get the error:      local variable 'nMin' referenced before assignment"   I'm running this in PTVS 2017 and when it stops & displays the bug (while paused on that line), I call nMin in the "Immediate Window" and it calls the value correctly with no error. When I call the statement noveltyMetric[i] > nMin it returns a Boolean with no error. But for some reason it still fails to execute the line in the code and insists I'm referencing it before it's defined.


calling XPathExpression evaluate() method throws NullPointerException

I'm learning how to use java XPath API and I got a question about behavior of evaluate() method of XPathExpression class.  I have XML file that contains data about employees. I want to find highest payed employee in form of String, so I write this code:  FileInputStream file = new FileInputStream(new File ("D:\\workspace\\NetCrackerTasks\\src\\ru\\ncedu\\java\\tasks\\emp.xml")); DocumentBuilder builder = DocumentBuilderFactory.newInstance().newDocumentBuilder(); Document src = builder.parse(file); XPath xPath = XPathFactory.newInstance().newXPath(); String expression = "/content/emp/employee[not(../employee/sal > xs:decimal(sal))]"; String result = null; XPathExpression expr = null; try {     expr = xPath.compile(expression);     result = expr.evaluate(src); //This throws NullPointerException } catch (XPathExpressionException e) {     e.printStackTrace(); } return result;   When I run this code in Eclipse, expr.evaluate(src) throws NullPointerException.  In documentation on docs.oracle.com() it says that      If source is null, then a NullPointerException is thrown.   I checked my src object and it is not null, and path to xml document is right.  So my question is: why do I get NullPointerException? And isn't there more proper way to get elements of XML document in form of a String that match XPath expression? My XML file looks like this:  <?xml version="1.0" encoding="UTF-8"?> <content      xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"     xmlns="ns:emp"     xsi:schemaLocation="ns:emp emp.xsd">     <emp>         <employee deptno="10" empno="7369" mgr="7902">             <ename>SMITH</ename>             <job>CLERK</job>             <hiredate>1980-12-17</hiredate>             <sal>800.00</sal>             <comm>0.0</comm>         </employee>         <employee deptno="30" empno="7521" mgr="7698">             <ename>WARD</ename>             <job>SALESMAN</job>             <hiredate>1981-02-22</hiredate>             <sal>1250.00</sal>             <comm>500.00</comm>         </employee>         <employee deptno="20" empno="7566" mgr="7839">             <ename>JONES</ename>             <job>MANAGER</job>             <hiredate>1981-04-02</hiredate>             <sal>2975.00</sal>             <comm>0.0</comm>     </emp> </content>    EDIT: xPath.compile(expression); does not return null and expr is not null when expr.evaluate(src) runs. So NullPointerException is thrown not becuase calling a method on a null object, because object is not null.


How to correctly tell the cumulative probability of a 3sf value from a 2sf normal dist. table?

For example, if X follows a standard normal distribution,, what is the probability of P(X<=0.145) by using the above table only? Is it possible to tell? I remember I once encounter this situation in an exam long time ago, but I don't have a definite solution for this.  Certainly, P(X<=0.145) should be between P(X<=0.14) and P(X<=0.15) which can be obtained from the table directly without a doubt. It will be tempted to say P(x<=0.145) = [P(X<=0.14)+P(X<=0.15)]/2 which is what I did in that exam. However, I don't think it is correct.


How to turn a String into a JavaScript function call?

I got a string like:  settings.functionName + '(' + t.parentNode.id + ')';   that I want to translate into a function call like so:  clickedOnItem(IdofParent);   This of course will have to be done in JavaScript.  When I do an alert on settings.functionName + '(' + t.parentNode.id + ')'; it seems to get everything correct.  I just need to call the function that it would translate into.  Legend:  settings.functionName = clickedOnItem  t.parentNode.id = IdofParent


when does a partial differential equation have unique solution?

The differential equation $ xu_x + yu_y = 2u$ satisfying the initial conditions $y = xg(x), u=f(x)$ with    $f(x) = 2x, g(x) = 1$, has no solution $f(x) = 2x^2, g(x) =1$, has infinite number of solutions $f(x) = x^3, g(x) = x$, has a unique solution $f(x) = x^4, g(x) = x$, has a unique solution   I don't know when a partial differential equation has unique solution, infinite solutions or no solution. can I solve this by Cauchy's method of characteristics? I have no idea. please help.


Is it possible to have a pair of Gaussian random variables for which the joint distribution is not Gaussian?

Somebody asked me this question in a job interview and I replied that their joint distribution is always Gaussian. I thought that I can always write a bivariate Gaussian with their means and variance and covariances. I am wondering if there can be a case for which the joint probability of two Gaussians is not Gaussian?


How to catch the exception address in Application_error (ASP.NET MVC)

If I have a page on my ASP.NET MVC site called     but someone tries to access   http://www.example.com/documents/first http://www.example.com/first   The page will error and application_error will fire because it can't find a controller for documents.  How do I get the error address in Application_error.  I don't seem to get the whole raw url i.e. /documents/first  Before there's the suggestion of adding a route or a URL Rewrite, I don't want to do that because there can be tens of different possible error addresses.  I just want to know the web address of the missing page in the application_error.  After the application-error function has been called, it goes to the error page that I've set up in the web.config and that gets the URL and processes it accordingly but I want to do the processing in the global.asax so there's no redirecting involved.


java globle object reference not changing locally

I have a globle flag to enable logging / disable logging and a class level flag as well.  This is the code:  public class Utils {     public static volatile boolean GLOBLE_LOG_FLAG = true; }  public class TestClass {     private static volatile Boolean LOCAL_LOG_FLAG = Utils.GLOBLE_LOG_FLAG;      public void test() {         System.out.println("LOCAL_LOG_FLAG: = " + LOCAL_LOG_FLAG);          Utils.GLOBLE_LOG_FLAG = false;          System.out.println("now LOCAL_LOG_FLAG: = " + LOCAL_LOG_FLAG);     } }  public static void main(String[] args) {         TestClass class1 = new TestClass();         class1.test(); }  Output:  LOCAL_LOG_FLAG: = true now LOCAL_LOG_FLAG: = true   Why LOCAL_LOG_FLAG does not change when i set Utils.GLOBLE_LOG_FLAG = false;  If java is using object reference it should change LOCAL_LOG_FLAG to false when I assign Utils.GLOBLE_LOG_FLAG = false; isn't it ? What's my mistake here?  Thanks


How can I disable private browsing/incognito mode in browser X?

Search results for this question contain nothing but arguments for and against. Please take those up in another forum. I want to know is there an option, extension or hack to disable private browsing mode in each of the following browsers?   Apple Safari v?+ (Private Browsing) Google Chrome v1+ (Incognito Mode) Internet Explorer v8+ (InPrivate Browsing) Mozilla Firefox v3.5+ (Private Browsing)   OS-agnostic solutions preferred.  Depending on the use-case, alternate tools like traffic monitoring, OpenDNS or NetNanny might be valid, but they are not relevant to this question.


Could not initialize the package information up date manager

An unresolved problem occurred while initializing the package information. It says I have a bug against the update manager package with this error message:  E:Malformed line 58 in source list/etc/apt/sources.list (distribution parse)


What is the probability $P(X>0\mid X+Y>0)$ when $X$ and $Y$ are both independent normal mean zero with different variances?

Let $X$ have standard deviation $\sigma$ and $Y$ standard deviation $\tau$.  I can write $$P(X>0\mid X+Y>0) = \frac{P(X>0, X+Y>0)}{P(X+Y>0)}$$ As all variables are zero-mean and symmetric, $P(X+Y>0)=1/2$, so that $$P(X>0\mid X+Y>0) = 2 P(X>0, X+Y>0) = 2 P(X>0, Y>-X)$$ Using the independence of $X$ and $Y$ and the notation $\Phi$ and $\phi$ for the standard normals, I get $$P(X>0\mid X+Y>0) = 2 \int_0^\infty \phi\left(\frac{x}{\sigma}\right) \left(1-\Phi\left(-\frac{x}{\tau}\right)\right) dx.$$ But from here on I do not know how to continue to get a simple expression.  Any suggestions?


Determine if a PHP array uses keys or indices

How do I find out if a PHP array was built like this:  array('First', 'Second', 'Third');   Or like this:  array('first' => 'First', 'second' => 'Second', 'third' => 'Third');   ???


macbook 2016 21w charger replaced with 61watt

I have a late 2016 macbook with a charger that fails often.  I bought one that I thought would work but am afraid to try it until I know for sure.They are both c chargers, but the original one is 29W and the new one is 61w. I think that using one with higher wattage is ok, am I right?


Anything fairly priced will also work. Any suggestions?


What is wrong in this proof that any derivative function must be continuous?

$f$ is differentiable on $(a, b)$. (1)  Let $\alpha \in (a, b)$.  $f'(\alpha) = \lim_{h \to 0}\frac{f(\alpha + h) - f(\alpha)}h$.  (1) $\implies f$ is differentiable between $\alpha$ and $\alpha + h$, inclusive.  By the mean value theorem, $\exists c_n$ between $\alpha$, $\alpha + h$: $f'(c_n) = \frac{f(\alpha + h) - f(\alpha)}{\alpha + h - \alpha}$.  So, $f'(\alpha) = \lim_{h \to 0}f'(c_n)$.  As $h \to 0$, $c_n \to \alpha$.  So, $f'(\alpha) = \lim_{c_n \to \alpha}f'(c_h) \implies f'$ is continuous at $\alpha \forall\alpha\in(a, b)$.  $\therefore f$ is differentiable on $(a, b) \implies f'$ is continuous on $(a, b)$.  But clearly the statement must not be true as for some functions like the following, the derivative exists, but is not continuous, at zero:  $f(n) = \begin{cases} n^2 \sin(\frac{1}{n^2})  & n \in \mathbb R \\ 0 & n = 0. \end{cases}$  $f'(0) = 0$. But $\lim_{n \to 0}f'(n)$ does not exist.


I can write $3/3$ as $(1+1+1)/3$ or $1/3+1/3+1/3$.   Now, $1/3$ is a recurring/repeating/non-ending decimal so if we add these three, i.e. $0.3333... + 0.3333... + 0.3333...$ we will get infinitesimally close to $1$ but not $1$.   Is there a way to show that these decimals do end and will eventually become $1$?


what is C++'s version of .ReadKey() in c#?

I am using visual c++ on windows and i want to break the code (like wait for a key to be pressed (and I've worked this out already)) BUT detect which key WAS pressed.A bit like c#'s .ReadKey()


Show that in any finite field,each of its elements can be written as the sum of two squares.  Well,I hate to admit-this being also my first post-that I have not proven it yet.I tried to work on the multiplicative group but to no avail.Any help/tip will be welcome.


Ubuntu 16.04: appstreamcli error while get-update

I am trying to enable WiFi. I tried sudo apt-get update. But I am getting this error:  The AppStream system cache was updated, but some errors were detected, which might lead to missing metadata. Refer to the verbose log for more information. Reading package lists... Done E: Problem executing scripts APT::Update::Post-Invoke-Success 'if /usr/bin/test -w /var/cache/app-info -a -e /usr/bin/appstreamcli; then appstreamcli refresh-cache > /dev/null; fi' E: Sub-process returned an error code   How can I complete sudo apt-get update and enable Wifi in Ubuntu-16.04?


Combined ADC scaling and offset with variable input voltage ranges

I am trying to create a circuit which will allow me to scale and offset a voltage (be it AC or DC) to within the range of the Arduino ADC.  The voltage could be anything between + and - 250V, but I also need to have good sensitivity over lower voltage ranges too.  To this end I am looking at a circuit whereby you can vary the voltage range that it expects the input to be and amplify/attenuate it accordingly.  How I will be making the decision and setting the different gains is for another topic for now.  I am only interested in the scaling and offsetting at the moment.  So far I have come up with this circuit:    Which appears to do just what I want for the +/- 250V range.  I don't know how "safe" this circuit is, and if I am endangering any of the components with the 250V or not.  The graphs at the bottom are (left to right) the input voltage, the power consumption of the bottom 10M resistor, the voltage across the 100M resistor (which is simulating the Arduino ADC input) and the power consumption of the upper 10M resistor.  Now, if I drop the input voltage to just +/- 2.5V and tweak the op-amp feedback resistor accordingly, for some reason the offset voltage the op-amp is adding jumps right up.  I don't know for sure if this is the fault of the simulator I am using, or if it is really what will happen, as I haven't yet breadboarded this circuit (I guess that's the next stage).  This is the output from the 2.5V version:    You can see how the offset has jumped up and the output is clipping massively.  If I drop the lower 10K resistor to the virtual ground offset voltage divider to just 3.3K it compensates, but that's not nice - I would like to just vary the one resistor.    The op-amp is (will be) a 5V single supply rail-to-rail I/O one.  The two diodes are to protect the input of the op-amp against over voltage - I don't know if this circuit strictly needs them, but I guess it doesn't hurt to have them there.  Also, I don't know if the resistor values are quite what I want - I chose them to keep the power consumption right down and the impedance right up.  I don't want them to impact the frequency response of the circuit more than I can help - the input waveform could be anything from DC up to around 500KHz or so, and I need that reproducing at the ADC end as faithfully as I can.  (I know the Arduino can only really sample at lower speeds than that, but the Arduino is just for experimenting - the final system will use a dsPIC with 1.1Msps ADC).  So, what can I do to A) get a more stable offset, B) allow the varying of the input sensitivity without nuking either the op-amp or the ADC, and C) make the circuit safe to connect to, for example, a European mains voltage?


I haven't found a way, except using advanced methods, to prove the irrationality of $\pi$.   It is possible to prove that $\pi$ is irrational, using only elementary algebra?


I am a new Ubuntu user, so I have little experience in installation. I have downloaded the Matlab 2017a .zip file from the mathworks website and have tried to unzip the file using unzip <file name> but that didn't work. I got this dialogue unzip:cannot find or open <file name>. So I tried to find the directory so that I could follow another set of install instructions using cd /home/usr/downloads/file name but that did not work either as I received bash: cd: /home/usr/downloads/file name.zip: not a directory. As of right now I have the .zip sitting in my downloads folder, and have extracted the files using Xarchiver. I don't know what to do to install it from here.


Determining the RGB Definitions of Modified Colors in LaTeX

After defining certain colors and modifying them as the following code indicates, I then would like to determine the equivalent RGB definitions of the modified colors. For example, \documentclass{article} \usepackage{tikz} \newcommand{\mycbox}[1]{\tikz{\path[draw=#1,fill=#1] (0,0) rectangle (3cm,3cm);}}  \definecolor{red}{rgb}{1, 0, 0} \definecolor{blue}{rgb}{0, 0, 1} \definecolor{burntorange}{rgb}{0.8, 0.33, 0.0}  \begin{document}     \mycbox{red}      \mycbox{blue}     \mycbox{burntorange}          \vskip 30pt  \textbf{\LARGE{RGB Definitions of These Colors? ---}}  \vskip 15pt      \mycbox{red!80}      \mycbox{blue!60}     \mycbox{burntorange!65}     \mycbox{burntorange!55!red!80} \end{document}   How may I determine the exact RGB definitions of the four colors in the second row? Thank you.


Can you cast a 9th level spell if your multiclass spell slots have 9th level spell slots?

Say I play a Cleric 14/Paladin 6. I have the spell slots of a lvl 17 spellcaster, but can I cast the 9th level spells of the Cleric, or am I limited to 7th? Would this also work with other classes like Sorcerer or Wizard?


Pathfinder - Why are there more than one BAB indicators on the class tables?

For example: The BAB for a level 15 fighter would be +15/+10/+5 and I dont know why there are more than one. I am using the core rule book btw.


How do I change my username on Facebook?

I have changed by username 5 times and now I'm unable to change it. I want to change my username now, as I got married.    I want to know how to delete the other user names.


I have a page with forms to add or edit a entry to a mysql-database. Everything works fine, the form shows everything right, the output on the page is right.  Only when I open the mysql-database (phpMyAdmin) the entries are shown wrong. Some german letters are wrong.  For example AndrÃ© instead of André. Or groÃŸ instead of groß.  The Output on the page works fine. Also the edit-function in an HTML-form works fine.  I just don't understand why everything is written wrong in the database.  All my PHP-Page are in "utf-8".


Why Did Colin Creevey's Muggle Camera Work at Hogwarts?

Hermione says in Goblet of Fire:     ‘All those substitutes for magic Muggles use – electricity, and computers and radar, and all those things – they all go haywire around Hogwarts, there’s too much magic in the air.'   Goblet of Fire - pages 475-476 - Bloomsbury - chapter 28, The Madness of Mr Crouch   and in Chamber of Secrets Colin Creevey says this:     ‘[A]nd a boy in my dormitory said if I develop the film in the right potion, the pictures’ll move.’ Colin drew a great shuddering breath of excitement and said, ‘It’s brilliant here, isn’t it?'   Chamber of Secrets - page 75 - Bloomsbury - chapter 6, Gilderoy Lockhart   How is it that Colin Creevey's Muggle camera works properly at Hogwarts and on the Hogwarts grounds? Further, how is it that a magical potion could create moving pictures from Muggle film, which only takes one-framed (for lack of a better description) shots at a time?   I'm assuming Colin's camera is not digital, as this is 1991 (), plus Colin, obviously, references film.


They seem to be following a proposal but are not counted

I was looking at one of the examples on the Arabic Language proposal, I noticed  to look at their profile, on there I noticed he/she were following the proposal I reopened () but the follower count only says one (me).  Is this a bug? or is it that this user followed the un-followed the proposal and his profile isn't updated?


Does cooking a meat that's about to expire lengthen how long it's "good" for?

So like, if have a meat that has a particular "use by" date, and I cook it - I will kill a lot of the bacteria. Then if I refrigerate reasonably fast, will it last longer than it would've if I just left it alone? Are the two times I passed it through the Danger Zone negligible in comparison to how much bacteria I've killed?


Is uninstalling via software center the equivalent of "apt-get purge"?

Is uninstalling via software center the equivalent of apt-get purge?  Or perhaps it is apt-get remove?


Quantum Entanglement - What's the big deal?

Bearing in mind I am a layman - with no background in physics - please could someone explain what the "big deal" is with quantum entanglement?  I used to think I understood it - that 2 particles, say a light-year apart spatially, could affect each other physically, instantly.  Here I would understand the "big deal".  On further reading I've come to understand (maybe incorrectly) that the spatially separated particles may not affect each other, but in knowing one's properties you can infer the other's.  If that it the case, I don't see what the big deal is... 2 things have some properties set in correlation to each other at the point of entanglement, they are separated, measured, and found to have these properties...?  What am I missing? Is it that the particles properties are in an "un-set" state, and only when measured do they get set?  (i.e. the wave-function collapses).  If this is true - why do we think this instead of the more intuitive thought that the properties were set at an earlier time?


color within cell interferes with vertical alignment

Adding \color{<value>} inside the rightmost cell of a 2x1 table creates a vertical offset relative to the leftmost cell. Why, and how to remedy it?  \documentclass{report} \usepackage{xcolor}   %geometry---------------------------------------------------------- \usepackage[a6paper]{geometry} \savegeometry{default}  \usepackage{xparse}%---------------------------------------------- \NewDocumentCommand{\thisdoc}{} {abcdefghijklmnopqrs}  \usepackage{tabularx}%--------------------------------------------- \newcolumntype{R}{>{\raggedleft\arraybackslash}X} \newcolumntype{C}{>{\centering\arraybackslash}X} \NewDocumentCommand{\myheaderii} {+mm} {%   \begin{tabularx}{\textwidth}{@{}lR@{}}#1&#2\end{tabularx} }    \begin{document} \pagestyle{empty} \begin{titlepage}TITLE\end{titlepage} % --------------------------------- \newpage \pagecolor{white}     \myheaderii{%       \thisdoc     }     {%       1/2     }      \myheaderii{%       \thisdoc     }     {%       \color{red}% CULPRIT       1/2     }  \end{document}


Jsoup: String element.attr() doesn't work in if()

I'm not experienced in Java, and I have a problem.   Using Jsoup, I have an element called td. If I do:  String attr = td.attr("class"); System.out.println(attr);   The output is "free", which is perfectly alright. If I do:  String attr = td.attr("class"); if (attr == "free") { System.out.println("freedom!"); }   There is no output!  Does anyone know how to solve this problem?  Thanks in advance.


Speed of Dark experiment, does it *really* travel faster than light?

I have seen many folks doing this  concluding that shadow from point A on the Moon can travel to point B on the Moon faster than light.  What I fail to understand here (and I am sure I am wrong), is nothing can travel faster than light. I also read about Relativity where Einstein stated that every event happening for you depends on how fast the light gets from where the event is happening to you.  This is my particular problem with this Moon shadow experiment. You cannot make a shadow travel faster than light, because in order for the "disappearance" of light to get to the Moon, it has to travel at light speed.  Here is one way to understand my point. Consider we shine a flashlight on Moon, like the guy in the linked video did, we move the finger across the face of the flashlight, before we moved the finger it was casting the shadow at Point A on Moon, after we finish moving our finger, the shadow is at Point B on the Moon.  When the finger reaches the end of it's moving length, the light waves that have left the flashlight before the finger reached there will have to hit Point B and it will take them a second and a half to get there, and another second and half for us to see that shadow on point B, which makes it 3 seconds + finger moving time for us to actually see the shadow at point B. That means shadow traveled (say) across the diameter of the Moon in 3 seconds.   So. about 3000 Km in ~3 seconds make it 1000 Km per seconds which is very tiny compared to the speed of light. How can these experiments conclude that Shadow could be made to travel faster than light? What is the obvious clue that I am missing here?


Ubuntu 12.10 I'll explain the first problem. Sometimes when I load a webpage it never finishes loading and it says cannot reach server or something like that. When I ping that website, the terminal says it cannot resolve the hostname. So I then tried Google's DNS servers but had no luck there. It's weird because I've never had this problem in Windows 7. I used cat /etc/resolv.conf  and it came up with this: # Dynamic resolv.conf(5) file for glibc resolver(3) generated by resolvconf(8) #DO NOT EDIT THIS FILE BY HAND -- YOUR CHANGES WILL BE OVERWRITTEN nameserver 127.0.1.1 search hsd1.or.comcast.net  Why would it use 127.0.1.1? Does that mean it's trying to resolve addresses locally? When I ping the comcast search server I get a timeout error.


Decompiler visual basic 6.0 to source code

I lost the source code from a project. I've used VB-Decompiler but it does not give the source code. How can i decompile from vb6.exe to source code?


Can I change my departure date from the UK and the accommodation after being granted a Visitor Visa?

I am about to apply for a Visitor visa, however I am still unsure about the departure date because I feel that two weeks are not really enough. Would it be possible for me to change the departure date once I got the visa, for example from the 15th to 27th? If I changed it before the arrival, would they then question me because the ticket date differed from the application? Or is it fine to change it afterwards, but would they question me during the new departure date when I'm about to go home?  The same thing goes for my accommodation. I had made some bookings, but if I changed some of them, for example decided to stay at a friend's house for three days or change hotels, after the visa was granted, would this be allowed?


Use email to validate post, not unlike craigslist

I'd like for anonymous users to be able to post nodes to my site. By default their post is unpublished, but when they submit it, the site sends an email with a verification URL. When they revisit the site with that URL they can then publish their node.  Call this the 'craigslist model.' :-)  Restating: I want users to be able to publish their own node anonymously, by linking out of an email.  I've been unable to find a module or setting that does this, and I thought I'd ask before diving into code.  Update: Found this unmaintained Drupal 5 project: .  Similar question:


Prove $\sum \binom nk 2^k = 3^n$ this identity combinatorially

I need to prove $\sum \binom nk 2^k = 3^n$, combinatorially.   I have already proved this identity using binomial theorem,  simply by substituting x = 1 and y = 2.   Could I get some help/tips on how to prove this combinatorially?


Remove Ubuntu from a MacBook and put OS X back on

I bought a MacBook off eBay, thinking it would have OS X on it, but it didn't. It came with Ubuntu instead. I think it is a 2006 model or a 2007 model. I want to know how to put OS X back on it as I don't like Ubuntu.


How do I know when I should use a log transformation on a variable by multiple regression?

I am very new to regression analysis. I have a dependent variable and 9 independent variables. I want to build the best possible model from them, and I don't know when to log transfrom a variable.


Does anybody know how I can get exactly that symbol for the set of real numbers in LaTeX?   Additional image:    In this picture you have the symbol for the set of integers, real numbers and complex numbers. I think this must be a package.


I recently started a new game, including all official DLC, the unofficial skyrim patch, deadly dragons and a couple more mods.  Everything went well until I beat Mirmulnir, I didn't get to absorb his soul, he just lies there, busy being dead. All the guards around were hiding/crouching as if I was absorbing the soul, but nothing happened. A reload from an earlier save didn't help. This resulted in the mainquest being effectively stuck.  If I play in another game and kill a dragon there, I still can't absorb his soul.


How can I configure Juju for deployment on HP Cloud?

HP Cloud has a new cloud service out based on Open Stack. How can I configure my environments.yaml to connect to the new service?


Capture run time of python script executed inside shell script

I have bash shell script which is internally calling python script.I would like to know how long python is taking to execute.I am not allowed to do changes in python script. Any leads would be helpful thanks in advance.


A question in Number Theory - prove there exist m>2010 s.t f(m) is not prime

Let $$f(x)=\sum_{i=0}^n a_nx^n$$ be a polynomial with $$a_n \in Z,n>0,a_n\neq0$$ Prove that there exists some natural number $$m>2010$$ such that $$|f(m)|$$ is not a prime number.  I tried to look at f(m) mod m, and i assumed m is relatively prime to a0, so f(m) is reversible mod m. but I didn't know how to continue to prove it is not a prime number.  I would like to get help with that. Thanks


I am reciving a nullpointerexpression when I try to get a Bitmap.  ImageLoader imageLoader = ImageLoader.getInstance(); Bitmap bmp = null; bmp = imageLoader.loadImageSync("http://i.imgur.com/tx41HBE.jpg");   The bmp variable is null after calling the imageLoader.loadImageSync() method , what's the reason?


How else can I remove the "Have you considered accepting an answer or starting a bounty for this question?" note without accepting a correct answer?

After a couple of weeks of not having "one correct answer" on questions where several answers are correct on their own rights, I decided to mark the questions as a wiki. I think I did this after the accepted answer percentage appeared on the profiles. And wikis often don't have "one correct answer". And I have several of those questions that I marked as wiki, which AFAIK cannot be undone). It's somewhat annoying that I have those red notes in the list that doesn't serve any purpose. And again, red often mean there's an error of some sort.  Edit: The note also disappears when a question is closed.  How else can I remove "Have you considered accepting an answer or starting a bounty for this question?" without accepting a correct answer?  Also, would it be good to let them implement that questions marked as wiki to not have that message?


Are there massless bosons at scales above electroweak scale?

Spontaneous electroweak symmetry breaking (i.e. $SU(2)\times U(1)\to U(1)_{em}$ ) is at scale about 100 Gev. So, for , gauge bosons $Z$ & $W$ have masses about 100 GeV. But before this spontaneous symmetry breaking ( i.e. Energy > 100 GeV) the symmetry $SU(2)\times U(1)$ is not broken, and therefore gauge bosons are massless.  The same thing happens when we go around energy about $10^{16}$ GeV, where we have the Grand Unification between electroweak and strong interactions, in some bigger group ($SU(5)$, $SO(10)$ or others). So theoretically we should find gauge bosons $X$ and $Y$ with masses about $10^{16}$ GeV after GUT symmetry breaks into the Standard Model gauge group $SU(3)\times SU(2)\times U(1)$, and we should find massless X and Y bosons at bigger energies (where GUT isn't broken).  So this is what happened in the early universe: when temperature decreased, spontaneous symmetry breaking happened and firstly $X$ & $Y$ gauge bosons obtained mass and finally $Z$ & $W$ bosons obtained mass.   Now, I ask: have I understood this correctly? In other words, if we make experiments at energy above the electroweak scale (100 GeV) we are where $SU(2)\times U(1)$ isn't broken and then we should (experimentally) find $SU(2)$ and $U(1)$ massless gauge bosons, i.e. $W^1$, $W^2$, $W^3$ and $B$ with zero mass? But this is strange, because if I remember well in LHC we have just make experiments at energy about 1 TeV, but we haven't discovered any massless gauge bosons.


Proving $\gcd(ga, gb) = g\gcd(a, b)$ intuitively

I am trying to derive by myself $$ \gcd(ga, gb) = g\gcd(a,b), $$ but I am stuck proving it fully. Note, that I avoided reading the relevant proof as I am trying to improve my intuition on the process and the proof, so I want to understand if my approach is a dead end or what am I missing to complete it. My approach is the following: $GCD(a, b) \implies GCD(a, b) | a \equiv x\cdot GCD(a, b) = a$ similarly $GCD(a, b) \implies GCD(a, b) | b \equiv y\cdot GCD(a, b) = b$ But $GCD(a, b) | a \implies GCD(a, b) | ga$ similarly $GCD(a, b) | b \implies GCD(a, b) | gb$ So it has been proven so far that $GCD(a, b)$ is a common divisor of $ga$ and $gb$. Additionally it is implied that the $GCD(g\cdot a, g\cdot b)$ is a multiple of $GCD(a, b)$ because: $x\cdot GCD(a,b) = a \equiv g\cdot x\cdot GCD(a,b) = g\cdot a \implies g\cdot a = x \cdot (g \cdot GCD(a,b))$ $y\cdot GCD(a,b) = b \equiv g\cdot y\cdot GCD(a,b) = g\cdot b \implies g\cdot b = y \cdot (g\cdot GCD(a,b))$ Combining the above we can see that $g\cdot GCD(a,b)$ is a common divisor of $ga$ and of $gb$. But I am stuck here on what step am I missing to prove that it is also the greatest common divisor. Update Based on the comment of @user2661923 I thought of the following: $GCD(a, b) \implies GCD(a, b) | a \equiv x\cdot GCD(a, b) = a$ similarly $GCD(a, b) \implies GCD(a, b) | b \equiv y\cdot GCD(a, b) = b$ Now for any $d$ where $d |a \And d|b$ i.e. $d$ is a common divisor this implies that $d | GCD(a,b)$ by definition. Now since: $d \mid a \Leftrightarrow g\cdot d \mid g\cdot a$ and $d \mid b \Leftrightarrow g\cdot d \mid g\cdot b$ and $d \mid GCD(a,b) \Leftrightarrow g\cdot d \mid g\cdot GCD(a,b)$ this proves that $g\cdot GCD$ is also the $GCD$ of $g\cdot a, g\cdot b$ Is this proof correct? I kind of think that I am proving it starting with what I am trying to prove ($d \mid a \Leftrightarrow g\cdot d \mid g\cdot a$)


How to get Firefox to store values for fields which it normally won't?

I have a web bank site. Where I pass through 2 steps:   Enter my login into the form with 1 text field and submit it Enter 2 passwords into the 2-nd form: 1 is rarely changed and stored on my machine, another is for 1 session and sent to my mobile phone.   As  says, firefox can remember the form fields. And I checked Preferences -> Privacy -> History remember search and form history checkbox is ticked.  Now I work like this:   Open the first form on site Open file with login/pass for the webbank. Copy the login from the file to clipboard Paste it into the 1-st form and submit it. Copy the password from the file to clipboard Put it into the 1-st field Get the temporary password from SMS Put it into the 2-nd field Submit the 2-nd form.   As I am the only person, using this computer, I'd like the save time and make firefox remember the values for login and password for me. So my actions would be like this:   Open the first form on site login is already there, I just submit the form Get the temporary password from SMS Put it into the 2-nd field (the first already has the password) Submit the 2-nd form.   So I had 5 actions instead of 9.


Does a non-EEA spouse, travelling to the UK without their EEA national spouse, require a visa?

Are my German residence card and South African passport sufficient for entry into the UK for a few days to visit a friend? Should I, in addition to this, still apply for an EEA Family Permit or some other UK entry visa?   I am a non-EEA national spouse of an EEA national (Hungarian wife), my residence permit, valid for 5 years and issued by the German authorities, gives me free movement throughout the EU & with freedom to work in Germany.   My concern is that I will be travelling alone without my EEA national spouse, and an article on the Gov.UK site says     You may use this document for travel to the UK if you are accompanying your EEA national relative here, or joining your EEA national relative here, or joining your EEA national relative in the UK.   I find no clear answer on the official web sites and would like confirmation. I intend flying from Germany to London, between the 6th to 11th July 2017.


I want to automate running a Python script. And I think I already know how to do that with a cron entry.  The problem is that I need this script to run again only if a previous one has finished.  The Python script reads from a .csv file (only the first record), and gives it as parameters for the script onward. Then this record is removed from that table (which is essentially like a list of runs that need to be done) and is moved to another table for finished tasks along with the result of the script.  So, because records are being deleted at every run, I need a following iteration of the script to start only if the previous one finished.  How/Can I do that under Ubuntu 16.04 LTS?  EDIT:  I tried scheduling the python script this way and installed run-one like that:  sudo apt-get update sudo apt-get install run-one  # The below code is in crontab * * * * * run-one python '/home/phdmonster/Downloads/nn course/my_code.py'   Aand, it doesn't work. No tasks are run.  Edit by Sergiy Kolodyazhnyy: Issue resolved in comments, also discussed in  linked chat room; issue was with extra *, linked duplicate works as per OP's comments


Carriage returns are prevent sed reading all my files

I have a long list of folders, inside every folder I have the file "log.dat". I wanted to read the value of a specific line inside this file.  I saved the folders names in a file "All.txt", in the parent folder, then I ran this code:  #!/bin/bash in=/a/b/c   #path to the file All.txt   for i in $(cat $in/all.txt); do sed -n '/price/p' ${in}/${i}/log.dat  done   This code was able to read almost all the files but for some reason, which I can't figure it out!! It was output the following error message:  /log.dat: No such file or directory #(then the path to this file)   If I run the command sed -n '/price/p' log.dat inside the folder that output the error message. I get an answer!  PS: The content of the file ALL.txt ( which is created by running the command ls>All.txt in the parent folder) is as follow:  STR-548-021-01 STR-548-021-02 STR-548-022-01 STR-548-022-02 STR-548-023-01 STR-548-023-02 . . . . .   I tried to use the command "awk" instead of "sed" as follow:  awk '{ price }' ${in}/${i}/log.dat   And I got the same error message.  Can these carriage returns happen in Linux as an output for the command ls>All.txt?


Title, section headings disappears when I use \usepackage{forest} with IEEE Access template

When I include a  \usepackage{forest} all colored text title, section headings disappears with IEEE Access journal template How can I tackle this problem?


Google Drive login before user login possible?

NOTE: the answers proposed are for Windows Server 2003. Even the one claiming Windows 7 posted in 2012 appears to fail in 2014. I have tried them and they do not work for Windows 7. This question has not been answered yet.  If you have not tested in Windows 7, please do not post an answer. The answers given are not for this version of windows and are not compatible.  That said I do appreciate the suggestions...  I have a Windows 7 machine that needs to have a fresh boot weekly. This part works fine. The issue is that Google Drive needs to be accessible even if I have not logged into the box. It is attached to a user account so the act of logging in enables it. Is there a way to have the system log into Google Drive on its own at boot time? I attempted to have Windows 7 boot into a specified account on its own, but it did not activate the drive.  The option to start with the computer was chosen, it did not start with the computer but with the account, meaning a username and password is still required to be manually entered.  [I am using 32-bit Windows 7 Professional, Service Pack 1]  UPDATE:  I am going to attempt a different method of syncing files instead of google drive, it may be possible that the 'server' solutions do not equate to Windows 7 deployment. (EG: this question may not have a working answer, or one has not been found yet.)


How sterile is sterile when working with nucleic acids to prevent contamination?

I am reading up on preparatory work on working with nucleic acids and a lot of the instructions speak on excessive procedures on cleaning environments with high %ethanol and making sure the equipment is nuclease free, and autoclaved.  Are these sterilization steps really necessary when doing research /running gels? Buying all of this equipment seems very excessive, and given that just one nuclease could compromise my results why bother?


Saw a website scraping contents of SharePoint Stack Exchange

I just stumbled upon this website:  http://meta.sharepoint.readquestion.com/   And this site has scrapped almost all the contents of SharePoint Meta and it comes on Google Search as well. Is this something to be reported to Stack Exchange HQ?


How to insert multiple blank lines after every line

I want to insert 5 blank lines after every line in my input file.  foo.txt:  line 1 line 2 line 3   out.txt:  line 1      line 2      line 3          ...   Solaris 5.10, nawk or sed.


"Under this directive, any and all Jedi leadership must be executed for treason against the Republic. Any soldier that does not comply with the order will also be executed for treason." Clone Commander Rex to his men during the implementation of Order 66 From Wookiepedia   So, we know what order 66 basically says by a quote of Commander Rex. But I was not able to find the original order 66 the way it was implemented into the clones head. I presume it was more, i.e. more detailed, than kill all Jedi leadership for treason against the Republic. So, does the original formulation of the order exist? Even though it was implemented in a chip, IMHO somebody had to formulate it before it could be added (and if necessary programmed) into the chip.


I'm trying to model a Roulette game where if you bet on red (out of red(18/37), black(18/37), green(1/37)) and if you the ball lands on red you win 1 dollar and if it doesn't you lose $1. So in this case, is it a binomial distribution? Since there are only 2 outcomes from the gamblers perspective, red or not red. If thats the case are these 2 R functions the same?  set.seed(3) sample(c(0,1),100,replace=T,prob=c(19/37,18/37))     rbinom(n = 100, size = 1, prob = 18/37)


How can I make an element fill to the bottom of it's parent?

I have a parent element with 100vh height, and some content. I want the last element to fill to the bottom of the parent. Can this be achieved with css?

MY TITLE

some text
    my button    my button
fillToBottom


How can one explain this conflict between philosophy and classical physics?

Consider two moving objects along X-axis direction with different speeds and different initial starting points. Let the initial distance of the objects be d0 and v1 is greater than v2 i.e v1>v2.   Physics says:  x1 = v1 * t + x01 = v1 * t  x2 = v2 * t + x02 = v2 * t + d0  If we put x1 = x2 we obtain :   t = d0 / (v1 - v2)  and O1 because of its greater speed will eventually reach to O2.  But philosophy says something else:  O1 in t1=(something calculable) will reach to O2's current position but in this time interval O2 will move x1=(something calculable) toward.  Again in the new situation O1 in t2=(something calculable) will reach to O2's current position b but in this time interval O2 will be x2=(something calculable) toward.  By repeating this procedure tn and xn approaches to zero but does not become zero, therefore O1 will never reach O2.  How do you explain this?  Thank you so much.


Let $X,Y$ be normed linear spaces. Let $T: X\to Y$ be linear. If $X$ is finite dimensional, show that $T$ is continuous. If $Y$ is finite dimensional, show that $T$ is continuous if and only if $\ker T$ is closed.      I am able to show that $X$, finite dimensional $\implies$ $T$ is bounded, hence continuous.     For the second part: This is what I have:    Suppose $T$ is continuous. By definition $\ker T = \{ x\in X : Tx = 0 \}$ , and so $\ker T$ is the continuous inverse of a closed set. Hence $\ker T $ is closed.    First, is what I have attempted okay. How about the other direction?


How to disable auto resizing of windows when moved to the top?

When I move a window close to the top, it snaps to maximum size. I am using Ubuntu 18.04, GNOME 3.28.2.    How do I disable that? I searched about six months ago, no way to disable back then.  1/5/19 Yes, solved!  Thank you!   These two worked on my Ubuntu 18.04     gsettings set org.gnome.mutter edge-tiling false   dconf-editor   These did not work     GNOME Tweaks  (disable "Edge Tiling" not available)   gsettings set org.gnome.shell.overrides edge-tiling false    Thank you Kulfy, Hamza Saeed, vanadium, PRATAP.