How to introduce a few lines in Bangla font in an otherwise English document in PdfLaTex?

I am writing my dissertation with TeXMaker, compiling with PDFLatex. I want to add a couple of lines in Bangla fonts on a particular page. How can I accomplish that? I am on Mac El-Capitan system. I have been able to compile a primarily Bengali document as given .


is handy, but is there a similar function in the .NET framework for ?  I'm looking for syntax like this:  Url.Combine("http://MyUrl.com/", "/Images/Image.jpg")   which would return:  "http://MyUrl.com/Images/Image.jpg"


I am travelling to UK on short term visa for Work (Tier 2),and planning to take wife for 30 days, which visa I need to apply and what supporting documents I will need for it..?


How can I pipe colored tree result to less or more?

I get colored tree using tree -C but when I pipe it to less I get results like this:  tree public/ -C | less     How can I have colors in less in this case?


From this :  $ diff <(wget -q -O - URL1) <(wget -q -O - URL2)   Seems like multiple standard inputs but---if I remember my Linux Porgramming course correctly---this can't be it. I thought that, by definition, standard input was one stream.  Perhaps this has zilch to do with stdin? Can someone explain this to me; maybe provide links to documentation.  Bonus: How would a script handle these multiple streams? If someone could provide a Python or Perl example, that would be very helpful.


"This post has been deleted" banner overlaps Close Vote Dialog

If an answer is deleted while the close vote dialog is open on the parent question, the "This post has been deleted" banner overlaps the modal.  This also renders the dialog useless, as clicking on it will refresh the page.      Google Chrome Version 57.0.2987.98 (64-bit)  macOS Sierra Version 10.12.4 (16E195)


Matching enum Strings in Java in If conditions

I have an enum:  public enum Status{    A("A"),    B("B"),    C("C"),    D("D"),    E("E") }   A,B,C are in one category and D&E are a different category.  Now when I get a string, I want to decide which category it falls in.  Basically,   String s; if   s.equals( Status.A.toString()) || s.equals(Status.B.toString()) || s.equals( Status.C.toString())              return 1;           else return 2;   Now, this is manageable with 5 letters. If I have 26 letters, the number of if conditions will be unmanageable. Is there a better way to write this?


Calculus Problem general polynomial limit to infinity

I have to solve the following problem for homework for a calculus class. I really have no idea where to start, does anyone have any hints?:  let n be a positive integer greater than 0. Let P(x) be a polynomial s.t.:  $P(x) = x^n+b_1x^{n-1}+b_2x^{n-2}+...+b_{n-1}+b_n$,  Show that $lim_{x\to\infty}([P(x)]^{1/n}-x)=b_1/n$.  We're not allowed to use induction. I was thinking maybe somehow apply the pinching theorem?


$X$ is path connected, show that $X$ is not simply connected

Let $X=\{a,b,c,d\}$ and $T=\{\emptyset, X, \{a\},\{b\},\{a,b\},\{a,b,c\},\{a,b,d\}\}$. I have already shown that $X$ is path-connected. I now need to show that $X$ is not simply connected.  My attempt: I know that if $X$ is path-connected then $X$ is simply connected iff the fundamental group is trivial. So if I prove that the fundamental group is not trivial, then Im done. But how do I do so?


No feedback when comment fails to post on Android 2.3.5

In the mobile theme on Android 2.3.5, comments that do not meet the minimum length will fail to post but no feedback message is displayed to the user.  The submit button changes to its active state, but nothing else happens.


On the mean value of a multiplicative function: Prove that $\sum\limits_{n\leq x} \frac{n}{\phi(n)} =O(x) $

There is a second part of the problem posted in , from Apostol's book, but I can't figure it out. It asks the reader to prove that if $x \geq 2$ then $\sum\limits_{n\leq x} \frac{n}{\phi(n)} = O(x)$, where the right hand side of the equation uses the Big-O notation. I've tried using the prior result, but I always end up with $O(x^2)$ . Any insights?


The monoid of fractions associated with the submonoid of cancellable elements of a commutative monoid E

Let $E$ be a commutative monoid, $\Sigma$ the submonoid of cancellable elements of $E$, $E_{\Sigma}$ the monoid of fractions of $E$ associated with $\Sigma$ and $\varepsilon$ the canonical homomorphism of $E$ into $E_\Sigma$.   Since every element of $\Sigma$ is cancellable, $\varepsilon$ is injective.  Logically speaking, what does "identifying the monoid $E$ with the submonoid $\varepsilon(E)$ of $E_\Sigma$" allow me to do? I mean: w.r.t the set-theoretic formulas, what can I formally replace with what? For example, does it allow me to write $\varepsilon(a)=a$ for $a\in E$ (I hope not...) ? What is gained by this "identification"?   I ask this because I would like to know how one can "identify" $E_{\Sigma}$ with the submonoid generated by $E\cup\Sigma^*$, where $\Sigma^*$ denotes the set of inverses of the elements of $\Sigma$.  EDIT: (You can ignore the details concerning this specific construction of the monoid of fractions)


What is identity arrow in the category Set?

Given is category Set Given two objects from this category, $A$, and $B$, which are sets without any other structure, there is an arrow $f: A \to B$, from $A$ to $B$, which is any total function from $A$ to $B$.  For given set $A$, there is ( by axiom of CT ) identity arrow $1_A$ .  Then it looks like identity arrow may be a permutation...  Buy identity arrow for a given object has to be unique. And there is many permutations for given set $A$.   So do we have here "equivalence class" of identity arrow?


How can I load the contents of a small text file into a javascript var wo/JQuery?

I'm trying to load a very simple text file (eg: 0 online: or 1 online: Username or 2 online: Username, Username), from a server I control, that changes based on the number of users on a minecraft server, into a javascript var, so that I can eventually load it onto my Pebble and have it more or less live update. (read: no jquery) (also read: I have little to no idea what I'm actually doing, and if there's a better way to do it, lemme know.).  I've done a  which mostly points me to     (edit: XMLHTTPRequests are probably necessary) but they seem overly complex for what I need (which is to take the contents of the text file served up via HTTP, stuff it in a var, and have the Pebble spit it out on the screen.)   How can I, without JQuery, and maybe even without JSON, load the contents of a text file into a javascript var?  Some notes:   The server is eventually going to be accessed via Hamachi, but if I can get it working even locally I'll be pretty thrilled. Following , I get . Ditto for local IP.


Could the Death Star have a satellite due to its size?

I have read the Death Star (the first one) had a diameter of about 186 km, which made me think about whether it could somehow host a satellite or moon due to its size, .


I'm sure this is a really simple setting I'm having trouble finding. If I delete a web part then add it again, there is a number in brackets after the title that goes up by 1 each time. How do I get rid of this?


convert a string or byte to a hex decimal in c#

I have a sensor that gets the request and gives me its value the request should be hex format in c# as you can see in the picture :    My request that i enter in the textbox is like this :"000100020005030190000212BD"  but as you can see the hex checkbox is checked and it converts my request to hex how can i do that ? Here is my code that send the request "   var listener = new TcpListener(IPAddress.Any, 3000); listener.Start();  using (var client = listener.AcceptTcpClient()) using (var stream = client.GetStream()) {      // build a request to send to sensor     var request = new byte[2048];      stream.Write(request, 0, request.Length);     // read a response from sensor;     // note, that respose colud be broken into several parts;     // you should determine, when reading is complete, according to the protocol for the sensor     while (true)     {                             // stream.Read calls here     } }   datasheet :


I'm kinda new to Blender and I was asked for help for my event to make an animation. I want to make something like a box falling from the sky. I went through some tutorials and i did make it right. What is not right is, the object (which is a box with a rigidbody) quite not in focus as in a camera. Here's the screenshot of the object showing it's out-of-focus.    How do i make the image to be in focus in such way that the object didn't look like it's being blurred by the camera?


(..) those who stand to profit from our working harder,   I've noticed this pattern very often, but I don't know how or when to use it. The following      (...) those who stand to profit from us working harder,   would be right as well, right? Is there a difference in meaning? Or in context of use maybe? Thanks in advance!  For reference, the sentence is taken from the fourth paragraph from the end in .


Format Inline source code like Stack Exchange

Stack Exchange formats code nicely with backticks using Markdown.  Example: int foo = bar++  I've seen other posts that recommend using listings, specifically \lstinline to do inline source code.  Using listings or any other packages, how could the Stack Exchange code formatting be emulated in LaTeX?


Which edit actions can move a post into Community Wiki mode?

Surprisingly, I couldn't find a straight answer to this.  It's not entirely clear in the .  There are (at least?) four different types of edit actions:   Body edits Title edits Retags Rollbacks   And a few actions that show up in the history but aren't really "edits":   Close/Reopen Delete/Undelete   The FAQ seems to indicate that only body edits are important as far as "wikification" is concerned, but I'm not sure if that's really correct or if I'm just interpreting the post too literally.  The FAQ also says that rollbacks don't reverse the calculations - fine, but are they considered to be additional edits or are they ignored?  Can anyone tell me which of these actually count toward the wikification of a post, and whether the rules are any different for owner edits vs. multiple editors?


Effectiveness of technical analysis techniques: Any supporting studies?

Do you find  to be an effective way of increasing the returns on your investments?  This can be either by itself, or in combination with other indicators.  If so, what techniques do you use?    What studies exist which show evidence for whether or not different techniques work?


Minimum of the Gamma Function $\Gamma (x)$ for $x>0$. How to find $x_{\min}$?

The $\Gamma (x)$ function has just one minimum for $x>0$ . This result uses some properties of the gamma function:   $\Gamma ^{\prime \prime }(x)>0$ and $\Gamma (x)>0$ for all $x>0$ $\Gamma (1)=\Gamma (2)=1$.   Observing the following graph (created in SWP) of $y=\Gamma (x)$ this minimum is near $x=3/2$, but likely $\min \Gamma (x)\neq \Gamma \left( 3/2\right) =\dfrac{1}{2}\Gamma \left( 1/2\right) =\dfrac{1}{2}\sqrt{\pi }$.     I think that it is not possible to find analytically the exact value of $x_{\min }$, even by converting to an adequate problem in the interval $]0,1]$ and using the functional equation $\Gamma (x+1)=x\Gamma (x)$ and the reflection formula  $\Gamma (p)\Gamma (p-1)=\dfrac{\pi }{\sin px}\qquad $( $0\lt p\lt 1$)    Question:   a) Which is the best way to find $\min_{[1,2]}\Gamma (x)$ and does $x_{\min }$ lay in $[1,3/2]$ or in $[3/2,2]$?  b) Is there some useful series expansion of $\Gamma (x)$?  c) Which numeric method do you suggest?    Edit:  Due to the shape of $\Gamma (x)$ I thought on the one-dimensional  method of direct search for unconstrained optimization, which approximates a function near a minimum by successive approximating quadratic polynomials.


How can I get started with developing apps for Ubuntu Touch?

I am interested in trying the new Ubuntu for phones OS development. (I am not an Ubuntu developer, I am new to Ubuntu. Impressed by the Ubuntu Touch preview, I got interested in learning how to develop for it).  Where can I start with it? I can't find any guidance on the Ubuntu site.


Enable backspace to go to the previous page in Firefox

I want to enable or use Backspace to switch back to previous page that I visited previously in the Firefox browser on Ubuntu. For example, if I am using any browser on Windows, I can use Backspace instead of back button in browser to go to previously visited page.


AWK: Nested Conditional Subset of Rows without Headers

