I wants to use the application GAP. Please help me, how should I start and from where? I need this to compute some specific structures. Thanks for help!


How to add a comma in between thousands, and how do add a $ sign when making a table in python

We are creating a spreadsheet type table that holds values from user inputs. I need to have it so commas are added automatically. EX: 120220 needs to be 120,220 and I need a $ infront, so the final product would be $120,200  I have tried adding the money sign just infront naturally but it didn't work  print("1st Quarter Sales")  print("{:<20s}{:<20s}{:<20s}" .format("ITEM" , "QUANTITY" , "TOTAL SALES COST"))  print("{:<20s}{:<20d}{:<20d}" .format(desktop , desktop_1q , q1_desktop))  print("{:<20s}{:<20d}{:<20d}" .format(laptop, laptop_1q, q1_laptop))  print("{:<20s}{:<20d}{:<20d}" .format(printer, printer_1q, q1_printer))  print("Total Sales: $" , q1_total , sep="")     This is just the printed version, above are the inputs and then taking those inputs and multiplying them to get subtotals and stuff. "desktop" is just a string that says DESKTOP same with laptop and printer. desktop_1q printer_1q and laptop_1q is the quantity sold and for the q1_'S are the total sales so just cost of that product * quantity.   Final result with added commas and $ should look like $1,320,500


I am newbie in C++ 11. I found this term of explicit constructor. However I did not find any good explanation on explicit constructor. Can you please explain in what scenario I should use explicit constructor?  Thank you in advance.


Is a terminal emulator process a server?

Is a temrinal emulator process a server?  If yes, what is its client(s)? How can I find out its client(s)? Thanks.   netstat output contains lxterminal processes. Does that mean that a terminal emulator process is a server based on unix domain socket?  $ sudo netstat -ap | grep -i lxterminal [sudo] password for t:  unix  2      [ ACC ]     STREAM     LISTENING     28665    1480/lxterminal      /run/user/1000/.lxterminal-socket-:0 unix  3      [ ]         STREAM     CONNECTED     28663    1480/lxterminal       unix  3      [ ]         STREAM     CONNECTED     28661    1480/lxterminal       unix  3      [ ]         STREAM     CONNECTED     28666    1480/lxterminal  A server is always (or usually?) a daemon, so it doesn't have a controlling terminal. lxterminal doesn't have one (?):  $ ps aux | grep -i lxterminal t         1480  0.1  0.3 473204 28232 ?        Sl   Nov21  22:39 lxterminal


How do I make a missile that lands with the nose facing down in BGE?

I'm having a tough time believing this question hasn't been asked before, but I haven't been able to find the answer I'm looking for.   So, I have a mortar style missile launcher in my game that adds an animated explosion ring wherever it hits, and it is oriented in relation to the nose of the missile. The only problem is that it rarely makes contact with a surface the way I want it to. Is there any way to make the nose of the missile always point in the direction it is travelling? I think this will solve the problem.  Pythons scripts are OK, but I'm sure there must be a way to do this from the properties already in Blender. Any answers or suggestions are highly appreciated. Thanks in advance!


Mounting a Samsung NX -compatible lens to a different camera

I currently have a Samsung NX3000 camera and a pretty decent macro lens for it. The problem is, I intend to upgrade my camera some day, but it would have to be a camera of a different brand as Samsung doesn't make NX cameras any more. However, I don't want to get a new macro lens as the current one was quite expensive. Is there any adapter / other way that I could mount my current lens on a camera of a different brand? Auto focus functionality isn't strictly necessary.


LWC - Calling Javascript method from static resource 3rd party JS file

I have following JS file uploaded as static resource in Salesforce.  Static resource utility.zip / utility.js file   var x = function (a, b) {return a * b};   I would like to call function variable from static resource JS file from LWC component.      import { loadScript, loadStyle } from 'lightning/platformResourceLoader';     import utility from '@salesforce/resourceUrl/utility';      export default class lwccomponent extends LightningElement {       renderedCallback() {          Promise.all([             loadScript(this, utilities + '/utility.js')         ])             .then(() => {                 alert('loaded');                 /* how can i call method / function variable from JS file , i am unable to do it. */             })             .catch(error => {                 this.dispatchEvent(                     new ShowToastEvent({                         title: 'Error loading JS file',                         message: error.message,                         variant: 'error'                     })                 );             });      } }   my objective is to create a common set of functions to share among components/ project to have to prevent any data issues.


I have a dell poweredge r210 ii with two hard drives connected as RAID1 with PERC. This server got some hardware issues which preventing from booting and now I want to access the data of these mirrored hard drives. Any solution you know? I have HP workstation z600 and z800, can I use them for these hard drives?


How do I add an external JavaScript file using a custom module?

I am trying to add an external JavaScript file to my site using hook_preprocess_page().  In Drupal 7, I used drupal_add_js().  function mymodule_preprocess_page(&$vars) {   $uuid = trim(variable_get('variable_id', ''));   drupal_add_js('//cdn.cookielaw.org/consent/'.$uuid.'.js', array(     'type' => 'external',     'scope' => 'header',     'group' => JS_THEME,     'every_page' => TRUE,     'weight' => -1,   )); }   What function/method should I use in Drupal 8?


How can I show that $\sum \limits_{n=2}^\infty\frac{1}{n\ln n}$ is divergent without using the integral test?  I tried using the comparison test but I could not come up with an inequality that helps me show the divergence of a series. I also tried using the limit comparison test but I was not successful.  Please do not give me solutions; just a hint so that I can figure it out myself.


Let $x,y,z$ be pairwise coprime integers and $r$ an arbitrary integer $(rxyz\neq 0)$. It is evident that there exist relatively prime integers $a,b$ such that  $$rz=ax+by$$ However, how does one prove that $a,b$ exist? I know Bézout coefficients can do the tricks but there are not necessarily coprime. Please let me know. Thanks.


Explicit bijection from $(0;1)$ to $[0;1]$

I am looking for an explicit bijection $f: (0, 1) \to [0, 1]$. As $f:x \mapsto \frac{1}{x}-2$ is an explicit bijection $ (0, 1) \to (-1, \infty)$, a bijection $(0, 1) \to [0,1] \subset (-1, \infty)$ surely (?) does exist. Of course, the mapping I am searching cannot be continous with respect to the canonical topology, as $(0,1)$ is open and $[0,1]$ is not. But can such a bijective mapping $f: (0, 1) \to [0, 1]$ be explicitly given?


Does a differentiable everywhere function have a continuous derivative?

If a function $f$ defined on $[a,b]$ and differentiable everywhere, does it mean that its derivative $f'(x)$ is continuous everywhere on $[a,b]$?  My understanding is 'yes'. Because if there were 'a gap' in $f'(x)$, we could integrate back to $f(x)$ and show that where the gap is, there would be a sharp "angle" where $f(x)$ is not differentiable.


Should I use the past tense with did? For example, I was to say:     The important question is: Did they knew what it means or not?   Or should I say:     The important question is: Did they know what it means or not?   In other words: Should I use past tense with did?  I looked at this:    but it didn't really answer my question.


Is there any way I can tell if my Ubuntu has a key logger/screen logger installed?

How can I tell if my Ubuntu is hacked or been compromised? I'm starting to think it is because I keep overhearing my neighbors talked about something I just posted on a site. They've said many details that matches what I just wrote and I was weirded out. Next, my sister came to me saying something about how I should stop something and that she was worried. She wasn't at home when I used my laptop. I even locked the door so no one can take a peek at what I'm doing.  Is there any way I could see signs of hacking or snooping on my laptop? Like typing a few commands on a terminal but more revealing, for a lack of better word? I only know dmesg, who and last/lastlog and would wish for more commands or packages that would help me know what happened here?   I have read about key loggers, but not screen loggers, is there any information about this?


change the default tile size in Sharepoint 2013

Hello,   I create an app using the Promoted Links in Sharepoint 2013. I chose to do this because the feature has the awesome hover effect and is easy to customize the image.  The issue is that I have been trying to figure out how to change the tile sizes. They are awesome the way they are, however I just need them smaller. I still want the hover effect as well and for the text to match the same ratio as the tile. I have tried web zones, I have done each ID but with no luck. I have attached a sample image of the tiles I'm referring to. Please help.


Proof of $k {n\choose k} = n {n-1 \choose k-1}$ using direct proof

I've seen many posts regarding a combinatorial proof of the following question. But for a non-combinatorial proof would the following method work? Also... is this the easiest way to arrive at a proof? It seems to be rather verbose.  Show the formula $k {n\choose k} = n {n-1 \choose k-1}$ is true for all integers $n,k$ with $0\le k \le n$.  My answer:  Observe that  $$\begin{align*} {n\choose k}&= \frac {n}{k} {n-1 \choose k-1}\\ &= \frac {n}{k}\left[ {n-2 \choose k-2} + {n-2 \choose k-1}\right]\\ &= \frac {n}{k}\left[ \frac{(n-2)!}{(k-2)!(n-2-(k-2))!} + \frac {(n-2)!}{(k-1)!(n-2-(k-1))!}\right]\\ &= \frac {n}{k}\left[ \frac{(n-2)!}{(k-2)!(n-k)!} + \frac {(n-2)!}{(k-1)!(n-k-1)!}\right]\\ &= \frac{(n-1)!}{(k-1)!(n-k)!} + \frac {(n-1)!}{(k)!(n-k-1)!}\\ &= \frac{(n-1)!}{(k-1)!(n-1-(k-1))!} + \frac {(n-1)!}{(k)!(n-1-k)!}\\ &={n-1 \choose k-1} + {n-1 \choose k}={n \choose k}. \end{align*}$$


Cardinality of power set of reals is equal to cardinality of all functions from reals to reals?

I want to prove that $P(\mathbb{R}) = \mathbb{R}^\mathbb{R} $ ?!  I know that $ \mathbb{R} = \{0,1\}^ \omega = P(\omega)$  Also that $(A^B)^ C =  A^{B \times C}$  And that $A = B$ imply that $P(A) = P(B)$   Here $P$ is the power set and $=$ means that they have the same cardinality  And $A,B,C$ are sets.


I was recording by hypercam when my computer closed, I dont know how to play this UNDF file

I was recording with a hypercam, then my computer closed (empty battery), the file is over 2 GB. Is there no way to get back anything of this file? I know there is no media player to play UNDF, but is there really nothing left of the whole file? Its very important so i really hope someone can help me out here!


What are all the possible $α$- and $ω$-limit sets of points for the linear system of equations $x'=Ax$ given by the following matrices $A$:  I guess I don't really know how to get started, Could I have some guidance? So I was told to calculate the eigenvalues (fine) and eigenvectors (I kind of forgot how to do that...)   $    A=   \left[ {\begin{array}{cc}    -4 & -2 \\    3 & 11 \\   \end{array} } \right] $   $λ_1=-10$ $λ_2=-5$  for $λ_1=-10$:  eigenvector $    =   \left[ {\begin{array}{cc}   1 \\    3 \\   \end{array} } \right] $  for $λ_2=-5$:  eigenvector $    =   \left[ {\begin{array}{cc}   2 \\    1 \\   \end{array} } \right] $   $    A=   \left[ {\begin{array}{cc}    1 & 1 \\    3 & 1 \\   \end{array} } \right] $   $λ_1=4$ $λ_2=-2$  for $λ_1=4$:  eigenvector $    =   \left[ {\begin{array}{cc}   1 \\    1 \\   \end{array} } \right] $  for $λ_2=-2$:  eigenvector $    =   \left[ {\begin{array}{cc}   -1 \\    1 \\   \end{array} } \right] $   $    A=   \left[ {\begin{array}{cc}    4 & 5 \\    -5 & -2 \\   \end{array} } \right] $   $λ_1=1+4i$ $λ_2=1-4i$  for $λ_1=1+4i$:  eigenvector $    =   \left[ {\begin{array}{cc}   -3/5-(4i)/5 \\    1 \\   \end{array} } \right] $  for $λ_1=1-4i$:  eigenvector $    =   \left[ {\begin{array}{cc}   -3/5+(4i)/5 \\    1 \\   \end{array} } \right]$


