I am trying to get my child theme to work and to overide one line of code in the main theme functions.php but I can not getting to work since I am totally green in php.  In my main theme functions.php I have:  add_image_size('portfolio-three', 300, 214, true);   When I change it directly, change the image size it works like a charm and resizes images in my portfolio page. But I want to include it in child theme. The code of the functions.php in child theme is like this:          <?php     function mytheme_child_scripts() {         if ( ! is_admin() && ! in_array( $GLOBALS['pagenow'], array( 'wp-login.php', 'wp-register.php' ) ) ) {             $theme_info = wp_get_theme();             wp_enqueue_style( 'mytheme-child-stylesheet', get_template_directory_uri() . '/style.css', array(), $theme_info->get( 'Version' ) );         }     } add_action('wp_enqueue_scripts', 'mytheme_child_scripts'); add_image_size('portfolio-three', 388, 214, true); ?>   And it does not work, nothing happens, no error and also no image resize. I do not know what to do here. Could anyone please help me with implementing it properly ?  Best regards! Jacek

I'm working on a theme that has a number of image sizes defined correctly using:  add_image_size( 'name', 500, 200, true );   I would like to override these defined sizes from the child theme:  add_image_size( 'new-name', 400, 300, true );   I know I can add new sizes, but if I add the same name i.e:  add_image_size( 'name', 400, 300, true );   Then the parent function call is used - the child one is ignored - adding extra rules adds extra images which will never be used - it's not so bad, but it's not efficient.  Is there a function to de-register an added image size?  Cheers!  Ray


I am creating this Minecraft animation and I saved and left my WIP, 2 hours later I came back on, went on my save and the whole world was pink, how do you fix it? Thanks!

I made a character, and its one of my first times texturing, and I saved my character into a new folder, and when I came back to the model ALL the textures were pink, I used to know what to do, but I stopped texturing, how do I bring my textures back?


Quicken spell feat doesn't have any prerequisites to take. Can I take it at an earlier level than I can use it and have it for when I can?

In D&D 3.5, can I acquire a metamagic feat at lvl 1? I'm wondering this because I am playing a cleric and would like to get Empower spell to increase my healing to my party


Ok, so that's what I did: I installed ubuntu and when I had to chose the partitions and grub install I clicked on overwrite "windows bootloader" or something like that, now everytime I boot, grub shows ubuntu and windows, ubuntu works but if I choose windows grub send me back to itself. It's like the windows bootloader loads... grub. How can I fix that?  parted /dev/sda print Model: ATA WDC WD3200BEVT-7 (scsi) Disk /dev/sda: 320GB Sector size (logical/physical): 512B/512B Partition Table: msdos   Number  Start   End     Size    Type      File system     Flags  1      32.3kB  82.3MB  82.2MB  primary   fat16           diag  2      82.8MB  10.8GB  10.7GB  primary   ext4  3      10.8GB  317GB   307GB   primary   ntfs            boot  4      317GB   320GB   2683MB  extended                  lba  5      317GB   320GB   2683MB  logical   linux-swap(v1)   Windows part of my grub.cfg   ### BEGIN /etc/grub.d/30_os-prober ### menuentry "Windows 7 (loader) (on /dev/sda3)" --class windows --class os {     insmod part_msdos     insmod ntfs     set root='(hd0,msdos3)'     search --no-floppy --fs-uuid --set=root 7AF84223F841DE4F     chainloader +1 }

I installed Windows on my computer, followed by an installation of Ubuntu. However, now I'm unable to boot into my Windows install.  What can I do to fix this?


What is the meaning difference in below sentences?  a) Police are yet to arrest anyone for murder.  b) Police have yet to arrest anyone for murder.  according to me Sentence a) gives status of the case and sentence b) gives Idea that police have not completed the action of arresting till date.

This theory has yet to be proven. This theory is yet to be proven. This is yet to be done. This has yet to be done. I have yet to spend summer in the mountains. I am yet to spend summer in the mountains.  Are they all correct? How are "have yet to do" and "be yet to do" different? Thank you!


I will be travelling soon to the US from Jakarta. I have both US and Indonesian passports. Indonesia does not recognise dual citizenship, yet the US requires me to enter and exit the US with my US passport. I've read that I can go to Singapore first and then fly out to the US. But which passports to use and how?

I am a citizen of two different countries, and have two passports.  How should I use my passports when traveling?


I am writing part of a text where i need danish encoding/characters. The main language however is english. So i choose to add the special chars in textmode. I am facing now the problem that if a word ends on a special character it gets automatically concatenated with the next word. So   p\aa folks    should be   på folks    but it is   påfolks    I am using now some horizontal spacing makros like \, but is there a more elegant way? Also i haven't found a macro which provides the default space between two words

I have a definition:  \newcommand{\arnold}{Arnold Schwarzenegger}   When I refer to it by:  \arnold is a   it is rendered as:   Arnold Schwarzeneggeris a    In order to have a space in front of "is" I would need to write  \arnold\ is a   Is there some other shorter way?


Can anyone tell me a good gold farming place in the World of Warcraft? A farming place list is what I need (please include levels too).

What are your most effective way of earning lots of gold in World of Warcraft?  Should I be farming materials for my trades or to sell on the Auction House? Or should I be doing speed runs on the daily heroics?  Any suggestions?