I have a pretty specific question, and have been able to find lots on conditional subsetting using awk but none that lends enough explicit code for me to generalize to my situation. I have a file 'keys' and a file 'features' both without headers. The 'keys' table contains two variables, KEY and GROUP (1st and second columns, respectively), toy example below.      1          GROUP0     2          GROUP0     3          GROUP1     4          GROUP1     5          GROUP2     6          GROUP2     The file 'features' contains a list of features of widgets like so (ID, FEATURE, VALUE 1st, 2nd and 3rd columns, respectively).      A           num_user     10     A           KEY          4     B           num_user     2     B           KEY          2     B           battery      Large     C           num_user     10     C           KEY          15     D           num_user     2     D           KEY          2     D           battery      Small     E           num_user     2     E           KEY          7     E           battery      Small   I am trying to select all rows for an ID which has a value of 'KEY' that is in the 'KEY' column of 'keys' for a hardcoded list of 'GROUP' values. The desired result is      A           num_user     10     A           KEY          4     B           num_user     2     B           KEY          2     B           battery      Large     D           num_user     2     D           KEY          2     D           battery      Small   Any ideas?


Hyperref boxes around links ARE MISSING in TeXShop

I was using TeXShop 2.26 on Mac OS 10.5.8. Switched today to TeXShop 3.36 on Mac OS 10.9.4. In all my LaTeX files, the hyperref red green cyan boxes around the links don't show up anymore. The links work, but the boxes are not there. Happens both with dvips and pdflatex.   By changing the hyperref options, I can make the link texts colored, but cannot make the boxes visible. Thinking that MacTeX changed the default, I tried [hidelinks=false], but the compiler says "unusual option for hyperref, ignored".  Any idea what happened and how I could get the boxes back?  I doubt that this is relevant, but besides hyperref, I'm also calling the following packages:  \usepackage{amssymb,amsmath,amsthm,amsfonts,mathrsfs} \usepackage{wrapfig} \usepackage{psfig} \input epsf.sty \input labelfig.tex \usepackage{showlabels} \usepackage[usenames,dvipsnames]{color} \usepackage{psfrag}


In any business CV/resume, the section of skills is a great deal with full descriptions such as   Communication skills: a few sentences of description of relevant experience Project management: separate description   However, I have not seen such emphasis in an academic CV. If any, it was a list of software skills at the end with the same weight as the hobbies.  Is it appropriate/useful to put such emphasis on the skills? Or such descriptions are too subjective for an academic CV and should be presented in the cover letter (in a faculty application)?


I'm trying to cite some chapters in a book in a .bib file however when I compile the .tex file, I got some of the chapters without the authors names. I don't know the reason and how to fix this. Any suggestions?  Code:    @inbook{bitam2014bio1,   title={Bio-inspired Routing Protocols for Vehicular Ad-Hoc Networks},   author={Bitam, Salim and Mellouk, Abdelhamid},   chapter = {Vehicular Ad Hoc Networks},   year={2014},   publisher={John Wiley \& Sons}   }    @inbook{bitam2014bio2,   title={Bio-inspired Routing Protocols for Vehicular Ad-Hoc Networks},   author={Bitam, Salim and Mellouk, Abdelhamid},   chapter = {Routing for Vehicular Ad Hoc Networks},   year={2014},   publisher={John Wiley \& Sons}   }    @inbook{bitam2014bio3,   title={Bio-inspired Routing Protocols for Vehicular Ad-Hoc Networks},   author={Bitam, Salim and Mellouk, Abdelhamid},   chapter = {Conventional Routing Protocols for VANETs},   year={2014},   publisher={John Wiley \& Sons}   }    @inbook{bitam2014bio4,   title={Bio-inspired Routing Protocols for Vehicular Ad-Hoc Networks},   author={Bitam, Salim and Mellouk, Abdelhamid},   chapter = {Bio-inspired Routing Protocols for VANETs},   year={2014},   publisher={John Wiley \& Sons}   }   Output:


I want to write an email to 2 persons. Shall I say:     Dear Person1 and Person2,   Or      Dear Person1, Person2,


Pixelated display as if my display was 16bit

I Manually installed the latest Nvidia GeForce GT755m driver. The installation succeeded without any error but now my display is pixelated as if it was 16 bit.  You can take a look at the picture    I have asked the same question before but did not get any response (sorry for asking again). I attempted to solve the problem myself by removing the old Nvidia driver and manually installing the latest version but it did not help.  Any help will be appreciated


Prove that a holomorphic function injective in an annulus is injective in the whole ball

Let $f: B(0,1) \rightarrow \mathbb{C}$ be holomorphic and suppose $\exists\ r \in (0,1)$ such that $f$ is injective in $A = \{z \in \mathbb{C} : r < |z| < 1\}$. Prove that $f$ is injective.  I tried using Rouché theorem, or the identity theorem, but I don't know what to do. Any hints? :)


Prove that $\sum_{r=1}^n r\binom n r^2 = n\binom{2n-1}{n-1}$   I tried: $\sum_{r=1}^n r\binom n r^2 = n\sum_{r=1}^n \binom {n-1}{r-1}\binom n r$ using the identity $\binom n r = \frac n r \binom {n-1}{r-1}$ for $r \ge 1$.    Not sure how to proceed from there. I tried expanding the RHS but can't seem to find a way to cancel out the factorials.


I am having command line problems in 13.04

I'm using Ubuntu 13.04 and trying to enter this command sudo add-apt-repository ppa:cairo-dock-team/ppa,  but then it asks for my password and I can't type anything. The only thing I can do is press enter, and then it says incorrect password. Please help!


.NET | When I search "crepe" its not returning records that contains "crépe". IQueryable collation search

Is possible to add collation search with IQueryable.  this is my code:  public IQueryable<Book> FilterQueryable(IQueryable<Book> queryabable) {     if (!string.IsNullOrEmpty(Term))         queryabable = queryabable.Where(c => (c.Name.ToLower().Contains(Keyword.ToLower()))); }   My problem is, when I search for eg. "crepe" its not returning records that contains "crépe"  é its ignored.  EDIT 1  Text in db is stored Easy crépe recipe, this is why I used contains (LIKE).  Thank you.


How can I export the list of open Chrome tabs?

Chrome's sync feature isn't picking up all of the tabs open on my Android phone.  Are the tabs stored in a file somewhere that I can access?  My intention is to export the list of tabs so that I could run a factory reset on the device.  Running Android 4.3


Bagging classifier vs RandomForestClassifier

Is there a difference between using a bagging classifier with base_estimaton=DecisionTreeClassifier and using just the RandomForestClassifier? This question refers to models from python library called sklearn.


Why does Walt split his $3 million with Jesse?

In Breaking Bad Walt is hired by Gus on a simple deal $3m for 3 months, and paired to work with Gale initially. Gale presumably is well paid separately but when Walt has him replaced with Jesse, Jesse receives 50% of Walt's money.  Seems like poor negotiating by Walt, is it? If so, why?


There is a line in the middle of my stroke. How do I fix that?

I am trying to make a circle with dash but there's a black line that wont go away.  How do I fix this? I have looked through the appearances tab. I have also tried deleting that object then redoing it but, nothing has worked. It is one single image that has three strokes on it. It might just be a glitch in my program.


I would like that the transpose in the following has the same height in both examples, is there a possibility to make the transpose sign ignore the boxes above the charater?  \documentclass{article}  \usepackage{amsmath}  \begin{document}   \newcommand{\vect}[1]{\mathbf{#1}} \newcommand{\vA}{\vect{A}} \newcommand{\dvect}[1]{\vect{\dot{#1}}}  \begin{align}     {_\mathrm{K}}\dvect{\hat{\vA}}^\top \quad {_\mathrm{K}}\dvect{\vA}^\top \quad\quad {_\mathrm{K}}\vA^\top \end{align} \end{document}     {_\mathrm{K}}\dvect{\vA}^\top \quad {_\mathrm{K}}\vA^\top \end{align} \end{document}


Isometric isomorphism between $R^2$ and $R$

Can someone help me solving the following problems?        $(\mathbb R^2,d_2)$ and $(\mathbb R, d_1)$, $d_2, d_1$ being the respective euclidean norms, are not isometric isomorphic, i.e. there is no distance preserving isomorphism between them.     Let $d$ be the restriction of the euclidean metric on $(-1,1) \times(-1,1).$ Find a metric $d':\mathbb R \times \mathbb R \to \mathbb R$ such that the spaces $((-1,1),d)$ and $(\mathbb R,d')$ are isometric isomorphic.      For 1.)  I thought it suffices to prove that if there was a isomorphism between those two, it wouldn't be distance preserving since it then also must be norm preserving which can't be injective since $||f(x)||_2 = ||x||_2 = ||f(-x)||_2$.    I don't know if that suffices or if it is even true. I would be glad if someone could prove me why they can't be isomorphic in the first place.    For 2.) I don't know what to do.


I'm trying to compute the difference between the output of two awk commands but my simple attempts at it seem to be failing. Here is what I'm trying:  diff $(awk '{print $3}' f1.txt | sort -u) $(awk '{print $2}' f2.txt | sort -u)   This doesn't work for reasons unknown to me. I was under the assumption that $() construct was used to capture the output of another command but my "diff" invocation fails to recognize the two inputs given to it. Is there any way I can make this work.  By the way, I can't use the obvious solution of writing the output of those two commands to separate files given that I'm logged on to a production box with no 'write' privileges.


Self homeomorphism of a smooth closed manifold is homotopic to a diffeomorphism

For a smooth closed manifold $M$, and for any self homeomorphism $f:M\to M$, is there a self-diffeomorphism $g:M\to M$ homotopic to $f$? Actually I'm interested in the following special case of Dehn twist: For an embedded circle $C$ in an oriented surface $S$, the closed tubular neighborhood can be identified with $C\times [0,1]$. Define $f:S\to S$ by $f(\theta,t)=(\theta+2\pi t,t)$ on $C\times [0,1]$ and identity outside $C\times [0,1]$. This is a self-homeomorphism of $S$ and is called the (right-handed) Dehn twist along $C$. But I've seen that in some book this $f$ is a diffeomorphism, so it seems it is homotopic to a diffeomorphism $S\to S$.


How to make code run only when a variable equals something

So Im trying to make a code generator for something and i am using java swing and a combo box. So I want it for when you pick one of the choices it changes the variable. When I use an if else statement it only does it once. TL;DR How do i make like a when statement so when effect = "Sphere" it will set e to "Sphere" but in the dropdown if I select Helix it will change e to "Helix" etc.


I would like to add one char from otf font in xelatex as ligature. 'łł' = 'some char number in font' How make it? How tell for xelatex this char is a ligature of two letter 'ł' and 'ł'


Why can I not see a Computers GPO in my GPMC? How can I force a GP update without a Computers GPO?

This is not a duplicate. This question is much more detailed than "What is group policy". Mods need to be a little less aggressive around here.   I'd like to push out a Windows Firewall: Allow remote administration exception properties group policy to all computers connected to my DC. The instructions from MS are , the relevant line is "Right-click the selected OU, and click Group Policy Update…". If I try to update the Users GPO it says there are no computer objects. If I try to add a "Computers" object, it says it already exists. The only thing in the tree that I can update is the Domain Controllers object; that doesn't seem right.    It's very confusing. If I can't add it, how come I can't see it? I don't have any filters turned on.   The whole point of this is to be able to force a GP update on all computers in the domain. The instructions that I linked imply that I can do that via the GPMC but I don't see any way to accomplish that.


When can a k-form be expressed as a wedge product of one forms?

Suppose I am handed a k-form $\omega$. What can I do to check if $\omega$ can be expressed in the form  $$\omega = \alpha_1 \wedge \dots \wedge \alpha_k?$$  The context for this question is an application in differential geometry. A codimension-k surface is characterized by a k-form field of the above form; I am trying to ascertain when a specified k-form field defines a codimension-k surface  EDIT: An equivalent question is, "when is a given k-form the unique top-level form of some k-dimensional subspace?"


Is the statement grammatically correct or not: "How can I get to watch a movie for free?"