Find all functions $f$ such that $f\left(x^2-y^2\right)=(x-y)\big(f(x)+f(y)\big)$.

Find all functions $f:\mathbb R\to\mathbb R$ such that $$f\left(x^2-y^2\right)=(x-y)\big(f(x)+f(y)\big)\text.$$  I have derived these clues:  $f(0)=0$; $f(x^2)=xf(x)$; $f(x)=-f(-x)$.  But now I am confused. I know solution will be $f(x)=x$, but I don't know how to prove this.


I got an email from from the UK embassy in Abu Dhabi, saying your visa application has been concluded.  But they did not contact my sponsor. Does this mean they did not grant my visa but refused it?


How to arrange $e^3,3^e,e^{\pi},\pi^e,3^{\pi},\pi^3$ in the increasing order?

For these six numbers, $e^3,3^e,e^{\pi},\pi^e,3^{\pi},\pi^3$, how to arrange them in the increasing order?  This problem is taken from the today test:   I think we can consider $$f(x)=\dfrac{\ln{x}}{x}$$  or perhaps other methods, so I am looking forward to seeing other methods to solve this problem. Thank you.


Let $X$ be a Hausdorff space. Then for all $x \in X$, the set $\{x\}$ is closed. Moreover, every finite subset of $X$ is closed.

Let $X$ be a Hausdorff space. Then $\forall x \in X$, the set $\lbrace x\rbrace$ is closed. Moreover, every finite subset of $X$ is closed.   I am having a hard time doing this one, can someone help me on this? How should I proceed?  Any help will be greatly appreciated!!


I have read something like 6 articles on Markov Chain Monte carlo methods, there are a couple of basic points I can't seem to wrap my head around.   How can you "draw samples from the posterior distribution" without first knowing the properties of said distribution? Again, how can you determine which parameter estimate "fits your data better" without first knowing your posterior distribution? If you already know the properties of your posterior distribution (as is indicated by 1) and 2)), then what's the point of using this method in the first place?    This just seems like circular reasoning to me.


Eliminate rules regarding question types.  Asking for advice or opinion is sometimes the most valuable information one can receive - especially if a person is about to go down a long path that ultimately could be a Dead End.  I am wrestling with a sea change in some research I'm doing and it is impossible for me to choose a path because I am not experienced in many of them.  Only by asking experienced people, can I choose a path meaningfully.  However these kinds of questions are not allowed(!)   You risk becoming the "about.com" of the scientific community - a dubious honor at best.


Prob. 2.10 in Bourne & Kendall: These four points lie on a circle

Here is Prob. 2.10 in the book Vector Analysis and Cartesian Tensors by D. E. Bourne and P. C. Kendall, 3rd edition:  Show that the four points with position vectors $$ \mathbf{r}_1, \mathbf{r}_2, \frac{r_2}{r_1} \mathbf{r}_1, \frac{r_1}{r_2} \mathbf{r}_2, $$ where $\mathbf{r}_1 \neq \mathbf{0}$ and $\mathbf{r}_2 \neq \mathbf{0}$, lie on a circle.  My Attempt:  Relative to a rectangular cartesian coordinate system $Oxyz$, let $\mathbf{r}_1 = \left( a_1, b_1, c_1 \right)$ and $\mathbf{r}_2 = \left( a_2, b_2, c_2 \right)$, where $$ a_1^2 + b_1^2 + c_1^2 > 0 \qquad \mbox{ and } \qquad a_2^2 + b_2^2 + c_2^2 > 0, $$ and as $\mathbf{r}_1, \mathbf{r}_2, \frac{r_2}{r_1} \mathbf{r}_1, \frac{r_1}{r_2} \mathbf{r}_2$ constitute four points on the circle, so we must also have $$ a_1^2 + b_1^2 + c_1^2  \neq a_2^2 + b_2^2 + c_2^2. $$ As a circle is a plane figure, so we can also assume without any loss of generality that both $\mathbf{r}_1$ and $\mathbf{r}_2$ lie in the $xy$-plane so that $c_1 = c_2 = 0$. Therefore we obtain $$ a_1^2+ b_1^2 > 0 \qquad \mbox{ and } \qquad a_2^2 + b_2^2 > 0, $$ and also $$ a_1^2+ b_1^2 \neq a_2^2 + b_2^2.  $$   Let $x^2 + y^2 + 2gx + 2fy + c = 0$, $z = 0$ be the required circle. Then substituting the coordinates of the heads of the four vectors we obtain $$ \begin{align} 2a_1 g + 2 b_1 f + c &= - \left( a_1^2+ b_1^2 \right), \\ 2a_2 g + 2 b_2 f + c &= - \left( a_2^2+ b_2^2 \right), \\ 2 \sqrt{ a_2^2+ b_2^2} a_1 g + 2 \sqrt{ a_2^2+ b_2^2} b_1 f + c &= a_2^2 + b_2^2, \\ 2 \sqrt{ a_1^2 + b_1^2 } a_2 g + 2 \sqrt{ a_1^2 + b_1^2} b_2 f + c &= a_1^2 + b_1^2.  \end{align} $$  Is what I have done so far correct? If so, then what next? How to proceed from here? Or, is there a more direct solution?


The expectation of $\frac{1}{1+X}$ where $X$ is Geometric($p$)

Let $X$ be Geometric($p$). As an exercise from the book Probability Essentials, 2nd edition (Jacod, J., Protter, P., 2004, p.34), I have to compute $E[1/(1+X)]$. The answer is $\log((1-p)^{\frac{p}{1-p}})$ but I kept getting $\log(p^{\frac{p}{1-p}})$ or $\log(p^{-\frac{p}{1-p}})$. I don't see the mistake in my own calculation. One of my calculation can be seen below: $$ $$ We have \begin{align*} E\left[\frac{1}{1+X}\right] &= \sum_{j=0}^{\infty}\frac{1}{1+j}(1-p)^jp\\ &= p\sum_{j=0}^{\infty}\frac{1}{1+j}(1 - p)^j\\ &= \frac{p}{1-p}\sum_{j=0}^{\infty}\frac{1}{1+j}(1-p)^{j+1}\\ &= \frac{p}{1-p}\sum_{j=0}^{\infty}\int_0^{1 - p} t^j \ dt \end{align*} The infinite series $\sum_{j=0}^{\infty}t^j$ converges uniformly to $\frac{1}{1-t}$ since $|t| < 1$, so we can interchange the integral sign and the sum sign $$\frac{p}{1-p}\sum_{j=0}^{\infty}\int_0^{1 - p} t^j \ dt = \frac{p}{1-p}\int_0^{1-p}\sum_{j=0}^{\infty}t^j dt = \frac{p}{1-p}\int_0^{1-p}\frac{1}{1-t}\ dt.$$ This is equal to $$-\frac{p}{1-p}\log(p) = \log(p^{-\frac{p}{1-p}}).$$  So my questions are: could you please point out the mistake? and what should I do so I get the correct answer. Or maybe it is a mistake from the book?  Edit. This is the definition of the Geometric distribution that is used in Probability Essential: $X$ has a Geometric distribution with parameter $1 - p$: $$P(X = k) = (1-p)^kp, \ \ \ \ \ \ k = 0, 1, 2, 3, \dotsc$$


Transit visa to UAE for Costa Rican citizen

I am a Costa Rican citizen living in Costa Rica.  I am looking at visiting Kenya, and my best option seems to fly to Dubai on a larger airline, then get a smaller airline from Dubai to Kenya.  Let's say I arrive at Dubai December 1st, and my return ticket is December 31st. I also have tickets from Dubai to Kenya for December 2nd and back to Dubai on December 28th.  From what I understand, there's a 96-hour transit visa that lets you stay 4 days or less. Is this true? What are the requirements, where and how is it requested, how much does it cost and can a Costa Rican citizen get it?  Would this allow me to arrive back in Dubai a few days before my outbound flight and visit Dubai?  Edit: A lot of information online and other StackExchange questions are about US or EU citizens. I haven't found information specifically about Costa Rican citizens.


Dual boot Windows 8 on already installed Ubuntu

I had three drives on my computer: C: D: E:  I installed Ubuntu 12.04 on the E: partition and now I'm using Grub boot manager to boot into Windows 7 and Ubuntu  I'm planning to install Windows 8 by removing Windows 7 on C:, but I don't want my old Ubuntu Installation to suffer.  Is there are way that after Windows 8 removes Grub from C: that I'm able to boot to Ubuntu again.


Does $F$ is an isomorphism $\implies F^{-1}$ is an isomorphism?  Let $\mathfrak{D, E} $ be some algebraic structures of the same 'kind' (say, groups, graphs, fields, vector spaces, etc.), and $F:\mathfrak D \to \mathfrak E$ is an isomorphism, is there any way to prove that $F^{-1}:\mathfrak E \to \mathfrak D$ is an isomorphism?  By isomorphism I mean a bijection that preserves whatever structure $\mathfrak D$ and $\mathfrak E$ have, clearly $F^{-1}$ is a bijection, so the important part is if it is a structure preserving map.


When should you decide whether to flag a posted answer as Not an answer?

I've run into this situation a couple of times, where people give an "answer" that basically repeats the problem in the original question. (Not going to give examples here obviously, but it's happened.) So a hypothetical example might be a question like:     I've noticed that addition overflows just get wrapped around in x86. Why?   and a hypothetical non-answer might be something like:     x86 naturally wraps around addition overflows in numbers, just like MIPS and other architectures. You need to be careful when performing arithmetic; check the carry/overflow flags to see if something overflowed.   On the one hand, this doesn't answer the question. But on the other hand, it's well-written (no specific quality issues), and it seems to answer the question.  Should an answer like this be flagged? (Sometimes commenting doesn't help, since there's just no response.)


How can I use TLS on a local apache development server (on localhost)

I am trying to set up a development environment that mirrors my live server, but behind the firewall.    Until fairly recently my shared hosting site didn't offer TLS/SSL so it wasn't an issue/option, but now that encryption is the norm I need to reconfigure my development environment.  In the past, I had a Ubuntu server running in a container on my workstation  (configured with Webmin) with the same domain name (ex: example.com) and directory structure as the live server. I put an entry for example.com in my /etc/hosts file so that my web browser would hit the local server instead of the live server.  This allowed me to perfectly stage my WordPress site and then deploy to the live server with simple copy operations and not have to use "migration plugins" which not only cost money, but may also introduce errors.  My problem is that now I need to correctly mimic the operation of TLS (locally) to be able to run/test my WordPress sites.    The "live" site example.com uses a "Let's Encrypt" wildcard certificate, (so I can't use Let's Encrypt in any way without messgin the live site up) but for the development it would be quite acceptable to have a self-signed certificate of some kind as long as it's good enough that I can "add exception" to the browser.  I don't need to allow anyone outside the firewall to visit the development/staging site -  the site only needs to be able to "call out" to pick up updates to plugins and themes.  All the examples I have seen either describe setting up Let's Encrypt or setup as localhost, but nothing on "spoofing" a server.  Is this possible?