I have a problem with redefining a comamnd within a new environment.  Not working MWE:  \documentclass{book} \makeatletter \newcommand{\mysection}{\@ifstar{\mysection@star}{\mysection@nostar}} \newcommand{\mysection@star}[1]{\begingroup\sloppy\raggedright\section*{#1}\endgroup} \newcommand{\mysection@nostar}[1]{\begingroup\sloppy\raggedright\section{#1}\endgroup} \newcommand{\mysubsection}{\@ifstar{\mysubsection@star}{\mysubsection@nostar}} \newcommand{\mysubsection@star}[1]{\begingroup\sloppy\raggedright\subsection*{#1}\endgroup} \newcommand{\mysubsection@nostar}[1]{\begingroup\sloppy\raggedright\subsection{#1}\endgroup} \makeatother  \newenvironment{MySubAppendix}{%     \makeatletter%     \renewcommand{\mysection}{\@ifstar{\mysubsection@star}{\mysubsection@nostar}}%     \makeatother% }{}  \begin{document} \begin{MySubAppendix} \mysection{Sub After Block Example} \end{MySubAppendix} \end{document}   This leads, with pdflatex, to:  This is pdfTeX, Version 3.14159265-2.6-1.40.19 (MiKTeX 2.9.6840 64-bit) entering extended mode (refman.tex LaTeX2e <2018-04-01> patch level 5 ("C:\Program Files\MiKTeX 2.9\tex\latex\base\book.cls" Document Class: book 2014/09/29 v1.4h Standard LaTeX document class ("C:\Program Files\MiKTeX 2.9\tex\latex\base\bk10.clo")) (refman.aux) ! You can't use `\spacefactor' in vertical mode. \@->\spacefactor                  \@m {} l.19 \mysection                {Sub After Block Example}   Working MWE:  \documentclass{book} \makeatletter \newcommand{\mysection}{\@ifstar{\mysection@star}{\mysection@nostar}} \newcommand{\mysection@star}[1]{\begingroup\sloppy\raggedright\section*{#1}\endgroup} \newcommand{\mysection@nostar}[1]{\begingroup\sloppy\raggedright\section{#1}\endgroup} \newcommand{\mysubsection}{\@ifstar{\mysubsection@star}{\mysubsection@nostar}} \newcommand{\mysubsection@star}[1]{\begingroup\sloppy\raggedright\subsection*{#1}\endgroup} \newcommand{\mysubsection@nostar}[1]{\begingroup\sloppy\raggedright\subsection{#1}\endgroup} \makeatother  \newenvironment{MySubAppendix}{% }{}  \begin{document} \begin{MySubAppendix}     \makeatletter%     \renewcommand{\mysection}{\@ifstar{\mysubsection@star}{\mysubsection@nostar}}%     \makeatother% \mysection{Sub After Block Example} \end{MySubAppendix} \end{document}   At first glance the working version would be an alternative, but when having this multiple times it is a bit of a problem writing each times the part:      \makeatletter%     \renewcommand{\mysection}{\@ifstar{\mysubsection@star}{\mysubsection@nostar}}%     \makeatother%   Any ideas?

I defined a macro which is essentially a wrapper for \meaning to check macro definitions  \def\whatis#1{{\ttfamily\string#1: \meaning#1}}   (The actual form I'm using goes one step further and checks whether the command is robust, but this is irrelevant here.) More often than not, the result involves some internal macro containing the token @. If I want to check this macro, I must then write something like  \makeatletter \whatis\MacroNameWith@InIt \makeatother   As I'm very lazy :-) I would like to activate \makeatletter within the scope of \whatis, so I tried  \def\whatis#1{{\makeatletter\ttfamily\string#1: \meaning#1\makeatother}}   (Actually I'd guess that \makeatother isn't necessary because of the grouping.) Needless to say, this isn't working, otherwise I wouldn't be posting this question :-)  My questions:   Why is this not working? How can I define \whatis such that \whatis{\MacroNameWith@InIt} behaves as I wish?


I have spent countless hours over the past week following all kinds of tutorials to get Ubuntu 14.04 to run on my laptop alongside Windows 7, both x64. After systematically trying every seemingly sensible suggestion I now turn to you.  Brief summary of specs:   Laptop Samsung ATIV Book 8   Samsung 840 PRO SSD Windows 7 Pro x64 Installed over USB. backed up disk with Acronis Live USB before Ubuntu. Ubuntu 14.04 LTS Desktop x64 Live USB EasyBCD 2.2 installed on Windows   Now, for what I have been trying:   Windows does NOT boot, if I switch BIOS to CSM or UEFI. Have to keep option BOTH activated. Ubuntu install does NOT give me the "install alongside" option. Always had to do either a clean install (worked fine but without windows anymore) or do "something else" in which case I created a "/" "swap" and "/home". Sometimes I even tried with a 1MB bios reserved boot. having the dropdown for bootloader choice below the table set to either sda or "/". imgur.com/FFjUVMr.jpg Boot-Repair ran over Ubuntu live USB several times. Never really got me anywhere. EasyBCD seemed like a sensible option and systematically added and tried out all the options available in the "Add New Entry" => "Linux/BSD" with every possible combination of the following: [ GRUB (Legacy), GRUB2, LILO/eLILO ] each with any option of [Autimatically locate and load, Partition 1, 2, 3, 4, 5 and 6. As a result there is always the same error, telling me that:.    One thing that I noticed though: There is a 1MB of free, unallocated space visible in partitioning during install (not visible in Gparted) just before the Windows 100M sda1 partitioned FAT32. Except for that Windows only has it's own, main sda2.   Any ideas how to proceed?

I have Ubuntu on my laptop. Now I want install Windows 7 in a dual-boot. How can I do this? I can't lose my Ubuntu files, and I'm afraid that I might break . Go  for UEFI only!


I'm in doubt on how to make object initialization without a default constructor on the superclass.  #include <iostream>  class A { protected:       A(std::string title, int xpos, int ypos); };  class B : A { protected:     //Is that correct?     A* m_pA(std::string title, int xpos, int ypos);      //Why not just A* m_pA;?  public:     B(std::string title, int xpos, int ypos); };  B::B(std::string title, int xpos, int ypos) : m_pA(title, xpos, ypos) {     //does nothing yet.      }   As you can see I'm trying to initialize the m_pA object of type A in the constructor of B, the VC is throwing me:      "m_pA" is not a nonstatic data member or base class of class "B"          You can see the example compiled and the errors .  I want to know why and how initialize a member object of a class without the default constructor, and why I am wrong.  Thanks in advance!

What are the C++ rules for calling the base class constructor from a derived class? For example, I know in Java, you must do it as the first line of the subclass constructor (and if you don't, an implicit call to a no-arg super constructor is assumed - giving you a compile error if that's missing).


In Game of Thrones S08E2 "A Knight of the Seven Kingdoms", in the scene where      Jaime Lannister is knighting Brienne of Tarth, Jaime says it doesn't require a king to make one a knight. An existing knight can name another warrior a knight. Finally, Ser Jaime Lannister knights Brienne of Tarth and she is named "A Knight of the Seven Kingdoms".   Are there any instances in the books where an existing knight gave another warrior Knighthood by himself?

Often in the story we see characters be promised knighthood. This usually seems to be a big deal to those that receive it. For example after the battle of the Blackwater, Bronn clearly reminds people of his new status. Surely there must be more to knighthood than simple social status or else people wouldn't make such a big deal of knighthood.  What are the advantages a man gains when knighted? Does he gain lands? Or simply prestige?


Lets say I have the following class:  class Foo { public:     Foo() = { std::cout << "Hello world!" << std::endl; } }   In the main function I call the following:  int main() {     Foo bar1(); // This doesn't echo "Hello World!"     Foo bar2 = Foo(); // This does echo "Hello World!" }   I don't understand why this would be occurring?

Is there any good reason that an empty set of round brackets (parentheses) isn't valid for calling the default constructor in C++?  MyObject  object;  // ok - default ctor MyObject  object(blah); // ok  MyObject  object();  // error   I seem to type "()" automatically everytime. Is there a good reason this isn't allowed?


I am trying to return a menu in alphabetical order and not the order set by the user in the backend. I have this code but it is not alphabetical:  $args = array(     'order'                  => 'ASC',     'orderby'                => 'title',); $menu= wp_get_nav_menu_items($menu->term_id, $args);

I am using this function   $args = array (    'order' => 'DESC', );  $items = wp_get_nav_menu_items( $custom_menu, $args );   then, if I change args to   $args = array (    'order' => 'ASC', );   and the result is still the same.   Anybody have suggestion?


Does there exist an analytic function $f:\mathbb{C}\rightarrow\mathbb{C}$ such that $f$ is bounded on both real and imaginary axes?   According to Liouville's theorem the function must be constant but I am confused that any bounded function $f$ on $\mathbb{C}$ must be like $f(z)=c$  where c is a constant. I am convinced that it must be bounded with respect to one axis but how about other axis. For example, $f(z)=1$ then it is bounded w.r.t real axis but how about imaginary axis? Question may be easy for other but I am unable to visualize it .

Does there exists a nonconstant entire function $f: \mathbb C \to \mathbb C$  which is bounded on real line and imaginary line?  Clearly,$ f(z)=sin(z)$ is an example of an entire function which is bounded on real line and $ f(z)= e^z$ is example of a function which is bounded on imaginary line.But I'm unable to find a function which is bounded on both the lines.Any ideas?


Could someone help me to prove this theorem. Thank you     Theorem    Suppose that the sequence of complex number $ \{a_n\}_{n\geq 1} $ converges. Then the sequence of its averages also converges, and their limits coincide; that is   \begin{align*} \lim\limits_{n\to\infty}\frac{a_1+a_2+\cdots+a_n}{n}=\lim\limits_{n\to\infty}a_n. \end{align*}

Prove that if $\lim_{n \to \infty}z_{n}=A$ then:  $$\lim_{n \to \infty}\frac{z_{1}+z_{2}+\cdots + z_{n}}{n}=A$$ I was thinking spliting it in: $$(z_{1}+z_{2}+\cdots+z_{N-1})+(z_{N}+z_{N+1}+\cdots+z_{n})$$ where $N$ is value of $n$ for which $|A-z_{n}|<\epsilon$ then taking the limit of this sum devided by $n$ , and noting that the second sum is as close as you wish to $nA$ while the first is as close as you wish to $0$. Not sure if this helps....


I've been browsing Wikipedia and stumbled on the article for the Vigenère cipher. I realized after seeing the example that it's quite similar to the one time pad, except with a short key repeated as the source of "random" information. That is, if you make the key longer than the plaintext, the two are the same.   Is that correct?

A "One Time Pad" can be thought of a Vigenere cipher with...    An infinitely long key  A secure symmetric key  Multiple ciphertext alphabets  A columnar transposition    I had this question come up today in one of my mid-terms and to be honest it caught me off guard a little, I chose (2) but I'm having doubts and now thinking its (3). I'm pretty sure i'll get a quick response to this because its quite a basic question, this is from an initial test on intro to cryptography and I felt I did pretty well on the rest of the test but this is bugging me.   I know one time pad can have infinite period and can be truly unbreakable but that doesn't mean it has an infinitely long key! (does it). (4) is surely a null consideration which leads me to think its (2) or (3)!


I really want to know how this shape is called and made in Illustrator. I know how to round corners of a rectangle but I'm not able to create such an element.

I know that the second shape is a squircle, but what are the other shapes called? Is there an actual name for them?    The shapes do not simply have rounded corners, but the sides have a "circularity". Here is a triangle with rounded corners next to the shape that I do not know the name of:    "Trircle", "Triarcle", and "Pentircle" do not seem to be used for them, at least Google's image search does not provide any results.


I have a Samsung S5830 phone which has Android on it.  When I look at:    Task Manager -> Summary   It appears that my, small, sim card is being filled up with data whilst, my larger, External SD card is relatively empty.  I'd prefer the camera to save images to my SD card. Not the sim.   But, I have no idea how to tell it to do so.  Any suggestions?

When I was using the camera of my Sony Xperia S, the following message popped up.  So how do you change the default save location of your camera (as highlighted with red underline)? Note: Yes, my memory was full and the message stopped showing up after deleting some files of course. I just want to know how to change the default for CAMERA.


Anyone managed to get a live ISO out of a running Ubuntu system? I tried to use Distroshare Ubuntu Imager as shown here:  And the live version worked fine, but when tried to install it the installation always crash. When I looked at GitHub this is a familiar problem. If anyone know how to solve it - I will be very grateful!

I have installed Ubuntu on a 32GB USB and set it up like I want, Installing some programs and removing others. I have added custom wallpaper and splash screen. How can I duplicate my modified OS and GMail it using Google Drive, (10GB limit), to friends and family for Christmas? It should be able to run on any modern x86-64 computer that meets Ubuntu hardware specifications. It should be uninstallable using Rufus, Etcher, mkusb and Gnome-Disks. I would also like to be able to install it from a USB stick. I have heard of and tried Remastersys, ISORespin, Ubuntu Customization Kit and Systemback, but now these all seem to be abandoned now. Sometimes I work in VirtualBox and would like to be able to distribute the OS's I create there also.


For the recurrence defined by  $$T(n) = 1 +\sum_{i=0}^{n-1}T(i)$$  Apparently $T(n) = 2^n$ .. but I cannot see it. This recurrence pops up during analysis of the . I keep looking to find a viewpoint to look at this problem where the factors of 2 pop out ..

Show that  $$t(n) = 1 + \sum_{ j=0}^{n-1} t(j)$$  is the same as  $$t(n) = 2^n$$  Initial condition $t(0) = 1$


If $\alpha,\beta,\gamma$ are the roots of the cubic polynomial $px^3+qx^2+rx+s$, then how can I find the value of $\alpha^2\beta+\beta^2\gamma+\gamma^2\alpha$ in terms of p,q,r and s?  My attempt: Using Vieta's formulas, $$\alpha+\beta+\gamma=\frac{-q}{p}$$ $$\alpha\beta+\beta\gamma+\gamma\alpha=\frac{r}{p}$$ $$\alpha\beta\gamma=\frac{-s}{p}$$ I first thought that this would help. We can find $\alpha\beta\gamma$ by Vieta's formula but the expression inside this bracket could not be possibly found. $$\alpha^2\beta+\beta^2\gamma+\gamma^2\alpha=\alpha\beta\gamma\left(\frac{\alpha}{\gamma}+\frac{\beta}{\alpha}+\frac{\gamma}{\beta}\right)$$ Then, I found $$\alpha^2+\beta^2+\gamma^2=(\alpha+\beta+\gamma)^2-2(\alpha\beta+\beta\gamma+\gamma\alpha)=\frac{q^2-2rp}{p^2}$$ But here all $\alpha^2$, $\beta^2$ and $\gamma^2$ are all multiplied with different factors, so possibility of taking a common factor is ruled out. Then, I thought to take an example. By chance, I could get a pattern. For example, take the polynomial $x^3-1$. The roots of this polynomial are $1,\omega,\omega^2$. Then, in this case the expression evaluates to $1^2\cdot \omega+\omega^2\cdot 1+\omega^4\cdot 1=\omega-1$. The expression in this case gives a complex result, so possibly couldn't be expressed in terms of $p,q,r,s$. Any hint is appreciated.

If p,q,r are the real roots of the equation $x^3-6x^2+3x+1=0$ then find the value of $p^2q + q^2r + r^2p$?  My Attempt: I tried $(p+q+r)(pq+qr+rp)$ but couldn't really figure out what to do with the extra terms. The roots are also not trivial to find. Any help would be appreciated.


I am trying a simple program in which I have taken a float number and comparing it with fixed numbers 0.5,0.7, 0.8 each time the output is different than expected. My code is  #include<stdio.h> int main*() {     float a = 0.5;     if (a > 0.5)         printf("greater");     else if (a < 0.5)         printf("less");     else if (a == 0.5)         printf("equal");  }   Now the crazy part is when I execute it with 0.5 value of a and replacing 0.5 with 0.7 as in code it prints equal, if with 0.7 then less and if with 0.8 then it prints greater. I can't figure it out. Can anybody explain this Please? I'm using codeblocks 16.01 for this and tried in Turbo C++ as well.

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


In Blade Runner 2049 why Dr. Ana Stelline was inside a glass room all the time?  Why was she not allowed outside, how does she contact with outside world?

In Blade Runner 2049, so why is Dr. Ana Stelline in a bubble?  To clarify I'm not asking about her supposed weakness that has her in a bubble.  I mean if she is the key link to both sides issue, then why is she in a bubble.  We basically have two sides opposing each other in this sci-fi.  One side is driven to find the child so that they can make more slaves faster.  The other side so that they can have children and become "more than human" and have freedom.  Both sides have placed huge importance on the child.  One side to protect her, the other to obtain her and dissect her, or whatever, to figure out how this was possible.  I fail to understand how the side that has her in a bubble, making memories, is moving forward with their (the replicants') plan?  She's now 30 years of age and they are no closer to finding out how to have children of their own.  Are they just having sex with each other for 30 years hoping to hit the jackpot again?  Is she just important to them because she's naturally born... I mean they lead us to believe she's more important than that yet, they're not using her in any way to figure it out.  Given, I'm not sure how they could without putting her through some type of distress.  But 30 years now and she's still in there and their whole plan of a rebellion is hanging on the hope of having kids some day..


While installing updating or removing any app, I get this error:  $ sudo apt upgrade Reading package lists... Done Building dependency tree        Reading state information... Done You might want to run 'apt-get -f install' to correct these. The following packages have unmet dependencies: winetricks : Depends: cabextract E: Unmet dependencies. Try using -f.   And when I run sudo apt -f install, I get this error:  $ sudo apt-get -f install Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... Done The following additional packages will be installed:   cabextract The following NEW packages will be installed:   cabextract 0 upgraded, 1 newly installed, 0 to remove and 11 not upgraded. 1 not fully installed or removed. Need to get 0 B/21.4 kB of archives. After this operation, 112 kB of additional disk space will be used. Do you want to continue? [Y/n] y (Reading database ... 282096 files and directories currently  installed.) Preparing to unpack .../cabextract_1.6-1_amd64.deb ... Unpacking cabextract (1.6-1) ... dpkg: error processing archive /var/cache/apt/archives/cabextract_1.6- 1_amd64.deb (--unpack):  trying to overwrite '/usr/share/icons/cab_extract.png', which is also  in package zorinos-icons 10.0~xenial~NoobsLab.com Errors were encountered while processing:  /var/cache/apt/archives/cabextract_1.6-1_amd64.deb E: Sub-process /usr/bin/dpkg returned an error code (1)

For example:  $ sudo apt-get install curl Reading package lists... Done Building dependency tree Reading state information... Done You might want to run 'apt-get -f install' to correct these: The following packages have unmet dependencies: bsh : Depends: libjline-java but it is not going to be installed groovy : Depends: libjline-java but it is not going to be installed rhino : Depends: libjline-java but it is not going to be installed E: Unmet dependencies.   Try 'apt-get -f install' with no packages (or specify a solution).   I get the same or similar errors when I attempt to install clojure1.3, leiningen, and several other packages.   When I try the suggestion made in the error message, this is what happens:  $ sudo apt-get -f install  Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... Done The following packages were automatically installed and are no longer required:   diffstat linux-headers-3.2.0-26-generic linux-headers-3.2.0-26 dh-apparmor dkms html2text libmail-sendmail-perl libsys-hostname-long-perl Use 'apt-get autoremove' to remove them. The following extra packages will be installed:   libjline-java Suggested packages:   libjline-java-doc The following NEW packages will be installed:   libjline-java 0 upgraded, 1 newly installed, 0 to remove and 0 not upgraded. 23 not fully installed or removed. Need to get 0 B/72.0 kB of archives. After this operation, 129 kB of additional disk space will be used. Do you want to continue [Y/n]? Y (Reading database ... 226243 files and directories currently installed.) Unpacking libjline-java (from .../libjline-java_1.0-1_all.deb) ... dpkg: error processing /var/cache/apt/archives/libjline-java_1.0-1_all.deb (--unpack):  trying to overwrite '/usr/share/java/jline.jar', which is also in package scala 2.9.2-400 Errors were encountered while processing:  /var/cache/apt/archives/libjline-java_1.0-1_all.deb E: Sub-process /usr/bin/dpkg returned an error code (1)  $ sudo apt-get upgrade Reading package lists... Done Building dependency tree        Reading state information... Done You might want to run 'apt-get -f install' to correct these. The following packages have unmet dependencies:  bsh : Depends: libjline-java but it is not installed  groovy : Depends: libjline-java but it is not installed  rhino : Depends: libjline-java but it is not installed E: Unmet dependencies. Try using -f.


Let $X,Y,Z$ be i.i.d. $\mathbb{R}$-valued random variables each with the uniform distribution on [0,1]. ie. $X,Y,Z\sim \mathcal{U}[0,1]$. Determine the probability density function of X+Y+Z. For this question, Can I consider this equals $\int\limits_{x=0}^1\int\limits_{y=0}^1 \int\limits_{z=0}^1 [yz,1]1 dx dy dz$?

Let $X,Y,Z\sim Unif(0,1)$, all independent. Find the distribution of $W=X+Y+Z$   I'm trying to solve this by doing convolution twice. I'm letting $S=X+Y$, then $W=S+Z$. So I should end up with $f_W(w) = \int f_S(s)f_Z(w-s)ds$.  My solution for $f_S(s)$ is $f_S(s) =  \begin{cases}        s &  0 \leq s\leq 1 \\       2-s & 1\leq s\leq 2 \\     \end{cases} $  However, I'm having trouble figuring out how to do the integral when I do my second convolution, since $f_S(s)$ is piecewise.  Any thoughts would be greatly appreciated.  Thanks in advance!  Edit for clarification: The problem I'm having isn't how to integrate over a piecewise function. It's how to adjust the bounds of integration when I consider the different possible values for $W$.  Specifically, when $w \in [0,1]$, I get $f_W(w) = \int_0^w f_S(s)ds = w^2/2 $. This part wasn't too bad.  However, when $w\in [1,2]$, we in order to keep $(w-s)$ in the support of $Z$ , we find that $w-1 \leq s \leq w$. The problem is that I'm not sure which part of $f_S(s)$ to use when integrating.  Let me know if I need to further elaborate on my problem.


Suppose that $f (x)$ and $g(x)$ are irreducible over $F$ and that    $\deg f (x)$ and $\deg g(x)$ are relatively prime. If $a$ is a zero of $f (x)$ in some extension of $F$, show that $g(x)$ is irreducible over   $F(a)$.   I understand that $f(a) = 0$ implies that $[F(a):F] =$ deg $f(x)$ and that all elements of $F(a)$ are of the form $c_{n-1}a^{n-1} + \dots + c_0$, but from here I can't to find a way to relate the coprimeness to show that $g(x)$ can only factored as a unit and a polynomial from $F(a)[x]$.  Anyone have any ideas?

This is an assignment. There are two related (I think) problems. Please solve one of them and I will try to solve the other.   Let $\alpha, \beta $ be algebraic over $k$ whose irreducible polynomials are $f(x), g(x)$. Suppose $\gcd(\deg(f),\deg(g))=1$. Show that $g(x)$ is irreducible in $k(\alpha)[X]$. $f(x) \in k[x]$ is irreducible with degree $n$ and let $[K:k]=m$, where $(n,m)=1$. Show that $f$ is irreducible in $K[x]$.


There was a book of short stories that I read as a kid.  I loved it and checked it out all the time in my schools library.  The one story that sticks out is about a group of children in a perfect world but they were mutants, not perfect. They were kept in a nursery for these kinds.  The story is told from the point of view of a kid named MLN or as he calls himself Emellan.  Does anyone else remember this story?

Okay, so here it goes. Over a decade ago I read a sci fi anthology book from my grade school's library. I would guess it was written in the 50's or early 60's but I could be wrong. There are 3 stories I vaguely remember.    I remember this one the most. Most kids are born really smart through some type of enhancements. But the protagonist, while not dumb, is born like a normal person. Normal people tend to be looked down on or stigmatized in this society and he grows up and despite having average intelligence, leads a revolution against the government that has been promoting these kinds of genetic mutations. The only thing I know is that this story is set in the year 2000 on New Years Day. The title includes "the Year 2000" in it I'm fairly sure. But that's all I can remember about it. The final story is the most vague in my mind. But it's a story about cars and possibly racing? The title might be a two word title, the something. That something being the title of the name of the people that drive/race? Like the Langoliers, although obviously not that. I've read that one.   I know the last 2 are really vague, but any info on the first one at least might lead me to find different collections it's been in if I can track it down.   Thanks for everything!


So i'm doing a program where i input some data into a file and read from it. The problem is i dont know how to handle this. I read from the file and recieve a string containing alot of different data that is seperated by a delimiter "|".     string data ="FirstName|LastName|Signature|Height";   So my question is, is there a way to seperate this string nicely and store each of the values in a seperate variable?  p.s I have tried this so far. I did find this function subrt() and find() which i could use in order to find the delimiter and take out a value but it doesnt give the correct value for me so i think i'm doing something wrong with it. Only the fname value is correct.      const string DELIM = "|";     string fname = data.substr(0, data.find(DELIM));     string lname = data.substr(1, data.find(DELIM));     string signature = data.substr(2, data.find(DELIM));     string height = data.substr(3, data.find(DELIM));

I'm trying to iterate over the words of a string.  The string can be assumed to be composed of words separated by whitespace.  Note that I'm not interested in C string functions or that kind of character manipulation/access. Also, please give precedence to elegance over efficiency in your answer.  The best solution I have right now is:  #include <iostream> #include <sstream> #include <string>  using namespace std;  int main() {     string s = "Somewhere down the road";     istringstream iss(s);      do     {         string subs;         iss >> subs;         cout << "Substring: " << subs << endl;     } while (iss); }   Is there a more elegant way to do this?


Suppose that $f: \mathbb{R} \rightarrow \mathbb{R}$ is a continuous function with $\lim_{x \rightarrow + \infty}f(x)=0$ and $\lim_{x \rightarrow - \infty}f(x)=0$. Show that $f$ is uniformly continuous on $\mathbb{R}$  My attempt: Take a random $\epsilon >0$. As  $\lim_{x \rightarrow + \infty}f(x)=0$, there exists a $M_{1} \in \mathbb{R}$ so that for every $x \in \mathbb{R}$ with $x > M_{1}$ it holds that $|f(x)-0|< \epsilon$. As  $\lim_{x \rightarrow - \infty}f(x)=0$, there exists a $M_{2} \in \mathbb{R}$ so that for every $x \in \mathbb{R}$ with $x < M_{2}$ it holds that $|f(x)-0|< \epsilon$. Now take $M \geq \max \{|M_{1}|,|M_{2}|\}$. Then surely will $|f(x)|< \epsilon$ for every $x \in \mathbb{R} \backslash [-M,M]$.  Now I'm not sure how to go on from this. I do know that $f$ is uniformly continuous on the interval $[-M,M]$ because it is continuous. But how can I expand this to $]- \infty,+\infty[$ ?

Suppose that $f:\Bbb R\to \Bbb R$ is continuous and that $f(x)\to 0$ as $x\to \pm\infty$. Prove that $f$ is uniformly continuous.   Since $f(x)\to 0$ as $x\to \pm\infty$ we have $|f(x)|<\epsilon $ whenever $x<-K$ and $x>K$ where $K>0$.  Also $f$ is uniformly continuous on $[-K,K]$ as the domain is compact.  Hence $f$ is uniformly continuous in $(-\infty,-K)\cup [-K,K]\cup (K,\infty)$.  But how to conclude that $f$ is uniformly continuous on $\Bbb R$ from above as I may chose $x\in (-\infty,-K);y\in [-K,K]$ ,how to conclude that $|f(x)-f(y)|<\epsilon $ from above for a given $\epsilon$?  Please suggest the edits required.


You get the 925 badge for getting a silver badge.  Do you still get the badge of you got that silver badge on the Meta site for a particular SE site?  N.B.: I am not talking about Meta.SE, I'm talking about per-site metas like  or .

Some hours ago I was awarded the Good Question badge on Meta Stack Overflow:   It's a silver badge, but I didn't receive the      earn a silver badge     Seems a bug, or is it because meta badges are ignored for hats?


I just installed Blender and I am having very slow performance,when I press any menu buttons it takes around 3 sec. to respond or show is this normal? Do I need to set up something additional or install a driver? I have read the system requirements are looking fine,it shouldn't be that slow.   Thank you  P.S.  I am using: Samsung RC530 Intel core i7 , 2.20GHz GeForceGT 540M, 6GB RAM DDR3, 500 GB SSD Samsung, Windows 10 64 bit

Update  This has been confirmed resolved in a later version 376.33 and possibly the update prior.     Okay, I recently did a computer update. I used to run Blender 2.77 on a Dell desktop (5 GB RAM, 2.7 GHZ, Windows 8, build in graphics card). Since that computer wasn't fast enough for my preference, I saved up and got a new gaming laptop - the Asus ROG GL552 (Windows 10, 16 GB DDR4 RAM, Nvidia GeForce GTX 960M with 4 GB DDR5 RAM, 2.6-3.5 Ghz, and quad-core intel processor). That laptop has been known to have outdated drivers, so when I got it, I updated it to up to date Windows 10 drivers.  As soon as I started Blender, I immediately noticed its speed. Even doing simple things, like clicking buttons, or rotating the view with the middle mouse button, took too long to register in the program. I tried changing some User Preference System settings, but that didn't really help much. And the hardware seems to be fine - the render is lightning fast (renders the startup scene in under .1 second; it's just laggy when loading the uv screen), so I don't know why it's like this, or what to do. Also, I ran Blender 2.77 on this computer, and it was also slow (although it was fine on my previous computer).  It could be an issue with drivers perhaps (or maybe OpenGL?), but I ran Unreal Engine 4, and had none of the same issues - the speed was pretty decent on that; so I'm not sure why Blender would be so slow. Any help is appreciated - thanks guys!


I'm newbie in Oracle and I am programming some stuff things but I need to do something that it's beyond me.  First of all, I have to use Oracle 8i  We start with a table with data similar to:  Column1  Column2       A        7       A        9       A       13       B        5       B        6       C        1       C        4       C        9       C       40   I need to take FIRST 2 values from this table for EACH letter (column1)  Value1 = n1 Value2 = n2  For example, for A values are 7 and 9 but for B are 5 and 6  Sorry, I can't draw a table (  And I don't know how many letter could have this table ofc, so I suppose the best way it's maybe a LOOP for all table, taking just first and second row (table is arranged and ALWAYS need first and second values for each letter) but I'm not sure how can I do...  Maybe a query filter by column1 and a rownum <3 ? I'm not sure if this query always take just first 2 values or take 2 aleatory values...

How would I be able to get N results for several groups in an oracle query.  For example, given the following table:  |--------+------------+------------| | emp_id | name       | occupation | |--------+------------+------------| |      1 | John Smith | Accountant | |      2 | Jane Doe   | Engineer   | |      3 | Jack Black | Funnyman   | |--------+------------+------------|   There are many more rows with more occupations.  I would like to get three employees (lets say) from each occupation.  Is there a way to do this without using a subquery?


I've bought a second hand Helios lens online (40 years old). At first sight everything looks fine no fungus haze no dust. Under 45 degree the front element in covered in very very thin scratches like it was cleaned with a T-shirt. I will test it next but I'm on film with no access to digital.  Will this affect the photos?

I am looking to buy a CANON 28mm 1.8 EF lens. I found an offer, significantly discounted, of a lens with small scratches on the front element.   The offer is very tempting. Here is a photo posted by the seller:    The scratches will probably affect my photos a bit. But how much exactly? Does anyone have experience with a similarly scratched lens?   I am an amateur and hobbyist, and I don't make money from my photography. I would use this lens as a 'normal' on my 60D, mostly for taking portrait photos of my family. I am getting this one because of the aperture (1.8), and I would be using it wide open most of the time.


Think I have totally messed my system up, and it's a case of lesson learned for not reading things correctly maybe.  For some reason my GUI stopped loading after logging into ubuntu 12.04,  think I have misinterpreted this   Command startx run my default gnome classic and gnome statup scripts also runs.   As I ran this using sudo startx but was presented with a blank screen, so I restarted and tried to login as my user but it just loops back to the login page every time now  I don't know what to do to get access back into my laptop  If anyone could help I would be so grateful  Edit  Followed this  and now I can login, lesson learned, but still no GUI

My Ubuntu is stuck in a login loop when trying to enter my desktop. When I login, the screen gets black and soon after that the login screen comes back.   I've read that the problem might be caused by an error depending on the graphics, here's my graphics card: ATI Radeon 7670M


Do I need a transit visa for Amsterdam for my route - Nairobi to Berlin. I am traveling from Nairobi to Berlin via Amsterdam. My flight is KLM.

I found many related questions on this site but I am still not sure about the rules. How can I decide if I need a visa to transit? Schengen members as of May 2021 are as follows:  Austria Belgium Czech Republic Denmark (excluding Greenland and the Faroe Islands - but an open border with the Schengen Area is maintained) Estonia Finland France (excluding overseas departments and collectivities) Germany Greece Hungary Iceland Italy Latvia Liechtenstein Lithuania Luxembourg Malta Netherlands (excluding Aruba, Curaçao, Sint Maarten and the Caribbean Netherlands) Norway (excluding Svalbard) Poland Portugal Slovakia Slovenia Spain (except Ceuta and Melilla) Sweden Switzerland


Can you explain to me whether I should or should not use ‑s at the end of the  verb allow in this sentence?     This function requires that the container class allow[s] random access   The sentence in the book I read wrote allow without ‑s. However, the container class is a third-person singular, so the ‑s must be required. Is that right?

Why is this sentence correct?     She suggested that he go to the cinema.   I would definitely use goes instead of go.


On a WSL Ubuntu 16.04 (Xenial) with composer I executed:  echo 2 * 3 > 5 is a valid inequality    It resulted in a file by the name of 5, with the content:     2 composer-setup.php 3 is a valid inequality   I don't know why this echo includes the text composer-setup.php as well; it should have included everything from left and right besides 5 (the file name) as echo can have a single stream of text as its file name for redirection (no spaces allowed, as I understand, hence the 5 name).  Why is the composer-setup.php appears there between the 2 and 3?

I know using the command ls will list all the directories. But what does the ls * command do ? I used it and it just lists the directories. Does the star in front of ls mean how deep it will list the directories?


In ANSI C section 2.9, the bitwise operators, I am unable to understand this particular code.   I know how each bitwise operator works, but combinations need some help.  getbits(x, 4, 3)  unsigned getbits(unsigned x, int p, int n) {     return (x >> (p + 1 - n)) & ~(~0 << n); }

In chapter 2, the section on bitwise operators (section 2.9), I'm having trouble understanding how one of the sample methods works.  Here's the method provided:  unsigned int getbits(unsigned int x, int p, int n) {     return (x >> (p + 1 - n)) & ~(~0 << n); }   The idea is that, for the given number x, it will return the n bits starting at position p, counting from the right (with the farthest right bit being position 0). Given the following main() method:  int main(void) {     int x = 0xF994, p = 4, n = 3;     int z = getbits(x, p, n);     printf("getbits(%u (%x), %d, %d) = %u (%X)\n", x, x, p, n, z, z);      return 0; }   The output is:     getbits(63892 (f994), 4, 3) = 5 (5)   I get portions of this, but am having trouble with the "big picture," mostly because of the bits (no pun intended) that I don't understand.  The part I'm specifically having issues with is the complements piece: ~(~0 << n). I think I get the first part, dealing with x; it's this part (and then the mask) that I'm struggling with -- and how it all comes together to actually retrieve those bits. (Which I've verified it is doing, both with code and checking my results using calc.exe -- thank God it has a binary view!)  Any help?


How do you prove $$\sum_{n=1}^{\infty} \frac {n}{2^n} = 2\ ?$$  My attempt: I have been trying to find geometric series that converge to 2 which can bind the given series on either side. But I am unable to find these. Is there a general technique to find the sum? This is a high school interview question and must be easy enough to solve in a few minutes.  Please give any hints for the first step towards a solution.


Show that Multiplication of negative numbers is always positive eg. (-1)*(-1)=1

Is there a formal proof for $(-1) \times (-1) = 1$? It's a fundamental formula not only in arithmetic but also in the whole of math. Is there a proof for it or is it just assumed?


Can somebody help me with some extra explications about iPhone activation? I had read this  and understood that this activation allows the end-user to access the home screen of the smartphone with all its apps. But I don't understand what is happening behind the scene of an activation. What information is the smartphone sending to the Apple servers? And what is the smartphone expecting to receive back from these servers?  Also, I will write bellow all my questions to have some order in the ideas.  1) Can I bypass this activation to use the smartphone? ( Something similar to Samsung bypass. I don't know, I am trying to make some analogy )  2) If I don't activate the iPhone can I install a custom OS? ( in the Android world I can install a custom OS from Cyanogenmod )  3) Why doesn't Android devices have this activation step?  4) If I don't activate the iPhone, can I jailbreak it?  5) When would the activation fail, and not because of the bad internet connection?  6) Can I, us a developer/hacker do anything with the iPhone if I am not activating it by executing any  to change any settings in any way. And after the activation, the changes done by me to be reset to default?  7) Can I set my iCloud account if the iPhone is not activated?  To don't understand me wrong, I understand that when I am buying an Apple smartphone from the local store, my friend or whoever is selling it. I am paying for the hardware and the software, and this is one of the reasons for these devices to be expensive. But why, should I (the end-user) bother to activate this phone when I know, that the software is bound to the hardware?  Thanks in advanced

This is something I don't particularly understand. I get that for Windows, activation exists to prevent software piracy, but you don't have to pay for iOS. Perhaps activation exists to prevent Android devices from using iOS or to prevent jailbreaks and downgrades? Anyone know the real reason why?


In ng-pattern we have the option of specifying that the field should match a specific pattern.  How can we specify that it should NOT match the specified pattern?  Example,  <input type="text" ng-pattern="/[*|\":<>[\]{}`()';@&$]/" />   Here, I DONT want the field to match the pattern. On the contrary, I want to show error if the pattern matches.

I know it's possible to match a word and then reverse the matches using other tools (e.g. grep -v). However, is it possible to match lines that do not contain a specific word, e.g. hede, using a regular expression?   Input:  hoho hihi haha hede   Code:  grep "<Regex for 'doesn't contain hede'>" input   Desired output:  hoho hihi haha


I own a Dell Latitude 11 inch 2-in-1 ... it has a m5-6Y57 processor, 8GB of RAM and 256GB SSD.. Which Ubuntu distro is right for this 2-in-1 ? I want to read ebooks on it so the distro has to support screen rotation and gestures...I also want to take notes with it...The 2-in-1 is Wacom AES enabled and has an active pen.  I guess Ubuntu gnome is the right choice for this laptop...but will it run smooth on this 2-in-1 ? what other distros should i look at ?    I also have a Dell inspiron 3179, which has m3-7Y30 processor, 4GB of RAM and 250GB SATA3 SSD ...   Which Ubuntu distro is right for this one ? I am looking at elementary OS and Xubuntu at the moment...Do Xfce and Pantheon support screen rotation and gestures ? i intend to read ebooks on this too...but no note taking as the touchscreen is not AES and doesn't support an active pen.  What other distros do you recommend ?  I know there is Ubuntu Mate and LXQT/DE....but these don't have touchscreen functionalities...

For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?


An earlier question was asked on what would happen if a rope was attached between Moon and Earth, but the question was more about the impacts in terms of geology.  We keep the same experiment setup :     Now let's add a guy holding the rope on Earth and an astronaut holding the other end of the rope, on the Moon. Since the distance between Earth and Moon is 384 000 km and that nothing can go faster than 300 000 km/s, what would happen if the Earth guy would pull on the rope. Would it take a little bit more than a second for the astronaut to feel the change in tension ? Does it mean that the rope has been somehow elastic during that 1 sec ?

Is it possible for information (like 1 and 0s) to be transmitted faster than light?   For instance, take a rigid pole of several AU in length. Now say you have a person on each end, and one of them starts pulling and pushing on his/her end.   The person on the opposite end should receive the pushes and pulls instantaneously as no particle is making the full journey.  Would this actually work?


Given p is a prime number greater than 2, and  $ 1 + \frac{1}{2} + \frac{1}{3} + ... \frac{1}{p-1} = \frac{N}{p-1}$   how do I show, $ p | N  $ ???  The previous part of this question had me factor $ x^{p-1} -1$ mod $p$. Which I think is just plainly $(x-1) ... (x-(p-1))$

Problem: Let $p$ be a prime. Consider $\sum\limits_{i = 1}^{p-1} \frac1i = \frac K{(p-1)!}$. Rearranging, we have   $K = \sum\limits_{i = 1}^{p-1} \frac{(p-1)!}i$.   Prove that $p \mid K$.    Hint: consider the factorization $x^{p-1} - 1 \equiv (x-1) ...(x - (p-1)) \pmod{p}$.  Attempt: I am finding applying the hint difficult. Sure, the RHS of the congruence relation contains $(p-1)!$, but I can't see how the factorization would help me prove the expression for $K$. Any help is appreciated.


With a friend of mine, we are planning to develop a small game to get the hang of game development and teamwork. But since Unity 3D barely supports version control (or at least the free version lacks of it) we have no idea how to efficiently manage teamwork. Sharing tasks in a small project is also seems like a challange for us.  I would also appreciate any advice that could be useful for beginner indie developers related to teamwork. :)

I have a Unity project without any version control, and I need to share it with another developer so that both of us can work on the project.  What strategies should be use that play nice with Unity Assets?


I've had a lot of difficulty summoning the wall of flesh. The first time I summoned it when I was new to the game I died. I waited for my guide to respawn so I could try again but he never spawned. I made a house for him to stay in but he still has not come. It's been 4 weeks and he has not come. Is there any way to make him come back that I don't know of, or is this some glitch

I read on the wiki that people will move in under the following conditions:   You do something to please them An empty house is available with a light source, table, and chair (also with walls).   I have a house which is about 7x8, then a roof space above that; about half the area. I could put furniture up there too, but will anyone move in?


I would like to write an expression to search for 2 terms in a sentence. One term is constant one term changes.   For example I would be searching for the word "Ben" as a constant plus the word "banana" or "apple"  "Ben likes bananas" would return positive   "Ben eats banana" would return positive   "Ben eats apples" would be positive  "Ben likes apple" would be positive  "Ben likes pears" would be negative because pears was not a specified term.   "Tom likes apple" would be negative because Ben is not specified   Can anyone help? Thank you!!

I don't really understand regular expressions.  Can you explain them to me in an easy-to-follow manner?  If there are any online tools or books, could you also link to them?


In my course notes of topology, we have seen the following example of a space that is connected but not path-connected.  Define $X := \{(0,0)\} \cup \{(x,\sin(\frac{1}{x}))\mid  x > 0\}$  I understand why this is connected but I have troubles by arguing why it's not path-connected. my opinion: consider $X$ is path-connected   for $x = (0,0)$ and $y = (1,\sin(1))$ , there is a continuous function $f\colon [0,1] \rightarrow X: 0 \mapsto x, 1 \mapsto y$  because $[0,1]$ is compact and $f$ is continuous, $X$ is compact. I think that $X$ is not compact but I can't prove why. If I can prove this, $f$ can't be continuous and then it's ok.

Is there a (preferably elementary) proof that the graph of the (discontinuous) function $y$ defined on $[0,1)$ by $$ y(x) =\begin{cases} \sin\left(\dfrac{1}{x}\right) & \mbox{if $0\lt x \lt 1$,}\\\ 0 & \mbox{if $x=0$,}\end{cases}$$ is not path connected?


I have  a small population and it is possible to estimate  Population regression function from the data. The size of the population is very small. It is only eight. I think since the regression  relates to poulation, there is no need to conduct any testing. Am I correct?

Imagine you have to do reporting on the numbers of candidates who yearly take a given test. It seems rather difficult to infer the observed % of success, for instance, on a wider population due to the specifity of the target population. So you may consider that these data represent the whole population.   Are results of tests indicating that the proportions of males and females are different really correct? Does a test comparing observed and theoretical proportions appear to be a correct one, since you consider a whole population (and not a sample)?


We bought a van in Canada to roadtrip the US for 6 months. We are planning on two 90 day stints in the US so as to comply with the ESTA requirements. It is looking more likely it will be easier to fly Mexico rather than re-enter Canada via land. Will customs have an issue with us leaving and re-entering the US via air if we originally entered via land border? We have done the west coast and want to now travel the East coast. Thanks.

I'm on a New Zealand passport.  From most US Embassy webpages:     The Visa Waiver Program (VWP) enables nationals of certain countries,   including Australia, New Zealand, and the U.K., to travel to the   United States for tourism or business for stays of 90 days or less   without obtaining a visa, if certain requirements are met. Under the   VWP, time spent in Canada, Mexico, and adjacent islands counts towards   the maximum of 90 days stay allowed under the program.   I'll be there on a 1-year working holiday visa starting when I arrive in Vancouver. I'm spending 3 days in Hawaii en route to Vancouver. This seems to imply that 90 days after landing in Hawaii, my time will be up and I won't be able to get back into the US, as my living in Canada will not reset the clock. What if after this time I want to say, pop across the border to Seattle? How can I restart the 90 days, without having to resort to say, flying to Japan and back just to reset it?


I can't find a free hosting that supports new gTLDs. On my opinion, these are really good hosting providers: freehosting io, 2freehosting.com and even there I get an error when I try to create an account to use hosting service.   EDIT: I registered a new gTLD on GoDaddy and tried to create a new account on those service providers. Still have the same error.

This is a "catch-all" question designed to serve as an answer for all questions about choosing web hosting.  Pro Webmasters no longer accepts new questions about how to choose hosting.  All future questions pertaining to finding web hosting should be closed as a duplicate of this question. For more information about this policy please see .    How to find web hosting that meets my requirements?  What we're looking for in answers to this question are the basics about web hosting:   What is web hosting? What is the difference between shared, VPS, and dedicated hosting? How does a content delivery network relate to web hosting? Anything else you feel is helpful in finding a web host.   What we do not want is:   Endorsements or recommendations for specific web hosts We do not want your experience or other subjective information (just the facts please)


Definition of "condensed nearest neighbour", at training time it chooses the c "best" training examples (where c is a hyper-parameter), and at test time uses the usual KNN prediction but based only on these c training examples.   So far, I looked-up many references and websites and researched on how to determine if a method is between parametric or non-parametric. I came up with below definitions,     A parametric algorithm has a fixed number of parameters. In contrast, a non-parametric algorithm uses a flexible number of parameters, and the number of parameters often grows as it learns from more data.   From .  Moreover, I found,     A parametric model, we have a finite number of parameters, and in nonparametric models, the number of parameters is (potentially) infinite.    From .  My question is, why do we count it as a Parametric model?

Definition of "Consistent nearest neighbour", runs our usual KNN classifier but instead of viewing k as a hyper-parameter it always sets k = ceil[log(n)].  So far, I looked-up many references and websites and researched on how to determine if a method is between parametric or non-parametric. I came up with below definitions,     A parametric algorithm has a fixed number of parameters. In contrast, a non-parametric algorithm uses a flexible number of parameters, and the number of parameters often grows as it learns from more data.   From .  Moreover, I found,     A parametric model, we have a finite number of parameters, and in nonparametric models, the number of parameters is (potentially) infinite.    From .  My question is, why do we count it as a Non-parametric model, while    the number of parameters can increase to infinity in the mentioned    method and it will gets more complicated by increasing test data?


I'm preparing a submission to a journal that expects citations in the format [Author(year)]. Based on the examples in, for example, , abbrvnat seems to fit my requirements. Unfortunately, citations appear differently in my example.  My document looks as follows:  \documentclass[]{article} \usepackage[square]{natbib} \usepackage{filecontents}  \begin{filecontents*}{ref.bib}   @book{Knu86,     author = {Knuth, Donald E.},     year = {1986},     title = {The \TeX book},   } \end{filecontents*}  \begin{document}  Text including citation \cite{Knu86}.  \bibliographystyle{abbrvnat} \bibliography{ref}  \end{document}   I'd expect the following output:    Instead, running pdfLaTeX and bibTeX produces the following result:    What can I do to achieve the expected output?  I'm open to switching to Biblatex, but the solution  formats citations as [Knu86] instead of [Knuth(1986)]. I'd be interested in customizing Biblatex to fit my needs, but what I don't understand is why abbrvnat doesn't already do what I expect. Clearly, I end up with a different result than every example of abbrvnat I can find.

Is it possible to use natbib together with the alpha style? It doesn't seem to be supported directly in the natbib package. What I mean is that there is no specific alpha-like natbib style, and if I use alpha directly I lose the possibility of citing author names and such with \citet... Does anybody know of an alpha style that would work with natbib?


The output of the following piece of code is "Test Passed"; can someone explain to me why ?  public class Test {     public static void main(String args[]) {         System.out.println(new Test().print());     }      protected StringBuilder print() {         StringBuilder builder = new StringBuilder();         try {             builder.append("Test ");             return builder.append("Passed!!!");         } finally {         builder = null;      } }

Considering this code, can I be absolutely sure that the finally block always executes, no matter what something() is?  try {       something();       return success;   }   catch (Exception e) {        return failure;   }   finally {       System.out.println("I don't know if this will get printed out"); }


I have created a texture coordinate node and then deleted it. This action shows a small difference after rendering and I'm interested in describing this difference in words.

How exactly to texture coordinates work?  I know they are represented by vectors, but how does a vector store texture mapping information?  How does each type of texture coordinates work and what are their respective advantages and disadvantages?


This extract from the film script of Pride and Prejudice (1995) and the meaning of some sentences are a bit vague for me.  Why does Kitty use will in the first sentence and shall in the second? Is the extra implication of shall "to make her do"? Why does Lydia say "... you would tell her?" Why is would used here?   KITTY: Lydia has torn up my bonnet and made it up new and says she will wear it to church.  Tell her she shall not! LYDIA: I shall wear it, I beg you would tell her so, for it's all my own work.

Which is the correct use of these two words, and in which context should one be used rather than the other?


Assume I have a file with about 10000 lines.  How can I print 100 lines, starting from line 1200 to line 1300?

Say I have a huge text file (>2GB) and I just want to cat the lines X to Y (e.g. 57890000 to 57890010).  From what I understand I can do this by piping head into tail or viceversa, i.e.   head -A /path/to/file | tail -B   or alternatively  tail -C /path/to/file | head -D   where A,B,C and D can be computed from the number of lines in the file, X and Y.  But there are two problems with this approach:   You have to compute A,B,C and D. The commands could pipe to each other many more lines than I am interested in reading (e.g. if I am reading just a few lines in the middle of a huge file)   Is there a way to have the shell just work with and output the lines I want? (while providing only X and Y)?


Given that we do not have in-house development resources and my Apex abilities are pretty basic, I usually try to stick to Process Builder, Flow, various out-of-the box declarative assignment/validation/etc rules.  But with self-updating automations (that is, a change on a record triggering an update on that same record), it occurs to me that the more efficient option would be a before trigger instead. It's less maintainable but it also takes less DML.  Generally speaking - is it best practice to have all self-updating automations be triggers then (as opposed to after update Processes that might even need to be recursive)?  Edit: To actually ask a specific question - I have a requirement to perform an update on every record on an object on every edit. I'm concerned about DML efficiency for this need in particular, but then the broader question occurred to me as well.

To automate some Business process either i can go for  Trigger/ Process Automation which include:- workflow, Approval Process, Process Builder, Visual Workflow.  Both Trigger and Process Automation help me to achieve this. so My Question is:- "when should i use Trigger and when to use Process Automation" ?


One can use the terms primary, secondary, and tertiary to describe the first, second, and third levels of something.  What would the fourth level be called? Would it be something like "quartiary" or "quartenary"? How about the fifth level?

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


I am trying to create a scrip that create a list of all features in my GDB, then select objects that intersect with a user given shapefile, and finally copy selected features to a new location. After I have successfully created a list with features within my GDB, I am having troubles selecting objects that intersect with the shapefile provided by the user. My code looks like this: import arcpy import os from arcpy import env  nuevaAOI = arcpy.GetParameterAsText(0)  pathBase = r"C:\Users\SCGEO\Documents\SIANCERO\InfoTematicaEIA.gdb" arcpy.env.workspace = pathBase      featureDataSets = arcpy.ListDatasets(feature_type='feature')      featureClasses = []      for fds in featureDataSets:     for fc in arcpy.ListFeatureClasses(feature_dataset=fds):         featureClasses.append(os.path.join(pathBase, fds, fc))      for f in featureClasses:     arcpy.SelectLayerByLocation_management(f,"INTERSECT", nuevaAOI, 2000, "NEW_SELECTION")  After I run the code an error message is prompt stating: "Parameters are not valid. ERROR 000368: Invalid input data. Failed to execute (SelectLayerByLocation)."  Can anybody give me a hint on this?

I am attempting to iterate over all the feature classes in a folder and I'm getting the error 000368. The other solutions in on SE were not helpful to me unfortunately, so I'm posting a separate question. search_grids is a list of point feature classes and searches is a another point feature class.   The points never actually intersect with each other, but I'm using the Select by location tool to select points within a specified distance of each other. This isn't the reason for the error though as I was able to get this to work in the python window in ArcMap.   My code is the following  arcpy.env.workspace = r"C:\workspace" search_grids = arcpy.ListFeatureClasses() searches = r"C:\workspace\search" for grid in search_grids:     arcpy.management.SelectLayerByLocation(grid,"INTERSECT",searches,"97.5 meters","NEW_SELECTION","INVERT")     arcpy.management.SelectLayerByLocation(grid,"INTERSECT",searches,"2.5 meters","ADD_TO_SELECTION","NOT_INVERT")   Why am I getting this error?       arcgisscripting.ExecuteError: Failed to execute. Parameters are not valid.   ERROR 000368: Invalid input data.   Failed to execute (SelectLayerByLocation)


I have a list of strings that I would love to change to lower cases and remove punctuations. I am able to change them to lower cases but fail to remove punctuations. Example of the string:  s = 'He is the best doctor. I highly recommend him."   With  slower = s.lower().split(" ")   I obtain  ['he', 'is', 'the', 'best', 'doctor.', 'i', 'like', 'him.']   This is good, but I still would like to detach punctuations from the words.  What's the easy way to do this? Thank you!!

It seems like there should be a simpler way than:  import string s = "string. With. Punctuation?" # Sample string  out = s.translate(string.maketrans("",""), string.punctuation)   Is there?


When I do, for example, 14 * 0.2, I get 2.8000000000000003 instead of 2.8. Why does it do this, and how can I fix it?    According to  page, Strings automatically cut trailing 0s off, so I tried    var foo = 14 * 0.2; console.log(foo.toFixed(3).toString());   but it still comes back with trailing 0s (2.800).

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


I have read that in using unreal conditionals, irrespective of personal pronouns, it mandatory to use subjunctives to form verbs.  " If Jack was playing they would probably win " - if I am correct, the verb 'was' should be replaced by the subjunctive 'were'.   I have taken the above sentence from a famous . Please let me why this sentence is correct ?

If I was... If I were...   When is it correct to use "If I was" vs. "If I were" in standard English?


Prove $\exists x (P(x) \to \forall y P(y))$.  Let x = y. Suppose P(x) is true. Let y be arbitrary. Since P(x) is true, it must be that P(y) is true. Since y was arbitrary, we can conclude that $\forall y P(y)$. Therefore $P(x) \to \forall P(y)$. Since $P(x) \to \forall P(y)$, $\exists x (P(x) \to \forall y P(y))$.  Is my proof correct?   I'm not sure if I'm dealing with the $\forall y$ correctly. If the theorem were $\exists x (P(x) \to P(y))$, I think I would have a good handle on things.

Why is this true?  $(\exists x)(P(x) \Rightarrow (\forall y) P(y))$


I have heard this many times before. Is there scientific evidence for this fact? Or have any of you come across this in your lives?

Is there any evidence to suggest that cycling adversely affects male fertility?


I filled an ESTA application. Two days later I received the following email from info@estausa.org      Dear John Doe,      We kindly ask you to reconfirm your Gender – Male or Female?      Before we can finish processing your application, we kindly ask you to reconfirm your Passport Issuance Date, Expiration Date and Number.      Please open your passport and confirm below.      Passport Issuance Date:      Day:      Month:      Year:      Passport Expiration Date:      Day:      Month:      Year:      Passport Number: –      We will process your application once we receive your response.      Please let us know if you have any questions.      Regards,      Customer Service Team ESTA USA      www.estausa.org info@estausa.org            DISCLAIMER: This domain and website is operated by a private company not affiliated with any government agencies, consulates or embassies.      CONFIDENTIALITY NOTICE: Email communication is intended to be viewed only by the listed recipient(s). It may contain information that is privileged and confidential. Any dissemination, distribution or copying of this message is strictly prohibited without our prior written permission. If you are not an intended recipient, or if you have received this communication in error, please notify us immediately by return e-mail.   This email (and email address) feels very weird to me. I quickly found  stating that there are fraud websites. Scrolling through my history, I realized that I used the website  and not . I seem to be the victim of a fraud.  I do not quite remember if I paid and what I paid when applying for this ESTA but I guess I paid something. I failed to see any payment on my personal bank account (via my bank website) though.  Am I the victim of a fraud (or legal but unreasonably expensive service)? What would you advise me to go from here?

A quick search for ESTA application returned many results. According to , the official site to apply for an ESTA is .  Are the others scams, legitimate third party resellers or "added value" services?    (defunct - domain is for sale circa 2020)     Can anyone confirm either way?  Updated 2020: The above have better "not affiliated with the U.S. Government" warnings now, but beware there are newer more sneaky sites starting all the time:        And fortunately more official guidance about this issue:


Following  I asked myself why the Sorting Hat would see Slytherin as a good option for Harry. As far as I know Harry wasn't cunning, he wasn't pureblood, nor was he power hungry or had great ambition.  But still the Sorting Hat said that Slytherin could lead him to greatness even if he had none of their values.     "Not Slytherin, eh?" said the small voice. "Are you sure? You could be great, you know, it's all here in your head, and Slytherin will help you on the way to greatness, no doubt about that -- no? Well, if you're sure -- better be GRYFFINDOR!

I know that the Sorting Hat wanted to for other reasons, but if he made the right decision then why did he ever want to? The Sorting Hat made it very clear that he chose the right house, then why did he ever consider putting Harry in Slytherin?


I want to do a Proof of concept (Multi node) on MAAS/juju and I'd like to know how many nodes juju needs to install Openstack ? How many NIC ? How many network 1,2,3 ? it is possible with 1 network ?  Can I control where the controller, the compute or cinder will be install on my maas cluster ? (which server?)  I don't want to use devstack or other tools "all-in-one" sorry to ask but on all my researchs, it's still not clear !

How do I install ? Is there an easier way other than official installation instructions?


In array there are four element so it size should be 4bit*4 = 16. (An int data type take 4 bit in my system to store the value.) But when i ran this code i only got 8 bit as the size of dynamicArray.  #include <stdio.h> #include <stdlib.h>  int main(void) {      //Dynamic arrays save memory by creating a pointer that stores     //the beginning of the array     int *dynamicArray = malloc(20 * sizeof(int));     *dynamicArray = 10;     printf("Address %x stores value %d\n", dynamicArray, *dynamicArray);      dynamicArray[1] = 20;     printf("dynamicArray[1] stores value %d\n", dynamicArray[1]);     dynamicArray[2] = 45;     printf("dynamicArray[2] stores value %d\n", dynamicArray[2]);     dynamicArray[3] = 34;     printf("dynamicArray[3] stores value %d\n", dynamicArray[3]);     printf("The size of dynamicArray is %d\n", sizeof(dynamicArray));      // Release unused memory:     free(dynamicArray);      return EXIT_SUCCESS; }   Here is the image of output.    Also suggest me website for C to check the in-built function properties or to know about them more. Thank you.

First off, here is some code:  int main()  {     int days[] = {1,2,3,4,5};     int *ptr = days;     printf("%u\n", sizeof(days));     printf("%u\n", sizeof(ptr));      return 0; }   Is there a way to find out the size of the array that ptr is pointing to (instead of just giving its size, which is four bytes on a 32-bit system)?


I can't get my WiFi to work on Kali Linux (Rolling 2017.2).   I recall that my wifi was working on earlier versions of Kali (and most of the guides I tried focused on those earlier versions) and I don't think it's a compatibility issue (drivers exist for this card and are/were working on other distro's). My Wifi card is this:  Network controller [0280]: Broadcom Limited BCM4360 802.11ac Wireless Network Adapter [14e4:43a0] (rev 03)   So I tried to do the standard things e.g. get the headers:  apt-get install linux-image-$(uname -r|sed 's,[^-]*-[^-]*-,,') linux-headers-$(uname -r|sed 's,[^-]*-[^-]*-,,')

#iwconfig  usb0      no wireless extensions.  eth0      no wireless extensions.  lo        no wireless extensions.  #ifconfig eth0: flags=4099<UP,BROADCAST,MULTICAST>  mtu 1500         ether ec:f4:bb:74:5f:f9  txqueuelen 1000  (Ethernet)         RX packets 0  bytes 0 (0.0 B)         RX errors 0  dropped 0  overruns 0  frame 0         TX packets 0  bytes 0 (0.0 B)         TX errors 0  dropped 0 overruns 0  carrier 0  collisions 0  lo: flags=73<UP,LOOPBACK,RUNNING>  mtu 65536         inet 127.0.0.1  netmask 255.0.0.0         inet6 ::1  prefixlen 128  scopeid 0x10<host>         loop  txqueuelen 1000  (Local Loopback)         RX packets 28  bytes 1596 (1.5 KiB)         RX errors 0  dropped 0  overruns 0  frame 0         TX packets 28  bytes 1596 (1.5 KiB)         TX errors 0  dropped 0 overruns 0  carrier 0  collisions 0  usb0: flags=4163<UP,BROADCAST,RUNNING,MULTICAST>  mtu 1500         inet 192.168.42.169  netmask 255.255.255.0  broadcast 192.168.42.255         inet6 fe80::f076:3aff:fe0d:f215  prefixlen 64  scopeid 0x20<link>         ether f2:76:3a:0d:f2:15  txqueuelen 1000  (Ethernet)         RX packets 10723  bytes 9294838 (8.8 MiB)         RX errors 0  dropped 0  overruns 0  frame 0         TX packets 9929  bytes 1471536 (1.4 MiB)         TX errors 0  dropped 0 overruns 0  carrier 0  collisions 0  #rfkill Usage:  rfkill [options] command Options:     --version   show version (0.5-1+b1 (Debian)) Commands:     help     event     list [IDENTIFIER]     block IDENTIFIER     unblock IDENTIFIER where IDENTIFIER is the index no. of an rfkill switch or one of:     <idx> all wifi wlan bluetooth uwb ultrawideband wimax wwan gps fm nfc   #lspci -knn | grep Net -A202:00.0 Network controller [0280]: Broadcom Limited BCM43142 802.11b/g/n [14e4:4365] (rev 01)     Subsystem: Dell Wireless 1704 802.11n + BT 4.0 [1028:0016]     Kernel modules: bcma   I have read a lot and still I can not get anywhere with this. I can not even see wireless option in my network connections. I never had such trouble with linux and wifi in the past and just installed kali where parrot os was working well on this machine. What am I missing and why isn't it working?


I was asked to prove this identity using two methods. I have already completed a proof by induction, but I don't know another method to prove this and the hint I was provided doesn't make any sense to me.  The hint provided was: For the other method, try to express $k(k!)$ as the difference of factorials.

$$\sum_{k=1}^nk(k!)$$  I know the answer is (n+1)!-1..I can solve this question using principle of mathematical induction...but I would like to know if there is any other alternative approach


If we look at this "sound family" of words, we see that they all seem to be about things going wrong:  crumble, tumble, rumble, fumble, bumble  (Perhaps there are others, although I exclude humble, mumble, grumble as not very similar.) Is there an etymological connection here — for example, some kind of pejorative suffix in older forms of English or the source languages — or is it coincidence?

From      And we show telltale signs of early hypothermia, what the doctor and   the National Institutes of Health and other cold-weather cognescenti   call the "umbles."      First we lose some fine motor skills, McLaren says, "and we start to   fumble. And tumble. And stumble."      Then our cognitive abilities are compromised. "We mumble and we   grumble."   Are the "umbles", such as fumble, tumble, stumble, mumble and grumble, etymologically linked, either in terms of sharing a common ending, or entire words having a common ancestor?  Trying to do a search of the etymology of the umbles ended up giving the etymology of the word  instead.


I am new to probability. I am working on this problem, but I am not sure if my approach is right. I'd really appreciate it is someone could please help me. Here is the problem:  A bag contains a pen which is either red or blue. I put a red pen inside the bag and shake it. Then, I take a pen out of the bag which is red. You are supposed to guess the color of the pen remained in the bag. What is the probability that the pen remained in the bag is also red?  So I think there are two different possibilities here:    the pen which we took from the bag, is the one when put inside, in that case the probability that the pen remained in the bag is also red, is 1/2.  The pen which we took from the bag, is not the one we put inside. So the probability that the pen remained in the bag is red, is 1.    Now if we add this to possibilities, we get 1.5 > 1 and it's clearly wrong! I don't understand why though.

In Pillow Problems and a Tangled Tale Lewis Carroll presents the following problem:     A bag contains a counter, known to be either white or black. A white counter is put in, the bag is shaken, and a counter is drawn out, which proves to be white. What is now the chance of drawing a white counter?   One can easily reason that in the end, the bag must be in one of three states:   Black remains, new white taken New white remains, original white taken Original white remains, new white taken   In two of those states, a white counter remains to be drawn. Therefore, the chance is 2/3.  How can one arrive to this answer using Bayes' theorem?


I would like to automatically insert vertical space between my paragraphs. Currently I am using \medskip before all my paragraphs. Example:  % proposal.tex % Based on http://www.latextemplates.com/template/simple-sectioned-essay \documentclass[12pt]{article}  \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage[a4paper, margin=2cm]{geometry} \usepackage[brazil]{babel}  \usepackage[utf8]{inputenc} \usepackage{mathptmx}  \usepackage{indentfirst}  \begin{document}  \section{Introdução}      In typesetting advertisement copy, a way of justifying paragraphs has     become popular in recent years that is somewhere between flushright     and raggedrightdddd setting. Lines that would stretch beyond certain limits     are set with their glue at natural width. This single paragraph is but an     example of this procedure; the macros are given next.      \medskip     Second paragraph.  \end{document}   Which generates:     I found about including the package \usepackage{parskip}. However after I do so, all my paragraphs indentations are disabled.     Therefore  I found I could use \setlength{\parindent}{30pt} to reset the paragraph indentation, however I am not sure this is a nice thing to do.  % proposal.tex % Based on http://www.latextemplates.com/template/simple-sectioned-essay \documentclass[12pt]{article}  \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage[a4paper, margin=2cm]{geometry} \usepackage[brazil]{babel}  \usepackage[utf8]{inputenc} \usepackage{mathptmx}  \usepackage{indentfirst}  \usepackage{parskip} \setlength{\parindent}{30pt}  \begin{document}  \section{Introdução}      In typesetting advertisement copy, a way of justifying paragraphs has     become popular in recent years that is somewhere between flushright     and raggedrightdddd setting. Lines that would stretch beyond certain limits     are set with their glue at natural width. This single paragraph is but an     example of this procedure; the macros are given next.      Second paragraph.  \end{document}   Which generates:    I would like to know whether there is a best way which I can include the package \usepackage{parskip} and keep the default LaTeX paragraph indentation, instead of overriding the overrode value with \setlength{\parindent}{30pt}.

That may be a stupid question but is there a way to keep the indent while using the parskip package? I use parskip to keep spacing between my paragraphs while leaving the table of contents and lists intacts but I would like to keep the indents in my text.  Code 1 :  \usepackage{parskip}  \tableofcontents  \section{Section 1} \subsection{Sub 1}  Paragraph 1  Paragraph 2   Code 2  \setlength{\parskip}{10pt}  \tableofcontents  \section{Section 1} \subsection{Sub 1}  Paragraph 1  Paragraph 2   Basically I want the aspect of the table of contents (and possible lists) from the code 1 while keeping the indent like in the code 2. The package parskip works great but I just don't like that it deletes the indents and I'd like to find a way to prevent it from doing that.   Thank you.


Does the Lagrangian formalism require a metric on the configuration manifold $Q$ in order to define a Lagrangian $L$ on the tangent bundle $TQ$?  Further, if we specify a metric on the tangent bundle then we can via an isomorphism, move this to the cotangent bundle $T^*Q$. That being said how does this metric structure interplay with the symplectic structure?

My question is, can the (classical) Lagrangian be thought of as a metric? That is, is there a meaningful sense in which we can think of the least-action path from the initial to the final configuration as being the shortest one? Then the equations of motion would be geodesics - not in physical space, but in phase space, with the metric defined by the Lagrangian. Below is a slightly expanded outline of this idea, outlining why I think it might make sense.  (Classical) Lagrangian mechanics is derived by assuming the system takes the path of minimum action from its initial state to its final one. In the formalism of classical mechanics we normally write time $t$ as a special type of coordinate, quite distinct from the other (generalised) coordinates $\mathbf{q}$.   However, if we want we can lump these together into a single set of "generalised space-time coordinates" $\mathbf{r} = (t, q_0, q_1, \dots)$, to be considered a vector space of dimension $1+n$, where $n$ is the number of degrees of freedom. Then the action is just a function of curves in $\mathbf{r}$-space, and the equations of motion are determined by choosing the least-action path between two points, $\mathbf{r_0}$ and $\mathbf{r_1}$. In this picture, $L$ depends upon the position and direction of the curve at each point along it, and the action is obtained by a line integral along the curve.  This has a pleasingly geometrical feel, and so my question is, is there a meaningful sense in which I can think of the least-action path as being the shortest path, with the Lagrangian playing the role of a metric on $\mathbf{r}$-space? Or is there some technical reason why $L$ can't be thought of as a metric in this sense?  Note that this isn't in general the same as a metric defined on space-time. For an $m$-particle system in $3+1$ space-time, $\mathbf{r}$ will have $3m+1$ dimensions, rather than 4. I'm interested in the notion of a metric in $\mathbf{r}$-space defined by $L$, rather than the more usual picture of $L$ being defined in terms of a metric on space-time.


I need a way to calculate the loan amortization on a 7 year term loan that only has 8 principal and interest payments per year and 4 interest only payments.

Hi I can compute a Basic Loan Amortization Schedule, But now I'm trying to Calculate a Seasonal Loan Amortization Schedule . So for example A loan starts at January And Will go on for 3 years, with Monthly Payments. Interest is at 3% Annually and is compounded Annually. During the months of September, October, November, December It'll only accumulate Interest But no payments and principal. Principal is 100000. How Do I calculate Payments and interest.


I've seen a few Questions for this but can't find anything useful or recent.  Is it possible to have 2 people physically sat at a linux box logged with separate monitors/kb/mice?  I've had to work late the past few days and my younger daughter is upset she has missed out on playing about with scratch.  I thought it would be good if we could have worked side by side.  I'd prefer it if she was logged under her own user.  Currently running mint rosa if that makes a difference.  Edit: As I mentioned there are older questions about this, the one quoted is 5 years old and involves a lot of tinkering and experimenting.  While I enjoyed this 18 years ago despite blowing up a rather expensive monitor due to a typo in a config file (got my refresh rate wrong), nowadays I just like to get on with my work.  I was hoping there was something more recent that made things easier.

Since modern PCs can use two screens at the same time I wonder if it is possible to plug in two keyboards and mouses as well to have the two screens run two (more or less) independent X-sessions at once?


If someone ask me "Do you like Indian movie?"  Which tenses would fit the answer to the question ?   "yes I do. But I watched only some of them" "yes I do. But I have wathed only some of them" "yes I do. But I had watched only some of them"   thanks in advance  budi

Non-native speakers often get confused about what the various tenses  and aspects mean in English. With input from some of the folk here I've put together a diagram that I hope will provide some clarity on the matter.  I offer it as the first answer to this question. Consider it a living document. Input is welcome, and good suggestions will be  incorporated into the diagram.    Nota bene: What this is not is a discussion of whether there are  more than two tenses in English. , to which this question is not intended to supply arguments one way or the other.  Here, the aim is to provide an overview of what constructions English-speaking people use for conveying information about actions referring to past, present, and future, and to provide it first and foremost to precisely the people who are likely to use "tense" as a catch-all term in their search, rather than to linguists who know better.  Breaking News There is now an excellent ELU blog article titled  . It is highly recommended reading.


"One need look no further.." Shouldn't it be "One needs look no further.."-

Consider:  I need to do this. I need do this.  My English grammar knowledge tells me that "need" doesn't have the same status as the modal verbs "may", "can", "should" and what not. Hence the second usage where two verbs appear consecutively is incorrect. But yesterday, my native English speaking friends (Americans) told me that "I need compute this." is a perfectly grammatical sentence, and one is simply omitting the "to". How can this be? Is it a colloquial usage but grammatically incorrect, or is it grammatically correct? If it is grammatically correct, is it because "need" is a semi-modal verb? EDIT: in particular, is it okay to use "need compute" in a scientific paper? EDIT2: the exact phrase that raised the question was "The advantage of this representation is that we need only compute sums and products"


I would like to know if C# has a way of defining strongly-typed nested jagged arrays without using object[].   Something like:   var nested = new {1, 2, {3, {4, 5}, 6}, 7};   I would like to have a nested array of int.  Consider this array below: [[1, 2, [3]], 4, [5], [[[6]]]]  This is how I've done it:  var myNestedJagged = new object[] {     new object[]     {         1, 2, new object[] {3}     },     4,     new object[] {5},     new object[] {new object[] {new object[] {6}}} };

I was looking for a tree or graph data structure in C# but I guess there isn't one provided.  explains a bit about why.  Is there a convenient library which is commonly used to provide this functionality?  Perhaps through a strategy pattern to solve the issues presented in the article.  I feel a bit silly implementing my own tree, just as I would implementing my own ArrayList.     I just want a generic tree which can be unbalanced.  Think of a directory tree.  C5 looks nifty, but their tree structures seem to be implemented as balanced red-black trees better suited to search than representing a hierarchy of nodes.


I am a solo developer and I depend heavily on SO for help. Lately when I post a question, only a few people look at it, and hardly anyone responds. I really need to change this. What can I do to get more views?  Here is a link to a question I recently submitted:

I was wondering what might be making my questions less attractive to users?  I get very low views most of the time. What should be done to increase a question's popularity?


My laptop is HP 655.  I had Windows 7 installed in UEFI mode, then I installed Ubuntu 17.04 on another partition.  There was no option for Ubuntu in the boot manager, only Windows 7.  Then I used the BIOS recovery tool and now Ubuntu is the only one showing and I can't boot Windows 7.  How can I show the two boot options?

I installed Windows on my computer, followed by an installation of Ubuntu. However, now I'm unable to boot into my Windows install.  What can I do to fix this?


I'm trying to write a program that finds the salvage value of an item after entering the purchase price, annual depreciation, and years of service.   Annual Depreciation= (Purchase Price-Salvage Value)/Years of Service   When inputting 5000, 8, 5.25 I should return 4958.00000

Why is it that scanf() needs the l in "%lf" when reading a double, when printf() can use "%f" regardless of whether its argument is a double or a float?  Example code:  double d; scanf("%lf", &d); printf("%f", d);


In the future a Man was involved in an accident and lost the lower half of his body. He gets a Prosthetic that replaces everything from his waist down. The prosthetic is also cybernetic, (an AI of sorts)  One specific scene I remember is the man was trying to get something from a storage tank/container. (I think it was a rail car) He is half way into the opening trying to reach inside when the hatch closes right on his hips crushing him. (I do not remember if this was the accident that caused him to get the prosthesis or if this accident destroyed his prosthesis. I THINK this destroyed his prosthesis, I vaguely remember his legs AI telling him this was a bad idea to reach in the container)  Possibilities:   I think cryogenic storage is involved in the story. I think he had an accident or illness that caused him to lose his lower body, and was  frozen until they could heal him.  When he awakened, [ran out of  money? Society no longer interested in storing frozen people?] they  could not fix him and gave him the prosthesis instead. He may have re-entered cryo hoping to find a way to replace his prosthesis, and when he awakened again he could still not be fix, I THINK this is when he was reaching into the storage tank and his prosthesis was crushed. I recall at this point, that either he could not afford a replacement or tech had devolved so that no one could make a replacement.  And for a time he was dragging himself around by his hands.   I think he was a bit of a miscreant or minor troublemaker. (would not follow the rules, ie he did not need anything from the storage tank, he was doing it because he wanted to)  This would have been a book in English, Published in Paperback in the USA.

I remember reading a book fifteen to twenty years ago that had the following charactersitics:   The main character was a man who at some point lost the lower part of his body (legs & pelvis) He was placed in suspended animation / cryogenic sleep at one point in the story The story may have included a whale/leviathan-esque "character" (but I may be conflating two stories in my memory) At one point in the story he drags himself through some air-vent-esque piping   I'm fairly sure it was written by one of the "big" authors and that, at least in the printing I read, the cover had a whale/leviathan on it.  Could anyone identify this book?


If a tunnel is dug by some people along the diameter  of earth and then a ball is thrown through it starting from North Pole  to  South Pole  whether it            A) stops at center                                    B) comes to the other pole and stop          C) goes out of tunnel.                             D) it just moves up and down.

