How can I disable a usb device on debian? I am using a macbook pro but I have installed debian jessie 8.2 on it.  the USB device: Card Reader (Apple) is pulling way too much power and I don't even use the device.  How can I disable that device?    33.8 W    100.0%                      Device         USB device: Card Reader (Apple)   2.96 W    100.0%                      Device         Radio device: btusb   477 mW      0.0 pkts/s                Device         Network interface: wlan0 (wl)   running lsusb I cannot find which device is that card reader  Bus 002 Device 003: ID 05ac:8406 Apple, Inc.  Bus 002 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub Bus 001 Device 006: ID 05ac:8289 Apple, Inc.  Bus 001 Device 002: ID 0a5c:4500 Broadcom Corp. BCM2046B1 USB 2.0 Hub (part of BCM2046 Bluetooth) Bus 001 Device 003: ID 05ac:0262 Apple, Inc.  Bus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub   additional information.  dmesg | grep APPLE  [    0.000000] ACPI: RSDP 0x000000007AD8E014 000024 (v02 APPLE ) [    0.000000] ACPI: XSDT 0x000000007AD8E1C0 00009C (v01 APPLE  Apple00  00000000      01000013) [    0.000000] ACPI: FACP 0x000000007AD8C000 0000F4 (v05 APPLE  Apple00  00000000 Loki 0000005F) [    0.000000] ACPI: DSDT 0x000000007AD80000 006C1F (v03 APPLE  MacBookP 00110002 INTL 20100915) [    0.000000] ACPI: HPET 0x000000007AD8B000 000038 (v01 APPLE  Apple00  00000001 Loki 0000005F) [    0.000000] ACPI: APIC 0x000000007AD8A000 0000BC (v02 APPLE  Apple00  00000001 Loki 0000005F) [    0.000000] ACPI: SBST 0x000000007AD88000 000030 (v01 APPLE  Apple00  00000001 Loki 0000005F) [    0.000000] ACPI: ECDT 0x000000007AD87000 000053 (v01 APPLE  Apple00  00000001 Loki 0000005F) [    0.000000] ACPI: SSDT 0x000000007AD7F000 00010B (v01 APPLE  SataAhci 00001000 INTL 20100915) [    0.000000] ACPI: SSDT 0x000000007AD7E000 000024 (v01 APPLE  SmcDppt  00001000 INTL 20100915) [    0.000000] ACPI: SSDT 0x000000007AD7C000 000688 (v01 APPLE  SDUsbLpt 00001000 INTL 20100915) [    0.000000] ACPI: SSDT 0x000000007AD79000 000032 (v01 APPLE  SsdtS3   00001000 INTL 20100915) [    0.000000] ACPI: SSDT 0x000000007AD64000 009E2C (v01 APPLE  TbtPEG11 00001000 INTL 20100915) [    0.000000] ACPI: SSDT 0x000000007AD63000 0000B8 (v01 APPLE  Sdxc     00001000 INTL 20100915) [    0.000000] ACPI: MCFG 0x000000007AD89000 00003C (v01 APPLE  Apple00  00000001 Loki 0000005F) [    0.000000] ACPI: DMAR 0x000000007AD5F000 000088 (v01 APPLE  HSW      00000001 AAPL 00000001) [    2.141500] ata1.00: ATA-8: APPLE SSD SM0512F, UXM2JA1Q, max UDMA/133 [    2.149927] scsi 0:0:0:0: Direct-Access     ATA      APPLE SSD SM0512 JA1Q PQ: 0 ANSI: 5 [    3.051962] scsi 1:0:0:0: Direct-Access     APPLE    SD Card Reader   3.00 PQ: 0 ANSI: 6   sg_scan -i  /dev/sg0: scsi0 channel=0 id=0 lun=0 [em]     ATA       APPLE SSD SM0512  JA1Q [rmb=0 cmdq=0 pqual=0 pdev=0x0]  /dev/sg1: scsi1 channel=0 id=0 lun=0 [em]     APPLE     SD Card Reader    3.00 [rmb=1 cmdq=0 pqual=0 pdev=0x0]    ps -ax | grep dev     47 ?        S      0:00 [kdevtmpfs]    59 ?        S<     0:00 [devfreq_wq]   215 ?        Ss     0:00 /lib/systemd/systemd-udevd  2525 ?        Sl     0:15 /google/chrome/chrome   4358 pts/2    S+     0:00 grep dev   I've tried all the suggestions in  but it doesn't work. That's why I have a new question.

I am currently using a macbook pro but the operating system is debian 8.2 not os x  I am using a macbook pro but there's this one device that's just draining a lot of power. This USB device: Card Reader (Apple)   32.5 W    100.0%                      Device         USB device: Card Reader (Apple)   2.60 W    100.0%                      Device         Radio device: btusb   209 mW     19.7 pkts/s                Device         Network interface: wlan0 (wl)   This device really drains my battery, I noticed that my laptop wouldn't even get 2 hours when not plugged in, I installed powertop. Made all the recommended changes but this device, I can't find out how to disable it. I don't even use that reader and forgot that it was there.  I configured all my devices to use limited power in my rc.local  echo '0' > '/proc/sys/kernel/nmi_watchdog' echo 'min_power' > '/sys/class/scsi_host/host0/link_power_management_policy' echo '1' > '/sys/module/snd_hda_intel/parameters/power_save' echo '1500' > '/proc/sys/vm/dirty_writeback_centisecs' echo 'auto' > '/sys/bus/usb/devices/2-4/power/control' echo 'auto' > '/sys/bus/usb/devices/1-12/power/control' echo 'auto' > '/sys/bus/usb/devices/1-8.3/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:00:1f.3/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:01:00.1/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:00:1c.3/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:00:1c.4/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:00:1c.2/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:00:1c.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:00:1b.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:00:16.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:00:14.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:00:01.1/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:00:01.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:00:00.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:01:00.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:08:00.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:07:06.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:07:05.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:07:04.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:07:03.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:07:00.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:06:00.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:05:00.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:04:00.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:03:00.0/power/control' echo 'auto' > '/sys/bus/pci/devices/0000:00:1f.0/power/control'   How can I get this device to act sanely or disable it completely because I  haven't used it.


Simple enough question, but I really have only seen the newer Star Trek series and I have not seen a ship go to warp from inside an atmosphere of a planet.                                        The Warp Drive does not produce momentum - it literally warps space   around the ship, dragging the ship and its adjacent bubble of normal   space, through the time-space medium.   Being that I am not up to date on the whole in-universe physics of what happens when a ship goes to warp, I was interested to know what happens if the ship tries to jump to warp from inside an atmosphere.   So can a ship jump to warp from inside an atmosphere?

As XKCD recently educated some of us in a "What If" blog post, playing (near) light-speed baseball on a planet with an atmosphere .  The TL;DR version translates to:  A baseball moving at 0.9c is traveling too fast for particles in the atmosphere to get out of the way.  The resulting atomic collisions set off a chain reaction that feeds off of the rest of the surrounding atmosphere, turning into a massive nuclear explosion.  This does not bode well for the batter, the pitcher, the catcher, or anyone else within a few miles of the reaction's epicenter.  Bringing this issue into context with the Star Trek universe, there was a point in the 2009 movie where the Enterprise came out of warp amidst the clouds of Saturn's sixth moon, Titan.  Presumably, this means that the Enterprise at some point was traveling through Titan's atmosphere near or above the speed of light.  Is there some principle of warp drive technology that allows the Enterprise to avoid the fate of the baseball in this situation, or should that interaction have actually destroyed (at least) a good part of the Enterprise and Titan?


i use the following code ( springer template)  the problem that i neeed to repeat compilation several  times, and sometimes i have to put the enitre folder in an other directory. How can i resove this problem please?  %%%%%%%%%%%%%%%%%%%%%%% file template.tex %%%%%%%%%%%%%%%%%%%%%%%%% % % This is a general template file for the LaTeX package SVJour3 % for Springer journals.          Springer Heidelberg 2010/09/16 % % Copy it to a new file with a new name and use it as the basis % for your article. Delete % signs as needed. % % This template includes a few options for different layouts and % content for various journals. Please consult a previous issue of % your journal as needed. % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  % % First comes an example EPS file -- just ignore it and % proceed on the \documentclass line % your LaTeX will extract the file if required \begin{filecontents*}{example.eps} %!PS-Adobe-3.0 EPSF-3.0 %%BoundingBox: 19 19 221 221 %%CreationDate: Mon Sep 29 1997 %%Creator: programmed by hand (JK) %%EndComments gsave newpath   20 20 moveto   20 220 lineto   220 220 lineto   220 20 lineto closepath 2 setlinewidth gsave   .4 setgray fill grestore stroke grestore \end{filecontents*} % \RequirePackage{fix-cm} \documentclass{svjour3}                     % onecolumn (standard format) %\documentclass[smallcondensed]{svjour3}     % onecolumn (ditto) %\documentclass[smallextended]{svjour3}       % onecolumn (second format)  %\documentclass[twocolumn]{svjour3}    % \smartqed  % flush right qed marks, e.g. at end of proof  % Reference package \usepackage[round]{natbib} \usepackage[numbers]{natbib} % pdf to eps package \usepackage{epstopdf}  \usepackage{epsfig} %% Numbered %\bibliographystyle{model1-num-names}  %% Numbered without titles %\bibliographystyle{model1a-num-names}  %% Harvard %\bibliographystyle{model2-names.bst}\biboptions{authoryear}  %% Vancouver numbered %\usepackage{numcompress}\bibliographystyle{model3-num-names}  %% Vancouver name/year %\usepackage{numcompress}\bibliographystyle{model4-names}\biboptions{authoryear}  %% APA style %\bibliographystyle{model5-names}\biboptions{authoryear}  %% AMA style %\usepackage{numcompress}\bibliographystyle{model6-num-names} %Interdection of alinea %\setlength{\parindent}{0pt} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%            Begin document        %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%   \begin{document}  % BibTeX users please use one of %\bibliographystyle{spbasic}      % basic style, author-year citations %\bibliographystyle{spmpsci}      % mathematics and physical sciences %\bibliographystyle{spphys}       % APS-like style for physics %\bibliographystyle{spr-chicago}      % Chicago style, author-year citations %\bibliographystyle{plainnat} %\bibliography{}   % name your BibTeX data base \bibliographystyle{plain} \bibliography{biblio}   % name your BibTeX data base  \end{document}

I've browsed the forums and found a number of posts that have addressed this issue, but none of the solutions seem to work for me. I have the following script that I just copied from the bibtex home page to get familiar with it. Instead of the citation number I get a question mark. I compile using Latex+Bibtex+Latex+Latex+PDFLatex+ViewPDF just as has been previously suggested and the problem persists.   \documentclass[11pt]{article} \usepackage{cite}  \begin{document}  \title{My Article} \author{Nobody Jr.} \date{Today} \maketitle  Blablabla said Nobody ~\cite{Nobody06}.  \bibliography{mybib} \bibliographystyle{plain} \end{document}   My bibliography (Bib.bbl)  @misc{ Nobody06, author = "Nobody Jr", title = "My Article", year = "2006" }    Looking at previous posts one thing that is concerning is that my .bbl looks empty as shown below. Further, I don't have a .blg  \begin{thebibliography}{}  \end{thebibliography}