Where are ALL locations of Start Menu folders in Windows 10?

I am trying to fix start menu damage after windows 10 install.  Currently, I removed all files from known locations of start menu files, but still have some entries in Start Menu.  Here is the proof folders are empty:    And here is the proof that I still have some entries in Main Menu:    What are all locations of Start Menu folders in Windows 10?


Siunitx - Scientific notation and uncertainties in a S-column

When using a S-column (of the package siunitx) in a table, the numbers are not properly typed when using both engineering (or scientific) notation and uncertainties. However, using the \num command (of the same package) the number is well typed. Is there an option to put in the S-column to correct this problem? I’ve read the documentation, but I don’t think I’ve found anything like it.  \documentclass[12pt]{article} \usepackage{booktabs, siunitx} \parindent=0em \sisetup{separate-uncertainty = true}  \begin{document} \num{91.4(7) e-3}  \begin{tabular}{S[table-format = +2.1(1)e+2]} \toprule 72.3e-3 \\ 91.4(7)e-3 \\ % Should be typeset like "\num{91.4(7) e-3}" -88.8 \\ 4.5 \\ \bottomrule \end{tabular} \end{document}


Web sites can contain JPEG, GIF,PNG, SVG format graphics. Which ones should be used, and when?


Determining message given cipher-text and public key

Consider the following scenario:     Suppose A and B have set up their RSA public keys, namely $(e_a, n)$   and $(e_b, n)$, where the n-value is the same. Also, it happens that   the $\gcd (e_a, e_b) = 1$. Suppose C wants to send both A and B a   message $M$ that is coprime with $n$. Thus, C encrypts $M$ using A and   B's public keys, producing the cipher text, $C_a$ and $C_b$.   I was told by my instructor, that suppose if there is someone who obtains the values of both $C_a$ and $C_b$, that particular person can determine the message $M$ using the public keys of $A$ and $B$, without knowing their private keys. Why is it necessarily true? Any help would be highly appreciated!


My laptop has a built-in hard disk (HGST 500GB). I want to use SSD as boot/C: drive. I mainly use windows 8.1 (I may need to install ubuntu alongside it). My laptop model is HP Pavillion n004tx.   Is it possible to install SSD on caddy(CD drive replacement) and use it as C drive? Which would be more efficient SSD in place of my existing Hard Drive or SSD in the caddy(CD drive replacement)?


"which chapter of that book" vs. "what chapter of that book"

Imagine that, an answer cites a part from a book without telling the chapter.  Should I ask     "which chapter of that book"?   or     "what chapter of that book"?   I tried Google Ngram and got no hit.  Google search  and .  Could someone please give a hint? Thanks in advance.


Can I charge and discharge a NiCd/NiMh battery at the same time?

I presume there will be opposite movements of the charged particles inside, with collision energy being exhaust as heat.   On the other hand, such a setup would probably introduce an extra noise/voltage fluctuation immunity, would also greatly simplify the circuit layout, would enable short-term high current anytime (i.e. motors, stroboscopes etc.).  Can I simultaneously charge & discharge the battery? Might it cause any harm to it?


Scaling Absolute Value brackets in multiline equation