...And you jumped in.  What would happen when you got to the middle of the Earth? Would you gradually slow down, until you got to the middle and once you were in middle would every direction feel like it was up?


Consider $C^1[a, b] = \{f: [a, b] \to \mathbb{C}\mid f\text{ continuously differentiable}\}$.  Consider the following norm:  $$\|f\|_{C^1} = \|f\|_\infty + \|f'\|_\infty$$  Now, it needs to be shown that $C^1[a, b]$ is complete with regard to the $\|\cdot\|_{C^1}$-Norm (using the definition for complete that a metric space $X$ is complete $\Longleftrightarrow$ every Cauchy-series in $X$ also converges in $X$).  I know that $C^1[a, b]$ is not complete in respect to the $\infty$-norm. I guess these special Cauchy-sequences of functions that do not converge in $C^1[a, b]$ using the $\infty$-norm simply aren't Cauchy-sequences in respect to the $C^1$-norm. But how can this be proven? Thanks in advance.  Edit: The linked thread only asks for why $||f||_{C^1}$ is a norm, and doesn't deal with whether or not $C^1[a, b]$ is complete regarding this norm at all, which is the specific topic of this thread.

Consider the space of continuously differentiable functions, $$C^1([a,b]) = \{f:[a,b]\rightarrow \mathbb{R}\mid f,f' \text{ are continuous}\}$$ with the $C^1$-norm $$\lVert f\rVert := \sup_{a\leq x\leq b}|f(x)|+\sup_{a\leq x\leq b}|f'(x)|.$$ Prove that $C^1([a,b])$ is a Banach Space.   This was the proof we were given: Assuming $C^1([a,b])$ is a normed linear space all we need to show is completeness. Let $(f_n)$ be a Cauchy Sequence in $C^1([a,b])$ with respect to the $C^1$-norm. Then each $f_n,f'_n\in (C([a,b]),\|\cdot\|_{\sup})$. We know that $C([a,b])$ is complete and thus there exists $f,g\in C([a,b])$ such that $f_n\rightarrow f$, and $f'_n\rightarrow g$ (uniformly) with respect to $\|\cdot\|_{\sup}$. If we let  $$ F_n(x) = \int_a^x f_n(t)dt, \hspace{2mm}  F(x) = \int_a^x f(t)dt $$ then $F_n\rightarrow F$ uniformly because  $$\lVert F_n-F\rVert_{\sup}\leq \sup_{a\leq x\leq b}\int_a^x|f_n(t)-f(t)|dt\leq \lVert f_n-f\rVert_{\sup}<\epsilon.$$ From the fundamental theorem of calculus: $$f_n(x)-f_n(a) = \int_a^x f'_n(t)dt $$ Since $f'_n\rightarrow g$ uniformly then  $$ \int_a^xf'_n(t)dt\rightarrow \int_a^x g(t)dt $$ Since we know that $f_n\rightarrow f$ uniformly, $$f(x)-f(a) = \int_a^x g(t) dt $$ which by the fundamental theorem of calculues implies $f'=g$. So we know have $f_n\rightarrow f$ and $f'_n\rightarrow g=f'$ which mean $f_n\rightarrow f\in C^1([a,b])$ with respect to $C^1$-norm. So every cauchy sequence converges. Hence $C^1([a,b])$ is a Banach Space.   So I understand most of the proof. Where I get confused is that how did we actually show this satisfies the $C^1$-norm? Maybe I don't understand what this norm actually does.   Thank you for any help, comments and advice!


I have a pointer returned from malloc. Which points to first byte of allocated size. For EX:    void* p=malloc(34);   How to print the binary values contained in those 34 bytes. ?

I can print with printf as a hex or octal number.  Is there a format tag to print as binary, or arbitrary base? I am running gcc. printf("%d %x %o\n", 10, 10, 10); //prints "10 A 12\n" print("%b\n", 10); // prints "%b\n"