I am having a sort of confusion, whether which of the following statements is/are correct:  "How can I get to watch  a movie for free?"   Or  "How do I get to watch  a movie for free?"


Linear independence of columns implies non-zero determinant

If $\alpha_1,\alpha_2,\alpha_3$ are linearly independent, and $(\beta_1,\beta_2,\beta_3) = (\alpha_1,\alpha_2,\alpha_3)C$. Prove that if $\mid C\mid \neq 0$, then $\beta_1,\beta_2,\beta_3$ are linearly independent.   This statement seems to be trivial, if $\alpha_1,\alpha_2,\alpha_3$ are linearly independent, then $\det{(\alpha_1,\alpha_2,\alpha_3)} \neq0$, and $\det{(\alpha_1,\alpha_2,\alpha_3) C} = \det{(\alpha_1,\alpha_2,\alpha_3)}*\det{}C\neq 0$, which implies $\det(\beta_1,\beta_2,\beta_3) \neq0$, and hence the columns are linearly independent.  I'm not sure how to prove it rigorously, or if I'm missing any steps here. Would really appreciate any help! Thank you!


What app notification is this? I tried googling for it but could. It’s for a google pixel.


What's the significant difference between Expressions vs Literals && Expressions vs Statements in Java? I'm aware that an expression represents a simple value or a set of operations that produces a value. However, literals can also be a simple value which makes it a little confusing to make difference between them. Could smb explain the differences? Thanks in advance!


Suppose that John Doe mines 100 bitcoin at $0.11 each ($11) and doesn't sell them, but keeps them in a wallet.  Does he pay taxes the year he mined them at the price he mined them for, or does he pay taxes on the value he sells them for — like paying taxes on the $10,000 he receives when he sells them for $100 each?  And how does the cost of electricity factor into this, since each bitcoin (especially now) costs a lot of money to earn based on the price of electricity?


Isn't causality a disproof for the Copenhagen interpretation

In QM, each measurement result cannot be predicted, in other words, that is random. This being random has a great implication: if there is no rule to specify the results, so there is cause. This lack of cause is not something acceptable logically. In other words, the non-deterministic (that is stochastic) NATURE of, let's say, electrons, means that there is not enough causes to determine the results of the observations (so electron decides where to go for itself). So, how can one resolve this contradiction between the orthodox viewpoimt of QM and the causality conjecture?


Let let $$f(x,y)=\frac{x^3-y^3}{x^2+y^2}$$ and $(x,y)\not=(0,0)$   How to prove that the function has a limit as $(x,y)\to (0,0)$     Should I look at firstly on the x axis and then on y-axis?


Proof verification : $X_n \to X$ in distribution, $Y_n \to 0$ in probability $\implies$ $X_nY_n \to 0$ in probability

I have to show : $X_n \to X$ in distribution, $Y_n \to 0$ in probability $\implies$ $X_nY_n \to 0$ in probability.   Let $\alpha>0, \epsilon>0$. Then $\exists \delta>0$ such that $-\epsilon/\delta$, $\epsilon/\delta$ are continuity points of distribution of $X$ and $$P(|X|>\epsilon/\delta) \leq \alpha$$  Since $X_n \to X$ in distribution, $P(X_n \leq x) \to P(X \leq x)$ for all continuity points $($and in particular $-\epsilon/\delta$ and $\epsilon/\delta)$. There exists $N_1, N_2 \in \mathbb{N}$ such that $$n \geq N_1 \implies |P(X_n \leq -\epsilon/\delta) - P(X \leq -\epsilon/\delta)|<\alpha$$ $$n \geq N_2 \implies |P(X_n \leq \epsilon/\delta) - P(X \leq \epsilon/\delta)|<\alpha$$ Let $N=\max\{N_1,N_2\}$. Then for $n \geq N$,  $$P(|X_n|>\epsilon/\delta)=1-P(|X_n| \leq \epsilon/\delta)=1-P(-\epsilon/\delta \leq X_n \leq \epsilon/\delta) = 1-P(X_n \leq \epsilon/\delta)+P(X_n < -\epsilon/\delta) = 1-P(X_n \leq \epsilon/\delta)+P(X_n \leq -\epsilon/\delta  \,\,[\text{by continuity}] \leq 1-P(X \leq \epsilon/\delta)+P(X \leq -\epsilon/\delta)+2\alpha = P(|X|>\epsilon/\delta)+2\alpha \leq 3\alpha$$  Since $Y_n \to 0$ in probability, $\exists$ $N_3 \in \mathbb{N}$ such that $$n \geq N_3 \implies P(|Y_n|>\delta) \leq \alpha$$  Choose $N^{*}=\max\{N,N_3\}$. Note that $$|X_nY_n|>\epsilon \implies |X_n|>\epsilon/\delta \,\,\text{or}\,\, |Y_n|>\delta$$ Hence, $$P(|X_nY_n|>\epsilon) \leq P(|X_n|>\epsilon/\delta \,\,\text{or}\,\, |Y_n|>\delta) \leq P(|X_n|>\epsilon/\delta)+P(|Y_n|>\delta)$$ Thus, $$n \geq N^{*} \implies P(|X_nY_n|>\epsilon) \leq 4\alpha$$ Since, $\alpha>0$ is arbitrary, $X_nY_n \to 0$ in probability.     Is the proof okay? I have a feeling that I have sort of over-killed it. Is it possible to write a shorter proof of the result? Thank you.


How to add a bounding box to OpenLayers 3 map

I have built a simple map using OpenLayers 3, have a look at the code below:  JavaScript code:  var map;  function init(){     map = new ol.Map({         target:'map',         renderer:'canvas',         view: new ol.View({             projection: 'EPSG:900913',             center:[-8015003.33712,4160979.44405],             zoom:5         })     });      var newLayer = new ol.layer.Tile({     source: new ol.source.OSM()     });      map.addLayer(newLayer);      /*          get and display extent          http://gis.stackexchange.com/questions/168590/how-to-get-extent-in-openlayers-3     */      var size = map.getView().calculateExtent(map.getSize());      console.log(size);      console.log(map.getSize());       /* ========================== */  }  /* function to remove layer */  function removeTopLayer(){     var layers = map.getLayers();     layers.pop(); }  /* ========================= */   /* swap layers function */  function swapTopLayer(){     var layers = map.getLayers();     var topLayer = layers.removeAt(2);     layers.insertAt(1, topLayer); }  /* =================== */   HTML code:

         <button style='position:absolute; left: 10px; top:30%' onclick='removeTopLayer()'>Remove Top Layer</button>         <button style='position:absolute; left: 10px; top:40%' onclick='swapTopLayer()'>Swap Top Layers</button>         Functioning link can be found .   Now I wanted to add a bounding box, so that when the map loads, it only loads for a specific area, I searched for examples online, but  they are either of OL2 or are about a user selecting a bound box dynamically, which is not my requirement. My requirement is pretty simple, all I want is the tiles for a specific bounding box to load instead of the map for the entire world to load.   I found the below method in OpenLayers 3.0 doc's , but I am not sure how to use it. :(  So now suppose I want to add a bounding box for THIS area, how would I go about doing it, using the boundingExtent method? Can anybody explain?   I have been scratching my head over this one for quite sometime now, can anybody help me achieve my goal of have only a specific bounding box load?


How can I turn off Unity's online search results?

I've never liked or used any of the suggested results from the quick search bar of Unity (14.04). Just today, when launching my usual gedit program, it started showing me images of genital mutilation and other terrible things. How do I turn off this unwanted bloat ware? Obviously if I want to do a web search, I use my browser and the command Ctrl-L.


I have no idea of proving $H\otimes l^{2}(\Gamma)\cong\bigoplus\limits_{g\in \Gamma}H$,where H is a hilbert space,$\Gamma$ is a discrete group, $l^{2}(\Gamma)$ is the set of all complex valued square summable fuctions on $\Gamma$.


How to make persistent USB for Ubuntu 18.04.1 using Windows?

Well digging through many discussions, but all being from a long time ago (Ubuntu 16 or something) tell to use, LiLi, Universal or something other, but others say that they are no longer in use.  So is there currently an application that allows you to create a persistent live USB from Windows, to a 8GB USB?


Can we add a panel in other panel? If yes, then what's wrong in my code

I am trying to make a very simple Time Manager, when i compile it shows an error. I am unable to find the mistake in my code which is producing the error.  JPanel otherPanel = new JPanel(); otherPanel.add(BorderLayout.WEST, timingsPanel); otherPanel.add(BorderLayout.CENTER, todoPanel); otherPanel.add(BorderLayout.EAST, checkPanel);   The error is:  Error message: Exception in thread "main" java.lang.NullPointerException     at java.desktop/java.awt.Container.addImpl(Container.java:1117)     at java.desktop/java.awt.Container.add(Container.java:460)     at GUI.setUpGui(GUI.java:57) at manager.main(manager.java:6)   code around line 57:  //setting up otherstuff otherPanel = new JPanel(); otherPanel.add(BorderLayout.WEST, timingsPanel); otherPanel.add(BorderLayout.CENTER, todoPanel); otherPanel.add(BorderLayout.EAST, checkPanel);   The below code in minimum, it's also showing the same error  import javax.swing.*; import java.awt.*;  public class timeclass {     JFrame frame;     JPanel headerPanel;     JLabel header;     JPanel otherPanel;     JPanel timingsPanel;     JPanel todoPanel;     JPanel checkPanel;       public void setUpGui()     {         frame = new JFrame("Time Manager");          //setting up header         headerPanel = new JPanel();         header = new JLabel("Time Manager");         header.setFont(new Font("Times New Roman", Font.BOLD, 36));         headerPanel.add(header);          //setting up otherstuff         otherPanel = new JPanel();         otherPanel.add(BorderLayout.WEST, timingsPanel);         otherPanel.add(BorderLayout.CENTER, todoPanel);         otherPanel.add(BorderLayout.EAST, checkPanel);          //setting up frame         frame.setDefaultCloseOperation(frame.EXIT_ON_CLOSE);         BoxLayout boxLayout4 = new BoxLayout(frame, BoxLayout.Y_AXIS);         frame.setLayout(boxLayout4);         frame.add(headerPanel);         frame.add(otherPanel);         frame.setSize(900, 400);         frame.setVisible(true);     } }


In MCU, Hawkeye and Black Widow talked about Budapest. What really happened in Budapest?

In The Avengers, Black Widow and Hawkeye, alongside other Avengers were in a battle which I cannot remember. However, they were distinctly talking about the Budapest being similar to the battle they were currently in. What really happened in the Budapest?


This is one of the exercises of 'Do Carmo' (Section 3.5, 12)     How do you prove that there are no compact (i.e., bounded and closed in $\mathbb{R}^3$) minimal surfaces?   Thanks!


Recursively update all Folder "Date-modified" timestamps to date of newest file

I would like to recursively update the Date Modified field of a directory (and all its subdirectories) so that every folder has the same Date Modified timestamp as the most recently modified file that is contained within the tree.  I have read and tried to utilise the detailed solutions posted here:  but am unable to get them to work.  I am using Mac OS.


Failed to set 44100hz, use 48000hz instead

How do i fix this? Ive used youtube videos and online information but nothing helps. My computer is an Lenovo, Ideapad 330. Its processor is an AMD A9, Radeon R5, 5 compute Cores 2C+3G. It also had 8GB of Ram and 1TB of storage.  Ive viewed the Help Link for this problem and I have tried everything and nothing changes.


Can I pass my worlds on Minecraft Pocket Edition, on a iPad2, to a Minecraft edition on a Mac?

I have an iPad2, with a Pocket Edition on it, but with an old iOs, and I can't play normally on it, because its a really old iPad, the question is, can I pass my worlds to an iMac Minecraft edition ?


Wrong marginnote positions inside a tikzpicture with XeLaTeX

The marginnote package offers the \marginnote macro. I use this inside a tikzpicture environment to place notes into the margin.  While this works without problems when compiling with pdfLaTeX, this gives horizontal shifts when compiling with XeLaTeX.  Consider the following MWE:  \documentclass{article} \usepackage{marginnote} \usepackage{tikz} \usepackage[showframe]{geometry}  \begin{document}  This line\marginnote{ABC} contains a margin note.  \begin{tikzpicture}   \fill[red] (-1,-1) rectangle (1,1);   \node[right] at (1,0) {This line\marginnote{ABC} contains a margin note.}; \end{tikzpicture}  \end{document}   Compilation (twice) with pdfLaTeX (using MiKTeX on Windows) gives the expected result:    Compilation with XeLaTeX (using MiKTeX on Windows) gives shifts the second note inside the tikzpicture:    Can this code be modified to compile correctly for pdfLaTeX and XeLaTeX?


I want to use Asmptote to draw a small triangle in red inside a unit cube. Here is my code:   settings.outformat="pdf"; settings.prc = false; settings.render = 0; defaultpen(fontsize(10pt)); size(4cm,0); import three; draw(unitbox); triple p0 = (0.8,1,0); triple p1 = (1,0.8,0); triple p2 = (1,1,0.2); draw(surface(p0 -- p1 -- p2 -- cycle),red); draw(p0 -- p1 -- p2 -- cycle);   However, color of the triangle is not desired. How could I resolve it? Thanks in advance!


How can I remove duplicates from an array list using two methods?

The first method finds the duplicate and the second removes it.  I tried the following code and it does not work. I don't understand why. to be done using two methods. When I call the methods, they do not remove the duplicates. The arraylist is unchanged. I want to remove the duplicates using two methods.   public static int find(ArrayList<String> s, int i) {      for (int j = i + 1; j < s.size(); j = j + 1) {         if (s.get(i) == s.get(j)) {             return j;         }     }      return -1; }   public static void removeDuplicates(ArrayList<String> s) {     for (int i = 0; i < s.size(); i = i + 1) {         int foundAt = (find(s, i));         if (foundAt >= 0) {             s.remove(i);         }     } }


Mounting Encrypted Core Storage Volume(s) On Startup

Okay, so I have three main volumes for my system; one for the OS (SSD) one for users and files (Fusion Drive) and one for backup.  All three are encrypted Core Storage volumes.  The problem is that only the OS volume is unlocked on startup, the other two won't be unlocked until a user logs in. That's fine except that only my system's administrator user is on the OS volume, all the others are on the users and files volume, so they can't login until that volume has been unlocked.  Currently this means that on start-up I need to login as the administrator so that the drives unlock, and then logout and login as the correct user which is is kind of annoying, as really I don't want to login as the administrator at all as it's only there for permissions or recovery).  The two non-OS volumes have their keys stored in the system keychain, with CSUserAgent permitted access, however the name of this tool suggests it won't run until a user logs in.  What I'm wondering is whether there's a way to trigger an unlock sooner without having to do something insecure (like put the password into a script)? Since the passwords are in the system keychain, I thought perhaps I could just permit access to the appropriate process, or even that a script run as root (i.e - a LaunchDaemon with RunAtLoad) might be able to unlock the volume(s)?