I'm trying to insert a new section into my document, which should essentially just be a figure with a footnote (it's an image of a time plan for the project being worked on). However, when I use the code as shown below, the header appears, but then leaves an entire page open before inserting the image. I've tried making the image smaller, but with the parameters as shown below it should have MORE than enough space to fit in the required area. Any ideas?  \section{Project Timeline} Typetype \begin{figure}   \centering   \includegraphics[width=12cm]{TimePlan1}   \caption{The proposed project timeline}\label{TimePlan1} \end{figure}

Is there any package or a method to force LaTeX to keep floating environments like table and figure closer to where they are declared?


Problem : If the tangent at $(x_0,y_0)$ to the curve $x^3+y^3=a^3$ meets the curve again at $(x_1,x_1)$ then prove that $\frac{x_0}{x_1}+\frac{y_0}{y_1}=1$     We have tangent to the given curve at $(x_0,y_0)$ is $$xx_0^2+yy_0^2=a^3$$.     Since it passes through $(x_1,y_1)$, so we get $$x_1x_0^2+y_1y_0^2=a^3\tag{1}$$ Again, $(x_1,y_1)$ lies on the curve, so.   $$x_1^3+y_1^3=a^3\tag{2}$$.   How can I get the required result from above?


Run these two commands in Python:  print(int(822981260158260520/2)) print(int(822981260158260520//2))   The second one prints a correct answer but the first one does not. The difference is as big as 20. How did this happen? Is it a Python bug?

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


I found the source code like this. I am familiar with javascript anonymous function though,  what is :?  For example  When I call createOverlays function with argument, how can I make it ?   I am googling around about : but unable to find good explanation.  I might not understand the basic javascript structure.  Please give some hint.  var World = {     init: function initFn() {            this.createOverlays();     },      createOverlays: function createOverlaysFn() {          // some function     }, }     simply solved. I can pass the argument like this.   var World = {     init: function initFn() {            this.createOverlays(1);     },     createOverlays: function createOverlaysFn(arg) {          // some function          console.log(arg) //show 1     }, }

I'm learning JavaScript and while browsing through the jQuery library I see : (colon) being used a lot. What is this used for in JavaScript?   // Return an array of filtered elements (r) // and the modified expression string (t)    return { r: r, t: t };


I was wondering why connection is pronounced with C while concert is pronounced with K.

Is there a rule that would help me to learn when to pronounce the letter c as an "s" sound or a "k" sound?  For example:  - cat (kat)  - center (sinter)  Are there any rules, or is it all memorization?


I am trying to use printf in order to print the binary representation of a double onto the console. Here is the code that I have so far:  #include <stdio.h>  int main() {     double a = 4.75;     unsigned long long b = *(unsigned long long *) &a;     printf("Double a = %f (0x%x)" a, b); }   I also tried changing it from a long long to a long instead. Here is the result that I get from doing this in gcc linux:  Double a = 4.750000 (0x0)   I'm pretty sure since my system is little endian that it is only grabbing the first 32 bits which are all zeroes. However, I'm not sure how to fix this.   I thought it might have been because long is 64 bit in linux but after testing that I got the same result again. Maybe I'm printing it incorrectly? Not sure, let me know and thanks for your time.

When asking about , people sometimes refer to the strict aliasing rule. What are they talking about?


Find all pairs of natural numbers (m,n) satisfying  $2^{m}-3^{n}=1$   My attempt:       $$2^{m}-3^{n}=1$$ $\implies 2^m\equiv 1 \pmod3$ $\implies m=2k$  for some integer $k$. Hence, $$((2^{k})^{2}-1)=3^{n}$$ This implies,      $$(2^k-1)(2^k+1)=3^n$$ But, $(2^k-1,2^k+1)=1$ , this implies that one among $2^k-1$ and $2^k+1$ is equal to $1$. It is obvious that $2^k-1<2^k+1$.Therefore, $2^k-1=1$ and $k=1$. This gives, $m=2$ and $n=1$.$(m,n)=(2,1)$ is the only solution of $2^{m}-3^{n}=1$.Does this look alright? Are there any other solutions besides $(2,1)$. Also, does my solution look neat(I don't think it does)?

As we know $3^1-2^1 = 1$ and of course $3^2-2^3 = 1$. The question is that whether set $$ \{\ (m,n)\in \mathbb{N}\quad |\quad |3^m-2^n| = 1 \} $$  is finite or infinite.


What is a good book on lattice theory that is not complicated and can be used as an introduction to the subject (even long from the very basics to more advanced material)?

What would be your recommendation for the text which could be useful for someone starting with lattice theory? Suggestion for both books and online materials/lecture notes are welcome.    This was asked as a part of  and I did not like that it was combination of two different questions. (One of them on geometric modular lattices and the other one about text recommendation.)  I don't expect the user to post a follow-up question, since he was not seen at MSE for some time. I think that this could be a useful for some users here, so I've decided to post it myself.


I think I have made a rigorous and intuitive definition of discontinuity.     Definition: For a function $f(x)$ from $\mathbf{R}$ to $\mathbf{R}$, there is a discontinuity of $a$ at $x_0 \in \mathbf{R}$ if for all $\delta > 0$ around $x_0$; whenever $|x-x_0|<\delta$, there exists an $x$ such that $|f(x)-f(x_0)|$ $\geq a$    How much rigor is my definition?

I got stuck on this bit from Spivak's Calculus:  When proving that $f$ does not approach $l$ at $a$, be sure to negate the definition correctly: If it is not true that   for every $\varepsilon>0$ there is some $\delta>0$ such that, for all $x$, if $0<|x-a|<\delta$, then $|f(x)-l|<\varepsilon,$   then   there is some $\varepsilon>0$ such that for every $\delta>0$ there is some $x$ which satisfies $0<|x-a|<\delta$ but not $|f(x)-l|<\varepsilon.$    I don't understand why the negation of the top sentence is given by the bottom sentence. Thank you so much! EDIT My problem is not why "continuous functions are those that let you interchange limits". It's more just a question about how you can negate sentences in general.


My USB drive is refusing to unmount:  # umount /mnt umount: /mnt: target is busy   I believe this might be something to do with it catching up with disk caching, after some particularly intensive opperations.   Is there any way to determine if this is the case.  Ie: is there any way to determine why the target is busy? Assuming this is disk caching; Is there any way to find out how much is left to go, or get it to notify me when it's done?     I believe I caused this after a script speant approximately 10 hours replacing duplicate files with hard links, the 10 hours were spend removing duplicates not finding them.  Immagine this on loop:  rm "$DUPLICATE" ln "$BASE_FILE" "$DUPLICATE"   This has effectivly deleted 1.1 million files with a total of 300 GB space.  In short, I've just been hammering the file system, particularly it's meta data.

When running umount /path I get:  umount: /path: device is busy.   The filesystem is huge, so lsof +D /path is not a realistic option.  lsof /path, lsof +f -- /path, and fuser /path all return nothing. fuser -v /path gives:                    USER        PID ACCESS COMMAND /path:            root     kernel mount /path   which is normal for all unused mounted file systems.  umount -l and umount -f is not good enough for my situation.  How do I figure out why the kernel thinks this filesystem is busy?


I work for a company who, for sake of argument, are called Scottish Chickens.  When writing to our customers, should we write that "Scottish Chickens is planning to carry out work to improve the situation." OR should we write that "Scottish Chickens are planning to carry out work to improve the situation?   I prefer the latter but would appreciate your view on this.   Regards, GRL

I'd say Microsoft have a way of bending the rules and I know that McLaren have won the championship. While this sounds strange, I believe it is correct English (sorry, I'm not native).   But when it's a small company, would you still use it this way? Is a company always plural, or are small companies singular? I.e., would you say Bakery Johnson makes fine bread or Bakery Johnson make fine bread? Is it My book seller, Woody's, have moved or is it has moved?


If I placed 00 or 0 before digits values in array output become different.   int arr[][]=new int[3][2];     arr[0][0]=00;     arr[0][1]=01;     arr[1][0]=10;     arr[1][1]=0011;     arr[2][0]=0020;     arr[2][1]=21;     for(int a[]: arr){         for(int c : a){             System.out.println(c);         }      }   Output is : 0 1 10 9 16 21

This prints 83  System.out.println(0123)   However this prints 123  System.out.println(123)   Why does it work that way?


I have difficulty understanding dialogue in movies when the characters speak fast.  For example, I was watching The Lord of the Rings and became frustrated with my listening comprehension. I could not understand many sentences Gandalf said; when I turned on the subtitles there was not a word I did not know, but when he said it I just could not understand it.   This happens in other movies and even daily conversations. I tend to be better at catching the end of a sentence than the beginning. I’ve been in the UK for ten years now, so I don’t know what could be causing this, and since I don’t know its cause, I have no idea what to do to fix or improve it.  How can I improve my comprehension of rapid dialogue?

I have been learning English for many, many years now and think I have acquired quite some mastery. Yesterday I saw just another English (American) flick and thought it was a different language, but definitly not English. I had to turn the (English) subtitles on... :-(  Why is it so very hard to understand movies - and do you have a panacea to it?


I'm currently studying to pass the TOEFL test with a high score, but I have encountered a sentence in an app that I fail to see why it is correct: "The committee members resented the president's not informing them of the meeting." Can someone explain to me how the mentioned sentence works?

I assume that the following sentences are grammatically correct:   He resents your being more popular than he is. Most of the members paid their dues without my asking them. They objected to the youngest girl's being given the command position. What do you think about his buying such an expensive car? We were all sorry about Jane's losing her parents like that.   I'm still getting used to this possessive gerund structure. It sounded so weird to me at first. Is the structure used in both formal and informal contexts? Are there any alternative structures that result in the same meaning and are more frequently used? (Examples taken from )


Let $f:[a,b] \mapsto \mathbf{R}$ be a continuous function such that $f(x) \geq 0$ for all x $\in [a, b].$ Suppose $\int_a^b f = 0.$ Show that $f(x) = 0$ for all x $\in [a,b]$

Let $a < b$ and $f:[a, b] \rightarrow \mathbb R$ be a Riemann integral function. Suppose that $f(x) \geq 0$ for all $x \in [a, b]$. I want to show whether $\int_a^bf(x) = 0$ implies $f(x) = 0$ or not, but I'm not sure where to start. I don't know much about Riemann integral functions in general. I only know that $$\underline \int_a^b f= \overline \int_a^b f.$$ Also, I know the fact that if $f$ is continuous, then $f(x) = 0$ for all $x\in [a, b]$. Can anyone provide any hints for me, because I'm really confused about this whole thing.


So i've ran into what is probably a common issue when designing a page object model based framework. For this specific example I am using Cypress (So JavaScript) but the problem exists for all PoM based setups.  Currently the way I have designed the framework is by breaking large pieces of the page into "Page Components". These are children of the PageObject class (but just smaller). Typically they make up obvious chunks of the page (IE: A Login form would be it's own component, a Header would be a "Common" component", etc...)  Typically these components ONLY model the UI. So their methods are aimed at returning elements OR filling in inputs. IE: fillInEmail getLoginButton etc...  The actual PageObject for that specific page pulls in all the "Components" for that page and created public methods that the test scripts will use. For example Login() will use the LoginFormComponent fillInEmail/fillInPassword/getSubmitButton.click()/etc... methods. This abstracts the test scripts into readable/obvious functions. It also helps break up larger more complex pages.  The issue I have ran into is with large forms with multiple inputs. I see a few options of how I can handle it:   Create a method that takes an object (or fixture) in the Page Component for that Form (IE: the form itself is a component). The Page Component handles inputting everything and doing all the dirty work (IE: filling in/selecting/clicking based on the fixture/object passed). (This is what I am currently doing) The Page Component simply returns all the inputs as different methods (Keep in mind sometimes it can be 6-7+ inputs) and the Page Object handles all the dirty work within a public method (IE: filling in inputs/selecting/clicking based off the methods the Component passes to the page object). This would require sending an object/fixture in the test script itself for that method. Break the Form inputs into individual discrete methods (IE: one input is one page component). I think this is probably going to far and doesn't really do anything to abstract the page personally.   All of these feel not great. And despite me currently going with option #1...I don't like that either (As I am going against my own setup by handling larger behavior in the "PageComponents" which are really meant to just model the page.   It's also hard to figure out how to pass the data for the large amounts of inputs. I've been using an object but passing an object into the test script feels ugly. Any advice on handling this?

I've got a question about dealing  with huge PageObject. In the website that I'm currently testing there is a form with circa 50 inputs/dropdowns/selects.   In the current state my class got about 900 lines. It will be hard to debug, and in my opinion it's not so readable.   Is it consistent with the assumption of Page object model to create some subclasses and separate some WebElements and methods that are used by those elements? I'm using PageFactory so for declare all of the elements(I wrote circa 400 lines). It's so many.


In the book An Introduction to Error Analysis: The Study of Uncertainties in Physical Measurements by J. R.Taylor I find the following formula:    In LaTeX, does it exist any symbol for  shown above?

I know what my symbol or character looks like, but I don't know what the command is or which math alphabet it came from. How do I go about finding this out?


List<List<String>> lst = ArrayList..... Collections.sort(lst, (a, b) -> a.get(0).getSomeProp().compareTo(b..get(0).getSomeProp()));   Since the ArrayList is generic, how does this compile with type erasure?  Does it compile as:  List lst = .... Collections.sort(lst, (a, b) -> ((String) ((List) a.get(0))).getSomeProp().compareTo(((String) ((List) a.get(0)))));

I read about Java's type erasure .  When does type erasure occur? At compile time or runtime? When the class is loaded? When the class is instantiated?  A lot of sites (including the official tutorial mentioned above) say type erasure occurs at compile time. If the type information is completely removed at compile time, how does the JDK check type compatibility when a method using generics is invoked with no type information or wrong type information?  Consider the following example: Say class A has a method, empty(Box<? extends Number> b). We compile A.java and get the class file A.class.  public class A {     public static void empty(Box<? extends Number> b) {} }     public class Box<T> {}   Now we create another class B which invokes the method empty with a non-parameterized argument (raw type): empty(new Box()). If we compile B.java with A.class in the classpath, javac is smart enough to raise a warning. So A.class has some type information stored in it.  public class B {     public static void invoke() {         // java: unchecked method invocation:         //  method empty in class A is applied to given types         //  required: Box<? extends java.lang.Number>         //  found:    Box         // java: unchecked conversion         //  required: Box<? extends java.lang.Number>         //  found:    Box         A.empty(new Box());     } }   My guess would be that type erasure occurs when the class is loaded, but it is just a guess. So when does it happen?


$e^{i \frac{2\pi}{2} }=(e^{i 2\pi})^{1/2}=1^{1/2}=1$ where the last equality follows from $1*1=1$.  Meanwhile, $e^{i \frac{2\pi}{2} }=e^{i\pi }=-1$ by canceling out $2$.  How is this paradox related to the concept of branch in complex variable? Can some explain brach or branch cut in the context of this paradox? Thank you.

I know there must be something unmathematical in the following but I don't know where it is: \begin{align} \sqrt{-1} &= i \\\\\ \frac1{\sqrt{-1}} &= \frac1i \\\\  \frac{\sqrt1}{\sqrt{-1}} &= \frac1i \\\\  \sqrt{\frac1{-1}} &= \frac1i \\\\  \sqrt{\frac{-1}1} &= \frac1i \\\\  \sqrt{-1} &= \frac1i \\\\  i &= \frac1i \\\\  i^2 &= 1 \\\\  -1 &= 1 \quad !!? \end{align}


I have recently been reading that the next LTS version of Ubuntu will be using the Gnome desktop environment and not the unity one.   I am curious as to why they are stoping the unity desktop as it is very nice and user friendly and feels more natural (in my opinion) than the Gnome environment.

Similar to this question  and an fellow up on this one    What was the official reason by Canonical to axed the project when it was love by some many of their users and innovative?


I have a few subfloat captions that are too short to have an automatic linebreak, but I want to force one and still have centering among the lines:  Basically I would like a and b to be like c ...    How can I do it?  MWE:  \documentclass[12pt, twoside, titlepage]{report} \usepackage[demo]{graphicx} \usepackage{subfig} \usepackage{caption}  \begin{document}  \begin{figure}  \captionsetup[subfigure]{justification=centering} \centering \hspace*{-0cm}     \subfloat[$v=0$\newline$\omega = \omega_2$]{\includegraphics[scale =0.58]{"satspecK1".pdf} }%     \quad      \subfloat[general $v$\newline general $\omega$]{\includegraphics[scale =0.58]{"satspecK2".pdf} }%     \quad      \subfloat[$v = \pm (\omega_1 - \omega_2)/2k$\newline$\omega = (\omega_1 + \omega_2)/2$]{\includegraphics[scale =0.58]{"satspecK3".pdf} }%     \caption{}     \label{fig:Ksatspec}% \end{figure}   \end{document}

I found an asnwered question concerning this topic already here:  Copying \captionsetup[subfigure]{justification=centering} doesn't help me thought for I am using different packages.  I would like my Captions and Subcaptions to be justified as the text below. Just under my pictures. Any suggestions?  Thanks a lot  \documentclass{article} \usepackage{subfig} \usepackage[labelfont=bf, justification=justified]{caption} \usepackage[demo]{graphicx}% Remove demo option in real document  \begin{document}     \begin{figure} %   \captionsetup[subfigure]{justification=centering}     \centering       \subfloat[Subcaption one \newline including a linebreak ]   {     \includegraphics[width=0.2\textwidth]{image1}     }     \hspace{1cm}     \subfloat[Subcaption two \newline including a linebreak]     {     \includegraphics[width=0.2\textwidth]{image2}     }        \caption{Figure caption \newline with additional text right here} \end{figure}  \begin{center} This is correctly justified Text \\ including a longer linebreak than blabla. \end{center} \end{document}


I have data like this:  var currentValue="12345678901234561";   and I'm trying to parse it:  var number = parseInt(currentValue, 10) || 0;   and my result is:  number = 12345678901234560   now lets try:  currentValue="12345678901234567"   in this case parseInt(currentValue,10) will result in 12345678901234568  Can anyone explain me why parseInt is adding/substracting 1 from values provided by me?

Is this defined by the language? Is there a defined maximum? Is it different in different browsers?


While setting up a new laptop, I plugged in an SSD from an old computer, a 1TB Samsung 840 EVO 2.5" SATA III. This drive is rated for 540 MB read / 520 write according to Samsung.  At first it only benchmarked at 316/501, but after fiddling with my power settings and installing Samsung Magician and doing some optimization, speeds jumped up to 1509/1764, faster than I thought SATA drives were known to go.  After transferring some data and wiping the drive, now it's benchmarking at 7079/8159! This is over twice as fast as my NVMe SSD (Western Digital SN720 1TB), which is running at 3223/2772. What is going on here? My NVMe slots are PCIe3 so I suspect I can't get it much faster than it already is, but why is my SATA drive blowing it away?  Numbers given are from CrystalDiskMark Sequential Q8T1.

I recently bought a Samsung 840 EVO 500 gb solid state drive for my laptop. There's a feature (disabled by default) called RAPID (Real Time Acceleration Processing of I/O Data) Mode. From what I can tell, this mode will use more memory/RAM to facilitate better/faster read/write speeds. A white paper on this feature can be found .  What is RAPID mode? RAPID mode is paired exclusively with Samsung 840 EVO SSDs and available as a feature of the accompanying Samsung  SSD Magician Software Toolset (version 4.2 and later). When enabled, RAPID mode is inserted as a filter driver in the Windows storage stack. The driver actively monitors all  storage-related activity between and among the operating system, user applications and the SSD. The RAPID technology  analyzes system traffic and leverages spare system resources (DRAM and CPU) to deliver read acceleration through intelligent caching of hot data and write optimization through tight coordination with the SSD.  So is it really worth enabling this feature? I have 8 gb of installed memory on my laptop (max that I can install). Is it worth this trade off of using some memory to improve speeds?


Are you aware of any way to crop a geotiff while maintaining the co-ordinate information?  I am trying to crop a series of geotiffs of multi-beam data which have a black frame on one or two edges (in arcmap 10) which i can't remove, even setting the background colour to no colour does't work (it is set so that only the multibeam image is showing though).   Im not actually a 100% sure what the marks are, the data was worked in fledermaus to create DTM's and exported as geotiffs then to arc .    I've read the other entries about this problem but i not really confident on how to use gdal or code. I no longer have access to fledermaus so cannot re-edit etc.

Is there a way to trim a geo-referenced air photo to an irregularly shaped boundary?    I tried the clip tool shown in my attachment, but it didn't work.  It looks as though the output extent field requires a rectangularly shaped polygon as the clipping feature.    Can I even do this in ArcView?    I've never had a request to do anything like this before.        I do use Photoshop and other similar software packages.  I could just go in to an environment like this & start painting everything outside of my boundary in white, but then I would have to come back in and geo-reference the image again, and it just strikes me that there must be a faster and easier way (even though I only have ArcView 9.3).


I am really curious to know about the differences in the names of Community Wiki and Non-Community Wiki prevailing in Stack Exchange.  As I have known about what a Community Wiki is pretty much, I just specifically want to know the existence of Non-community wiki.   What is the reason behind its existence? What is the advantage that I get from it?   I have seen the term Non-Community wiki in the Badges area.  Bronze Badge -  You must have a total score of 100 in at least 20 non-community wiki answers to achieve this badge.   Silver Badge - You must have a total score of 400 in at least 80 non-community wiki answers to achieve this badge.   Gold Badge -  You must have a total score of 1000 in at least 200 non-community wiki answers to achieve this badge.  Hence so curious.

Some questions and answers are marked Community Wiki and are owned by a community wiki user:  (In fact, this very question is one of them)  Why have Community Wiki posts? How do Community Wiki posts work? How does a post become a Community Wiki post? How can the Community Wiki status be removed from a post? How can I find Community Wiki posts?


In The Lord of the Rings we can see that when Frodo wears the ring he becomes invisible. Same is the case for Bilbo. Also in entire Hobbit movie Bilbo became invisible whenever he wore the ring. But in the beginning of LOTR we can see Sauron wearing that ring and be still visible to all the elves and men.  Why is Sauron still visible after wearing that ring?  Is there any reference/reason of that mentioned in the book which is not mentioned in the movie?

When Sauron is shown killing Elendil and then being destroyed by Isildur he is clearly not invisible and he is wearing the Ring.  But any time Bilbo or Frodo put on the Ring they went invisible without fail.  Did the Ring change after Sauron was destroyed or is Sauron capable of controlling the rings power unlike anyone else?


I am working on a project using git, that has about 10 or 12 large binary files.  The files are essentially 3D models which will be brought together at the end of our project but during development we would like to keep them separate.    (This way each modeler can work on a specific model, and have previous versions of their model ignoring other people's work)  What is the best way to work on a project in this manner?  My concern is not the large file size of the models, my concern is how can there be a master repo that simply tracks each of the different models.  I would keep them separately entirely but different animators will be working on each of the models and so they need to be synced (they can't just be in separate repos) but I am not sure how to proceed.  Should I just use different branches for each model?

I am looking for opinions of how to handle large binary files on which my source code (web application) is dependent. We are currently discussing several alternatives:   Copy the binary files by hand.   Pro: Not sure. Contra: I am strongly against this, as it increases the likelihood of errors when setting up a new site/migrating the old one. Builds up another hurdle to take.  Manage them all with Git.   Pro: Removes the possibility to 'forget' to copy a important file Contra: Bloats the repository and decreases flexibility to manage the code-base and checkouts, clones, etc. will take quite a while.  Separate repositories.   Pro: Checking out/cloning the source code is fast as ever, and the images are properly archived in their own repository. Contra: Removes the simpleness of having the one and only Git repository on the project. It surely introduces some other things I haven't thought about.    What are your experiences/thoughts regarding this?  Also: Does anybody have experience with multiple Git repositories and managing them in one project?  The files are images for a program which generates PDFs with those files in it. The files will not change very often (as in years), but they are very relevant to a program. The program will not work without the files.


Suppose that the sequences $(f_n)$ and $(g_n)$ converge uniformly to respective functions $f$ and $g$ on some domain $S$. Can someone provide me with a counterexample (preferably with proof) of sequences $(f_n)$ and $(g_n)$ converge uniformly to $f$ and $g$ on $S$ but $(f_ng_n)$ does NOT converge uniformly to $fg$ on $S$.

Suppose that $\{f_n\}$ and $\{g_n\}$ are $2$ sequences of unbounded functions on $S\subset\mathbb{R}$ for infinitely many $n\in\mathbb{N}$ such that $\{f_n\}\to f$ and $\{g_n\}\to g$ uniformly. Does $\{f_ng_n\}\to fg$ uniformly? I think it is not possible but I couldn't think of a counter example.


I want to install ns2.35 on Ubuntu 14.04. When I implement this command:  $ sudo apt-get install tcl8.5-dev tk8.5-dev Reading package lists... Done Building dependency tree   Reading state information... Done E: Unable to locate package tcl8.5-dev E: Couldn't find any package by regex 'tcl8.5-dev' E: Unable to locate package tk8.5-dev E: Couldn't find any package by regex 'tk8.5-dev'   What should I do for resolving this problem?

When I try to install any package through the command line, I get an error.   $ sudo apt-get install <package> Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package <package>   Can anyone help me on this?


I'd like to be able to block internet access from my Android Pixel 4 cell phone. The ideal solution would prevent me from installing new apps onto my phone. I'd like to have a set of apps, so that I cannot add new apps, such as web browsers. I tried to set this up with Google Family Link, but it will still let you install apps that are rated E for everyone. I also tried this with AppBlock by blocking the app store, but I can download apps from play.google.com from my computer. I would appreciate any assistance in reaching towards a solution. A potential solution could be one that requires an administrator to have a password to install apps would be acceptable, because I can give that password to someone who isn't me. I'll note that one possible solution would be to stop internet access with my phone plan. But I'd still like to use the internet for apps like Uber, so that wouldn't work. Thanks!

My mom has an android tablet and she doesn't even know what a site is, her e-mail, or even the password of her facebook account. She's an average user. The internet is facebook in her eyes. She has no need for apps or anything, it's just, only, precisely facebook. All is facebook.  How can I completely disable installing apps in android so they can't be installed in any way or form, I mean, not by URL, not by clicking, not by app store, not even by another program. Just disable the entire thing altogether.  Doesn't need to be safe, have locks, passwords etc. I'm not trying to secure the device from intruders, attackers or robbers, I'm trying to secure it from its very own user.  Please help. I just had to remove two anti-virus apps that were opening adware pages when she tried to open facebook lite, and that's obviously a no-go, apps which she "had not installed." Clearly there's some voodoo going on here for them to just popup, or maybe she just did it unknowingly, but none of that's relevant. How can you just disable installs so this couldn't ever happen again?


I am new to blender, so I'm not sure of a lot of things but I'll try to explain the best I can. I haven't yet learned all the shortcuts yet, so I'm very reliant on the buttons on screen, and I've just lost some in the 2D animation tab. I must have missclicked, but I can't get them back, and none of the manuals mention how to make them leave or come back. I've lost the x-y-z coordinate plane, the zoom in and out button, the hand button I used to grab and move the canvas, and the camera button, which are in the top right corner. All of these are still in 2D Full Canvas tab, but I can't get them to reappear in the regular 2D animation tab. Thank you for any help!

In my recent project work, I did something that resulted in the disappearance of the 3D axis in the viewport of the "Layout" workspace, not only that all that four buttons(including zoom thingy, move, camera and projection buttons). I am not sure what lead to this. Weirdly, both 3D axis and 4 buttons exist in all workspaces except in "Layout".(screenshot attached) I googled to check the problem and found a similar issue caused using transform hotkey(). Although I didn't do anything similar. Is this a bug? How can I resolve this? Specs: OS: Ubuntu 20.04.2 LTS Type: Blender LTS Blender Version: 2.83.14 Missing 3D axis in viewport of Layout workspace  3D axis i am talking about, as u can see this appears in all other blender workspaces


I don't know why but double numbers in program are represented in some format, now exact precision. For example, number 34.3500 may be represented as something like 34.3500000001 or 34.3499998877..  So I have serious question, can double number with .0 at the end for instance 3500.0 be represented in program as something like 35499.99988..?  If you can, please prove your answer. It is very important.Thanks!

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


Does First Strike apply when two creatures fight, i.e when they have been targets of the Fight ability?

I was playing a game earlier and my opponent had a  that was a 4/3 and wanted to use a sorcery to fight  that was a 4/4.  We were wondering if the Channeler would die first because of First Strike? Or would it not be counted as it wasn't combat?


A kid is wearing shoes with velcro. So it wasn't sticking so the parent said:     It has come off/come undone. Lemme stick it for you.   And what about asking another person:     Come on stick it back on! (Velcro)   So should "come undone" or "come off" be used? And what about "stick"?  And if someone "unfastens" the velcro, then what will be used by the other person to describe this?     Why did you "unfasten" your velcro?   What will be a more natural way to express this?  Do they sound natural?

I know that the following word pairs exist:  button – unbutton tie – untie  Can we use an analogous process with the verb "velcro"?


Apt Update Indicator shows 10 available updates but Software Updater does not show them. Anyone knows why this happens? I know I can update through terminal, just curious as to why these updates don't show up in Software Update. Maybe I need to add a source in Software & Updates?  Before I ran Software Updater there were 14 updates available. After the update 10 updates remain, as you can see in the screenshot below.  I checked previous questions adnd there are a few similar cases available here but those don't seem to answer my question.

Ever since I upgraded to 13.10, the software updater does not show all the available updates. Some will appear and can be installed just fine, but once it claims that all software is up to date, using sudo apt-get upgrade shows that there are still more packages waiting to be updated. I can update them via the command line, but that only solves things temporarily. I'm not sure why some show up and others don't. How can I make Update Manager update all packages?  Update-manager shows this:    But apt-get shows this:   Thanks!


I'm trying to create my first cron job. I'm new to bash scripting too, although I do know some python. I am puzzled by the following:  Here is my cronjob file created with crontab -e:  */1 * * * * /home/darren/.bash_scripts/urxvt_colors.sh   Contents of urxvt_colors.sh:  #!/bin/bash  python  ~/.Py_Scripts/xr_random_colors.py xrdb ~/.Xresources   Here is what baffles me. So the python part of the cron job works python  ~/.Py_Scripts/xr_random_colors.py is executed every minute. This python script changes the color scheme in my ~/.Xresources file. I confirmed this actually happens by checking every minute. But xrdb ~/.Xresources does not update the file.  Running which python shows /usr/bin/python and which xrdb shows /usr/bin/xrdb. So since they are both executed from /usr/bin, how come only the python script executes?  Also if I run ./urxvt_colors.sh script manually from my terminal then it works as expected, the python script runs and so does xrdb ~/.Xresources  What's happening here?

Once upon a time,  DISPLAY=:0.0 totem /path/to/movie.avi   after ssh 'ing into my desktop from my laptop would cause totem to play movie.avi on my desktop.  Now it gives the error:   No protocol specified Cannot open display:    I reinstalled Debian squeeze when it went stable on both computers, and I guess I broke the config.   I've googled on this, and cannot for the life of me figure out what I'm supposed to be doing.   (VLC has an HTTP interface that works, but it isn't as convenient as ssh.)  The same problem arises when I try to run this from a cron job.


I am given a dictionary, whose keys are equal to function parameters and their corresponding values are the arguments for the function. Is there a elegant way to pass the values inside the dictionary to its respective parameter?  The code as written below is functional, however not very elegant, in particular, if the functions have many parameters and depending on the situation not all of them are needed. The code became then very repetitive and longish.  The most elegant way at the moment seems to be to simply wrap the repetitive, longish function in its own function, leaving my function f behind containing only nice, readable, self explaining code.  def f(func, d):     if func == "g1":         # g1(a= d['a'], b=d['b') # functional, but doesn't look nice         pass     elif func == "g2":         # g2(a2= d['a2'], b2=d['b2'], c2= d['c2']) # functional, but doesn't look nice         pass     elif func == "g3":         wrapper_for_g3(d)  def g3():     pass  def g1(a, b):     pass  def g2(a2, b2, c2):     pass  def wrapper_for_g3(d): #100 parameters, same problem as above     g3(a1 = d['a1'],          # ...        # ...        a100=d['a100'],        )  d1 = dict() d1["a"] = 1 d1["b"] = 2  d2 = dict() d2["a2"] = 2 d2["b2"] = 4 d2["c2"] = 8  f("g1") f("g2")

I'd like to call a function in python using a dictionary.  Here is some code:  d = dict(param='test')  def f(param):     print(param)  f(d)   This prints {'param': 'test'} but I'd like it to just print test.  I'd like it to work similarly for more parameters:  d = dict(p1=1, p2=2) def f2(p1, p2):     print(p1, p2) f2(d)   Is this possible?


Let $u(t):=t\log t$. This function is convex on $[0,+\infty)$ and $u(0)=0$. How can I prove that$$u(t+h)-u(t)\geq u(h)\quad\forall t,h\in[0,+\infty)?$$ Since $u(0)=0$ using convexity we know that $u(st)\leq s\,u(t)$, where $s\in[0,1]$ but i get confused with the inequalities.

Well If I've got a nice understanding, this proof involves the use of Rolle's and/or Mean Value Theorems. But I don't even an idea of how to start. We already know that  $$f\text{ concave}\Rightarrow f''<0$$ but, then...


I try to fill a multipage table using longtable environment. I need to put some data before table parts on every page. To do this I write  \multicolumn{9}{l}{\tabheader}\\ \hline % here i write header description\cr\hline 1&2&3&4&5&6&7&8&9\cr\hline \endfirsthead \multicolumn{9}{l}{\tabheader}\\ \hline 1&2&3&4&5&6&7&8&9\cr\hline \endhead   The macro \tabheader puts some data about table and it also should contain current page number.   As I understand, head in longtable creates only once and later just copies (like \copy0). How can I do such changed header? I can't put it into page headers because the beginning of table have some text before table header.

In a longtable, I list items of several categories, including some data on them.  \documentclass{article}  \usepackage{longtable}  \begin{document}  \begin{longtable}{lll} \hline \textbf{These are some items} & &\\ \hline \endhead \hline \endfoot \textbf{These are items of type A} & \textbf{Size} & \textbf{Price}\\ \hline Item 1 & 3 foot   & 3.56\\ Item 2 & 2 inches & 2.56\\ Item 3 & 5 inches & 1.50\\ \hline \textbf{These are items of type B} & \textbf{Weight} & \textbf{Price}\\ \hline Item A & 3 pounds & 10.50\\ Item B & 5 ounces & 6.95\\ Item C & 1 pound  & 3.00\\ \end{longtable}  \end{document}   What I would like to get is to change the running head whenever a new category is begun, so that if e.g. there is a page break between Item B and Item C, the header on the next line would read the "These are items of type B" line (so the columns are properly labeled).  Can this be done with longtable or any other "long table" package? I couldn't find information on this. (My google-fu is weak today...)


I encounter this long connecting line when plotting a GeoJSON linestring. How do I hide/remove this connecting line?  When I plot it in linestring:    When I plot it manually (slower than using linestring):    <Map   style={{ height: "400px", width: "100%" }}   zoom={1.5}   center={[     this.state.passes.coordinates[0][1],     this.state.passes.coordinates[0][0]   ]}   scrollWheelZoom={false}   maxBoundsViscosity={1.0}   maxBounds={bounds} >   <TileLayer url="https://{s}.tile.openstreetmap.org/{z}/{x}/{y}.png" />   <GeoJSON     color="red"     data={this.state.passes}     onEachFeature={function(feature, layer) {       layer.on("click", onLineClick);       layer.bindPopup(createPopupContent(feature));     }}   />   <Marker position={this.state.marker} icon={iconSatellite} /> </Map>

I am using  maps to create a representation of a round-the-world challenge. I would like to add a polyline which heads east from tokyo and then appears west of south america on the map - but instead I get a line which crosses the map in the opposite direction (see yellow line).    I think this is probably related to datelines and /or coordinate systems but am a bit sketchy on the detail. Can anyone explain the theory behind what I need to do to get this to work? I am using the bluemarble projection from Nasa:  var bluemarble = new L.TileLayer.WMS("http://demo.opengeo.org/geoserver/wms", { layers: 'bluemarble', attribution: "Data &copy; NASA Blue Marble, image service by OpenGeo", minZoom: 2, maxZoom: 5 });


Let's say that I want to say that I have just turned my pc off.  Which of these sentences is more commonly to be heard?        I have just turned my pc off.   I turned my pc off.

Could any one please explain the use of word " just " with present perfect ? I know that it's used to say that an action happened very recently, but I want to know what is the difference between placing and removing just from the sentence?  I think if want to remove it,  there must be a clear present relevance is that right ?  For example:     your friends have arrived.   or     you friends have just arrived.


I have a problem when I open phpmyadmin,  When I write myip.com/phpmyadmin  shows up instead of phpmyadmin login screen, please help.  I have tried reinstalling everything using   apt-get purge   then  apt-get install   But nothing worked. I think its Apache2 that is causing the problem. I really need this so please help thanks.

I have Xampp on Ubuntu 11.04. .php files are downloaded instead of parsed by Apache! How do I get Apache to parse them?


What is the approximation of pi in a fraction form. I am very curious to know what it is. I have been seeing pi almost everywhere.

Do you a digit efficient way to approximate $\pi$? I mean representing many digits of $\pi$ using only a few numeric digits and some sort of equation. Maybe mathematical operations also count as penalty.  For example the well known $\frac{355}{113}$ is an approximation, but it gives only 7 correct digits by using 6 digits (113355) in the approximation itself. Can you make a better digit ratio?  EDIT: to clarify the "game" let's assume that each mathematical operation (+, sqrt, power, ...) also counts as one digit. Otherwise one could of course make artifical infinitely nested structures of operations only. And preferably let's stick to basic arithmetics and powers/roots only.  EDIT: true. logarithm of imaginary numbers provides an easy way. let's not use complex numbers since that's what I had in mind. something you can present to non-mathematicians :)


Since a few days ago I've been observing some strange recurrent outgoing UDP traffic from my server on port 24441 but since it's not constant, I cannot seem to find what's causing it.  All I can see is the following in iptables logs:  Nov 15 00:46:33 server kernel: [17216276.676673] Firewall: *UDP_OUT Blocked* IN= OUT=eth0 SRC=<SERVER_IP> DST=5.9.124.53 LEN=192 TOS=0x00 PREC=0x00 TTL=64 ID=0 DF PROTO=UDP SPT=60641 DPT=24441 LEN=172 UID=501 GID=513   I suspect it's some kind of malware running periodically from my server but want to find out what exactly. Can someone shed a light on how to catch this/log the source of this automatically when it happens? I'm running Centos 6.7. Thanks!

My machine is continously making udp dns traffic request. what i need to know is the PID of the process generating this traffic.  The normal way in TCP connection is to use netstat/lsof and get the process associated at the pid.  Is UDP the connection is stateles, so, when i call netastat/lsof I can see it only if the UDP socket is opened and it's sending traffic.  I have tried with lsof -i UDP and with nestat -anpue, but I can't find wich process is doing that request because i need to call lsof/netstat exactly when the udp traffic is sended, if i call lsof/netstat before/after the udp datagram is sended is impossible to view the opened UDP socket.  Call netstat/lsof exactly when 3/4 udp packet is sended is IMPOSSIBLE.  How I can identify the infamous process? I have already inspected the traffic to try to identify the sended PID from the content of the packet, but is not possible to identify it from the contect of the traffic.  Anyone can help me ?  I'm root on this machine FEDORA 12 Linux noise.company.lan 2.6.32.16-141.fc12.x86_64 #1 SMP Wed Jul 7 04:49:59 UTC 2010 x86_64 x86_64 x86_64 GNU/Linux


I have a Galaxy S4 and I have issues running Pokemon Go.  It will not login using data, only wifi. So I connect on wifi at home, then go out and switch to data. It is fine.   But if the game needs to be restarted, it just gets hung on the google account login. It only works on wifi to get into the game.  Possibly related/unrelated: incense and lures do not work. People see stuff at lures, but I never do. They just do not work for me for some reason.

It connects to Pokemon Go via wi-fi perfectly fine, but when I try and connect to Pokemon Go via 3G it just gets stuck at the first bar on the loading screen with the eventual pop up saying "Failed to get player information from the server." My 3G connection works perfectly fine with every other app I have, and has been easily able to stream HD videos so I can't see connectivity with 3G being an issue.   It makes even less sense as once connected via wi-fi, the game easily continues to operate via mobile data once I leave the house. However once the app crashes (which it usually does after 15-30 minutes) I try to reload it on mobile data and it gets stuck on the loading screen. If I can find a local free wi-fi spot nearby I can re-connect easily, and then move back onto mobile data.  I've tried removing and reinstalling Pokemon Go and that didn't work. I also reset all my app preferences on my phone and that didn't work.  Not sure if this helps, my phone is a Huawei P8, Android version 5.0.1.  I signed up to Pokemon Go using my Google account.


I'm trying to undertsand what Serialization and De-Serialization means in Java.  I guess every thing we write in Java language becomes set of bytes when code gets compiled and goes to processor to get execute. After compilation, every thing is turned into machine language or bytes. Correct ..?  So object creation is already a set of bytes which sits in memory to be worked, then what does Serialize and Non-Serialize terms do special to object .. ?  I'm not clear to imagine these two terms in computer hardware..!  Can anyone help ..?  Thanks

What is meant by "object serialization"? Can you please explain it with some examples?


Given a List containing filenames, I would like to be able to have the number of potential duplicates of a file. A duplicate is defined as a file whose name is either equal or match the naming convention basename(number).extension .  The first step would be to be able to assert whether a filename matches some pattern. I thought I could do it with a regex. Here it is :      String basename = "file1";     String extension = "txt";     String patternExpression = "^%s(\\(\\d+?\\))??\\.%s$";     Pattern patter = Pattern.compile(String.format(patternExpression, basename, extension));     assert pattern.matcher("file1.txt").find() : "file1.txt should match";     assert pattern.matcher("file1(2).txt").find() : "file1(1).txt should match";   In this code sample, the assertions will pass. The problem with this approach happens when the basename contains some characters interpreted by the Regex compiler. I would like to tell the regex compiler to match exactly the basename and to not interpret it.  1) Is that possible ? 2) Isn't there a way to do that more easily ? I feel like there must be an easy way that I'm completely missing...  Thanks for the help !

Does Java have a built-in way to escape arbitrary text so that it can be included in a regular expression? For example, if my users enter "$5", I'd like to match that exactly rather than a "5" after the end of input.


I have written a very simple script which takes a string as input and replace the input text in a file via sed. But I get an error always   sed: -e expression #1, char 40: unknown option to `s'   Shell script is as below  sed -i "s/c9/$1/g" Test.java    and to run  ./code.sh "lmc.driver.findElement(By.xpath(\"//*[@id=\\\"login-email\\\"]\")).clear();\n                        lmc.driver.findElement(By.xpath(\"//*[@id=\\\"login-email\\\"]\")).sendKeys(username);\n                        lmc.driver.findElement(By.xpath(\"//*[@id=\\\"login-password\\\"]\")).clear();\n                        lmc.driver.findElement(By.xpath(\"//*[@id=\\\"login-password\\\"]\")).sendKeys(password);\n                        lmc.driver.findElement(By.xpath(\"//*[@id=\\\"loginForm\\\"]/div[3]\")).click();\n                        lmc.driver.findElement(By.xpath(\"//*[@id=\\\"login-identity-domain\\\"]\")).clear();\n                        lmc.driver.findElement(By.xpath(\"//*[@id=\\\"login-identity-domain\\\"]\")).sendKeys(tenantId);\n                         lmc.driver.findElement(By.xpath(\"//*[@id=\\\"loginBtn\\\"]\")).click();"

I have a script that reads a text stream and generates a file of sed commands that is later run with sed -f. The generated sed commands are like:  s/cid:image002\.gif@01CC3D46\.926E77E0/https:\/\/mysite.com\/files\/1922/g s/cid:image003\.gif@01CC3D46\.926E77E0/https:\/\/mysite.com\/files\/1923/g s/cid:image004\.jpg@01CC3D46\.926E77E0/https:\/\/mysite.com\/files\/1924/g   Assume the script which generates the sed commands is something like:  while read cid fileid do     cidpat="$(echo $cid | sed -e s/\\./\\\\./g)"     echo 's/'"$cidpat"'/https:\/\/mysite.com\/files\/'"$fileid"'/g' >> sedscr done   How can I improve the script to ensure all regex metacharacters in the cid string are escaped and interpolated properly?


It is found in my apartment in Finland. I had to kill it to stop it from getting away before looking for the camera, but it looked pretty much the same alive and intact. It's length is about half a centimeter, and the younger ones look darker. It is often found in dark. Since their appearance, I often notice red and slightly itchy bug bite in the morning. The question is what is this insect?

I am in Portugal (Lisbon) at the moment, and when leaving my room late at night (12 pm ~ 04 am) I usually face about 4 of these arthropods in the corridors:    (For reference, the "line" in the image is a standard separation on the floor. This particular example of the animal is a little smaller than a nail.) They seem to have quite variable sizes and walk primarily on ground. Also, as implicit above, they seem to be active primarily during the late night. (I don't see them much often, if at all, during the morning/afternoon.) They can be quite fast, but if left unharmed do not move much. They also appear to take shelter inside the walls.  From what I searched, it seems possible that they are centipedes. I've seen sites saying that they are useful to keep other less pleasant animals at bay. My questions are: What are those animals, and should I leave them be or not?


If $S$ is a compact subset of $\mathbb{R}$ and $T$ is a closed subset of $S$, then $T$ is compact.     How can I show this using the definition of compactness, and separately showing this by the Heine-Borel theorem.

Is there a way to prove this using sequential compactness instead of open cover definitions?  My first gut reaction was that the fact was obvious since we can show that the closed subset $[a,b]$ is compact in $\mathbb R$.


For example:  I have 5 devices in my LAN, on one of them I request http://superuser.com, the server responds and the 'answer' gets to my home router (gateway), but from there, how does it know which device made the request?   Is there any information added to the package sent over the internet that identifies my computer within my LAN?  I figured maybe by MAC adress but I heard that MAC adresses don't pass outside your router onto the internet.

HTTP servers usually operate at port 80. Yet NAT routers as most are these days assign port to outgoing requests so they would know when request is returned that which computer connected to it, it's suppose to be. They do it cause they can only use one public IP even though all computers behind router are given public IP address they are local IP address. Meaning they only work for everyone behind that router.   So how does server handles this. It only works at port 80, and router sends at whatever ports it wishes to do based on what is available and how it is programmed.   My understanding:   Computer A to router. 22.22.22.22.22:80 Router to World: 12.68.191.1.102:1 -ISP given IP address:Port to distinguish between computers connected to it.   Now what  Or maybe there is a difference between port and source port.


I tried experimenting with volume nodes in blender but none of then seem to work. Every node just produces a rough volume cube. This includes for every type of volume node like Principled Volume, Volume Scatter etc.

So I was in the middle of making a ball-shaped smoke, but the volumetric effect didn't work following the basic shape. It remains cube in Eevee Blender 2.8; while in Cycle it works, but in Cycle it takes thousands of years for Render.


I accidently ran chown myname /usr -R and now the login screen won't show up! I have tried various things in the root terminal, but nothing works. What can I do?

I stupidly ran sudo chown -R carlos:carlos / and carlos is my user. This changed all files to be Carlos and I could not boot up again (because the root files were now owned by #1000) and I cant get sudo acess in live cd (because the owner of /usr was changed to my user). Can anyone help me? FYI I have mounted my hard drive.


I want to trim the figure caption to show part of the caption, say the first sentence. In the same time, I do not want to cut from the actual caption in the document itself. I need the full explanation of the figure but not in the list of figures. How to achieve this?  This is the script sample:  \documentclass{book}  \begin{document}  \tableofcontents \listoffigures  \chapter{(Chapter Name)}  \section{Real Analysis} \begin{figure} \caption{A very long figure caption here. I need to display part of it because this very long caption does not look right in the list of figures. Nevertheless, I need this full description in the caption. I just do not want all of it to appear in the listoffigures} \end{figure} \section{Role of LUB Axiom}   \end{document}  This is what it appears int he list of figures.

When I use \listoftables and \listoffigures I get in the list long captions that appear next to the tables/figures.  I would like to use short captions for this list which summarize these captions. Is that common to do? If so, what is one way to do it?


I asked a question on Stack Overflow () but received no answers. I offered a bounty of 50 reputation but still received no answers. I would like to raise the bounty to 100, but can't figure out how. Can someone provide a way to do this?  I looked at the blog  provided by some answers to a similar question, but it doesn't detail exactly how to raise the bounty.   Could someone provide a simple approach to raising the bounty or tell me if it's not possible at all?

It's possible to offer and award bounties of reputation on questions.   What is a bounty? How can I find questions that have a bounty attached? How do I start a bounty? When can I start a bounty? Why is the system requiring me to choose a bounty amount that's higher than the minimum? Can I use Markdown formatting in the bounty remarks? Can I edit the remark? How long is the bounty period? How do I award a bounty? Can I award a bounty to my own answer? Can I award a bounty to an old answer? If I offer a bounty on someone else's question, can I award the bounty to their answer? After awarding the bounty, can I remove it or move it to another answer at a later time? What happens if there's no answer after the bounty period? What happens if I feel my question is still unanswered? What is automatic awarding? Are bounty awards exempt from the 200 points/day reputation limit? How does Community Wiki mode affect bounties? How does user deletion or post dissociation affect bounties? Can I award a bounty to an answer from a deleted user or one where the author was dissociated? Can I offer a second bounty after the first one has expired? Can I raise my bounty? What happens if a bounty question is closed or deleted? Why can't I vote to close or migrate a bounty question? What happens if I delete my account while I have an active bounty? Do I keep an awarded bounty when I delete my answer? What happens if a question where I awarded a bounty later gets deleted or migrated? Can I cancel my bounty? Can I affect / divide / share part of my bounty to two (or more) users? How many outstanding bounties can a single user have?      See also:  in the Help Center


We are on the verge of rolling out 'Essen' 2.14.  Our IT people are reluctant to roll out QGis with the ‘Advanced’ tab being available in ‘Settings’ > ‘Options’ > ‘Advanced’  Does anyone know of a way to remove it?

I'm creating a deployment package to update QGIS from V2.8 (wien) to V2.14 (essen (LTR)).  In QGIS 2.14 there is a new "Advanced" section under "Settings > Options", see screenshot:     Can this menu item be removed from the Options menu?  I don't want to completely disable the "Options" menu as it is used, however I don't want the users access this advanced set of options.


I want to know what are the units of measurement (of length) in tikz are available. I know that pt, in, mm like units are available , but what more are allowed in tikz?   I work sometimes with qss language and with px like units (in tikz this causes illegal unit of measurement).

I know there are different ways of expressing sizes or dimensions in LaTeX such as points (pt), inches (in) and ex.  As some commands, such as \hspace , I would like to have a reference or complete list of possible dimensions or sizes including a description of what they mean.


There is an existing question  4 years old about a post a year prior, that focuses on a post containing the word(s) 'accept', 'accepted' and/or 'accepting' I do not believe this is the same.  I am a 10k+ user on a beta site, saw a new post that was not a good fit, down voted it, voted to close and left a comment while the view count was at 2.  I moved on.     The OP posted a comment and I came back when I got the notification.  The comment contained profanity and I flagged it as Rude, and the comment instantly disappeared (screen shot above is after it disappeared)  I looked at the  and it does not seem to be a documented feature.    How did a non-admin delete a comment with a single flag?

I posted a comment on the . My comment was:  You will have to work on your [accept rate](http://meta.stackexchange.com/questions/5234/how-does-accepting-an-answer-work). Currently it's catastrophic. Zero as in a singularity inside a black hole.  This comment was deleted by someone. I would like to know if showing users that don't know how to accept answers is considered as a bad thing so that I stop doing it or if not why would my comment have been deleted and do only moderators are InRole to delete comments.


Lets say I have two active directory groups:   Database_RO Database_WO   Database_RO is granted DataReader rights. Database_WO is granted DataWriter rights.  If a user is a member of both AD groups, is the user granted both DataReader and DataWriter rights?  I believe SQL will combine granted rights rather than going with the most restrictive, unless there is a explicit deny.   Correct?  Current SQL Server is 2012.   Will soon be migrating to 2016.  This question adds a corner case to the question it duplicates (two mutually exclusive AD groups rather than one group simply possessing additional rights), but the answer to that question answers that arrangement as well.

I'm trying to wrap my head around how SQL Server decides to grant certain rights based on a users login privileges.  If a user is part of a group "READ ONLY" which has access to DB1, but they are also a part of a group "SysAdmin" which has full db owner rights to the same DB1, which rights are they given when they log in?  On a similar note. What if they are part of a group but also have a standalone account with other middle of the road privileges?


i wanted to make eyes similiar to robot in image.I tried intersect face with another cylinder but while adding sub surface modifier the mesh distorts

Whenever I try to cut out a circular hole in either a cylinder or sphere the polygons around the circular hole always have distorted normals after smoothing. Is there anyway to fix this. I've tried using the remesh modifier but wind up with some pretty ugly results.


Hello fellow Stackoverflowers,  How do I print out the numbersArray so that I can see the numbers?  When I sysout the numbersArray, it shows me:  [I@677327b6  [I@677327b6  Thank you for your time and help!  package AlgoExercises;  public class InsertionSort {    static int[] numbersArray = { 5, 2, 4, 6, 1, 3 };    static void swap(int a, int b) {     int temp = a;     a = b;     b = temp;     // a and b are copies of the original values.     // The changes we made here won't be visible to the caller.   }    static void insertionSort(int[] numbersArray) {     for (int i = 1; i < numbersArray.length; i++) {       int j = i;       while ((j > 0) && (numbersArray[j] < numbersArray[j - 1])) {         swap(numbersArray[j], numbersArray[j - 1]);         j = j - 1;         System.out.println(numbersArray);       }     }   }    public static void main(String args[]) {     insertionSort(numbersArray);   } }

In Java, arrays don't override toString(), so if you try to print one directly, you get the className + '@' + the hex of the  of the array, as defined by Object.toString():  int[] intArray = new int[] {1, 2, 3, 4, 5}; System.out.println(intArray);     // prints something like '[I@3343c8b3'   But usually, we'd actually want something more like [1, 2, 3, 4, 5]. What's the simplest way of doing that? Here are some example inputs and outputs:  // Array of primitives: int[] intArray = new int[] {1, 2, 3, 4, 5}; //output: [1, 2, 3, 4, 5]  // Array of object references: String[] strArray = new String[] {"John", "Mary", "Bob"}; //output: [John, Mary, Bob]


During the Battle of Hogwarts, Voldemort found that the Elder Wand, which he had taken from Dumbledore's tomb, was not working as impressively as he had hoped. Believing that this was because Snape had its allegiance after killing Dumbledore, Voldemort had Nagini kill Snape.   When he and Harry faced off shortly afterwards, Harry corrected him: since Draco had disarmed Dumbledore, he was the true master of the Elder Wand, not Snape. When Harry disarmed Draco in Malfoy Manor,he was having a different wand in his hand.    Then how the Elder Wand's allegiance shifted to Harry Potter ? In case the Elder Wand's allegiance shifted to Harry potter,  when Voldemort used killing spell on Harry at forbidden forest, the wand's  allegiance should have shifted to Voldemort. Why didn't the Elder Wand's allegiance shift to Voldemort?

I've read the question  and learnt that even Stealing the Elder wand makes a person owner of it.   Then why didn't Voldemort become the owner of elder wand even though he stole it from the tomb of Dumbledore, I know that Harry Potter was the owner of elder wand at the time Voldemort broke into Dumbledores tomb. Even though stealing is stealing.


We are polling respondents every month and asking a couple of questions about the number of times they eat certain foods.   We have significant loss to follow up every month but generally retain 20% - 30%.  For the participants who stay engaged and respond across the months, I understand we use the paired t-test.   My question is what test would be appropriate to use to compare between two months say for example comparing a june & july sample which contains some folks in june who dropped out in july, some folks who answered for both june and july, and some new randomly selected folks who were added in july?   I've read through previous posts but cant get whether using the paired test is really appropriate. THANKS!

An investigator wishes to produce a combined analysis of several datasets.  In some datasets there are paired observations for treatment A and B.  In others there are unpaired A and/or B data.  I am looking for a reference for an adaptation of the t-test, or for a likelihood ratio test, for such partially paired data.  I am willing to (for now) to assume normality with equal variance and that the population means for A are the same for each study (and likewise for B).


Given a contiguous subset of a chessboard (or, more general, a 2d rectangular grid), how can I algorithmically determine a minimal set of rectangles covering the area?    In this example, the "contiguous subset" is the black area, and I am interested in the three red rectangles. There should be no overlap between the rectangles. The relative sizes of the rectangles is not too important; it would be a bonus if the sizes weren't too different.

I've got a specific problem which I'll try to describe as clearly as possible.   I have a defined rectangular region on a cartesian plane, and within that region there are other given rectangular sub-regions that are described in terms of their 4 vertices, ie {(x1, y1), (x1, y2), (x2, y1), (x2, y2)}, so that these regions form 'occlusions' on the plane. These regions don't overlap, but they can form more complex polygons when different-sized rectangles adjacent to each other appear joined.  here's an illustration:   I am interested in the space between these shapes, and how to define the space in the same way the occlusions are defined, that is as a set of rectangles. In particular I want the definition optimised so that the space is described using the smallest possible number of rectangles. For example, an incomplete rendering might look like this:   Can anyone suggest a way forward with this? How can I have the original set of vertices (describing the black rectangles) generate the 'complementary' set of vertices (red rectangles) such that the number of red rectangles is minimal?  I suspect it's a variation of a 'packing problem', but I have a feeling it might be fairly simple...


Any ideas why there's no pictorial representation of facial expression (emoticon) in Stack Exchange chat? I'm just wondering.  I believe it's so cute to have this feature. :)

A lot of mention has been made of the seriousness of Stack Overflow (and presumably Server Fault). Would it be a good idea to turn  :-) into actual images as per  in questions and answers?


Prove or disprove: If $a_0, a_1,\ldots,a_n \in R$ satisfy $\frac{a_0}{1}+\frac{a_1}{2}+\cdots+\frac{a_n}{n+1}=0$, then exists $x\in(0,1)$ such that $a_0+a_1x+\cdots+a_nx^n=0$   Let's define f(x)= $a_0+a_1x+a_2x^2+\cdots+a_nx^n$  If I check the limit of f(x) as $x\rightarrow 0$ I get $a_0$.  The limit of f(x) as $x\rightarrow 1$ is $a_0+a_1+a_2+\cdots+a_n$  I'm not sure if I can use the IVT to claim there exists a solution since I'm not sure if $a_0\gt0$ or $a_0+a_1+a_2+\cdots+a_n \gt 0$  Assuming I do need to use the IVT, can I split it up into different cases? i.e. four cases, one when $a_0\gt0$ and $a_0+a_1+a_2+\cdots+a_n \gt 0$, one with $a_0\lt 0$ etc.  Is there another concrete way to prove this?

Knowing that $$ \frac{a_0}{1} + \frac{a_1}{2} + \frac{a_2}{3} +\cdots + \frac{a_n}{n+1} =0$$ Prove that  $$ a_0 + a_1x + a_2x^2 + \cdots + a_nx^n = 0$$ has at least one real solution.  I suspect that it's proven with the intermediate value theorem. But can't find two numbers that satisfy it.


In the first of these lectures () given by M. Freedman he says that there exists (compact metric) spaces $X$ and $Y$ such that $X\times S^{1}$ is homeomorphic to $Y\times S^{1}$ but $X\times \mathbb{R}$ is not homeomorphic to $Y\times\mathbb{R}$.  Does anyone know an example of such spaces?

This question came up in a recent video series of lectures by Mike Freedman available through Max Planck Institut's website. He proves the "difficult" converse direction, that $X\times \mathbb R\cong Y\times \mathbb R$  implies $X\times S^1\cong Y\times S^1$ using a subtle "push-pull" argument, when $X$ and $Y$ are compact. He goes on to make the remark that the converse holds in the simply connected case by taking universal covers, but it is not obvious in general and there may even be a counterexample. So my question is whether anyone has any ideas about this question. Maybe someone can spot a counterexample in the non-simply connected case?  Edit: Here's a link to the . If I recall correctly, the push-pull argument is in the first video.


Let $\left\{ f_{n}\right\} _{n=1}^{\infty}$ be a sequence in   $L^{p}\left([0,1]\right)$ for $p\geq1$. Suppose that there exists   $f\in L^{p}\left([0,1]\right)$ satisfying   $\lim_{n\rightarrow\infty}\int_{0}^{1}f_{n}\left(x\right)g(x)\  dx=\int_{0}^{1}f(x)g(x)\ dx$ for any $g\in L^{2}\left([0,1]\right)$.   Prove that if $\lim_{n\rightarrow\infty}\|f_{n}\|_{p}=\|f\|_{p}$, then   $\lim_{n\rightarrow\infty}\|f_{n}-f\|_{p}=0$.   I don't know how to approach to this question. Weak convergence does NOT imply the subsequence convergence. And I expanded $|f_{n}-f|^{p}$ but nothing I can obtain. Can anyone help me?

Having trouble with this problem. Any ideas?  Let $\Omega$ be a measure space. Let $f_n$ be a sequence in $L^p(\Omega)$ with $1<p<\infty$ and let $f \in L^p(\Omega)$. Suppose that $$f_n \rightharpoonup f \text{ weakly in } \sigma(L^p,L^{p'})$$ and  $$\|f_n\|_p \to \|f\|_p.$$  Prove that $\|f_n-f\|_p \to 0$.  Also, can you come up with a counter-example for the $L^1$ case?


Sometimes after I visit a wrongly inputed page more than once, Chrome will weirdly store it in the autocomplete bar from the location form (address bar? the one get focused when you click CMD+L on Mac).  What can I do to remove one from the list? Here in the red outline is the one I want to remove.

Ok... so this is embarrassing.  I typed in "boobs" on EncyclopediaDramatica's search because, well, it's a really funny page.  But now I've got a problem... EVERY TIME I click a search field in Chrome now, it shows "boobs" as the first suggestion in the drop down!  This is not really socially acceptable as this laptop goes with me everywhere and Chrome is my primary browser.  Is there a way I can isolate and remove just that one entry?


I am new to C++, I was trying to deallocate an object with different ways. Here is my code:  class foo{ public:     int* bar;      foo(int N){         bar = new int[N];     }      ~foo(void){         delete[] bar;     } };  int main(int argc, char* argv[]){     foo* F = new foo(10);     delete F;     return 0; }   This works perfectly, but if I write main like this:  int main(int argc, char* argv[]){     foo F = foo(10);     F.~foo();     return 0; }   I will end up with an "glibc detected". I guess I should somehow deallocate the "bar" pointer since it was allocated during construction.  Thus my question is how can I deallocate an object like this? Thanks.

In practice with C++, what is , what are , how are these implemented in a program and what are the benefits of using RAII with smart pointers?


Let's say I have a List of the following:  a b c d e f g h i j k   Now I want to split this into, let's say two parts.  There are 11 items in the list, so the first sublist would contain 5 items, and the second sublist would contain 6 items.  How would I go about to achieve this result?

Is there any way I can separate a List<SomeObject> into several separate lists of SomeObject, using the item index as the delimiter of each split?  Let me exemplify:  I have a List<SomeObject> and I need a List<List<SomeObject>> or List<SomeObject>[], so that each of these resulting lists will contain a group of 3 items of the original list (sequentially).  eg.:   Original List: [a, g, e, w, p, s, q, f, x, y, i, m, c] Resulting lists: [a, g, e], [w, p, s], [q, f, x], [y, i, m], [c]   I'd also need the resulting lists size to be a parameter of this function.


How can I get a big N like the one below?

I know what my symbol or character looks like, but I don't know what the command is or which math alphabet it came from. How do I go about finding this out?


I am creating a static class that is used to asynchronously wait for some T targetValue to be "approximately" some T currentValue. I have already implemented a function to check for exact equality as shown below, but I am having a difficult time with an "approximate value"  public delegate T GetValueMethod<T>() where T: struct;  public static Task<Boolean> WaitForExactValueAsync<T>(GetValueMethod<T> getValue, T targetValue, CancellationToken cancelWaitToken, int msTimeout = 10000) where T: struct {     return Task.Run<Boolean>(async () =>     {         // Create a CancellationToken that times out, then link it with the argument token that requests a the wait to be cancelled         var timeoutTokenSource = new CancellationTokenSource(TimeSpan.FromMilliseconds(msTimeout));         var timeoutAndCancelTokenSource = CancellationTokenSource.CreateLinkedTokenSource(timeoutTokenSource.Token, cancelWaitToken);          // Continually check to see if we reached the target value or have timed out         T currentValue = getValue();         while (!targetValue.Equals(currentValue) && !timeoutAndCancelTokenSource.IsCancellationRequested)         {             try { await Task.Delay(500, timeoutAndCancelTokenSource.Token); }catch (Exception ex) { }             currentValue = getValue();         }          // If we got here and the token is not cancelled that means we have reached the target value         return !timeoutAndCancelTokenSource.IsCancellationRequested;     }); }   The methods I am creating are meant to only work with primitive types such as int, double, Boolean, etc. I do this by implementing  which describes a way to limit generic types to primitives by forcing the T to be a struct.   The function above seems to work nicely for my situation because (I think) we can always equate struct with Equals to determine equality. My issue when creating the approximately equal version is when the type of T is something like Boolean.   I plan to allow the user to pass in a "closeness" percentage to the function to specify when the two values are "approximately equal" (If the current is within x percentage of the target return true). If T is a numeric value I can do this with maths easily, but when its non-numeric it makes no sense to use this method but to simply use Equals.  Is there a way to tell from T (where T : struct) if I can perform the maths I need to on it (To implement the IsValueClose method below)?  private static Boolean ValueIsClose<T>(T target, T value, double percentAsDecimal)    where T: struct {     // if(value.CanDoTheMaths)     {         return Math.Abs((value / target) - target) <= percentAsDecimal;     }     // else     {         return target.Equals(value);     } }   Furthermore once this happens how can I refer to target and value as a type that can perform these maths?  From asking somewhat relate questions before I do not think this is quite possible or good practice for generic methods. So from what I can currently tell, my only good solution is to make an "approximate" method for each type I plan to use (the best practice), or to check the Type of T in IsValueClose to see if it is something that I know I can do maths on and go from there (Bad practice for generics).   Though possibly there is a simpler more elegant solution that someone could suggest?

Can anyone tell me if there is a way with generics to limit a generic type argument T to only:   Int16 Int32 Int64 UInt16 UInt32 UInt64   I'm aware of the where keyword, but can't find an interface for only these types,  Something like:  static bool IntegerFunction<T>(T value) where T : INumeric


Please see . The poster uses the word lemon in the last sentence. I understand in a general sense that this is being used to indicate something bad or more specifically of inferior quality.   Indeed, Roget's Thesaurus : failure, flop, junk, reject, and piece of junk.  It will be interesting to know how lemon came to mean an inferior quality.   As shown , it might have something to do with "sucking the juice out of somebody" or "bad taste left in mouth."  This seems contradictory to me since  is fruit with great nutritional, medicinal and culinary value. Moreover, there are so many fruits out of which you suck the juice out. And lemon taste is never bad.

Related questions:       In the above questions, "lemon" is used to mean a faulty or defective item. A typical use might be to describe a second hand car that, once bought, turns out to have serious faults, as a "lemon".  Why is the delicious fruit associated with faulty goods?  :   perhaps via criminal slang sense of "a person who is a loser, a simpleton," which is perhaps from the notion of someone a sharper can "suck the juice out of."  A pool hall hustle was called a lemon game (1908);  while to hand someone a lemon was British slang (1906) for "to pass off a sub-standard article as a good one."  Or it simply may be a metaphor for something which "leaves a bad taste in one's mouth."   But none of these rings true for me, and words like "may be" and "perhaps" show a lack of confidence. Can anyone shed more light?


Why do I get different values for $x from the snippets below?  #!/bin/bash  x=1 echo fred > junk ; while read var ; do x=55 ; done < junk echo x=$x  #    x=55 .. I'd expect this result  x=1 cat junk | while read var ; do x=55 ; done echo x=$x  #    x=1 .. but why?  x=1 echo fred | while read var ; do x=55 ; done echo x=$x  #    x=1  .. but why?

I'm trying to write a simple bash function that takes, as its arguments, a number of files and/or directories. It should:   Fully qualify the filenames. Sort them. Remove duplicates. Print all that actually exist. Return the number of non-existent files.   I have a script that almost does what I want, but falls down on the sorting. The return value of the script as it stands is correct, but the output is not (unsorted and duplicates). If I uncomment the | sort -u statement as indicated, the output is correct but the return value is always 0.  N.B. Simpler solutions to solve the problem are welcome but the question is really about why is this occurring in the code I have. That is, why does adding the pipe seemingly stop the script incrementing the variable r?  Here's the script:  function uniqfile {     local r=0       for arg in "$@"     do           readlink -e "$arg" || (( ++r ))      done #| sort -u    ## remove that comment      return $r }


I was reading some lectures on quantum information theory and it came with the idea of " mutually unbiased bases" that I  never heard about. But the definition is very simple: two basis $ B = \{|b_0> , |b_1>  \} $ and $ C = \{|c_0> , |c_1>  \} $ are said to be mutually unbiased if $ <b_i|c_j>$ is independent of i and j for every i and j. In other words, if the scalar product does not depend on any vector in some of the basis, but is just a number. I do not know why this definition can be useful at all. In other words: why would I want a set of basis to be mutually unbiased? More specifically, where can it be useful in quantum information theory? That was my first question. Now, given to basis: $ Z = \{ |0> , |1> \}$ and $X = \{|+> , |-> \}$, with $ |+> = \dfrac{1}{\sqrt2}|0> + \dfrac{1}{\sqrt2}|1> $ and $ |-> = \dfrac{1}{\sqrt2}|0> - \dfrac{1}{\sqrt2}|1> $ I need to find another basis Y that is mutually unbiased with both X and Z and show that there is no other basis that is mutually exclusive with X, Y and Z. Of course we all know the answer must be $Y = \{\dfrac{1}{\sqrt2}|0> + \dfrac{i}{\sqrt2}|1> , \dfrac{1}{\sqrt2}|0> - \dfrac{i}{\sqrt2}|1> \}$, but I cannot show this to be true. My first attempt was to write $Y = \{ |a> , |b> \} $ and write it as a combination of the basis Z as $ |a> = \alpha|0> + \beta|1> $ and $ |b> = \omega|0> + \lambda|1> $ and then try to solve for the coefficients $\alpha$, $\beta$ , $\omega$ , and $\lambda$ given the set of equations $ <a|a> = 1$ , $ <b|b> = 1$ and $<a|b> = <b|a> = 0$ but I did not get anywhere. Any help?

This question can be formulated in two ways. Let there be two $d$-dimensional orthonormal bases $B_{1}$ and $B_{2}$. I refer to the elements of $B_{1}$ by $\lvert\nu_{i}\rangle$ and to the elements of $B_{2}$ by $\lvert\omega_{j}\rangle$. These two bases are mutually unbiased namely: $\lvert\langle\omega_{j}\lvert\nu_{i}\rangle\lvert^{2}=1/d$ for all $\lvert\omega_{j}\rangle$ and $\lvert\nu_{i}\rangle$. We define some vector $\lvert\tau\rangle$ such that $\lvert\tau\rangle$ is orthonormal to one element of $B_{2}$, say $\lvert\omega_{m}\rangle$ and it is mutually unbiased with respect to all the elements in $B_{1}$: $\lvert\langle\tau\lvert\nu_{i}\rangle\lvert^{2}=1/d$ for all $\lvert\nu_{i}\rangle$. Can we conclude that $\lvert\tau\rangle$ is equal to a member of $B_{2}$ say $\lvert\omega_{p}\rangle$ for some $p\neq m$ up to a phase difference?  Another way to make the same conclusion is to ask this: Let there be three orthonormal bases $B_{1}$, $B_{2}$ and $B_{3}$. $B_{1}$ and $B_{2}$ are mutually unbiased, so are $B_{2}$ and $B_{3}$. Can we conclude that $B_{1}$ and $B_{3}$ are either mutually unbiased or have equivalent Hadamard matrices? This question for me is particularly important since in the literature it is always talked about sets of pairwise mutually unbiased bases. But there's no proof given for the fact that three mutually unbiased bases should necessarily be pairwise MUBs.


I played Final Fantasy Tactics on my old iphone and got 20+ hours into it. I then went to android and am now back to iphone (please, let's not start a flame war!) and I was wondering if there is any way to recover my old save files?  Is this stuff stored in iCloud? If so, how can I check to see if my save files are there?

I have both an iPod touch and an iPhone (yes, redundant, I have my reasons), none of them are jailbroken. Some apps I own are installed on both devices, I would like to copy an app's save from one device onto the other. I know that there are apps for jailbroken devices to backup saves but I was wondering if there's a method that doesn't involve jalbreaking (by a third party PC/Mac tool, for example).  (Side note: I know that restoring one device's backup on the other device will transfer all the apps states but that will mean wiping the device completely)


I am using my Ubuntu to do some programming assignments at college and it keeps hanging.  For example,    If I have an infinite loop in my C code by mistake, Ubuntu freezes. If my C program allocates memory at runtime and I give it a large dataset by mistake, it freezes. If I switch on RStudio and run a very memory intensive function - it freezes.   By "freeze" I mean that the GUI stops changing, mouse stops moving, keyboard doesn't work. Cannot even go into other ttys using Ctrl+Alt+F1  This never used to happen on the windows computer I was using before (and that was 32bit while my current laptop is 64bit)  It seems as though the process I'm running takes up 100% memory/cpu and hence nothing else works. How do I limit the amount of memory and cpu that each process can take ?  I checked a little on limits.conf but I was unable to find what exactly to do in the limits.conf file nor could I find what limits are considered "safe"

I use my computer for scientific programming. It has a healthy 8GB of RAM and 12GB of swap space. Often, as my problems have gotten larger, I exceed all of the available RAM. Rather than crashing (which would be preferred), it seems Ubuntu starts loading everything into swap, including Unity and any open terminals. If I don't catch a run-away program in time, there is nothing I can do but wait - it takes 4-5 minutes to switch to a command prompt eg. Ctrl-Alt-F2 where I can kill the offending process.  Since my own stupidity is out of scope of this forum, how can I prevent Ubuntu from crashing via thrashing when I use up all of the available memory from a single offending program?  At-home experiment*!  Open a terminal, launch python and if you have numpy installed try this:  >>> import numpy >>> [numpy.zeros((10**4, 10**4)) for _ in xrange(50)]   * Warning: may have adverse effects, monitor the process via iotop or top to kill it in time. If not, I'll see you after your reboot.


Im having a problem, an object is invisible in cycles, in eeve and in 3d view the visiblity is normal. For detail, the object is invisible but selectable like its there but not visible and I'm using blender 2.90.1. Thanks in advance.  this second image shows that it doesent have a texture.  I leave the file on a google drive  < (this is the link)

Why is the selected object displaying in the 3D view, but not rendering?  In object mode, it shows up:   However, it does not show up in render mode:   Why is this so and what causes it to hide in render mode?


I'm trying to prove that  $$ \sum_{k=1}^{\infty} 7^{-k!} $$  is irrational but I'm so lost. Any tips for where to begin, thanks in advance.

This is the sum   $$\sum_{n=1}^{\infty}\frac{1}{{5^n}^!}$$  My first attempt was to assume that the series does converge to a rational number $a/b$. But the $n!$ bothered me and I failed in my proof.  How would you try to prove this series?