I am writing a manual and I want to include tips and tricks trough out the chapters. A last chapter will collect all the tips and tricks that I included in the book. So I found the package collect. It does give instruction for a custom environment, so I decided to make a box with that so tips and tricks are clearly seperated from the regular text (using tcolorbox).  I applied the example from the :  \documentclass{book} \usepackage{collect}  \definecollection{gra} \newenvironment{grammarpart}[1]{% \@nameuse{collect*}{gra}{% \emph{Start of grammar ‘#1’}\par% }{% \par\emph{End of grammar}\par% }{% \subsection{#1}% }{% \par See some section in the text. }% }{% \@nameuse{endcollect*}% }  \begin{document} \chapter{Foo} \begin{grammarpart} bar \end{grammarpart} \end{document}   Typesetting this resulted in the following error, tried this with pdfLaTeX and XeLaTeX:  ! You can't use `\spacefactor' in vertical mode. \@->\spacefactor                   \@m {} l.10 b       ar ?   I also experimented with \grammarpart{test} instead of begin/end arguments. However, that did gave me the same error as well.  I searched on \spacefactor and the use of \@. But to be fair, at that point it became black magic for me. So how do I get this example to work? Or is there a package that allows me to collect environments for a later chapter?

Many LaTeX “hacks” begin with \makeatletter and end with \makeatother. What do these commands do?


I am currently running a dual boot system for windows 10 and ubuntu 18.10. I have 1.5 TB for windows and 500 GB for ubuntu. I want to do a fresh installation of ubuntu 19.04, and completely remove windows from my laptop, giving me 2TB for ubuntu. I know how do a fresh installation, but I don't know how should I do it so as to remove windows and merge those 2 partitions into 1. Can someone please give me some hints on how I can do this? Thanks...  On a side note, I read on Ubuntu's site that that 19.04 won't receives updates after Jan 2020, does it mean that it may be a bad idea to install 19.04?

What are the differences between an Ubuntu Long Term Support release (LTS) and a normal release?


According to this Q&A:  there was a missing feature in the API, what hindered apps to push edits into the suggested edits queue. According to the same Q&A this feature was added in December 2014.  When will this feature be available in the StackExchange App?  Related Q&As:

I edited a question, on Stack overflow and when submitting preview, got red bar telling me my account isn't allowed to make suggested edits.  On the Sandbox android question it works fine, but that is editing an answer to my question.   The message I receive is:     Account is not allowed to suggest edits   Are the rules for suggested edits different for Android app?


I don't see an answer to this , so:  Can I borrow points from one Stack Exchange site for a bounty on another?  Specifically, I want to move some points from one of my other Stack Exchange accounts so that I can start a bounty on a question I posted at Super User, where I only have 38 points.

I think it would be useful if we had an option when deciding to open a bounty on a question that we could choose to allocate rep from one site even though the bounty is being offered on another site.  For instance I would like to use my rep from SO for putting a bounty on a question that resides on SF. I don't have enough rep on SF to make it enticing. So when you click on "start a bounty" you get sliders for each site that you can pull your rep from, maybe make it where you need to burn up all your rep for the site that your asking the question on and then allocate more rep from other ones, if you have it.  thanks devinb for clearing up my question with your comments! " transfer rep INTO a bounty. But you can't transfer rep across accounts. So, the rep you'd 'lose' from SO would never actually go into your SF account, it would go straight onto a bounty on whatever question." – devinb


SELECT GROUP_CONCAT(DISTINCT(fullname) SEPARATOR ';')AS "FULLNAMES"   FROM Users;   I want to retrieve the fullnames of Users in a single row. However, the statement gives an incomplete result returning only the first 254 characters.  Is it possible to surpass this limitation?  Some might suggest to use the statement below instead and iterate through the result in my application but there's something that I would like to know.  SELECT DISTINCT fullname   FROM Users;

The SQL...  UPDATE Threads t  SET t.Content = (     SELECT GROUP_CONCAT(a.Content ORDER BY a.PageID SEPARATOR '<!-- pagebreak -->')      FROM MSarticlepages a     WHERE a.ArticleID = t.MSthreadID GROUP BY a.ArticleID )   As you can see it takes all of an article's pages (which are each stored as longtext in separate rows) and GROUP_CONCATs them into a single longtext row. The problem is the results are only so many characters and then it gets completely truncated, losing about 90% of the contents. Does CONCAT not handle longtext very well or is there something else I am doing wrong?


Can anyone please tell me how to change my name and profile picture on Stack Exchange?

Where does the image come from? How do I change my profile picture, or avatar? How do I change my profile picture on all SE sites at once? How can I use different avatars on different SE sites? How do avatars work? How do the SE sites know when I changed my Gravatar? Why do SE sites show a different Gravatar identicon than other sites where I use the same email address? How can I use a Gravatar image after logging in to facebook.stackoverflow.com? I changed my picture but am still seeing the old one    See also:


I'm trying to instantiate and register listener classes in a loop, based on a list of event classes.  I'm trying to use a list such as:  static final Class[] USER_EVENTS_HANDLED = {     FirstEvent.class,     SecondEvent.class };   I have a bunch of listener classes, one for each:  FirstEventListener extends MyAbstractListener<T extends MyEvent> SecondEventListener extends MyAbstractListener<T extends MyEvent>   I'm currently manually registering the event class and listener class explicitly:  eventManager.registerListener(FirstEvent.class, new FirstEventListener()); eventManager.registerListener(SecondEvent.class, new SecondEventListener());   I'm trying to not duplicate the event name twice, for maintainability.  I build the name of the listener class from the event class, but I'm struggling to come up with the right way to create a new instance of the listener using that.  First tried newInstance, but then realized generics had to be treated specially.  I got something like this snippet of code from somewhere:  private static class ListenerGenerator<E> {     E generateListener(Class<E> clazz, Constructor constructor) throws Exception {         return (E) constructor.newInstance();     } }   So to make that work, I tried calling "getConstructor", along with some other approaches, but that keeps resulting in a NoSuchMethod error.  What's the simplest approach to accomplish my goal?  NOTE: This is not a duplicate of the question just asking about creating an instance of a generic class in Java.  It's a more specific case requiring a significantly more complex solution.

Is it possible to create an instance of a generic type in Java? I'm thinking based on what I've seen that the answer is no (due to type erasure), but I'd be interested if anyone can see something I'm missing:  class SomeContainer<E> {     E createContents()     {         return what???     } }   EDIT: It turns out that  could be used to resolve my issue, but it requires a lot of reflection-based code, as some of the answers below have indicated.  I'll leave this open for a little while to see if anyone comes up with anything dramatically different than Ian Robertson's .


I'm developing a plugin. This plugin creating a new post type and displaying these posts in a custom template.  For example it's a event calendar plugin. This plugin creating a new post type 'event '. Users adding new events from wp - admin, like normal blog posts. And users creating a new page with 'Event Calendar ' page template.  But for enabling Event Calendar page template, users have to copy eventcalendar.php from plugin's dir to their template's dir.  Last step (copying file) is really hard for some users. Is it possible to call custom page template from plugin dir?

I want to check for an appropriate template in the theme folder before falling back to the file in my plugin directory. Here’s my code:  add_filter('template_include', 'sermon_template_include'); function sermon_template_include($template) {     if(get_query_var('post_type') == 'wpfc_sermon') {         if ( is_archive() || is_search() ) :            if(file_exists(TEMPLATEDIR . '/archive-wpfc_sermon.php'))               return TEMPLATEDIR . '/archive-wpfc_sermon.php';            return dirname(__FILE__) . '/views/archive-wpfc_sermon.php';         else :            if(file_exists(TEMPLATEDIR . '/single-wpfc_sermon.php'))               return TEMPLATEDIR . '/single-wpfc_sermon.php';            return dirname(__FILE__) . '/views/single-wpfc_sermon.php';         endif;     }     return $template; }   Problem is, it doesn’t work! :-) It always picks the file in my plugin folder. Any idea what to do? I’ve tried alot of variations but I can’t seem to get anything to work! Thanks in advance! Jack  EDIT  I'm expecting the archive-wpfc_sermon.php to be returned from the theme folder if it exists. However, the file from my plugin always gets returned. Thanks for your help! This is from my Sermon Manager plugin available in the repository.


I am currently trying to create a program that will ask user for number of classes the user is enrolled in, make an array to store that data, and then ultimately display all that information in a print statement. I am not worried about the final print statement but I just cant seem to make the array work. There are no errors in the program but once it asks me to input class number, It returns "Exception in thread "main" java.lang.NullPointerException     at GPAreport.main(GPAreport.java:24)"  Heres the code:   import java.util.*; public class GPAreport { public static void main (String [] args) {  int classnumber[] = null;  double gpa[]; String ClassDescription[] = null; Scanner myScanner = new Scanner(System.in);  String LetterGrade = ""; double GradePoints = 0; double PercentageGrade = 0; String currentterm, studentname = ""; int numberofclasses;  System.out.println("Please enter the current term (ex: fall 2011):"); currentterm = myScanner.nextLine(); System.out.println("Please enter Student Name:"); studentname = myScanner.nextLine(); System.out.println("Please enter number of classes:"); numberofclasses = myScanner.nextInt();  for(int i = 0; i <= numberofclasses ; i++){      System.out.println("Input Class Number: " + (i+1));     classnumber[i] = myScanner.nextInt();     System.out.println("Input class description: " + (i+1));     ClassDescription[i] = myScanner.nextLine();     System.out.println("Input percentile grade for: " + classnumber[i]);     PercentageGrade = myScanner.nextDouble();          if ((PercentageGrade < 100) && (PercentageGrade >= 93 )){         LetterGrade = "A";         GradePoints = 4.0;              }         else if ((PercentageGrade > 100)){          LetterGrade = "A+";         GradePoints = 4.0;             }         else if ((PercentageGrade < 93) && (PercentageGrade >= 90 )){          LetterGrade = "A-";         GradePoints = 4.0;             }         else if ((PercentageGrade < 90) && (PercentageGrade >= 83 )){          LetterGrade = "B";         GradePoints = 3.0;             }         else if ((PercentageGrade < 83) && (PercentageGrade >= 80 )){          LetterGrade = "B-";         GradePoints = 3.0;             }         else if ((PercentageGrade < 80) && (PercentageGrade >= 73 )){          LetterGrade = "C";         GradePoints = 2.0;             }         else if ((PercentageGrade < 73) && (PercentageGrade >= 70 )){          LetterGrade = "C-";         GradePoints = 2.0;             }         else if ((PercentageGrade < 70) && (PercentageGrade >= 63 )){          LetterGrade = "D";         GradePoints = 1.0;             }         else if ((PercentageGrade < 63) && (PercentageGrade >= 60 )){          LetterGrade = "D-";         GradePoints = 1.0;             }         else if ((PercentageGrade < 60) && (PercentageGrade >= 0)){          LetterGrade = "F";         GradePoints = 0;             }         else if (PercentageGrade < 0){          System.out.println("That is not a valid score. Please try again");             }  }   }  }

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


After resuming I have a graphics issue with textures (not sure, see screenshots).  Windows frame:    Viber app:    Also some other apps are affected.  Some video info:  $ lspci | grep 'VGA\|3D' 00:02.0 VGA compatible controller: Intel Corporation 4th Gen Core Processor Integrated Graphics Controller (rev 06) 01:00.0 3D controller: NVIDIA Corporation GM204M [GeForce GTX 970M] (rev a1)  $ glxinfo | grep OpenGL OpenGL vendor string: NVIDIA Corporation OpenGL renderer string: GeForce GTX 970M/PCIe/SSE2 OpenGL core profile version string: 4.5.0 NVIDIA 375.39 OpenGL core profile shading language version string: 4.50 NVIDIA OpenGL core profile context flags: (none) OpenGL core profile profile mask: core profile OpenGL core profile extensions: OpenGL version string: 4.5.0 NVIDIA 375.39 OpenGL shading language version string: 4.50 NVIDIA OpenGL context flags: (none) OpenGL profile mask: (none) OpenGL extensions: OpenGL ES profile version string: OpenGL ES 3.2 NVIDIA 375.39 OpenGL ES profile shading language version string: OpenGL ES GLSL ES 3.20 OpenGL ES profile extensions:   Unity reload (Alt+F2 → unity) helps, but it crashes the most of open apps.  Any suggestions?  UPD: seems like it is bug of NVidia card/driver (reproduced with nvidia-367, nvidia-370, nvidia-375, nvidia-378).

After some gorgeous updates I witness this:


import java.util.*;  public class HelloWorld{     public static void main(String []args){        static String[] str={"one","two"};        Date date =new Date();        Calendar cal = Calendar.getInstance();        String year = "2018";        String month ="4";        int day =10;         cal.set(Integer.parseInt(year),Integer.parseInt(month),day);        System.out.println(cal.get(Calendar.DAY_OF_WEEK));        // etc.     } }   Error message :     error: illegal start of expression      static String[] str={"one","two"};

To be specific, I was trying this code:  package hello;  public class Hello {      Clock clock = new Clock();      public static void main(String args[]) {         clock.sayTime();     } }   But it gave the error      Cannot access non-static field in static method main   So I changed the declaration of clock to this:  static Clock clock = new Clock();   And it worked. What does it mean to put that keyword before the declaration? What exactly will it do and/or restrict in terms of what can be done to that object?


For some file sharing I had to install X2Go Client, which removed some packages. I think it also removed ubuntu-desktop packages, since I cannot find the file explorer and libre office anymore.  I'm trying to reinstall these packages by running sudo apt install ubuntu-desktop, resulting in  Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  ubuntu-desktop : Depends: nautilus but it is not going to be installed                   Recommends: libreoffice-calc but it is not going to be installed                   Recommends: libreoffice-gnome but it is not going to be installed                   Recommends: libreoffice-impress but it is not going to be installed                   Recommends: libreoffice-math but it is not going to be installed                   Recommends: libreoffice-ogltrans but it is not going to be installed                   Recommends: libreoffice-writer but it is not going to be installed                   Recommends: nautilus-share but it is not going to be installed E: Unable to correct problems, you have held broken packages.   Output of apt-cache policy nautilus ubuntu-desktop:  nautilus:   Installed: (none)   Candidate: 1:3.26.3-0ubuntu4   Verstion table:     1:3.26.4-0~ubuntu18.04.4 -1       100 /var/lib/dpkg/status     1:3.26.3-0ubuntu4 500       500 http://archive.ubuntu.com/ubuntu bionic/main amd64 Packages ubuntu-desktop:   Installed: (none)   Candidate: 1.417   Version table:     1.417 500       500 http://archive.ubuntu.com/ubuntu bionic/main amd64 Packages   Installing separate packages (nautilus, libreoffice) also results in similar errors. Actions taken so far:   Use aptitude for installation Remove X2Go Client before installation First run sudo apt install -f First run sudo apt --fix-broken install Run sudo apt install --reinstall ubuntu-desktop Run sudo dpkg --configure -a && sudo apt autoremove -y && sudo apt autoclean && sudo apt remove && sudo apt clean && sudo apt update && sudo apt install -f && sudo apt full-upgrade -y   Using Ubuntu 18.04.2 LTS

After upgrading from 10.04 to 12.04 I am trying to install different packages.  For instance ia32-libs and skype (4.0).  When trying to install these, I am getting the 'Unable to correct problems, you have held broken packages' error message.   Output of commands:  sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   After running this:  sudo dpkg --configure -a foo@foo:~$ sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.


I have a problem with my Armature, to be more specific, it's 3 bones which makes the problem. I have a Pony character which I wanted to rig, so I made an armature which works great, but I can't connect my Root bone to the Front legs and neck section. (see picture) I watched a few tutorials on the internet and read , but all they said was to flip the bone from the Head to Tail and connect them together. I don't want to flip, but connect Head to Head.  Can I do this? I can't move the legs and the neck/head section from the Root(Spine) bone. Here are some pictures. I marked the Root bone with a White circle and the other bones which I want to connect with Red circles.

I have a simple armature that has three loose bones that I would like to join at one joint. Is there a way I can join these 3 into a single joint?


I have a template function with a quite common specialization, that I would like to instantiate only once in a library to avoid unnecessary code compilation. To this end I'd like to use extern template in the header declaring the main template, so that every translation unit including the header won't instantiate the template. For example: // ******** test.h *******  #include <iostream>  template <typename T> void f(T t){     std::cout << t << std::endl; }  extern template void f<int>(int t);        // ******** test.cpp *******  #include "test.h"  template<>    void f<int>(int t){ }  template void f<int>(int t);  Compiling with g++ I get this error: $ g++ test.cpp test.cpp:4:18: error: specialization of 'void f(T) [with T = int]' after instantiation     4 | void f<int>(int t){       |                  ^  If I remove the extern template from the header the code compiles fine. I don't clearly understand where the error lies nor how to eventually fix it. Thanks in advance for any help.

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


I'm fairly new to Blender.  I am trying to inset the roof on the top of this building...the roof is below the top of the walls. As you can see from the picture, the wall is higher than the roof with a thick border along the edge. What I need is a kind of "create inner edge (or cut) along the border" at the same distance from my existing border all the way around so I can keep the wall height and lower the plane of the roof down where it should be. Can someone tell me how to do this?

I am trying to set up a Minecraft rig mouth that will have more controls and will be rounded, but I am having issues trying to figure out what this guy did here. First, he did what looked like a loop cut and slide, but instead of drawing a line it selected all the edges it passed through. He then cut to a new clip where the mouth was already set up like this.    The video is in 3 times speed but if you download a youtube plugin you can slow it down to 0.25 speed of the video and then if you do the spacebar trick you can slow it down so it shows 1 frame at a time and it is really slow.  if you want or need to see the video.  All I am asking is how can I create those 8 basic segments.


Is the video game Star Wars: Knights of the Old Republic blessed by Lucas and considered canon? As a secondary question, has George Lucas ever officially sanctioned anything in the Star Wars expanded universe?  I guess what the real question is; once some Star Wars media is licensed by Lucas, is it considered official canon or not? Examples pro and con would be great.  UPDATE: What I really want to know is what makes something canon in the Star Wars universe, and an article in Wookieepedia or Wikipedia is great and all but not an answer.  I will leave up the previous question(s) to show the progression of the question.

For all types of derivative works, namely:   Movies Novels Comic books Other written works (including RPG materials) Cartoons Video games Derivative movies (such as the infamous Ewok movies and even more infamous )   According to what rules does something become "canon" and who is responsible for the evaluation of a published work?


I am using windows 8.1 64 bit  I am unable to remove the read only attribute on folders on my computer. I have tried multiple folders on my desktop, and in my documents folder, if I uncheck the read only box and hit apply, then close and reopen the properties window, the box is checked again. This applies to all folders I have checked. How can I allow full read and write privileges to these folders?

I think I'm going crazy. Every time I create a folder it automatically is set to readonly, but I can still then rename the folder or add folders to it. If I attempt to uncheck the readonly flag it becomes checked again when I next open the folder properties. What the heck? Could my IT dept really have set up a policy like this somehow? If so, how?  Seems crazy that Windows would even do this -- no errors when I uncheck read-only and hit ok but the change fails.  Also, it is the halfway checked state -- greyed out and checked, but uncheckable.


Good manners says to say thank you when somebody answers your question. E-mail load control suggests not replying "thanks" because it's too much e-mail and people would rather have less. I'm not sure what StackOverflow expects. I got an e-mail notification today "3 Questions Have 1 Answer - Stack Overflow". When I clicked, only 1 of the answers was new to me. That one was a short, correct, and complete answer. :-)  I cannot vote it up because I don't have reputation.  Should I comment "thanks" on it?

What does it mean to accept an answer? How do I accept an answer, and what are the rules? Can I accept my own self-answer? What are the reputation benefits? Which answer should I accept? Should I upvote the accepted answer? What should I do if none of the answers are suitable?      For more information, see "" in the .


I have a spreadsheet with various feature data; I would like to add this data to an existing shapefile.  I have a common column in both the shapefile and the excel data.  I would like to be able to add symbols of the new data to the drawing.  I am working with ArcGIS 10.1.

I have a shapefile of lower layer super output areas (LSOA) for England and Wales and I have a spreadsheet of the indices of deprivation for each of the LSOA's in England. I want to join the deprivation data to the shapefile so it can be mapped in ArcMap. I tried joining the table through the Join and Relates > Join option and put in the fields for the LSOA data for both shapefile and spreadsheet (the data that matches). the attribute table added the datafields to the attribute table from the excel spreadsheet but all of the data is blank!!   I have tried looking at the field "type" as ive read that it has been an issue before but it seems to be OK.  Is there anything anyone can suggest?


I easily see that the order is $mn$, but am confused on how to show that $G \times G'$ will be cyclic. I know I need to find an element $(x,y) \in G \times G'$ that has order mn but I'm not sure how to find that element. For example, if we are considering two groups of order $5$ and $11$, I don't know what to look for. Any guidance is much appreciated :)

Say you have two groups $G = \langle g \rangle$ with order $n$ and $H = \langle h \rangle$ with order $m$. Then the product $G \times H$ is a cyclic group if and only if $\gcd(n,m)=1$.  I can't seem to figure out how to start proving this. I have tried with some examples, where I pick $(g,h)$ as a candidate generator of $G \times H$. I see that what we want is for the cycles of $g$ and $h$, as we take powers of $(g,h)$, to interleave such that we do not get $(1,1)$ until the $(mn)$-th power. However, I am having a hard time formalizing this and relating it to the greatest common divisor.  Any hints are much appreciated!


Let $f:[a,b] \to \mathbb R$ be a function of bounded variation. It is known that if we change its values at finitely many points of $[a,b]$, then the changed function still remains of bounded variation on $[a,b]$. My question is, suppose we change its values at countably infinitely many points of $[a,b]$ such that the set of this points is not dense in $[a,b]$; then is it true that this changed function is of bounded variation?

Let $f:[a,b] \to \mathbb R$ be a function Riemann integrable over $[a,b]$ . It is known that if we change its values at finitely many points of $[a,b]$ , then the changed function still remains Riemann integrable on $[a,b]$ . My question is , suppose we change its values at countably infinitely many points of $[a,b]$ such that the set of this points is not dense in $[a,b]$ ; then is it true that this changed function is Riemann integrable on $[a,b]$ ?


I have installed JDK 7 in Ubuntu via following commands  sudo apt-get install python-software-properties sudo add-apt-repository ppa:webupd8team/java sudo apt-get update sudo apt-get install oracle-java7-installer   The installed JDK version was 1.7.0_76. After 2  or 3 weeks, when I check the JDK version, it shows me 1.7.0_80.   I'm guessing, it happened because of the Auto-Update feature of Java.  Is there any way to disable auto update feature of JAVA/JDK for Ubuntu 14.04 ?

Because of  I'd like to prevent apt-get upgrade and Update Manager from updating the "libgtk2.0-0" package.   How can this be achieved?


Today,  to one of . Before I got to see the notification, the edit already was rejected by other people (three rejections, one approval).  But the edit was actually a good one (like most edit proposals to my post I get to see) – a correction of syntax errors, so I would have definitively approved it.  (The suggested edit didn't change the main point of the answer, which was about the API to use, but it made the code example of my answer actually usable. I didn't compile it when writing my answer, it was late at the evening.)  So I did edit my post to include the proposed change, so the proposal is not fully lost. But the proposer only got the negative feedback from the rejection, and none of the reputation bonus an accepted edit gives.  My suggestion: Could there be added a way a post author can accept edits which were already rejected by other users?  Also, is there some way I can contact the rejectors and teach them not to reject good edits?

This isn't to change to the current rejection process or review queue in any way.      There was recently a  on one of my answers.  It was correct to reject from the reviewer's point of view, because variable names in code were changed, however, the edit would have been beneficial to the post in this case, and I would have liked the suggested edit to have been accepted.  I edited my answer and manually added the rejected suggested changes myself. On this occasion it was a small edit, but this would be quite time consuming if it was a more substantial edit.    It would be useful if we had a feature where a user can approve/improve an edit on their own question or answer which was previously rejected by community review.  Ideally, there would also be the option to Edit & Approve so we can change any bits if necessary.    Perhaps (for example) an option in the Suggested Edits history where only the OP, and maybe moderators, can select to approve or improve a rejected edit.   OPs can currently approve suggested edits, overruling the review queue, so this would just be an extension of that - being able to approve after 3 users have rejected.


Is it ever wrong to use the word "more" in front of an adjective? For example, is the following sentence grammatically incorrect: "I am more happy when I am reading poetry"?

Which one of these adjectives is correct? I can see that both of them are being used, I'm just not sure which one is grammatically correct. Are there any general rules to follow as to the use of one against the use of the other?


I am familiar with the Chinese Remainder Theorem and I know that it must be used here in some way (Hint given by my lecturer).  All I know so far is $\mathbb Z_{mm} \not\cong \mathbb Z_m \oplus \mathbb Z_m$.  This explains my reaction of 'no way this is true', I tried to play around with $n$ and $m$ using the fact that they're co-prime, but I really do feel like I've hit the wall on this.  (EDIT) Just to elaborate on more work I've done; I played around with small examples (2,3) and now I'm actually really questioning this because how can an isomorphism exist between say $\mathbb Z_{6} \cong \mathbb Z_3 \oplus \mathbb Z_3$? One clearly has 6 elements and the other 9! So how can there be a bijective mapping between these two groups? Perhaps this question has a typo?  Any hints would be appreciated, so please no solutions.

What can be the general statements made, when two finite groups can be isomorphic to each other: $\mathbb{Z}_{pq}$ and $\mathbb{Z}_{p} \times \mathbb{Z}_{q}$  Say  $$\mathbb{Z}_{pq} \simeq\mathbb{Z}_{p} \times \mathbb{Z}_{q},$$  what are the conditions for $p$ and $q$ and their factorization relations?  How do we show this in the most elegant way? And the intuitive way?


So if in play, my character spends a lot of time trying to learn a new skill, or a new language, or learn how to use a tool, is there a mechanic for adding that on the sheet? Or does 5E streamline away all such customization with blanket modifiers? I haven't found anything that reflects the ability to grow or develop in a focused way, just blanket improvements as stats increase, proficiency bonus goes up, levels rise, or as multiclassing happens?  The core question is: Is there any focused spot improvement for characters in D&D 5e, or is it all blanket modifier increases?  Most other games have this kind of thing. Take Improv classes? Improve your Performance skills. Go running a lot? Improve your Athletics skills. Practice at the gun range? Improve your firearms skill, all at the cost of some earned resource like XP. D&D seems like characters can sit on the couch between combats and improve as much as other characters who actively work on their skillsets.

In D&D 5E, is there a way besides the Guild Artisan Background (PHB 132-133) to learn professional skills? i.e. blacksmithing, knowledge, gem cutting, etc.?


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


I have a script called teleport in my path. When I type tele and hit tab, I'd like for tab-completion to complete this to teleport.  However, there's another program installed on my system: telepathy-gabble-xmpp-console This starts with the same letters, so tab completion only gets up to telep.  If this were my system, I would just remove that one executable to improve my workflow. However, this is a shared server. (Accounts are not shared.)  Alternately, I could change my $PATH to exclude it. However, telepathy-gabble-xmpp-console is in /bin, and obviously I can't just remove /bin from my path.  The solutions described in  don't work, because defining a function or alias will still autocomplete to that function or alias.  How do I take a single executable out of my $PATH?  (Yes, I realize that this is a lot of work for a small benefit.)

In bash, suppose I have these commands:  $ pyt[TAB][TAB] pytest python python-config python-dbg   99% of the time, I'd go for python. It's so annoying that pytest pops up and prevents me from typing only pyt[TAB][RETURN] to invoke python. Can I hide pytest from bash completion?  My limitations:   I know that I can remove the pytest binary at /usr/bin/pytest to prevent that suggestion within bash. But what if I have no root access? What if pytest is an important script that must exist in order to let other scripts work properly? Even though I can remove the pytest binary (and I've done it before), some time when I upgrade my software, this script comes back again. I know that I can use an alias to save keystrokes for my favorite applications (maybe just p for python). But I don't like these non-standard abbreviations. It kind of makes me confused when I remote to other machines.   So, is there any way to hide some commands from bash completion? Answers in other shells (zsh, fish, etc) are welcome since bash doesn't speed up my workflow lately.


How does one show that $L^1\subsetneq (L^\infty)^*$? I am having trouble in this. Any help would be appreciated.

How does one show that $L^1$  is strictly contained in $(L^\infty)^*$? Here, $(L^\infty)^*$ is the space of linear continuous functionals on $L^\infty$.


How do we print division up to 9 digits?  If variable num holds 2 and variable den holds 4, then I need to print 0.500000000  double ans=(double)(num)/(double)(den); System.out.println(ans);

How do I format a number in Java? What are the "Best Practices"? Will I need to round a number before I format it?  32.302342342342343 => 32.30 .7323 => 0.73  etc.


Company A decides to do a reverse stock split and reduces the number of shares by, say 10 to 1. Before the reverse split I only owned 7 Stocks on that company.  How will this reverse stock split affect me? Will I now own only 0.7 shares, or what will happen with my shares?

Let us say for example that I have 27 shares of stock X (there really is an X but its identity is not relevant).  In this example, X does a 5:1 reverse split. How many shares do I end up with. If I have fractional shares, what can I do with them?


Let $a_0,a_1,....a_n$ be real numbers and $p(x) = a_nx^n+a_{n-1}x^{n-1}+...a_1x+a_0$ for $x \in R$ I am trying to prove that the odd polynomial equation $p(x)=0$ has at least one real solution by using the intermediate value theorem. Here's how I started it. We can assume without loss of generality that $a_n=1$ and can write $p(x)= x^n(1+\frac{a_{n-1}}{x}+\frac{a_{n-2}}{x^2}+...\frac{a_0}{x_n})$ How can I show that there exists $M>0$ such that $x\leq -M$ implies $p(x) <0$ and $M>0$ such that $x\geq M$ implies $p(x) >0$

I want to prove that every real polynomial of odd degree has at least one real root, using  the intermediate value theorem.  Let $P(x) = x^{2n+1} + a_n x^{2n} + . . . + a_0$ for each $a_i \in \mathbb{R}$ and $n \in \mathbb{N}$.  By the fundamental theorem of algebra I know that $P(x)$ has exactly $2n+1$ complex roots, so  $P(x) = (x+r_1)(x+r_2) . . . (x+r_{2n+1})$ for each $r_i \in \mathbb{C}$  I do not know how to complete this but I do know that, at some point, I probably have to show that each root with imaginary part non zero has to come in conjugate pairs, and since $2n+1$ is odd there is at least $1$ root that is imaginary part $0$ and thus real.


My WINDOWS7 been crashing a lot, with other problems like:   Running system hangs Drives (partitions) disappear and come back on restart System restarts without showing any error   Going through different posts somewhere I read to look at event viewer >> System >> disk error and it says bad block then it's time replace HDD.  Now I am also seeing that it only says   "The device, \Device\Harddisk0\DR0, has a bad block" there are many such errors but all says "DR0". So I wonder if possible I accumulate all such bad blocks in one drive and then install OS in remaining clean partition.  Is it possible?  OR  Also there is inbuilt Microsoft utility that check for bad blocks and repairs them . So I could repair bad blocks and reinstall the OS on clean drive?  Other details about my PC:   I have 500 GB Sata Hard disk (four partition of approx 99 GB each, C:\ has WINDOWS7, installed few days ago due to problem discussed above, thought it would fix the problem). It is more than 5 years old HDD. Dual Core processor 4 GB RAM

Hello I want to know if is it possible to mark bad blocks on HDD for OS to not use them. I don't want to save data written on this blocks, just want to get rid of them.  I found some article where author describe how to partition disk to avoid using bad blocks of HDD.  I count how many MB from the start are OK. And also how many MB from end are OK. It looks like I will lost about 50GB of storage space but it is quite fine for me when the disk will run one year more.  First I split disk to 2 partitions:   From beginning to around 190 GB From 190GB to the end   Then I made surface scan of 2nd partition and everything was OK. I was really happy cause i though that finally I will succeed.  Than I wanted to copy all data from 1st partition to 2nd BUT in some data a problem occurs. I/O error. I'd say it is Read problem but when I open file on which copying failed it runs OK, for example some pdf files didn't copied but I opened them.  What can be problem can it be a Write problem? But why there is a problem when surface scan on whole 2nd partition was fine?  What can I do(except buying new HDD)? Can I somehow do this partitioning and use just partition with good sectors? Will it work? How are data stored on the disk? Can I determine where the data will be written?


I just got a Nexus 6 and flashed Android M Preview 3 to it and also have it rooted, but how do I enable tethering / WiFi hotspot?  I tried doing the old method of finding dun_tether in the SQLite database, but it isn't there anymore.  How would one enable tethering / WiFi hotspot on Android M (Marshmallow)?

I just loaded the Android M preview version as of July 2015. I'm also on the Sprint network and my phone is rooted. How can I enable wifi hotspot ability on Android M?


I tried to update my laptop to Ubuntu 18.04 (from 16.04) last night, but I had a power outage and I believe it was interrupted in the middle. As I woke up and noticed that the power was out, I panicked, and, yeah, system corrupted as the laptop ran out of power.  Can anyone give some instructions on how to repair the system?    Full StartupError Message:   [     1.271631 ] Kernel panic - not syncing: VFS: Unable to mount root fs on unknown-block(0,0) [     1.271695 ] CPU: 0 PID: 1 Comm: swapper/0 Not tainted 4.15.0-36-generic #39-Ubuntu [     1.271753 ] Hardware name: ASUSTEeK Computer Inc. G74Sx/G74Sx, BIOS G74Sx.202 08/15/2011 [     1.271820 ] Call Trace:  [     1.271873 ]    dump_stack+0x63/0x8b [     1.271924 ]    panic+0xe4/0x244 [     1.271974 ]    mount_block_root+0x1f6/0x2da [     1.272025 ]    ? set_debug_rodata+0x17/0x17 [     1.272075 ]    mount_root+0x38/0x3a [     1.272126 ]    prepare_namespace+0x139/0x18e [     1.272186 ]    kernel_init_freeable+0x224/0x251 [     1.272189 ]    ? rest_init+0xb0/0xb0 [     1.272191 ]    kernel_init+0xe/0x110 [     1.272193 ]    ret_from_fork+0x35/0x40 [     1.272243 ] Kernel Offset: 0x24400000 from 0xffffffff81000000 (relocation range: 0xffffffff80000000-0xffffffffbfffffff) [     1.272505 ] ---[ end Kernel panic - not syncing: VFS: Unable to mount root fs on unknown-block(0,0)

Upon trying to upgrade from 10.10 to 11.04 all seemed to go well until the restart. This error message is what comes up:  Kernel Panic - not syncing: VFS: Unable to mount root fs on unknown-block(0,0)   How do we fix that?


Here is an example from right-now's hot questions list:   The ServerFault question () actually has 19 votes. The Code Review question ()? Six. Is this number not a vote count, or is this a bug?

I know questions on the "hot" tab of a site homepage are based on some sort of views/velocity criteria, but does anyone know the actual algorithm used?  Background: I was considering a feature-request about the "hot" tab, but I don't have enough information to speak about it intelligently.


I have this full width div that takes up around 30% of my view port height (not sure of the exact height) and I was wondering if there is a property that will allow me to take up the remaining height of the view port in another div so that both divs take up 100 percent of my view port height?

I am working on a web application where I want the content to fill the height of the entire screen.  The page has a header, which contains a logo, and account information. This could be an arbitrary height. I want the content div to fill the rest of the page to the bottom.  I have a header div and a content div. At the moment I am using a table for the layout like so:  CSS and HTML    #page {     height: 100%; width: 100% }  #tdcontent {     height: 100%; }  #content {     overflow: auto; /* or overflow: hidden; */ }

...

...

     The entire height of the page is filled, and no scrolling is required.  For anything inside the content div, setting top: 0; will put it right underneath the header. Sometimes the content will be a real table, with its height set to 100%. Putting header inside content will not allow this to work.  Is there a way to achieve the same effect without using the table?  Update:  Elements inside the content div will have heights set to percentages as well. So something at 100% inside the div will fill it to the bottom. As will two elements at 50%.  Update 2:  For instance, if the header takes up 20% of the screen's height, a table specified at 50% inside #content would take up 40% of the screen space. So far, wrapping the entire thing in a table is the only thing that works.


we're having a strange issue with our Azure virtual machines. When we make a connection to the servers, via socket, then leave it idle for exactly 5 minutes, the connections gets dropped. It does not matter in which country the server is booted up, we get the same thing. Is there an automatic idle connection drop on azure?  We have tested this on servers hosted with other providers and the idle connection stays alive as long as we need it.  Hope someone knows how to resolve this?  Thanks.

I'm running a proprietary client/server application on a single instance windows server 2k8R2 azure VM.   The client is very dependent on a connection with the server.  However if I spend a couple of minutes without any activity, something on the Azure end forcibly closes the connection (as far as I can tell from the logs).  I'm not positive if this is a function of azure itself or windows.  Short of implementing some sort of keepalive functionality (which I can't because the software is proprietary), is there anyway I can extend this timeout?    I've seen several references to changing idletimeout for loadbalanced situations, but this is just a single instance.  thanks in advance!


I have a views which filters films by genre and year, however the client would like urls in the following format:  /films/comedy/2009   however views is outputing the url like:  /films?genre=3&year=22   Any way to get round this?

When I used an exposed filter the filter selection is passed as name/value pair in the url, for example:  members?field_a=valuea&field_b=valueb   How can I set it up to use more of a "pathauto" style url:  members/valuea/valueb


How do I consolidate all my accounts into one? I have this account on Stack Overflow     Then this one shows up for my Stack Exchange    How would I add them all together ?

I accidentally posted a question without being logged in. Is there a way to associate that question with my account?   For more information, visit "" in the .   a.k.a. How can you link a registered account to a cookie-based account? a.k.a. How do I merge an unregistered account with a registered account a.k.a. Merging users a.k.a. How do I associate anonymous questions I’ve asked with my registered account? a.k.a. Is there a way to claim an unregistered user? (in case anyone searches with those terms)


I installed Ubuntu 18.04.1 LTS on my system along with Windows 10 as dual boot. The Ubuntu worked fine for few days, but last day there there were some updates in UBUNTU which I allowed to download and install. During that, my Ubuntu freeze with no mouse and keyboard working, so ultimately I had to force shutdown the system holding power key. During next boot to the system, the system automatically got booted to Windows 10 with no GNU GRUB Boot loader missing. I tried few solutions from web, but nothing worked for me. I'll post details of solutions I already tried. I tried boot repair using temporary booting of Ubuntu using flash drive but it also got failed and resulted in dpkg error.  sudo add-apt-repository ppa:yannubuntu/boot-repair sudo apt-get update sudo apt-get install -y boot-repair && boot-repair   The error is dpkg-error detected. Please open a terminal then type  sudo chroot "/mnt/boot-sav/sda12" dpkg --configure -a    On typing this command on terminal, error is  chroot:failed to run command   Is there any possible solution to restore Ubuntu without loosing data.  I tried removing Ubuntu from my machine with fixing Windows boot loader from CMD in Windows Recovery mode, but it's also showing Access Denied using bootrec /fixboot command.  Currently Windows is working fine on system but it's taking time to load up as I messed with boot settings by installing Ubuntu.  Any possible method to restore Ubuntu? If not, how to fix my Windows System, so that I can install Ubuntu again.

I installed Windows 7, which ate Ubuntu's boot file. When starting up the computer, it now goes straight to Windows, without giving me the option of booting Ubuntu.   How can I get Ubuntu back?


I'm trying to upgrade from 19.04 to 20.04 and I always get this: ERROR: failed to read '/etc/update-manager/release-upgrades': Source contains parsing errors: '/etc/update-manager/release-upgrades' [line 11]: 'x# currently-running release.\n'  What can I do to fix this?

Recently I have installed an older version of Ubuntu on my old machine. Whenever I try to install any software, I get an error saying it couldn't be found:  $ sudo apt-get install vlc Reading package lists... Done                Building dependency tree        Reading state information... Done     E: Couldn't find package vlc


I need to prove that  $$\frac{a+b+c}{abc} \le \frac1{a^2}+\frac1{b^2}+\frac1{c^2}$$ I started with this $$\frac 1b\frac1c+\frac1a\frac1c+\frac1a\frac1b\le\frac1a\frac1a+\frac1b\frac1b+\frac1c\frac1c$$ then I stick here what can I do?  Thank you

So I have to prove $$ \frac{a+b+c}{abc} \leq \frac{1}{a^2} + \frac{1}{b^2} + \frac{1}{c^2}.$$  I rearranged it   $$ a^2bc + ab^2c + abc^2 \leq b^2c^2 + a^2c^2 + a^2b^2 .$$  My idea from there is somehow using the AM-GM inequality. Not sure how though. Any ideas?  Thanks


I am using Virtual Machine Manager in Ubuntu 15.10. When I try to login after giving correct username and password the system is showing again the login screen. I can not use hot key because whenever I pressed hot key it always go to host machine not the guest or virtual machine.

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


So I had to switch SharePoint from one server to another.  Our network guy installed SharePoint onto a new server and I backed up and uploaded my stuff into the new server (with the same name as the original one).  Everything seems to be working alright except for the Business Data Connectivity Service.  I keep getting this error when I click on it:  The load balancer is not provisioned. Verify the load balancer was provisioned successfully before retrieving endpoint addresses.    I have tried stopping and starting the service, deleting and re-adding the service, changing the app pools and users it uses, restarting IIS, rebooting the entire server...  I'm at a loss right now and I'm not sure what to do.  Are there any other options or ideas out there that I can try?  EDIT  When I try installing the hotfix, it says that it is not applicable

When I click on 'Business Data Connectivity Services' link on 'Manage Service Application' page of Central Administration, I get the following error : "The load balancer is not provisioned. Verify the load balancer was provisioned successfully before retrieving endpoint addresses. " I got a solution from  link, but as per instruction I am unable to install the hotfix for SharePoint 2013. Is there any solution available for this problem? Thanks in advance


A torus is given by $\{(x,y,z) \; |\; (\sqrt{x^2+y^2} - R)^2 +z^2 = r^2 \}$ This will be a horn torus when $R=r$ and Spindle when $R<r$ I am new to differential geometry of surfaces and I am studying regular surfaces. I only know how to rigorously show a surface is regular. However, in order to show a surface is not regular, I can only do so using the geometry of the surface and look for sharp corners, edges or self intersection. So, my questions is:  In Horn torus, there is no self intersection however, the torus does touches itself. So does touching itself will imply this Horn torus is not regular surface?  In Spindle, the torus is self intersecting, so is this argument sufficient to say that Spindle torus is not regular? can we prove it more rigorously without using geometry?

I was trying to prove that the horn torus and the spindle torus are not manifolds by definition(locally diffeomorphic to some Euclidean space.). I have no idea how to do this, but I attempted it in the following way:  I failed to show that a "slice" of manifold is a manifold itself. By a slice I mean, if the manifold $X\in \mathbf R^n$, then we set the coordinates $x_i=0$ for some $i$ where $0\leq i\leq n$. I feel this would work but I have no idea how to prove it.   Then I look at the cross section for the tori I mentioned(this is equivalent to taking a slice.). For the horn torus, you have two circles touching each other. And the fore spindle torus, you have two circles intersecting each other. Since a circle is locally diffeomorphic to $\mathbf R^1$, the two circles better have to be diffeomorphic to $R^1$. Otherwise we get the result we want.  I tried to proof that a neighbourhood around the point they touch(or intersect) cannot be locally diffeomorphic to $\mathbf R^1$. I tried to do it by contradiction. However I'm stuck on finding a contradiction...  Any thoughts?  P.S. Under the request of Sam Lisi, here are the definitions or horn and spindle tori:  A torus is the set of points in $\mathbf R^3$ at a distance $b$ from the circle of radius a in the $xy$ plane. This is like you put a circle with radius $b$ in the $yz$ plane centred at $(a,0,0)$. Then you make it orbit around the origin and you get a torus.  A horn torus is when $a=b$. If you take a cross-section, you'll find that it's two circles touching each other at one point. When $a<b$, it's called a spindle torus. The cross-section would look like two circles intersecting with each other at two pionts.   There are pictures in this wikipedia article that might help you visualise the horn and spindle tori:


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

The current high school debate resolution is “Resolved: In the United States criminal justice system, jury nullification ought to be used in the face of perceived injustice.”   Although the resolution doesn’t seem to have a generic bare plural, is it correct to only talk about one kind of injustice? For example, if a debater decided to only focus on racial injustice, would this be a semantically correct interpretation of the topic? Is the word injustice an example of a mass noun?


When I try to install packages or updates I receive this error:  linux-image-extra-4.4.0-109-generic : Depends: linux-image-4.4.0-109-generic but it is not installed   How can I fix this?

After upgrading from 10.04 to 12.04 I am trying to install different packages.  For instance ia32-libs and skype (4.0).  When trying to install these, I am getting the 'Unable to correct problems, you have held broken packages' error message.   Output of commands:  sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   After running this:  sudo dpkg --configure -a foo@foo:~$ sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.


I am looking for latitude and longitude coordinates of french subdivision.  I am not used to GIS but I saw that ISO 3166-2 contains default code of such subdivisions, their name etc but where can I download the complete data in a readable format (with python preferred) with name, code and coordinates ?

In order to do reverse geocoding lookups to find a country (as ISO-3166-1) and the subdivision (as ISO-3166-2) for given coordinates I am looking for a way to get all polygons of all countries and their subdivisions.  Reverse geocoding lookups with Google Maps or other services either do not always return the country and subdivision (Google Maps), or sometimes they are incorrect (geonames.org). As I understand it all countries and subdivisons are available in the openstreetmap data, but I do not know how to only retrieve the polygons - no map data, no points of interest or cities are necessary, only the outlines of all subdivisions with the given country and subdivision codes. Then I can check myself if a given point is within any given polygon, or near it.  Does anyone know how to retrieve this data from the openstreetmap data, or is there any other source for this data?


Using the $\epsilon-\delta$ definition of the limit, evaluate $$\lim\limits_ {x\to a}f(x)=x^2$$  I am stuck on $|x−a||x+a|<\epsilon$ and can't eliminate $|x+a|$.

Prove that $\displaystyle \lim_{x \to a} x^2 = a^2$   Let $\varepsilon > 0$, and let $\delta = \min(\frac{\varepsilon}{2|a|+1}, 1)$. Suppose $x \in\mathbb{R} - \left\{a\right\} $ and $|x-a| < \delta.$ Then $|x-a| < 1$ hence $ -1 < x-a <1 $ hence $ a-1 < x < a+1$ therefore $2a-1< x+a <2a+1.$ Thus $ |x+a| < 2|a|+1.$ So $|x^2-a^2| = |x-a||x+a|$ $ \displaystyle < (2|a|+1)\delta =(2|a|+1)\frac{\varepsilon}{(2|a|+1)} = \varepsilon. $  Is this correct? Is there another choice of delta we could have chosen?


I need to find by sequence which contains symbols [] like !@#$%^&[]{}<>?/,.*(^ with a like expression in SQL Server 2014.   How I can escape brackets to find records which contains target string?  Example  SELECT *  FROM [TARGET_TABLE]  WHERE [TARGET COLUMN] LIKE '%"!@#$^&[]{}<>?/,.*(^"%';   [TARGET TABLE] has a row with [TARGET COLUMN] which value is   some text "!@#$^&[]{}<>?/,.*(^"   but result of expression is empty.  I know what [] is wildcard, but don't know how escape brackets to find strings with them.

I am trying to filter items with a stored procedure using like. The column is a varchar(15). The items I am trying to filter have square brackets in the name.  For example:  WC[R]S123456.  If I do a LIKE 'WC[R]S123456' it will not return anything.  I found some information on using the ESCAPE keyword with LIKE but I do not understand how to use it to treat the square brackets as a regular string.


I am searching for drugs for my uncle who has prostate cancer who is afraid to take corticosteroids. I read about the drug cabozantinib, but it said it failed a 3rd phase clinical trial, even though it was equally as effective as the treatment with corticosteroids, only more expensive. Since it has not been approved due to this, I am wondering if this drug can still be used for prostate cancer?

Is off-label prescribing completely prohibited? Can a drug be prescribed by doctors for a disease or condition for which FDA has not approved it and hence this condition is not listed on the label? It is presumed that this disease or condition is not explicitly listed as a contra-indication, i.e. when the drug is clearly stated to be avoided since it may be harmful.


I am rendering some HTML elements using an array but when it comes to adding an event listener and passing relative arguments to it I appear to lose my binding and am unsure how to get it back. In my example below when I click on a rendered Div it gives me an alert of 'undefined'. Any help appreciated!    const results = [{     name: 'john',     surname: 'smith'   },   {     name: 'jake',     surname: 'brown'   } ] // create a div element for each item in array results.forEach((result) => {   const resultDiv = document.createElement('div')   resultDiv.textContent = result.name   resultDiv.addEventListener('click', (result) => {     alert(result.surname)   })   document.querySelector('#results-area').appendChild(resultDiv) })

What is the scope of variables in javascript? Do they have the same scope inside as opposed to outside a function? Or does it even matter? Also, where are the variables stored if they are defined globally?


I bought a bag of frozen blueberries 4 days ago. They have been out of the fridge for 2 days. They look good and there is no mold. Are they still good to use?

How do I know if a given food or ingredient I have is still good, or if I should discard it?  How can I best preserve a food or ingredient?     This broad question is intended as a "general reference" question to quickly answer many how long will food keep for? questions. Please feel free to edit this question to expand and clarify as needed.


I have several apt repositories for different versions of Ubuntu, they are all pretty similar except for the one I just made for xenial servers. When a xenial server does an apt-get update and talks to my repo, it gets a "hash sum mismatch" error for Packages.gz. What could cause that?  I do not think that this is a duplicate of  because the answers there all assume that the problem is with the client, but in my case the problem is on the server, so no matter what you do on the client it doesn't fix the problem. Unsurprisingly, none of the answers to that question worked.

When I check for updates, I get a "Failed To Download Repository Information" error.   This is what comes up under details:   W: Failed to fetch gzip:/var/lib/apt/lists/partial/us.archive.ubuntu.com_ubuntu_dists_natty_main_source_Sources  Hash Sum mismatch,  E: Some index files failed to download. They have been ignored, or old ones used instead.


I am only able to that zero occured only on real line. I tried prove using contradiction. But not succeed. Any hint will be very helpful for me.

Let $f$ be an entire function. Suppose $f(z)$ is real if and only if $z$ is real. Prove that $f$ has at most $1$ zero. How to prove? Totally I have no idea... Please give the solution in detail since I do not understand.


I’m running Ubuntu 14.04. When I run:   sudo add-apt-repository ppa:ubuntu-wine/ppa   I get the following error:  sudo: add-apt-repository: command not found   I tried to run  sudo apt-get install software-properties-common   but it shows:  software-properties-common is already the newest version. 0 upgraded, 0 newly installed, 0 to remove and 1 not upgraded.

The server version of Ubuntu does not have the  command. How can I add a  (PPA) to the server without this command?


I recently discovered a friend who always believed that cheesy, corny and tacky meant (to use their words) a "pornographic display of emotion".   As in: The end of a TV show where that Dad says to the son, "I love you and I want the best for you". To them such things are "cheesy" because they're too "explicitly emotional" -- but not because they're cheap or insincere.   So when they heard people say "that song is cheesy" or "the ending of that movie was so tacky" they thought it was referring to an exposed display of emotion which makes them feel uncomfortable. Not necessarily because the movie was trying too hard, and therefore coming across as fake or mawkish, but simply because the characters were sharing their innermost.  For example, this person could be at a wedding in real life, and watching a proud father welcome his new daughter-in-law to their family, describe it as "tacky" -- solely because his feelings are on display.   I've explained that corny, tacky and cheesy actually refer to insincerity and cheapness, much to their surprise, but now I'm wondering if there is such a word the means what they thought other people were referring to.   Is there a word that to negatively describe an overt display of sincere (ie. not mawkish, contrived or exaggerated) emotion?  Edit: I don't think this question can be answered, as I believe looking upon such things negatively is purely in the eyes of the beholder, and not necessarily something that is objectively appreciated by a large number of people. Happy to be proven wrong, but to restate: I'm not referring to exaggerated or overly sentimental displays of emotion -- just honest displays of deep emotion, period.

Some movies overplay/over-do certain elements to make viewers feel emotional - cheesy lines, music and others. I've read a review which used a word to convey this pithily but I can't seem to remember for the life of me!  An example would be: I'm not sure I want to see the new movie. It is XXX.   Edit: added sample sentence.


During study Uart, I found this symbol ^ which immune to google. Here code that I can not understand: array<object^>^ objectArray = SerialPort::GetPortNames();

I just came across this code and a few Google searches turn up no explanation of this mysterious (to me) syntax.  Hashtable^ tempHash = gcnew Hashtable(iterators_);  IDictionaryEnumerator^ enumerator = tempHash->GetEnumerator();   What the heck does the caret mean? (The gcnew is also new to me, and I asked about that .)


I remember an old time when the login screen played a drum sound before login (actually the dialog-question.ogg from Ubuntu sound theme). I found the sound useful to inform you the system was ready so that you should enter your password.  Is it still possible now with Ubuntu 18.04 and GDM?  Thanks.

In Ubuntu 16.04, when I powered on my computer, the drum roll sound would be played right before I was presented with the Login interface. After I upgraded to Ubuntu 17.10 the drum roll sound is no longer being played. I did some research on the web and tried the following, which enabled the drum roll sound to be played, but only after I had logged in.  I launched Startup Applications Preferences and added an item that contained the following.  /usr/bin/canberra-gtk-play --id="desktop-login" -f /usr/share/sounds/ubuntu/stereo/system-ready.ogg   But this only enabled the sound to be played after I had already logged in.  I also tried  /usr/bin/canberra-gtk-play --id="system-ready" -f /usr/share/sounds/ubuntu/stereo/system-ready.ogg   But that had the same effect as the other attempt; the drum roll sound played only after I had logged in.  So I am asking whether anyone has found a way to enable the drum roll sound to play before the user has logged in, when the user is presented with the login dialog.  I also tried --id="system-bootup" which should have brought up the drum roll sound much earlier.  But even with that setting, the drum roll sound was not played until after I logged in.


I've been collecting stats for a soccer team.   I'm using definition of assist from  which is, an assist is awarded for a pass leading directly to a goal.   I have two situations I'm looking for answers on,  1st Situation  - player A passes ball to player B  - player B strikes the ball, shot is blocked  - player B strikes the ball again and scores  Do you award A with an assist?  2nd Situation  - player X serves the ball  - player Y strikes the ball off which is deflected by player Z, ball goes into the goal  Whom gets the assist?

I passed the ball to the forward, who was then one on one with the goalkeeper.  The forward shoots on first touch and hits the post.  The ball rebounds, and with no one else touching the ball, the forward scored.   Does this count as an assist for me?


Can someone tell me how can I find all the subgroups of A4. I have the elements written down and I know there should be subgroups of order 2,3, 4 ( 6 is impossible ). I can't understand how to find the 3 and 4 order subgroups and I have surfed the internet but haven't ye found a satisfying answer.

I had a question I was hoping for some help on:     Find all of the subgroups of $A_4$   Here is what I know:  $A_4$ is the alternating group on 4 letters. That is it is the set of all even permutations. The elements are:  $(1), (12)(34), (13)(24), (14)(23), (123), (132), (124), (142), (134), (143), (234), (243)$   which totals to 12 elements. Which means, the subgroups should have order 1,2,3,4,6 and 12. The groups of order 1 and order 12 are trivial. I also know the groups of order 2 which are:  $[1,(12)(34)], [1, (13)(24)], [1, (14)(23)]$  but would someone be able to help me find the subgroups of order 3, 4 and 6 and be able to provide a good, easy explanation of how you got to them for me? I'm pretty sure there is no such groups of order 6, but I don't know how to explain why.  Thank you so much for your help in advance, I really appreciate it!


Let $a=(a_1,...,a_n)^\top\in\mathbb{R}^n$ be a column vector and let $M_1,...,M_{n!}$ denote all $n\times n$ permutation matrices. When is the rank of the matrix that consists of all possible permutations of $a$: $$ A=[M_1 a \,|\; ... \; |\, M_{n!} a]\in\mathbb{R}^{n\times n!} $$  equal to $n$? Obviously, $rank(A)\le n$ and if all entries of $a$ are identical, then $rank(A)=1$. Moreover, if $A$ has rank $n$, then there exist two entries $i,j$ s.t. $a_i\not=a_j$. Is the converse statement also true?

Let $K$ be a field. Consider the vector space $K^n$ over the field $K$.  Suppose $(a_1,a_2, ... ,a_n) \in K^n$. What is the dimension of the subspace generated by all the permutations of $(a_1,a_2,...,a_n)$?  I think there are 4 different cases    $a_1=a_2=...=a_n=0$ $a_1=a_2=a_3=...=a_n \ne 0$ $a_1+a_2+...+a_n=0,$ $ a_1 \ne a_2$ $a_1+a_2+...+a_n \ne 0$ , $a_1 \ne a_2$


I'm currently asking myself if it is possible to use "-" for abbreviation in a listing in a sentence to emphasize the togetherness of the previous words and the word in the end, even if they are two separate words or do not contain a hyphen.  Example:  (...) baby-, owner- and product names.   Background: I would not like to harm the spelling of i.e. "product names" because it is spelled this way in a certain context. However i would like to make it clear that not "babies" or "owner" but "baby names" and "owner names" are meant.  Thank you,

In my native language, Norwegian, one uses hyphens when stating two or more copulated compound words that has common parts (words). In a thesis I'm working on, should I write     test specimens, test setups and test results   or could I write (like in Norwegian)     test specimens, -setups and -results?


Book about alien crashing on Earth; starts "LIFE" so man will evolve & create tech to fix the ship.

I'm trying to figure out the name of a sci-fi short story I read a while back. Hours of Googling were no help. Can anyone figure this out?  The punchline of the story is that all of humanity was created for the purpose of providing a missing tool which is required to fix a broken alien spaceship was stranded somewhere in the solar system (Jupiter?). In the end, a child with a toy, which turns out to be the requisite tool, stumbles into a spaceship launched to that planet, and it all turns out to have been designed by the aliens to get them their missing tool, so that they can fly back home.


I have a density made up of 4 qubits. Say system A is made up of the first and second qubits while system B is made up of qubits 3 and 4. I want to trace out 2nd and 3rd qubits. Is there any reference available to trace out qubits from a multipartite density matrix?

I have the state vector $|p\rangle$ made up of 4 qubits. Say system A is made up of the first and second qubits while system B is made up of qubits 3 and 4. I want to find the reduced density matrix of system A.   I know I could separately extract qubits 1,2 and 3,4 into their own state vectors then find their density matrices and compute the reduced density matrix for system A.  I want to figure out how to do this without having to extract and separate the systems. First I would find the density matrix of $|p\rangle$ and then do a partial trace with respect to system B. I am not sure how to do the partial trace of system B since the system contains 2 qubits.  Can anyone help me figure this out? I am using Python and NumPy for reference.


The analysis of undertaken research.   Is this statement correct? I mean is "undertaken" the correct adjective?

I'm proof-reading a thesis by one of my friends and there's some recurring construct which I always mark as false but I'd like to check with you.    In the comments I was told that the example I provided didn't really match the sentence I found in the thesis therefore I'm adding the actual sentence from the thesis. I'm sorry for the confusion; I'm not a native speaker/in the field of language and thus didn't really see the difference.   So here we go. Which of the following is preferable?        To illustrate the necessity of some steps a bad representative of the taken radiograms is used.     To illustrate the necessity of some steps a bad representative of the radiograms taken is used.        I'd use the latter because it is closer to "[...] of the radiograms taken previously is used".    Original example  In the English language, one can use the (past) participle of a verb as an adjective, this allows for example to express that I'm creating a scrapbook using the pictures that I have taken previously.     What's the correct way to state this?         I'm doing a scrapbook from the taken pictures.     I'm doing a scrapbook from the pictures taken.        I'd use the latter because it is closer to     I'm doing a scrapbook from the pictures taken previously.


I have used very low quality flag for  question - was accepted.  But for  - declined  Flag number 3:  - accepted  Flag number 4:  - declined. For the last one the flag was declined before question was edited - it wasn't any code there...  There are some criteria for low quality question - but it depends more on individual moderators.  Am I correct?

I recently flagged a question as "very low quality", just like I've flagged many questions in the past. However, my flag was found to be unhelpful this time. The same thing happened when I recently flagged a post as not an answer.  Are the moderators being more strict when it comes to handling quality related flags? If so, why?


I recently upgraded to Ubuntu 16.0 and installed QGIS 2.18. As I tried it, this error came:  ERROR 1: NUMPY driver was compiled against GDAL 2.1 but current library version is 1.11  Segmentation fault (core dumped)  I have basic ubuntu/linux capability.

Concurrent updates to GDAL (to 2.1.3) and QGIS (to 2.18.5) on Linux Mint 18.1 from the Ubuntugis repos breaks QGIS, with a noted dependency for the virtual package gdal-abi-2-1-2 being uninstallable.    The stable Ubuntugis ppa currently supplies GDAL 2.1.0 (gdal-abi-2-1-0) while the Ubuntugis-unstable ppa has been updated to GDAL 2.1.3 (gdal-abi-2-1-3).  Has anyone found a way around this?    Update:  QGIS bug report for those interested is here:     UPDATE 2  The ticket has been closed as fixed. Everything should be back to normal now.


I've seen the insert select but I only want to get one value from the second table.  Here's what I'm thinking:  insert into table1 Values((select distinct id from table2), "blah", "blah", "blah")   So after the Id, the rest of the values will be hard coded to whatever I want.  Is this possible?

I am trying to INSERT INTO a table using the input from another table. Although this is entirely feasible for many database engines, I always seem to struggle to remember the correct syntax for the SQL engine of the day (, , , , and ).  Is there a silver-bullet syntax coming from an SQL standard (for example, ) that would allow me to insert the values without worrying about the underlying database?


I am not a very technical person but I would like to ask if it is possible to retrieve the contents of a table on a website?  This table is spread over 400 pages, I use it regularly when working but the problem is that my internet is unstable and often does not work, so I cant access the table which prevents me from being able to work.  Is there a way i can download/copy it so that I can use it when my internet is down?   The website:  > "Odvjetnici" & "Odvjetnicki urdedi i drustva".  PS: When i attempt to save the website I can not view the other pages.

How can I download all pages from a website?  Any platform is fine.


I want rid of XP and as my laptop is 7 years old I thought Lubuntu would fit the bill. I've downloaded it but I can't find a program on XP to open it.

This is the third time I've tried to install Ubuntu Server 14.04.03 64-bit on the same laptop, and each time it caused different problems.  Each time I wrote the same iso image to a USB flash drive by using a different application and OS.   Universal USB Installer (pendrivelinux.com) from Windows WinImage writer from Windows built-in image writer from Linux Mint 17.2    The iso image is the same in all three cases, the USB flash drive is the same, and the laptop is the same. However each time the installation of Ubuntu gave me different installation options. For example, the last time I installed Ubuntu, it didn't show all the packages to choose while installing (Basic Ubuntu server, etc.).


Find all nonisomorphic $3$-regular graphs on $8$ vertices.  I know one possible graph is two tetrahedrons, since tetrahedrons are 3-regular graphs on 4 vertices. It also seems that this graph is the only disconnected graph, though I'm not sure how to prove this. But how can one systematically find these graphs? I know that we can label the vertices $v_1,\cdots, v_8$ and assume WLOG that $v_1$ is adjacent to $v_2, v_3, v_4.$ However, the remaining $4$ vertices all need to be connected to $3$ other vertices and there seems to be way too many cases to consider.

So I am studying for an exam on Discrete Mathematics coming up in a few weeks, when looking past papers it seems that my lecturer enjoys asking questions of the form   "Find all n-regular graphs on m vertices. Justify your answer."  Where he will replace m and n with actual numbers rather than having us deal with the arbitrary case. However, these questions take me ages since I create, for a fixed m and n, all the n-regular graphs on m vertices that I can think of, check that they are not isomorphic and hope i have found all of them.  Is there a better way of approaching this question?  For example;  'Find all 5-regular graphs on 8 vertices.'  Any help is appreciated.


Today I open my SO account like I always do. But the UI of menus has changed. I am not able to see the chat tab, the logout link or the privileges link. Are they missing or moved somewhere else?  Changed UI:

Took a few seconds to find how to get back to chat on SO. I quickly found that it was hiding inside the StackExchange drop down along with Blog and Log out. Having these links inside the "site switcher" seems a tad out of place and calls for concern personally.   Any ideas for an alternative to these objects location?


I am currently using Firefox 52esr (52.9.0). I want to keep using 52esr (I am aware of the issues in doing so and not asking about that here).   As of yesterday "Firefox Web Browser" is listed as an update item in Software Updater.  My question is how can I find out what version the update is before installing it.  In this case, the update could be a minor update within (52.9.0) (no problem) or update to the next esr which is/will be 60esr (not wanted). I don't know if it has been released by Ubuntu yet.  Also, is there any information whether 52esr will update to 60esr as routine (because 52esr support from Mozilla has ended)?

FreeBSD user joining your ranks.  I've been asked to look after an Ubuntu Server running 10.04 LTS.     I see from /usr/lib/update-notifier/update-motd-updates-available that there are a number of updates on the server however I do not see a way to tell which will be updated.  Would anyone be able to point me in the right direction so as I can see which packages will get updated when I run apt-get upgrade?  UPDATE:  Can't answer my own question at the moment so throwing this in here for the time being:  Along with the apt-get upgrade --dry-run suggested below,  /usr/lib/update-notifier/apt-check -p will list all packages that have updates available.


While looking at  I noticed that the question has been merged:    What is the difference between a merged question, and one that has been closed as a duplicate?

I want to know the exact difference between questions marked as duplicates vs. merged questions. For example, I think answers are also redirected to the original question with which a second question is merged, whereas if it is marked as a duplicate, then this is not the case.  I want to know all differences between them and why both are displayed as [duplicate], or why [merged] is not used. Which (mark-as-duplicate or merge) is used and when?


Suppose $f(x)$ is differentiable on $[a,b]$, twice differentiable in $(a,b)$. Given that $f(a) = f(b) = 0$, $f'(a)f'(b) > 0$, Prove that $\exists \zeta \in (a,b), f(\zeta) = 0$ and $\exists \eta \in (a,b),f''(\eta) = f(\eta)$.  I solved the former part. For the latter part, I found a counter example. $f(x) = \sin x$ in $(0,\pi)$, there is no $\eta \in (0,\pi)$ s.t. $f''(\eta) = f(\eta)$  If the the statement becomes $\exists \eta \in [a,b],f''(\eta) = f(\eta)$. Is it true?

Suppose $f:[0,1]\to\mathbb{R}$ is twice differentiable with  $$\lim_{x\to0^+}\frac{f(x)}{x}=1,\lim_{x\to 1^-}\frac{f(x)}{x-1}=2$$  Show that there is $\eta\in(0,1)$ s.t. $f''(\eta)=f(\eta)$.  It is equivalent to prove that $f''(x)-f(x)$ has a root in $(0,1)$. Then I tried to construct function. First I noted that the ODE  $$y''-y=0$$  has solution of the form $\alpha e^x+\beta e^{-x}$, then I consider the following function :  $$(f-f')e^{x}$$  and apply mean value theorem to is. But thing does not behave that nice, and I was stuck.


I am working on an existing C++/MFC Windows program, and I would like to get the console for text output. I found no option for that.    Can I set an option to get a console window from a C++/MFC program without redoing the project from scratch?    Can I avoid using the AllocConsole() function call, and just set the project options?    In case I must use AllocConsole(), where can I call it? I have no main() function in the program, so I do not know which is the entry point.

If I have a native C++ windows program (i.e. the entry point is WinMain) how do I view output from console functions like std::cout?


I'm trying to create an ID number for Map , so basically I have Customer class , and Map which will contain all the customers with String name , Double balance and int idNumber , the problem is that idNumber must be a collection of random numbers between 0-9 : example : 01019074902 . How can I do this ?

How do I generate a random int value in a specific range? I have tried the following, but those do not work: Attempt 1: randomNum = minimum + (int)(Math.random() * maximum);  Bug: randomNum can be bigger than maximum. Attempt 2: Random rn = new Random(); int n = maximum - minimum + 1; int i = rn.nextInt() % n; randomNum =  minimum + i;  Bug: randomNum can be smaller than minimum.


I am mapping the location of incidents of asthma using QGIS. I would like to count how many points are in census tracts to better understand the areas where asthma occurs most frequently. My map canvas presently displays the points of asthma from a CSV file, as well as census tract polygons from U.S. Census Bureau shapefiles.   I should be able to run the Points in Polygon function to help me. The function seems to work as I enter my CSV as the points, and the census tracts as the polygon. The function then returns a shapefile with an added column displaying "PNTCNT." Great so far. But, the attributes table indicates all zeros under the "PNTCNT" column. (This is obviously incorrect as I can plainly see that there are a many points in the census tract polygons.)   I tried saving the CSV file as a shapefile, and running the function again, but the result is the same. I'm at a loss.   Why is Points in Polygon giving me all zeros?     Here's the process I've used. Maybe someone can tell me where this is going wrong.   First, I add census tracts as shapefiles to my map. Second, I add a CSV that includes latitude and longitude for about 400 points. The CRS is set to WGS84 (EPSG:4326) for the points, and WGS84 / Pseudo Mercator (EPSG:3857) for the shapefile. Everything looks great on the map canvas.   Next, I select the points in polygon under the vector analysis tools. I select the shapefile under "input polygon vector layer." I select the CSV file under "input point vector layer." I input a file name and then hit okay. QGIS adds the new layer to my map canvas. However, when I open the attributes table the PNTCNT column reads all zeros. I have also tried the same process described above with the CRS set for both the shapefile and the CSV at WGS84 (EPSG:4326) (instead of using Pseudo Mercator for the shapefile).

I'm trying to count points within a polygon but it's not working.  I think it has something to do with the co-ordinate system.  The points are from a text file and the line are from a dxf file. I had to set the co-ordinates for both as one was lat long and the other was an old Irish grid co-ordinate system.  When I buffered and dissolve the lines the resulting layer defaulted to the original co-ordinates.  I reset the line file to the correct co-ordinates and ran the query to count points within a polygon. The resulting layer defaulted to its original co-ordinates and all the values were null.


I have done the formula but im not sure how to prove this by induction. Can anyone provide me a solution to this part? (solution was not provided)    $$a_n=\frac{n}{4n+1}$$ is the explicit formula I got.

For $n \ge 1$, let   $$a_n = \dfrac1{1 \cdot 5} + \dfrac1{5 \cdot 9} + \cdots + \dfrac1{(4n-3)(4n+1)}.$$   Guess a simple explicit formula for $a_n$ and prove it by induction.   So I have guessed the formula as : $$\frac{n}{4n+1}$$   But wasn't sure how to prove it by induction


Where can I set a vanity URL for my Google+ profile? Ideally I would like to be able to have my current profiles.google.com URL brought over in case Google decide the profiles are now valid for Google Plus.  I've seen services such as gplus.to and plus.ly but neither are official means.  From my searches I also don't think it's currently available (infered from the lack of results).  I could have it like profiles.google.com/me (which you could choose here: ). But this link does not work anymore (IMHO because profiles.google.com is being integrated into Google+)

I see that Google and Blogger and maybe other have a customized Google Plus URL.  Ex:


I've seen many SE users (even high-reputation and experienced users) upvoting to counter a previous downvote. This mean many up-votes are being cast based on the fact that someone else dislikes the question.  This leads to a biased voting system. I understand this encourages new users to continue using SE. But votes based on another's vote is not constructive at all.   Analogy (TL;DR): You work for the local jury. A defendant is brought into court for some legitimate crime they committed. But you dislike the prosecutor, so you vote to release the defendant.  Is this proper use of upvoting?

The other day I saw an answer which was ok. Not great but not bad. So no reason to upvote or downvote. However the answer already had a single downvote. I felt this was unfair so upvoted the answer to keep it at what I felt was a fair score. It wasn't until afterward that it occurred to me that I should have perhaps solely voted on the content of the answer.  Is this a reasonable reason for an upvote or should I have left the answer alone?


Apart from computer savvy or geeks,I am looking for the most appropriate English word for someone who is addicted to Internet?

Is there any specific word for a person who is always online on the Internet?  I am just curious to know because staying online is like a profession nowadays.


$curr_date = date('2015-01-28 14:23:02'); $deadtime= date('2015-01-26 15:11:00');   I am in trouble buddies? I have a difficulty in getting the minutes difference of current date to deadtime date. Can you help me with the formula? Thanks in Advance

How to calculate minute difference between two date-times in PHP?


I committed a big mistake. I issued the following command on my terminal  sudo apt-get purge python   I didn't read what it removed :(  I use LaTeX typesetting system and some of it's packages are not working now. I've asked my question .  If I've lost the python files, is it needed to reinstall the full OS or something else might help me out of this?    Log -  Start-Date: 2019-08-17  13:55:17 Commandline: apt-get purge python Requested-By: ubuntu (1000) Purge: python-webencodings:amd64 (0.5-2), python-six:amd64 (1.11.0-2), python-matplotlib:amd64 (2.1.1-2ubuntu3), vprerex:amd64 (1:6.5.1-1), python-cycler:amd64 (0.10.0-1), feynmf:amd64 (1.08-10), fragmaster:amd64 (1.7-5), python-xdg:amd64 (0.25-4ubuntu1), python-gi:amd64 (3.26.1-2ubuntu1), latex-cjk-all:amd64 (4.8.4+git20170127-2), python-tk:amd64 (2.7.16-2~18.04.york0), python-tz:amd64 (2018.3-2), python-dbus:amd64 (1.2.6-1), python-chardet:amd64 (3.0.4-1), texlive-pictures:amd64 (2017.20180305-1), python-pyparsing:amd64 (2.2.0+dfsg1-2), python-subprocess32:amd64 (3.2.7-3), python:amd64 (2.7.16-1~18.04.york0), python-lxml:amd64 (4.2.1-1ubuntu0.1), python-enum34:amd64 (1.1.6-2), texlive-xetex:amd64 (2017.20180305-1), qbittorrent:amd64 (4.0.3-1), lyx:amd64 (2.2.4-0ubuntu0.18.04.1), texlive-latex-extra:amd64 (2017.20180305-2), python-cryptography:amd64 (2.1.4-1ubuntu1.3), python-crypto:amd64 (2.6.1-8ubuntu2), texlive-music:amd64 (2017.20180305-2), python-keyrings.alt:amd64 (3.0-1), python-cffi-backend:amd64 (1.11.5-1), python-ipaddress:amd64 (1.0.17-1), python-olefile:amd64 (0.45.1-1), prerex:amd64 (6.5.4-1), texlive-lang-other:amd64 (2017.20180305-1), texlive-full:amd64 (2017.20180305-1), python-scour:amd64 (0.36-2), python-pkg-resources:amd64 (39.0.1-2), python-html5lib:amd64 (0.999999999-1), python-all:amd64 (2.7.16-1~18.04.york0), inkscape:amd64 (0.92.3-1), python-bs4:amd64 (4.6.0-1), texlive-pstricks:amd64 (2017.20180305-2), python-secretstorage:amd64 (2.3.1-2), python-dev:amd64 (2.7.16-1~18.04.york0), python-setuptools:amd64 (39.0.1-2), python-keyring:amd64 (10.6.0-1), lyx-common:amd64 (2.2.4-0ubuntu0.18.04.1), texlive-formats-extra:amd64 (2017.20180305-2), python-idna:amd64 (2.6-1), python-wheel:amd64 (0.30.0-0.2), texlive-science:amd64 (2017.20180305-2), asymptote:amd64 (2.41-4), python-dateutil:amd64 (2.6.1-1), latex-cjk-thai:amd64 (4.8.4+git20170127-2), python-numpy:amd64 (1:1.13.3-2ubuntu1), texlive-extra-utils:amd64 (2017.20180305-2), python-pil:amd64 (5.1.0-1), python-pip:amd64 (9.0.1-2.3~ubuntu1.18.04.1), python-asn1crypto:amd64 (0.24.0-1), python-backports.functools-lru-cache:amd64 (1.4-2), python-all-dev:amd64 (2.7.16-1~18.04.york0) End-Date: 2019-08-17  13:59:03

Yeah, I did this, it was stupid.  I did not know it will pull its dependencies with it, I just wanted to install python 2 and 3 from scratch (because of this problem: ).  Now, I still can use my terminal, checked these answers:      However after running sudo apt-get install ubuntu-desktop I get these errors:  Setting up python-ldb (2:1.1.24-1ubuntu3) ... /var/lib/dpkg/info/python-ldb.postinst: 6: /var/lib/dpkg/info/python-ldb.postinst: pycompile: not found dpkg: error processing package python-ldb (--configure):  subprocess installed post-installation script returned error exit status 127 No apport report written because MaxReports is reached already                                                               Setting up python-tdb (1.3.8-2) ... /var/lib/dpkg/info/python-tdb.postinst: 6: /var/lib/dpkg/info/python-tdb.postinst: pycompile: not found dpkg: error processing package python-tdb (--configure):  subprocess installed post-installation script returned error exit status 127 No apport report written because MaxReports is reached already                                                               dpkg: dependency problems prevent configuration of python-samba:  python-samba depends on python-crypto; however:   Package python-crypto is not configured yet.  python-samba depends on python-ldb (>= 1.1.2~); however:   Package python-ldb is not configured yet.  python-samba depends on python-tdb; however:   Package python-tdb is not configured yet.  dpkg: error processing package python-samba (--configure):  dependency problems - leaving unconfigured No apport report written because MaxReports is reached already                                                               Processing triggers for libc-bin (2.23-0ubuntu7) ...  Errors were encountered while processing:  mercurial-common  python-crypto  python-dnspython  python-ldb  python-tdb  python-samba E: Sub-process /usr/bin/dpkg returned an error code (1)   What is the way to restore these dependencies (16.04 LTS)?


What I'm Trying to Do  I have a SQL table that has a list of job opportunities for a client's website.  I am trying to create a search form but not all the fields will necessarily be filled in.  The possible values are:  title = the title of the job  location = the location of the job  sal1 = the bottom bracket of the desired salary  sal2 = the top bracket of the desired salary  The Code  $query = 'SELECT * FROM `jobs`';  if($_GET['title']!='') $query.= ' AND `title` LIKE %'.$_GET['title']; if($_GET['location']!='') $query.= ' AND `location`='.$_GET['location']; if($_GET['sal1']!='') $query.= ' AND `sal1`>='.$_GET['sal1']; if($_GET['sal2']!='') $query.= ' AND `sal2`<='.$_GET['sal2'];  $stmt=$dbh->prepare($query.' ORDER BY `date` DESC'); $stmt->execute();   The Issue  On paper this method should work, but I would prefer to use prepared statements. The only method of doing this seems to be using mysql_real_escape_string() on each $_GET variable, as I can't figure out how to use execute(array($val1,$val2...)) when I don't know how many variables are in use.  If possible, how can I utilised prepared statements to sanitize the $_GET variables?

Here's my attempt at it:  $query = $database->prepare('SELECT * FROM table WHERE column LIKE "?%"');  $query->execute(array('value'));  while ($results = $query->fetch())  {     echo $results['column']; }


How do I make a new version of the ubuntu-18.04-live-server-amd64.iso with an updated version of the installer (in particular curtin).  I need to do this because I am experiencing a bug that was fixed in curtin version18.1-17-gae48e86f-0ubuntu1 but no new ISO's have been released yet.  Bug Report:   Fixed In:   Edit: I would use the alternate installer except it suffers from another bug () that also effects me.  Edit: Ended up using the alternative installer and removed all drives, except the OS drive to avoid the bug above.

I would like to customize Ubuntu live CD by installing some additional packages. I have followed   but it doesn't seems to work. Can anyone provide clear instructions?   Note: I do not prefer Remastersys, manual way will be appreciated.  Customization  Packages that I want to install:   Thunderbird    Samba    SSH       Changes that I need:   Remove Games menu from the Application menu Firefox shortcut on Desktop Radiance as the default Theme Different default Ubuntu Wallpaper   Configuration file changes   I want the panel to be placed at the bottom I want to paste my Samba configuration file instead of default Samba configuration I have few Firefox shortcuts and folders I would like to show that in Desktop Also it will be nice if you say me how to change the icon sets   Recent Updates   I have customized Ubuntu 10.10 with Firefox shortcuts and few folders on desktops. Everything went smooth. But the installer gets crashes after choosing the timezone. How do i fix this issue? Also setting wallpaper affects the login screen. The wallpaper which i set is displayed on the login screen also. I just want the default one for the login screen.


They seemed a nice couple.  They seemed to be a nice couple.  They seemed like a nice couple.   Are they all correct?

I am wondering if the explanations correct and whether what is the difference between different "seems".   He seems happy. He seems a happy fellow. He seems to be a happy fellow. He seems to work hard. He seemed to be happy   "Seem" also enters into an 'impersonal' construction which employs 1) the 'dummy' subject it + an active tensed form with "seem", followed by 2) a that clause (sometimes called a 'content' clause) which expresses the assertion which is hedged or qualified.   It seems that he is happy (but he may not be).  It seemed that he was a happy fellow (but he wasn't).  It will seem that he is working hard (but he will in fact be spending his time answering questions on ELL instead of working).  He is seemed to be something.


We can see that  1^2 =1 ; 2^2 =2+2 ; 3^2=3+3+3 ; . . . x^2=x+x+x+..... (x times)  differentiation on both sides gives  2x=1+1+1+....... (x times)  2x=x  What's happening hear.How is this possible.  Assume X be as integer and non-integer ,both cases.

Consider the following:   $1 = 1^2$ $2 + 2 = 2^2$ $3 + 3 + 3 = 3^2$   Therefore,   $\underbrace{x + x + x + \ldots + x}_{x \textrm{ times}}= x^2$   Take the derivative of lhs and rhs and we get:   $\underbrace{1 + 1 + 1 + \ldots + 1}_{x \textrm{ times}} = 2x$   Which simplifies to:   $x = 2x$   and hence    $1 = 2$.     Clearly something is wrong but I am unable pinpoint my mistake.


Let $q:X \rightarrow Y$ and $r:Y \rightarrow Z$ be covering maps and $p= r  \circ q$. If $r^{-1}(z)$ is finite for all $z \in Z$, then $p$ is a covering map.  Now I found the following proof:  Let $z \in U_z$ where $U_z$ is some open set that is evenly covered by $r$. Let $\{V_1,...,V_k\}$ be a partition of slices with $y_i \in V_i$ with $r(y_i)=z$. Then there exists for all $y_i$ an open set $W_i$ that is evenly covered by $q$ and without loss of generality $W_i \subset V_i$. Set $U :=r(W_1) \cap...\cap r(W_k)$ which is open in $Z$, due to the fact that covering maps are open, then $U$ is evenly covered by $p$.  I don't get it why $U$ works. I mean, it is not that clear to me why $r^{-1}(U) \subset W_i$? But we should have $r^{-1}(U) \subset W_i$ in order to be sure that $r^{-1}(U)$ is evenly covered by $q$.

This problem was posted before, but not the proof (because the asker knowed the answer), only a counterexample without the hypothesis of finite fibres.  I want to know how to prove this proposition:  Let $q:X\to Y$ and $r:Y\to Z$ be covering maps. Let's suppose that for each $z\in Z$ , the set $ r^{-1}(z)$ is finite, then the composition $p = r\circ q$ is also a covering map. Well I have to consider $z\in Z$ and show that there exist a neighborhood that is evenly covered by $p$, I know that there exist a neighborhood $U$ that is evenly covered by $r$, I think that this will be the desired neighborhood. First of all $ r^{-1}(U) = \cup_{i=1}^{n}  V_i $ (it's easy to see that the unions is finite using the fact that the fibres are finite and this is a local homeomorphism between the $V_i$) Then $ p^{-1}(U)=q^{-1} (r^{-1}(U) ) = q^{-1}(\cup_{i=1}^{n}  V_i)=\cup_{i=1}^{n}  q^{-1}(V_i) $ With $ q^{-1}(V_i) \cong V_i$ under $q$ and so $\cong$ U under $p$ I never used the fact that the preimage is finite, so my proof is obviously not correct, please help me with this