-bash: /usr/sbin/useradd: Input/output error — What does this mean?

Today, on my Centos server I tried to add a user but got the following error:  -bash: /usr/sbin/useradd: Input/output error   How do I fix it?


What is the difference between `apt upgrade` and `apt-get full upgrade`? Is the later one not suggested to use?

Recently when I was trying to update my Ubuntu, I initially used the commands: sudo apt-get update && sudo apt-get upgrade Then, I thought my system is full updated (i.e., with system and security updates), but gradually I found that Ubuntu was still prompting for certain updates, and those were actually the system updates. Proceeding, I read some discussions online, and started using, sudo apt-get update && sudo apt-get full-upgrade This also downloaded certain files like: linux-headers-generic   linux-image-generic  etc. Yesterday, someone suggested me to use: sudo apt-get update && sudo apt upgrade instead, since, it was mentioned that, apt-get full-upgrade might cause error and is dangerous, for it can lead to deletion of necessary packages if the package system is "messed-up". Now, I am a bit confused, and feels like to start over again. Which command set should I use to get full system and security updates, and what is the actual difference between apt-get full-upgrade and apt upgrade. Is the former shouldn't be really put to use?


What uses are there for "placement new"?

Has anyone here ever used C++'s "placement new"? If so, what for? It looks to me like it would only be useful on memory-mapped hardware.


Rename "Looks Good" or add a "Looks OK, just Incorrect" in Low Quality Question Review

When reviewing possibly low quality posts you sometimes see OK answers, except that they're wrong. From the review interface you can't downvote so you can only comment or edit, and editing isn't really an option when the intended answer is wrong.  Once you've commented or upped an existing comment, should we then click Looks Good because there's nothing wrong with the answer, except that it's wrong, or Not Sure so that the answer is reviewed again (and again)?


The references appear only in one frame in beamer, meaning that the list of references is incomplete.  How can I create the necessary number of frames?  Here is the .tex exported from LyX:  %% LyX 2.3.0 created this file.  For more info, see http://www.lyx.org/. %% Do not edit unless you really know what you are doing. \documentclass[english]{beamer} \usepackage[T1]{fontenc} \usepackage[latin9]{inputenc} \setcounter{secnumdepth}{3} \setcounter{tocdepth}{1} \usepackage[authoryear]{natbib}  \makeatletter %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% Textclass specific LaTeX commands. % this default might be overridden by plain title style \newcommand\makebeamertitle{\frame{\maketitle}}% % (ERT) argument for the TOC \AtBeginDocument{%   \let\origtableofcontents=\tableofcontents   \def\tableofcontents{\@ifnextchar[{\origtableofcontents}{\gobbletableofcontents}}   \def\gobbletableofcontents#1{\origtableofcontents} } % plain title style, override default \renewcommand\makebeamertitle{\frame[plain]{\maketitle}}%  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% User specified LaTeX commands. \usepackage{url} %\usepackage{hyperref} \usepackage{tabularx} %\usepackage[super,sort&compress]{natbib} \usetheme{Warsaw} % for beamer version >= 3.5 only %\setbeamertemplate{page number in head/foot}[totalframenumber] \usepackage{dsfont} %\usepackage[table]{xcolor} %\usepackage{dcolumn} \addtobeamertemplate{footline}{\insertframenumber/\inserttotalframenumber} \renewcommand{\bibsection}{}  \makeatother  \usepackage{babel} \begin{document}  \title{Template beamer} \makebeamertitle \begin{frame}{}  \citet{king_matrix_2014,king_comparing_2015-1,khindanova_location_2011,kishita_estimation_2012,koskinen_energy_2016,kok_measuring_2006,krausmann_growth_2009,le_boulzec_impacts_nodate,lambert_eroi_2012} \end{frame} % \begin{frame}{}  \bibliographystyle{plainnatnourl_clean} \bibliography{\string"C:/Users/a.fabre/Google Drive/Economie/Articles/Environment\string",\string"C:/Users/a.fabre/Google Drive/Economie/Articles/test\string"} \end{frame}  \end{document}


Do airlines raise the ticket price as flights fill up?  I know YMMV, but as a general rule, is it how they operate?  and as a bonus question, once a flight is full, would they schedule a new one on the same date with lower prices at first?


How to make a press proof with crop marks and color bars?

A standard proof for press needs crop marks and color bars as below    With the package crop, the crop marks can be easily added.  But how about the color bar ?  Is there a way or a package to make it ?  An example is   \documentclass[b5paper,10pt]{article} \usepackage[utf8]{inputenc} \usepackage[cross,a4,center,info,axes]{crop}  \title{Test} \author{User} \begin{document} \maketitle \section{Fox} The quick brown fox jumps over a lazy dog. \end{document}


Calculation of $\lim_{n\to \infty}\prod_{r=1}^{n} \left(1+\frac{r}{n}\right)^{\frac{1}{n}}$

Calculation of  $\displaystyle \lim_{n\to \infty}\prod_{r=1}^{n} \left(1+\frac{r}{n}\right)^{\frac{1}{n}}$  $\bf{My\; Solution::}$  Let $y=\displaystyle \lim_{n\to \infty}\prod_{r=1}^{n} \left(1+\frac{r}{n}\right)^{\frac{1}{n}}$, Now taking $\log_{e}$ on both side  $\displaystyle \log_{e}(y) = \lim_{n\to \infty}\log_{e}\left(\prod_{r=1}^{n} \left(1+\frac{r}{n}\right)^{\frac{1}{n}}\right)=\lim_{n\to \infty}\frac{1}{n}\cdot \sum_{r=1}^{n}\log\left(1+\frac{r}{n}\right)$  Now Using Reinman Sum of Integral ...  $\displaystyle \log_{e}(y) = \lim_{n\to\infty}\frac{1}{n}\cdot \sum_{r=1}^{n}\log\left(1+\frac{r}{n}\right) = \int_{0}^{1}\ln(1+x)dx = \log_{e}(4)-\log_{e}(e) = \log_{e}\left(\frac{4}{e}\right)$  So $\displaystyle y =\lim_{n\to \infty}\prod_{r=1}^{n} \left(1+\frac{r}{n}\right)^{\frac{1}{n}} =\frac{4}{e}$  But how can i solve above question using Stirling Approximation,  May I ask for help?  Thank you in advance!


Is there an equidissection of a unit square involving irrational coordinates?

An equidissection of a square is a dissection into non-overlapping triangles of equal area.   from 1970 states that if a square is equidissected into $n$ triangles, then $n$ is even.  In 1968, John Thomas proved the following weaker statement: there is no equidissection of a unit square into an odd number of triangles whose vertices are rational numbers with odd denominators.  I wonder to which extent the result of Thomas fails to cover all cases. It is easy to construct an equidissection where the coordinates are rational numbers with even denominators.  My question is:     Is there an equidissection of the unit square containing a triangle with at least one irrational coordinate?   Dissecting the square into $6$ or less triangles seems to always yield rational coordinates.


I want to write a solution manual for a maths book which is about 900 pages.  I want it to include detailed solutions to all exercises as as well summaries for every chapter.  The file will obviously be quite large. I'd love to hear any tips on handling such large files, such as breaking it into several files etc...


Proving f(x)=0 for all x in [a,b] when we only know that f is continuous and f(x)=0 when x is rational.

The question is as follows  a.) Let $f(x)$ be continuous function on an interval [a,b] and suppose that $f(x)=0$ for each rational value $x$ in [a,b]. Prove that $f(x) = 0$ for all $x \in [a,b]$.  b.) Let $f(x)$ and $g(x)$ be continuous functions such that $f(x)=g(x)$ for each rational value of $x \in [a,b]$. Prove that $f(x)=g(x)$ for any $x \in [a,b].$  To prove the first part I thought that since we know $f(x)$ to be continuous, by the definition of continuity we can show $|f(x)-f(a)|< \epsilon$ when $|x-a|< \delta$. Then I was going to show that there is a irrational within each epsilon of a rational. It this the right thought process?   I also thought it might be possible to use the limit definition of continuity along with the fact that each rational is the limit of a set of irrationals to show $f(x)=0$ for all $x \in [a,b]$.   Anyways help would be greatly appreciated.


Possible Duplicate:     Which one of these is correct?  It is I who am at fault. It is me who is at fault.  The word "is" is a conjugation of "be" which is a linking verb. I also want to know the same for 2nd person.  It is you who are at fault. It is you who is at fault.


login loop problem after installing nvidia graphics driver

i have tried adding nouveau blacklisting problem and I also tried it in ubuntu 18.04, 16.04, 14.04 but nothing worked for me.  but whenever I install the nvidia driver and restart, it gets into login loop.


how to wire NPN to switch DHT22 temperature humidity sensor on arduino