I am having trouble getting the correct scaling of my absolute value brackets.  The MWE looks like this   \newcommand{\abs}[1]{\left| #1 \right|} \begin{align*}  &\abs{x y} \cr  \abs{&x y} \cr  \abs{&x \cr &y} \end{align*}   The output produced gives me correct brackets in the first case |xy| but all other cases only show the first (correctly scaled) bracket but not the second one, i.e. |xy .  What would be the correct way to go about this?


How do I expose a variable to html.html.twig?

I want to add different css styles to my edit/create pages. The easiest way I can think to do that would be to add 'edit/create' classes to the body tag when the node is being edited or created by adding them to html.html.twig. hook_node_access() has the variable $op which defines the current operation, so the question is how do I expose that variable to my html.html.twig template so I can add the classes only when update/create?


Resize root partition to unallocated space before

I need more space on my root partition running Ubuntu 17 (using Xfce session). I do have a lot of unallocated space BEFORE. However, when I try to resize root partition - /dev/sdb2 , I can't add/remove a MiB...  Is this even possible?   If so, can it somehow be done from the live system or do I have to use live CD/USB?    There is really just Ubuntu and Xcfe session, LUBUNTU_SYSTEM is just an old label :)


prove that $a \equiv b \mod m$ is an equivalence relation on the integers  I believe there are 3 properties that it must meet to prove and equivalence relationship. Any reference material would be greatly appreciated


Finding the length of a finite cover of a set of rationals

I am trying to solve the following question: Let $A$ be the set of rational numbers in $[0,1]$ and let $\{I_n\}$ be a finite collection of open intervals covering A. Show that $\sum l(I_n) \geq 1$ I'm not really sure what the question is getting at. I feel like it has to do something with the density of the rationals in Q making it impossible for the $I_n$s to be disjoint, but I don't know how to get there


Dystopian world split in half: rich and poor

I am trying to remember a book I read years ago probably in the early 2000's, but I don't know how old the book is. But I do remember the basic plot.  The world, or at least the country it is set in, is split in half. One half is a dystopian poorer world where crime rates are high and blood sports are the most popular form of entertainment. Libraries are all but abandoned. The protagonist lives in this half; he likes to read and longs to escape to the other half of the world/city.  The world is split by a giant wall which I believe he tunnels under to get to the better half of the world, which is more like the countryside, rather than the city he has come from. Everyone is well educated and seems perfect. The protagonist gets to live with a wealthy family; the father takes him under his wing and teaches him about how to make bonsai trees. From this he finds out this father figure was once a rebel trying to let city people into their half, but bad behavior results in a partial lobotomy to make them calm.   When the protagonist finds this out he tries to escape back to the city half of the world.  For the life of me I cannot remember the books name. I've tried a Google search and get results like Nineteen Eighty-Four, which I expect the book I'm looking for took influence from.


Is there a splitter for the Thunderbolt on my MacBook Air?

My Macbook Air has only one Thunderbolt port, but I need to connect both to my internet cable and also to my VGA monitor. I have an adapter to do each, but obviously I can use only one at a time. What do I need to buy to be able to connect both the cable & the monitor?


What is the difference between a kibibyte, a kilobit, and a kilobyte?

got me wondering about the differences between these three ways of measuring size: a kibibyte, a kilobit, and the conventional kilobyte.  I understand that these measurements have different uses (data transfer rate is measured in bits/sec), but I'm not quite sure if I can tell the difference between Mb and MB and MiB.  Here is a comment, reproduced below, taken from  (emphasis mine).     The C64 has 65536 bytes of RAM. By   convention, memory size is specified   in kibiBytes, data transfer rates in   kilobits, and mass storage in   whatever-the-manufacturers-think-of-now-Bytes. Harddrives use T, G, M and k on the   label, Windows reports the size in Ti,   Gi, Mi and ki. And those 1.44MB   floppys? Those are neither 1.44MB nor   1.44MiB, they are 1.44 kilokibibytes. That's 1440kiB or 1'474'560 bytes. –   Third


/oracle/GR1/121/bin/sqlplus / as sysdba <<EOF >> $LOGFILE whenever sqlerror exit sql.sqlcode; set echo on; set serveroutput on; STARTUP; EXIT EOF   Already tried it with the path, but it hasn't worked.


How does one manually throw a "overflow exception" in C++?

I am rather new to exceptions. In a part of my program if a specific variable goes beyond a certain value I want to manually throw an exception which will say that the variable has gone outside of accepted range. The variable being 16 bits can still hold the "invalid" values but under normal program operation it will only hold a subset of the possible values it can hold.  How do I generate this specific type of exception?


character encoding issue when using Invoke-Sqlcmd

We use a powershell script to download sql scripts from SVN and apply them to our databases. It works fine except when it comes to Unicode characters. For instance the script contains an insert for 'Saint Barthélemy' and when inserted through the powershell it will end up being 'Saint Barth?lemy'. If the same script is executed through SSMS the value will be inserted correctly. I use following Powershell code: Import-Module -Name SqlServer Invoke-Sqlcmd -ServerInstance $SQLServer -Database $defaultDatabase -InputFile "$tempFolder\$fileName" -AbortOnError -OutputSqlErrors $true -IncludeSqlUserErrors -verbose  Is there any setting that might impact the character translations? This happens with SQL Server 2016


Gmail "suspicious sign-in prevented" message - is it legit?

I got 3 mails from Gmail today; one each for my 3 seperate Gmail accounts, saying someone from this IP: 109.200.4.130 tried to log-in and it was prevented, and that I should reset my password by following the given link if I don't recognize the address.   Is it real or is it phishing? Is this because I signed into one of Gmail accounts with a VPN? But then again why would I get notices for the other two?


Can we clarify to the OP that their question is not yet closed and the duplicates are only suggestions?

I keep seeing custom flags in the queue from question askers who are incredibly irritated because there is a big, prominent box at the top of their question. It's just a list of other questions which may have the answer they desire, and is only even displayed to them because the question is not closed yet.  This question may already have an answer here: [list]  But to an ordinary user, it is not at all clear that the box is only shown to them, or that it will go away on its own if their question never actually gets closed. Could the text for this notice be altered to make it more clear that:  They are just suggestions for the person to view. Potentially if they agree with one, they should vote to close their own question as a duplicate of it.  Their question is not closed yet. If they disagree with the duplicates suggested, they should clarify their question and explain why it's not a duplicate.   I was thinking of an altered wording such as:  You might be able to find an answer to your question here: [list] If those answers do not fully address your question, please [edit your question] to clarify your exact problem.  I went with a more direct wording for the bolded title. Since the notice is only displayed to the asker, it makes more sense to talk directly to them in the message rather than making it feel like it's supposed to be addressing the entire audience of the site. Emphasize that only that person is seeing it by talking to them. It would also be helpful to append a "More info" link at the end of the message that links them to some further documentation about duplicates, and explains how the notice works - particularly that it will go away eventually or change to a proper duplicate notice if the question does get closed.


Is there a function which, composed with itself, will output $e^x$?

This question has been bothering me for some time, but I have absolutely no idea how to even try to answer this question. For some more context, the function should take in real values as inputs, and give real values as outputs.


IndentationError: unindent does not match any outer indentation level even though my indentation is correct

What I am trying to do I have a simple function for string input validation. Code: def get_string_input(prompt):     while True:         try:             value = str(input(prompt))         except ValueError:             time.sleep(0.3)             print("Incorrect command. Please try again")             continue          if type(value) != str:             time.sleep(0.3)             print("Incorrect command. Please try again")             continue         else:             break     return value  # Test  get_string_input('What is your name? ')   Problem: When I run the program, I recieve the following error:  I can see that my indentation is correct, so why is it giving me an error?


How do I find the length of list in generator. (Python)

I have this generator which returns a list of numbers.  li=tile_generator(im)   I need to find the length of the list "li" as I need to check for a threshold value. I used length = sum(1 for i in li). It is returning the length of the list but the elements in the generator are exhausted as it is a generator. I need to return the length without exhausting the elements in the generator.


How do I detect a click outside an element?

I have some HTML menus, which I show completely when a user clicks on the head of these menus. I would like to hide these elements when the user clicks outside the menus' area.  Is something like this possible with jQuery?  $("#menuscontainer").clickOutsideThisElement(function() {     // Hide the menus });


Convergence of random variables in probability but not almost surely.

Can somebody provide me with a sequence of (real-valued) functions, say on $[0,1]$ with the Lebesgue measure, such that the sequence converges in probability, or maybe in $\Vert \cdot \Vert _{L^2}$, but does not converge almost surely?


Naming table when writing layer to geopackage using PyQGIS

I can create a new geopackage and write a tmp layer to it using code below: #Create a layer lyr = processing.run("native:randompointsinextent", {'EXTENT':'376242.90699403384,385761.27711294894,6245699.079987993,6249398.011089481 [EPSG:3006]','POINTS_NUMBER':10,'MIN_DISTANCE':0,'TARGET_CRS':QgsCoordinateReferenceSystem('EPSG:3006'),'MAX_ATTEMPTS':200,'OUTPUT':'TEMPORARY_OUTPUT'})['OUTPUT']  newgpkg = r'C:\GIS\data\testdata\newgpkg.gpkg' options = QgsVectorFileWriter.SaveVectorOptions() options.driverName = "gpkg"  QgsVectorFileWriter.writeAsVectorFormatV2(lyr, newgpkg, QgsCoordinateTransformContext(), options)  But how can I name the table? Here both the geopackage and the layer is named newgpkg. (This is just a workaround to create a new geopackage and table using code. So if there is another way of doing that, please let me know)


How can I solve the following second order differential equation   $$ \frac{d^2\theta \:}{dt^2\:}\:=-\frac{g\theta \:\:}{L} $$ with initial conditions $$θ(0) = θ_0 , v(0) = v_0  $$  I know that I can rewrite the equation as  $$ \frac{d^2\theta \:}{dt^2\:}\:+\frac{g\theta \:\:}{L} = 0 $$    , find characteristic polynomial and solve the equation. I am just confused on how to solve this problem because of all the constants.  Thanks for help in advance


The fastest way to toggle VPN connection for Windows 7 or later?

When I connect to my company VPN, I cannot browse internet normally i.e. even open google.com  So I need to turn on and off that VPN connection very often and currently I have to go to the connection page and toggle it.  What is the fastest way to do this? I hope to have a toggle button or shortcut so that I can toggle VPN connection - similar feature for using proxy server is


Let $x$ and $y$ be two non-zero $n\times 1$ vectors. What are the eigenvalues of the $n\times n$ matrix $xy^T$?  I have one more doubt in the same question  here $x$ be a $n\times 1$ matrix so how many eigenvalues it has??  I tried in many ways but I stuck from the starting point also??


Minimum number of sub groups so that each element is grouped with every other element at least once

Say we have a group containing 4 items $[A, B, C, D]$ and we allow sub-groups of size 2, then 6 sub-groups are needed to ensure every element is grouped with every other element at least once. $[A,B] [A,C] [A,D] [B,C] [B,D] [C,D]$ or 3 if we allow sub-groups size 3 $[A,B,C] [A,B,D] [B,C,D]$ Expanding this to 8 elements and sub-groups size 4, 6 sub-groups are also required. It also appears that if you have $n$ elements and a sub-group size $m$ which require $x$ sub-groups to ensure element grouping, then $kn$ elements with sub-group size $km$ also requires $x$ sub-groups. So possibly only prime numbers for $n$ or $m$ have unique values of $x$. I tried initially looking at binary representations as a way to get all possible arrangements, then counting the instances of Hamming Weight $m$ from $0$ to $2^n$ but the pattern did not hold. I am trying to generalize it so if you have $n$ elements with sub-group size $m$ $\binom{n}{m}$ where $1<m<n$ , $m \in \mathbb{Z}$ , $n \in \mathbb{Z}$ some function $F(n,m) = x$ Is  there a formular to express the minimum number of sub-groups size $m$ so that each element in $n$ is grouped with every other element at least once? I'm having trouble describing elements as having already been grouped mathematically.


Let's say I'm going to buy in the market to hold.  What are the pros and cons of buying MES futures instead of SPY ETFs for exposure to S&P500?  From a high level I know that MES is $5 per point and that SPY is (roughly) $0.10 per point but we can equalize that by equating 50 shares of SPY against one MES contract.  Holding MES would miss out on dividends and there'd be transaction fees of rolling out of each expiring contract into the next.  Assuming one portfolio consists of 1 MES contract which is rolled over into the next expiry when applicable and another holds 50 SPY contracts, which will end up higher at the end of a few years?


How do you use the Weierstrass substitution or do contour integration for this integral?

After trying, I realized that I can't evaluate this using the usual simple integration:   $\int_{0}^{\pi} \frac{d\theta}{(a+cos\theta)^2}, a>1$  I was given the hint that:  $\int_{0}^{\pi} \frac{d\theta}{(a+cos\theta)^2}, a>1 = -\frac{d}{da} \int_{0}^{\pi}  \frac{d\theta}{(a+cos\theta)}$  Although, I have not yet figured out why they are equal. But after that, what do I do next? Possibly contour integration or Weierstrass/tangent half-angle substitution but I'm having difficulty understanding how to do that. Any help to clear this out or teach me how to do it. Any help would be appreciated! Thank you in advance!


I was copying some movies to SD card suddenly my friend fell on to my laptop and SD card got removed from the laptop while copying. Now the SD card is showing is showing only two files in it and it can be accessed. But now the when I format the memory card its still showing the two files. I tried deleting it and it gets deleted but when i plug in the memory card again the files again appear in the memory card. Cannot format it. I have tried deleting the partition and created the new partition but still the SD card is damaged.


See the return value in the return statement - java

There is a statement like this  double pow(double num, int exp){     if(exp < 0)         return (1/power2(num, -exp));     else         return power2(num,exp); }   I want to view the value returned by power2(num,exp) function in the debugger window, without having to store the returned value in an intermediate variable. How is this done?


Is there a way to hide Minecraft's system messages for spawning items?

Whenever I add something to my inventory using commands, Minecraft reports the following in the chat window:     Giving [user name] some [item].   Is there a way to hide this?


The median of a continuous frequency distribution

For number b :  The order of the median is $13$ , then it lies in the first class $0-1$  Now i do not know what is the lower bound of this class ?  Is it $-0.5$ ?


Make the entire bottom div resizeable, rather than just the text box

You can currently only resize the text box in chat. Given that there's only a few pixels below the text box, this resizing doesn't help all that much.    Would it be possible to make the entire bottom div resizeable, rather than just the text box (with the height of the text box dependent on the height of the div)?  (No longer suggesting resizing the textbox itself upwards, as this doesn't appear to be a possibility)


Magnetic field lines depict the strength of the magnetic field, dense lines in a region imply a strong field.    Lines are drawn as per our convenience. We needn't draw infinite lines but just relative amounts: where the field is stronger, more lines; where it isn't,  less lines.      What I wanted to know was what do these lines imply when they are formed in the magnet and iron filings experiment. All this while we find that these lines can be infinite with relative spacings to depict field strength. It seems that these lines are imaginary and only for our convenience. Yet iron filings form them. So what do they imply?     Why do the iron filings follow only specific lines around the magnet? What about the spaces in between two adjacent lines? What are those spaces supposed to be? Why wouldn't the iron filings fill those up as well? Are those spaces supposed to imply absence in field?


Hi I am a beginner to python and I have an exam tomorrow. I do not know how to do this question. I know that I have to use a nested for loop but, I cannot make it work syntactically. Here is the question, I apologize for any formatting errors.  (list of int, int) -> list of (list of int)   Return a list of lists of elements from 1st, where each sublist is the next num elements from 1st.  If the length of 1st is not a multiple of num, the final sublist will have fewer than num elements.   »> make_rows([2. 4, 6, 8, 10, 12],3) #Function call  [[2, 4, 6], [8, 10, 12]] # expected output


is $\operatorname{lcm}(a,\gcd(b,c))=\gcd(\operatorname{lcm}(a,b),\operatorname{lcm}(a,c))$? it should be true for positive integers because the commutative algebra by Atiyah says addition, intersection on the ideals of $\mathbb{Z}$ is distributive. how should i solve it?


Touchpad gestures and holding keys does not work

I am facing very weird problem on which I cannot find solution. One time touchpad gestures stopped working along with keyboard keys holding. Touchpad is moving the cursor but nothing more. When I am holding keyboard keys they appear only once, although in my setting it is set up to repeat keys.  $ uname -r 4.13.0-26-generic


Why is "high" pronounced "hiy" but is not spelled as the latter, but the former?  Wouldn't "high" be read as "heeg-h" or "haig-h"?  The other possible duplicate's examples all have a "t" prefixing, and also, the accepted answer for that question does not address why GH is occasionally pronounced out.  Example's of other words starting with "GH" is Ghillie, or ending with GH as in Edinburgh


Prevent pdflatex from writing a bunch of files

If I create just a basic hello.tex file an compile it using   pdflatex hello.tex   The pdflatex program is creating a plethora of file which is a little annoying. Currently it writes all those files about which I really don't care:  hello.aux, hello.log, hello.nav, hello.out, hello.snm, hello.toc   Is there a way to tell pdflatex to only write hello.pdf if the build is successful ? If not, can I specify the output directory of those files ? Maybe I could just write them in /tmp.


Troubleshooting XCode 12.4 Installation (MacBook Pro, Big Sur 11.1)

Although I have in excess of 30Gb free on the Internal Hard Drive, I have been unable to install XCode 12.4. The App Store displays the message "We could not complete the purchase. There is not enough disk space available to install the product." A similar message appears when I try to install XCode 10.0. Although, in respect to the question "How can this issue be resolved?", helpful answers have been provided (such as the amount of available space on the Hard Drive), is the answer also dependent on Memory?


Are metals more reflective at lower temperatures?

I understand that when metal gets hot it loses its reflective properties, but does that also mean that the colder the metal is the more it reflects?


For the sentence, "I am going on a two month cruise", would "two month" be considered an adjective since it means two months long. Also, is the correct wording "two months" or is "two month" also correct. I have heard it used both ways (months/month).


The world I've been playing crashed recently and took the level.dat with it, so I've recreated it, however I have no idea what my seed used to be, and I really don't want to end up with another corrupted game world from exploring with the wrong seed.  How can I recover the seed which was used to generate my world?


Does spinning the Pokeball/making it sparkle increase the chance of catching Pokemon?

I can hold my finger on Pokeball and I can spin it before throwing it. Making this with a high speed makes the ball to sparkle. Does this throwing style increase the chance of catching any Pokemon?  P.S. I know the bonuses and I know how to throw a curve ball. You can get all types of bonuses without making it spin or spark. I just want to know if spinning or sparkling increases the chance of catching or not.


Why Google does not show complete meta description

I am working on a website, I have done it on-page nearly complete. I am using 160 words description.   In SERP I see meta description half from 160 words and half from website page.


Show that $x^{20}=1$ for all $x\in U(100)$.  In the book that I'm reading, it says "Since $U(100)\thickapprox Z_2\oplus\,Z_{20}$ we see that $x^{20}=1$ for all $x$ in $U(100)$".I think maybe that remark is due to this theorem which states "The order of an element of a direct product of a finite groups is the least common multiple of the orders of the components of the elements". i.e $$|(g_1,g_2,.\,.\,.,g_n)|=lcm(|g_1|,|g_2|,.\,.\,.,|g_n|).$$ We define $U(n)$ to be the set of all positive integers less than $n$ and relatively prime to $n$ with the operation  multiplication modulo $n$


linux + tool that can identify RAID configuration

I am searching for a long time tool that can runs as CLI on linux machine and identify which RAID configuration is defined on the disk or disks ( according to the list from lsblk )  the reason for that we cant showdown ( Production machines ) the linux machine and look on the RAID controler when OS id down   I am just cant understand why it is so difficult to capture the RAID conf when OS is up , must be somewhere tool that identify the RAID configuration


How does compound interest work with stocks?

I just learned about compound interest, and I want to know if I understood it right: You buy a stock, and then you just keep it. And over time, you will just earn interest on your interest. Is that correct? You have to do nothing else than to just buy a stock and wait. Because in the videos I watched, compounding was explained as re-investing your interest, which implies that you have to take an action to re-invest it. But really, all you have to do is just not take the gained interest out, right? Because I mean, if you buy a stock at 100$ and it grows to 110$ and you sell the stock at 110$ just to buy it again at 110$ dollars (as to re-invest your money) you'd be at the same place as if you had just never sold the stock at 110$. Am I correct in my assumptions? Please explain it to me, because I'm confused.   In order to receive compound interest, all I have to do is buy a stock once and then wait, and the compound interest will accumulate automatically, without me having to do anything for it. Is this correct? Thank you for your answer!


What is a gauge (for someone who has not studied gauge theory)?

I am taking a Quantum Mechanics II course and we were studying the relativistic corrections to the hydrogen atoms in perturbation theory. I was looking at the assignment, and a question is as follows:      Consider the non-relativistic Hamiltonian for a charged particle $-e$, in presence of an external, constant and uniform magnetic field $$B=\hat{e}_3B_0$$ in the symmetrical gauge $A=0.5B \times r $   But I don't understand what a Gauge is in this context. If I wish to find the Hamiltonian, what information is that supposed to give me? Could you explain to me what a gauge is for someone who has not had gauge theory, or link me to some basic bibliography to learn it?


Scanning film negatives - Resolution, DPI and file size

I use a Epson V800 scanner to scan my 35mm film negatives.  I've set the resolution on the software (silverfast 8) to 3200dpi and the result was a tif file with 4500x3000px and 15mb.  If i select that image and then go to properties -> details, Windows tells me that the image has a resolution of 360ppi (i assume that is the same of dpi).  If anyone can help me, i have 3 questions,  1 - I've scanning at 3200dpi, why my finale image is only 360dpi/ppi?  2 - At 3200dpi the resolution is 4500x3000px ?  3 - For the resolution of 4500x3000 what is the maximum print size?  Thanks for the help.  Ricardo


Is there a safe way to disable DHCP from command line?

Short version  I know this question is very similar to others and I did really search the Internet for answers, but it seems that no approach is working or the solutions seem to be "to complicated to be best practice" (I'll try to explain). I'm looking for a safe way on how to disable DHCP from command line (to use in scripts).  Background  I'm trying to create a "Live-Cd" with Ubuntu Server 12.04 and remastersys (works well). The system is, by default, configured to get the IP with DHCP while booting.  That's ok - the important thing is that a script (which runs after booting) is able (in some specific cases) to set a static IP using ifconfig (not /etc/network/interfaces ):   ifconfig eth0 192.168.0.1   Actually this is also working, but the IP only persists until the DHCP lease time of the previously obtained lease is over. A new IP will be assigned to eth0, which (in short) breaks the system. I thought "no big deal, there will be surely something like: "     ifconfig eth0 dhcpdisabled   But I ended up recognizing, it doesn't work that easy. Editing the /etc/network/interfaces is a bit tricky, because it is generated by remastersys (actually the 23networking script of casper).   I could rewrite it and restart networking, but what will happen to active dhclient.leases? Will be DHClient still be running in the background (it shouldn't but some posts suggest it will be my tests showed it is restarted “randomly“, if dhclient is killed), do I have to remove or empty dhclient.leases files, what about resolv.conf?  Despair  To sum it up - In my opinion it's not really that "straightforward" and somewhat doesn't "feel stable".  suggested to remove the dhclient package, but: Will this solve the problem? Will this break other stuff?   Is there really no command for this? I hope I just overlooked it.


Both sides differentiation expression with integral

I have a problem with derivation of some function. This is related to computing the Poincare Map of Logistic Population model with Periodic harvesting. This function is:  $\phi(t,x_0) = x_0 + \int_{0}^{t} f(s,\phi(s,x_0)) ds \ (1)$  where $\phi(t,x_0)$ is a function: $\mathbb{R}  \times \mathbb{R} \rightarrow \mathbb{R}$.  I'm trying to differentiate  equation of this function both sides  with respect to $x_{0}$. In book from this equation comes from the result of this differentiation is:  $\frac{\partial \phi}{\partial x_0} (t,x_0) = 1 + \int_0^{t} \frac{\partial f}{\partial x_0} (s, \phi(s,x_0)) \cdot \frac{\partial \phi}{\partial x_0} (s, x_0)ds$.  I can't understand expression under the integral. In this book it is explained that it is clear from chain rule. When I'm trying to apply the chain rule I have expression under integral such as:  $\frac{\partial }{\partial x_0} f(s, \phi(s,x_0)) = \frac{\partial }{\partial \phi(s,x_0) } f(s, \phi(s,x_0)) \cdot \frac{\partial }{\partial x_0} \phi(s,x_0) $  Could someone explain to me why in my expression first I have derivative respect by $\partial \phi(s,x_0)$ and then by $\partial x_0?$ In solution there are in both expressions $\partial x_0$ Why?  Maybe important is here additional information that differentiable function $(1)$ is solution of differential equation:  $\frac{\partial \phi}{\partial t} (t,x_0) = f(t,\phi,x_0))$, where $\phi(0,x_0)=x(0).$   I will be grateful for your help Best regards


Is there a general method for solving a cubic polynomial?

I'm doing a course in linear algebra at the moment, and whenever I need to find the eigenvalues of a 3x3 matrix, I'm faced with the issue that I don't know a general method for solving a cubic equation, or I don't remember enough from high school algebra to be able to solve any given cubic equation.  For instance, if I have the characteristic equation  $$-\lambda^3+8\lambda^2-19\lambda+12=0$$  then I can't factor it easily because 19 is a prime number, but a computer was able to somehow find it's solutions for me.   Is there a general, algorithmic method for solving any given cubic equation without factorization? If not, how would you solve an equation like the above?   And is there a similar kind of general method for solving quartic or higher degree polynomials?


This code separates a string into tokens and stores them in an array of strings, and then compares a variable with the first home ... why isn't it working?  public static void main(String...aArguments) throws IOException {      String usuario = "Jorman";     String password = "14988611";      String strDatos = "Jorman 14988611";     StringTokenizer tokens = new StringTokenizer(strDatos, " ");     int nDatos = tokens.countTokens();     String[] datos = new String[nDatos];     int i = 0;      while (tokens.hasMoreTokens()) {         String str = tokens.nextToken();         datos[i] = str;         i++;     }      //System.out.println (usuario);      if ((datos[0] == usuario)) {         System.out.println("WORKING");     } }


Object appears smoothed after rendering but not in viewport

I'm pretty new to blender and used it to model a castle and print it. Now I want to extend the model by textures and render it, but even when I render it with basic material i get some strange output.  Does somebody know my error? I already corrected the normals and they look fine.


Proof Verification: Show that if $f(z)$ is a non-constant entire function , then $g(z)=exp(f(z))$ has essential singularity in $z=\infty$.

Show that if $f(z)$ is a non-constant entire function , then $g(z)=exp(f(z))$ has essential singularity in $z=\infty$.   This question has been answered in the link Thanks!  My approach: Let $f$ analytic (then $f$ has a series), then $exp(f(z))$ is analytic. Then   $$exp(f(\frac{1}{w}))=\sum_{n=0}^{\infty}{\frac{1}{n!}(f(\frac{1}{w}))^{n}}=\sum_{n=0}^{\infty}{\frac{1}{n!}(\sum_{m=0}^{\infty}{\frac{a_{m}}{w^m}})^{n}}$$  We can see that $exp(f(\frac{1}{w}))$ has essential singularity in $w=0$, since there exist negative coefficients. So, $exp(f(z))$ has essential singularity in $w=0$. Is this right? Thanks!


Cut, Copy Paste keyboard shortcut problem on ubuntu 20.04

I have just installed ubuntu 20.04 on my dektop and when I tried to use ctrl+x, ctrl+c, ctrl+vshortcuts to cut/copy/paste a file/text/folder etc nothing happened. I checked the keyboard shortcuts on settings, but none of them was appropriate. I also tried to create custom shortcuts for those, but it also did not work. I have searched all of the related answered questions and videos but none of them applied to me. Any suggestions?


I'm using Ubuntu 12.04. I donwloaded the mscorefonts installer, in order to use Arial and Arial bold fonts, and accepted the EULA agreement.  But I can't use the fonts, and when I got into /usr/share/fonts/truetype/msttcorefonts, the msttcorefonts folder is empty.  I've tried reinstalling both manually and automatically and updating it, but neither appear to work. Does anyone know the ttf-font files for Arial and Arial bold?


How to add comma in random generated numbers C# winforms

Currently I have this code:  private void button1_Click(object sender, EventArgs e) {     label1.Text = (new Random().NextDouble() * (new Random()).Next(10000)).ToString("0.00");     //if (this.label1.Text.Length >= 7)     //{     //    this.label1.Text = string.Format("{0:0,0}", label1.Text);     //} }   which generated random number from 1-10000. I want to insert comma like this: 9,677.89.


What WPA projects took place in Boston, Massachusetts Metropolitian area?

My father, Walter Henry Belmont, is listed in the 1940 Boston, Massachusetts, USA Census Record as working (occupation) Laborer, WPA projects. How can I find what WPA projects he worked on?  Moderator's Note on Privacy Policy: Walter was born more than 100 years ago, so this question complies.  "Massachusetts Births, 1841-1915," database with images, FamilySearch ( : 7 December 2017), Walter Henry Belmont, 30 Oct 1915, Boston, Massachusetts; citing reference ID #p 330, Massachusetts Archives, Boston; FHL microfilm 2,409,903.


Describing all the plane regular curves whose tangent/normal lines all intersect at a fixed point

My intuition tells me that the first case (tangent lines all passing through a fixed point) corresponds to a segment of a line, and the second one corresponds to a circle, but I'm having trouble actually proving it. I thought about assuming (without loss of generality) that the fixed point is the origin, but I didn't get anywhere. For the second one, it would be enough to prove that it has constant curvature... but I'm not seeing where to start.


Lightning tab not display on android salesforce1 app

Currently android salesforce1 app does not show lightning tabs, I see a response in late 2014 that this feature will be added to salesforce1. By when can we expect this feature?


Can I permanently block an update (non-driver) that will not install on my machine on Win10 pro?

I have an update to Visual Studio 2010 that will NOT update and has failed hundreds of times. Manually installing it also fails, and no source has been found for manually getting this very old patch to install on Windows 10. I believe the problem is that Microsoft simply hasn't re-tested KB2890573 at all and it doesn't install on Win10 ver 1511 at all, anymore.  I do not want to use the MS utility that will postpone this update for a while. I want to permanently block it so it does not appear in the windows update list ever again.


Python: Print permutations of 4 variables

I found this Python script that prints all permutations of given variables. I am a complete Python newby, but after a few modifications it does almost exactly what I need.   Here is what I got so far:  blocks =  [ "0", "1a", "2a", "2b" ] # variables num_blocks = len( blocks ) num_places = 4  # number of places  for i in range( pow( len( blocks ), num_places ) ):      value = i     indexes = []      while value:             indexes.append( value % num_blocks )         value = value // num_blocks      # print( i + 1 ) # alternatively print number of each permutation      for j in range( len( indexes ), num_places ):         print blocks[ num_blocks - 1 ]      for j in range( len( indexes ) - 1, -1, -1 ):         print( blocks[ num_blocks - 1 - indexes[ j ] ] )      print " "  # add a line break after each entry   The output is  2b 2b 2b 2b  2b 2b 2b 2a   etc.  How can I A) change the output to   2b2b2b2b 2b2b2b2a   etc.  and B) only print occurences that include the last variable, in this case "2b".  For the purpose of this example, I only included four variables: 0, 1a, 2a, 2b. The script prints all possible combinations of these four variables, from 0000 to 2b2b2b2b and anything in between. Is it possible to print only combinations that include the last variable 2b? So for example 2b2a1a0 or 1a1a02b, but not 2a2a1a0 or 2a01a1a? Later on, many more variables will be included (3a, 3b, etc.), but the script shall only list permutations including the last variable.  Thanks in advance!  George  EDITED to clarify second question.


After submitting a paper to a journal, the paper will be sent to a reviewer by editor in such a way the name of authors will be hidden for referee.  In some cases in the list of references, sometimes there exists papers belong to authors which cite them by authors in the paper. In other words, it is not difficult to extract the name of authors from the reference list, isn't it? How can this issue be managed (in the case of importance of not-knowing the name of authors for referee)?


Disable Hyperlink & convert the link to text in sharepoint

Posting it again, but with more information. I want to disable Hyperlink and convert the link to text in SharePoint.  I`m using Jquery and below is the code. the code works fine for the first time, but if you click on any other section wherein we want the link to work and comeback to the page. Then the link that was disabled via Jquery even start functioning again.  <script src="//code.jquery.com/jquery-1.10.2.js"></script>  <script>  $(function() {  $('.ms-vb').removeAttr("href"); // disable all links in a document $('a').removeAttr("href");   });  </script>   Any suggestion on how the link doesn't function even if the page is refreshed or so.


Unity Tweak tool fails to start with the error "com.canonical.unity.webapps schema is missing"

com.canonical.unity.webapps   In order to work properly, Unity Tweak Tool recommends you install the necessary packages


Problem: If $\frac{\sin^4\theta}{x}+\frac{\cos^4\theta}{y}=\frac{1}{x+y}$, show that, $\frac{\sin^{2m+2}\theta}{x^m}+\frac{\cos^{2m+2}\theta}{y^m}=\frac{1}{(x+y)^m}$.  My attempt: I observed that if both the sides of the given equation are raised to the power of m, the R.H.S of the resulting equation matches with the R.H.S of the result that has to be proved. After that we need to simplify the L.H.S of the resulting expression to match it with the L.H.S of the result that has to be proved.  $\frac{\sin^4\theta}{x}+\frac{\cos^4\theta}{y}=\frac{1}{x+y}$  $\implies(\frac{\sin^4\theta}{x}+\frac{\cos^4\theta}{y})^m=(\frac{1}{x+y})^m$  $\implies(\frac{y\sin^4\theta+x\cos^4\theta}{xy})^m=\frac{1}{(x+y)^m}$  $\implies\frac{(y\sin^4\theta+x\cos^4\theta)^m}{x^my^m}=\frac{1}{(x+y)^m}$  My problem: I am stuck at this step and cannot understand how to proceed, that is, how to simplify $(y\sin^4\theta+x\cos^4\theta)^m$. Please help. A continuation of my method as well as alternate methods (except mathematical induction) are welcome.


Leg bisectors in a trapezoid and angle equality

Let $PQRS$ be a trapezoid. The bisectors of legs $PS$ and $QR$ intersect the opposite legs at $M$ and $N$ so that triangles $PMS$ and $QNR$ are formed.  Prove that $\measuredangle PMS= \measuredangle QNR$.  The question may seem easy but I fail to move on, playing with angles didn't help. I'd appreciate some hint from somebody with an eye for geometry and triangles.


Difference between abstract Class and Interface in C#

this article says   Abstract Class -can have method Declaration and  method definition.  But this article says  Abstract - can have only method Declaration.  I got confused. Can anybody clear me what is the exact difference of both ?


What is the difference between Kernel density estimation and Parzen window estimation?

I was reading about non-parametric density estimation when I found out about Kernel Density Estimation (KDE) and Parzen window estimation. Although the text book states both are the same, the equation form seems to be different:   For Kernel density estimation (KDE) 3D data     For Parzen-window estimation in 3D data    Can any one help with this?


Does %EXP and % Magic Find from my follower count towards my character?

If I equip a % EXP bonus or % Magic Find item to my follower, does it count towards my character?  Would inserting a  in my follower's jewelry count towards my exp?


C++, == operator, is it given automatically?

in C++ the = operator is automatically defined when creating a new class but what about the == operator, my professor said that if we didn't write operator== this will cause an error but on the other side we learnt that if we didn't write one the compiler will create one for as which compares each element of the class member using the == operator which matches that element. what is right here?


Short Story: Genetically engineered bats steal space ship

I read a short story in an anthology of science fiction in the mid-1990s about a scientist who is genetically engineering rat-like creatures for increased intelligence. Eventually these animals develop sentience and flight, and are told by the scientist that they come from a star in the sky (Venus?).  The story ends with the animals stealing a space ship and flying off to return to their supposed 'homeland'. Any ideas of what this could have been?


I got to know this while learning PHP and I don't exactly know what is this used for, and this is while connecting to database


What looks like a counting glitch in EE's reputation scores for August

Looking at the August monthly reputation totals accumulated by users in EE, I see that Spehro Pefhany has a great total score of 3,768. However, his quarterly total (July, August, Sept 2016) is also 3,768. This looks like a counting glitch to me because clearly he has scored hundreds of reputation points in july 2016 by examination of his personal page.


Why are most of deleterious mutations recessive in nature? I understood that if it's recessive then one reason may be that the mutant gene doesn't code for a functional protein and so there is no  phenotype to express.  But why is it recessive in the first place?


The following problem came up at dinner, I know some ways to solve it but they are quite ugly and as some wise man said: There is no place in the world for ugly mathematics.  These methods are using l'Hôpital, but that becomes quite hideous very quickly or by using series expansions.  So I'm looking for slick solutions to the following problem:     Compute $\displaystyle \lim_{x \to 0} \frac{\sin(\tan x) - \tan(\sin x)}{\arcsin(\arctan x) - \arctan(\arcsin x)}$.   I'm curious what you guys will make of this.


What causes my camera to lose contact with my lens?

In a previous question, I asked about my exposure problems and there I found out that my lens cannot adjust the aperture/aperture blades. Every time I try to adjust the aperture to a higher number my and take a picture, an error comes up. I tried to check the lens and I saw that the aperture didn't change, thus giving me an error. Sometimes, the aperture blades also gets stuck and doesn't go back to its original position. I've tried cleaning the contacts of the lens and camera but the camera and the lens still loses contact. I also tried borrowing another lens, adjusted the aperture and the camera still loses contact with the lens. It seems my camera loses contact with the lenses every time I change the the aperture, though it works fine if I use the smallest available aperture.  What is the possible cause of the lose of contact?  Camera: Nikon D90  Lens: AF-S DX NIKKOR 18-55mm f/3.5-5.6G VR II  Thanks in advance!


Binary Classification of Numeric Sequences with Keras and LSTMs


Trying to debug NullPointerException when using ArrayList

public static ArrayList<Integer> getStudentClasses(Student student, ArrayList<Integer>[] classesXstudents) {       ArrayList<Integer> classes = new ArrayList<Integer>();       for (int i = 0; i < classesXstudents.length; i++) {         for (int j = 0; j < classesXstudents[i].size(); j++) {           if (classesXstudents[i].get(j) == student.getID()) {             classes.add(i+1);           }         }       }       return classes;   }   throws NullPointerException at the line     for (int j = 0; j < classesXstudents[i].size(); j++) {   which I'm assuming means classesXstudents[i].size() is null at some point. classesXstudents is an array of ArrayList objects. How should I debug this case?


My QGIS (2.8.2) joins always result in an outer join.  How do I create an inner join with QGIS?


Was Jesus Christ a wizard in the world of Harry Potter?

So we know that in the Potterverse they celebrate Christmas. Hopefully most people on here know the original reason for Christmas is the supposed birth of Jesus.   What is Jesus considered to be when taken from a in-universe point of view? Is Jesus considered a wizard by the wizarding community or the author/narrator?   (It seems plausible seeing as most of his miracles would not be too difficult for a wizard such as Dumbledore, and other mystical/magical figures like Morgan le Fey or Merlin were shown to be wizards in-universe).


I am wondering if there is any tool or way to kind of Weld (merge) multiple vertices at once,     AltM > Merge at Center doesn't do the job.    Doing by one takes a lot of time so it's inefficient way of going about it.


Code package com;  public class Employee {      private String name;      private String empId;      public Employee(String name, String empId) {         super();         this.name = name;         this.empId = empId;     }      // equals and hashcode  }   package com;  import java.util.LinkedHashSet; import java.util.Set;  public class TestEmp {      public static void main(String[] args) {         Employee emp1 = new Employee("Luke", "11");         Employee emp2 = new Employee("Luke2", "12");          Set<Employee> empSet = new LinkedHashSet<>();          empSet.add(emp1);         empSet.add(emp2);          Object obj[] = empSet.toArray();          System.out.println(obj);     }  }  When i print i get the response it is showing as [Ljava.lang.Object;@7852e922 I need response in form of an Employee Array , can you please help how to get this in form of an array The response needs to form of an Array of Employees


Let $p\gt 3$, be a prime number and  $1+\frac{1}{2} +\frac{1}{3} +...+\frac{1}{p-1} =\frac{a}{b}$ when $a,b\in \mathbb N$ and $gcd(a,b)=1$.      prove that $p^2|a$.   I proved that $p|a$, but I cant prove $p^2|a$, and my idea is as follow:  By multiplying $(p-1)!$, we get:  $(p-1)!+\frac{(p-1)!}{2}+...+\frac{(p-1)!}{p-2}+\frac{(p-1)!}{p-1}=\frac{a(p-1)!}{b}$ $\,\,\,\,$ $(1)$  So, the number $\frac{a(p-1)!}{b}$ should be integer. consider the left hand of the sum of $(1)$ in the ring $Z_p$. Since in $Z_p$ the inverses are unique and what we have is indeed a rearrangement of all the congruence classes $mod\,p$. So:  $(p-1)!+\frac{(p-1)!}{2}+...+\frac{(p-1)!}{p-2}+\frac{(p-1)!}{p-1}\equiv 1+2+...+p-1\equiv \frac{p(p-1)}{2}\equiv 0$$\,\,\pmod p$. And from here, $p|\frac{a(p-1)!}{b}$, and that's mean: $p|a$.   I tried to prove the statement by considering the ring $Z_{p^2}$ but I get nothing.  Thanks in advance…


What is the probability to get each side at least once on $n$ throws of fair dice?

Let's say I have $n$ fair (six-sided) dice ($n>=6$) and I want to figure out the probability of getting each side at least once. I figured out a formula through elementary combinatorial reasoning: $$\frac{6!\cdot\binom{n}{6}\cdot6^{n-6}}{6^n}$$  First, of all, is this formula correct?  Second, somewhere I read that I could do this with the sieve formula. How do I use the sieve formula for this one?


My Ubuntu screen is in full zoom and it is all white screen

I went to settings in my laptop which is running on Ubuntu and went to universal access. Then I clicked in zoom option and my laptop screen went full white.   What can I do now to fix this?


Null pointerException while getting Primary Key(primitive datatype) in hibernate

I'm getting Null Pointer Exception while retrieving Primary Key or Id of an Entity in Hibernate result query.   My Entity class:  @Entity @Table(name="sample") public class ccy{  @Id @column(name = "S_ID") private long id;   2nd varibale and so on   when i write hibernate query to retrieve it causes Null pointer exception, my select query is:  long ID = 0; String HQL = "select id from sample"; Query query = session.createQuery(HQL); ID = (Long)query.uniqueResult(); //getting NullPointerException in this line  return ID;   Any suggestions to avoid this exception? I'm stuck here. Any help would be much appreciated


Suppose that you can apply the Ratio Test to $\Sigma a_{n}$. Let $r$ be the limit of $|a_{n+1}|/|a_{n}|$. Show that $\lim\sup|a_{n}|^{1/n}=r$ as $n\rightarrow\infty$.  I know by definition of lim sup that $\forall\epsilon>0$,  $\exists N_{\epsilon}$  s.t. $x_{n}<r+\epsilon$  $\forall n>N_{\epsilon}$. Not sure how to apply that here though.


I would like to use footnotes without cluttering the container paragraph. Something like:  This is a very long complex\footnote[a] sentence.  \foottext[a]{So complex that I would prefer to pull out the footnote text.}   The idea comes from the [linktext][1], [1]: http://url.com markdown syntax.


Irrationality of sum of two logarithms: $\log_2 5 +\log_3 5$

I try to prove that the number $$\log_2 5 +\log_3 5$$ is irrational. But I have no idea how to do it. Any hints are welcome.


How do I determine which graphics card I'm using?

I recently read  on , which made me realize that I actually have no idea how to tell which graphics card I have in my PC. Where can I find this information?


I have a website running on Apache.  I would like to create a forward such that if I access http://helpdesk.example.com/otrs/anyname (except customer.pl) this redirects to http://helpdesk.example.com/otrs/customer.pl  Also I'd like to not show the path of the website in the URL:  helpdesk.example.com/otrs/customer.pl displayed as helpdesk.example.com.    Thank you for answers..  Some is wrong...  in var/www/ is index.html  <meta http-equiv="refresh" content="0;url=http://helpdesk.example.com/otrs/customer.pl">   and at this moment is .htaccess  Options +FollowSymLinks RewriteEngine On  RewriteCond %{SCRIPT_FILENAME} !-d RewriteCond %{SCRIPT_FILENAME} !-f  RewriteRule ^/(.*)$ ./customer.pl?query=$1 enter code here   It isn't working...


Can the Scatter spell send targets under water/lava/etc.?

XGE pg 164, Scatter     You teleport each affected target to an unoccupied space that you can see within 120 feet of you. That space must be on the ground or on a floor.   Water  You're on a boat and cast scatter on someone else on the boat.  If the water is less than 120 feet deep and you are looking over the side of the boat, could you teleport them to the bottom?  Lava  You're on an active volcano next to a pool of lava.  Can you scatter them into the lava?  You technically can't see the ground under it, so if you can send someone underwater could you not do it with lava?  Or does lava count as ground since you can technically walk on it (assuming we're using real lava not action movie lava)?  Ice  You're next to a frozen lake.  Can you scatter someone under the ice?


Increase the pulling force of a solenoid with a permanent magnet

I have a number of  I would like to use in a project. The problem is that they're not quite powerful enough so I've been trying to come up with ways to increase the their pulling force without increasing the voltage.  I was thinking that I could add a permanent magnet to the bottom of the plunger so in addition to the the core being pulled into the coil the magnet would be repulsed by the coil and add to the force the plunger has.  Would this actually work? And if so what strength of magnet should I use? Should the magnet sit on the outside of the coil or just inside?


How can I prevent spam on sites which I control?

This is a general, community wiki question to address all non-specific spam prevention questions.  If your question was closed as a duplicate of this question and you feel that the information provided here does not provide a sufficient answer, please open a discussion on .    For purposes of this question, spam will include:   Any automated post Manually-posted content which includes links to spammers' sites Manually-posted content which includes instructions to visit a spammer's site


Moving from A(x,y) to B(x1,y1) with constant speed?

I currently have something like:  float deltaX = point0.getX() - point1.getX(); float deltaY = point0.getY() - point1.getY();   And every 0.01 seconds I refresh my objects position like this:  object.setPosition(object.getX()-deltaX/100,object.getY()-deltaY/100);   So this moves my object from point0 to point1 in 1 second. What I need is having the 2 points, to be able to move the object from point0 ,facing(in the direction of) point1 with a constant speed. Thus, when I have a point closer to my initial point the object will move towards it with the same speed it does if I would have a farther point. Any suggestions are appreciated. Thanks.


Why won't this simple Java code not pass this test?

The code seems correct and straight forward to me, I'm using the basic indexOf method for an array i created.  Why won't this code:  public int indexOf(X s) {             for (int i = 0; i <= arr.length-1; i++)     {         if (arr[i] == s)         {             return i;         }      }             return -1; }   pass this test:  @Test public void testIndexOf() {     BetterArray<String> b = new BetterArray<String>();      for (int i = 0; i < 20; i++)         b.add("str" + i);      assertEquals(0, b.indexOf("str0"));     assertEquals(19, b.indexOf("str19"));     assertEquals(-1, b.indexOf("not found")); }


Let $$S \subset N_{100}= \{1,2,3,4, \dots, 100 \}$$ with $|S|=51$. Then prove for any such $S$ it is possible to select two numbers from $S$ such that one is a multiple of other.  I wasn't able to proceed. How should I start. I think it needs Pigeon Hole Principle.


If i want to say that a certain tool can only only do one thing then how do i call it? I thought of unifunctional,but i don't think it's a real and formal word.


How to fix bottom of door frame (light puppy chewing)

So I live in a rented apartment and some things did not go as planned and ended up with a puppy before moving instead of after. Anyways I just noticed he has been chewing on the frame inside my bedroom and I'm just wondering how to fix this so I can obtain as much of my deposit as possible


Is there a way to know how often latex has already run?

A few days ago, I have seen an example of a latex file, that did conditional \defs on subsequent runs but I can't find that one again.  I still remember that it was by looking into the \jobname.aux do get the number of previous builds.  In my current situation, I'd like to not use package minted but define its commands to simply use verbatim-environment during the first two builds and using minted and its built-in macros for syntaxhighlight in the third run.  How exactly can I get the number of previous latex-runs?


How can I merge unallocated hard disk space to my linux partition?

I am currently dualbooted between Windows 8 and Linux Mint 18  Using GParted, I see this following:   The selection partition is unallocated for a size of 25 GB, I would like to merge this with my dev/sda6 (linux partition), so that I can make my linux partition about 50GB. I'm not really sure about the process though on how to do this? I try to resize dev/sda6, but I see that the maximum size and minimum size are the same. How do I merge the unaccolated space?


Interface marked as implemented in external lib, property from interface not visible, why?

Those are from   Here is an interface :  public interface ISupportSampling {     double? SamplingPercentage { get; set; } }   And here is what I can see from VS a class that is supposed to implement the interface.  #region Assembly Microsoft.ApplicationInsights, Version=2.6.4.0, Culture=neutral, PublicKeyToken=31bf3856ad364e35 // nsame namespace as the above interface public sealed class EventTelemetry : ITelemetry, ISupportProperties, ISupportSampling, ISupportMetrics {     public EventTelemetry();     public EventTelemetry(string name);      public DateTimeOffset Timestamp { get; set; }     public string Sequence { get; set; }     public TelemetryContext Context { get; }     public string Name { get; set; }     public IDictionary<string, double> Metrics { get; }     public IDictionary<string, string> Properties { get; }      public ITelemetry DeepClone(); }   You can see that the only property from the interface is not in the list of public properties.    So, it means that, when coding, 2 things happen that are not desirable :  1)   This code  EventTelemetry eventTelemetry; // ... eventTelemetry.SamplingPercentage = 100;   Causes the following compilation error :     'EventTelemetry' does not contain a definition for   'SamplingPercentage' and no accessible extension method   'SamplingPercentage' accepting a first argument of type   'EventTelemetry' could be found (are you missing a using directive or   an assembly reference?`   2)   Also, the SamplingPercentage property will not show up in autocomplete.    Why ? Am I being lied to by VS on what I see from the class ? (that SamplingPercentage is indeed present and public, but for some reasons not shown to me ?)  My current workaround (and also given in the last snippet in  ) is to cast as this :  ((ISupportSampling) eventTelemetry).SamplingPercentage = 100;   Is there a more "developper friendly" way, without using explicit cast ? (using Visual Studio 2017)


I have submitted a paper and I received a request for major revisions.   The first time the status changed from "under review" to "with editor".  After that I submitted a revised version of the paper. Now the status has changed from "under review" to "required reviews completed".    Why first time it wasn't shown this status?  How many days does it usually take to change the status from "required reviews completed" to next status?


If $f(z)$ is continuous in the neighborhood of the point $z=a$, then $$\lim_{r\to 0^+} \int_{\vert z-a\vert =r} \frac{f(z) dz}{z-a}=2\pi i\,f(a)\tag{1}$$  In my desperate intents of proving the above exercise, I tried to prove a 'particular' case of it, which is when $z=0$.   So if $z=0$ and as $f$ is continuous on a neighborhood of zero, given $\epsilon>0$, there exists $\delta>0$ such that $|f(re^{i \theta})-f(0)|\le \epsilon$ for $r\in[0,\delta)$ and $\theta\in\mathbb R$. Hence,  $\left\lvert\int_{0}^{2 \pi}(f(re^{i \theta})-f(0))d\theta\right| <2\pi\epsilon \Rightarrow \limsup_{r\to0}\left\lvert\int_{0}^{2 \pi}(f(re^{i \theta})-f(0))d\theta\right| \le2\pi\epsilon.$  If $\epsilon\to0$, then $\limsup_{r\to0}\left\lvert\int_{0}^{2 \pi}(f(re^{i \theta})-f(0))d\theta\right|=0 \Rightarrow \lim_{r\to0}\int_{0}^{2 \pi}(f(re^{i \theta})-f(0))d\theta=0.$  Is this proof correct?  How can I make the proof for $(1)$ following the 'particular proof'? Can someone help me?


bone heat weighting: failed to find solution for one or more bones error message

Here it goes again, the rigging error. I have a model that has a mirror modifier already applied and a subsurface and displace modifier (not applied) in my model. So when I try to parent my model to my armature it gets the bone heat error message, but before I applied the mirror modifier it worked, although the bones only work on the left side and the right side didn't work at all.   Solutions I have tried:   Remove doubles (doesn't work) Recalculate (doesn't work either) Remove all modifiers (no luck) Place the root bone at the center of the model (still get the error) Apply the subsurface modifier and parent them (no result) Apply the decimate planar modifier (this works, but the decimate modifier destroys my seam marked on my model, which causes my displace modifier to not function well because I baked my displace map with another model that has a multiresolution level of four).   blender file:   I have the unapplied mirror modifier model in layer 3 and applied mirror modifier model in layer 1.


I was wondering why I couldn't delete my own question. Well actually, I have accepted the question itself to be wrong and even I feel that I have accepted a wrong answer, but when I try to delete my question, I get a message saying that,"This question can't be deleted, flag it for moderator attention". Why is this happening and how can I solve this?


I have the following table :            Table "osm_france.france_2po_4pgr" Column     |           Type            | Modifiers  ---------------+---------------------------+----------- id            | integer                   | not null osm_id        | bigint                    |  osm_name      | character varying         |  osm_meta      | character varying         |  osm_source_id | bigint                    |  osm_target_id | bigint                    |  clazz         | integer                   |  flags         | integer                   |  source        | integer                   |  target        | integer                   |  km            | double precision          |  kmh           | integer                   |  cost          | double precision          |  reverse_cost  | double precision          |  x1            | double precision          |  y1            | double precision          |  x2            | double precision          |  y2            | double precision          |  geom_way      | geometry(LineString,4326) |  Indexes:    "pkey_france_2po_4pgr" PRIMARY KEY, btree (id)    "france_2po_4pgr_gix" gist (geom_way)    "idx_france_2po_4pgr_source" btree (source)    "idx_france_2po_4pgr_target" btree (target)   As you can see, a spatial index is available for the geom_way column. I have performed a VACUUM ANALYZE on the table for safety.  Now I run this very simple query :  select * from osm_france.france_2po_4pgr where ST_DWITHIN(St_TRANSFORM(geom_way,3035),ST_transform(ST_SetSRID(ST_MakePoint(2.3, 48.8),4326),3035),100);   So I'm looking for all the geometries within 100 meters from a given point (I transform the SRIDs from 4326 to 3035 to specify a range in meters).  The explain analyze yields :  Seq Scan on france_2po_4pgr  (cost=0.00..1630779.00 rows=69644 width=293) (actual time=35.044..9407.356 rows=3 loops=1) Filter: ((st_transform(geom_way, 3035) && '0103000020DB0B0000010000000500000046D8C5565EA84C41A950F47CDFFF454146D8C5565EA84C41A950F47C4300464146D8C556C2A84C41A950F47C4300464146D8C556C2A84C41A950F47CDFFF454146D8C5565EA84C41A950F47CDFFF4541'::geometry) AND ('0101000020DB0B000046D8C55690A84C41A950F47C11004641'::geometry && st_expand(st_transform(geom_way, 3035), 100::double precision)) AND _st_dwithin(st_transform(geom_way, 3035), '0101000020DB0B000046D8C55690A84C41A950F47C11004641'::geometry, 100::double precision)) Rows Removed by Filter: 5225288 Planning time: 0.517 ms Execution time: 9407.390 ms   Why is this query not using the available spatial index ?


6 generals propose locking a safe containing secret stuff with a number of different locks. Each general will get a certain set of keys to these locks. How many locks are required and how many keys must each general have so that, unless 4 generals are present, the safe can't be opened. Generalize to $n$ generals and $m$ minimum number of generals required.   Here's where I've gotten to so far. Define a function $$f(n,m)=k$$  where $n$ and $m$ are as defined above and $k$ is the number of locks required. I've figured out $f(1,1)$, $f(2,1)$, $f(2,2)$ and so on until $f(4,4)$. I've noticed that if I arrange these values in a Pascal-like triangle, I can get the values in the lower row by summing the 2 numbers above it (I can't figure out how to display it using LaTeX). Doing this, I get the number of locks required as $24$ but I'm still working on the key distribution.  My question is whether I'm on the right track, and if so, how do I go about proving my solution. Thanks for your help.  [EDIT] To make it clear, the arrangement must be such that the safe can be opened when any $4$ generals are present and not if the number of generals is $3$ or less.


I'm starting to learn how to shoot. Up until now I've only used point-and-shoot cameras mostly on automatic settings. My view is there are basically three classes of cameras sold by the major manufacturers:   Point-and-shoot: for those who want nothing to do with photography Advanced: (Canon's G series, or Panasonic's LX) - some settings, but not complete flexibility SLR: The "real deal"   My question is, if I want to learn how to shoot good photographs, can I start with a camera from the 2nd category, instead of an SLR? There are still options for manually setting the ISO, aperture and shutter speed on those models, I just don't understand how lacking they are and if they would hinder my learning.


Help Identify this game: place wooden barriers try to get across

When I was younger I had a cool game, that I forget the name of, and would like to re-acquire.  It was a small wooden board, with a grid of squares on it. There were two players, and each turn, you could move your piece, or place a barrier in one of the slits. You couldn't completely block your opponent, but you had to try to get to the other side of the board before they did.  Does anybody know what this game was called?


Why doesn't Firefox show any kind of a feed presence indication when there is are RSS/Atom feeds associated with the page?

For example I've came to a webpage having the following tag inside its <head> tag:  <link rel="alternate" type="application/rss+xml" title="A blog feed" href="http://johndoe.github.com/atom.xml">   Or a blogger.com blog having both RSS and Atom feeds rels.  But my Firefox (7.0.1 on XUbuntu 11.10) doesn't indicate this! I have to view a page source code to see whether there is an RSS/Atom feed for it or not. Why? How to fix this?


Do bread bins really keep homemade breads fresh?

I usually keep my homemade breads for a day or two in a ziplock bag. I recently felt like buying a good-looking bread box/tin to not use plastic bags that often (I keep the bags for as long as possible unless used for something like cinnamon rolls) and a bread box looks good on the breakfast table. I was reading some reviews that people complained about their bread going moldy in the box although it was a pretty fancy/expensive one. Since I wouldn't spend money on something useless which takes some space in my small kitchen, I'd like to make sure it is a good buy. I also read  on plastic bags keeping the bread fresh for a few days and ask myself whether I should keep using ziplock bags. Also, there different types of them,


Where can I get the stock untouched ROM for HTC Desire C?

I just checked XDA Developers, and I can't find the stock ROM for HTC Desire C. Is it actually discontinued, and is my desire outdated?


What is the replacement of mod operator?

I have a code segment that requires the remainder of two ints. I am using modulus operator as usual but I am hearing that it takes more time. So I am asking that is there any way to get the remainder more efficiently  than mod operation... The following will be my code   int rem=gid%bpp   gid being any int and bpp being 2,4,8,16,32.


Are dual US citizens affected by President Trump's ban on Iran, Iraq, Libya, Somalia, Sudan, Syria, Yemen?

I'm a US citizen, born in the US, but also an Iranian citizen due to my father being from Iran. I've never been to Iran except for a brief time when I was just a year old.  In light of Trump's recent ban on citizens from 7 countries entering the US, if I decided to take a vacation to Europe in the near future, would I have trouble re-entering the US despite being an American-born US citizen?  Is there any way for airport officials to know that I even hold an Iranian citizenship?  I'm also concerned for my parents, who were both born in Iran but also hold US citizenships. Can we safely leave the country for vacation and come back?  We all have American passports.


How can I define a custom listing environment?

I am trying to define an enviroment for a specific programming language, F#. Here's my code:  \definecolor{bluekeywords}{rgb}{0.13,0.13,1} \definecolor{greencomments}{rgb}{0,0.5,0} \definecolor{turqusnumbers}{rgb}{0.17,0.57,0.69} \definecolor{redstrings}{rgb}{0.5,0,0}  \lstdefinelanguage{FSharp}     {morekeywords={let, new, match, with, rec, open, module, namespace, type, of, member, and, for, in, do, begin, end, fun, function, try, mutable, if, then, else},     keywordstyle=\color{bluekeywords},     sensitive=false,     morecomment=[l][\color{greencomments}]{///},     morecomment=[l][\color{greencomments}]{//},     morecomment=[s][\color{greencomments}]{{(*}{*)}},     morestring=[b]",     stringstyle=\color{redstrings}     }  \newenvironment{fslisting}   {     \lstset{         language=FSharp,         basicstyle=\ttfamily,         breaklines=true,         columns=fullflexible}     \begin{lstlisting}   }   {     \end{lstlisting}   }   Then I'm trying to use it as such:  \begin{fslisting} type 'a Process = 'a Signal IObservable \end{fslisting}   But it doesn't work. The output log says that the listing is not terminated - or is terminated by the document. So the rest of the document is also formatted as a listing, which is of course not the intention.  What am I doing wrong here?


Forgot password--- show the rules for that passphrase?

I know there's been a lot of discussion about password strength and indicators when signing up. I often find that when I forget a password for a site, its because I can't remember which set of rules were in place for that site (ie, >10 chars, special chars, no numbers) and if I knew those rules, Id remember which algorithm I used for my password.   To me, it seems like it's worth giving the user a hint about what the password rules were, before forcing them to go through the whole forgot password process. I'm finally able to implement something like this on our site, but I was curious about the UX of it.         – Wireframes created with   With that said, has anyone seen this done in practice/know of a reason not too?  Edit 1:  I've often thought the argument against this falls under the vague umbrella of security-- "If we display this information it will be easier to crack the password"-- but I can obtain the same information by attempting to create a new account


Is there any built-in behavior for Command + Delete (delete line right of cursor) in macOS?

It is possible to press ⎇ Backspace on macOS in order to delete the previous word (left of the cursor), and ⌘ Backspace to delete the previous line (left of the cursor). If you have an external keyboard with a "delete" key (or the "forward delete key"), or are able to emulate the delete key via software, it is possible to press ⎇ Delete to delete the word to the right of the cursor. However, perhaps surprisingly, it is not possible to press ⌘ Delete in order to delete the line to the right of the cursor.  Now, I have only been able to make this possible by emulating a ⌘⇧→ and then a Backspace with BetterTouchTool. However, I want to avoid doing something like this because BTT does not work at a "low enough level" for me – that is to say, the action is not entirely reliable.  Is there any official macOS way to delete the line to the right of the cursor?


Has this bug been fixed: "Is it possible to search for punctuation/special characters?"

Sorry if this is a duplicate question. I'm working on my searching skills.   What I get from the original post is that this question was asked then tagged as a possible bug in 2009, and then tagged with status-completed in early 2013. Also from the discussion it seems that searching for special characters is no longer possible. This was what I experienced when I tried to search for :+ and ":+" on stackoverflow.  Am I reading this correctly? Thanks for your help.


ABE Schemes - Access Structures & Performance

I'm reading this article,  and in the Table 1, are there these access structure: Threshold, Tree, ($n$,$n$)-Threshold, LSSS, AND gates. I have 2 questions.  1) What are the differences between these access structures ?  2) How can i measure the performance of a scheme in a network ? (i.e scalability, number of users (producers and consumers) supported, number of contents supported) [If this question is off topic, i will remove it].