I am using the arduino with DHT22 temperature, humidity sensor, but i don't want to constantly power the sensor, so I would like to have a NPN 2N2222 transistor to control when to the give the power.   but i am a bit puzzled how to wire them together, which how the collector and emmitter should be wired to DHT22 sensor


Convergence of a sequence, $a_n=\sum_1^nn/(n^2+k)$

Let $ a_{n} = \sum_{k=1}^{n} \frac{n}{n^{2}+k}$ . I would like to know whether the given sequence converges.   I see  that,  $ a_{n} = \sum_{k=1}^{n} \frac{n}{n^{2}+k}= \sum_{k=1}^{n} \frac{1}{n+\frac{k}{n}}.$ When $n$ gets sufficiently large the contribution by the $ \frac{k}{n} $ term is diminishing and $ a_{n} < \sum_{k=1}^{n} \frac{1}{n} = 1 $.   Thank you.


Is there a system for creating words for ordinal numbers?

I'm not sure if "sequential" is the right word, but what is the system for creating a sequence of numbers like this:   primary (as in 1st in choice or importance) secondary (as in 2nd in choice or importance) tertiary (as in 3rd in choice or importance) ??? PROFIT   What would be the following words after "tertiary" if there are any?


I've see a number of terms that make reference to the word "bias". I've read the  but I'm after are more practical answer.  Some examples of what a forward or reverse biased device is would also be well received.


How to use biblatex bibliography database in latest Classicthesis LyX version 4.2

I am using classicthesis-LyX-v4.2_biblatex_bibtex8 issued in Sep 2015. I already have a bib. file by converting endnote to bib. (endnote staff confirmed with me that the file is well-converted). However, I got very confused about how to use database for referencing.   What I want is the very common in-text author-year citation style: ".....(Surname, 2016).....Surname (2015) argues that...."  In the Bibliography section: I want common hanging indent without [number] in front (this is an example from the APA website):   I have attached the explanation from the template. I followed it and I ended up getting error message when opening the parent Classicthesis lyx file. I also only see about 10% of my references showing up in the box when I click insert->citation. It would be much appreciated if I can get more detailed step-by-step guide from the default setting, for example, telling me what to load first, click what, insert what at which place etc.    [UPDATE!]  Since my thesis deadline is one week later, if there is no hope to figure it out , I just want to copy the completed reference pages in word to LyX. It would be nice if any one can teach me how to do the "hanging indent" in LyX, that is, mimicking the final layout I want under "standard" environment.  Please see  for details.


R^ 2 with dictionary order topology is metrizable

This problem is from topology by  munkres book. Need ideas to solve this.


Is it possible to make redundancy on HAProxy server?

I am going to use HAProxy as a load balancer that will balance requests on 3 application servers. But what if balancer server (HAProxy) fails at some point? I was thinking of cloning the first balancer, so if the main one fails the other will take its place. Something like HSRP.  Is it possible? if yes how?


Cardinality of equivalence relations on N

I asked a similar question yesterday about well ordered sets, now I am having troubles with equivalence relations.   Could someone suggest an injection from a well known set of cardinality $2^{\aleph_{0}}$ to the set of all equivalence relations of $\mathbb{N}$?  Many thanks in advance!


relative polar coordinates for TikZ elements in axis environment

I would like to annotate a patch plot with lines whose start and end points are given in absolute polar and relative polar coordinates, respectively.  The patch plot, based on cartesian data, comes out as a circular shape centred around the origin (0,0) and shall be simulated here by a plain circle.  Lines should start at the circumference of the shape and point away from the shape under a given angle and have a well defined length. Therefore, the use of relative polar coordinates for the line's end point.  What seems to be straightforward with TikZ (left) fails inside the axis environment of pgfplots (right): neither the inclination angle nor the length of the line are correct if relative polar coordinates are used.    What is wrong with the rel. polar coordinates here?  The code:  \documentclass{standalone}  \usepackage{pgfplots} \pgfplotsset{compat=1.13}  \begin{document}  \begin{tikzpicture}   \draw(0,0) circle[radius=0.01];   \draw[blue] (0,0) circle[radius=1];   \draw[thick] (45:1) -- ++(45:0.5); \end{tikzpicture}  \begin{tikzpicture}   \begin{axis}[tiny,enlargelimits,   axis equal,   xmin=-2,xmax=2,   ymin=-1,ymax=1,   xtick={-2,-1,0,1,2},   ytick={-2,-1,0,1,2},   grid=major,   ]   \draw[blue] (0,0) circle[radius=1];   \draw[blue, dashdotted] (0,0) -- (45:2);   \draw[thick] (45:1) -- ++(45:0.5); %  \draw[thick] (45:1) -- (45:1.5); %absolute coordinates do work   \end{axis} \end{tikzpicture}  \end{document}


Php string not working in Wordpress Functions.php

How to pass the following code. <div> <?php $category = get_the_category(); ?>       <a  href="<?php echo get_category_link($category[0]->cat_ID); ?> ">       <?php echo $category[0]->cat_name; ?> </a> </div>  In the function.php file's following code. $related_blog .="//want to pass the above code here.";  For detailed description visit here:


What does it mean for the group of rotation matrices to have a "manifold structure"

I have just been exposed to rotation matrices, and it is showing extremely strong connection with group theory and differential geometry which I am both totally inept at.  Can someone in simple term explain what it means for a group to have a manifold structure and how this affects the mathematics of rotation group?


Understanding dummy (manual or automated) variable creation in GLM

If a factor variable (e.g. gender with levels M and F) is used in the glm formula, dummy variable(s) are created, and can be found in the glm model summary along with their associated coefficients (e.g. genderM)  If, instead of relying on R to split up the factor in this way, the factor is encoded in a series of numeric 0/1 variables (e.g. genderM (1 for M, 0 for F), genderF (1 for F, 0 for M) and these variables are then used as numeric variables in the glm formula, would the coefficient result be any different?  Basically the question is: does R use a different coefficient calculation when working with factor variables versus numeric variables?  Follow-up question (possibly answered by the above): besides just the efficiency of letting R create dummy variables, is there any problem with re-coding factors as a series of numeric 0,1 variables and using those in the model instead?


I have a project on QGIS 2.18 which includes several raster and vectorial layers and need to export the full project as a high resolution Geotiff.   QGIS allows to export project as an image on print composer but it exports a low resolution image.  I am also able to export layer by layer but I need to export the full project as a single file.  Is there any plugin or approach that allows me to achieve that?


Show that any monotone boolean function can be realize by the following connectives.

Let the following be the set of connectives involving {$\top,\ \bot,\ \land,\ \lor$}.  Set $F \leq T$  Show that any monotone Boolean function $f$ can be realize by a wff (well-form formula) using only the above set of connectives.  My attempt is to mimic the prove for the theorem:   "Let $G$ be an $n$-th place Boolean function, we can find a wff $\alpha$ that realizes $G$"  Attempt:  Case I: ran($f$) = {$F$}, then clearly $f$ can be realize by the constant $\bot$.  Case II: ran($f$) = {$F, T$}.  Mimicking the prove for the theorem, we can look at the $k$ points at which $f$ has the value $T$ and put in a matrix/grid  <$X_{11},...,X_{1n}$ >  ....  <$X_{k1},....,X_{kn}$>  For some $k\in \mathbb{N}$  Define $\beta_{ij} = \begin{cases}       A_{j}, & \text{if}\ X_{ij}=T \\       A_j\ \lor\ \top, & \text{if}\ X_{ij} = F     \end{cases}$  Define $\gamma_i = \beta_{i1} \land...\land \ \beta_{in}$  Define $\alpha = \gamma_1 \lor......\lor\ \gamma_k$, $\alpha$ realizes $f$.  Although the proof is similary, I can help but feel that I did something wrong here, mainly becuse I didnt make use of the fact that $f$ is mono-tone.  If I did make a mistake kindly point it out and perhaps point me in the right direction.


Why is there a loss of quality from camera to computer screen

When i take a photo it looks bright, sharp and vibrant colours, but when it is transferred to my computer it looks so bad. Very dull and dark with weak colours. I have to brighten and increase contrast plus give it lots of colour saturation to get it close to the picture on the camera screen.


Is there any way I can prevent Ubuntu 16 from freezing under heavy CPU load?

I'm a developer working a lot with Android Studio. When it compiles the Java classes it spins up 4+ threads of CPU intensive work. Often I play music in the background when that goes on. Here's what happens:   The music skips or completely stops at the most intensive section of the compilation The mouse point jitters or stops responding altogether   Most often things normalize after compilation is done, but other times the computer freezes totally and I have to hard reset it. How come? Is not Linux/Ubuntu/Unity designed to prioritize the UI thread? How does it allow Java to take 100% of the CPU resources? Is there any way I can throttle this?  Disclaimer: I don't know much about OS code.


A strange 'undefined reference to' error with g++

See my demo code below:  b.hpp:  #ifndef B_HPP #define B_HPP  namespace debug { class test { public:   template <class T> void foo(T a);  private:   int a; }; } #endif   b.cpp:  #include <iostream> #include "b.hpp"  namespace debug {  template <class T> void test::foo(T a) {   std::cout << "debug" << std::endl; }  }   testb.cpp:  include "b.hpp"  int main(int agrc, char *argv[]) {   debug::test a;   int c = 5;   a.foo(c);   return 0; }   I compile it with   g++ -std=c++11 testb.cpp b.cpp'   and get a error:  /tmp/ccnjR5S4.o: In function `main': testb.cpp:(.text+0x1c): undefined reference to `void debug::test::foo<int>(int)' collect2: error: ld returned 1 exit status   What's the problem?  If I put main function in b.cpp and compile b.cpp, it 's ok. Why?  Thanks!


What does '=>' mean (in functions / property context)?

I got an auto generated code using Lambdas while developing a Xamarin application:  public override string this[int position] => throw new NotImplementedException();  public override int Count => throw new NotImplementedException();   What does the => operator mean in this context?  Thanks R


Finding limiting distribution of $Y_n/\sqrt{n}$

Fix $n \in \mathbb{N}$ and let $\{X_i\}_{i=1}^\infty$ be independent and identically distributed discrete uniform random variables over the set $S_n := \{1, ..., n\}$.  We define $Y_n = \text{min} \{k:\exists l < k : X_l=X_k\}$  PROBLEM I WISH TO SOLVE:     Compute the limiting distribution of $Y_n/\sqrt{n}$ as $n \rightarrow \infty$.   My attempt so far is as follows:  For fixed $n$, $$P(Y_n > y) = P(X_1, ..., X_{\lfloor y \rfloor} \text{are distinct}) = \frac{n!}{n^{\lfloor y \rfloor}(n-\lfloor y \rfloor)!}$$  (for $y \in [2, n+1)$ - this probability is $1$ if $y < 2$ and 0 for $y \ge n+1$).  The first equality follows by definition and the second follows since we simply pick $\lfloor y \rfloor$ values from $S_n$, and assign to each of $X_1, ..., X_{\lfloor y \rfloor}$ with probability $1/n$.  My final problem is simply to compute  $$\text{lim}_{n \rightarrow \infty} P(Y_n > y\sqrt{n}) = \text{lim}_{n \rightarrow \infty}\frac{n!}{n^{\lfloor y\sqrt{n} \rfloor}(n-\lfloor y \sqrt{n}\rfloor)!}$$  I've tried using Stirling's formula to simplify but I really have no clue how to proceed since it isn't working for me.  Please help if you can!  EDIT: Answer is here for anyone curious:


In high school debate, we have resolutions or topics. This month our topic is, "In the United States criminal justice system, jury nullification ought to be used in the face of perceived injustice." Many debaters will end up specifying a certain type of injustice e.g. they will claim a certain law is unjust and juries ought to nullify in this situation only.   On previous debate topics there has been a lot of debate over whether this is grammatically accurate. Some people have argued that certain terms in the resolution are a generic bare plural and thus specification is incorrect. Is that the same for this situation? Is there some other grammatical rule that is violated by specifying?   With regard to Henry Wu's similar question. That question is similar but does not completely answer my question. I was wondering if the topic must be interpreted generically. Deadrat's answer does not answer the question completely because it seems to appeal to the idea that perceived injustice is a generic term without a modifier;however, this idea is not justified.


Omit comment replies from the minimum character limit check

Comments must be at least 15 characters long, which is supposed to make comments like "..." impossible to submit. This works fine, however, there is a way around this, by using comment replies, even "fake" ones e.g. "@somelongname ...". Can the system strip the comment reply part (e.g. "@somelongname") before performing the minimum characters check?


Why are there so frequent updates on Ubuntu 18.04? Or is it possible that I have the developer's edition? If yes, then how to verify?


I want to provide proof for the following equation:  $$\sum_{r=0}^n(-1)^{n-r}\binom{n}{r}r^n = n!$$  I think it resembles the typical way of representing the Principle of Exclusion & Inclusion:  $$\sum_{\emptyset \ne J \in [n]}(-1)^{\mid J\mid-1}\mid\cap_{j\in J}Z_j\mid$$  However, still vague to let $Z_j$ to be which set to connect two different representations.  any advice or pinch of hints?


Why can't gravitons be created in traditional particle accelerators?

I've heard that it is incredibly difficult to detect a graviton, but I don't quite understand why. With all of the knowledge I have at the present time it seems like it should be possible to create a graviton in a particle accelerator. This is how I figure: a graviton is massless, so the collision shouldn't need to have too high of an energy. Since gravity acts upon anything with energy, a graviton field should couple with all of the other fields, so it seems like gravitons could be created in collisions. A graviton created this way would probably not show up on traditional detectors, but the two units of spin associated with the particle would be missing from the observed decay products. What is wrong with this picture?It may come from a naive understanding of scattering, as I am no physicist (yet.)   p.s. I have the same misunderstanding regarding axions. They are predicted to be light particles, so why aren't they created in collisions?


Which application receives which hotkey? (List X clients which hold key grabs.)

How can I list the X clients which registered for a specific keyboard event (i.e. a key press; a shortcut thing). Those things are called passive key(board) grabs.  And the list should contain what that application is registered for what keysyms (with what modifiers).


How can I prove that a number of the form $2^{2n}-1$ is divisible by 3?

How can I prove that for each positive integer $n$ the number $2^{2n}-1$ is divisible by $3$? $3$?


how to handle directory names containing blanks globally?

I tried this  \graphicspath{{/Volumes/MacHD2/'Messprojekte HD2'/Ensmad/Bericht/Bilder/}}   but it doesn't work. Okay, I could rename that directory, but would prefer not to do this.  I need a 'global' solution, I don't want to edit each of the 65 lines with \inclegraphics as you can see in the possible duplicate.


How to use ffmpeg to add picture watermark and text watermark at the same time

ffmpeg -y -i test.mp4 -i bkg.png -filter_complex "[0:v]drawtext=fontfile=PingFang-SC-Regular.ttf:text='check.....':fontcolor=white:fontsize=36:x=200:y=200:enable='if(gt(t,10),lt(t,20))'[text];[text][1:v]overlay=x=180:y=180:enable='if(gt(t,9.9),lt(t,20))'[out]" -map "[out]" out.mp4  How to put the picture watermark in the front?I'm going to put the text on the picture


What is the recommended approach to compile sequentially some variants of code?

Continuing experimenting with conditional text, I am getting a code with a number of options: some dialogs in english are translated, some other options (not shown in the MWE) enable the document be compiled with or without the graphics. In order to enable an final conversion into a docbook format, I have also made a macro to eliminate explicit reference to chapters, and page numbers. There are other variants. The number of options begins to be a problem for each revision. I would like to be able to generate (compile) most variants sequentially without a manual change of parameters in the code. I have just discovered makefiles, and I am wondering if a makefile could be used to generate all the different variants of the document and how. I have considered locating the lines of code containing the options that need to be changed in subfiles and would be optionnally used for compilation. What would be the best approach ?  \documentclass[a5paper, 11pt,oneside]{book} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc}%  \usepackage{ifthen} \usepackage[english, frenchb]{babel}% Pour franciser LaTeX  \def\pagenum{n} %page numbering  {n} to eliminate  \makeatletter \ifthenelse{\equal{\pagenum}{n}}{\let\ps@plain\ps@empty}{}%first page of chapters \makeatother %==================== \def\lang {ef} %variable used for conditional text e=english, f=french, ef=english with footnotes \newcommand{\CondText}[2]{% \ifthenelse{\equal{\lang}{e}}{{\selectlanguage{english}\emph{#1}}}{}% \ifthenelse{\equal{\lang}{ef}}{{\selectlanguage{english}\emph{#1}}% \footnote{\selectlanguage{french} #2}}{}% \ifthenelse{\equal{\lang}{f}}{{\selectlanguage{french} #2}}{}% }%  \begin{document} \ifthenelse{\equal{\pagenum}{n}}{\pagestyle{empty}}{}% \ifthenelse{\equal{\pagenum}{n}}{\chapter*}{\chapter}{L'auberge}  \CondText {--- Sir, the manager needs to see you before you go !}{--- Monsieur, le patron veut vous voir avant votre départ !}\medskip  Some text in french\dots{}     \end{document}


Why can't I edit my communities on stackexchange.com?

On all established SE sites, using the , you can see your customized list of communities, and a search bar for all SE sites further down. Clicking the small edit link allows you to edit that communities list.  Now if one were a member of many communities and needed a complete list of their communities, they'd go to their . Now that they're here, they might as well edit their communities list.  Oh.


error while trying to pass location cordinate from a list view to a map activity

i have a list view contains the locations coordinate (late,long) and i'm trying to pass them to a map activity to show it on map   this is on android studio and Kotlin  listView.setOnItemClickListener { parent, view, position, id ->          val time = usersList.get(position).time         val long:String = usersList.get(position).long         val late :String = usersList.get(position).late startActivity(Intent(this, MapsActivity2::class.java).putExtra("long",long).putExtra("late",late)) }     class MapsActivity2 : AppCompatActivity(), OnMapReadyCallback {  private lateinit var mMap: GoogleMap  var long:String = intent.getStringExtra("long") var late:String = intent.getStringExtra("late")   override fun onCreate(savedInstanceState: Bundle?) {     super.onCreate(savedInstanceState)     setContentView(R.layout.activity_maps2)       // Obtain the SupportMapFragment and get notified when the map is ready to be used.     val mapFragment = supportFragmentManager         .findFragmentById(R.id.map) as SupportMapFragment     mapFragment.getMapAsync(this) }   override fun onMapReady(googleMap: GoogleMap) {     mMap = googleMap      // Add a marker in Sydney and move the camera     val sydney = LatLng(long.toDouble(), late.toDouble())     mMap.addMarker(MarkerOptions().position(sydney).title("jh"))     mMap.moveCamera(CameraUpdateFactory.newLatLng(sydney)) } }      Process: com.example.firebase, PID: 32463       java.lang.RuntimeException: Unable to instantiate activity ComponentInfo{com.example.firebase/com.example.firebase.MapsActivity2}: java.lang.NullPointerException: Attempt to invoke virtual method 'java.lang.String android.content.Intent.getStringExtra(java.lang.String)' on a null object reference           at android.app.ActivityThread.performLaunchActivity(ActivityThread.java:3289)           at android.app.ActivityThread.handleLaunchActivity(ActivityThread.java:3548)           at android.app.servertransaction.LaunchActivityItem.execute(LaunchActivityItem.java:86)           at android.app.servertransaction.TransactionExecutor.executeCallbacks(TransactionExecutor.java:108)           at android.app.servertransaction.TransactionExecutor.execute(TransactionExecutor.java:68)           at android.app.ActivityThread$H.handleMessage(ActivityThread.java:2155)           at android.os.Handler.dispatchMessage(Handler.java:109)           at android.os.Looper.loop(Looper.java:207)           at android.app.ActivityThread.main(ActivityThread.java:7539)           at java.lang.reflect.Method.invoke(Native Method)           at com.android.internal.os.RuntimeInit$MethodAndArgsCaller.run(RuntimeInit.java:524)           at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:958)        Caused by: java.lang.NullPointerException: Attempt to invoke virtual method 'java.lang.String android.content.Intent.getStringExtra(java.lang.String)' on a null object reference           at com.example.firebase.MapsActivity2.(MapsActivity2.kt:19)           at java.lang.Class.newInstance(Native Method)           at android.app.AppComponentFactory.instantiateActivity(AppComponentFactory.java:69)           at android.support.v4.app.CoreComponentFactory.instantiateActivity(CoreComponentFactory.java:43)           at android.app.Instrumentation.newActivity(Instrumentation.java:1224)           at android.app.ActivityThread.performLaunchActivity(ActivityThread.java:3274)


Algorithm for continuously generating a tile map for a topdown 2D game?

In essence, what I'm looking for is a procedural 2D tilemap continuously generated in a fashion like Minecraft - which is to say generated as the player approaches the edges of the already explored parts of the map. Map is going to be for a topdown 2D-shooter and the purpose of the map is mostly just for background and determining types of enemies and loot to spawn, so it really doesn't need to be very complex.   I've already researched some into the topic, but most of the answers have honestly been a bit too complicated or seemingly made for pregenerated maps.  Voronoi Diagrams and Simplex Noise, while impressive, I don't really understand how to implement in a continuous fashion in realtime. Or at all, really.   What I'm imagining with the generator would be to create simple biomes, composed of two values determining its 'artificiality' (i.e. how man-made the biome is) and 'life' (which is how populated it is). An example would be a city, with high values of life and artificiality both. The values for each would be skewed towards that of its neighbour to ensure that you don't have completely random values. It'd probably be a good idea to ensure that a 'biome' doesn't get too large too, by limiting the amount of tiles?  My question is, are there any better or simpler algorithms to use for something like this beyond Voronoi and Simplex? The game is programmed in C#, I feel I should mention.


User editing the original question to make it a new question

The frequency of the following to happen, is quite high.    User asks a question. Somebody answers it correctly which solves the problem/issue. Instead of upvote or accept, the user edits the question and puts forth a new scenario/question that arose....after applying the answer, which is completely different from the original one.(And is not caused due to the answer)    Is there any other mechanism which can advise the user against such behaviour?    Is there any way to not let the user edit the question after getting the answer for the original question? Or should this be of no concern?    (or should i ask this question somewhere else, in some other way)


What do you call a person who gets a referral?

I am applying for a job that my friend has told me about. He spoke with the employer about me and then told me I should send that employer an email. Because this will be is my first contact with the owner, I thought of composing a formal letter.  As the title says, I want to put the subject of my letter as:     Michael’s Referee(?): Job Application   What is the correct word instead of referee?


Couldn't connect to internet after upgrading from 16.10 to 17.04

I've upgraded my desktop from Ubuntu version 16.10 to 17.04.  When I try to login I'm not able to login. See .  I did Ctrl + Alt + F1 and able to log in through terminal.  After logging in via terminal, I'm not able to connect to Ubuntu sites:    But looks like I'm able to connect to google:    Third related question I posted:


Problem of Algebra Abstract by Herstein sec. 2.2 number 4

Problem 3  If $G$ is a group in which $(ab) ^i = a^i b^i$ for three consecutive integers $i$, prove that $G$ is abelian.  Show that the result of problem 3 would not always be true if the word “three“ were replaced by “two”. in other words, show that there is a group $G$ and consecutive numbers $i$, $i +1$ such that $G$ is not abelian but does have the property that   $$(ab) ^i = a^i b^i$$ and   $$(ab)^{i+1}  = a^{i+1} b^{i+1}$$    $\forall \, a, b \in G$


Divisibility by 7 rule, and Congruence Arithmetic Laws

I have seen other criteria for divisibility by 7. Criterion described below present in the book Handbook of Mathematics for IN Bronshtein (p. 323) is interesting, but could not prove it. Let $n = (a_ka_{k-1}\ldots a_2a_1a_0)_{10} = \displaystyle{\sum_{j=0}^{k}}a_{k-j}10^{k-j}$. The expression $$ Q_{3}^{\prime}(n) = (a_2a_1a_0)_{10} - (a_5a_4a_3)_{10} + (a_8a_7a_6)_{10} -\ldots  $$ are called alternating sum of the digits of third order of $n$. For example,  $$ Q_{3}^{\prime}(123456789) = 789-456+123=456 $$ Proposition: $7 | n \ \Leftrightarrow \ 7 | Q_{3}^{\prime}(n)$.  proof. ??  Thanks for any help.


Who is the scientist referenced in Thor that had all his stuff taken by SHIELD?

I’m rewatching Thor, and I wondered if any reference is made in Ant-Man or another movie to the scientist that had all his stuff taken by SHIELD? This comment happens right after all Jane’s equipment is taken by  Coulson maybe 50 minutes into the first Thor movie.     SELVIG             No one knows much about them. But             I knew a scientist -- a pioneer in             gamma radiation. SHIELD showed up,             and he was never heard from again.   I was thinking it could have been Hank Pym, but I’m not that familiar with the timelines and when he started with SHIELD. Or like, how old Erik Selvig is supposed to be. It’s strange they never did anything with this, considering all the time ins between the movies, but maybe it was just a passing comment - or a plot line that never came together?


Show f(x):=sqrt(x) is uniformly continuous on [0,1]

Show $f(x):=\sqrt{x}$ is uniformly continuous on $[0,1]$.  What I did:  Need to show that $\forall \varepsilon>0: \exists\delta>0$ such that $\forall x,y\in(0,1): |x-y|<\delta\Rightarrow|f(x)-f(y)|<\varepsilon$  Choose $\delta=\varepsilon^2$.  then for $x,y\in(0,1)$ with $|x - y| < \delta$,  $|f(x)-f(y)|=|\sqrt{x}-\sqrt{y}|$  $|\sqrt{x}-\sqrt{y}|\le|\sqrt{x}+\sqrt{y}|$  $|\sqrt{x}-\sqrt{y}|^2\le|\sqrt{x}-\sqrt{y}||\sqrt{x}+\sqrt{y}| =|x-y|< \varepsilon^2$  $|\sqrt{x}-\sqrt{y}|\le\sqrt{|x-y|}<\sqrt{\varepsilon^2}=\varepsilon$


regexp don't match if contain specific digit length

I've tried to make a regular expression that match anything except if contains a 11 digits like 12345678910 so don't match anything  what i have tried  [^\d{11}]   but {11} doesn't work with \d expression so what i have to do ?


cmake add_library doesn't initialize static global variable

I have two source files, main.cc, foo.cc.  #include <iostream>  using namespace std;  int main() {      cout << "main\n"; }   foo.cc  #include <iostream>  using namespace std;  class foo { public:     foo() {         cout << "foo ctor\n";     } };  static foo foo_obj;   When I manually compile like this:     $ g++ -c foo.cc -o libfoo.a       $ g++ main.cc libfoo.a -o main       $ ./main       foo ctor       main   But when I use cmake, it won't print foo ctor. Here's the CMakeLists.txt:  cmake_minimum_required(VERSION 3.2)  set(CMAKE_CXX_FLAGS "-std=c++11")  add_library(foo STATIC foo.cc)  add_executable(main main.cc) target_link_libraries(main foo)   Obviously cmake has done something that I don't expect.


For an old machine with 4 GB of RAM, is a 32-bit or 64-bit system faster?

I installed the 64-bit version of Ubuntu 14.04 for the first time, and I think it is heavier than the 32-bit version. While it was installing it got stuck. I tried four times to install.   Is it true that Ubuntu does not get very many updates? Does installing less software and updates help to keep the system running smoothly and fast?  My system has these specs:   Intel-E5700 processor ASUS P5G41T-MLX3 motherboard 4 GB RAM   I know it is old and slow. My question is this:   Do I have to change it to 32-bit for my PC to work faster?


Do all included assets become part of built outcome or only the ones in use?

When building a unity game, does it include all assets inside the project folders etc or only the ones used? Can Unity really tell if a prefab is used anywhere or a sprite or any downloaded package for that matter?


I have downloaded Ubuntu and put it to DVD and it boots on my laptop running xp but it will not let me install Ubuntu over the xp. What have I or am I doing wrong. Laptop is Sony Vaio 32 bit 1gig ram.


How can I edit the windows registry through Ubuntu?

Recently I downloaded a program on windows, and I think it installed a key-logger. I quickly went to Ubuntu, and deleted the program files from there.   I am quite sure that it is gone, but I must have deleted some file that is associated to the windows login (Which I don't know how, since I only deleted the the program's folder from the PrgramFilesx86 directory),because now when I login to windows, it says "loging in" then it flashes grey, then logs out.   I looked up answers to this question, and it seemed like you needed to edit the windows registry. I was wondering if anyone could tell me how to do this from ubuntu. I saw a post that said you needed to install , but their instructions on how to edit the actual registry did not work. I was wondering if anyone could help me fix my problem.


Note that this question is similar but slightly different than . If you believe the answer from that question could be applicable, please explain why it still works for a matrix that has been transposed  The matrix $A$ is defined as: $V=\left(\begin{array}   & 1 & a_0 & a_0^2 & \cdots & a_0^{n-1}  \\ 1 & a_1 & a_1^2 & \cdots & a_1^{n-1} \\ \vdots & \vdots & \ddots & \vdots & \vdots \\ 1 & a_{n-1} & a_{n-1}^2 & \cdots & a_{n-1}^{n-1} \\\end{array}.\right)$  Such that $a_0,a_1,..,a_{n-1}\in \mathbb{C}$  Prove that: $|V(a_0,...,a_{n-1})|=\Pi_{0\leq i<j<n-1}(a_j-a_i)$  For example:    $V(3,2,4)=\left( \begin{array} &1&3&9 \\  1&2&4 \\  1&4&16  \end{array} \right)$ such that: $\begin{vmatrix}  1&3&9 \\  1&2&4 \\  1&4&16 \end{vmatrix}=(4-2)(4-3)(2-3)$    Use the following steps in your proof: -$C_n-a_0C_{n-1}\rightarrow C_n$ -$C_{n-1}-a_0C_{n-2}\rightarrow C_{n-1}$ -Until $C_2-a_0C_1\rightarrow C_2$ -Use induction/recursion to arrive at a solution


I find it confusing when there's a change of variable involved in a definite integral (double or triple) - in cases where the limits themselves are variable.  Here's an example to highlight my problem:  $$\int_0^1\int_0^{1-x}e^{\frac{x-y}{x+y}}~dx~dy$$  The change of variable to go for is $x-y=u$ and $x+y=v$  but now, what shall be the limits of the new integral?  A friend says that the same region in the $uv$ plane would be bounded by $u=-v$,$u=v$ and $v=1$. Could someone please explain exactly how this works? Any help is appreciated, thank you!


How can I exclude a character from a regex capturing group?

I have a regex capture, and I would like to exclude a character (a space, in this particular case) from the middle of the captured string. Can this be done in one step, by modifying the regex?  (Quick and dirty) example:  Text: Key name = value My regex: (.*) = (.*) Output: \1 = "Key name" and \2 = "value" Desired output: \1 = "Keyname" and \2 = "value"   Update: I'm not sure what regex engine will run this regex, since it's part of a larger software product. If you have a solution, please specify which engines it will run on, and on which it will not.  Update2: The aforementioned product takes a regex as an input, and then uses the matched values further, which is the reason for which a one-step solution is asked for. There is no opportunity to insert an intermediate processing step in the pipeline.


Can growing a beard cause problems in crossing borders?

I just recently renewed my passport with a picture taken just after I shaved. I haven't shaved since (>3 weeks) and I kind of like it. I am even looking into how to maintain a beard, but that is a question for another platform.  Regarding traveling I am a bit worried that I look a bit different now then when I renewed my passport. On all my other photo IDs I don't have a beard either.   Long story short, should I shave before boarding my next flight, or are Immigrations/Customs/Airline staff trained to look through the beard?


I am using Ubuntu 20.04 and I was trying to install Windows 10 on my machine but installation is not going to start and I am getting the error as : Windows cannot open the required file C:\Sources\install.wim. Make sure all files required for installation are available, and restart the installation. Error code: 0x8007000D. Previously, I used a usb drive for installation. Using Disks on ubuntu, I formatted it and created a partition as :      size : 31GB -- 26GB free (16.2 % full)      Device : /dev/sdb1      UUID : 026C-2A47      Partition Type : NTFS/exFAT/HPFS (Bootable)      Content : FAT (32-bit version) -- Mounted at /media/ankit/026C-2A47  I have downloaded the Windows 10 ISO file from  and made bootable using UNetbootin but it was not going to start installation.  install.wim file is about 4280 MB in size and ISO file has size 5GB.  Can anyone please help ? Any help would be appreciated


Is it possible to recover an email that has been clicked "delete forever" in the trash folder?

Is it possible to recover an email that has been clicked on "delete forever" in the trash folder? I have accidentally clicked delete forever for an email but now I need to recover it.


My current inbox:    Given that the room in question is not associated with QA... I think there's a bug swimming in this pool :)


Find the closed expression for binomial sum

I need help in finding closed expression for the following sum: $a_n = \sum\limits_{k=0}^n (-1)^k \binom{2n - k}{k}$. By inspecting the first several elements of the sequence I came up with the hypothesis for expression for $a_n$: $a_{3j} = 1,\space a_{3j+1} = 0,\space a_{3j+2} = -1,$ where $j=0,1,2,\dots.$ I was not able to prove this by induction. Is it an easy exercise? What other approaches can be taken to solve this problem? I am mostly looking for as basic solutions as possible since I am new to combinatorics.


Why is "short thirty = 3 * 10" a legal assignment?

If short is automatically promoted to int in arithmetic operations, then why is:  short thirty = 10 * 3;   A legal assignment to the short variable thirty?  In turn, this:  short ten = 10; short three = 3; short thirty = ten * three; // DOES NOT COMPILE AS EXPECTED   as well as this:  int ten = 10; int three = 3; short thirty = ten * three; // DOES NOT COMPILE AS EXPECTED   does not compile because assigning an int value to a short is not allowed without casting as expected.  Is there something special going on about numerical literals?


Ubuntu 18.04.1 LTS update does not work - no release file / GPG errors

When I try to update my laptop running Ubuntu 18.04.1 LTS I use the commands sudo apt update and sudo apt-get update and every time I get this message:  E: The repository 'cdrom://Ubuntu 18.04 LTS _Bionic Beaver_ - Release amd64 (20180426) bionic Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. W: GPG error: https://dl.bintray.com/resin-io/debian stable Release: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY 379CE192D401AB61 E: The repository 'https://dl.bintray.com/resin-io/debian stable Release' is not signed. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details.   Has the OS updated? What should I do so that it updates?


Whenever I try to use the gnuplottex package, I get the following error messages:  /usr/share/texlive/texmf-dist/tex/latex/gnuplottex/gnuplottex.sty:79: Argument of " has an extra }. [...te\write18{rm -f "\jobname.gnuploterrors"}] /usr/share/texlive/texmf-dist/tex/latex/gnuplottex/gnuplottex.sty:79: Paragraph ended before " was complete. [...te\write18{rm -f "\jobname.gnuploterrors"}] /home/myDocument.tex:118: Package catchfile Error: File `myDocument.gnuploterrors' not found. [\end{document}] TeX STOPPED: File ended while scanning use of \gnuploterrors@eatpa\ifx \gnuploterrors@ \@empty \else \PackageWarningNoLine {gnuplottex} TeX reports the error was in file: myDocument.tex   Line 79 of gnuplottex.sty reads \immediate\write18{rm -f "\jobname.gnuploterrors"}, so it not being executed seems to be the cause for the other errors.  Everything worked fine before, but I upgraded to Xubuntu 16.04 LTS lately, so this may be the cause. I already tried removing gnuplot and TeX Live completly and installing them again, but the error remains.  Edit:  I'm using pdflatex and Version 0.9.1 of gnuplottex. All it needs to produce this error is just a \usepackage{gnuplottex}, so for example this document doesn't compile:  %!TEX options = "--shell-escape"  \documentclass[a4paper]{article}  \usepackage{gnuplottex}   \begin{document} \end{document}   However, I noticed that with this minimal file, only the last 3 lines of the error message from above are shown. All 5 lines are only shown if I also add \usepackage{ngerman}.


What is the proper construction of this question - "...for who are we" or "...for who we are"?

What is the proper way of asking the question?  Who is to blame for who we are?  or  Who is to blame for who are we?


column separation lines now showing up in table

I have the following code that produces the table that is shown. What I am trying to do is to get the fourth and fifth column titles vertically aligned at the top. Is this possible?  \documentclass{article} \usepackage{multirow} \usepackage{array}  \newcolumntype{x}[1]{% >{\raggedright\hspace{0pt}}p{#1}}%  \begin{document} \centering \renewcommand{\arraystretch}{1.2} \begin{tabular}{| m{2cm} | p{2cm} | p{2cm} | p{2cm} | p{2cm} | p{2cm} |} \hline     \multirow{3}{1.7cm}{Data Set} &%     \multicolumn{3}{c |}{Raw Data} &%     Offline Processing Time &     Index Size (KB)\\ \cline{2-4} %     & %     RDF N3 File SizeKB (sec)    &%     Number of Triples &%     Number of Entities\\    \hline \end{tabular} \end{document}


What is the "best LaTeX practices" for writing absolute value symbols?  Are there any packages which provide good methods?  Some options include |x| and \mid x \mid, but I'm not sure which is best...


I'm having some issues with the simulated animation from learning blender. specifically my arrays of 30mm vulcan bullets, they all fall too uniformly perfect. The tips come off all at same time and start to tilt in exact same direction before unrealistically landing in a pile. separate by geometry, individual origin points. I have asked, on blender.chat, Chamferzones youtube page, chamferzones discord, and have watch the tutorial like 5 times. His results are different. I have searched for arrays and gravity rigid body physics and cannot find anything useful. This is an image at frame 5 or so as they begin to fall.   Blend file link.  I have never shared a blend file hopefully that works if not let me know how. I packed external data and made relative just in case, not sure if i needed to though.


Why is the power set of $\mathbb{N}$ uncountable?

I know that this question has been asked before, but I still can't find a clear answer, I read here this question:  and a guy wrote: $\emptyset, \{1\}, \{2\}, \{1, 2\}, \{3\}, \{1, 3\}, \{2, 3\}, \{1, 2, 3\}, \{4\}, \ldots$, this would be the power set of $\mathbb{N}$ listed in a row, why would this create a bijection between $\mathbb{N}$ and this set? (which would prove that the power set of $\mathbb{N}$ isn't equinumerous with $\mathbb{R}$)? Or for example writing: $\{1\}, \{2\}, \{3\}, \{4\}, \ldots$ $\{1, 2\}, \{1, 3\}, \{1, 4\}, \ldots$ $\{1, 2, 3\}, \{1, 2, 4\}, \{1, 2, 5\} \ldots$ $\{1, 3, 4\}, \{1, 3, 5\}, \{1, 3, 6\} \ldots$ $\{1, 10, 11\}, \{1, 10, 12\}, \{1, 10, 13\} \ldots$ $\vdots$ $\{2, 3\}, \{2, 4\}, \{2, 5\}, \ldots$ $\{2, 3, 4\}, \{2, 3, 5\}, \{2, 3, 6\} \ldots$ $\vdots$ and then do the diagonalization thing that Cantor used to prove the rational numbers are countable:  Why wouldn't this work? P.s: I know the proof that the power set of a set has a larger cardinality that the first set, and I also know the proof that cantor used to prove that no matter how you list the real numbers you can always find another one that is not inside that list. I know the proof that the power set of $\mathbb{N}$ is equal to $\mathbb{R}$ as well, I'm not saying that my argument is correct and theirs is wrong, I'm just trying to understand why mine is wrong


Mouse and MacBook image appear at startup! What could be the problem?


Is the Forbidden Forest surrounded by a wall?

There are lots of occasions in the books when Hogwarts grounds are hard or impossible to enter. And while they give lots of additional magical protection to it, the main thing that divides the inside and outside of Hogwarts' territory is the wall.  But I was always wondering why no one ever thought of entering the castle grounds through the Forbidden Forest? The forest seems huge - it's big enough for centaurs, acromantulas, thestrals, unicorns and occasional giants to live there without fighting for space. Even then, there is enough space left for a convict on a run to hide, Death Eaters to put their rest camp, Hagrid to organize lessons, and four Dragons to be kept without bothering other inhabitants.  However big and dangerous the forest is, it surely should have an end somewhere miles away from the castle. Maybe somewhere in the mountains. Why not enter the forest there and pass through it to reach the castle? Or at least it could be considered as an option when you try to protect the castle grounds from unwanted intruders.  Does that mean that this huge forest is also surrounded by the castle walls as a part of the castle grounds? That's a strange thing to imagine as it's going to be huge like the Great Wall of China really and it makes the centaurs trapped in the forest like in a natural reserve.  Are there any indications in canon sources of how the Forbidden Forest is protected from the sides that are not facing the castle?


trying to create automatic timestamp for new records

here's the table:     CREATE TABLE `obits` (   `pid` int(11) NOT NULL,   `surname` varchar(50) COLLATE utf8_unicode_ci DEFAULT NULL,   `firstname` varchar(50) COLLATE utf8_unicode_ci DEFAULT NULL,   `middlename` varchar(50) COLLATE utf8_unicode_ci DEFAULT NULL,   `maiden` varchar(50) COLLATE utf8_unicode_ci DEFAULT NULL,   `presuf` varchar(50) COLLATE utf8_unicode_ci DEFAULT NULL,   `birth` varchar(50) COLLATE utf8_unicode_ci DEFAULT NULL,   `death` varchar(50) COLLATE utf8_unicode_ci DEFAULT NULL,   `obitdate` varchar(50) COLLATE utf8_unicode_ci DEFAULT NULL,   `obitsource` varchar(50) COLLATE utf8_unicode_ci DEFAULT NULL,   `sourcepage` varchar(50) COLLATE utf8_unicode_ci DEFAULT NULL,   `obittext` text COLLATE utf8_unicode_ci,   `DateCreated` DATETIME COLLATE utf8_unicode_ci NOT NULL DEFAULT(GETDATE()) ) ENGINE=MyISAM DEFAULT CHARSET=utf8 COLLATE=utf8_unicode_ci;   here is the error I'm getting: You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near '(GETDATE()) ) ENGINE=MyISAM DEFAULT CHARSET=utf8 COLLATE=utf8_unicode_ci' at line 14 (line 14 is the datecreated line)  I probably missed something really simple but for the life of me I don't know what. Thank you for any/all help. This table was fine before I tried to re-create it with the datecreated line.


Showing that $\int_{0}^{k} \frac{f(x)}{f(x)+f(k-x)}dx = \frac{k}{2}$

Let $f(x)$ continuous and integrable, $G(k) = \displaystyle\int_{0}^{k} \dfrac{f(x)}{f(x)+f(k-x)}dx$. Show that $G(k)=\dfrac{k}{2}.$    (Hint: Let $u=k-x)$  Here is what I did:  $G(k) = -\displaystyle\int_{k}^{0} \dfrac{f(k-u)}{f(k-u)+f(u)}du=\displaystyle\int_{0}^{k} \dfrac{f(k-u)}{f(k-u)+f(u)}du$    Then:  $\displaystyle\int_{0}^{k} \dfrac{f(x)}{f(x)+f(k-x)}dx - \int_{0}^{k} \dfrac{f(k-u)}{f(k-u)+f(u)}du = 0$  But now I don't know how to proceed.


I wish to present my education for a potential employer. If I had the chance to phrase a whole sentence, I would go for "I received my PhD from University X", as suggested in other answers to related questions. However, the information needs to be put in bullet point style. I am not sure about the correct preposition here. My thoughts:   PhD at University X   or   PhD from University X   Please not that this information is not connected to a date (as in "2012: PhD from University X"), merely the fact that I earned a PhD is listed.  Thanks for your help in advance!


Can I find the filesystem a file is going to be installed to?

I have a list of files along with their filepaths, that I'm planning to copy into a server. Is there a way, I could figure out before I copy, which filesystem it actually would go into? assuming the disks have been partitioned and mounted.


Root partition size remains same after partition resize with gparted

I had resized my root partition from 30gb to 70gb using gparted. But Ubuntu still shows that I have the same old disk size while gparted shows that I acually have 70gb and that the other 40gb is somehow used. How can I fix this?  Output of 'df -h':  Filesystem      Size  Used Avail Use% Mounted on /dev/sda5        30G   16G   13G  55% / none            4.0K     0  4.0K   0% /sys/fs/cgroup udev            1.9G  8.0K  1.9G   1% /dev tmpfs           391M  884K  390M   1% /run none            5.0M     0  5.0M   0% /run/lock none            2.0G  284K  2.0G   1% /run/shm none            100M   48K  100M   1% /run/user /dev/sda6       341G  115G  227G  34% /media/Data /dev/sdb1       932G  459G  474G  50% /media/sidharth/passport   Output of mount:  /dev/sda5 on / type ext4 (rw,errors=remount-ro) proc on /proc type proc (rw,noexec,nosuid,nodev) sysfs on /sys type sysfs (rw,noexec,nosuid,nodev) none on /sys/fs/cgroup type tmpfs (rw) none on /sys/fs/fuse/connections type fusectl (rw) none on /sys/kernel/debug type debugfs (rw) none on /sys/kernel/security type securityfs (rw) udev on /dev type devtmpfs (rw,mode=0755) devpts on /dev/pts type devpts (rw,noexec,nosuid,gid=5,mode=0620) tmpfs on /run type tmpfs (rw,noexec,nosuid,size=10%,mode=0755) none on /run/lock type tmpfs (rw,noexec,nosuid,nodev,size=5242880) none on /run/shm type tmpfs (rw,nosuid,nodev) none on /run/user type tmpfs (rw,noexec,nosuid,nodev,size=104857600,mode=0755) /dev/sda6 on /media/Data type fuseblk (rw,nosuid,nodev,allow_other,default_permissions,blksize=4096) binfmt_misc on /proc/sys/fs/binfmt_misc type binfmt_misc (rw,noexec,nosuid,nodev) gvfsd-fuse on /run/user/sidharth/gvfs type fuse.gvfsd-fuse (rw,nosuid,nodev,user=sidharth) /dev/sdb1 on /media/sidharth/passport type fuseblk (rw,nosuid,nodev,allow_other,blksize=4096)


I can't add a GitHub project in Careers 2.0 because I'm "just" an author

I am involved in a project on  that is not mine. Nevertheless, my team added me to the project as author.  On  2.0, I am only able to add project I created (so within my "namespace"), or project of other I forked.  I don't know how far you track users and their project, but I think it could be fair to be able to link on a team project where the user is the author but not the owner.